NO Initial ITS Start location: l4 0: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ n^0-n^post0 == 0 /\ R^post0 == 0 /\ A^0-A^post0 == 0 /\ R^10 == 0 /\ n^0 <= 0), cost: 1 1: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (A^0-A^post1 == 0 /\ 1+n^post1-n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0 /\ 1-n^0 <= 0), cost: 1 3: l1 -> l0 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (A^post3 == 0 /\ -1+A^10 == 0 /\ -R^post3+R^0 == 0 /\ dobreak^0 <= 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 2: l2 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 4: l3 -> l1 : A^0'=A^post4, dobreak^0'=dobreak^post4, R^0'=R^post4, n^0'=n^post4, (0 == 0 /\ A^post4 == 0 /\ R^post4 == 0), cost: 1 5: l4 -> l3 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-n^post5+n^0 == 0 /\ -R^post5+R^0 == 0 /\ A^0-A^post5 == 0 /\ -dobreak^post5+dobreak^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : A^0'=A^post0, dobreak^0'=dobreak^post0, R^0'=R^post0, n^0'=n^post0, (0 == 0 /\ n^0-n^post0 == 0 /\ R^post0 == 0 /\ A^0-A^post0 == 0 /\ R^10 == 0 /\ n^0 <= 0), cost: 1 New rule: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : A^0'=A^post1, dobreak^0'=dobreak^post1, R^0'=R^post1, n^0'=n^post1, (A^0-A^post1 == 0 /\ 1+n^post1-n^0 == 0 /\ -R^post1+R^0 == 0 /\ -dobreak^post1+dobreak^0 == 0 /\ 1-n^0 <= 0), cost: 1 New rule: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l0 : A^0'=A^post2, dobreak^0'=dobreak^post2, R^0'=R^post2, n^0'=n^post2, (A^0-A^post2 == 0 /\ -n^post2+n^0 == 0 /\ dobreak^0-dobreak^post2 == 0 /\ -R^post2+R^0 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l0 : A^0'=A^post3, dobreak^0'=dobreak^post3, R^0'=R^post3, n^0'=n^post3, (A^post3 == 0 /\ -1+A^10 == 0 /\ -R^post3+R^0 == 0 /\ dobreak^0 <= 0 /\ dobreak^0-dobreak^post3 == 0 /\ -n^post3+n^0 == 0), cost: 1 New rule: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l1 : A^0'=A^post4, dobreak^0'=dobreak^post4, R^0'=R^post4, n^0'=n^post4, (0 == 0 /\ A^post4 == 0 /\ R^post4 == 0), cost: 1 New rule: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 Applied preprocessing Original rule: l4 -> l3 : A^0'=A^post5, dobreak^0'=dobreak^post5, R^0'=R^post5, n^0'=n^post5, (-n^post5+n^0 == 0 /\ -R^post5+R^0 == 0 /\ A^0-A^post5 == 0 /\ -dobreak^post5+dobreak^0 == 0), cost: 1 New rule: l4 -> l3 : TRUE, cost: 1 Simplified rules Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 7: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 8: l2 -> l0 : TRUE, cost: 1 10: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 11: l4 -> l3 : TRUE, cost: 1 Eliminating location l3 by chaining: Applied chaining First rule: l4 -> l3 : TRUE, cost: 1 Second rule: l3 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 1 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied deletion Removed the following rules: 10 11 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 Applied deletion Removed the following rules: 7 8 Eliminated locations on linear paths Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 13: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied acceleration Original rule: l0 -> l0 : n^0'=-1+n^0, -1+n^0 >= 0, cost: 2 New rule: l0 -> l0 : n^0'=-n0+n^0, (n0 >= 0 /\ -n0+n^0 >= 0), cost: 2*n0 Applied instantiation Original rule: l0 -> l0 : n^0'=-n0+n^0, (n0 >= 0 /\ -n0+n^0 >= 0), cost: 2*n0 New rule: l0 -> l0 : n^0'=0, (0 >= 0 /\ n^0 >= 0), cost: 2*n^0 Applied simplification Original rule: l0 -> l0 : n^0'=0, (0 >= 0 /\ n^0 >= 0), cost: 2*n^0 New rule: l0 -> l0 : n^0'=0, n^0 >= 0, cost: 2*n^0 Applied deletion Removed the following rules: 13 Accelerated simple loops Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 15: l0 -> l0 : n^0'=0, n^0 >= 0, cost: 2*n^0 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied chaining First rule: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 Second rule: l0 -> l0 : n^0'=0, n^0 >= 0, cost: 2*n^0 New rule: l1 -> l0 : A^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 1+2*n^0 Applied deletion Removed the following rules: 15 Chained accelerated rules with incoming rules Start location: l4 6: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 9: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 16: l1 -> l0 : A^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 1+2*n^0 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Eliminating location l0 by chaining: Applied chaining First rule: l1 -> l0 : A^0'=0, dobreak^0 <= 0, cost: 1 Second rule: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Applied chaining First rule: l1 -> l0 : A^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 1+2*n^0 Second rule: l0 -> l1 : dobreak^0'=dobreak^post0, R^0'=0, n^0 <= 0, cost: 1 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (0 <= 0 /\ dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Applied simplification Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (0 <= 0 /\ dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Applied deletion Removed the following rules: 6 9 16 Eliminated locations on tree-shaped paths Start location: l4 17: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 18: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ -n^0 >= 0), cost: 2*n4 Applied unrolling Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0), cost: 4 Applied non-termination processor Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0), cost: 4 New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 2*n6 Applied unrolling Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (0 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 4+2*n^0 Applied non-termination processor Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (0 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 4+2*n^0 New rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 4+2*n^0 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 4+2*n^0 New rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 4+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-dobreak^post0 >= 0 /\ -1+n8 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 4*n8 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Second rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM Heuristically decided not to add the following rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-dobreak^post0 >= 0 /\ -1+n8 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 4*n8 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 4+2*n^0 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 4+2*n^0 New rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 4+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 4*n10 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Second rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 4*n10 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: 2+4*n10 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 2*n6 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 2+2*n6 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 2+2*n6 New rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 == 0), cost: 2+2*n6 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n12 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n6*n12+2*n12 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 2*n6 Second rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (0 >= 0 /\ -1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM Heuristically decided not to add the following rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n12 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n6*n12+2*n12 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 2*n6 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2+2*n6 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2+2*n6 New rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2+2*n6 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -1+n14 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n6*n14+2*n14 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ n^0 <= 0), cost: 2 Second rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Heuristically decided not to add the following rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -1+n14 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n6*n14+2*n14 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ -n^0 >= 0), cost: 2*n4 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: 2+2*n4+2*n^0 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: 2+2*n4+2*n^0 New rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: 2+2*n4+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n16 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n16+2*n4*n16 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ -n^0 >= 0), cost: 2*n4 Second rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM Heuristically decided not to add the following rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n16 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n16+2*n4*n16 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ -n^0 >= 0), cost: 2*n4 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 == 0), cost: 2+2*n4+2*n^0 Applied nonterm Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 == 0), cost: 2+2*n4+2*n^0 New rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM Applied acceleration Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 == 0), cost: 2+2*n4+2*n^0 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n18 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n18+2*n18*n4 Applied chaining First rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (dobreak^0 <= 0 /\ n^0 >= 0), cost: 2+2*n^0 Second rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM Heuristically decided not to add the following rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n18 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 2*n18+2*n18*n4 Applied simplification Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ -n^0 >= 0), cost: 2*n4 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0), cost: 2*n4 Applied simplification Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 2*n6 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2*n6 Applied simplification Original rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ ((-dobreak^0 >= 0 /\ -dobreak^post0 >= 0) \/ (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0))), cost: 4*n10 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 4*n10 Applied simplification Original rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: 2+4*n10 New rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: 2+4*n10 Applied simplification Original rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (0 >= 0 /\ -1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-1+n6 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (-dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0 /\ -n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM Applied simplification Original rule: l1 -> [6] : (0 >= 0 /\ dobreak^0 <= 0 /\ -dobreak^post0 >= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM Applied deletion Removed the following rules: 17 18 Applied deletion Removed the following rules: 39 40 41 46 47 50 51 Accelerated simple loops Start location: l4 20: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0), cost: NONTERM 37: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0), cost: 2*n4 38: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2*n6 42: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM 43: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM 44: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 4*n10 45: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: 2+4*n10 48: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM 49: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM 52: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM 53: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0), cost: 2*n4 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=n^post4, (n^post4 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0), cost: 2+2*n4 Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: 2*n6 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^post0 <= 0), cost: 2+2*n6 Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ -dobreak^0 >= 0 /\ -dobreak^post0 >= 0 /\ n^0 >= 0), cost: 4*n10 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^post0 <= 0), cost: 2+4*n10 Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: 2+4*n10 New rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^post0 <= 0), cost: 4+4*n10 Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (-1+n6 >= 0 /\ dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 <= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied chaining First rule: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 Second rule: l1 -> [6] : (dobreak^0 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0 /\ n^0 >= 0), cost: NONTERM New rule: l4 -> [6] : 0 == 0, cost: NONTERM Applied deletion Removed the following rules: 20 37 38 42 43 44 45 48 49 52 53 Chained accelerated rules with incoming rules Start location: l4 12: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post4, R^0'=0, n^0'=n^post4, 0 == 0, cost: 2 54: l4 -> [6] : 0 == 0, cost: NONTERM 55: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=n^post4, (n^post4 <= 0 /\ dobreak^post0 <= 0 /\ -1+n4 >= 0), cost: 2+2*n4 56: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n6 >= 0 /\ dobreak^post0 <= 0), cost: 2+2*n6 57: l4 -> [6] : 0 == 0, cost: NONTERM 58: l4 -> [6] : 0 == 0, cost: NONTERM 59: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^post0 <= 0), cost: 2+4*n10 60: l4 -> l1 : A^0'=0, dobreak^0'=dobreak^post0, R^0'=0, n^0'=0, (-1+n10 >= 0 /\ dobreak^post0 <= 0), cost: 4+4*n10 61: l4 -> [6] : 0 == 0, cost: NONTERM 62: l4 -> [6] : 0 == 0, cost: NONTERM 63: l4 -> [6] : 0 == 0, cost: NONTERM 64: l4 -> [6] : 0 == 0, cost: NONTERM Removed unreachable locations and irrelevant leafs Start location: l4 54: l4 -> [6] : 0 == 0, cost: NONTERM 57: l4 -> [6] : 0 == 0, cost: NONTERM 58: l4 -> [6] : 0 == 0, cost: NONTERM 61: l4 -> [6] : 0 == 0, cost: NONTERM 62: l4 -> [6] : 0 == 0, cost: NONTERM 63: l4 -> [6] : 0 == 0, cost: NONTERM 64: l4 -> [6] : 0 == 0, cost: NONTERM Removed duplicate rules (ignoring updates) Start location: l4 64: l4 -> [6] : 0 == 0, cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 64 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: 0 == 0