NO ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: l7 0: l0 -> l1 : Result_4^0'=Result_4^post_1, __disjvr_0^0'=__disjvr_0^post_1, cnt_16^0'=cnt_16^post_1, lt_10^0'=lt_10^post_1, lt_9^0'=lt_9^post_1, p_7^0'=p_7^post_1, tmp_8^0'=tmp_8^post_1, x_5^0'=x_5^post_1, y_6^0'=y_6^post_1, [ x_5^post_1==x_5^post_1 && p_7^post_1==x_5^post_1 && Result_4^0==Result_4^post_1 && __disjvr_0^0==__disjvr_0^post_1 && cnt_16^0==cnt_16^post_1 && lt_10^0==lt_10^post_1 && lt_9^0==lt_9^post_1 && tmp_8^0==tmp_8^post_1 && y_6^0==y_6^post_1 ], cost: 1 1: l1 -> l2 : Result_4^0'=Result_4^post_2, __disjvr_0^0'=__disjvr_0^post_2, cnt_16^0'=cnt_16^post_2, lt_10^0'=lt_10^post_2, lt_9^0'=lt_9^post_2, p_7^0'=p_7^post_2, tmp_8^0'=tmp_8^post_2, x_5^0'=x_5^post_2, y_6^0'=y_6^post_2, [ lt_10^1_1==cnt_16^0 && y_6^0-lt_10^1_1<=0 && lt_10^post_2==lt_10^post_2 && Result_4^post_2==Result_4^post_2 && __disjvr_0^0==__disjvr_0^post_2 && cnt_16^0==cnt_16^post_2 && lt_9^0==lt_9^post_2 && p_7^0==p_7^post_2 && tmp_8^0==tmp_8^post_2 && x_5^0==x_5^post_2 && y_6^0==y_6^post_2 ], cost: 1 2: l1 -> l3 : Result_4^0'=Result_4^post_3, __disjvr_0^0'=__disjvr_0^post_3, cnt_16^0'=cnt_16^post_3, lt_10^0'=lt_10^post_3, lt_9^0'=lt_9^post_3, p_7^0'=p_7^post_3, tmp_8^0'=tmp_8^post_3, x_5^0'=x_5^post_3, y_6^0'=y_6^post_3, [ lt_10^1_2==cnt_16^0 && 0<=-1+y_6^0-lt_10^1_2 && lt_10^post_3==lt_10^post_3 && tmp_8^post_3==tmp_8^post_3 && tmp_8^post_3<=0 && 0<=tmp_8^post_3 && Result_4^0==Result_4^post_3 && __disjvr_0^0==__disjvr_0^post_3 && cnt_16^0==cnt_16^post_3 && lt_9^0==lt_9^post_3 && p_7^0==p_7^post_3 && x_5^0==x_5^post_3 && y_6^0==y_6^post_3 ], cost: 1 4: l1 -> l5 : Result_4^0'=Result_4^post_5, __disjvr_0^0'=__disjvr_0^post_5, cnt_16^0'=cnt_16^post_5, lt_10^0'=lt_10^post_5, lt_9^0'=lt_9^post_5, p_7^0'=p_7^post_5, tmp_8^0'=tmp_8^post_5, x_5^0'=x_5^post_5, y_6^0'=y_6^post_5, [ lt_10^1_3==cnt_16^0 && 0<=-1-lt_10^1_3+y_6^0 && lt_10^post_5==lt_10^post_5 && tmp_8^post_5==tmp_8^post_5 && Result_4^0==Result_4^post_5 && __disjvr_0^0==__disjvr_0^post_5 && cnt_16^0==cnt_16^post_5 && lt_9^0==lt_9^post_5 && p_7^0==p_7^post_5 && x_5^0==x_5^post_5 && y_6^0==y_6^post_5 ], cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post_4, __disjvr_0^0'=__disjvr_0^post_4, cnt_16^0'=cnt_16^post_4, lt_10^0'=lt_10^post_4, lt_9^0'=lt_9^post_4, p_7^0'=p_7^post_4, tmp_8^0'=tmp_8^post_4, x_5^0'=x_5^post_4, y_6^0'=y_6^post_4, [ Result_4^0==Result_4^post_4 && __disjvr_0^0==__disjvr_0^post_4 && cnt_16^0==cnt_16^post_4 && lt_10^0==lt_10^post_4 && lt_9^0==lt_9^post_4 && p_7^0==p_7^post_4 && tmp_8^0==tmp_8^post_4 && x_5^0==x_5^post_4 && y_6^0==y_6^post_4 ], cost: 1 5: l5 -> l6 : Result_4^0'=Result_4^post_6, __disjvr_0^0'=__disjvr_0^post_6, cnt_16^0'=cnt_16^post_6, lt_10^0'=lt_10^post_6, lt_9^0'=lt_9^post_6, p_7^0'=p_7^post_6, tmp_8^0'=tmp_8^post_6, x_5^0'=x_5^post_6, y_6^0'=y_6^post_6, [ __disjvr_0^post_6==__disjvr_0^0 && Result_4^0==Result_4^post_6 && __disjvr_0^0==__disjvr_0^post_6 && cnt_16^0==cnt_16^post_6 && lt_10^0==lt_10^post_6 && lt_9^0==lt_9^post_6 && p_7^0==p_7^post_6 && tmp_8^0==tmp_8^post_6 && x_5^0==x_5^post_6 && y_6^0==y_6^post_6 ], cost: 1 6: l6 -> l4 : Result_4^0'=Result_4^post_7, __disjvr_0^0'=__disjvr_0^post_7, cnt_16^0'=cnt_16^post_7, lt_10^0'=lt_10^post_7, lt_9^0'=lt_9^post_7, p_7^0'=p_7^post_7, tmp_8^0'=tmp_8^post_7, x_5^0'=x_5^post_7, y_6^0'=y_6^post_7, [ lt_9^1_1==cnt_16^0 && lt_9^post_7==lt_9^post_7 && Result_4^0==Result_4^post_7 && __disjvr_0^0==__disjvr_0^post_7 && cnt_16^0==cnt_16^post_7 && lt_10^0==lt_10^post_7 && p_7^0==p_7^post_7 && tmp_8^0==tmp_8^post_7 && x_5^0==x_5^post_7 && y_6^0==y_6^post_7 ], cost: 1 7: l4 -> l1 : Result_4^0'=Result_4^post_8, __disjvr_0^0'=__disjvr_0^post_8, cnt_16^0'=cnt_16^post_8, lt_10^0'=lt_10^post_8, lt_9^0'=lt_9^post_8, p_7^0'=p_7^post_8, tmp_8^0'=tmp_8^post_8, x_5^0'=x_5^post_8, y_6^0'=y_6^post_8, [ Result_4^0==Result_4^post_8 && __disjvr_0^0==__disjvr_0^post_8 && cnt_16^0==cnt_16^post_8 && lt_10^0==lt_10^post_8 && lt_9^0==lt_9^post_8 && p_7^0==p_7^post_8 && tmp_8^0==tmp_8^post_8 && x_5^0==x_5^post_8 && y_6^0==y_6^post_8 ], cost: 1 8: l7 -> l0 : Result_4^0'=Result_4^post_9, __disjvr_0^0'=__disjvr_0^post_9, cnt_16^0'=cnt_16^post_9, lt_10^0'=lt_10^post_9, lt_9^0'=lt_9^post_9, p_7^0'=p_7^post_9, tmp_8^0'=tmp_8^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ Result_4^0==Result_4^post_9 && __disjvr_0^0==__disjvr_0^post_9 && cnt_16^0==cnt_16^post_9 && lt_10^0==lt_10^post_9 && lt_9^0==lt_9^post_9 && p_7^0==p_7^post_9 && tmp_8^0==tmp_8^post_9 && x_5^0==x_5^post_9 && y_6^0==y_6^post_9 ], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 8: l7 -> l0 : Result_4^0'=Result_4^post_9, __disjvr_0^0'=__disjvr_0^post_9, cnt_16^0'=cnt_16^post_9, lt_10^0'=lt_10^post_9, lt_9^0'=lt_9^post_9, p_7^0'=p_7^post_9, tmp_8^0'=tmp_8^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ Result_4^0==Result_4^post_9 && __disjvr_0^0==__disjvr_0^post_9 && cnt_16^0==cnt_16^post_9 && lt_10^0==lt_10^post_9 && lt_9^0==lt_9^post_9 && p_7^0==p_7^post_9 && tmp_8^0==tmp_8^post_9 && x_5^0==x_5^post_9 && y_6^0==y_6^post_9 ], cost: 1 Removed unreachable and leaf rules: Start location: l7 0: l0 -> l1 : Result_4^0'=Result_4^post_1, __disjvr_0^0'=__disjvr_0^post_1, cnt_16^0'=cnt_16^post_1, lt_10^0'=lt_10^post_1, lt_9^0'=lt_9^post_1, p_7^0'=p_7^post_1, tmp_8^0'=tmp_8^post_1, x_5^0'=x_5^post_1, y_6^0'=y_6^post_1, [ x_5^post_1==x_5^post_1 && p_7^post_1==x_5^post_1 && Result_4^0==Result_4^post_1 && __disjvr_0^0==__disjvr_0^post_1 && cnt_16^0==cnt_16^post_1 && lt_10^0==lt_10^post_1 && lt_9^0==lt_9^post_1 && tmp_8^0==tmp_8^post_1 && y_6^0==y_6^post_1 ], cost: 1 2: l1 -> l3 : Result_4^0'=Result_4^post_3, __disjvr_0^0'=__disjvr_0^post_3, cnt_16^0'=cnt_16^post_3, lt_10^0'=lt_10^post_3, lt_9^0'=lt_9^post_3, p_7^0'=p_7^post_3, tmp_8^0'=tmp_8^post_3, x_5^0'=x_5^post_3, y_6^0'=y_6^post_3, [ lt_10^1_2==cnt_16^0 && 0<=-1+y_6^0-lt_10^1_2 && lt_10^post_3==lt_10^post_3 && tmp_8^post_3==tmp_8^post_3 && tmp_8^post_3<=0 && 0<=tmp_8^post_3 && Result_4^0==Result_4^post_3 && __disjvr_0^0==__disjvr_0^post_3 && cnt_16^0==cnt_16^post_3 && lt_9^0==lt_9^post_3 && p_7^0==p_7^post_3 && x_5^0==x_5^post_3 && y_6^0==y_6^post_3 ], cost: 1 4: l1 -> l5 : Result_4^0'=Result_4^post_5, __disjvr_0^0'=__disjvr_0^post_5, cnt_16^0'=cnt_16^post_5, lt_10^0'=lt_10^post_5, lt_9^0'=lt_9^post_5, p_7^0'=p_7^post_5, tmp_8^0'=tmp_8^post_5, x_5^0'=x_5^post_5, y_6^0'=y_6^post_5, [ lt_10^1_3==cnt_16^0 && 0<=-1-lt_10^1_3+y_6^0 && lt_10^post_5==lt_10^post_5 && tmp_8^post_5==tmp_8^post_5 && Result_4^0==Result_4^post_5 && __disjvr_0^0==__disjvr_0^post_5 && cnt_16^0==cnt_16^post_5 && lt_9^0==lt_9^post_5 && p_7^0==p_7^post_5 && x_5^0==x_5^post_5 && y_6^0==y_6^post_5 ], cost: 1 3: l3 -> l1 : Result_4^0'=Result_4^post_4, __disjvr_0^0'=__disjvr_0^post_4, cnt_16^0'=cnt_16^post_4, lt_10^0'=lt_10^post_4, lt_9^0'=lt_9^post_4, p_7^0'=p_7^post_4, tmp_8^0'=tmp_8^post_4, x_5^0'=x_5^post_4, y_6^0'=y_6^post_4, [ Result_4^0==Result_4^post_4 && __disjvr_0^0==__disjvr_0^post_4 && cnt_16^0==cnt_16^post_4 && lt_10^0==lt_10^post_4 && lt_9^0==lt_9^post_4 && p_7^0==p_7^post_4 && tmp_8^0==tmp_8^post_4 && x_5^0==x_5^post_4 && y_6^0==y_6^post_4 ], cost: 1 5: l5 -> l6 : Result_4^0'=Result_4^post_6, __disjvr_0^0'=__disjvr_0^post_6, cnt_16^0'=cnt_16^post_6, lt_10^0'=lt_10^post_6, lt_9^0'=lt_9^post_6, p_7^0'=p_7^post_6, tmp_8^0'=tmp_8^post_6, x_5^0'=x_5^post_6, y_6^0'=y_6^post_6, [ __disjvr_0^post_6==__disjvr_0^0 && Result_4^0==Result_4^post_6 && __disjvr_0^0==__disjvr_0^post_6 && cnt_16^0==cnt_16^post_6 && lt_10^0==lt_10^post_6 && lt_9^0==lt_9^post_6 && p_7^0==p_7^post_6 && tmp_8^0==tmp_8^post_6 && x_5^0==x_5^post_6 && y_6^0==y_6^post_6 ], cost: 1 6: l6 -> l4 : Result_4^0'=Result_4^post_7, __disjvr_0^0'=__disjvr_0^post_7, cnt_16^0'=cnt_16^post_7, lt_10^0'=lt_10^post_7, lt_9^0'=lt_9^post_7, p_7^0'=p_7^post_7, tmp_8^0'=tmp_8^post_7, x_5^0'=x_5^post_7, y_6^0'=y_6^post_7, [ lt_9^1_1==cnt_16^0 && lt_9^post_7==lt_9^post_7 && Result_4^0==Result_4^post_7 && __disjvr_0^0==__disjvr_0^post_7 && cnt_16^0==cnt_16^post_7 && lt_10^0==lt_10^post_7 && p_7^0==p_7^post_7 && tmp_8^0==tmp_8^post_7 && x_5^0==x_5^post_7 && y_6^0==y_6^post_7 ], cost: 1 7: l4 -> l1 : Result_4^0'=Result_4^post_8, __disjvr_0^0'=__disjvr_0^post_8, cnt_16^0'=cnt_16^post_8, lt_10^0'=lt_10^post_8, lt_9^0'=lt_9^post_8, p_7^0'=p_7^post_8, tmp_8^0'=tmp_8^post_8, x_5^0'=x_5^post_8, y_6^0'=y_6^post_8, [ Result_4^0==Result_4^post_8 && __disjvr_0^0==__disjvr_0^post_8 && cnt_16^0==cnt_16^post_8 && lt_10^0==lt_10^post_8 && lt_9^0==lt_9^post_8 && p_7^0==p_7^post_8 && tmp_8^0==tmp_8^post_8 && x_5^0==x_5^post_8 && y_6^0==y_6^post_8 ], cost: 1 8: l7 -> l0 : Result_4^0'=Result_4^post_9, __disjvr_0^0'=__disjvr_0^post_9, cnt_16^0'=cnt_16^post_9, lt_10^0'=lt_10^post_9, lt_9^0'=lt_9^post_9, p_7^0'=p_7^post_9, tmp_8^0'=tmp_8^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ Result_4^0==Result_4^post_9 && __disjvr_0^0==__disjvr_0^post_9 && cnt_16^0==cnt_16^post_9 && lt_10^0==lt_10^post_9 && lt_9^0==lt_9^post_9 && p_7^0==p_7^post_9 && tmp_8^0==tmp_8^post_9 && x_5^0==x_5^post_9 && y_6^0==y_6^post_9 ], cost: 1 Simplified all rules, resulting in: Start location: l7 0: l0 -> l1 : p_7^0'=p_7^post_1, x_5^0'=p_7^post_1, [], cost: 1 2: l1 -> l3 : lt_10^0'=lt_10^post_3, tmp_8^0'=0, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 1 4: l1 -> l5 : lt_10^0'=lt_10^post_5, tmp_8^0'=tmp_8^post_5, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 1 3: l3 -> l1 : [], cost: 1 5: l5 -> l6 : [], cost: 1 6: l6 -> l4 : lt_9^0'=lt_9^post_7, [], cost: 1 7: l4 -> l1 : [], cost: 1 8: l7 -> l0 : [], cost: 1 ### Simplification by acceleration and chaining ### Eliminated locations (on linear paths): Start location: l7 10: l1 -> l1 : lt_10^0'=lt_10^post_3, tmp_8^0'=0, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 2 13: l1 -> l1 : lt_10^0'=lt_10^post_5, lt_9^0'=lt_9^post_7, tmp_8^0'=tmp_8^post_5, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 4 9: l7 -> l1 : p_7^0'=p_7^post_1, x_5^0'=p_7^post_1, [], cost: 2 Accelerating simple loops of location 1. Accelerating the following rules: 10: l1 -> l1 : lt_10^0'=lt_10^post_3, tmp_8^0'=0, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 2 13: l1 -> l1 : lt_10^0'=lt_10^post_5, lt_9^0'=lt_9^post_7, tmp_8^0'=tmp_8^post_5, [ 0<=-1+y_6^0-cnt_16^0 ], cost: 4 Accelerated rule 10 with non-termination, yielding the new rule 14. Accelerated rule 13 with non-termination, yielding the new rule 15. [accelerate] Nesting with 0 inner and 0 outer candidates Removing the simple loops: 10 13. Also removing duplicate rules: 14. Accelerated all simple loops using metering functions (where possible): Start location: l7 15: l1 -> [8] : [ 0<=-1+y_6^0-cnt_16^0 ], cost: NONTERM 9: l7 -> l1 : p_7^0'=p_7^post_1, x_5^0'=p_7^post_1, [], cost: 2 Chained accelerated rules (with incoming rules): Start location: l7 9: l7 -> l1 : p_7^0'=p_7^post_1, x_5^0'=p_7^post_1, [], cost: 2 16: l7 -> [8] : [ 0<=-1+y_6^0-cnt_16^0 ], cost: NONTERM Removed unreachable locations (and leaf rules with constant cost): Start location: l7 16: l7 -> [8] : [ 0<=-1+y_6^0-cnt_16^0 ], cost: NONTERM ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: l7 16: l7 -> [8] : [ 0<=-1+y_6^0-cnt_16^0 ], cost: NONTERM Computing asymptotic complexity for rule 16 Guard is satisfiable, yielding nontermination Resulting cost NONTERM has complexity: Nonterm Found new complexity Nonterm. Obtained the following overall complexity (w.r.t. the length of the input n): Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: [ 0<=-1+y_6^0-cnt_16^0 ] NO