WORST_CASE(Omega(1),?)

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

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

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     12: l8 -> l7 : id^0'=id^post_13, maxId^0'=maxId^post_13, tmp^0'=tmp^post_13, tmp___0^0'=tmp___0^post_13, [ id^0==id^post_13 && maxId^0==maxId^post_13 && tmp^0==tmp^post_13 && tmp___0^0==tmp___0^post_13 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l8
      0: l0 -> l1 : id^0'=id^post_1, maxId^0'=maxId^post_1, tmp^0'=tmp^post_1, tmp___0^0'=tmp___0^post_1, [ 1+maxId^0<=tmp^0 && tmp^post_1==0 && id^0==id^post_1 && maxId^0==maxId^post_1 && tmp___0^0==tmp___0^post_1 ], cost: 1
      1: l0 -> l1 : id^0'=id^post_2, maxId^0'=maxId^post_2, tmp^0'=tmp^post_2, tmp___0^0'=tmp___0^post_2, [ tmp^0<=maxId^0 && tmp^post_2==1+tmp^0 && id^0==id^post_2 && maxId^0==maxId^post_2 && tmp___0^0==tmp___0^post_2 ], cost: 1
      9: l1 -> l5 : id^0'=id^post_10, maxId^0'=maxId^post_10, tmp^0'=tmp^post_10, tmp___0^0'=tmp___0^post_10, [ id^0==id^post_10 && maxId^0==maxId^post_10 && tmp^0==tmp^post_10 && tmp___0^0==tmp___0^post_10 ], cost: 1
      3: l2 -> l0 : id^0'=id^post_4, maxId^0'=maxId^post_4, tmp^0'=tmp^post_4, tmp___0^0'=tmp___0^post_4, [ 1<=tmp___0^0 && id^0==id^post_4 && maxId^0==maxId^post_4 && tmp^0==tmp^post_4 && tmp___0^0==tmp___0^post_4 ], cost: 1
      4: l2 -> l0 : id^0'=id^post_5, maxId^0'=maxId^post_5, tmp^0'=tmp^post_5, tmp___0^0'=tmp___0^post_5, [ 1+tmp___0^0<=0 && id^0==id^post_5 && maxId^0==maxId^post_5 && tmp^0==tmp^post_5 && tmp___0^0==tmp___0^post_5 ], cost: 1
      5: l4 -> l2 : id^0'=id^post_6, maxId^0'=maxId^post_6, tmp^0'=tmp^post_6, tmp___0^0'=tmp___0^post_6, [ tmp___0^post_6==tmp___0^post_6 && id^0==id^post_6 && maxId^0==maxId^post_6 && tmp^0==tmp^post_6 ], cost: 1
      7: l5 -> l4 : id^0'=id^post_8, maxId^0'=maxId^post_8, tmp^0'=tmp^post_8, tmp___0^0'=tmp___0^post_8, [ 1+id^0<=tmp^0 && id^0==id^post_8 && maxId^0==maxId^post_8 && tmp^0==tmp^post_8 && tmp___0^0==tmp___0^post_8 ], cost: 1
      8: l5 -> l4 : id^0'=id^post_9, maxId^0'=maxId^post_9, tmp^0'=tmp^post_9, tmp___0^0'=tmp___0^post_9, [ 1+tmp^0<=id^0 && id^0==id^post_9 && maxId^0==maxId^post_9 && tmp^0==tmp^post_9 && tmp___0^0==tmp___0^post_9 ], cost: 1
     11: l7 -> l1 : id^0'=id^post_12, maxId^0'=maxId^post_12, tmp^0'=tmp^post_12, tmp___0^0'=tmp___0^post_12, [ 0<=id^0 && id^0<=maxId^0 && tmp^post_12==1+id^0 && id^0==id^post_12 && maxId^0==maxId^post_12 && tmp___0^0==tmp___0^post_12 ], cost: 1
     12: l8 -> l7 : id^0'=id^post_13, maxId^0'=maxId^post_13, tmp^0'=tmp^post_13, tmp___0^0'=tmp___0^post_13, [ id^0==id^post_13 && maxId^0==maxId^post_13 && tmp^0==tmp^post_13 && tmp___0^0==tmp___0^post_13 ], cost: 1

Simplified all rules, resulting in:
   Start location: l8
      0: l0 -> l1 : tmp^0'=0, [ 1+maxId^0<=tmp^0 ], cost: 1
      1: l0 -> l1 : tmp^0'=1+tmp^0, [ tmp^0<=maxId^0 ], cost: 1
      9: l1 -> l5 : [], cost: 1
      3: l2 -> l0 : [ 1<=tmp___0^0 ], cost: 1
      4: l2 -> l0 : [ 1+tmp___0^0<=0 ], cost: 1
      5: l4 -> l2 : tmp___0^0'=tmp___0^post_6, [], cost: 1
      7: l5 -> l4 : [ 1+id^0<=tmp^0 ], cost: 1
      8: l5 -> l4 : [ 1+tmp^0<=id^0 ], cost: 1
     11: l7 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 1
     12: l8 -> l7 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l8
      0: l0 -> l1 : tmp^0'=0, [ 1+maxId^0<=tmp^0 ], cost: 1
      1: l0 -> l1 : tmp^0'=1+tmp^0, [ tmp^0<=maxId^0 ], cost: 1
      9: l1 -> l5 : [], cost: 1
      3: l2 -> l0 : [ 1<=tmp___0^0 ], cost: 1
      4: l2 -> l0 : [ 1+tmp___0^0<=0 ], cost: 1
      5: l4 -> l2 : tmp___0^0'=tmp___0^post_6, [], cost: 1
      7: l5 -> l4 : [ 1+id^0<=tmp^0 ], cost: 1
      8: l5 -> l4 : [ 1+tmp^0<=id^0 ], cost: 1
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l8
      0: l0 -> l1 : tmp^0'=0, [ 1+maxId^0<=tmp^0 ], cost: 1
      1: l0 -> l1 : tmp^0'=1+tmp^0, [ tmp^0<=maxId^0 ], cost: 1
     14: l1 -> l4 : [ 1+id^0<=tmp^0 ], cost: 2
     15: l1 -> l4 : [ 1+tmp^0<=id^0 ], cost: 2
     16: l4 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1<=tmp___0^post_6 ], cost: 2
     17: l4 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1+tmp___0^post_6<=0 ], cost: 2
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l8
      0: l0 -> l1 : tmp^0'=0, [ 1+maxId^0<=tmp^0 ], cost: 1
      1: l0 -> l1 : tmp^0'=1+tmp^0, [ tmp^0<=maxId^0 ], cost: 1
     18: l1 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 ], cost: 4
     19: l1 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 ], cost: 4
     20: l1 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 ], cost: 4
     21: l1 -> l0 : tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 ], cost: 4
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l8
     22: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 ], cost: 5
     23: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && tmp^0<=maxId^0 ], cost: 5
     24: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 ], cost: 5
     25: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && tmp^0<=maxId^0 ], cost: 5
     26: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 ], cost: 5
     27: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && tmp^0<=maxId^0 ], cost: 5
     28: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 ], cost: 5
     29: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && tmp^0<=maxId^0 ], cost: 5
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     22: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 ], cost: 5
     23: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && tmp^0<=maxId^0 ], cost: 5
     24: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 ], cost: 5
     25: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && tmp^0<=maxId^0 ], cost: 5
     26: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 ], cost: 5
     27: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && tmp^0<=maxId^0 ], cost: 5
     28: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 ], cost: 5
     29: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && tmp^0<=maxId^0 ], cost: 5

   Accelerated rule 22 with non-termination, yielding the new rule 30.
   Accelerated rule 23 with backward acceleration, yielding the new rule 31.
   Accelerated rule 24 with non-termination, yielding the new rule 32.
   Accelerated rule 25 with backward acceleration, yielding the new rule 33.
   Accelerated rule 26 with non-termination, yielding the new rule 34.
   Accelerated rule 27 with backward acceleration, yielding the new rule 35.
   Accelerated rule 27 with backward acceleration, yielding the new rule 36.
   Accelerated rule 28 with non-termination, yielding the new rule 37.
   Accelerated rule 29 with backward acceleration, yielding the new rule 38.
   Accelerated rule 29 with backward acceleration, yielding the new rule 39.
