WORST_CASE(Omega(0),?)

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


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

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

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

Applied preprocessing
Original rule:
l1 -> l2 : x^0'=x^post3, y^0'=y^post3, (2-x^0 <= 0 /\ x^0-x^post3 == 0 /\ y^0-y^post3 == 0), cost: 1
New rule:
l1 -> l2 : -2+x^0 >= 0, cost: 1

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

Applied preprocessing
Original rule:
l2 -> l3 : x^0'=x^post5, y^0'=y^post5, (3-x^0 <= 0 /\ y^0-y^post5 == 0 /\ x^0-x^post5 == 0), cost: 1
New rule:
l2 -> l3 : -3+x^0 >= 0, cost: 1

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

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

Applied preprocessing
Original rule:
l4 -> l0 : x^0'=x^post8, y^0'=y^post8, (0 == 0 /\ x^0-x^post8 == 0), cost: 1
New rule:
l4 -> l0 : y^0'=y^post8, 0 == 0, cost: 1

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

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

Simplified rules
Start location: l6
  11: l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
  12: l0 -> l1 : x^0'=y^0, x^0-2*y^0 == 0, cost: 1
  13: l1 -> l2 : x^0 <= 0, cost: 1
  14: l1 -> l2 : -2+x^0 >= 0, cost: 1
  15: l2 -> l3 : -1+x^0 <= 0, cost: 1
  16: l2 -> l3 : -3+x^0 >= 0, cost: 1
  17: l3 -> l4 : -3+x^0 <= 0, cost: 1
  18: l3 -> l4 : -5+x^0 >= 0, cost: 1
  19: l4 -> l0 : y^0'=y^post8, 0 == 0, cost: 1
  20: l5 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 1
  21: l6 -> l5 : TRUE, cost: 1


Eliminating location l5 by chaining:

Applied chaining
First rule:
l6 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 1
New rule:
l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2

Applied deletion
Removed the following rules: 20 21

Eliminated locations on linear paths
Start location: l6
  11: l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
  12: l0 -> l1 : x^0'=y^0, x^0-2*y^0 == 0, cost: 1
  13: l1 -> l2 : x^0 <= 0, cost: 1
  14: l1 -> l2 : -2+x^0 >= 0, cost: 1
  15: l2 -> l3 : -1+x^0 <= 0, cost: 1
  16: l2 -> l3 : -3+x^0 >= 0, cost: 1
  17: l3 -> l4 : -3+x^0 <= 0, cost: 1
  18: l3 -> l4 : -5+x^0 >= 0, cost: 1
  19: l4 -> l0 : y^0'=y^post8, 0 == 0, cost: 1
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Eliminating location l2 by chaining:

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

Applied simplification
Original rule:
l1 -> l3 : (x^0 <= 0 /\ -1+x^0 <= 0), cost: 2
New rule:
l1 -> l3 : x^0 <= 0, cost: 2

Applied chaining
First rule:
l1 -> l2 : -2+x^0 >= 0, cost: 1
Second rule:
l2 -> l3 : -3+x^0 >= 0, cost: 1
New rule:
l1 -> l3 : (-3+x^0 >= 0 /\ -2+x^0 >= 0), cost: 2

Applied simplification
Original rule:
l1 -> l3 : (-3+x^0 >= 0 /\ -2+x^0 >= 0), cost: 2
New rule:
l1 -> l3 : -3+x^0 >= 0, cost: 2

Applied deletion
Removed the following rules: 13 14 15 16

Eliminating location l4 by chaining:

Applied chaining
First rule:
l3 -> l4 : -3+x^0 <= 0, cost: 1
Second rule:
l4 -> l0 : y^0'=y^post8, 0 == 0, cost: 1
New rule:
l3 -> l0 : y^0'=y^post8, (0 == 0 /\ -3+x^0 <= 0), cost: 2

Applied simplification
Original rule:
l3 -> l0 : y^0'=y^post8, (0 == 0 /\ -3+x^0 <= 0), cost: 2
New rule:
l3 -> l0 : y^0'=y^post8, -3+x^0 <= 0, cost: 2

Applied chaining
First rule:
l3 -> l4 : -5+x^0 >= 0, cost: 1
Second rule:
l4 -> l0 : y^0'=y^post8, 0 == 0, cost: 1
New rule:
l3 -> l0 : y^0'=y^post8, (0 == 0 /\ -5+x^0 >= 0), cost: 2

Applied simplification
Original rule:
l3 -> l0 : y^0'=y^post8, (0 == 0 /\ -5+x^0 >= 0), cost: 2
New rule:
l3 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 2

Applied deletion
Removed the following rules: 17 18 19

