/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/clever.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:13,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:13,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:13,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:13,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:13,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:13,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:13,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:13,381 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:13,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:13,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:13,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:13,381 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:13,381 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:13,382 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:13,382 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:13,383 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:13,383 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:13,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:13,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:13,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:13,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:13,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:13,385 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:13,385 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:13,385 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:13,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:13,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:13,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:13,617 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:13,618 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:13,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl [2025-04-26 16:54:13,619 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/clever.wvr.bpl' [2025-04-26 16:54:13,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:13,636 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:13,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:13,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:13,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,670 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:13,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:13,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:13,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:13,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:13,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:13,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:13,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:13,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/1) ... [2025-04-26 16:54:13,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:13,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:13,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:54:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:54:13,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:54:13,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:54:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:54:13,747 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:54:13,747 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:13,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:13,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:13,748 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:13,784 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:13,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:13,852 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:13,852 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:13,859 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:13,859 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:13,861 INFO L201 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13 BoogieIcfgContainer [2025-04-26 16:54:13,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:13,862 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:13,862 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:13,867 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:13,868 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,868 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:13" (1/2) ... [2025-04-26 16:54:13,869 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38149ed8 and model type clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:13, skipping insertion in model container [2025-04-26 16:54:13,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:13,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:13" (2/2) ... [2025-04-26 16:54:13,870 INFO L376 chiAutomizerObserver]: Analyzing ICFG clever.wvr.bpl [2025-04-26 16:54:13,914 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:54:13,952 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,956 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:13,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:14,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 28 transitions, 70 flow [2025-04-26 16:54:14,030 INFO L116 PetriNetUnfolderBase]: 3/24 cut-off events. [2025-04-26 16:54:14,032 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:54:14,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 3/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:54:14,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 28 transitions, 70 flow [2025-04-26 16:54:14,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 60 flow [2025-04-26 16:54:14,038 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 24 transitions, 60 flow [2025-04-26 16:54:14,043 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:14,086 WARN L140 AmpleReduction]: Number of pruned transitions: 33 [2025-04-26 16:54:14,086 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:14,086 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 11 [2025-04-26 16:54:14,086 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:21 [2025-04-26 16:54:14,086 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:28 [2025-04-26 16:54:14,087 WARN L145 AmpleReduction]: Times succ was already a loop node:6 [2025-04-26 16:54:14,087 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:15 [2025-04-26 16:54:14,087 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:14,088 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 61 states, 59 states have (on average 1.4745762711864407) internal successors, (in total 87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,095 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:14,096 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:14,096 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:14,097 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:14,097 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:14,097 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:14,097 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:14,097 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:14,099 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 59 states have (on average 1.4745762711864407) internal successors, (in total 87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,110 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 45 [2025-04-26 16:54:14,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,111 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:14,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:14,113 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:14,113 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 59 states have (on average 1.4745762711864407) internal successors, (in total 87), 60 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,115 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 45 [2025-04-26 16:54:14,115 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,115 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:54:14,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:14,119 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->L43: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_k1_3) (= v_i1_5 v_k2_3)) InVars {i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} OutVars{i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} AuxVars[] AssignedVars[]" "[37] L43-->L44: Formula: (<= 0 v_m_4) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:54:14,119 INFO L754 eck$LassoCheckResult]: Loop: "[59] L20-->L21: Formula: (< v_i1_1 v_n_1) InVars {i1=v_i1_1, n=v_n_1} OutVars{i1=v_i1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[61] L21-->L22-1: Formula: (= v_j1_1 0) InVars {} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[j1]" "[62] L22-1-->L26: Formula: (<= v_m_2 v_j1_5) InVars {m=v_m_2, j1=v_j1_5} OutVars{m=v_m_2, j1=v_j1_5} AuxVars[] AssignedVars[]" "[64] L26-->L20: Formula: (= v_i1_2 (+ v_i1_3 1)) InVars {i1=v_i1_3} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1]" [2025-04-26 16:54:14,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 80984, now seen corresponding path program 1 times [2025-04-26 16:54:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455886709] [2025-04-26 16:54:14,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2741797, now seen corresponding path program 1 times [2025-04-26 16:54:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469743777] [2025-04-26 16:54:14,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:14,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:14,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,216 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1777798908, now seen corresponding path program 1 times [2025-04-26 16:54:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142658052] [2025-04-26 16:54:14,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:14,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:14,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:54:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:54:14,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,326 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:14,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,328 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,329 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:54:14,329 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,329 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,380 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,450 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:14,451 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:14,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:14,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:14,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:14,476 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:14,476 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {j1=0} Honda state: {j1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:14,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:54:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:14,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:14,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:14,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:54:14,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:14,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:14,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:14,575 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:14,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:54:14,580 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,580 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,580 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,580 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:14,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:54:14,581 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,581 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,634 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:14,643 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:14,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:14,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:14,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:14,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:14,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:54:14,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,689 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:14,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:14,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:14,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:14,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:14,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:14,712 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:14,712 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:54:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:14,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:14,739 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:14,741 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:54:14,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:14,743 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:54:14,743 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:14,744 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2025-04-26 16:54:14,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:54:14,752 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:14,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:14,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:14,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:14,845 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:14,846 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 61 states, 59 states have (on average 1.4745762711864407) internal successors, (in total 87), 60 states have internal predecessors, (87), 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 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 16:54:14,922 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 61 states, 59 states have (on average 1.4745762711864407) internal successors, (in total 87), 60 states have internal predecessors, (87), 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 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 121 states and 180 transitions. Complement of second has 7 states. [2025-04-26 16:54:14,923 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 16:54:14,927 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 16:54:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2025-04-26 16:54:14,932 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:54:14,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:54:14,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:54:14,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 180 transitions. [2025-04-26 16:54:14,937 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 16:54:14,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 83 states and 124 transitions. [2025-04-26 16:54:14,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2025-04-26 16:54:14,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-04-26 16:54:14,944 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 124 transitions. [2025-04-26 16:54:14,944 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:14,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 124 transitions. [2025-04-26 16:54:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 124 transitions. [2025-04-26 16:54:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2025-04-26 16:54:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5194805194805194) internal successors, (in total 117), 76 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-04-26 16:54:14,968 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-04-26 16:54:14,968 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-04-26 16:54:14,968 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:14,968 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 117 transitions. [2025-04-26 16:54:14,969 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 16:54:14,969 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,969 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:54:14,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:14,969 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->L43: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_k1_3) (= v_i1_5 v_k2_3)) InVars {i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} OutVars{i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} AuxVars[] AssignedVars[]" "[37] L43-->L44: Formula: (<= 0 v_m_4) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[59] L20-->L21: Formula: (< v_i1_1 v_n_1) InVars {i1=v_i1_1, n=v_n_1} OutVars{i1=v_i1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[61] L21-->L22-1: Formula: (= v_j1_1 0) InVars {} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[j1]" [2025-04-26 16:54:14,970 INFO L754 eck$LassoCheckResult]: Loop: "[63] L22-1-->L23: Formula: (< v_j1_2 v_m_1) InVars {m=v_m_1, j1=v_j1_2} OutVars{m=v_m_1, j1=v_j1_2} AuxVars[] AssignedVars[]" "[65] L23-->L24: Formula: (= v_k1_1 (+ v_k1_2 1)) InVars {k1=v_k1_2} OutVars{k1=v_k1_1} AuxVars[] AssignedVars[k1]" "[66] L24-->L22-1: Formula: (= (+ v_j1_4 1) v_j1_3) InVars {j1=v_j1_4} OutVars{j1=v_j1_3} AuxVars[] AssignedVars[j1]" [2025-04-26 16:54:14,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash 77827514, now seen corresponding path program 1 times [2025-04-26 16:54:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662560893] [2025-04-26 16:54:14,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:14,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,979 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:14,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:14,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 92415, now seen corresponding path program 1 times [2025-04-26 16:54:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778932903] [2025-04-26 16:54:14,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:14,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:14,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -722807642, now seen corresponding path program 1 times [2025-04-26 16:54:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067565466] [2025-04-26 16:54:14,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,051 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,051 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:15,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:54:15,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,051 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,083 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,083 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,086 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:15,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:15,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:15,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:15,111 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:15,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,136 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:15,136 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {k1=0} Honda state: {k1=0} Generalized eigenvectors: [{k1=7}, {k1=2}, {k1=-8}] Lambdas: [1, 5, 1] Nus: [0, 1] [2025-04-26 16:54:15,142 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 16:54:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,144 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 16:54:15,145 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 16:54:15,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:15,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,162 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 16:54:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,164 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 16:54:15,165 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 16:54:15,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:15,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,229 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:15,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,234 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,234 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,234 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,234 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,234 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,234 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,234 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,234 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,234 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:54:15,234 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,234 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,265 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,265 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,267 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 16:54:15,268 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 16:54:15,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,282 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,290 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 16:54:15,291 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 16:54:15,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,307 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,309 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:15,310 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:54:15,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,312 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 16:54:15,313 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 16:54:15,314 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,317 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:54:15,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,318 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:54:15,318 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,318 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, m) = -1*j1 + 1*m Supporting invariants [] [2025-04-26 16:54:15,325 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 16:54:15,326 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:54:15,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:54:15,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:15,381 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:15,381 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 117 transitions. cyclomatic complexity: 51 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,421 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 117 transitions. cyclomatic complexity: 51. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 238 states and 346 transitions. Complement of second has 7 states. [2025-04-26 16:54:15,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-26 16:54:15,424 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:54:15,424 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,425 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:54:15,425 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,425 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 16:54:15,425 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 346 transitions. [2025-04-26 16:54:15,428 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 42 [2025-04-26 16:54:15,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 145 states and 219 transitions. [2025-04-26 16:54:15,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-04-26 16:54:15,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2025-04-26 16:54:15,432 INFO L74 IsDeterministic]: Start isDeterministic. Operand 145 states and 219 transitions. [2025-04-26 16:54:15,432 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 145 states and 219 transitions. [2025-04-26 16:54:15,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 219 transitions. [2025-04-26 16:54:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 94. [2025-04-26 16:54:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.5319148936170213) internal successors, (in total 144), 93 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2025-04-26 16:54:15,439 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-04-26 16:54:15,439 INFO L438 stractBuchiCegarLoop]: Abstraction has 94 states and 144 transitions. [2025-04-26 16:54:15,439 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:15,439 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 144 transitions. [2025-04-26 16:54:15,440 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 16:54:15,440 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,440 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,440 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->L43: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_k1_3) (= v_i1_5 v_k2_3)) InVars {i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} OutVars{i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} AuxVars[] AssignedVars[]" "[37] L43-->L44: Formula: (<= 0 v_m_4) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[58] L20-->thread1FINAL: Formula: (<= v_n_2 v_i1_4) InVars {i1=v_i1_4, n=v_n_2} OutVars{i1=v_i1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[60] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[77] L44-1-->L33: 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 16:54:15,441 INFO L754 eck$LassoCheckResult]: Loop: "[68] L33-->L34: Formula: (< v_i2_1 v_n_3) InVars {i2=v_i2_1, n=v_n_3} OutVars{i2=v_i2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[70] L34-->L35: Formula: (= v_k2_1 (+ v_k2_2 v_m_3)) InVars {m=v_m_3, k2=v_k2_2} OutVars{m=v_m_3, k2=v_k2_1} AuxVars[] AssignedVars[k2]" "[71] L35-->L33: Formula: (= v_i2_2 (+ v_i2_3 1)) InVars {i2=v_i2_3} OutVars{i2=v_i2_2} AuxVars[] AssignedVars[i2]" [2025-04-26 16:54:15,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1882315277, now seen corresponding path program 1 times [2025-04-26 16:54:15,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001912392] [2025-04-26 16:54:15,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:15,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:15,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,446 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:15,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:15,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash 97380, now seen corresponding path program 1 times [2025-04-26 16:54:15,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024586807] [2025-04-26 16:54:15,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,458 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -961332942, now seen corresponding path program 1 times [2025-04-26 16:54:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284164418] [2025-04-26 16:54:15,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:15,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:15,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:15,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284164418] [2025-04-26 16:54:15,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284164418] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:15,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:54:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324659759] [2025-04-26 16:54:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:15,544 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,544 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,544 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,544 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,544 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:15,544 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,544 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,544 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,544 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:54:15,545 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,545 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,574 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,574 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:15,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,576 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 16:54:15,578 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 16:54:15,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:15,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,591 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:54:15,591 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, k2=0} Honda state: {m=0, k2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:54:15,596 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 16:54:15,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,598 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 16:54:15,599 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 16:54:15,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:15,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,617 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 16:54:15,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,619 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 16:54:15,619 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 16:54:15,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:15,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:15,681 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:15,686 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 16:54:15,686 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,686 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,686 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,686 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,686 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,686 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,686 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,686 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,686 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:54:15,686 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,686 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,711 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,711 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,713 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 16:54:15,715 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 16:54:15,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,733 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 16:54:15,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,735 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 16:54:15,737 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 16:54:15,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:15,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,752 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:15,753 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:54:15,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,754 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 16:54:15,756 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 16:54:15,756 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,759 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 16:54:15,759 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:54:15,759 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,759 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 1*n Supporting invariants [] [2025-04-26 16:54:15,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,765 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:15,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:15,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,800 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:15,819 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:15,819 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 144 transitions. cyclomatic complexity: 63 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,859 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 144 transitions. cyclomatic complexity: 63. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 181 states and 278 transitions. Complement of second has 6 states. [2025-04-26 16:54:15,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:15,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:54:15,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:54:15,860 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,860 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:54:15,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,861 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 6 letters. Loop has 6 letters. [2025-04-26 16:54:15,861 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181 states and 278 transitions. [2025-04-26 16:54:15,862 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:54:15,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181 states to 133 states and 202 transitions. [2025-04-26 16:54:15,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-04-26 16:54:15,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-04-26 16:54:15,863 INFO L74 IsDeterministic]: Start isDeterministic. Operand 133 states and 202 transitions. [2025-04-26 16:54:15,863 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 133 states and 202 transitions. [2025-04-26 16:54:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 202 transitions. [2025-04-26 16:54:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2025-04-26 16:54:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.512) internal successors, (in total 189), 124 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2025-04-26 16:54:15,867 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 189 transitions. [2025-04-26 16:54:15,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:15,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:54:15,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:54:15,869 INFO L87 Difference]: Start difference. First operand 125 states and 189 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:15,911 INFO L93 Difference]: Finished difference Result 166 states and 251 transitions. [2025-04-26 16:54:15,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 166 states and 251 transitions. [2025-04-26 16:54:15,913 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:54:15,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 166 states to 166 states and 251 transitions. [2025-04-26 16:54:15,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-04-26 16:54:15,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-04-26 16:54:15,918 INFO L74 IsDeterministic]: Start isDeterministic. Operand 166 states and 251 transitions. [2025-04-26 16:54:15,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:15,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 166 states and 251 transitions. [2025-04-26 16:54:15,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 251 transitions. [2025-04-26 16:54:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 125. [2025-04-26 16:54:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.512) internal successors, (in total 189), 124 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 189 transitions. [2025-04-26 16:54:15,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 189 transitions. [2025-04-26 16:54:15,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:15,929 INFO L438 stractBuchiCegarLoop]: Abstraction has 125 states and 189 transitions. [2025-04-26 16:54:15,929 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:15,929 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 189 transitions. [2025-04-26 16:54:15,930 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:54:15,930 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,930 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:54:15,931 INFO L752 eck$LassoCheckResult]: Stem: "[52] $Ultimate##0-->L43: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_k1_3) (= v_i1_5 v_k2_3)) InVars {i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} OutVars{i1=v_i1_5, i2=v_i2_5, k1=v_k1_3, k2=v_k2_3} AuxVars[] AssignedVars[]" "[37] L43-->L44: Formula: (<= 0 v_m_4) InVars {m=v_m_4} OutVars{m=v_m_4} AuxVars[] AssignedVars[]" "[74] L44-->L20: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[59] L20-->L21: Formula: (< v_i1_1 v_n_1) InVars {i1=v_i1_1, n=v_n_1} OutVars{i1=v_i1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[61] L21-->L22-1: Formula: (= v_j1_1 0) InVars {} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[j1]" "[62] L22-1-->L26: Formula: (<= v_m_2 v_j1_5) InVars {m=v_m_2, j1=v_j1_5} OutVars{m=v_m_2, j1=v_j1_5} AuxVars[] AssignedVars[]" "[64] L26-->L20: Formula: (= v_i1_2 (+ v_i1_3 1)) InVars {i1=v_i1_3} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1]" "[59] L20-->L21: Formula: (< v_i1_1 v_n_1) InVars {i1=v_i1_1, n=v_n_1} OutVars{i1=v_i1_1, n=v_n_1} AuxVars[] AssignedVars[]" "[61] L21-->L22-1: Formula: (= v_j1_1 0) InVars {} OutVars{j1=v_j1_1} AuxVars[] AssignedVars[j1]" [2025-04-26 16:54:15,931 INFO L754 eck$LassoCheckResult]: Loop: "[63] L22-1-->L23: Formula: (< v_j1_2 v_m_1) InVars {m=v_m_1, j1=v_j1_2} OutVars{m=v_m_1, j1=v_j1_2} AuxVars[] AssignedVars[]" "[65] L23-->L24: Formula: (= v_k1_1 (+ v_k1_2 1)) InVars {k1=v_k1_2} OutVars{k1=v_k1_1} AuxVars[] AssignedVars[k1]" "[66] L24-->L22-1: Formula: (= (+ v_j1_4 1) v_j1_3) InVars {j1=v_j1_4} OutVars{j1=v_j1_3} AuxVars[] AssignedVars[j1]" [2025-04-26 16:54:15,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -932231330, now seen corresponding path program 2 times [2025-04-26 16:54:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788262312] [2025-04-26 16:54:15,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-26 16:54:15,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:15,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:15,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:15,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:15,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash 92415, now seen corresponding path program 2 times [2025-04-26 16:54:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532816253] [2025-04-26 16:54:15,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,950 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:15,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:15,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:15,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,953 INFO L85 PathProgramCache]: Analyzing trace with hash -844953470, now seen corresponding path program 1 times [2025-04-26 16:54:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811404325] [2025-04-26 16:54:15,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:15,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:16,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811404325] [2025-04-26 16:54:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811404325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:16,050 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029881094] [2025-04-26 16:54:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,053 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-26 16:54:16,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:54:16,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:54:16,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029881094] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:16,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:16,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-26 16:54:16,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898916523] [2025-04-26 16:54:16,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:16,158 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,158 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:54:16,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:54:16,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,158 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,184 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,184 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:54:16,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,187 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:54:16,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:54:16,192 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:16,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:54:16,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,210 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:54:16,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:54:16,212 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:54:16,276 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:54:16,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:54:16,280 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,280 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,280 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,280 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,280 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,280 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,280 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,280 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,280 INFO L132 ssoRankerPreferences]: Filename of dumped script: clever.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:54:16,281 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,281 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,307 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,308 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,309 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:16,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,323 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,325 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:54:16,325 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:54:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,330 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:16,334 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,336 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:54:16,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:54:16,337 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:54:16,337 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,337 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j1, m) = -1*j1 + 1*m Supporting invariants [] [2025-04-26 16:54:16,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:54:16,343 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,390 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:16,390 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,411 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 247 states and 355 transitions. Complement of second has 7 states. [2025-04-26 16:54:16,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:16,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 16:54:16,412 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:54:16,412 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,412 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:16,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:16,456 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,474 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 247 states and 355 transitions. Complement of second has 7 states. [2025-04-26 16:54:16,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 16:54:16,475 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:54:16,475 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,475 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:16,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:54:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:54:16,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,503 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:16,518 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:16,518 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,546 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 189 transitions. cyclomatic complexity: 81. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 260 states and 381 transitions. Complement of second has 6 states. [2025-04-26 16:54:16,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 16:54:16,547 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 16:54:16,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 12 letters. Loop has 3 letters. [2025-04-26 16:54:16,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 16:54:16,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 381 transitions. [2025-04-26 16:54:16,550 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:16,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 0 states and 0 transitions. [2025-04-26 16:54:16,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:16,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:16,550 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,550 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:16,550 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:16,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-26 16:54:16,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-26 16:54:16,553 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (in total 21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:16,553 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 16:54:16,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:16,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 16:54:16,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:16,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:16,554 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,554 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:16,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 16:54:16,555 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:16,555 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:16,555 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:16,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:16,555 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:16,565 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 16:54:16,566 INFO L201 PluginConnector]: Adding new model clever.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:16 BoogieIcfgContainer [2025-04-26 16:54:16,566 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:16,566 INFO L158 Benchmark]: Toolchain (without parser) took 2930.39ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.8MB in the beginning and 63.1MB in the end (delta: 32.7MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2025-04-26 16:54:16,566 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.20ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 93.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,567 INFO L158 Benchmark]: Boogie Preprocessor took 20.16ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.0MB in the end (delta: 960.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,567 INFO L158 Benchmark]: RCFGBuilder took 168.76ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 84.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:16,567 INFO L158 Benchmark]: BuchiAutomizer took 2703.33ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.8MB in the beginning and 63.1MB in the end (delta: 20.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:16,568 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.18ms. Allocated memory is still 167.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.20ms. Allocated memory is still 167.8MB. Free memory was 95.8MB in the beginning and 93.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.16ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 93.0MB in the end (delta: 960.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 168.76ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 84.0MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2703.33ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 83.8MB in the beginning and 63.1MB in the end (delta: 20.7MB). 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 2.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 106 StatesRemovedByMinimization, 4 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 233 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 145 IncrementalHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 122 mSDtfsCounter, 145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp69 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 140, Number of transitions in reduction automaton: 87, Number of states in reduction automaton: 61, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function n + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * j1 + m and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 4 locations. One nondeterministic module has affine ranking function -1 * j1 + m and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:16,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-26 16:54:16,778 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...