/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:41,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:41,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:41,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:41,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:41,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:41,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:41,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:41,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:41,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:41,463 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:41,464 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:41,464 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:41,464 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:41,464 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:41,464 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:41,464 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:41,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:41,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:41,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:41,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:41,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:41,466 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:41,466 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:41,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:41,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:41,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:41,714 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:41,715 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:41,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl [2025-04-26 16:23:41,719 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-dec.wvr.bpl' [2025-04-26 16:23:41,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:41,736 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:41,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:41,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:41,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:41,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,766 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:41,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:41,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:41,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:41,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:41,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,784 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,794 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:41,795 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:41,795 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:41,795 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:41,796 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/1) ... [2025-04-26 16:23:41,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,822 INFO L229 MonitoredProcess]: Starting monitored process 1 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:23:41,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:41,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:41,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:41,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:41,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:41,844 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:23:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:23:41,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:23:41,845 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:23:41,879 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:41,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:41,970 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:41,970 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:41,992 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:41,993 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:41,993 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:41 BoogieIcfgContainer [2025-04-26 16:23:41,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:41,994 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:41,994 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:41,999 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:42,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:42,000 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:41" (1/2) ... [2025-04-26 16:23:42,001 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@601bf968 and model type min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:42, skipping insertion in model container [2025-04-26 16:23:42,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:42,001 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:41" (2/2) ... [2025-04-26 16:23:42,002 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-dec.wvr.bpl [2025-04-26 16:23:42,045 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:23:42,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 106 flow [2025-04-26 16:23:42,095 INFO L116 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-04-26 16:23:42,097 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:23:42,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 3/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:23:42,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 106 flow [2025-04-26 16:23:42,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 86 flow [2025-04-26 16:23:42,102 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 31 transitions, 86 flow [2025-04-26 16:23:42,110 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:42,110 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:42,110 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:42,110 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:42,110 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:42,110 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:42,110 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:42,110 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:42,111 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:42,239 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 524 [2025-04-26 16:23:42,239 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:42,239 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:42,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:23:42,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:42,242 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:42,243 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 711 states, but on-demand construction may add more states [2025-04-26 16:23:42,283 INFO L131 ngComponentsAnalysis]: Automaton has 206 accepting balls. 524 [2025-04-26 16:23:42,283 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:42,283 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:42,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:23:42,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:42,293 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L68-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[105] L69-->L51-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:23:42,293 INFO L754 eck$LassoCheckResult]: Loop: "[92] L51-1-->L51: Formula: (< v_l_2 v_N_5) InVars {l=v_l_2, N=v_N_5} OutVars{l=v_l_2, N=v_N_5} AuxVars[] AssignedVars[]" "[94] L51-->L51-1: Formula: (and (= v_l_7 (+ v_l_8 1)) (= v_A_11 (store v_A_12 v_l_8 (+ (- 1) (select v_A_12 v_l_8))))) InVars {A=v_A_12, l=v_l_8} OutVars{A=v_A_11, l=v_l_7} AuxVars[] AssignedVars[A, l]" [2025-04-26 16:23:42,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 3196670, now seen corresponding path program 1 times [2025-04-26 16:23:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:42,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723250423] [2025-04-26 16:23:42,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:42,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:42,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:42,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:42,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:42,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:42,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:42,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-04-26 16:23:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:42,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3310970] [2025-04-26 16:23:42,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:42,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:42,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:42,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:42,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:42,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:42,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:42,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1222964480, now seen corresponding path program 1 times [2025-04-26 16:23:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:42,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488105163] [2025-04-26 16:23:42,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:42,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:42,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:42,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:42,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:42,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:42,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:42,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:42,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:42,633 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:42,634 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:42,634 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:42,634 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:42,634 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:42,634 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,634 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:42,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:42,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:42,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:42,635 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:42,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:42,815 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:42,818 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:42,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:42,821 INFO L229 MonitoredProcess]: Starting monitored process 2 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:23:42,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:42,826 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:23:42,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:42,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:42,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:42,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:42,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:42,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:42,867 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:42,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:42,877 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:23:42,878 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:23:42,879 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:23:42,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:42,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:42,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:42,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:42,894 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:42,894 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:42,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:42,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:42,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:42,908 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:23:42,909 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:23:42,911 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:23:42,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:42,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:42,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:42,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:42,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:42,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:42,928 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:42,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:42,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:42,936 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:23:42,938 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:23:42,939 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:23:42,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:42,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:42,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:42,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:42,955 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:42,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:42,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:42,974 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:42,974 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:42,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:42,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:42,977 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:23:42,979 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:23:42,980 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:42,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:43,000 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:43,000 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:43,000 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(l, N) = -1*l + 1*N Supporting invariants [] [2025-04-26 16:23:43,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:43,009 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:43,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:43,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:43,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:43,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:43,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:43,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:43,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:43,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:43,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:43,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:43,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:43,097 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:23:43,141 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:23:43,143 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 711 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:43,302 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 711 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2066 states and 8610 transitions. Complement of second has 7 states. [2025-04-26 16:23:43,304 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:23:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:43,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-26 16:23:43,312 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:23:43,312 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:43,312 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:43,312 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:43,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:23:43,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:43,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 8610 transitions. [2025-04-26 16:23:43,342 INFO L131 ngComponentsAnalysis]: Automaton has 166 accepting balls. 366 [2025-04-26 16:23:43,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 1464 states and 6126 transitions. [2025-04-26 16:23:43,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2025-04-26 16:23:43,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1045 [2025-04-26 16:23:43,380 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1464 states and 6126 transitions. [2025-04-26 16:23:43,380 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:43,380 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1464 states and 6126 transitions. [2025-04-26 16:23:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states and 6126 transitions. [2025-04-26 16:23:43,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1050. [2025-04-26 16:23:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1050 states have (on average 4.362857142857143) internal successors, (in total 4581), 1049 states have internal predecessors, (4581), 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:23:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 4581 transitions. [2025-04-26 16:23:43,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1050 states and 4581 transitions. [2025-04-26 16:23:43,456 INFO L438 stractBuchiCegarLoop]: Abstraction has 1050 states and 4581 transitions. [2025-04-26 16:23:43,456 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:43,456 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1050 states and 4581 transitions. [2025-04-26 16:23:43,464 INFO L131 ngComponentsAnalysis]: Automaton has 166 accepting balls. 366 [2025-04-26 16:23:43,464 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:43,464 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:43,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:23:43,464 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:43,465 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min]" "[80] L25-->L27-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1]" [2025-04-26 16:23:43,465 INFO L754 eck$LassoCheckResult]: Loop: "[82] L27-1-->L27: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[84] L27-->L27-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= v_min_5 (let ((.cse0 (select v_A_7 v_i_8))) (ite (< v_min_6 .cse0) v_min_6 .cse0)))) InVars {A=v_A_7, i=v_i_8, min=v_min_6} OutVars{A=v_A_7, i=v_i_7, min=v_min_5} AuxVars[] AssignedVars[i, min]" [2025-04-26 16:23:43,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 3195932, now seen corresponding path program 1 times [2025-04-26 16:23:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:43,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525023899] [2025-04-26 16:23:43,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:43,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:43,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:43,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:43,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:43,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 3587, now seen corresponding path program 1 times [2025-04-26 16:23:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:43,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306547929] [2025-04-26 16:23:43,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:43,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:43,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:43,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,478 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:43,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:43,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:43,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1223674018, now seen corresponding path program 1 times [2025-04-26 16:23:43,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:43,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369196864] [2025-04-26 16:23:43,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:43,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:43,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,490 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:43,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:43,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:43,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:43,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:43,613 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:43,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:43,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:43,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:43,614 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:43,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:43,614 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:43,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:43,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:43,614 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:43,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:43,780 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:43,780 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:43,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,784 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:23:43,785 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:23:43,795 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:23:43,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:43,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:43,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:43,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:43,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:43,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:43,818 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:43,827 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:23:43,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,830 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:23:43,831 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:23:43,832 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:23:43,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:43,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:43,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:43,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:43,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:43,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:43,849 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:43,855 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:23:43,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,857 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:23:43,858 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:23:43,860 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:23:43,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:43,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:43,870 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:43,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:43,878 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:43,878 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:43,891 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:43,897 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:23:43,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,899 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:23:43,902 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:23:43,904 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:23:43,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:43,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:43,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:43,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:43,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:43,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:43,923 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:43,930 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:43,930 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,933 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:23:43,934 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:23:43,934 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:43,952 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:23:43,952 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:43,952 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:43,952 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:23:43,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:43,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:43,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:43,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:43,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:43,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:43,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:43,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:43,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:43,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:43,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:43,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:44,012 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:23:44,013 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:23:44,013 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1050 states and 4581 transitions. cyclomatic complexity: 3790 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:44,109 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1050 states and 4581 transitions. cyclomatic complexity: 3790. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3011 states and 14036 transitions. Complement of second has 6 states. [2025-04-26 16:23:44,109 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:23:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:44,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 16:23:44,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:23:44,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:44,110 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:23:44,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3011 states and 14036 transitions. [2025-04-26 16:23:44,145 INFO L131 ngComponentsAnalysis]: Automaton has 114 accepting balls. 228 [2025-04-26 16:23:44,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3011 states to 1755 states and 8181 transitions. [2025-04-26 16:23:44,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 646 [2025-04-26 16:23:44,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 851 [2025-04-26 16:23:44,171 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1755 states and 8181 transitions. [2025-04-26 16:23:44,171 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:44,171 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1755 states and 8181 transitions. [2025-04-26 16:23:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states and 8181 transitions. [2025-04-26 16:23:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1430. [2025-04-26 16:23:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1430 states, 1430 states have (on average 4.786013986013986) internal successors, (in total 6844), 1429 states have internal predecessors, (6844), 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:23:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 6844 transitions. [2025-04-26 16:23:44,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1430 states and 6844 transitions. [2025-04-26 16:23:44,209 INFO L438 stractBuchiCegarLoop]: Abstraction has 1430 states and 6844 transitions. [2025-04-26 16:23:44,209 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:44,209 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1430 states and 6844 transitions. [2025-04-26 16:23:44,234 INFO L131 ngComponentsAnalysis]: Automaton has 114 accepting balls. 228 [2025-04-26 16:23:44,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:44,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:44,235 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:44,235 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:44,235 INFO L752 eck$LassoCheckResult]: Stem: "[73] $Ultimate##0-->L68: Formula: (let ((.cse0 (not v_v_assert_1))) (and (= v_i_6 v_k_1) (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_l_1) (or (and v_b2_2 v_v_assert_1) (and .cse0 (not v_b2_2))) .cse0 (or (and (not v_b1_2) .cse0) (and v_b1_2 v_v_assert_1)))) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[99] L68-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[102] L68-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[85] $Ultimate##0-->L38: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max]" "[86] L38-->L40-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2]" [2025-04-26 16:23:44,235 INFO L754 eck$LassoCheckResult]: Loop: "[88] L40-1-->L40: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[90] L40-->L40-1: Formula: (and (= v_max_5 (let ((.cse0 (select v_A_9 v_j_8))) (ite (< .cse0 v_max_6) v_max_6 .cse0))) (= (+ v_j_8 1) v_j_7)) InVars {A=v_A_9, max=v_max_6, j=v_j_8} OutVars{A=v_A_9, max=v_max_5, j=v_j_7} AuxVars[] AssignedVars[j, max]" [2025-04-26 16:23:44,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,236 INFO L85 PathProgramCache]: Analyzing trace with hash 99096236, now seen corresponding path program 1 times [2025-04-26 16:23:44,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735767374] [2025-04-26 16:23:44,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,244 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-04-26 16:23:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122917292] [2025-04-26 16:23:44,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,256 INFO L85 PathProgramCache]: Analyzing trace with hash 742205102, now seen corresponding path program 1 times [2025-04-26 16:23:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759583432] [2025-04-26 16:23:44,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:44,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:44,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:44,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:44,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,394 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:44,394 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:44,394 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:44,394 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:44,394 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:44,394 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,394 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:44,394 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:44,394 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-dec.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:44,394 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:44,394 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:44,395 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,557 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:44,557 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:44,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,559 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:23:44,560 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:23:44,561 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:23:44,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,575 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:44,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,583 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:23:44,585 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:23:44,585 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:23:44,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,599 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,610 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:23:44,611 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:23:44,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:44,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,626 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,631 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:23:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,633 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:23:44,634 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:23:44,635 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:23:44,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,650 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:44,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,658 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:23:44,658 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:23:44,659 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:23:44,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:23:44,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,682 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:23:44,683 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:23:44,684 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:23:44,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,696 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:44,696 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:44,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:44,706 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:44,706 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:23:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,708 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:23:44,710 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:23:44,711 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:44,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:44,728 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:44,728 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:44,728 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, j) = 1*N - 1*j Supporting invariants [] [2025-04-26 16:23:44,734 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:23:44,735 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:44,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:44,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:44,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:44,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:44,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:44,777 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:23:44,777 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:23:44,777 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1430 states and 6844 transitions. cyclomatic complexity: 5685 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:23:44,855 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1430 states and 6844 transitions. cyclomatic complexity: 5685. 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 3789 states and 18252 transitions. Complement of second has 6 states. [2025-04-26 16:23:44,855 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:23:44,857 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:23:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 16:23:44,857 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:23:44,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,857 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:44,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,857 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:23:44,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3789 states and 18252 transitions. [2025-04-26 16:23:44,921 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:44,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3789 states to 0 states and 0 transitions. [2025-04-26 16:23:44,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:44,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:44,922 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:44,922 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:44,922 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,922 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,922 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:44,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:44,922 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:44,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:44,922 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:44,927 INFO L201 PluginConnector]: Adding new model min-max-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:44 BoogieIcfgContainer [2025-04-26 16:23:44,927 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:44,928 INFO L158 Benchmark]: Toolchain (without parser) took 3191.19ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 82.9MB in the beginning and 79.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,928 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.89ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 83.8MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,928 INFO L158 Benchmark]: Boogie Preprocessor took 26.61ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 917.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,928 INFO L158 Benchmark]: RCFGBuilder took 198.58ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:44,929 INFO L158 Benchmark]: BuchiAutomizer took 2933.21ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 69.8MB in the beginning and 79.2MB in the end (delta: -9.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:44,930 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.89ms. Allocated memory is still 155.2MB. Free memory was 84.0MB in the beginning and 83.8MB in the end (delta: 178.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 81.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.61ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 80.0MB in the end (delta: 917.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 198.58ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2933.21ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 69.8MB in the beginning and 79.2MB in the end (delta: -9.4MB). 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.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 739 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 159 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 81 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp79 ukn57 mio100 lsp76 div100 bol100 ite100 ukn100 eq168 hnf95 smp100 dnf135 smp74 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * l + N and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:44,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...