WORST_CASE(Omega(0),?)

Initial ITS
Start location: l8
   0: l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1
   1: l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
   9: l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1
   2: l2 -> l3 : id^0'=id^post2, tmp^0'=tmp^post2, maxId^0'=maxId^post2, tmp___0^0'=tmp___0^post2, (-maxId^post2+maxId^0 == 0 /\ tmp^0-tmp^post2 == 0 /\ tmp___0^0 <= 0 /\ -tmp___0^0 <= 0 /\ -tmp___0^post2+tmp___0^0 == 0 /\ id^0-id^post2 == 0), cost: 1
   3: l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1
   4: l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
  10: l3 -> l6 : id^0'=id^post10, tmp^0'=tmp^post10, maxId^0'=maxId^post10, tmp___0^0'=tmp___0^post10, (-tmp___0^post10+tmp___0^0 == 0 /\ id^0-id^post10 == 0 /\ -maxId^post10+maxId^0 == 0 /\ tmp^0-tmp^post10 == 0), cost: 1
   5: l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1
   6: l5 -> l3 : id^0'=id^post6, tmp^0'=tmp^post6, maxId^0'=maxId^post6, tmp___0^0'=tmp___0^post6, (tmp^0-tmp^post6 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ id^0-id^post6 == 0 /\ id^0-tmp^0 <= 0 /\ -maxId^post6+maxId^0 == 0 /\ -id^0+tmp^0 <= 0), cost: 1
   7: l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1
   8: l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1
  11: l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1
  12: l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l8
   0: l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1
   1: l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
   9: l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1
   3: l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1
   4: l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
   5: l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1
   7: l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1
   8: l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1
  11: l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1
  12: l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : id^0'=id^post0, tmp^0'=tmp^post0, maxId^0'=maxId^post0, tmp___0^0'=tmp___0^post0, (-tmp___0^post0+tmp___0^0 == 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0-maxId^post0 == 0 /\ id^0-id^post0 == 0 /\ tmp^post0 == 0), cost: 1
New rule:
l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l0 -> l1 : id^0'=id^post1, tmp^0'=tmp^post1, maxId^0'=maxId^post1, tmp___0^0'=tmp___0^post1, (tmp^0-maxId^0 <= 0 /\ -maxId^post1+maxId^0 == 0 /\ -1+tmp^post1-tmp^0 == 0 /\ id^0-id^post1 == 0 /\ -tmp___0^post1+tmp___0^0 == 0), cost: 1
New rule:
l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : id^0'=id^post3, tmp^0'=tmp^post3, maxId^0'=maxId^post3, tmp___0^0'=tmp___0^post3, (id^0-id^post3 == 0 /\ tmp^0-tmp^post3 == 0 /\ maxId^0-maxId^post3 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ 1-tmp___0^0 <= 0), cost: 1
New rule:
l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : id^0'=id^post4, tmp^0'=tmp^post4, maxId^0'=maxId^post4, tmp___0^0'=tmp___0^post4, (1+tmp___0^0 <= 0 /\ id^0-id^post4 == 0 /\ -tmp___0^post4+tmp___0^0 == 0 /\ -maxId^post4+maxId^0 == 0 /\ -tmp^post4+tmp^0 == 0), cost: 1
New rule:
l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l2 : id^0'=id^post5, tmp^0'=tmp^post5, maxId^0'=maxId^post5, tmp___0^0'=tmp___0^post5, (0 == 0 /\ id^0-id^post5 == 0 /\ tmp^0-tmp^post5 == 0 /\ -maxId^post5+maxId^0 == 0), cost: 1
New rule:
l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : id^0'=id^post7, tmp^0'=tmp^post7, maxId^0'=maxId^post7, tmp___0^0'=tmp___0^post7, (id^0-id^post7 == 0 /\ maxId^0-maxId^post7 == 0 /\ 1+id^0-tmp^0 <= 0 /\ tmp^0-tmp^post7 == 0 /\ -tmp___0^post7+tmp___0^0 == 0), cost: 1
New rule:
l5 -> l4 : 1+id^0-tmp^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : id^0'=id^post8, tmp^0'=tmp^post8, maxId^0'=maxId^post8, tmp___0^0'=tmp___0^post8, (-tmp___0^post8+tmp___0^0 == 0 /\ -maxId^post8+maxId^0 == 0 /\ id^0-id^post8 == 0 /\ 1-id^0+tmp^0 <= 0 /\ tmp^0-tmp^post8 == 0), cost: 1
New rule:
l5 -> l4 : 1-id^0+tmp^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l5 : id^0'=id^post9, tmp^0'=tmp^post9, maxId^0'=maxId^post9, tmp___0^0'=tmp___0^post9, (-tmp^post9+tmp^0 == 0 /\ id^0-id^post9 == 0 /\ -tmp___0^post9+tmp___0^0 == 0 /\ -maxId^post9+maxId^0 == 0), cost: 1
New rule:
l1 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l1 : id^0'=id^post11, tmp^0'=tmp^post11, maxId^0'=maxId^post11, tmp___0^0'=tmp___0^post11, (maxId^0-maxId^post11 == 0 /\ -id^0 <= 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -1-id^0+tmp^post11 == 0 /\ id^0-id^post11 == 0 /\ id^0-maxId^0 <= 0), cost: 1
New rule:
l7 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 1

