WORST_CASE(Omega(0),?) Initial ITS Start location: l7 0: l0 -> l1 : x^0'=x^post0, Result^0'=Result^post0, y^0'=y^post0, (0 == 0 /\ y^0-y^post0 == 0 /\ -x^0 <= 0 /\ x^0-x^post0 == 0), cost: 1 1: l0 -> l3 : x^0'=x^post1, Result^0'=Result^post1, y^0'=y^post1, (1+x^0 <= 0 /\ y^0-y^post1 == 0 /\ Result^0-Result^post1 == 0 /\ x^0-x^post1 == 0), cost: 1 6: l0 -> l5 : x^0'=x^post6, Result^0'=Result^post6, y^0'=y^post6, (-1+y^post6-y^0 == 0 /\ 99-x^0+x^post6 == 0 /\ -Result^post6+Result^0 == 0 /\ 1+x^0 <= 0 /\ 1+y^0 <= 0 /\ -1-y^0 <= 0), cost: 1 2: l3 -> l4 : x^0'=x^post2, Result^0'=Result^post2, y^0'=y^post2, (y^0-y^post2 == 0 /\ x^0-x^post2 == 0 /\ 2+y^0 <= 0 /\ -Result^post2+Result^0 == 0), cost: 1 3: l3 -> l4 : x^0'=x^post3, Result^0'=Result^post3, y^0'=y^post3, (-Result^post3+Result^0 == 0 /\ -x^post3+x^0 == 0 /\ -y^0 <= 0 /\ -y^post3+y^0 == 0), cost: 1 4: l4 -> l2 : x^0'=x^post4, Result^0'=Result^post4, y^0'=y^post4, (-1+y^post4-y^0 == 0 /\ -Result^post4+Result^0 == 0 /\ -1+x^post4-x^0 == 0), cost: 1 5: l2 -> l0 : x^0'=x^post5, Result^0'=Result^post5, y^0'=y^post5, (-Result^post5+Result^0 == 0 /\ -y^post5+y^0 == 0 /\ -x^post5+x^0 == 0), cost: 1 7: l5 -> l0 : x^0'=x^post7, Result^0'=Result^post7, y^0'=y^post7, (-y^post7+y^0 == 0 /\ -Result^post7+Result^0 == 0 /\ x^0-x^post7 == 0), cost: 1 8: l6 -> l0 : x^0'=x^post8, Result^0'=Result^post8, y^0'=y^post8, (Result^0-Result^post8 == 0 /\ -y^post8+y^0 == 0 /\ x^0-x^post8 == 0), cost: 1 9: l7 -> l6 : x^0'=x^post9, Result^0'=Result^post9, y^0'=y^post9, (x^0-x^post9 == 0 /\ Result^0-Result^post9 == 0 /\ -y^post9+y^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l7 1: l0 -> l3 : x^0'=x^post1, Result^0'=Result^post1, y^0'=y^post1, (1+x^0 <= 0 /\ y^0-y^post1 == 0 /\ Result^0-Result^post1 == 0 /\ x^0-x^post1 == 0), cost: 1 6: l0 -> l5 : x^0'=x^post6, Result^0'=Result^post6, y^0'=y^post6, (-1+y^post6-y^0 == 0 /\ 99-x^0+x^post6 == 0 /\ -Result^post6+Result^0 == 0 /\ 1+x^0 <= 0 /\ 1+y^0 <= 0 /\ -1-y^0 <= 0), cost: 1 2: l3 -> l4 : x^0'=x^post2, Result^0'=Result^post2, y^0'=y^post2, (y^0-y^post2 == 0 /\ x^0-x^post2 == 0 /\ 2+y^0 <= 0 /\ -Result^post2+Result^0 == 0), cost: 1 3: l3 -> l4 : x^0'=x^post3, Result^0'=Result^post3, y^0'=y^post3, (-Result^post3+Result^0 == 0 /\ -x^post3+x^0 == 0 /\ -y^0 <= 0 /\ -y^post3+y^0 == 0), cost: 1 4: l4 -> l2 : x^0'=x^post4, Result^0'=Result^post4, y^0'=y^post4, (-1+y^post4-y^0 == 0 /\ -Result^post4+Result^0 == 0 /\ -1+x^post4-x^0 == 0), cost: 1 5: l2 -> l0 : x^0'=x^post5, Result^0'=Result^post5, y^0'=y^post5, (-Result^post5+Result^0 == 0 /\ -y^post5+y^0 == 0 /\ -x^post5+x^0 == 0), cost: 1 7: l5 -> l0 : x^0'=x^post7, Result^0'=Result^post7, y^0'=y^post7, (-y^post7+y^0 == 0 /\ -Result^post7+Result^0 == 0 /\ x^0-x^post7 == 0), cost: 1 8: l6 -> l0 : x^0'=x^post8, Result^0'=Result^post8, y^0'=y^post8, (Result^0-Result^post8 == 0 /\ -y^post8+y^0 == 0 /\ x^0-x^post8 == 0), cost: 1 9: l7 -> l6 : x^0'=x^post9, Result^0'=Result^post9, y^0'=y^post9, (x^0-x^post9 == 0 /\ Result^0-Result^post9 == 0 /\ -y^post9+y^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l3 : x^0'=x^post1, Result^0'=Result^post1, y^0'=y^post1, (1+x^0 <= 0 /\ y^0-y^post1 == 0 /\ Result^0-Result^post1 == 0 /\ x^0-x^post1 == 0), cost: 1 New rule: l0 -> l3 : 1+x^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l4 : x^0'=x^post2, Result^0'=Result^post2, y^0'=y^post2, (y^0-y^post2 == 0 /\ x^0-x^post2 == 0 /\ 2+y^0 <= 0 /\ -Result^post2+Result^0 == 0), cost: 1 New rule: l3 -> l4 : 2+y^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l4 : x^0'=x^post3, Result^0'=Result^post3, y^0'=y^post3, (-Result^post3+Result^0 == 0 /\ -x^post3+x^0 == 0 /\ -y^0 <= 0 /\ -y^post3+y^0 == 0), cost: 1 New rule: l3 -> l4 : y^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l2 : x^0'=x^post4, Result^0'=Result^post4, y^0'=y^post4, (-1+y^post4-y^0 == 0 /\ -Result^post4+Result^0 == 0 /\ -1+x^post4-x^0 == 0), cost: 1 New rule: l4 -> l2 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 1 Applied preprocessing Original rule: l2 -> l0 : x^0'=x^post5, Result^0'=Result^post5, y^0'=y^post5, (-Result^post5+Result^0 == 0 /\ -y^post5+y^0 == 0 /\ -x^post5+x^0 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l5 : x^0'=x^post6, Result^0'=Result^post6, y^0'=y^post6, (-1+y^post6-y^0 == 0 /\ 99-x^0+x^post6 == 0 /\ -Result^post6+Result^0 == 0 /\ 1+x^0 <= 0 /\ 1+y^0 <= 0 /\ -1-y^0 <= 0), cost: 1 New rule: l0 -> l5 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 1 Applied preprocessing Original rule: l5 -> l0 : x^0'=x^post7, Result^0'=Result^post7, y^0'=y^post7, (-y^post7+y^0 == 0 /\ -Result^post7+Result^0 == 0 /\ x^0-x^post7 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l0 : x^0'=x^post8, Result^0'=Result^post8, y^0'=y^post8, (Result^0-Result^post8 == 0 /\ -y^post8+y^0 == 0 /\ x^0-x^post8 == 0), cost: 1 New rule: l6 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l7 -> l6 : x^0'=x^post9, Result^0'=Result^post9, y^0'=y^post9, (x^0-x^post9 == 0 /\ Result^0-Result^post9 == 0 /\ -y^post9+y^0 == 0), cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Simplified rules Start location: l7 10: l0 -> l3 : 1+x^0 <= 0, cost: 1 15: l0 -> l5 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 1 11: l3 -> l4 : 2+y^0 <= 0, cost: 1 12: l3 -> l4 : y^0 >= 0, cost: 1 13: l4 -> l2 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 1 14: l2 -> l0 : TRUE, cost: 1 16: l5 -> l0 : TRUE, cost: 1 17: l6 -> l0 : TRUE, cost: 1 18: 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: 17 18 Eliminating location l5 by chaining: Applied chaining First rule: l0 -> l5 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 1 Second rule: l5 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 2 Applied deletion Removed the following rules: 15 16 Eliminating location l2 by chaining: Applied chaining First rule: l4 -> l2 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 Applied deletion Removed the following rules: 13 14 Eliminated locations on linear paths Start location: l7 10: l0 -> l3 : 1+x^0 <= 0, cost: 1 20: l0 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 2 11: l3 -> l4 : 2+y^0 <= 0, cost: 1 12: l3 -> l4 : y^0 >= 0, cost: 1 21: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 19: l7 -> l0 : TRUE, cost: 2 Accelerated simple loops Start location: l7 10: l0 -> l3 : 1+x^0 <= 0, cost: 1 20: l0 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 2 11: l3 -> l4 : 2+y^0 <= 0, cost: 1 12: l3 -> l4 : y^0 >= 0, cost: 1 21: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 19: l7 -> l0 : TRUE, cost: 2 Applied chaining First rule: l7 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 2 New rule: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Applied chaining First rule: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 2 New rule: l4 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 4 Applied deletion Removed the following rules: 20 Chained accelerated rules with incoming rules Start location: l7 10: l0 -> l3 : 1+x^0 <= 0, cost: 1 11: l3 -> l4 : 2+y^0 <= 0, cost: 1 12: l3 -> l4 : y^0 >= 0, cost: 1 21: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 23: l4 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 4 19: l7 -> l0 : TRUE, cost: 2 22: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Eliminating location l3 by chaining: Applied chaining First rule: l0 -> l3 : 1+x^0 <= 0, cost: 1 Second rule: l3 -> l4 : 2+y^0 <= 0, cost: 1 New rule: l0 -> l4 : (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 2 Applied chaining First rule: l0 -> l3 : 1+x^0 <= 0, cost: 1 Second rule: l3 -> l4 : y^0 >= 0, cost: 1 New rule: l0 -> l4 : (1+x^0 <= 0 /\ y^0 >= 0), cost: 2 Applied deletion Removed the following rules: 10 11 12 Eliminated locations on tree-shaped paths Start location: l7 24: l0 -> l4 : (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 2 25: l0 -> l4 : (1+x^0 <= 0 /\ y^0 >= 0), cost: 2 21: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 23: l4 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 4 19: l7 -> l0 : TRUE, cost: 2 22: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Eliminating location l4 by chaining: Applied chaining First rule: l0 -> l4 : (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 2 Second rule: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 New rule: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 4 Applied chaining First rule: l0 -> l4 : (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 2 Second rule: l4 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 4 New rule: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 1+x^0 <= 0 /\ 2+y^0 <= 0 /\ 2+y^0 == 0), cost: 6 Applied simplification Original rule: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 1+x^0 <= 0 /\ 2+y^0 <= 0 /\ 2+y^0 == 0), cost: 6 New rule: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 6 Applied chaining First rule: l0 -> l4 : (1+x^0 <= 0 /\ y^0 >= 0), cost: 2 Second rule: l4 -> l0 : x^0'=1+x^0, y^0'=1+y^0, TRUE, cost: 2 New rule: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ y^0 >= 0), cost: 4 Applied deletion Removed the following rules: 21 23 24 25 Eliminated locations on tree-shaped paths Start location: l7 26: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 4 27: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 6 28: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ y^0 >= 0), cost: 4 19: l7 -> l0 : TRUE, cost: 2 22: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Applied acceleration Original rule: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 2+y^0 <= 0), cost: 4 New rule: l0 -> l0 : x^0'=n0+x^0, y^0'=n0+y^0, (n0 >= 0 /\ -1-n0-y^0 >= 0 /\ -n0-x^0 >= 0), cost: 4*n0 Sub-proof via acceration calculus written to file:///tmp/tmpnam_jJPbOa.txt Applied instantiation Original rule: l0 -> l0 : x^0'=n0+x^0, y^0'=n0+y^0, (n0 >= 0 /\ -1-n0-y^0 >= 0 /\ -n0-x^0 >= 0), cost: 4*n0 New rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (0 >= 0 /\ -1+x^0-y^0 >= 0 /\ -x^0 >= 0), cost: -4*x^0 Applied instantiation Original rule: l0 -> l0 : x^0'=n0+x^0, y^0'=n0+y^0, (n0 >= 0 /\ -1-n0-y^0 >= 0 /\ -n0-x^0 >= 0), cost: 4*n0 New rule: l0 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (0 >= 0 /\ -1-y^0 >= 0 /\ 1-x^0+y^0 >= 0), cost: -4-4*y^0 Applied acceleration Original rule: l0 -> l0 : x^0'=1+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ y^0 >= 0), cost: 4 New rule: l0 -> l0 : x^0'=x^0+n2, y^0'=n2+y^0, (n2 >= 0 /\ -x^0-n2 >= 0 /\ y^0 >= 0), cost: 4*n2 Sub-proof via acceration calculus written to file:///tmp/tmpnam_aDjkEe.txt Applied instantiation Original rule: l0 -> l0 : x^0'=x^0+n2, y^0'=n2+y^0, (n2 >= 0 /\ -x^0-n2 >= 0 /\ y^0 >= 0), cost: 4*n2 New rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (0 >= 0 /\ -x^0 >= 0 /\ y^0 >= 0), cost: -4*x^0 Applied simplification Original rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (0 >= 0 /\ -1+x^0-y^0 >= 0 /\ -x^0 >= 0), cost: -4*x^0 New rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ -1+x^0-y^0 >= 0), cost: -4*x^0 Applied simplification Original rule: l0 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (0 >= 0 /\ -1-y^0 >= 0 /\ 1-x^0+y^0 >= 0), cost: -4-4*y^0 New rule: l0 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (1+y^0 <= 0 /\ 1-x^0+y^0 >= 0), cost: -4-4*y^0 Applied simplification Original rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (0 >= 0 /\ -x^0 >= 0 /\ y^0 >= 0), cost: -4*x^0 New rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: -4*x^0 Applied deletion Removed the following rules: 26 28 Accelerated simple loops Start location: l7 27: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 6 32: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ -1+x^0-y^0 >= 0), cost: -4*x^0 33: l0 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (1+y^0 <= 0 /\ 1-x^0+y^0 >= 0), cost: -4-4*y^0 34: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: -4*x^0 19: l7 -> l0 : TRUE, cost: 2 22: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Applied chaining First rule: l7 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 6 New rule: l7 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 8 Applied chaining First rule: l7 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ -1+x^0-y^0 >= 0), cost: -4*x^0 New rule: l7 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ -1+x^0-y^0 >= 0), cost: 2-4*x^0 Applied chaining First rule: l7 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (1+y^0 <= 0 /\ 1-x^0+y^0 >= 0), cost: -4-4*y^0 New rule: l7 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (1+y^0 <= 0 /\ 1-x^0+y^0 >= 0), cost: -2-4*y^0 Applied chaining First rule: l7 -> l0 : TRUE, cost: 2 Second rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: -4*x^0 New rule: l7 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: 2-4*x^0 Applied chaining First rule: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 Second rule: l0 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: -4*x^0 New rule: l7 -> l0 : x^0'=0, y^0'=100-x^0+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 400-4*x^0 Applied deletion Removed the following rules: 27 32 33 34 Chained accelerated rules with incoming rules Start location: l7 19: l7 -> l0 : TRUE, cost: 2 22: l7 -> l0 : x^0'=-99+x^0, y^0'=1+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 4 35: l7 -> l0 : x^0'=-98+x^0, y^0'=2+y^0, (2+x^0 <= 0 /\ 2+y^0 == 0), cost: 8 36: l7 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ -1+x^0-y^0 >= 0), cost: 2-4*x^0 37: l7 -> l0 : x^0'=-1+x^0-y^0, y^0'=-1, (1+y^0 <= 0 /\ 1-x^0+y^0 >= 0), cost: -2-4*y^0 38: l7 -> l0 : x^0'=0, y^0'=-x^0+y^0, (x^0 <= 0 /\ y^0 >= 0), cost: 2-4*x^0 39: l7 -> l0 : x^0'=0, y^0'=100-x^0+y^0, (1+x^0 <= 0 /\ 1+y^0 == 0), cost: 400-4*x^0 Removed unreachable locations and irrelevant leafs Start location: l7 Computing asymptotic complexity Proved the following lower bound Complexity: Unknown Cpx degree: ? Solved cost: 0 Rule cost: 0