WORST_CASE(Omega(1),?)

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

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

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     11: l7 -> l6 : Result_4^0'=Result_4^post_12, tmp_7^0'=tmp_7^post_12, x_5^0'=x_5^post_12, y_6^0'=y_6^post_12, [ Result_4^0==Result_4^post_12 && tmp_7^0==tmp_7^post_12 && x_5^0==x_5^post_12 && y_6^0==y_6^post_12 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l7
      3: l0 -> l2 : Result_4^0'=Result_4^post_4, tmp_7^0'=tmp_7^post_4, x_5^0'=x_5^post_4, y_6^0'=y_6^post_4, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+x_5^0+y_6^0 && tmp_7^post_4==tmp_7^post_4 && tmp_7^post_4<=0 && 0<=tmp_7^post_4 && x_5^post_4==-2+y_6^0 && y_6^post_4==1+x_5^post_4 && Result_4^0==Result_4^post_4 ], cost: 1
      5: l0 -> l4 : Result_4^0'=Result_4^post_6, tmp_7^0'=tmp_7^post_6, x_5^0'=x_5^post_6, y_6^0'=y_6^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 0<=-1+x_5^0+y_6^0 && tmp_7^post_6==tmp_7^post_6 && Result_4^0==Result_4^post_6 && x_5^0==x_5^post_6 && y_6^0==y_6^post_6 ], cost: 1
      4: l2 -> l0 : Result_4^0'=Result_4^post_5, tmp_7^0'=tmp_7^post_5, x_5^0'=x_5^post_5, y_6^0'=y_6^post_5, [ Result_4^0==Result_4^post_5 && tmp_7^0==tmp_7^post_5 && x_5^0==x_5^post_5 && y_6^0==y_6^post_5 ], cost: 1
      6: l4 -> l5 : Result_4^0'=Result_4^post_7, tmp_7^0'=tmp_7^post_7, x_5^0'=x_5^post_7, y_6^0'=y_6^post_7, [ 1+tmp_7^0<=0 && Result_4^0==Result_4^post_7 && tmp_7^0==tmp_7^post_7 && x_5^0==x_5^post_7 && y_6^0==y_6^post_7 ], cost: 1
      7: l4 -> l5 : Result_4^0'=Result_4^post_8, tmp_7^0'=tmp_7^post_8, x_5^0'=x_5^post_8, y_6^0'=y_6^post_8, [ 1<=tmp_7^0 && Result_4^0==Result_4^post_8 && tmp_7^0==tmp_7^post_8 && x_5^0==x_5^post_8 && y_6^0==y_6^post_8 ], cost: 1
      8: l5 -> l3 : Result_4^0'=Result_4^post_9, tmp_7^0'=tmp_7^post_9, x_5^0'=x_5^post_9, y_6^0'=y_6^post_9, [ x_5^post_9==-1+x_5^0 && y_6^post_9==x_5^post_9 && Result_4^0==Result_4^post_9 && tmp_7^0==tmp_7^post_9 ], cost: 1
      9: l3 -> l0 : Result_4^0'=Result_4^post_10, tmp_7^0'=tmp_7^post_10, x_5^0'=x_5^post_10, y_6^0'=y_6^post_10, [ Result_4^0==Result_4^post_10 && tmp_7^0==tmp_7^post_10 && x_5^0==x_5^post_10 && y_6^0==y_6^post_10 ], cost: 1
     10: l6 -> l0 : Result_4^0'=Result_4^post_11, tmp_7^0'=tmp_7^post_11, x_5^0'=x_5^post_11, y_6^0'=y_6^post_11, [ Result_4^0==Result_4^post_11 && tmp_7^0==tmp_7^post_11 && x_5^0==x_5^post_11 && y_6^0==y_6^post_11 ], cost: 1
     11: l7 -> l6 : Result_4^0'=Result_4^post_12, tmp_7^0'=tmp_7^post_12, x_5^0'=x_5^post_12, y_6^0'=y_6^post_12, [ Result_4^0==Result_4^post_12 && tmp_7^0==tmp_7^post_12 && x_5^0==x_5^post_12 && y_6^0==y_6^post_12 ], cost: 1