[accelerate] Nesting with 6 inner and 8 outer candidates
   Nested simple loops 22 (outer loop) and 31 (inner loop) with Rule(1 | 1+id^0<=tmp^0, 1<=tmp___0^post_6, 1+maxId^0<=tmp^0, 1+id^0<=0, 1+maxId^0>=1, | NONTERM || 9 | ), resulting in the new rules: 40, 41.
   Nested simple loops 24 (outer loop) and 33 (inner loop) with Rule(1 | 1+id^0<=tmp^0, 1+tmp___0^post_6<=0, 1+maxId^0<=tmp^0, 1+id^0<=0, 1+maxId^0>=1, | NONTERM || 9 | ), resulting in the new rules: 42, 43.
   Nested simple loops 26 (outer loop) and 36 (inner loop) with Rule(1 | 1+tmp^0<=id^0, 1<=tmp___0^post_6, 1+maxId^0<=tmp^0, 1+maxId^0>=1, 1+maxId^0<=id^0, | NONTERM || 9 | ), resulting in the new rules: 44, 45.
   Nested simple loops 28 (outer loop) and 39 (inner loop) with Rule(1 | 1+tmp^0<=id^0, 1+tmp___0^post_6<=0, 1+maxId^0<=tmp^0, 1+maxId^0>=1, 1+maxId^0<=id^0, | NONTERM || 9 | ), resulting in the new rules: 46, 47.
   Removing the simple loops: 22 23 24 25 26 27 28 29.

