WORST_CASE(Omega(0),?)

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


Removed unreachable rules and leafs
Start location: l7
   0: l0 -> l1 : c^0'=c^post0, x^0'=x^post0, ox^0'=ox^post0, y^0'=y^post0, (-y^post0+y^0 == 0 /\ 1+x^0-ox^0 <= 0 /\ ox^0-ox^post0 == 0 /\ c^0-c^post0 == 0 /\ x^0-x^post0 == 0), cost: 1
   8: l1 -> l5 : c^0'=c^post8, x^0'=x^post8, ox^0'=ox^post8, y^0'=y^post8, (1-x^0 <= 0 /\ -y^post8+y^0 == 0 /\ -ox^post8+ox^0 == 0 /\ c^0-c^post8 == 0 /\ x^0-x^post8 == 0 /\ 1-y^0 <= 0), cost: 1
   2: l3 -> l1 : c^0'=c^post2, x^0'=x^post2, ox^0'=ox^post2, y^0'=y^post2, (c^0 <= 0 /\ -ox^post2+ox^0 == 0 /\ x^0-x^post2 == 0 /\ -y^post2+y^0 == 0 /\ c^0-c^post2 == 0), cost: 1
   3: l3 -> l1 : c^0'=c^post3, x^0'=x^post3, ox^0'=ox^post3, y^0'=y^post3, (-x^0+ox^post3 == 0 /\ x^0-x^post3 == 0 /\ -1+c^post3 == 0 /\ -y^post3+y^0 == 0), cost: 1
   4: l4 -> l3 : c^0'=c^post4, x^0'=x^post4, ox^0'=ox^post4, y^0'=y^post4, (c^0 <= 0 /\ c^0-c^post4 == 0 /\ -y^post4+y^0 == 0 /\ -ox^post4+ox^0 == 0 /\ -x^post4+x^0 == 0), cost: 1
   5: l4 -> l0 : c^0'=c^post5, x^0'=x^post5, ox^0'=ox^post5, y^0'=y^post5, (c^0-c^post5 == 0 /\ 1-c^0 <= 0 /\ x^0-x^post5 == 0 /\ -y^post5+y^0 == 0 /\ -ox^post5+ox^0 == 0), cost: 1
   6: l5 -> l4 : c^0'=c^post6, x^0'=x^post6, ox^0'=ox^post6, y^0'=y^post6, (1-y^0+y^post6 == 0 /\ x^0-x^post6 == 0 /\ c^0-c^post6 == 0 /\ -ox^post6+ox^0 == 0), cost: 1
   7: l5 -> l4 : c^0'=c^post7, x^0'=x^post7, ox^0'=ox^post7, y^0'=y^post7, (c^0-c^post7 == 0 /\ ox^0-ox^post7 == 0 /\ -y^post7+y^0 == 0 /\ 1-x^0+x^post7 == 0), cost: 1
   9: l6 -> l1 : c^0'=c^post9, x^0'=x^post9, ox^0'=ox^post9, y^0'=y^post9, (c^0 <= 0 /\ -x^post9+x^0 == 0 /\ c^0-c^post9 == 0 /\ -y^post9+y^0 == 0 /\ -ox^post9+ox^0 == 0), cost: 1
  10: l7 -> l6 : c^0'=c^post10, x^0'=x^post10, ox^0'=ox^post10, y^0'=y^post10, (-y^post10+y^0 == 0 /\ c^0-c^post10 == 0 /\ -ox^post10+ox^0 == 0 /\ x^0-x^post10 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : c^0'=c^post0, x^0'=x^post0, ox^0'=ox^post0, y^0'=y^post0, (-y^post0+y^0 == 0 /\ 1+x^0-ox^0 <= 0 /\ ox^0-ox^post0 == 0 /\ c^0-c^post0 == 0 /\ x^0-x^post0 == 0), cost: 1
New rule:
l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : c^0'=c^post2, x^0'=x^post2, ox^0'=ox^post2, y^0'=y^post2, (c^0 <= 0 /\ -ox^post2+ox^0 == 0 /\ x^0-x^post2 == 0 /\ -y^post2+y^0 == 0 /\ c^0-c^post2 == 0), cost: 1
New rule:
l3 -> l1 : c^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l1 : c^0'=c^post3, x^0'=x^post3, ox^0'=ox^post3, y^0'=y^post3, (-x^0+ox^post3 == 0 /\ x^0-x^post3 == 0 /\ -1+c^post3 == 0 /\ -y^post3+y^0 == 0), cost: 1
New rule:
l3 -> l1 : c^0'=1, ox^0'=x^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l3 : c^0'=c^post4, x^0'=x^post4, ox^0'=ox^post4, y^0'=y^post4, (c^0 <= 0 /\ c^0-c^post4 == 0 /\ -y^post4+y^0 == 0 /\ -ox^post4+ox^0 == 0 /\ -x^post4+x^0 == 0), cost: 1
New rule:
l4 -> l3 : c^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l0 : c^0'=c^post5, x^0'=x^post5, ox^0'=ox^post5, y^0'=y^post5, (c^0-c^post5 == 0 /\ 1-c^0 <= 0 /\ x^0-x^post5 == 0 /\ -y^post5+y^0 == 0 /\ -ox^post5+ox^0 == 0), cost: 1
New rule:
l4 -> l0 : -1+c^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : c^0'=c^post6, x^0'=x^post6, ox^0'=ox^post6, y^0'=y^post6, (1-y^0+y^post6 == 0 /\ x^0-x^post6 == 0 /\ c^0-c^post6 == 0 /\ -ox^post6+ox^0 == 0), cost: 1
New rule:
l5 -> l4 : y^0'=-1+y^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : c^0'=c^post7, x^0'=x^post7, ox^0'=ox^post7, y^0'=y^post7, (c^0-c^post7 == 0 /\ ox^0-ox^post7 == 0 /\ -y^post7+y^0 == 0 /\ 1-x^0+x^post7 == 0), cost: 1
New rule:
l5 -> l4 : x^0'=-1+x^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l5 : c^0'=c^post8, x^0'=x^post8, ox^0'=ox^post8, y^0'=y^post8, (1-x^0 <= 0 /\ -y^post8+y^0 == 0 /\ -ox^post8+ox^0 == 0 /\ c^0-c^post8 == 0 /\ x^0-x^post8 == 0 /\ 1-y^0 <= 0), cost: 1
New rule:
l1 -> l5 : (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 1

Applied preprocessing
Original rule:
l6 -> l1 : c^0'=c^post9, x^0'=x^post9, ox^0'=ox^post9, y^0'=y^post9, (c^0 <= 0 /\ -x^post9+x^0 == 0 /\ c^0-c^post9 == 0 /\ -y^post9+y^0 == 0 /\ -ox^post9+ox^0 == 0), cost: 1
New rule:
l6 -> l1 : c^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l6 : c^0'=c^post10, x^0'=x^post10, ox^0'=ox^post10, y^0'=y^post10, (-y^post10+y^0 == 0 /\ c^0-c^post10 == 0 /\ -ox^post10+ox^0 == 0 /\ x^0-x^post10 == 0), cost: 1
New rule:
l7 -> l6 : TRUE, cost: 1

Simplified rules
Start location: l7
  11: l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
  18: l1 -> l5 : (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 1
  12: l3 -> l1 : c^0 <= 0, cost: 1
  13: l3 -> l1 : c^0'=1, ox^0'=x^0, TRUE, cost: 1
  14: l4 -> l3 : c^0 <= 0, cost: 1
  15: l4 -> l0 : -1+c^0 >= 0, cost: 1
  16: l5 -> l4 : y^0'=-1+y^0, TRUE, cost: 1
  17: l5 -> l4 : x^0'=-1+x^0, TRUE, cost: 1
  19: l6 -> l1 : c^0 <= 0, 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 -> l1 : c^0 <= 0, cost: 1
New rule:
l7 -> l1 : c^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 19 20

Eliminating location l0 by chaining:

Applied chaining
First rule:
l4 -> l0 : -1+c^0 >= 0, cost: 1
Second rule:
l0 -> l1 : 1+x^0-ox^0 <= 0, cost: 1
New rule:
l4 -> l1 : (1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 11 15

Eliminated locations on linear paths
Start location: l7
  18: l1 -> l5 : (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 1
  12: l3 -> l1 : c^0 <= 0, cost: 1
  13: l3 -> l1 : c^0'=1, ox^0'=x^0, TRUE, cost: 1
  14: l4 -> l3 : c^0 <= 0, cost: 1
  22: l4 -> l1 : (1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0), cost: 2
  16: l5 -> l4 : y^0'=-1+y^0, TRUE, cost: 1
  17: l5 -> l4 : x^0'=-1+x^0, TRUE, cost: 1
  21: l7 -> l1 : c^0 <= 0, cost: 2


Eliminating location l5 by chaining:

Applied chaining
First rule:
l1 -> l5 : (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 1
Second rule:
l5 -> l4 : y^0'=-1+y^0, TRUE, cost: 1
New rule:
l1 -> l4 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2

Applied chaining
First rule:
l1 -> l5 : (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 1
Second rule:
l5 -> l4 : x^0'=-1+x^0, TRUE, cost: 1
New rule:
l1 -> l4 : x^0'=-1+x^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2

Applied deletion
Removed the following rules: 16 17 18

Eliminating location l3 by chaining:

Applied chaining
First rule:
l4 -> l3 : c^0 <= 0, cost: 1
Second rule:
l3 -> l1 : c^0 <= 0, cost: 1
New rule:
l4 -> l1 : c^0 <= 0, cost: 2

Applied chaining
First rule:
l4 -> l3 : c^0 <= 0, cost: 1
Second rule:
l3 -> l1 : c^0'=1, ox^0'=x^0, TRUE, cost: 1
New rule:
l4 -> l1 : c^0'=1, ox^0'=x^0, c^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 12 13 14

Eliminated locations on tree-shaped paths
Start location: l7
  23: l1 -> l4 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
  24: l1 -> l4 : x^0'=-1+x^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
  22: l4 -> l1 : (1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0), cost: 2
  25: l4 -> l1 : c^0 <= 0, cost: 2
  26: l4 -> l1 : c^0'=1, ox^0'=x^0, c^0 <= 0, cost: 2
  21: l7 -> l1 : c^0 <= 0, cost: 2


Eliminating location l4 by chaining:

Applied chaining
First rule:
l1 -> l4 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : (1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0), cost: 2
New rule:
l1 -> l1 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ 1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l4 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : c^0 <= 0, cost: 2
New rule:
l1 -> l1 : y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l4 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : c^0'=1, ox^0'=x^0, c^0 <= 0, cost: 2
New rule:
l1 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l4 : x^0'=-1+x^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : (1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0), cost: 2
New rule:
l1 -> l1 : x^0'=-1+x^0, (x^0-ox^0 <= 0 /\ -1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l4 : x^0'=-1+x^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : c^0 <= 0, cost: 2
New rule:
l1 -> l1 : x^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied chaining
First rule:
l1 -> l4 : x^0'=-1+x^0, (-1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 2
Second rule:
l4 -> l1 : c^0'=1, ox^0'=x^0, c^0 <= 0, cost: 2
New rule:
l1 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4

Applied deletion
Removed the following rules: 22 23 24 25 26

Eliminated locations on tree-shaped paths
Start location: l7
  27: l1 -> l1 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ 1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  28: l1 -> l1 : y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  29: l1 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  30: l1 -> l1 : x^0'=-1+x^0, (x^0-ox^0 <= 0 /\ -1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  31: l1 -> l1 : x^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  32: l1 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  21: l7 -> l1 : c^0 <= 0, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : y^0'=-1+y^0, (-1+x^0 >= 0 /\ 1+x^0-ox^0 <= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l1 -> l1 : y^0'=y^0-n5, (-1+x^0 >= 0 /\ -1+c^0 >= 0 /\ y^0-n5 >= 0 /\ -1-x^0+ox^0 >= 0 /\ n5 >= 0), cost: 4*n5

Applied instantiation
Original rule:
l1 -> l1 : y^0'=y^0-n5, (-1+x^0 >= 0 /\ -1+c^0 >= 0 /\ y^0-n5 >= 0 /\ -1-x^0+ox^0 >= 0 /\ n5 >= 0), cost: 4*n5
New rule:
l1 -> l1 : y^0'=0, (0 >= 0 /\ -1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1-x^0+ox^0 >= 0 /\ y^0 >= 0), cost: 4*y^0

Applied acceleration
Original rule:
l1 -> l1 : y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l1 -> l1 : y^0'=-n7+y^0, (-1+x^0 >= 0 /\ n7 >= 0 /\ -c^0 >= 0 /\ -n7+y^0 >= 0), cost: 4*n7

Applied instantiation
Original rule:
l1 -> l1 : y^0'=-n7+y^0, (-1+x^0 >= 0 /\ n7 >= 0 /\ -c^0 >= 0 /\ -n7+y^0 >= 0), cost: 4*n7
New rule:
l1 -> l1 : y^0'=0, (0 >= 0 /\ -1+x^0 >= 0 /\ -c^0 >= 0 /\ y^0 >= 0), cost: 4*y^0

Applied acceleration
Original rule:
l1 -> l1 : x^0'=-1+x^0, (x^0-ox^0 <= 0 /\ -1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l1 -> l1 : x^0'=x^0-n10, (-1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ x^0-n10 >= 0 /\ n10 >= 0 /\ -1+y^0 >= 0), cost: 4*n10

Applied instantiation
Original rule:
l1 -> l1 : x^0'=x^0-n10, (-1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ x^0-n10 >= 0 /\ n10 >= 0 /\ -1+y^0 >= 0), cost: 4*n10
New rule:
l1 -> l1 : x^0'=0, (0 >= 0 /\ x^0 >= 0 /\ -1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0

Applied acceleration
Original rule:
l1 -> l1 : x^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l1 -> l1 : x^0'=x^0-n12, (-c^0 >= 0 /\ x^0-n12 >= 0 /\ n12 >= 0 /\ -1+y^0 >= 0), cost: 4*n12

Applied instantiation
Original rule:
l1 -> l1 : x^0'=x^0-n12, (-c^0 >= 0 /\ x^0-n12 >= 0 /\ n12 >= 0 /\ -1+y^0 >= 0), cost: 4*n12
New rule:
l1 -> l1 : x^0'=0, (0 >= 0 /\ x^0 >= 0 /\ -c^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0

Applied simplification
Original rule:
l1 -> l1 : y^0'=0, (0 >= 0 /\ -1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1-x^0+ox^0 >= 0 /\ y^0 >= 0), cost: 4*y^0
New rule:
l1 -> l1 : y^0'=0, (-1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1-x^0+ox^0 >= 0 /\ y^0 >= 0), cost: 4*y^0

Applied simplification
Original rule:
l1 -> l1 : y^0'=0, (0 >= 0 /\ -1+x^0 >= 0 /\ -c^0 >= 0 /\ y^0 >= 0), cost: 4*y^0
New rule:
l1 -> l1 : y^0'=0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ y^0 >= 0), cost: 4*y^0

Applied simplification
Original rule:
l1 -> l1 : x^0'=0, (0 >= 0 /\ x^0 >= 0 /\ -1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0
New rule:
l1 -> l1 : x^0'=0, (x^0 >= 0 /\ -1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0

Applied simplification
Original rule:
l1 -> l1 : x^0'=0, (0 >= 0 /\ x^0 >= 0 /\ -c^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0
New rule:
l1 -> l1 : x^0'=0, (c^0 <= 0 /\ x^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0

Applied deletion
Removed the following rules: 27 28 30 31

Accelerated simple loops
Start location: l7
  29: l1 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  32: l1 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
  37: l1 -> l1 : y^0'=0, (-1+x^0 >= 0 /\ -1+c^0 >= 0 /\ -1-x^0+ox^0 >= 0 /\ y^0 >= 0), cost: 4*y^0
  38: l1 -> l1 : y^0'=0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ y^0 >= 0), cost: 4*y^0
  39: l1 -> l1 : x^0'=0, (x^0 >= 0 /\ -1+c^0 >= 0 /\ -x^0+ox^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0
  40: l1 -> l1 : x^0'=0, (c^0 <= 0 /\ x^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0
  21: l7 -> l1 : c^0 <= 0, cost: 2


Applied chaining
First rule:
l7 -> l1 : c^0 <= 0, cost: 2
Second rule:
l1 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l7 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 6

Applied chaining
First rule:
l7 -> l1 : c^0 <= 0, cost: 2
Second rule:
l1 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 4
New rule:
l7 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 6

Applied chaining
First rule:
l7 -> l1 : c^0 <= 0, cost: 2
Second rule:
l1 -> l1 : y^0'=0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ y^0 >= 0), cost: 4*y^0
New rule:
l7 -> l1 : y^0'=0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ y^0 >= 0), cost: 2+4*y^0

Applied chaining
First rule:
l7 -> l1 : c^0 <= 0, cost: 2
Second rule:
l1 -> l1 : x^0'=0, (c^0 <= 0 /\ x^0 >= 0 /\ -1+y^0 >= 0), cost: 4*x^0
New rule:
l7 -> l1 : x^0'=0, (c^0 <= 0 /\ x^0 >= 0 /\ -1+y^0 >= 0), cost: 2+4*x^0

Applied deletion
Removed the following rules: 29 32 37 38 39 40

Chained accelerated rules with incoming rules
Start location: l7
  21: l7 -> l1 : c^0 <= 0, cost: 2
  41: l7 -> l1 : c^0'=1, ox^0'=x^0, y^0'=-1+y^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 6
  42: l7 -> l1 : c^0'=1, x^0'=-1+x^0, ox^0'=-1+x^0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ -1+y^0 >= 0), cost: 6
  43: l7 -> l1 : y^0'=0, (c^0 <= 0 /\ -1+x^0 >= 0 /\ y^0 >= 0), cost: 2+4*y^0
  44: l7 -> l1 : x^0'=0, (c^0 <= 0 /\ x^0 >= 0 /\ -1+y^0 >= 0), cost: 2+4*x^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