Applied preprocessing
Original rule:
l8 -> l7 : id^0'=id^post12, tmp^0'=tmp^post12, maxId^0'=maxId^post12, tmp___0^0'=tmp___0^post12, (maxId^0-maxId^post12 == 0 /\ id^0-id^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ tmp^0-tmp^post12 == 0), cost: 1
New rule:
l8 -> l7 : TRUE, cost: 1

Simplified rules
Start location: l8
  13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
  14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
  20: l1 -> l5 : TRUE, cost: 1
  15: l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1
  16: l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1
  17: l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1
  18: l5 -> l4 : 1+id^0-tmp^0 <= 0, cost: 1
  19: l5 -> l4 : 1-id^0+tmp^0 <= 0, cost: 1
  21: l7 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 1
  22: l8 -> l7 : TRUE, cost: 1


Eliminating location l7 by chaining:

Applied chaining
First rule:
l8 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 1
New rule:
l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2

Applied deletion
Removed the following rules: 21 22

Eliminated locations on linear paths
Start location: l8
  13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
  14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
  20: l1 -> l5 : TRUE, cost: 1
  15: l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1
  16: l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1
  17: l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1
  18: l5 -> l4 : 1+id^0-tmp^0 <= 0, cost: 1
  19: l5 -> l4 : 1-id^0+tmp^0 <= 0, cost: 1
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Eliminating location l5 by chaining:

Applied chaining
First rule:
l1 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l4 : 1+id^0-tmp^0 <= 0, cost: 1
New rule:
l1 -> l4 : 1+id^0-tmp^0 <= 0, cost: 2

Applied chaining
First rule:
l1 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l4 : 1-id^0+tmp^0 <= 0, cost: 1
New rule:
l1 -> l4 : 1-id^0+tmp^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 18 19 20

Eliminating location l2 by chaining:

Applied chaining
First rule:
l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1
Second rule:
l2 -> l0 : -1+tmp___0^0 >= 0, cost: 1
New rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, (0 == 0 /\ -1+tmp___0^post5 >= 0), cost: 2

Applied simplification
Original rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, (0 == 0 /\ -1+tmp___0^post5 >= 0), cost: 2
New rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, -1+tmp___0^post5 >= 0, cost: 2

Applied chaining
First rule:
l4 -> l2 : tmp___0^0'=tmp___0^post5, 0 == 0, cost: 1
Second rule:
l2 -> l0 : 1+tmp___0^0 <= 0, cost: 1
New rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, (0 == 0 /\ 1+tmp___0^post5 <= 0), cost: 2

Applied simplification
Original rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, (0 == 0 /\ 1+tmp___0^post5 <= 0), cost: 2
New rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, 1+tmp___0^post5 <= 0, cost: 2

Applied deletion
Removed the following rules: 15 16 17

