NO Initial ITS Start location: l7 0: l0 -> l1 : e^0'=e^post0, __const_10^0'=__const_10^post0, olde^0'=olde^post0, copied^0'=copied^post0, __const_100^0'=__const_100^post0, n^0'=n^post0, __const_11^0'=__const_11^post0, oldn^0'=oldn^post0, (-oldn^post0+oldn^0 == 0 /\ -__const_11^post0+__const_11^0 == 0 /\ -e^0+olde^0 <= 0 /\ 1-copied^0 <= 0 /\ e^0-e^post0 == 0 /\ -copied^post0+copied^0 == 0 /\ olde^0-olde^post0 == 0 /\ -__const_10^post0+__const_10^0 == 0 /\ n^0-n^post0 == 0 /\ n^0-oldn^0 <= 0 /\ __const_100^0-__const_100^post0 == 0), cost: 1 1: l0 -> l2 : e^0'=e^post1, __const_10^0'=__const_10^post1, olde^0'=olde^post1, copied^0'=copied^post1, __const_100^0'=__const_100^post1, n^0'=n^post1, __const_11^0'=__const_11^post1, oldn^0'=oldn^post1, (__const_10^0-__const_10^post1 == 0 /\ n^post1-n^0-__const_11^0 == 0 /\ -1+copied^post1 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post1 == 0 /\ -__const_11^post1+__const_11^0 == 0 /\ -n^0+oldn^post1 == 0 /\ -__const_100^0+n^0 <= 0 /\ -__const_100^post1+__const_100^0 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0), cost: 1 3: l0 -> l3 : e^0'=e^post3, __const_10^0'=__const_10^post3, olde^0'=olde^post3, copied^0'=copied^post3, __const_100^0'=__const_100^post3, n^0'=n^post3, __const_11^0'=__const_11^post3, oldn^0'=oldn^post3, (1-e^0+e^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -1+copied^post3 == 0 /\ -n^0+oldn^post3 == 0 /\ -__const_11^post3+__const_11^0 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post3 == 0 /\ -__const_100^post3+__const_100^0 == 0 /\ __const_10^0+n^post3-n^0 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 5: l0 -> l4 : e^0'=e^post5, __const_10^0'=__const_10^post5, olde^0'=olde^post5, copied^0'=copied^post5, __const_100^0'=__const_100^post5, n^0'=n^post5, __const_11^0'=__const_11^post5, oldn^0'=oldn^post5, (-__const_11^post5+__const_11^0 == 0 /\ -oldn^post5+oldn^0 == 0 /\ -__const_100^post5+__const_100^0 == 0 /\ copied^0-copied^post5 == 0 /\ n^post5-n^0-__const_11^0 == 0 /\ -olde^post5+olde^0 == 0 /\ -1-e^0+e^post5 == 0 /\ -__const_100^0+n^0 <= 0 /\ __const_10^0-__const_10^post5 == 0 /\ 1-e^0 <= 0), cost: 1 7: l0 -> l5 : e^0'=e^post7, __const_10^0'=__const_10^post7, olde^0'=olde^post7, copied^0'=copied^post7, __const_100^0'=__const_100^post7, n^0'=n^post7, __const_11^0'=__const_11^post7, oldn^0'=oldn^post7, (__const_100^0-__const_100^post7 == 0 /\ 1-e^0+e^post7 == 0 /\ __const_10^0+n^post7-n^0 == 0 /\ -oldn^post7+oldn^0 == 0 /\ __const_11^0-__const_11^post7 == 0 /\ -olde^post7+olde^0 == 0 /\ copied^0-copied^post7 == 0 /\ __const_10^0-__const_10^post7 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 2: l2 -> l0 : e^0'=e^post2, __const_10^0'=__const_10^post2, olde^0'=olde^post2, copied^0'=copied^post2, __const_100^0'=__const_100^post2, n^0'=n^post2, __const_11^0'=__const_11^post2, oldn^0'=oldn^post2, (-oldn^post2+oldn^0 == 0 /\ olde^0-olde^post2 == 0 /\ e^0-e^post2 == 0 /\ -n^post2+n^0 == 0 /\ __const_100^0-__const_100^post2 == 0 /\ -__const_10^post2+__const_10^0 == 0 /\ -__const_11^post2+__const_11^0 == 0 /\ copied^0-copied^post2 == 0), cost: 1 4: l3 -> l0 : e^0'=e^post4, __const_10^0'=__const_10^post4, olde^0'=olde^post4, copied^0'=copied^post4, __const_100^0'=__const_100^post4, n^0'=n^post4, __const_11^0'=__const_11^post4, oldn^0'=oldn^post4, (e^0-e^post4 == 0 /\ -copied^post4+copied^0 == 0 /\ olde^0-olde^post4 == 0 /\ __const_100^0-__const_100^post4 == 0 /\ -__const_11^post4+__const_11^0 == 0 /\ __const_10^0-__const_10^post4 == 0 /\ n^0-n^post4 == 0 /\ -oldn^post4+oldn^0 == 0), cost: 1 6: l4 -> l0 : e^0'=e^post6, __const_10^0'=__const_10^post6, olde^0'=olde^post6, copied^0'=copied^post6, __const_100^0'=__const_100^post6, n^0'=n^post6, __const_11^0'=__const_11^post6, oldn^0'=oldn^post6, (-copied^post6+copied^0 == 0 /\ olde^0-olde^post6 == 0 /\ -__const_11^post6+__const_11^0 == 0 /\ e^0-e^post6 == 0 /\ -__const_10^post6+__const_10^0 == 0 /\ n^0-n^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ __const_100^0-__const_100^post6 == 0), cost: 1 8: l5 -> l0 : e^0'=e^post8, __const_10^0'=__const_10^post8, olde^0'=olde^post8, copied^0'=copied^post8, __const_100^0'=__const_100^post8, n^0'=n^post8, __const_11^0'=__const_11^post8, oldn^0'=oldn^post8, (-__const_100^post8+__const_100^0 == 0 /\ olde^0-olde^post8 == 0 /\ -oldn^post8+oldn^0 == 0 /\ -copied^post8+copied^0 == 0 /\ n^0-n^post8 == 0 /\ __const_10^0-__const_10^post8 == 0 /\ e^0-e^post8 == 0 /\ -__const_11^post8+__const_11^0 == 0), cost: 1 9: l6 -> l0 : e^0'=e^post9, __const_10^0'=__const_10^post9, olde^0'=olde^post9, copied^0'=copied^post9, __const_100^0'=__const_100^post9, n^0'=n^post9, __const_11^0'=__const_11^post9, oldn^0'=oldn^post9, (0 == 0 /\ -olde^post9+olde^0 == 0 /\ __const_11^0-__const_11^post9 == 0 /\ __const_10^0-__const_10^post9 == 0 /\ -1+e^post9 == 0 /\ -oldn^post9+oldn^0 == 0 /\ copied^post9 == 0 /\ -__const_100^post9+__const_100^0 == 0), cost: 1 10: l7 -> l6 : e^0'=e^post10, __const_10^0'=__const_10^post10, olde^0'=olde^post10, copied^0'=copied^post10, __const_100^0'=__const_100^post10, n^0'=n^post10, __const_11^0'=__const_11^post10, oldn^0'=oldn^post10, (olde^0-olde^post10 == 0 /\ e^0-e^post10 == 0 /\ -__const_11^post10+__const_11^0 == 0 /\ -oldn^post10+oldn^0 == 0 /\ n^0-n^post10 == 0 /\ -copied^post10+copied^0 == 0 /\ -__const_100^post10+__const_100^0 == 0 /\ __const_10^0-__const_10^post10 == 0), cost: 1 Removed unreachable rules and leafs Start location: l7 1: l0 -> l2 : e^0'=e^post1, __const_10^0'=__const_10^post1, olde^0'=olde^post1, copied^0'=copied^post1, __const_100^0'=__const_100^post1, n^0'=n^post1, __const_11^0'=__const_11^post1, oldn^0'=oldn^post1, (__const_10^0-__const_10^post1 == 0 /\ n^post1-n^0-__const_11^0 == 0 /\ -1+copied^post1 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post1 == 0 /\ -__const_11^post1+__const_11^0 == 0 /\ -n^0+oldn^post1 == 0 /\ -__const_100^0+n^0 <= 0 /\ -__const_100^post1+__const_100^0 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0), cost: 1 3: l0 -> l3 : e^0'=e^post3, __const_10^0'=__const_10^post3, olde^0'=olde^post3, copied^0'=copied^post3, __const_100^0'=__const_100^post3, n^0'=n^post3, __const_11^0'=__const_11^post3, oldn^0'=oldn^post3, (1-e^0+e^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -1+copied^post3 == 0 /\ -n^0+oldn^post3 == 0 /\ -__const_11^post3+__const_11^0 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post3 == 0 /\ -__const_100^post3+__const_100^0 == 0 /\ __const_10^0+n^post3-n^0 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 5: l0 -> l4 : e^0'=e^post5, __const_10^0'=__const_10^post5, olde^0'=olde^post5, copied^0'=copied^post5, __const_100^0'=__const_100^post5, n^0'=n^post5, __const_11^0'=__const_11^post5, oldn^0'=oldn^post5, (-__const_11^post5+__const_11^0 == 0 /\ -oldn^post5+oldn^0 == 0 /\ -__const_100^post5+__const_100^0 == 0 /\ copied^0-copied^post5 == 0 /\ n^post5-n^0-__const_11^0 == 0 /\ -olde^post5+olde^0 == 0 /\ -1-e^0+e^post5 == 0 /\ -__const_100^0+n^0 <= 0 /\ __const_10^0-__const_10^post5 == 0 /\ 1-e^0 <= 0), cost: 1 7: l0 -> l5 : e^0'=e^post7, __const_10^0'=__const_10^post7, olde^0'=olde^post7, copied^0'=copied^post7, __const_100^0'=__const_100^post7, n^0'=n^post7, __const_11^0'=__const_11^post7, oldn^0'=oldn^post7, (__const_100^0-__const_100^post7 == 0 /\ 1-e^0+e^post7 == 0 /\ __const_10^0+n^post7-n^0 == 0 /\ -oldn^post7+oldn^0 == 0 /\ __const_11^0-__const_11^post7 == 0 /\ -olde^post7+olde^0 == 0 /\ copied^0-copied^post7 == 0 /\ __const_10^0-__const_10^post7 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 2: l2 -> l0 : e^0'=e^post2, __const_10^0'=__const_10^post2, olde^0'=olde^post2, copied^0'=copied^post2, __const_100^0'=__const_100^post2, n^0'=n^post2, __const_11^0'=__const_11^post2, oldn^0'=oldn^post2, (-oldn^post2+oldn^0 == 0 /\ olde^0-olde^post2 == 0 /\ e^0-e^post2 == 0 /\ -n^post2+n^0 == 0 /\ __const_100^0-__const_100^post2 == 0 /\ -__const_10^post2+__const_10^0 == 0 /\ -__const_11^post2+__const_11^0 == 0 /\ copied^0-copied^post2 == 0), cost: 1 4: l3 -> l0 : e^0'=e^post4, __const_10^0'=__const_10^post4, olde^0'=olde^post4, copied^0'=copied^post4, __const_100^0'=__const_100^post4, n^0'=n^post4, __const_11^0'=__const_11^post4, oldn^0'=oldn^post4, (e^0-e^post4 == 0 /\ -copied^post4+copied^0 == 0 /\ olde^0-olde^post4 == 0 /\ __const_100^0-__const_100^post4 == 0 /\ -__const_11^post4+__const_11^0 == 0 /\ __const_10^0-__const_10^post4 == 0 /\ n^0-n^post4 == 0 /\ -oldn^post4+oldn^0 == 0), cost: 1 6: l4 -> l0 : e^0'=e^post6, __const_10^0'=__const_10^post6, olde^0'=olde^post6, copied^0'=copied^post6, __const_100^0'=__const_100^post6, n^0'=n^post6, __const_11^0'=__const_11^post6, oldn^0'=oldn^post6, (-copied^post6+copied^0 == 0 /\ olde^0-olde^post6 == 0 /\ -__const_11^post6+__const_11^0 == 0 /\ e^0-e^post6 == 0 /\ -__const_10^post6+__const_10^0 == 0 /\ n^0-n^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ __const_100^0-__const_100^post6 == 0), cost: 1 8: l5 -> l0 : e^0'=e^post8, __const_10^0'=__const_10^post8, olde^0'=olde^post8, copied^0'=copied^post8, __const_100^0'=__const_100^post8, n^0'=n^post8, __const_11^0'=__const_11^post8, oldn^0'=oldn^post8, (-__const_100^post8+__const_100^0 == 0 /\ olde^0-olde^post8 == 0 /\ -oldn^post8+oldn^0 == 0 /\ -copied^post8+copied^0 == 0 /\ n^0-n^post8 == 0 /\ __const_10^0-__const_10^post8 == 0 /\ e^0-e^post8 == 0 /\ -__const_11^post8+__const_11^0 == 0), cost: 1 9: l6 -> l0 : e^0'=e^post9, __const_10^0'=__const_10^post9, olde^0'=olde^post9, copied^0'=copied^post9, __const_100^0'=__const_100^post9, n^0'=n^post9, __const_11^0'=__const_11^post9, oldn^0'=oldn^post9, (0 == 0 /\ -olde^post9+olde^0 == 0 /\ __const_11^0-__const_11^post9 == 0 /\ __const_10^0-__const_10^post9 == 0 /\ -1+e^post9 == 0 /\ -oldn^post9+oldn^0 == 0 /\ copied^post9 == 0 /\ -__const_100^post9+__const_100^0 == 0), cost: 1 10: l7 -> l6 : e^0'=e^post10, __const_10^0'=__const_10^post10, olde^0'=olde^post10, copied^0'=copied^post10, __const_100^0'=__const_100^post10, n^0'=n^post10, __const_11^0'=__const_11^post10, oldn^0'=oldn^post10, (olde^0-olde^post10 == 0 /\ e^0-e^post10 == 0 /\ -__const_11^post10+__const_11^0 == 0 /\ -oldn^post10+oldn^0 == 0 /\ n^0-n^post10 == 0 /\ -copied^post10+copied^0 == 0 /\ -__const_100^post10+__const_100^0 == 0 /\ __const_10^0-__const_10^post10 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l2 : e^0'=e^post1, __const_10^0'=__const_10^post1, olde^0'=olde^post1, copied^0'=copied^post1, __const_100^0'=__const_100^post1, n^0'=n^post1, __const_11^0'=__const_11^post1, oldn^0'=oldn^post1, (__const_10^0-__const_10^post1 == 0 /\ n^post1-n^0-__const_11^0 == 0 /\ -1+copied^post1 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post1 == 0 /\ -__const_11^post1+__const_11^0 == 0 /\ -n^0+oldn^post1 == 0 /\ -__const_100^0+n^0 <= 0 /\ -__const_100^post1+__const_100^0 == 0 /\ -1-e^0+e^post1 == 0 /\ 1-e^0 <= 0), cost: 1 New rule: l0 -> l2 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l2 -> l0 : e^0'=e^post2, __const_10^0'=__const_10^post2, olde^0'=olde^post2, copied^0'=copied^post2, __const_100^0'=__const_100^post2, n^0'=n^post2, __const_11^0'=__const_11^post2, oldn^0'=oldn^post2, (-oldn^post2+oldn^0 == 0 /\ olde^0-olde^post2 == 0 /\ e^0-e^post2 == 0 /\ -n^post2+n^0 == 0 /\ __const_100^0-__const_100^post2 == 0 /\ -__const_10^post2+__const_10^0 == 0 /\ -__const_11^post2+__const_11^0 == 0 /\ copied^0-copied^post2 == 0), cost: 1 New rule: l2 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l3 : e^0'=e^post3, __const_10^0'=__const_10^post3, olde^0'=olde^post3, copied^0'=copied^post3, __const_100^0'=__const_100^post3, n^0'=n^post3, __const_11^0'=__const_11^post3, oldn^0'=oldn^post3, (1-e^0+e^post3 == 0 /\ __const_10^0-__const_10^post3 == 0 /\ -1+copied^post3 == 0 /\ -n^0+oldn^post3 == 0 /\ -__const_11^post3+__const_11^0 == 0 /\ copied^0 <= 0 /\ -e^0+olde^post3 == 0 /\ -__const_100^post3+__const_100^0 == 0 /\ __const_10^0+n^post3-n^0 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 New rule: l0 -> l3 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l3 -> l0 : e^0'=e^post4, __const_10^0'=__const_10^post4, olde^0'=olde^post4, copied^0'=copied^post4, __const_100^0'=__const_100^post4, n^0'=n^post4, __const_11^0'=__const_11^post4, oldn^0'=oldn^post4, (e^0-e^post4 == 0 /\ -copied^post4+copied^0 == 0 /\ olde^0-olde^post4 == 0 /\ __const_100^0-__const_100^post4 == 0 /\ -__const_11^post4+__const_11^0 == 0 /\ __const_10^0-__const_10^post4 == 0 /\ n^0-n^post4 == 0 /\ -oldn^post4+oldn^0 == 0), cost: 1 New rule: l3 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l4 : e^0'=e^post5, __const_10^0'=__const_10^post5, olde^0'=olde^post5, copied^0'=copied^post5, __const_100^0'=__const_100^post5, n^0'=n^post5, __const_11^0'=__const_11^post5, oldn^0'=oldn^post5, (-__const_11^post5+__const_11^0 == 0 /\ -oldn^post5+oldn^0 == 0 /\ -__const_100^post5+__const_100^0 == 0 /\ copied^0-copied^post5 == 0 /\ n^post5-n^0-__const_11^0 == 0 /\ -olde^post5+olde^0 == 0 /\ -1-e^0+e^post5 == 0 /\ -__const_100^0+n^0 <= 0 /\ __const_10^0-__const_10^post5 == 0 /\ 1-e^0 <= 0), cost: 1 New rule: l0 -> l4 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l4 -> l0 : e^0'=e^post6, __const_10^0'=__const_10^post6, olde^0'=olde^post6, copied^0'=copied^post6, __const_100^0'=__const_100^post6, n^0'=n^post6, __const_11^0'=__const_11^post6, oldn^0'=oldn^post6, (-copied^post6+copied^0 == 0 /\ olde^0-olde^post6 == 0 /\ -__const_11^post6+__const_11^0 == 0 /\ e^0-e^post6 == 0 /\ -__const_10^post6+__const_10^0 == 0 /\ n^0-n^post6 == 0 /\ -oldn^post6+oldn^0 == 0 /\ __const_100^0-__const_100^post6 == 0), cost: 1 New rule: l4 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l0 -> l5 : e^0'=e^post7, __const_10^0'=__const_10^post7, olde^0'=olde^post7, copied^0'=copied^post7, __const_100^0'=__const_100^post7, n^0'=n^post7, __const_11^0'=__const_11^post7, oldn^0'=oldn^post7, (__const_100^0-__const_100^post7 == 0 /\ 1-e^0+e^post7 == 0 /\ __const_10^0+n^post7-n^0 == 0 /\ -oldn^post7+oldn^0 == 0 /\ __const_11^0-__const_11^post7 == 0 /\ -olde^post7+olde^0 == 0 /\ copied^0-copied^post7 == 0 /\ __const_10^0-__const_10^post7 == 0 /\ 1+__const_100^0-n^0 <= 0 /\ 1-e^0 <= 0), cost: 1 New rule: l0 -> l5 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Applied preprocessing Original rule: l5 -> l0 : e^0'=e^post8, __const_10^0'=__const_10^post8, olde^0'=olde^post8, copied^0'=copied^post8, __const_100^0'=__const_100^post8, n^0'=n^post8, __const_11^0'=__const_11^post8, oldn^0'=oldn^post8, (-__const_100^post8+__const_100^0 == 0 /\ olde^0-olde^post8 == 0 /\ -oldn^post8+oldn^0 == 0 /\ -copied^post8+copied^0 == 0 /\ n^0-n^post8 == 0 /\ __const_10^0-__const_10^post8 == 0 /\ e^0-e^post8 == 0 /\ -__const_11^post8+__const_11^0 == 0), cost: 1 New rule: l5 -> l0 : TRUE, cost: 1 Applied preprocessing Original rule: l6 -> l0 : e^0'=e^post9, __const_10^0'=__const_10^post9, olde^0'=olde^post9, copied^0'=copied^post9, __const_100^0'=__const_100^post9, n^0'=n^post9, __const_11^0'=__const_11^post9, oldn^0'=oldn^post9, (0 == 0 /\ -olde^post9+olde^0 == 0 /\ __const_11^0-__const_11^post9 == 0 /\ __const_10^0-__const_10^post9 == 0 /\ -1+e^post9 == 0 /\ -oldn^post9+oldn^0 == 0 /\ copied^post9 == 0 /\ -__const_100^post9+__const_100^0 == 0), cost: 1 New rule: l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1 Applied preprocessing Original rule: l7 -> l6 : e^0'=e^post10, __const_10^0'=__const_10^post10, olde^0'=olde^post10, copied^0'=copied^post10, __const_100^0'=__const_100^post10, n^0'=n^post10, __const_11^0'=__const_11^post10, oldn^0'=oldn^post10, (olde^0-olde^post10 == 0 /\ e^0-e^post10 == 0 /\ -__const_11^post10+__const_11^0 == 0 /\ -oldn^post10+oldn^0 == 0 /\ n^0-n^post10 == 0 /\ -copied^post10+copied^0 == 0 /\ -__const_100^post10+__const_100^0 == 0 /\ __const_10^0-__const_10^post10 == 0), cost: 1 New rule: l7 -> l6 : TRUE, cost: 1 Simplified rules Start location: l7 11: l0 -> l2 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 13: l0 -> l3 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 15: l0 -> l4 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 17: l0 -> l5 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 12: l2 -> l0 : TRUE, cost: 1 14: l3 -> l0 : TRUE, cost: 1 16: l4 -> l0 : TRUE, cost: 1 18: l5 -> l0 : TRUE, cost: 1 19: l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1 20: l7 -> l6 : TRUE, cost: 1 Eliminating location l6 by chaining: Applied chaining First rule: l7 -> l6 : TRUE, cost: 1 Second rule: l6 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 1 New rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Applied deletion Removed the following rules: 19 20 Eliminating location l2 by chaining: Applied chaining First rule: l0 -> l2 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Second rule: l2 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Applied deletion Removed the following rules: 11 12 Eliminating location l3 by chaining: Applied chaining First rule: l0 -> l3 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Second rule: l3 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Applied deletion Removed the following rules: 13 14 Eliminating location l4 by chaining: Applied chaining First rule: l0 -> l4 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Second rule: l4 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Applied deletion Removed the following rules: 15 16 Eliminating location l5 by chaining: Applied chaining First rule: l0 -> l5 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 1 Second rule: l5 -> l0 : TRUE, cost: 1 New rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Applied deletion Removed the following rules: 17 18 Eliminated locations on linear paths Start location: l7 22: l0 -> l0 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 23: l0 -> l0 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 24: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 25: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Applied acceleration Original rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 Sub-proof via acceration calculus written to file:///tmp/tmpnam_CDjlFd.txt Applied nonterm Original rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> [8] : (__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_AookPc.txt Applied acceleration Original rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> l0 : e^0'=e^0-n2, n^0'=-__const_10^0*n2+n^0, (e^0-n2 >= 0 /\ -1-__const_10^0*(-1+n2)-__const_100^0+n^0 >= 0 /\ n2 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*n2 Sub-proof via acceration calculus written to file:///tmp/tmpnam_BHJcac.txt Applied instantiation Original rule: l0 -> l0 : e^0'=e^0-n2, n^0'=-__const_10^0*n2+n^0, (e^0-n2 >= 0 /\ -1-__const_10^0*(-1+n2)-__const_100^0+n^0 >= 0 /\ n2 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*n2 New rule: l0 -> l0 : e^0'=0, n^0'=-e^0*__const_10^0+n^0, (0 >= 0 /\ e^0 >= 0 /\ -1-__const_10^0*(-1+e^0)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*e^0 Applied chaining First rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_10^0-__const_100^0+n^0 <= 0 /\ -2+e^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 4 Applied acceleration Original rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_10^0-__const_100^0+n^0 <= 0 /\ -2+e^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 4 New rule: l0 -> l0 : n^0'=n3*__const_11^0+n^0-__const_10^0*n3, (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ n3 >= 0 /\ -1+(-1+n3)*__const_11^0-__const_100^0+n^0-__const_10^0*(-1+n3) >= 0 /\ __const_10^0-(-1+n3)*__const_11^0+__const_100^0-n^0+__const_10^0*(-1+n3) >= 0), cost: 4*n3 Sub-proof via acceration calculus written to file:///tmp/tmpnam_fLoBOg.txt Applied nonterm Original rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_10^0-__const_100^0+n^0 <= 0 /\ -2+e^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 4 New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_eMdIMi.txt Applied chaining First rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0), cost: NONTERM New rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ __const_10^0+__const_100^0-n^0-__const_11^0 >= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM Applied chaining First rule: l0 -> l0 : e^0'=1+e^0, n^0'=n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ 1+__const_100^0-n^0-__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: 4 Applied acceleration Original rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ 1+__const_100^0-n^0-__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: 4 New rule: l0 -> l0 : n^0'=n6*__const_11^0+n^0-__const_10^0*n6, (__const_100^0-(-1+n6)*__const_11^0-n^0+__const_10^0*(-1+n6) >= 0 /\ -1-__const_100^0+n^0+__const_11^0 >= 0 /\ -1-__const_100^0+(-1+n6)*__const_11^0+n^0-__const_10^0*(-1+n6)+__const_11^0 >= 0 /\ n6 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 4*n6 Sub-proof via acceration calculus written to file:///tmp/tmpnam_KfDbim.txt Applied nonterm Original rule: l0 -> l0 : n^0'=-__const_10^0+n^0+__const_11^0, (-__const_100^0+n^0 <= 0 /\ 1+__const_100^0-n^0-__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: 4 New rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_CHkOdd.txt Applied chaining First rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_10^0-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM Applied chaining First rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 New rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 2+2*n1 Applied acceleration Original rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 2+2*n1 New rule: l0 -> l0 : e^0'=e^0-n13+n13*n1, n^0'=n13*n1*__const_11^0-n13*__const_10^0+n^0, (-n1*(-1+n13)*__const_11^0+__const_10^0+__const_10^0*(-1+n13)+__const_100^0-n^0 >= 0 /\ -2+e^0 >= 0 /\ n13 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -n1*(-1+n13)*__const_11^0+__const_10^0+__const_10^0*(-1+n13)+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+n1*(-1+n13)*__const_11^0-__const_10^0*(-1+n13)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ -1+e^0-n13+n1*(-1+n13) >= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0), cost: 2*n13+2*n13*n1 Sub-proof via acceration calculus written to file:///tmp/tmpnam_nPaODN.txt Applied instantiation Original rule: l0 -> l0 : e^0'=e^0-n13+n13*n1, n^0'=n13*n1*__const_11^0-n13*__const_10^0+n^0, (-n1*(-1+n13)*__const_11^0+__const_10^0+__const_10^0*(-1+n13)+__const_100^0-n^0 >= 0 /\ -2+e^0 >= 0 /\ n13 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -n1*(-1+n13)*__const_11^0+__const_10^0+__const_10^0*(-1+n13)+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+n1*(-1+n13)*__const_11^0-__const_10^0*(-1+n13)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ -1+e^0-n13+n1*(-1+n13) >= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0), cost: 2*n13+2*n13*n1 New rule: l0 -> l0 : e^0'=1, n^0'=-__const_10^0*(-1+e^0)+n^0, (0 >= 0 /\ __const_10^0+__const_100^0-n^0+__const_11^0 >= 0 /\ -2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ -1-(-2+e^0)*__const_10^0-__const_100^0+n^0 >= 0 /\ __const_10^0+(-2+e^0)*__const_10^0+__const_100^0-n^0 >= 0 /\ __const_10^0+(-2+e^0)*__const_10^0+__const_100^0-n^0+__const_11^0 >= 0 /\ -1+e^0 >= 0), cost: -2+2*e^0 Applied nonterm Original rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ 1+__const_100^0-n^0 <= 0), cost: 2+2*n1 New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1-n1 <= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_mlNAeF.txt Applied chaining First rule: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 Second rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1-n1 <= 0), cost: NONTERM New rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ -2+e^0+n1 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0-n1*__const_11^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1-n1 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0 /\ __const_10^0+__const_100^0-n^0-n1*__const_11^0 >= 0), cost: NONTERM Applied chaining First rule: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 Second rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (1+__const_100^0-n^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2+2*n1 Applied acceleration Original rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (1+__const_100^0-n^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2+2*n1 New rule: l0 -> l0 : e^0'=n14*n1+e^0-n14, n^0'=-__const_10^0*n14+n^0+n14*n1*__const_11^0, (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0*(-1+n14)+__const_100^0-n^0-(-1+n14)*n1*__const_11^0 >= 0 /\ n14 >= 0 /\ -1-__const_10^0*(-1+n14)-__const_100^0+n^0+(-1+n14)*n1*__const_11^0+n1*__const_11^0 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ __const_10^0*(-1+n14)+__const_100^0-__const_11^0*(-1+n1)-n^0-(-1+n14)*n1*__const_11^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n14*n1+2*n14 Sub-proof via acceration calculus written to file:///tmp/tmpnam_pmEiGG.txt Applied nonterm Original rule: l0 -> l0 : e^0'=-1+e^0+n1, n^0'=-__const_10^0+n^0+n1*__const_11^0, (1+__const_100^0-n^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2+2*n1 New rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_JfcIfj.txt Applied chaining First rule: l0 -> l0 : e^0'=-1+e^0, n^0'=-__const_10^0+n^0, (1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_10^0-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM Applied simplification Original rule: l0 -> l0 : e^0'=0, n^0'=-e^0*__const_10^0+n^0, (0 >= 0 /\ e^0 >= 0 /\ -1-__const_10^0*(-1+e^0)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*e^0 New rule: l0 -> l0 : e^0'=0, n^0'=-e^0*__const_10^0+n^0, (e^0 >= 0 /\ -1-__const_10^0*(-1+e^0)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*e^0 Applied simplification Original rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ __const_10^0+__const_100^0-n^0-__const_11^0 >= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ __const_10^0+__const_100^0-n^0-__const_11^0 >= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM Applied simplification Original rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_10^0-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0), cost: NONTERM Applied simplification Original rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ n1 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1-n1 <= 0), cost: NONTERM New rule: l0 -> [8] : (-2+e^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+n1 >= 0), cost: NONTERM Applied simplification Original rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ -2+e^0+n1 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0-n1*__const_11^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1-n1 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0 /\ __const_10^0+__const_100^0-n^0-n1*__const_11^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0-n1*__const_11^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0-n1*__const_11^0 >= 0), cost: NONTERM Applied simplification Original rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_10^0-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM New rule: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0), cost: NONTERM Applied deletion Removed the following rules: 24 25 Accelerated simple loops Start location: l7 22: l0 -> l0 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 23: l0 -> l0 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 26: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 27: l0 -> [8] : (__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM 29: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0), cost: NONTERM 31: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM 35: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM 37: l0 -> l0 : e^0'=0, n^0'=-e^0*__const_10^0+n^0, (e^0 >= 0 /\ -1-__const_10^0*(-1+e^0)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*e^0 38: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ __const_10^0+__const_100^0-n^0-__const_11^0 >= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM 39: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0), cost: NONTERM 40: l0 -> [8] : (-2+e^0 >= 0 /\ -1-__const_100^0+n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+n1 >= 0), cost: NONTERM 41: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0-n1*__const_11^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0-n1*__const_11^0 >= 0), cost: NONTERM 42: l0 -> [8] : (-2+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ 1+__const_100^0-n^0 <= 0), cost: NONTERM 21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> l0 : e^0'=1+e^0, olde^0'=e^0, copied^0'=1, n^0'=n^0+__const_11^0, oldn^0'=n^0, (copied^0 <= 0 /\ -__const_100^0+n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l7 -> l0 : e^0'=2, olde^0'=1, copied^0'=1, n^0'=n^post9+__const_11^0, oldn^0'=n^post9, n^post9-__const_100^0 <= 0, cost: 4 Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> l0 : e^0'=-1+e^0, olde^0'=e^0, copied^0'=1, n^0'=-__const_10^0+n^0, oldn^0'=n^0, (copied^0 <= 0 /\ 1+__const_100^0-n^0 <= 0 /\ -1+e^0 >= 0), cost: 2 New rule: l7 -> l0 : e^0'=0, olde^0'=1, copied^0'=1, n^0'=-__const_10^0+n^post9, oldn^0'=n^post9, 1-n^post9+__const_100^0 <= 0, cost: 4 Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> l0 : e^0'=e^0+n1, n^0'=n^0+n1*__const_11^0, (n1 >= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: 2*n1 New rule: l7 -> l0 : e^0'=1+n1, copied^0'=0, n^0'=n^post9+n1*__const_11^0, (n1 >= 0 /\ -n^post9+__const_100^0-__const_11^0*(-1+n1) >= 0 /\ -n^post9+__const_100^0 >= 0), cost: 2+2*n1 Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> [8] : (__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM New rule: l7 -> [8] : __const_11^0 <= 0, cost: NONTERM Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM New rule: l7 -> [8] : (-1+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_100^0-__const_11^0*(-1+n1)-n^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_100^0-n^0 >= 0), cost: NONTERM New rule: l7 -> [8] : (-1+n1*__const_11^0 >= 0 /\ 1+__const_11^0*(-1+n1)-n1*__const_11^0 <= 0 /\ __const_10^0-n1*__const_11^0 == 0), cost: NONTERM Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> l0 : e^0'=0, n^0'=-e^0*__const_10^0+n^0, (e^0 >= 0 /\ -1-__const_10^0*(-1+e^0)-__const_100^0+n^0 >= 0 /\ -1-__const_100^0+n^0 >= 0), cost: 2*e^0 New rule: l7 -> l0 : e^0'=0, copied^0'=0, n^0'=-__const_10^0+n^post9, -1+n^post9-__const_100^0 >= 0, cost: 4 Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 <= 0 /\ __const_10^0+__const_100^0-n^0-__const_11^0 >= 0 /\ -__const_10^0+__const_11^0 <= 0 /\ -1+e^0 >= 0), cost: NONTERM New rule: l7 -> [8] : (-1+__const_10^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM Applied chaining First rule: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 Second rule: l0 -> [8] : (-1-__const_100^0+n^0+n1*__const_11^0 >= 0 /\ __const_10^0-n1*__const_11^0 <= 0 /\ __const_10^0+__const_100^0-__const_11^0*(-1+n1)-n^0-n1*__const_11^0 >= 0 /\ -__const_10^0+n1*__const_11^0 <= 0 /\ -1+e^0 >= 0 /\ __const_10^0+__const_100^0-n^0-n1*__const_11^0 >= 0), cost: NONTERM New rule: l7 -> [8] : (1-__const_10^0+__const_11^0*(-1+n1) <= 0 /\ __const_10^0-n1*__const_11^0 == 0 /\ 1-__const_10^0 <= 0), cost: NONTERM Applied deletion Removed the following rules: 22 23 26 27 29 31 35 37 38 39 40 41 42 Chained accelerated rules with incoming rules Start location: l7 21: l7 -> l0 : e^0'=1, copied^0'=0, n^0'=n^post9, 0 == 0, cost: 2 43: l7 -> l0 : e^0'=2, olde^0'=1, copied^0'=1, n^0'=n^post9+__const_11^0, oldn^0'=n^post9, n^post9-__const_100^0 <= 0, cost: 4 44: l7 -> l0 : e^0'=0, olde^0'=1, copied^0'=1, n^0'=-__const_10^0+n^post9, oldn^0'=n^post9, 1-n^post9+__const_100^0 <= 0, cost: 4 45: l7 -> l0 : e^0'=1+n1, copied^0'=0, n^0'=n^post9+n1*__const_11^0, (n1 >= 0 /\ -n^post9+__const_100^0-__const_11^0*(-1+n1) >= 0 /\ -n^post9+__const_100^0 >= 0), cost: 2+2*n1 46: l7 -> [8] : __const_11^0 <= 0, cost: NONTERM 47: l7 -> [8] : (-1+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM 48: l7 -> [8] : (-1+n1*__const_11^0 >= 0 /\ 1+__const_11^0*(-1+n1)-n1*__const_11^0 <= 0 /\ __const_10^0-n1*__const_11^0 == 0), cost: NONTERM 49: l7 -> l0 : e^0'=0, copied^0'=0, n^0'=-__const_10^0+n^post9, -1+n^post9-__const_100^0 >= 0, cost: 4 50: l7 -> [8] : (-1+__const_10^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM 51: l7 -> [8] : (1-__const_10^0+__const_11^0*(-1+n1) <= 0 /\ __const_10^0-n1*__const_11^0 == 0 /\ 1-__const_10^0 <= 0), cost: NONTERM Removed unreachable locations and irrelevant leafs Start location: l7 46: l7 -> [8] : __const_11^0 <= 0, cost: NONTERM 47: l7 -> [8] : (-1+__const_11^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM 48: l7 -> [8] : (-1+n1*__const_11^0 >= 0 /\ 1+__const_11^0*(-1+n1)-n1*__const_11^0 <= 0 /\ __const_10^0-n1*__const_11^0 == 0), cost: NONTERM 50: l7 -> [8] : (-1+__const_10^0 >= 0 /\ __const_10^0-__const_11^0 == 0), cost: NONTERM 51: l7 -> [8] : (1-__const_10^0+__const_11^0*(-1+n1) <= 0 /\ __const_10^0-n1*__const_11^0 == 0 /\ 1-__const_10^0 <= 0), cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 46 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: __const_11^0 <= 0