WORST_CASE(Omega(0),?)

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


Removed unreachable rules and leafs
Start location: l7
   3: l0 -> l2 : tmp_7^0'=tmp_7^post3, y_6^0'=y_6^post3, Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ -Result_4^post3+Result_4^0 == 0 /\ 2-y_6^0+x_5^post3 == 0 /\ 1-y_6^0-x_5^0 <= 0 /\ 1-y_6^0 <= 0 /\ 1-x_5^0 <= 0 /\ -tmp_7^post3 <= 0 /\ tmp_7^post3 <= 0 /\ -1+y_6^post3-x_5^post3 == 0), cost: 1
   5: l0 -> l4 : tmp_7^0'=tmp_7^post5, y_6^0'=y_6^post5, Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ y_6^0-y_6^post5 == 0 /\ 1-y_6^0-x_5^0 <= 0 /\ 1-y_6^0 <= 0 /\ x_5^0-x_5^post5 == 0 /\ 1-x_5^0 <= 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1
   4: l2 -> l0 : tmp_7^0'=tmp_7^post4, y_6^0'=y_6^post4, Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (-Result_4^post4+Result_4^0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -tmp_7^post4+tmp_7^0 == 0), cost: 1
   6: l4 -> l5 : tmp_7^0'=tmp_7^post6, y_6^0'=y_6^post6, Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (tmp_7^0-tmp_7^post6 == 0 /\ 1+tmp_7^0 <= 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0 /\ -x_5^post6+x_5^0 == 0), cost: 1
   7: l4 -> l5 : tmp_7^0'=tmp_7^post7, y_6^0'=y_6^post7, Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (-x_5^post7+x_5^0 == 0 /\ 1-tmp_7^0 <= 0 /\ -Result_4^post7+Result_4^0 == 0 /\ -y_6^post7+y_6^0 == 0 /\ tmp_7^0-tmp_7^post7 == 0), cost: 1
   8: l5 -> l3 : tmp_7^0'=tmp_7^post8, y_6^0'=y_6^post8, Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (1-x_5^0+x_5^post8 == 0 /\ y_6^post8-x_5^post8 == 0 /\ -Result_4^post8+Result_4^0 == 0 /\ -tmp_7^post8+tmp_7^0 == 0), cost: 1
   9: l3 -> l0 : tmp_7^0'=tmp_7^post9, y_6^0'=y_6^post9, Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (-x_5^post9+x_5^0 == 0 /\ y_6^0-y_6^post9 == 0 /\ tmp_7^0-tmp_7^post9 == 0 /\ Result_4^0-Result_4^post9 == 0), cost: 1
  10: l6 -> l0 : tmp_7^0'=tmp_7^post10, y_6^0'=y_6^post10, Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (tmp_7^0-tmp_7^post10 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -x_5^post10+x_5^0 == 0 /\ y_6^0-y_6^post10 == 0), cost: 1
  11: l7 -> l6 : tmp_7^0'=tmp_7^post11, y_6^0'=y_6^post11, Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (-y_6^post11+y_6^0 == 0 /\ tmp_7^0-tmp_7^post11 == 0 /\ -Result_4^post11+Result_4^0 == 0 /\ -x_5^post11+x_5^0 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l2 : tmp_7^0'=tmp_7^post3, y_6^0'=y_6^post3, Result_4^0'=Result_4^post3, x_5^0'=x_5^post3, (0 == 0 /\ -Result_4^post3+Result_4^0 == 0 /\ 2-y_6^0+x_5^post3 == 0 /\ 1-y_6^0-x_5^0 <= 0 /\ 1-y_6^0 <= 0 /\ 1-x_5^0 <= 0 /\ -tmp_7^post3 <= 0 /\ tmp_7^post3 <= 0 /\ -1+y_6^post3-x_5^post3 == 0), cost: 1
New rule:
l0 -> l2 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l2 -> l0 : tmp_7^0'=tmp_7^post4, y_6^0'=y_6^post4, Result_4^0'=Result_4^post4, x_5^0'=x_5^post4, (-Result_4^post4+Result_4^0 == 0 /\ -x_5^post4+x_5^0 == 0 /\ -y_6^post4+y_6^0 == 0 /\ -tmp_7^post4+tmp_7^0 == 0), cost: 1
New rule:
l2 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l0 -> l4 : tmp_7^0'=tmp_7^post5, y_6^0'=y_6^post5, Result_4^0'=Result_4^post5, x_5^0'=x_5^post5, (0 == 0 /\ y_6^0-y_6^post5 == 0 /\ 1-y_6^0-x_5^0 <= 0 /\ 1-y_6^0 <= 0 /\ x_5^0-x_5^post5 == 0 /\ 1-x_5^0 <= 0 /\ Result_4^0-Result_4^post5 == 0), cost: 1
New rule:
l0 -> l4 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : tmp_7^0'=tmp_7^post6, y_6^0'=y_6^post6, Result_4^0'=Result_4^post6, x_5^0'=x_5^post6, (tmp_7^0-tmp_7^post6 == 0 /\ 1+tmp_7^0 <= 0 /\ Result_4^0-Result_4^post6 == 0 /\ y_6^0-y_6^post6 == 0 /\ -x_5^post6+x_5^0 == 0), cost: 1
New rule:
l4 -> l5 : 1+tmp_7^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : tmp_7^0'=tmp_7^post7, y_6^0'=y_6^post7, Result_4^0'=Result_4^post7, x_5^0'=x_5^post7, (-x_5^post7+x_5^0 == 0 /\ 1-tmp_7^0 <= 0 /\ -Result_4^post7+Result_4^0 == 0 /\ -y_6^post7+y_6^0 == 0 /\ tmp_7^0-tmp_7^post7 == 0), cost: 1
New rule:
l4 -> l5 : -1+tmp_7^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l3 : tmp_7^0'=tmp_7^post8, y_6^0'=y_6^post8, Result_4^0'=Result_4^post8, x_5^0'=x_5^post8, (1-x_5^0+x_5^post8 == 0 /\ y_6^post8-x_5^post8 == 0 /\ -Result_4^post8+Result_4^0 == 0 /\ -tmp_7^post8+tmp_7^0 == 0), cost: 1
New rule:
l5 -> l3 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l0 : tmp_7^0'=tmp_7^post9, y_6^0'=y_6^post9, Result_4^0'=Result_4^post9, x_5^0'=x_5^post9, (-x_5^post9+x_5^0 == 0 /\ y_6^0-y_6^post9 == 0 /\ tmp_7^0-tmp_7^post9 == 0 /\ Result_4^0-Result_4^post9 == 0), cost: 1
New rule:
l3 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l0 : tmp_7^0'=tmp_7^post10, y_6^0'=y_6^post10, Result_4^0'=Result_4^post10, x_5^0'=x_5^post10, (tmp_7^0-tmp_7^post10 == 0 /\ Result_4^0-Result_4^post10 == 0 /\ -x_5^post10+x_5^0 == 0 /\ y_6^0-y_6^post10 == 0), cost: 1
New rule:
l6 -> l0 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l6 : tmp_7^0'=tmp_7^post11, y_6^0'=y_6^post11, Result_4^0'=Result_4^post11, x_5^0'=x_5^post11, (-y_6^post11+y_6^0 == 0 /\ tmp_7^0-tmp_7^post11 == 0 /\ -Result_4^post11+Result_4^0 == 0 /\ -x_5^post11+x_5^0 == 0), cost: 1
New rule:
l7 -> l6 : TRUE, cost: 1

Simplified rules
Start location: l7
  12: l0 -> l2 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
  14: l0 -> l4 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
  13: l2 -> l0 : TRUE, cost: 1
  15: l4 -> l5 : 1+tmp_7^0 <= 0, cost: 1
  16: l4 -> l5 : -1+tmp_7^0 >= 0, cost: 1
  17: l5 -> l3 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 1
  18: l3 -> l0 : TRUE, cost: 1
  19: l6 -> l0 : TRUE, cost: 1
  20: l7 -> l6 : TRUE, cost: 1


Eliminating location l6 by chaining:

Applied chaining
First rule:
l7 -> l6 : TRUE, cost: 1
Second rule:
l6 -> l0 : TRUE, cost: 1
New rule:
l7 -> l0 : TRUE, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l2 by chaining:

Applied chaining
First rule:
l0 -> l2 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
Second rule:
l2 -> l0 : TRUE, cost: 1
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 12 13

Eliminating location l3 by chaining:

Applied chaining
First rule:
l5 -> l3 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 1
Second rule:
l3 -> l0 : TRUE, cost: 1
New rule:
l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2

Applied deletion
Removed the following rules: 17 18

Eliminated locations on linear paths
Start location: l7
  14: l0 -> l4 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
  22: l0 -> l0 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 2
  15: l4 -> l5 : 1+tmp_7^0 <= 0, cost: 1
  16: l4 -> l5 : -1+tmp_7^0 >= 0, cost: 1
  23: l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
  21: l7 -> l0 : TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=-1+y_6^0, x_5^0'=-2+y_6^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 2
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=-n+y_6^0, x_5^0'=-1-n+y_6^0, (-n+y_6^0 >= 0 /\ -1+n >= 0 /\ -1+x_5^0 >= 0 /\ -1-n+y_6^0 >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_GjoDCb.txt

Applied instantiation
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=-n+y_6^0, x_5^0'=-1-n+y_6^0, (-n+y_6^0 >= 0 /\ -1+n >= 0 /\ -1+x_5^0 >= 0 /\ -1-n+y_6^0 >= 0), cost: 2*n
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (0 >= 0 /\ 1 >= 0 /\ -1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0

Applied instantiation
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=-n+y_6^0, x_5^0'=-1-n+y_6^0, (-n+y_6^0 >= 0 /\ -1+n >= 0 /\ -1+x_5^0 >= 0 /\ -1-n+y_6^0 >= 0), cost: 2*n
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=0, x_5^0'=-1, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ -1 >= 0), cost: 2*y_6^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (0 >= 0 /\ 1 >= 0 /\ -1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0

Applied deletion
Removed the following rules: 22

Accelerated simple loops
Start location: l7
  14: l0 -> l4 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
  25: l0 -> l0 : tmp_7^0'=0, y_6^0'=0, x_5^0'=-1, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ -1 >= 0), cost: 2*y_6^0
  26: l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0
  15: l4 -> l5 : 1+tmp_7^0 <= 0, cost: 1
  16: l4 -> l5 : -1+tmp_7^0 >= 0, cost: 1
  23: l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
  21: l7 -> l0 : TRUE, cost: 2


Applied chaining
First rule:
l7 -> l0 : TRUE, cost: 2
Second rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0
New rule:
l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0

Applied chaining
First rule:
l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
Second rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: -2+2*y_6^0
New rule:
l5 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, -3+x_5^0 >= 0, cost: -2+2*x_5^0

Applied deletion
Removed the following rules: 25 26

Chained accelerated rules with incoming rules
Start location: l7
  14: l0 -> l4 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0), cost: 1
  15: l4 -> l5 : 1+tmp_7^0 <= 0, cost: 1
  16: l4 -> l5 : -1+tmp_7^0 >= 0, cost: 1
  23: l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
  28: l5 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, -3+x_5^0 >= 0, cost: -2+2*x_5^0
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0


Eliminating location l4 by chaining:

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

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

Applied deletion
Removed the following rules: 14 15 16

Eliminated locations on tree-shaped paths
Start location: l7
  29: l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 2
  30: l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 2
  23: l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
  28: l5 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, -3+x_5^0 >= 0, cost: -2+2*x_5^0
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0


Eliminating location l5 by chaining:

Applied chaining
First rule:
l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 2
Second rule:
l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4

Applied chaining
First rule:
l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 2
Second rule:
l5 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, -3+x_5^0 >= 0, cost: -2+2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ 1+tmp_7^post5 <= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Applied chaining
First rule:
l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 2
Second rule:
l5 -> l0 : y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, TRUE, cost: 2
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4

Applied chaining
First rule:
l0 -> l5 : tmp_7^0'=tmp_7^post5, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 2
Second rule:
l5 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, -3+x_5^0 >= 0, cost: -2+2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Applied deletion
Removed the following rules: 23 28 29 30

Eliminated locations on tree-shaped paths
Start location: l7
  31: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4
  32: l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ 1+tmp_7^post5 <= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
  33: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4
  34: l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0


Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ 1+tmp_7^post5 <= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0

Simplified simple loops
Start location: l7
  31: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4
  33: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4
  35: l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0


Applied acceleration
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-n0+x_5^0, x_5^0'=-n0+x_5^0, (-1+n0 >= 0 /\ -1+y_6^0 >= 0 /\ -n0+x_5^0 >= 0 /\ -1-tmp_7^post5 >= 0), cost: 4*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_BdiFbP.txt

Applied instantiation
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-n0+x_5^0, x_5^0'=-n0+x_5^0, (-1+n0 >= 0 /\ -1+y_6^0 >= 0 /\ -n0+x_5^0 >= 0 /\ -1-tmp_7^post5 >= 0), cost: 4*n0
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ -1-tmp_7^post5 >= 0), cost: 4*x_5^0