Eliminated locations on tree-shaped paths
Start location: l8
  13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
  14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
  24: l1 -> l4 : 1+id^0-tmp^0 <= 0, cost: 2
  25: l1 -> l4 : 1-id^0+tmp^0 <= 0, cost: 2
  26: l4 -> l0 : tmp___0^0'=tmp___0^post5, -1+tmp___0^post5 >= 0, cost: 2
  27: l4 -> l0 : tmp___0^0'=tmp___0^post5, 1+tmp___0^post5 <= 0, cost: 2
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Applied merging
first rule:
l1 -> l4 : 1+id^0-tmp^0 <= 0, cost: 2
second rule:
l1 -> l4 : 1-id^0+tmp^0 <= 0, cost: 2
new rule:
l1 -> l4 : (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0), cost: 2

Merged rules
Start location: l8
  13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
  14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
  28: l1 -> l4 : (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0), cost: 2
  26: l4 -> l0 : tmp___0^0'=tmp___0^post5, -1+tmp___0^post5 >= 0, cost: 2
  27: l4 -> l0 : tmp___0^0'=tmp___0^post5, 1+tmp___0^post5 <= 0, cost: 2
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Eliminating location l4 by chaining:

Applied chaining
First rule:
l1 -> l4 : (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0), cost: 2
Second rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, -1+tmp___0^post5 >= 0, cost: 2
New rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4

Applied chaining
First rule:
l1 -> l4 : (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0), cost: 2
Second rule:
l4 -> l0 : tmp___0^0'=tmp___0^post5, 1+tmp___0^post5 <= 0, cost: 2
New rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4

Applied deletion
Removed the following rules: 26 27 28

Eliminated locations on tree-shaped paths
Start location: l8
  13: l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
  14: l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
  29: l1 -> l0 : tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
  30: l1 -> l0 : tmp___0^0'=tmp___0^post5, (1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Eliminating location l0 by chaining:

Applied chaining
First rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
Second rule:
l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5

Applied chaining
First rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
Second rule:
l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
New rule:
l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ tmp^0-maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5

Applied chaining
First rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
Second rule:
l0 -> l1 : tmp^0'=0, 1-tmp^0+maxId^0 <= 0, cost: 1
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5

Applied chaining
First rule:
l1 -> l0 : tmp___0^0'=tmp___0^post5, (1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 4
Second rule:
l0 -> l1 : tmp^0'=1+tmp^0, tmp^0-maxId^0 <= 0, cost: 1
New rule:
l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (tmp^0-maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5

Applied deletion
Removed the following rules: 13 14 29 30

Eliminated locations on tree-shaped paths
Start location: l8
  31: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
  32: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ tmp^0-maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
  33: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
  34: l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (tmp^0-maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n3 >= 0 /\ -1-maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n3

Applied unrolling
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10

Applied non-termination processor
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10
New rule:
l1 -> [9] : (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ tmp^0-maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=tmp^0+n5, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n5 >= 0 /\ 1-tmp^0-n5+maxId^0 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-tmp^0-n5 >= 0)), cost: 5*n5

Applied instantiation
Original rule:
l1 -> l1 : tmp^0'=tmp^0+n5, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n5 >= 0 /\ 1-tmp^0-n5+maxId^0 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-tmp^0-n5 >= 0)), cost: 5*n5
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0

Applied instantiation
Original rule:
l1 -> l1 : tmp^0'=tmp^0+n5, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n5 >= 0 /\ 1-tmp^0-n5+maxId^0 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-tmp^0-n5 >= 0)), cost: 5*n5
New rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ (0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5*id^0-5*tmp^0

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+n8 >= 0 /\ -1-maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n8

Applied unrolling
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10

Applied non-termination processor
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10
New rule:
l1 -> [9] : (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=1+tmp^0, tmp___0^0'=tmp___0^post5, (tmp^0-maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=n10+tmp^0, tmp___0^0'=tmp___0^post5, (-1+n10 >= 0 /\ 1-n10-tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-n10-tmp^0 >= 0)), cost: 5*n10

Applied instantiation
Original rule:
l1 -> l1 : tmp^0'=n10+tmp^0, tmp___0^0'=tmp___0^post5, (-1+n10 >= 0 /\ 1-n10-tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-n10-tmp^0 >= 0)), cost: 5*n10
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0

Applied instantiation
Original rule:
l1 -> l1 : tmp^0'=n10+tmp^0, tmp___0^0'=tmp___0^post5, (-1+n10 >= 0 /\ 1-n10-tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1-id^0+tmp^0 >= 0 \/ id^0-n10-tmp^0 >= 0)), cost: 5*n10
New rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5*id^0-5*tmp^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10+5*maxId^0

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 10+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n21+5*n21*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n21+5*n21*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ (0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -2+id^0-maxId^0 >= 0)), cost: 5-5*tmp^0+10*n21+5*n21*maxId^0+5*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
Second rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (id^0-maxId^0 <= 0 \/ 2-id^0+maxId^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 10-5*tmp^0+5*maxId^0

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (id^0-maxId^0 <= 0 \/ 2-id^0+maxId^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 10-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ maxId^0 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n23+5*n23*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
Second rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ maxId^0 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n23+5*n23*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0)), cost: 5+10*n23+5*n23*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0)), cost: 10+5*maxId^0

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0)), cost: 10+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+n27 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0))), cost: 5*n27*maxId^0+10*n27

