NO

### Pre-processing the ITS problem ###

Initial linear ITS problem
   Start location: l7
      0: l0 -> l1 : i^0'=i^post_1, j^0'=j^post_1, [ j^post_1==i^0 && i^0==i^post_1 ], cost: 1
      1: l1 -> l2 : i^0'=i^post_2, j^0'=j^post_2, [ i^post_2==1+i^0 && j^0==j^post_2 ], cost: 1
      7: l2 -> l4 : i^0'=i^post_8, j^0'=j^post_8, [ i^0==i^post_8 && j^0==j^post_8 ], cost: 1
      2: l3 -> l0 : i^0'=i^post_3, j^0'=j^post_3, [ 6<=i^0 && i^0==i^post_3 && j^0==j^post_3 ], cost: 1
      3: l3 -> l0 : i^0'=i^post_4, j^0'=j^post_4, [ 1+i^0<=5 && i^0==i^post_4 && j^0==j^post_4 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, j^0'=j^post_5, [ i^0<=5 && 5<=i^0 && i^post_5==i^post_5 && j^0==j^post_5 ], cost: 1
      5: l4 -> l5 : i^0'=i^post_6, j^0'=j^post_6, [ 10<=i^0 && i^0==i^post_6 && j^0==j^post_6 ], cost: 1
      6: l4 -> l3 : i^0'=i^post_7, j^0'=j^post_7, [ 1+i^0<=10 && i^0==i^post_7 && j^0==j^post_7 ], cost: 1
      8: l6 -> l2 : i^0'=i^post_9, j^0'=j^post_9, [ i^post_9==0 && j^0==j^post_9 ], cost: 1
      9: l7 -> l6 : i^0'=i^post_10, j^0'=j^post_10, [ i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: l7 -> l6 : i^0'=i^post_10, j^0'=j^post_10, [ i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l7
      0: l0 -> l1 : i^0'=i^post_1, j^0'=j^post_1, [ j^post_1==i^0 && i^0==i^post_1 ], cost: 1
      1: l1 -> l2 : i^0'=i^post_2, j^0'=j^post_2, [ i^post_2==1+i^0 && j^0==j^post_2 ], cost: 1
      7: l2 -> l4 : i^0'=i^post_8, j^0'=j^post_8, [ i^0==i^post_8 && j^0==j^post_8 ], cost: 1
      2: l3 -> l0 : i^0'=i^post_3, j^0'=j^post_3, [ 6<=i^0 && i^0==i^post_3 && j^0==j^post_3 ], cost: 1
      3: l3 -> l0 : i^0'=i^post_4, j^0'=j^post_4, [ 1+i^0<=5 && i^0==i^post_4 && j^0==j^post_4 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, j^0'=j^post_5, [ i^0<=5 && 5<=i^0 && i^post_5==i^post_5 && j^0==j^post_5 ], cost: 1
      6: l4 -> l3 : i^0'=i^post_7, j^0'=j^post_7, [ 1+i^0<=10 && i^0==i^post_7 && j^0==j^post_7 ], cost: 1
      8: l6 -> l2 : i^0'=i^post_9, j^0'=j^post_9, [ i^post_9==0 && j^0==j^post_9 ], cost: 1
      9: l7 -> l6 : i^0'=i^post_10, j^0'=j^post_10, [ i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Simplified all rules, resulting in:
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
      7: l2 -> l4 : [], cost: 1
      2: l3 -> l0 : [ 6<=i^0 ], cost: 1
      3: l3 -> l0 : [ 1+i^0<=5 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, [ -5+i^0==0 ], cost: 1
      6: l4 -> l3 : [ 1+i^0<=10 ], cost: 1
      8: l6 -> l2 : i^0'=0, [], cost: 1
      9: l7 -> l6 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
     11: l2 -> l3 : [ 1+i^0<=10 ], cost: 2
      2: l3 -> l0 : [ 6<=i^0 ], cost: 1
      3: l3 -> l0 : [ 1+i^0<=5 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, [ -5+i^0==0 ], cost: 1
     10: l7 -> l2 : i^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
     12: l2 -> l0 : [ 1+i^0<=10 && 6<=i^0 ], cost: 3
     13: l2 -> l0 : [ 1+i^0<=5 ], cost: 3
     14: l2 -> l1 : i^0'=i^post_5, [ -5+i^0==0 ], cost: 3
     10: l7 -> l2 : i^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l7
     17: l2 -> l2 : i^0'=1+i^post_5, [ -5+i^0==0 ], cost: 4
     18: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=10 && 6<=i^0 ], cost: 5
     19: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=5 ], cost: 5
     10: l7 -> l2 : i^0'=0, [], cost: 2

Accelerating simple loops of location 2.
   Accelerating the following rules:
     17: l2 -> l2 : i^0'=1+i^post_5, [ -5+i^0==0 ], cost: 4
     18: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=10 && 6<=i^0 ], cost: 5
     19: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=5 ], cost: 5

   Accelerated rule 17 with non-termination, yielding the new rule 20.
   Accelerated rule 18 with backward acceleration, yielding the new rule 21.
   Accelerated rule 19 with backward acceleration, yielding the new rule 22.
[accelerate] Nesting with 2 inner and 3 outer candidates
   Nested simple loops 17 (outer loop) and 22 (inner loop) with Rule(2 | -5+i^0==0, 4-i^post_5>=1, | NONTERM || 8 | ), resulting in the new rules: 23, 24.
   Removing the simple loops: 17 18 19.

Accelerated all simple loops using metering functions (where possible):
   Start location: l7
     20: l2 -> [8] : [ -5+i^0==0 && -4+i^post_5==0 ], cost: NONTERM
     21: l2 -> l2 : i^0'=10, j^0'=9, [ 6<=i^0 && 10-i^0>=1 ], cost: 50-5*i^0
     22: l2 -> l2 : i^0'=5, j^0'=4, [ 5-i^0>=1 ], cost: 25-5*i^0
     23: l2 -> [8] : [ -5+i^0==0 && 4-i^post_5>=1 ], cost: NONTERM
     24: l2 -> [8] : [ 5-i^0>=1 && 4-i^post_5>=1 ], cost: NONTERM
     10: l7 -> l2 : i^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l7
     10: l7 -> l2 : i^0'=0, [], cost: 2
     25: l7 -> l2 : i^0'=5, j^0'=4, [], cost: 27
     26: l7 -> [8] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l7
     26: l7 -> [8] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l7
     26: l7 -> [8] : [], cost: NONTERM

Computing asymptotic complexity for rule 26
   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:  []

NO