Eliminated locations on tree-shaped paths
Start location: l6
  11: l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
  12: l0 -> l1 : x^0'=y^0, x^0-2*y^0 == 0, cost: 1
  23: l1 -> l3 : x^0 <= 0, cost: 2
  24: l1 -> l3 : -3+x^0 >= 0, cost: 2
  25: l3 -> l0 : y^0'=y^post8, -3+x^0 <= 0, cost: 2
  26: l3 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 2
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Applied merging
first rule:
l1 -> l3 : x^0 <= 0, cost: 2
second rule:
l1 -> l3 : -3+x^0 >= 0, cost: 2
new rule:
l1 -> l3 : (x^0 <= 0 \/ -3+x^0 >= 0), cost: 2

Merged rules
Start location: l6
  11: l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
  12: l0 -> l1 : x^0'=y^0, x^0-2*y^0 == 0, cost: 1
  27: l1 -> l3 : (x^0 <= 0 \/ -3+x^0 >= 0), cost: 2
  25: l3 -> l0 : y^0'=y^post8, -3+x^0 <= 0, cost: 2
  26: l3 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 2
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Eliminating location l3 by chaining:

Applied chaining
First rule:
l1 -> l3 : (x^0 <= 0 \/ -3+x^0 >= 0), cost: 2
Second rule:
l3 -> l0 : y^0'=y^post8, -3+x^0 <= 0, cost: 2
New rule:
l1 -> l0 : y^0'=y^post8, (-3+x^0 <= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 4

Applied chaining
First rule:
l1 -> l3 : (x^0 <= 0 \/ -3+x^0 >= 0), cost: 2
Second rule:
l3 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 2
New rule:
l1 -> l0 : y^0'=y^post8, (-5+x^0 >= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 4

Applied simplification
Original rule:
l1 -> l0 : y^0'=y^post8, (-5+x^0 >= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 4
New rule:
l1 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 4

Applied deletion
Removed the following rules: 25 26 27

Eliminated locations on tree-shaped paths
Start location: l6
  11: l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
  12: l0 -> l1 : x^0'=y^0, x^0-2*y^0 == 0, cost: 1
  28: l1 -> l0 : y^0'=y^post8, (-3+x^0 <= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 4
  29: l1 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 4
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Eliminating location l0 by chaining:

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

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

Applied simplification
Original rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ -3+x^0 <= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
New rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0 /\ -3+x^0 <= 0), cost: 5

Applied chaining
First rule:
l1 -> l0 : y^0'=y^post8, -5+x^0 >= 0, cost: 4
Second rule:
l0 -> l1 : x^0'=1+3*x^0, 1-x^0+2*y^0 == 0, cost: 1
New rule:
l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (1-x^0+2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5

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

Applied deletion
Removed the following rules: 11 12 28 29

Eliminated locations on tree-shaped paths
Start location: l6
  30: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
  31: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0 /\ -3+x^0 <= 0), cost: 5
  32: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (1-x^0+2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  33: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Applied simplification
Original rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0 /\ -3+x^0 <= 0), cost: 5
New rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0), cost: 5

Simplified simple loops
Start location: l6
  30: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
  32: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (1-x^0+2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  33: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  34: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0), cost: 5
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Applied acceleration
Original rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0), cost: 5
New rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (-y^post8 >= 0 /\ x^0-2*y^post8 >= 0 /\ -1+n6 >= 0 /\ ((-y^post8 >= 0 /\ -x^0 >= 0) \/ (-y^post8 >= 0 /\ -x^0+2*y^post8 >= 0) \/ (-x^0 >= 0 /\ x^0-2*y^post8 >= 0)) /\ ((-x^0 >= 0 /\ y^post8 >= 0) \/ (-x^0+2*y^post8 >= 0 /\ y^post8 >= 0))), cost: 5*n6

Applied unrolling
Original rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0), cost: 5
New rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ -y^post8 == 0 /\ x^0-2*y^post8 == 0 /\ y^post8 <= 0), cost: 10

Applied non-termination processor
Original rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ -y^post8 == 0 /\ x^0-2*y^post8 == 0 /\ y^post8 <= 0), cost: 10
New rule:
l1 -> [7] : (x^0 <= 0 /\ -y^post8 == 0 /\ x^0-2*y^post8 == 0 /\ y^post8 <= 0), cost: NONTERM

Applied chaining
First rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 == 0), cost: 5
Second rule:
l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
New rule:
l1 -> l1 : x^0'=1+3*y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ 1+y^post8 == 0), cost: 10