Applied chaining
First rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+n27 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0))), cost: 5*n27*maxId^0+10*n27
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n27 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (0 >= 0 /\ -2+id^0-maxId^0 >= 0))), cost: 5-5*tmp^0+5*n27*maxId^0+10*n27+5*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
Second rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (id^0-maxId^0 <= 0 \/ 2-id^0+maxId^0 <= 0)), cost: 10-5*tmp^0+5*maxId^0

Applied acceleration
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (id^0-maxId^0 <= 0 \/ 2-id^0+maxId^0 <= 0)), cost: 10-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n29+5*n29*maxId^0

Applied chaining
First rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5
Second rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n29+5*n29*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ -1-tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0)), cost: 5+10*n29+5*n29*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n3 >= 0 /\ -1-maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n3
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n3 >= 0 /\ 1+maxId^0 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n3

Applied simplification
Original rule:
l1 -> [9] : (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM
New rule:
l1 -> [9] : (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (-1+id^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ (0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5*id^0-5*tmp^0
New rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0), cost: 5*id^0-5*tmp^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+n8 >= 0 /\ -1-maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n8
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+n8 >= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0))), cost: 5*n8

Applied simplification
Original rule:
l1 -> [9] : (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (1-id^0 <= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM
New rule:
l1 -> [9] : (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5*id^0-5*tmp^0
New rule:
l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0), cost: 5*id^0-5*tmp^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n21+5*n21*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-id^0+maxId^0 >= 0 \/ (-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0)) /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0)), cost: 10*n21+5*n21*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ (0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -2+id^0-maxId^0 >= 0)), cost: 5-5*tmp^0+10*n21+5*n21*maxId^0+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-2+id^0-maxId^0 >= 0 \/ (-1-id^0 >= 0 /\ maxId^0 >= 0))), cost: 5-5*tmp^0+10*n21+5*n21*maxId^0+5*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ maxId^0 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n23+5*n23*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0)) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 10*n23+5*n23*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0)), cost: 5+10*n23+5*n23*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5+10*n23+5*n23*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+n27 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -id^0+maxId^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0 /\ maxId^0 >= 0))), cost: 5*n27*maxId^0+10*n27
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+n27 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0) /\ ((-1-id^0 >= 0 /\ maxId^0 >= 0) \/ -1+id^0-tmp^0 >= 0)), cost: 5*n27*maxId^0+10*n27

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n27 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (0 >= 0 /\ -2+id^0-maxId^0 >= 0))), cost: 5-5*tmp^0+5*n27*maxId^0+10*n27+5*maxId^0
New rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n27 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ ((0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ -id^0+maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*n27*maxId^0+10*n27+5*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ -1-tmp___0^post5 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ -1+id^0-maxId^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -id^0+maxId^0 >= 0))), cost: 10*n29+5*n29*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0)) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 10*n29+5*n29*maxId^0

Applied simplification
Original rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ -1-tmp___0^post5 >= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ ((-1-id^0 >= 0 /\ -id^0+maxId^0 >= 0 /\ maxId^0 >= 0) \/ -id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0)), cost: 5+10*n29+5*n29*maxId^0
New rule:
l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 5+10*n29+5*n29*maxId^0