Simplified all rules, resulting in:
   Start location: l7
      3: l0 -> l2 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
      5: l0 -> l4 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
      4: l2 -> l0 : [], cost: 1
      6: l4 -> l5 : [ 1+tmp_7^0<=0 ], cost: 1
      7: l4 -> l5 : [ 1<=tmp_7^0 ], cost: 1
      8: l5 -> l3 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 1
      9: l3 -> l0 : [], cost: 1
     10: l6 -> l0 : [], cost: 1
     11: l7 -> l6 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l7
      5: l0 -> l4 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
     13: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2
      6: l4 -> l5 : [ 1+tmp_7^0<=0 ], cost: 1
      7: l4 -> l5 : [ 1<=tmp_7^0 ], cost: 1
     14: l5 -> l0 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 2
     12: l7 -> l0 : [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
     13: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2

[test] deduced pseudo-invariant -1-x_5^0+y_6^0<=0, also trying 1+x_5^0-y_6^0<=-1
   Accelerated rule 13 with backward acceleration, yielding the new rule 15.
   Accelerated rule 13 with backward acceleration, yielding the new rule 16.
[accelerate] Nesting with 2 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: l7
      5: l0 -> l4 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
     13: l0 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 2
     15: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: -2+2*y_6^0
     16: l0 -> l0 : tmp_7^0'=0, x_5^0'=-1, y_6^0'=0, [ 0<=-1 ], cost: 2*y_6^0
      6: l4 -> l5 : [ 1+tmp_7^0<=0 ], cost: 1
      7: l4 -> l5 : [ 1<=tmp_7^0 ], cost: 1
     14: l5 -> l0 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 2
     12: l7 -> l0 : [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l7
      5: l0 -> l4 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 1
      6: l4 -> l5 : [ 1+tmp_7^0<=0 ], cost: 1
      7: l4 -> l5 : [ 1<=tmp_7^0 ], cost: 1
     14: l5 -> l0 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 2
     18: l5 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-2+x_5^0 ], cost: 4
     20: l5 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -2+x_5^0>=1 ], cost: -2+2*x_5^0
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0

Eliminated locations (on tree-shaped paths):
   Start location: l7
     21: l0 -> l5 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 2
     22: l0 -> l5 : tmp_7^0'=tmp_7^post_6, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 2
     14: l5 -> l0 : x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [], cost: 2
     18: l5 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-2+x_5^0 ], cost: 4
     20: l5 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -2+x_5^0>=1 ], cost: -2+2*x_5^0
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0

Eliminated locations (on tree-shaped paths):
   Start location: l7
     23: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 4
     24: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 && 0<=-2+x_5^0 ], cost: 6
     25: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 && -2+x_5^0>=1 ], cost: 2*x_5^0
     26: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 4
     27: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 1<=tmp_7^post_6 && 0<=-2+x_5^0 ], cost: 6
     28: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && 1<=tmp_7^post_6 && -2+x_5^0>=1 ], cost: 2*x_5^0
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0

Applied pruning (of leafs and parallel rules):
   Start location: l7
     23: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 4
     24: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 && 0<=-2+x_5^0 ], cost: 6
     25: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 && -2+x_5^0>=1 ], cost: 2*x_5^0
     26: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 4
     28: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && 1<=tmp_7^post_6 && -2+x_5^0>=1 ], cost: 2*x_5^0
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0

Accelerating simple loops of location 0.
[accelerate] Removed some duplicate simple loops
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     23: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 4
     24: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 0<=-2+x_5^0 ], cost: 6
     26: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 4
     28: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && -2+x_5^0>=1 ], cost: 2*x_5^0

[test] deduced pseudo-invariant x_5^0-y_6^0<=0, also trying -x_5^0+y_6^0<=-1
   Accelerated rule 23 with backward acceleration, yielding the new rule 29.
   Accelerated rule 23 with backward acceleration, yielding the new rule 30.
[test] deduced pseudo-invariant 1+x_5^0-y_6^0<=0, also trying -1-x_5^0+y_6^0<=-1
   Accelerated rule 24 with backward acceleration, yielding the new rule 31.
   Failed to prove monotonicity of the guard of rule 26.
   Failed to prove monotonicity of the guard of rule 28.
[accelerate] Nesting with 5 inner and 4 outer candidates
   Also removing duplicate rules: 29.

Accelerated all simple loops using metering functions (where possible):
   Start location: l7
     23: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 4
     24: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 0<=-2+x_5^0 ], cost: 6
     26: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 4
     28: l0 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && -2+x_5^0>=1 ], cost: 2*x_5^0
     30: l0 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 1+tmp_7^post_6<=0 && x_5^0-y_6^0<=0 && x_5^0>=1 ], cost: 4*x_5^0
     31: l0 -> l0 : tmp_7^0'=0, x_5^0'=-3*k_6+x_5^0, y_6^0'=1-3*k_6+x_5^0, [ 1+x_5^0-y_6^0<=0 && k_6>=1 && 0<=1-3*k_6+x_5^0 ], cost: 6*k_6
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0