Applied nonterm
Original rule:
l1 -> l1 : x^0'=1+3*y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ 1+y^post8 == 0), cost: 10
New rule:
l1 -> [7] : (x^0-2*y^post8 >= 0 /\ -x^0+2*y^post8 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l1 -> l1 : x^0'=1+3*y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ 1+y^post8 == 0), cost: 10
New rule:
l1 -> l1 : x^0'=1+3*y^post8, y^0'=y^post8, (-1+n10 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0 /\ ((x^0-2*y^post8 >= 0 /\ 1+y^post8 >= 0) \/ (x^0-2*y^post8 >= 0 /\ 1+y^post8 >= 0)) /\ ((-x^0+2*y^post8 >= 0 /\ -1-y^post8 >= 0) \/ (-x^0+2*y^post8 >= 0 /\ -1-y^post8 >= 0))), cost: 10*n10

Applied chaining
First rule:
l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
Second rule:
l1 -> [7] : (x^0-2*y^post8 >= 0 /\ -x^0+2*y^post8 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ 1+3*x^0-2*y^post8 >= 0 /\ -1-3*x^0+2*y^post8 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: NONTERM

Heuristically decided not to add the following rule:
l1 -> l1 : x^0'=1+3*y^post8, y^0'=y^post8, (-1+n10 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0 /\ ((x^0-2*y^post8 >= 0 /\ 1+y^post8 >= 0) \/ (x^0-2*y^post8 >= 0 /\ 1+y^post8 >= 0)) /\ ((-x^0+2*y^post8 >= 0 /\ -1-y^post8 >= 0) \/ (-x^0+2*y^post8 >= 0 /\ -1-y^post8 >= 0))), cost: 10*n10

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

Applied simplification
Original rule:
l1 -> [7] : (x^0 <= 0 /\ -y^post8 == 0 /\ x^0-2*y^post8 == 0 /\ y^post8 <= 0), cost: NONTERM
New rule:
l1 -> [7] : (x^0-2*y^post8 == 0 /\ y^post8 == 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [7] : (x^0-2*y^post8 >= 0 /\ -x^0+2*y^post8 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0), cost: NONTERM
New rule:
l1 -> [7] : (x^0-2*y^post8 >= 0 /\ -x^0+2*y^post8 >= 0 /\ 1+y^post8 <= 0 /\ 1+y^post8 >= 0), cost: NONTERM

Applied simplification
Original rule:
l1 -> [7] : (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ 1+3*x^0-2*y^post8 >= 0 /\ -1-3*x^0+2*y^post8 >= 0 /\ 1+y^post8 >= 0 /\ -1-y^post8 >= 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: NONTERM
New rule:
l1 -> [7] : (1+3*x^0-2*y^post8 >= 0 /\ -1-3*x^0+2*y^post8 >= 0 /\ 1+y^post8 <= 0 /\ 1+y^post8 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 34

Accelerated simple loops
Start location: l6
  30: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
  32: l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (1-x^0+2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  33: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
  39: l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0 <= 0 /\ x^0-2*y^post8 >= 0 /\ -1+n6 >= 0 /\ y^post8 >= 0), cost: 5*n6
  40: l1 -> [7] : (x^0-2*y^post8 == 0 /\ y^post8 == 0), cost: NONTERM
  41: l1 -> [7] : (x^0-2*y^post8 >= 0 /\ -x^0+2*y^post8 >= 0 /\ 1+y^post8 <= 0 /\ 1+y^post8 >= 0), cost: NONTERM
  42: l1 -> [7] : (1+3*x^0-2*y^post8 >= 0 /\ -1-3*x^0+2*y^post8 >= 0 /\ 1+y^post8 <= 0 /\ 1+y^post8 >= 0), cost: NONTERM
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2


Applied chaining
First rule:
l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2
Second rule:
l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (-3+x^0 <= 0 /\ 1-x^0+2*y^post8 == 0 /\ (x^0 <= 0 \/ -3+x^0 >= 0)), cost: 5
New rule:
l6 -> l1 : x^0'=1+3*x^post9, y^0'=y^post8, (-1+x^post9 >= 0 /\ -3+x^post9 <= 0 /\ -3+x^post9 >= 0 /\ 1-x^post9+2*y^post8 == 0), cost: 7

Applied chaining
First rule:
l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2
Second rule:
l1 -> l1 : x^0'=1+3*x^0, y^0'=y^post8, (1-x^0+2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
New rule:
l6 -> l1 : x^0'=4+6*y^post8, y^0'=y^post8, -2+y^post8 >= 0, cost: 7

Applied chaining
First rule:
l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2
Second rule:
l1 -> l1 : x^0'=y^post8, y^0'=y^post8, (x^0-2*y^post8 == 0 /\ -5+x^0 >= 0), cost: 5
New rule:
l6 -> l1 : x^0'=y^post8, y^0'=y^post8, -3+y^post8 >= 0, cost: 7

Applied deletion
Removed the following rules: 30 32 33 39 40 41 42

Chained accelerated rules with incoming rules
Start location: l6
  22: l6 -> l1 : x^0'=x^post9, -1+x^post9 >= 0, cost: 2
  43: l6 -> l1 : x^0'=1+3*x^post9, y^0'=y^post8, (-1+x^post9 >= 0 /\ -3+x^post9 <= 0 /\ -3+x^post9 >= 0 /\ 1-x^post9+2*y^post8 == 0), cost: 7
  44: l6 -> l1 : x^0'=4+6*y^post8, y^0'=y^post8, -2+y^post8 >= 0, cost: 7
  45: l6 -> l1 : x^0'=y^post8, y^0'=y^post8, -3+y^post8 >= 0, cost: 7


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0