WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: l6
      0: l0 -> l1 : i57^0'=i57^post_1, i911^0'=i911^post_1, tmp^0'=tmp^post_1, x35^0'=x35^post_1, x79^0'=x79^post_1, [ i57^0==i57^post_1 && i911^0==i911^post_1 && tmp^0==tmp^post_1 && x35^0==x35^post_1 && x79^0==x79^post_1 ], cost: 1
      4: l1 -> l4 : i57^0'=i57^post_5, i911^0'=i911^post_5, tmp^0'=tmp^post_5, x35^0'=x35^post_5, x79^0'=x79^post_5, [ 10<=i57^0 && x79^post_5==x79^post_5 && i911^post_5==0 && i57^0==i57^post_5 && tmp^0==tmp^post_5 && x35^0==x35^post_5 ], cost: 1
      5: l1 -> l0 : i57^0'=i57^post_6, i911^0'=i911^post_6, tmp^0'=tmp^post_6, x35^0'=x35^post_6, x79^0'=x79^post_6, [ 1+i57^0<=10 && i57^post_6==1+i57^0 && i911^0==i911^post_6 && tmp^0==tmp^post_6 && x35^0==x35^post_6 && x79^0==x79^post_6 ], cost: 1
      1: l2 -> l3 : i57^0'=i57^post_2, i911^0'=i911^post_2, tmp^0'=tmp^post_2, x35^0'=x35^post_2, x79^0'=x79^post_2, [ 10<=i911^0 && i57^0==i57^post_2 && i911^0==i911^post_2 && tmp^0==tmp^post_2 && x35^0==x35^post_2 && x79^0==x79^post_2 ], cost: 1
      2: l2 -> l4 : i57^0'=i57^post_3, i911^0'=i911^post_3, tmp^0'=tmp^post_3, x35^0'=x35^post_3, x79^0'=x79^post_3, [ 1+i911^0<=10 && i911^post_3==1+i911^0 && i57^0==i57^post_3 && tmp^0==tmp^post_3 && x35^0==x35^post_3 && x79^0==x79^post_3 ], cost: 1
      3: l4 -> l2 : i57^0'=i57^post_4, i911^0'=i911^post_4, tmp^0'=tmp^post_4, x35^0'=x35^post_4, x79^0'=x79^post_4, [ i57^0==i57^post_4 && i911^0==i911^post_4 && tmp^0==tmp^post_4 && x35^0==x35^post_4 && x79^0==x79^post_4 ], cost: 1
      6: l5 -> l0 : i57^0'=i57^post_7, i911^0'=i911^post_7, tmp^0'=tmp^post_7, x35^0'=x35^post_7, x79^0'=x79^post_7, [ tmp^post_7==tmp^post_7 && x35^post_7==x35^post_7 && i57^post_7==0 && i911^0==i911^post_7 && x79^0==x79^post_7 ], cost: 1
      7: l6 -> l5 : i57^0'=i57^post_8, i911^0'=i911^post_8, tmp^0'=tmp^post_8, x35^0'=x35^post_8, x79^0'=x79^post_8, [ i57^0==i57^post_8 && i911^0==i911^post_8 && tmp^0==tmp^post_8 && x35^0==x35^post_8 && x79^0==x79^post_8 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: l6 -> l5 : i57^0'=i57^post_8, i911^0'=i911^post_8, tmp^0'=tmp^post_8, x35^0'=x35^post_8, x79^0'=x79^post_8, [ i57^0==i57^post_8 && i911^0==i911^post_8 && tmp^0==tmp^post_8 && x35^0==x35^post_8 && x79^0==x79^post_8 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l6
      0: l0 -> l1 : i57^0'=i57^post_1, i911^0'=i911^post_1, tmp^0'=tmp^post_1, x35^0'=x35^post_1, x79^0'=x79^post_1, [ i57^0==i57^post_1 && i911^0==i911^post_1 && tmp^0==tmp^post_1 && x35^0==x35^post_1 && x79^0==x79^post_1 ], cost: 1
      4: l1 -> l4 : i57^0'=i57^post_5, i911^0'=i911^post_5, tmp^0'=tmp^post_5, x35^0'=x35^post_5, x79^0'=x79^post_5, [ 10<=i57^0 && x79^post_5==x79^post_5 && i911^post_5==0 && i57^0==i57^post_5 && tmp^0==tmp^post_5 && x35^0==x35^post_5 ], cost: 1
      5: l1 -> l0 : i57^0'=i57^post_6, i911^0'=i911^post_6, tmp^0'=tmp^post_6, x35^0'=x35^post_6, x79^0'=x79^post_6, [ 1+i57^0<=10 && i57^post_6==1+i57^0 && i911^0==i911^post_6 && tmp^0==tmp^post_6 && x35^0==x35^post_6 && x79^0==x79^post_6 ], cost: 1
      2: l2 -> l4 : i57^0'=i57^post_3, i911^0'=i911^post_3, tmp^0'=tmp^post_3, x35^0'=x35^post_3, x79^0'=x79^post_3, [ 1+i911^0<=10 && i911^post_3==1+i911^0 && i57^0==i57^post_3 && tmp^0==tmp^post_3 && x35^0==x35^post_3 && x79^0==x79^post_3 ], cost: 1
      3: l4 -> l2 : i57^0'=i57^post_4, i911^0'=i911^post_4, tmp^0'=tmp^post_4, x35^0'=x35^post_4, x79^0'=x79^post_4, [ i57^0==i57^post_4 && i911^0==i911^post_4 && tmp^0==tmp^post_4 && x35^0==x35^post_4 && x79^0==x79^post_4 ], cost: 1
      6: l5 -> l0 : i57^0'=i57^post_7, i911^0'=i911^post_7, tmp^0'=tmp^post_7, x35^0'=x35^post_7, x79^0'=x79^post_7, [ tmp^post_7==tmp^post_7 && x35^post_7==x35^post_7 && i57^post_7==0 && i911^0==i911^post_7 && x79^0==x79^post_7 ], cost: 1
      7: l6 -> l5 : i57^0'=i57^post_8, i911^0'=i911^post_8, tmp^0'=tmp^post_8, x35^0'=x35^post_8, x79^0'=x79^post_8, [ i57^0==i57^post_8 && i911^0==i911^post_8 && tmp^0==tmp^post_8 && x35^0==x35^post_8 && x79^0==x79^post_8 ], cost: 1

Simplified all rules, resulting in:
   Start location: l6
      0: l0 -> l1 : [], cost: 1
      4: l1 -> l4 : i911^0'=0, x79^0'=x79^post_5, [ 10<=i57^0 ], cost: 1
      5: l1 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 1
      2: l2 -> l4 : i911^0'=1+i911^0, [ 1+i911^0<=10 ], cost: 1
      3: l4 -> l2 : [], cost: 1
      6: l5 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 1
      7: l6 -> l5 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l6
      0: l0 -> l1 : [], cost: 1
      4: l1 -> l4 : i911^0'=0, x79^0'=x79^post_5, [ 10<=i57^0 ], cost: 1
      5: l1 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 1
      9: l4 -> l4 : i911^0'=1+i911^0, [ 1+i911^0<=10 ], cost: 2
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Accelerating simple loops of location 4.
   Accelerating the following rules:
      9: l4 -> l4 : i911^0'=1+i911^0, [ 1+i911^0<=10 ], cost: 2

   Accelerated rule 9 with backward acceleration, yielding the new rule 10.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
      0: l0 -> l1 : [], cost: 1
      4: l1 -> l4 : i911^0'=0, x79^0'=x79^post_5, [ 10<=i57^0 ], cost: 1
      5: l1 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 1
     10: l4 -> l4 : i911^0'=10, [ 10-i911^0>=0 ], cost: 20-2*i911^0
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      0: l0 -> l1 : [], cost: 1
      4: l1 -> l4 : i911^0'=0, x79^0'=x79^post_5, [ 10<=i57^0 ], cost: 1
      5: l1 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 1
     11: l1 -> l4 : i911^0'=10, x79^0'=x79^post_5, [ 10<=i57^0 ], cost: 21
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
      0: l0 -> l1 : [], cost: 1
      5: l1 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 1
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Eliminated locations (on linear paths):
   Start location: l6
     12: l0 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 2
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
     12: l0 -> l0 : i57^0'=1+i57^0, [ 1+i57^0<=10 ], cost: 2

   Accelerated rule 12 with backward acceleration, yielding the new rule 13.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 12.

Accelerated all simple loops using metering functions (where possible):
   Start location: l6
     13: l0 -> l0 : i57^0'=10, [ 10-i57^0>=0 ], cost: 20-2*i57^0
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l6
      8: l6 -> l0 : i57^0'=0, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 2
     14: l6 -> l0 : i57^0'=10, tmp^0'=tmp^post_7, x35^0'=x35^post_7, [], cost: 22

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l6
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l6
     <empty>

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  [ i57^0==i57^post_8 && i911^0==i911^post_8 && tmp^0==tmp^post_8 && x35^0==x35^post_8 && x79^0==x79^post_8 ]

WORST_CASE(Omega(1),?)