Applied acceleration
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-1+x_5^0, x_5^0'=-1+x_5^0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-n1+x_5^0, x_5^0'=-n1+x_5^0, (-1+n1 >= 0 /\ -1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -n1+x_5^0 >= 0), cost: 4*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_HNOGhb.txt

Applied instantiation
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=-n1+x_5^0, x_5^0'=-n1+x_5^0, (-1+n1 >= 0 /\ -1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -n1+x_5^0 >= 0), cost: 4*n1
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4*x_5^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ -1-tmp_7^post5 >= 0), cost: 4*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4*x_5^0

Applied simplification
Original rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (0 >= 0 /\ -1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4*x_5^0
New rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4*x_5^0

Applied deletion
Removed the following rules: 31 33

Accelerated simple loops
Start location: l7
  35: l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
  38: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4*x_5^0
  39: l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4*x_5^0
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0


Applied chaining
First rule:
l7 -> l0 : TRUE, cost: 2
Second rule:
l0 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2*x_5^0
New rule:
l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2+2*x_5^0

Applied chaining
First rule:
l7 -> l0 : TRUE, cost: 2
Second rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 4*x_5^0
New rule:
l7 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 2+4*x_5^0

Applied chaining
First rule:
l7 -> l0 : TRUE, cost: 2
Second rule:
l0 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 4*x_5^0
New rule:
l7 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*x_5^0

Applied deletion
Removed the following rules: 35 38 39

Chained accelerated rules with incoming rules
Start location: l7
  21: l7 -> l0 : TRUE, cost: 2
  27: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+x_5^0 >= 0 /\ -2+y_6^0 >= 0), cost: 2*y_6^0
  40: l7 -> l0 : tmp_7^0'=0, y_6^0'=1, x_5^0'=0, (-1+y_6^0 >= 0 /\ -3+x_5^0 >= 0), cost: 2+2*x_5^0
  41: l7 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+x_5^0 >= 0 /\ 1+tmp_7^post5 <= 0), cost: 2+4*x_5^0
  42: l7 -> l0 : tmp_7^0'=tmp_7^post5, y_6^0'=0, x_5^0'=0, (-1+y_6^0 >= 0 /\ -1+tmp_7^post5 >= 0 /\ -1+x_5^0 >= 0), cost: 2+4*x_5^0


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0