Chained accelerated rules (with incoming rules):
   Start location: l7
     12: l7 -> l0 : [], cost: 2
     17: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2+y_6^0, y_6^0'=-1+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 ], cost: 4
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     32: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 6
     33: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-3+y_6^0, y_6^0'=-3+y_6^0, [ 0<=-1+x_5^0 && 0<=-3+y_6^0 && 1+tmp_7^post_6<=0 ], cost: 8
     34: l7 -> l0 : tmp_7^0'=0, x_5^0'=-3+x_5^0, y_6^0'=-2+x_5^0, [ 0<=-1+y_6^0 && 0<=-2+x_5^0 ], cost: 8
     35: l7 -> l0 : tmp_7^0'=0, x_5^0'=-5+y_6^0, y_6^0'=-4+y_6^0, [ 0<=-1+x_5^0 && 0<=-4+y_6^0 ], cost: 10
     36: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-1+x_5^0, y_6^0'=-1+x_5^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && 1<=tmp_7^post_6 ], cost: 6
     37: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=-3+y_6^0, y_6^0'=-3+y_6^0, [ 0<=-1+x_5^0 && 0<=-3+y_6^0 && 1<=tmp_7^post_6 ], cost: 8
     38: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && -2+x_5^0>=1 ], cost: 2+2*x_5^0
     39: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+x_5^0 && -4+y_6^0>=1 ], cost: 2*y_6^0
     40: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 1+tmp_7^post_6<=0 && x_5^0-y_6^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0
     41: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 0<=-1+x_5^0 && 1+tmp_7^post_6<=0 && -2+y_6^0>=1 ], cost: -4+4*y_6^0
     42: l7 -> l0 : tmp_7^0'=0, x_5^0'=-3*k_6+x_5^0, y_6^0'=1-3*k_6+x_5^0, [ 1+x_5^0-y_6^0<=0 && k_6>=1 && 0<=1-3*k_6+x_5^0 ], cost: 2+6*k_6
     43: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2-3*k_6+y_6^0, y_6^0'=-1-3*k_6+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && k_6>=1 && 0<=-1-3*k_6+y_6^0 ], cost: 4+6*k_6

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l7
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     38: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && -2+x_5^0>=1 ], cost: 2+2*x_5^0
     39: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+x_5^0 && -4+y_6^0>=1 ], cost: 2*y_6^0
     40: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 1+tmp_7^post_6<=0 && x_5^0-y_6^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0
     41: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 0<=-1+x_5^0 && 1+tmp_7^post_6<=0 && -2+y_6^0>=1 ], cost: -4+4*y_6^0
     42: l7 -> l0 : tmp_7^0'=0, x_5^0'=-3*k_6+x_5^0, y_6^0'=1-3*k_6+x_5^0, [ 1+x_5^0-y_6^0<=0 && k_6>=1 && 0<=1-3*k_6+x_5^0 ], cost: 2+6*k_6
     43: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2-3*k_6+y_6^0, y_6^0'=-1-3*k_6+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && k_6>=1 && 0<=-1-3*k_6+y_6^0 ], cost: 4+6*k_6

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l7
     19: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ -1-x_5^0+y_6^0<=0 && -1+y_6^0>=1 ], cost: 2*y_6^0
     38: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+y_6^0 && -2+x_5^0>=1 ], cost: 2+2*x_5^0
     39: l7 -> l0 : tmp_7^0'=0, x_5^0'=0, y_6^0'=1, [ 0<=-1+x_5^0 && -4+y_6^0>=1 ], cost: 2*y_6^0
     40: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 1+tmp_7^post_6<=0 && x_5^0-y_6^0<=0 && x_5^0>=1 ], cost: 2+4*x_5^0
     41: l7 -> l0 : tmp_7^0'=tmp_7^post_6, x_5^0'=0, y_6^0'=0, [ 0<=-1+x_5^0 && 1+tmp_7^post_6<=0 && -2+y_6^0>=1 ], cost: -4+4*y_6^0
     42: l7 -> l0 : tmp_7^0'=0, x_5^0'=-3*k_6+x_5^0, y_6^0'=1-3*k_6+x_5^0, [ 1+x_5^0-y_6^0<=0 && k_6>=1 && 0<=1-3*k_6+x_5^0 ], cost: 2+6*k_6
     43: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2-3*k_6+y_6^0, y_6^0'=-1-3*k_6+y_6^0, [ 0<=-1+x_5^0 && 0<=-1+y_6^0 && k_6>=1 && 0<=-1-3*k_6+y_6^0 ], cost: 4+6*k_6

Computing asymptotic complexity for rule 42
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 43
   Simplified the guard:
     43: l7 -> l0 : tmp_7^0'=0, x_5^0'=-2-3*k_6+y_6^0, y_6^0'=-1-3*k_6+y_6^0, [ 0<=-1+x_5^0 && k_6>=1 && 0<=-1-3*k_6+y_6^0 ], cost: 4+6*k_6
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 19
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 38
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 39
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 40
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 41
   Resulting cost 0 has complexity: Unknown

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:  [ Result_4^0==Result_4^post_12 && tmp_7^0==tmp_7^post_12 && x_5^0==x_5^post_12 && y_6^0==y_6^post_12 ]

WORST_CASE(Omega(1),?)