NO Initial ITS Start location: l14 0: l0 -> l1 : WItemsNum^0'=WItemsNum^post0, tmp1^0'=tmp1^post0, (tmp1^0-tmp1^post0 == 0 /\ WItemsNum^0-WItemsNum^post0 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 1: l0 -> l2 : WItemsNum^0'=WItemsNum^post1, tmp1^0'=tmp1^post1, (0 == 0 /\ WItemsNum^0-WItemsNum^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 11: l1 -> l5 : WItemsNum^0'=WItemsNum^post11, tmp1^0'=tmp1^post11, (tmp1^0-tmp1^post11 == 0 /\ WItemsNum^0-WItemsNum^post11 == 0), cost: 1 14: l2 -> l1 : WItemsNum^0'=WItemsNum^post14, tmp1^0'=tmp1^post14, (WItemsNum^0-WItemsNum^post14 == 0 /\ -tmp1^0 <= 0 /\ tmp1^0 <= 0 /\ tmp1^0-tmp1^post14 == 0), cost: 1 15: l2 -> l12 : WItemsNum^0'=WItemsNum^post15, tmp1^0'=tmp1^post15, (WItemsNum^0-WItemsNum^post15 == 0 /\ 1-tmp1^0 <= 0 /\ -tmp1^post15+tmp1^0 == 0), cost: 1 16: l2 -> l12 : WItemsNum^0'=WItemsNum^post16, tmp1^0'=tmp1^post16, (tmp1^0-tmp1^post16 == 0 /\ 1+tmp1^0 <= 0 /\ WItemsNum^0-WItemsNum^post16 == 0), cost: 1 2: l3 -> l4 : WItemsNum^0'=WItemsNum^post2, tmp1^0'=tmp1^post2, (-tmp1^post2+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post2 == 0), cost: 1 3: l4 -> l0 : WItemsNum^0'=WItemsNum^post3, tmp1^0'=tmp1^post3, (WItemsNum^0-WItemsNum^post3 == 0 /\ tmp1^0-tmp1^post3 == 0), cost: 1 4: l5 -> l6 : WItemsNum^0'=WItemsNum^post4, tmp1^0'=tmp1^post4, (WItemsNum^0-WItemsNum^post4 == 0 /\ -tmp1^post4+tmp1^0 == 0), cost: 1 7: l6 -> l3 : WItemsNum^0'=WItemsNum^post7, tmp1^0'=tmp1^post7, (WItemsNum^0-WItemsNum^post7 == 0 /\ -2+WItemsNum^0 <= 0 /\ -tmp1^post7+tmp1^0 == 0), cost: 1 8: l6 -> l5 : WItemsNum^0'=WItemsNum^post8, tmp1^0'=tmp1^post8, (3-WItemsNum^0 <= 0 /\ 1-WItemsNum^0+WItemsNum^post8 == 0 /\ tmp1^0-tmp1^post8 == 0), cost: 1 5: l7 -> l8 : WItemsNum^0'=WItemsNum^post5, tmp1^0'=tmp1^post5, (tmp1^0-tmp1^post5 == 0 /\ WItemsNum^0-WItemsNum^post5 == 0), cost: 1 6: l9 -> l10 : WItemsNum^0'=WItemsNum^post6, tmp1^0'=tmp1^post6, (-tmp1^post6+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post6 == 0), cost: 1 9: l10 -> l11 : WItemsNum^0'=WItemsNum^post9, tmp1^0'=tmp1^post9, (-tmp1^post9+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post9 == 0), cost: 1 10: l11 -> l10 : WItemsNum^0'=WItemsNum^post10, tmp1^0'=tmp1^post10, (-tmp1^post10+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post10 == 0), cost: 1 12: l12 -> l4 : WItemsNum^0'=WItemsNum^post12, tmp1^0'=tmp1^post12, (-tmp1^post12+tmp1^0 == 0 /\ -1-WItemsNum^0+WItemsNum^post12 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 13: l12 -> l4 : WItemsNum^0'=WItemsNum^post13, tmp1^0'=tmp1^post13, (-1-WItemsNum^0+WItemsNum^post13 == 0 /\ -tmp1^post13+tmp1^0 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 17: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, tmp1^0'=tmp1^post17, (0 == 0 /\ -tmp1^post17+tmp1^0 == 0), cost: 1 18: l14 -> l13 : WItemsNum^0'=WItemsNum^post18, tmp1^0'=tmp1^post18, (WItemsNum^0-WItemsNum^post18 == 0 /\ -tmp1^post18+tmp1^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l14 0: l0 -> l1 : WItemsNum^0'=WItemsNum^post0, tmp1^0'=tmp1^post0, (tmp1^0-tmp1^post0 == 0 /\ WItemsNum^0-WItemsNum^post0 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 1: l0 -> l2 : WItemsNum^0'=WItemsNum^post1, tmp1^0'=tmp1^post1, (0 == 0 /\ WItemsNum^0-WItemsNum^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 11: l1 -> l5 : WItemsNum^0'=WItemsNum^post11, tmp1^0'=tmp1^post11, (tmp1^0-tmp1^post11 == 0 /\ WItemsNum^0-WItemsNum^post11 == 0), cost: 1 14: l2 -> l1 : WItemsNum^0'=WItemsNum^post14, tmp1^0'=tmp1^post14, (WItemsNum^0-WItemsNum^post14 == 0 /\ -tmp1^0 <= 0 /\ tmp1^0 <= 0 /\ tmp1^0-tmp1^post14 == 0), cost: 1 15: l2 -> l12 : WItemsNum^0'=WItemsNum^post15, tmp1^0'=tmp1^post15, (WItemsNum^0-WItemsNum^post15 == 0 /\ 1-tmp1^0 <= 0 /\ -tmp1^post15+tmp1^0 == 0), cost: 1 16: l2 -> l12 : WItemsNum^0'=WItemsNum^post16, tmp1^0'=tmp1^post16, (tmp1^0-tmp1^post16 == 0 /\ 1+tmp1^0 <= 0 /\ WItemsNum^0-WItemsNum^post16 == 0), cost: 1 2: l3 -> l4 : WItemsNum^0'=WItemsNum^post2, tmp1^0'=tmp1^post2, (-tmp1^post2+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post2 == 0), cost: 1 3: l4 -> l0 : WItemsNum^0'=WItemsNum^post3, tmp1^0'=tmp1^post3, (WItemsNum^0-WItemsNum^post3 == 0 /\ tmp1^0-tmp1^post3 == 0), cost: 1 4: l5 -> l6 : WItemsNum^0'=WItemsNum^post4, tmp1^0'=tmp1^post4, (WItemsNum^0-WItemsNum^post4 == 0 /\ -tmp1^post4+tmp1^0 == 0), cost: 1 7: l6 -> l3 : WItemsNum^0'=WItemsNum^post7, tmp1^0'=tmp1^post7, (WItemsNum^0-WItemsNum^post7 == 0 /\ -2+WItemsNum^0 <= 0 /\ -tmp1^post7+tmp1^0 == 0), cost: 1 8: l6 -> l5 : WItemsNum^0'=WItemsNum^post8, tmp1^0'=tmp1^post8, (3-WItemsNum^0 <= 0 /\ 1-WItemsNum^0+WItemsNum^post8 == 0 /\ tmp1^0-tmp1^post8 == 0), cost: 1 12: l12 -> l4 : WItemsNum^0'=WItemsNum^post12, tmp1^0'=tmp1^post12, (-tmp1^post12+tmp1^0 == 0 /\ -1-WItemsNum^0+WItemsNum^post12 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 13: l12 -> l4 : WItemsNum^0'=WItemsNum^post13, tmp1^0'=tmp1^post13, (-1-WItemsNum^0+WItemsNum^post13 == 0 /\ -tmp1^post13+tmp1^0 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 17: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, tmp1^0'=tmp1^post17, (0 == 0 /\ -tmp1^post17+tmp1^0 == 0), cost: 1 18: l14 -> l13 : WItemsNum^0'=WItemsNum^post18, tmp1^0'=tmp1^post18, (WItemsNum^0-WItemsNum^post18 == 0 /\ -tmp1^post18+tmp1^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : WItemsNum^0'=WItemsNum^post0, tmp1^0'=tmp1^post0, (tmp1^0-tmp1^post0 == 0 /\ WItemsNum^0-WItemsNum^post0 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 New rule: l0 -> l1 : -6+WItemsNum^0 >= 0, cost: 1 Applied preprocessing Original rule: l0 -> l2 : WItemsNum^0'=WItemsNum^post1, tmp1^0'=tmp1^post1, (0 == 0 /\ WItemsNum^0-WItemsNum^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 New rule: l0 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 1 Applied preprocessing Original rule: l3 -> l4 : WItemsNum^0'=WItemsNum^post2, tmp1^0'=tmp1^post2, (-tmp1^post2+tmp1^0 == 0 /\ WItemsNum^0-WItemsNum^post2 == 0), cost: 1 New rule: l3 -> l4 : TRUE, cost: 1 Applied preprocessing Original rule: l4 -> l0 : WItemsNum^0'=WItemsNum^post3, tmp1^0'=tmp1^post3, (WItemsNum^0-WItemsNum^post3 == 0 /\ tmp1^0-tmp1^post3 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l5 -> l6 : WItemsNum^0'=WItemsNum^post4, tmp1^0'=tmp1^post4, (WItemsNum^0-WItemsNum^post4 == 0 /\ -tmp1^post4+tmp1^0 == 0), cost: 1 New rule: l5 -> l6 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l3 : WItemsNum^0'=WItemsNum^post7, tmp1^0'=tmp1^post7, (WItemsNum^0-WItemsNum^post7 == 0 /\ -2+WItemsNum^0 <= 0 /\ -tmp1^post7+tmp1^0 == 0), cost: 1 New rule: l6 -> l3 : -2+WItemsNum^0 <= 0, cost: 1 Applied preprocessing Original rule: l6 -> l5 : WItemsNum^0'=WItemsNum^post8, tmp1^0'=tmp1^post8, (3-WItemsNum^0 <= 0 /\ 1-WItemsNum^0+WItemsNum^post8 == 0 /\ tmp1^0-tmp1^post8 == 0), cost: 1 New rule: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1 Applied preprocessing Original rule: l1 -> l5 : WItemsNum^0'=WItemsNum^post11, tmp1^0'=tmp1^post11, (tmp1^0-tmp1^post11 == 0 /\ WItemsNum^0-WItemsNum^post11 == 0), cost: 1 New rule: l1 -> l5 : TRUE, cost: 1 Applied preprocessing Original rule: l12 -> l4 : WItemsNum^0'=WItemsNum^post12, tmp1^0'=tmp1^post12, (-tmp1^post12+tmp1^0 == 0 /\ -1-WItemsNum^0+WItemsNum^post12 == 0 /\ 6-WItemsNum^0 <= 0), cost: 1 New rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1 Applied preprocessing Original rule: l12 -> l4 : WItemsNum^0'=WItemsNum^post13, tmp1^0'=tmp1^post13, (-1-WItemsNum^0+WItemsNum^post13 == 0 /\ -tmp1^post13+tmp1^0 == 0 /\ -5+WItemsNum^0 <= 0), cost: 1 New rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1 Applied preprocessing Original rule: l2 -> l1 : WItemsNum^0'=WItemsNum^post14, tmp1^0'=tmp1^post14, (WItemsNum^0-WItemsNum^post14 == 0 /\ -tmp1^0 <= 0 /\ tmp1^0 <= 0 /\ tmp1^0-tmp1^post14 == 0), cost: 1 New rule: l2 -> l1 : tmp1^0 == 0, cost: 1 Applied preprocessing Original rule: l2 -> l12 : WItemsNum^0'=WItemsNum^post15, tmp1^0'=tmp1^post15, (WItemsNum^0-WItemsNum^post15 == 0 /\ 1-tmp1^0 <= 0 /\ -tmp1^post15+tmp1^0 == 0), cost: 1 New rule: l2 -> l12 : -1+tmp1^0 >= 0, cost: 1 Applied preprocessing Original rule: l2 -> l12 : WItemsNum^0'=WItemsNum^post16, tmp1^0'=tmp1^post16, (tmp1^0-tmp1^post16 == 0 /\ 1+tmp1^0 <= 0 /\ WItemsNum^0-WItemsNum^post16 == 0), cost: 1 New rule: l2 -> l12 : 1+tmp1^0 <= 0, cost: 1 Applied preprocessing Original rule: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, tmp1^0'=tmp1^post17, (0 == 0 /\ -tmp1^post17+tmp1^0 == 0), cost: 1 New rule: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 1 Applied preprocessing Original rule: l14 -> l13 : WItemsNum^0'=WItemsNum^post18, tmp1^0'=tmp1^post18, (WItemsNum^0-WItemsNum^post18 == 0 /\ -tmp1^post18+tmp1^0 == 0), cost: 1 New rule: l14 -> l13 : TRUE, cost: 1 Simplified rules Start location: l14 19: l0 -> l1 : -6+WItemsNum^0 >= 0, cost: 1 20: l0 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 1 26: l1 -> l5 : TRUE, cost: 1 29: l2 -> l1 : tmp1^0 == 0, cost: 1 30: l2 -> l12 : -1+tmp1^0 >= 0, cost: 1 31: l2 -> l12 : 1+tmp1^0 <= 0, cost: 1 21: l3 -> l4 : TRUE, cost: 1 22: l4 -> l0 : TRUE, cost: 1 23: l5 -> l6 : TRUE, cost: 1 24: l6 -> l3 : -2+WItemsNum^0 <= 0, cost: 1 25: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1 27: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1 28: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1 32: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 1 33: l14 -> l13 : TRUE, cost: 1 Eliminating location l13 by chaining: Applied chaining First rule: l14 -> l13 : TRUE, cost: 1 Second rule: l13 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 1 New rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied deletion Removed the following rules: 32 33 Eliminated locations on linear paths Start location: l14 19: l0 -> l1 : -6+WItemsNum^0 >= 0, cost: 1 20: l0 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 1 26: l1 -> l5 : TRUE, cost: 1 29: l2 -> l1 : tmp1^0 == 0, cost: 1 30: l2 -> l12 : -1+tmp1^0 >= 0, cost: 1 31: l2 -> l12 : 1+tmp1^0 <= 0, cost: 1 21: l3 -> l4 : TRUE, cost: 1 22: l4 -> l0 : TRUE, cost: 1 23: l5 -> l6 : TRUE, cost: 1 24: l6 -> l3 : -2+WItemsNum^0 <= 0, cost: 1 25: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1 27: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1 28: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Eliminating location l0 by chaining: Applied chaining First rule: l4 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : -6+WItemsNum^0 >= 0, cost: 1 New rule: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 Applied chaining First rule: l4 -> l0 : TRUE, cost: 1 Second rule: l0 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 1 New rule: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 Applied deletion Removed the following rules: 19 20 22 Eliminating location l6 by chaining: Applied chaining First rule: l5 -> l6 : TRUE, cost: 1 Second rule: l6 -> l3 : -2+WItemsNum^0 <= 0, cost: 1 New rule: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 Applied chaining First rule: l5 -> l6 : TRUE, cost: 1 Second rule: l6 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 1 New rule: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2 Applied deletion Removed the following rules: 23 24 25 Eliminating location l12 by chaining: Applied chaining First rule: l2 -> l12 : -1+tmp1^0 >= 0, cost: 1 Second rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1 New rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 Applied chaining First rule: l2 -> l12 : -1+tmp1^0 >= 0, cost: 1 Second rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1 New rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 Applied chaining First rule: l2 -> l12 : 1+tmp1^0 <= 0, cost: 1 Second rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -6+WItemsNum^0 >= 0, cost: 1 New rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 Applied chaining First rule: l2 -> l12 : 1+tmp1^0 <= 0, cost: 1 Second rule: l12 -> l4 : WItemsNum^0'=1+WItemsNum^0, -5+WItemsNum^0 <= 0, cost: 1 New rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 Applied deletion Removed the following rules: 27 28 30 31 Eliminated locations on tree-shaped paths Start location: l14 26: l1 -> l5 : TRUE, cost: 1 29: l2 -> l1 : tmp1^0 == 0, cost: 1 39: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 40: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 41: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 42: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 36: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 37: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 38: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied merging first rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 second rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 new rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, -1+tmp1^0 >= 0, cost: 2 Applied merging first rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -6+WItemsNum^0 >= 0), cost: 2 second rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (1+tmp1^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 2 new rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, 1+tmp1^0 <= 0, cost: 2 Applied merging first rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, -1+tmp1^0 >= 0, cost: 2 second rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, 1+tmp1^0 <= 0, cost: 2 new rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 \/ 1+tmp1^0 <= 0), cost: 2 Merged rules Start location: l14 26: l1 -> l5 : TRUE, cost: 1 29: l2 -> l1 : tmp1^0 == 0, cost: 1 45: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 \/ 1+tmp1^0 <= 0), cost: 2 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 36: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 37: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 38: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied acceleration Original rule: l5 -> l5 : WItemsNum^0'=-1+WItemsNum^0, -3+WItemsNum^0 >= 0, cost: 2 New rule: l5 -> l5 : WItemsNum^0'=WItemsNum^0-n0, (n0 >= 0 /\ -2+WItemsNum^0-n0 >= 0), cost: 2*n0 Applied instantiation Original rule: l5 -> l5 : WItemsNum^0'=WItemsNum^0-n0, (n0 >= 0 /\ -2+WItemsNum^0-n0 >= 0), cost: 2*n0 New rule: l5 -> l5 : WItemsNum^0'=2, (0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -4+2*WItemsNum^0 Applied simplification Original rule: l5 -> l5 : WItemsNum^0'=2, (0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: -4+2*WItemsNum^0 New rule: l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0 Applied deletion Removed the following rules: 38 Accelerated simple loops Start location: l14 26: l1 -> l5 : TRUE, cost: 1 29: l2 -> l1 : tmp1^0 == 0, cost: 1 45: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 \/ 1+tmp1^0 <= 0), cost: 2 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 36: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 37: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 47: l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied chaining First rule: l1 -> l5 : TRUE, cost: 1 Second rule: l5 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -4+2*WItemsNum^0 New rule: l1 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -3+2*WItemsNum^0 Applied deletion Removed the following rules: 47 Chained accelerated rules with incoming rules Start location: l14 26: l1 -> l5 : TRUE, cost: 1 48: l1 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -3+2*WItemsNum^0 29: l2 -> l1 : tmp1^0 == 0, cost: 1 45: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 \/ 1+tmp1^0 <= 0), cost: 2 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 36: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 37: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Eliminating location l2 by chaining: Applied chaining First rule: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 Second rule: l2 -> l1 : tmp1^0 == 0, cost: 1 New rule: l4 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 3 Applied chaining First rule: l4 -> l2 : tmp1^0'=tmp1^post1, -5+WItemsNum^0 <= 0, cost: 2 Second rule: l2 -> l4 : WItemsNum^0'=1+WItemsNum^0, (-1+tmp1^0 >= 0 \/ 1+tmp1^0 <= 0), cost: 2 New rule: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 4 Applied deletion Removed the following rules: 29 36 45 Eliminating location l5 by chaining: Applied chaining First rule: l1 -> l5 : TRUE, cost: 1 Second rule: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 New rule: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 Applied chaining First rule: l1 -> l5 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -3+2*WItemsNum^0 Second rule: l5 -> l3 : -2+WItemsNum^0 <= 0, cost: 2 New rule: l1 -> l3 : WItemsNum^0'=2, (0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: -1+2*WItemsNum^0 Applied simplification Original rule: l1 -> l3 : WItemsNum^0'=2, (0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: -1+2*WItemsNum^0 New rule: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 Applied deletion Removed the following rules: 26 37 48 Eliminated locations on tree-shaped paths Start location: l14 51: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 52: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 49: l4 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 3 50: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 4 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied acceleration Original rule: l4 -> l4 : WItemsNum^0'=1+WItemsNum^0, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 4 New rule: l4 -> l4 : WItemsNum^0'=WItemsNum^0+n3, tmp1^0'=tmp1^post1, (6-WItemsNum^0-n3 >= 0 /\ -1+n3 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 4*n3 Applied instantiation Original rule: l4 -> l4 : WItemsNum^0'=WItemsNum^0+n3, tmp1^0'=tmp1^post1, (6-WItemsNum^0-n3 >= 0 /\ -1+n3 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 4*n3 New rule: l4 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (0 >= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 24-4*WItemsNum^0 Applied simplification Original rule: l4 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (0 >= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 24-4*WItemsNum^0 New rule: l4 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 24-4*WItemsNum^0 Applied deletion Removed the following rules: 50 Accelerated simple loops Start location: l14 51: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 52: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 21: l3 -> l4 : TRUE, cost: 1 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 49: l4 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 3 54: l4 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 24-4*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied chaining First rule: l3 -> l4 : TRUE, cost: 1 Second rule: l4 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 24-4*WItemsNum^0 New rule: l3 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 Applied deletion Removed the following rules: 54 Chained accelerated rules with incoming rules Start location: l14 51: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 52: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 21: l3 -> l4 : TRUE, cost: 1 55: l3 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 35: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 49: l4 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 3 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Eliminating location l4 by chaining: Applied chaining First rule: l3 -> l4 : TRUE, cost: 1 Second rule: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 New rule: l3 -> l1 : -6+WItemsNum^0 >= 0, cost: 3 Applied chaining First rule: l3 -> l4 : TRUE, cost: 1 Second rule: l4 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 3 New rule: l3 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 4 Applied chaining First rule: l3 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 Second rule: l4 -> l1 : -6+WItemsNum^0 >= 0, cost: 2 New rule: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 Applied simplification Original rule: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 New rule: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 Applied partial deletion Original rule: l3 -> l4 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 New rule: l3 -> [17] : (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 Applied deletion Removed the following rules: 21 35 49 55 Eliminated locations on tree-shaped paths Start location: l14 51: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 52: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 56: l3 -> l1 : -6+WItemsNum^0 >= 0, cost: 3 57: l3 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 4 58: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 59: l3 -> [17] : (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 25-4*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied pruning (of leafs and parallel rules): Start location: l14 51: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 52: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 56: l3 -> l1 : -6+WItemsNum^0 >= 0, cost: 3 57: l3 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 4 58: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Eliminating location l1 by chaining: Applied chaining First rule: l3 -> l1 : -6+WItemsNum^0 >= 0, cost: 3 Second rule: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, (-2+WItemsNum^0 >= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, (-2+WItemsNum^0 >= 0 /\ -6+WItemsNum^0 >= 0), cost: 2+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 Applied chaining First rule: l3 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 4 Second rule: l1 -> l3 : -2+WItemsNum^0 <= 0, cost: 3 New rule: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 7 Applied simplification Original rule: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0 /\ -5+WItemsNum^0 <= 0), cost: 7 New rule: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0), cost: 7 Applied chaining First rule: l3 -> l1 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -5+WItemsNum^0 <= 0), cost: 4 Second rule: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Applied chaining First rule: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 Second rule: l1 -> l3 : WItemsNum^0'=2, -2+WItemsNum^0 >= 0, cost: -1+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (4 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (4 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Applied partial deletion Original rule: l3 -> l1 : WItemsNum^0'=6, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 New rule: l3 -> [18] : (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 Applied deletion Removed the following rules: 51 52 56 57 58 Eliminated locations on tree-shaped paths Start location: l14 60: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 61: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0), cost: 7 62: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 63: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 64: l3 -> [18] : (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 27-4*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied pruning (of leafs and parallel rules): Start location: l14 60: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 61: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0), cost: 7 62: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 63: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied simplification Original rule: l3 -> l3 : tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 <= 0), cost: 7 New rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (tmp1^post1 == 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Simplified simple loops Start location: l14 60: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 63: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 65: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 66: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 30*n10 Applied nonterm Original rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 New rule: l3 -> [19] : 2-WItemsNum^0 >= 0, cost: NONTERM Applied acceleration Original rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 New rule: l3 -> l3 : tmp1^0'=0, 2-WItemsNum^0 >= 0, cost: 7*n12 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 New rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 7*n14 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 7+37*n19 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (3 >= 0 /\ -1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (3 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 3+2*WItemsNum^0+37*n21 Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -1+tmp1^post1 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 45-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (2-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -1+tmp1^post1 >= 0), cost: NONTERM New rule: l3 -> [19] : (0 >= 0 /\ -1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: NONTERM Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (2-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0) /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n23 Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, -2+WItemsNum^0 == 0, cost: 10+2*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, -2+WItemsNum^0 == 0, cost: 10+2*WItemsNum^0 New rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, -2+WItemsNum^0 == 0, cost: 10+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (2-WItemsNum^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: 14*n25 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Second rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (0 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Heuristically decided not to add the following rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (2-WItemsNum^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: 14*n25 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 33+2*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 33+2*WItemsNum^0 New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 33+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (0 >= 0 /\ 3 >= 0 /\ -1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: NONTERM Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (0 >= 0 /\ 3 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0) /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n27 Applied chaining First rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 3+2*WItemsNum^0 Second rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 10+2*WItemsNum^0 Applied nonterm Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 10+2*WItemsNum^0 New rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied acceleration Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 10+2*WItemsNum^0 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 14*n29 Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM Applied chaining First rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 14*n29 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 7+14*n29 Applied simplification Original rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 30*n10 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 30*n10 Applied simplification Original rule: l3 -> [19] : 2-WItemsNum^0 >= 0, cost: NONTERM New rule: l3 -> [19] : -2+WItemsNum^0 <= 0, cost: NONTERM Applied simplification Original rule: l3 -> l3 : tmp1^0'=0, 2-WItemsNum^0 >= 0, cost: 7*n12 New rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7*n12 Applied simplification Original rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 7*n14 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 7*n14 Applied simplification Original rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 7+37*n19 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 7+37*n19 Applied simplification Original rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (3 >= 0 /\ -1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (3 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 3+2*WItemsNum^0+37*n21 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 3+2*WItemsNum^0+37*n21 Applied simplification Original rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -1+tmp1^post1 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (0 >= 0 /\ -1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (2-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0) /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n23 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n23 Applied simplification Original rule: l3 -> [19] : (2-WItemsNum^0 >= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (0 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (0 >= 0 /\ 3 >= 0 /\ -1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: NONTERM New rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (0 >= 0 /\ 3 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (-1-tmp1^post1 >= 0 \/ -1+tmp1^post1 >= 0) /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n27 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n27 Applied simplification Original rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM Applied simplification Original rule: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: NONTERM New rule: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 14*n29 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 14*n29 Applied simplification Original rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0 /\ 5-WItemsNum^0 >= 0), cost: 7+14*n29 New rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: 7+14*n29 Applied deletion Removed the following rules: 63 65 66 Applied deletion Removed the following rules: 95 99 101 102 105 106 110 113 114 Accelerated simple loops Start location: l14 60: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 96: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 30*n10 97: l3 -> [19] : -2+WItemsNum^0 <= 0, cost: NONTERM 98: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7*n12 100: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 7*n14 103: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 104: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 7+37*n19 107: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 108: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 3+2*WItemsNum^0+37*n21 109: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM 111: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 112: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n23 115: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM 116: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM 117: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 118: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n27 119: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM 120: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM 121: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 14*n29 122: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: 7+14*n29 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, -6+WItemsNum^0 >= 0, cost: 2+2*WItemsNum^0 New rule: l14 -> l3 : WItemsNum^0'=2, -6+WItemsNum^post17 >= 0, cost: 4+2*WItemsNum^post17 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 30*n10 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+30*n10 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : -2+WItemsNum^0 <= 0, cost: NONTERM New rule: l14 -> [19] : 0 == 0, cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : tmp1^0'=0, -2+WItemsNum^0 <= 0, cost: 7*n12 New rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, tmp1^0'=0, -2+WItemsNum^post17 <= 0, cost: 2+7*n12 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 7*n14 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (0 == 0 /\ -3 <= 0), cost: 2+7*n14 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n19 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n19 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 7+37*n19 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 9+37*n19 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n21 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n21 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 3+2*WItemsNum^0+37*n21 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ -2+WItemsNum^post17 >= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 5+37*n21+2*WItemsNum^post17 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 <= 0), cost: NONTERM New rule: l14 -> [19] : 0 == 0, cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n23 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n23 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n23 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 40+37*n23-4*WItemsNum^post17 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM New rule: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : (-1+tmp1^post1 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM New rule: l14 -> [19] : 0 == 0, cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 37*n27 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ -2+WItemsNum^post17 >= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n27 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^0 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 38-4*WItemsNum^0+37*n27 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 40-4*WItemsNum^post17+37*n27 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: NONTERM New rule: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> [19] : (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: NONTERM New rule: l14 -> [19] : 0 == 0, cost: NONTERM Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 >= 0 /\ -5+WItemsNum^0 <= 0), cost: 14*n29 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (0 == 0 /\ -3 <= 0), cost: 2+14*n29 Applied chaining First rule: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 Second rule: l3 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^0 <= 0 /\ -2+WItemsNum^0 >= 0), cost: 7+14*n29 New rule: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, 0 == 0, cost: 9+14*n29 Applied deletion Removed the following rules: 60 96 97 98 100 103 104 107 108 109 111 112 115 116 117 118 119 120 121 122 Chained accelerated rules with incoming rules Start location: l14 34: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, 0 == 0, cost: 2 123: l14 -> l3 : WItemsNum^0'=2, -6+WItemsNum^post17 >= 0, cost: 4+2*WItemsNum^post17 124: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+30*n10 125: l14 -> [19] : 0 == 0, cost: NONTERM 126: l14 -> l3 : WItemsNum^0'=WItemsNum^post17, tmp1^0'=0, -2+WItemsNum^post17 <= 0, cost: 2+7*n12 127: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (0 == 0 /\ -3 <= 0), cost: 2+7*n14 128: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n19 129: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-2+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 9+37*n19 130: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n21 131: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (-5+WItemsNum^post17 <= 0 /\ -2+WItemsNum^post17 >= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 5+37*n21+2*WItemsNum^post17 132: l14 -> [19] : 0 == 0, cost: NONTERM 133: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-2+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n23 134: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 40+37*n23-4*WItemsNum^post17 135: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM 136: l14 -> [19] : 0 == 0, cost: NONTERM 137: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ -2+WItemsNum^post17 >= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 2+37*n27 138: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=tmp1^post1, (-5+WItemsNum^post17 <= 0 /\ (1+tmp1^post1 <= 0 \/ -1+tmp1^post1 >= 0)), cost: 40-4*WItemsNum^post17+37*n27 139: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM 140: l14 -> [19] : 0 == 0, cost: NONTERM 141: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, (0 == 0 /\ -3 <= 0), cost: 2+14*n29 142: l14 -> l3 : WItemsNum^0'=2, tmp1^0'=0, 0 == 0, cost: 9+14*n29 Removed unreachable locations and irrelevant leafs Start location: l14 125: l14 -> [19] : 0 == 0, cost: NONTERM 132: l14 -> [19] : 0 == 0, cost: NONTERM 135: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM 136: l14 -> [19] : 0 == 0, cost: NONTERM 139: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM 140: l14 -> [19] : 0 == 0, cost: NONTERM Removed duplicate rules (ignoring updates) Start location: l14 139: l14 -> [19] : (0 == 0 /\ -3 <= 0), cost: NONTERM 140: l14 -> [19] : 0 == 0, cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 139 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: (0 == 0 /\ -3 <= 0)