Applied deletion
Removed the following rules: 31 32 33 34

Accelerated simple loops
Start location: l8
  51: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n3 >= 0 /\ 1+maxId^0 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0) \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0))), cost: 5*n3
  52: l1 -> [9] : (-1+tmp___0^post5 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ (-1+id^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM
  53: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
  54: l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0), cost: 5*id^0-5*tmp^0
  55: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+n8 >= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ ((-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0) \/ (-1+id^0-tmp^0 >= 0 /\ -1+id^0 >= 0))), cost: 5*n8
  56: l1 -> [9] : (1-tmp^0+maxId^0 <= 0 /\ 1+maxId^0 <= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0 >= 0 \/ 1+id^0 <= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: NONTERM
  57: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
  58: l1 -> l1 : tmp^0'=id^0, tmp___0^0'=tmp___0^post5, (-1+id^0-tmp^0 >= 0 /\ 1-id^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0), cost: 5*id^0-5*tmp^0
  59: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-id^0+maxId^0 >= 0 \/ (-1+id^0-tmp^0 >= 0 /\ -1+tmp^0-maxId^0 >= 0)) /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0)), cost: 10*n21+5*n21*maxId^0
  60: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ -1+n21 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-2+id^0-maxId^0 >= 0 \/ (-1-id^0 >= 0 /\ maxId^0 >= 0))), cost: 5-5*tmp^0+10*n21+5*n21*maxId^0+5*maxId^0
  61: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0)) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 10*n23+5*n23*maxId^0
  62: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -1+n23 >= 0 /\ 1-tmp^0+maxId^0 <= 0 /\ maxId^0 >= 0 /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0)), cost: 5+10*n23+5*n23*maxId^0
  63: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+n27 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ -1+tmp^0-maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ 1+id^0 <= 0) /\ ((-1-id^0 >= 0 /\ maxId^0 >= 0) \/ -1+id^0-tmp^0 >= 0)), cost: 5*n27*maxId^0+10*n27
  64: l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n27 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ ((0 >= 0 /\ -2+id^0-maxId^0 >= 0) \/ -id^0+maxId^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*n27*maxId^0+10*n27+5*maxId^0
  65: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ (-1-id^0+tmp^0 >= 0 /\ -1-id^0 >= 0)) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 10*n29+5*n29*maxId^0
  66: l1 -> l1 : tmp^0'=0, tmp___0^0'=tmp___0^post5, (1-tmp^0+maxId^0 <= 0 /\ -1+n29 >= 0 /\ maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (1+id^0-tmp^0 <= 0 \/ 1-id^0+tmp^0 <= 0) /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0 >= 0) /\ (-id^0+maxId^0 >= 0 \/ -2+id^0-maxId^0 >= 0)), cost: 5+10*n29+5*n29*maxId^0
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2


Applied chaining
First rule:
l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-1+tmp___0^post5 >= 0 /\ -tmp^0+maxId^0 >= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (id^0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -1-id^0+maxId^0 >= 0), cost: 2-5*id^0+5*maxId^0

Applied chaining
First rule:
l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2
Second rule:
l1 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (-tmp^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0 /\ (-1+id^0-maxId^0 >= 0 \/ -1-id^0+tmp^0 >= 0)), cost: 5-5*tmp^0+5*maxId^0
New rule:
l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (id^0 >= 0 /\ -1-id^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0), cost: 2-5*id^0+5*maxId^0

Applied deletion
Removed the following rules: 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66

Chained accelerated rules with incoming rules
Start location: l8
  23: l8 -> l1 : tmp^0'=1+id^0, (id^0 >= 0 /\ id^0-maxId^0 <= 0), cost: 2
  67: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (id^0 >= 0 /\ -1+tmp___0^post5 >= 0 /\ -1-id^0+maxId^0 >= 0), cost: 2-5*id^0+5*maxId^0
  68: l8 -> l1 : tmp^0'=1+maxId^0, tmp___0^0'=tmp___0^post5, (id^0 >= 0 /\ -1-id^0+maxId^0 >= 0 /\ 1+tmp___0^post5 <= 0), cost: 2-5*id^0+5*maxId^0


Removed unreachable locations and irrelevant leafs
Start location: l8
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0