Accelerated all simple loops using metering functions (where possible):
   Start location: l8
     30: l1 -> [9] : [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 && 1+id^0<=0 && 1+maxId^0<=0 ], cost: NONTERM
     31: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0-tmp^0>=1 ], cost: 5+5*maxId^0-5*tmp^0
     32: l1 -> [9] : [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 && 1+id^0<=0 && 1+maxId^0<=0 ], cost: NONTERM
     33: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0-tmp^0>=1 ], cost: 5+5*maxId^0-5*tmp^0
     34: l1 -> [9] : [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 && 1<=id^0 && 1+maxId^0<=0 ], cost: NONTERM
     35: l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post_6, [ 1<=tmp___0^post_6 && -tmp^0+id^0>=1 && -1+id^0<=maxId^0 ], cost: -5*tmp^0+5*id^0
     36: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 1<=tmp___0^post_6 && 1+maxId^0-tmp^0>=1 && 1+maxId^0<=id^0 ], cost: 5+5*maxId^0-5*tmp^0
     37: l1 -> [9] : [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 && 1<=id^0 && 1+maxId^0<=0 ], cost: NONTERM
     38: l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp___0^post_6<=0 && -tmp^0+id^0>=1 && -1+id^0<=maxId^0 ], cost: -5*tmp^0+5*id^0
     39: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 1+tmp___0^post_6<=0 && 1+maxId^0-tmp^0>=1 && 1+maxId^0<=id^0 ], cost: 5+5*maxId^0-5*tmp^0
     40: l1 -> [9] : [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 && 1+id^0<=0 && 1+maxId^0>=1 ], cost: NONTERM
     41: l1 -> [9] : [ 1+id^0<=tmp^0 && 1<=tmp___0^post_6 && 1+maxId^0-tmp^0>=1 && 1+id^0<=1+maxId^0 && 1+id^0<=0 && 1+maxId^0>=1 ], cost: NONTERM
     42: l1 -> [9] : [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 && 1+id^0<=0 && 1+maxId^0>=1 ], cost: NONTERM
     43: l1 -> [9] : [ 1+id^0<=tmp^0 && 1+tmp___0^post_6<=0 && 1+maxId^0-tmp^0>=1 && 1+id^0<=1+maxId^0 && 1+id^0<=0 && 1+maxId^0>=1 ], cost: NONTERM
     44: l1 -> [9] : [ 1+tmp^0<=id^0 && 1<=tmp___0^post_6 && 1+maxId^0<=tmp^0 && 1+maxId^0>=1 && 1+maxId^0<=id^0 ], cost: NONTERM
     45: l1 -> [9] : [ 1<=tmp___0^post_6 && 1+maxId^0-tmp^0>=1 && 2+maxId^0<=id^0 && 1+maxId^0>=1 ], cost: NONTERM
     46: l1 -> [9] : [ 1+tmp^0<=id^0 && 1+tmp___0^post_6<=0 && 1+maxId^0<=tmp^0 && 1+maxId^0>=1 && 1+maxId^0<=id^0 ], cost: NONTERM
     47: l1 -> [9] : [ 1+tmp___0^post_6<=0 && 1+maxId^0-tmp^0>=1 && 2+maxId^0<=id^0 && 1+maxId^0>=1 ], cost: NONTERM
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l8
     13: l8 -> l1 : tmp^0'=1+id^0, [ 0<=id^0 && id^0<=maxId^0 ], cost: 2
     48: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1<=tmp___0^post_6 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0
     49: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1+tmp___0^post_6<=0 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l8
     48: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1<=tmp___0^post_6 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0
     49: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1+tmp___0^post_6<=0 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l8
     48: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1<=tmp___0^post_6 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0
     49: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post_6, [ 0<=id^0 && 1+tmp___0^post_6<=0 && maxId^0-id^0>=1 ], cost: 2+5*maxId^0-5*id^0

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

Computing asymptotic complexity for rule 49
   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:  [ id^0==id^post_13 && maxId^0==maxId^post_13 && tmp^0==tmp^post_13 && tmp___0^0==tmp___0^post_13 ]

WORST_CASE(Omega(1),?)