NO Initial ITS Start location: l9 0: l0 -> l1 : temp0_14^0'=temp0_14^post0, a_21^0'=a_21^post0, result_11^0'=result_11^post0, a_13^0'=a_13^post0, x_15^0'=x_15^post0, nondet_12^0'=nondet_12^post0, (a_21^0-a_21^post0 == 0 /\ -result_11^post0+result_11^0 == 0 /\ -a_13^post0+a_13^0 == 0 /\ -nondet_12^post0+nondet_12^0 == 0 /\ x_15^0-x_15^post0 == 0 /\ temp0_14^0-temp0_14^post0 == 0), cost: 1 1: l1 -> l2 : temp0_14^0'=temp0_14^post1, a_21^0'=a_21^post1, result_11^0'=result_11^post1, a_13^0'=a_13^post1, x_15^0'=x_15^post1, nondet_12^0'=nondet_12^post1, (-x_15^post1+x_15^0 == 0 /\ -temp0_14^0+result_11^post1 == 0 /\ -a_13^post1+a_13^0 == 0 /\ -nondet_12^post1+nondet_12^0 == 0 /\ temp0_14^0-temp0_14^post1 == 0 /\ a_21^0-a_21^post1 == 0 /\ a_13^0 <= 0), cost: 1 2: l1 -> l3 : temp0_14^0'=temp0_14^post2, a_21^0'=a_21^post2, result_11^0'=result_11^post2, a_13^0'=a_13^post2, x_15^0'=x_15^post2, nondet_12^0'=nondet_12^post2, (0 == 0 /\ temp0_14^0-temp0_14^post2 == 0 /\ -result_11^post2+result_11^0 == 0 /\ a_13^post2-x_15^post2 <= 0 /\ a_13^post2-x_15^post2 == 0 /\ -nondet_12^10+x_15^post2 == 0 /\ -a_13^0+2*x_15^post2 <= 0 /\ -a_13^post2+x_15^post2 <= 0 /\ a_13^0-2*x_15^post2 <= 0 /\ a_21^0-a_21^post2 == 0 /\ 1-2*x_15^post2 <= 0 /\ 1-a_13^0 <= 0), cost: 1 4: l1 -> l5 : temp0_14^0'=temp0_14^post4, a_21^0'=a_21^post4, result_11^0'=result_11^post4, a_13^0'=a_13^post4, x_15^0'=x_15^post4, nondet_12^0'=nondet_12^post4, (0 == 0 /\ temp0_14^0-temp0_14^post4 == 0 /\ a_13^0-a_13^post4 == 0 /\ x_15^post4-nondet_12^11 == 0 /\ 1-a_13^0 <= 0 /\ result_11^0-result_11^post4 == 0), cost: 1 3: l3 -> l1 : temp0_14^0'=temp0_14^post3, a_21^0'=a_21^post3, result_11^0'=result_11^post3, a_13^0'=a_13^post3, x_15^0'=x_15^post3, nondet_12^0'=nondet_12^post3, (result_11^0-result_11^post3 == 0 /\ temp0_14^0-temp0_14^post3 == 0 /\ -x_15^post3+x_15^0 == 0 /\ -nondet_12^post3+nondet_12^0 == 0 /\ a_13^0-a_13^post3 == 0 /\ -a_21^post3+a_21^0 == 0), cost: 1 5: l5 -> l6 : temp0_14^0'=temp0_14^post5, a_21^0'=a_21^post5, result_11^0'=result_11^post5, a_13^0'=a_13^post5, x_15^0'=x_15^post5, nondet_12^0'=nondet_12^post5, (result_11^0-result_11^post5 == 0 /\ 1+a_13^0-2*x_15^0 <= 0 /\ a_13^0-a_13^post5 == 0 /\ -a_21^post5+a_21^0 == 0 /\ temp0_14^0-temp0_14^post5 == 0 /\ -x_15^post5+x_15^0 == 0 /\ -nondet_12^post5+nondet_12^0 == 0), cost: 1 6: l5 -> l6 : temp0_14^0'=temp0_14^post6, a_21^0'=a_21^post6, result_11^0'=result_11^post6, a_13^0'=a_13^post6, x_15^0'=x_15^post6, nondet_12^0'=nondet_12^post6, (-result_11^post6+result_11^0 == 0 /\ -nondet_12^post6+nondet_12^0 == 0 /\ temp0_14^0-temp0_14^post6 == 0 /\ 1-a_13^0+2*x_15^0 <= 0 /\ a_13^0-a_13^post6 == 0 /\ a_21^0-a_21^post6 == 0 /\ x_15^0-x_15^post6 == 0), cost: 1 7: l6 -> l7 : temp0_14^0'=temp0_14^post7, a_21^0'=a_21^post7, result_11^0'=result_11^post7, a_13^0'=a_13^post7, x_15^0'=x_15^post7, nondet_12^0'=nondet_12^post7, (-nondet_12^post7+nondet_12^0 == 0 /\ a_21^0-a_21^post7 == 0 /\ 1+3*a_21^0-a_13^post7 <= 0 /\ -1+a_13^post7-3*a_13^0 == 0 /\ temp0_14^0-temp0_14^post7 == 0 /\ x_15^0-x_15^post7 == 0 /\ -result_11^post7+result_11^0 == 0 /\ -1-3*a_21^0+a_13^post7 <= 0), cost: 1 8: l7 -> l8 : temp0_14^0'=temp0_14^post8, a_21^0'=a_21^post8, result_11^0'=result_11^post8, a_13^0'=a_13^post8, x_15^0'=x_15^post8, nondet_12^0'=nondet_12^post8, (-a_13^post8+a_13^0 == 0 /\ -nondet_12^post8+nondet_12^0 == 0 /\ a_21^0-a_21^post8 == 0 /\ temp0_14^0-temp0_14^post8 == 0 /\ -result_11^post8+result_11^0 == 0 /\ x_15^0-x_15^post8 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 1 9: l7 -> l8 : temp0_14^0'=temp0_14^post9, a_21^0'=a_21^post9, result_11^0'=result_11^post9, a_13^0'=a_13^post9, x_15^0'=x_15^post9, nondet_12^0'=nondet_12^post9, (-x_15^post9+x_15^0 == 0 /\ -result_11^post9+result_11^0 == 0 /\ a_21^0-a_21^post9 == 0 /\ 1-a_21^0+2*x_15^0 <= 0 /\ nondet_12^0-nondet_12^post9 == 0 /\ -a_13^post9+a_13^0 == 0 /\ temp0_14^0-temp0_14^post9 == 0), cost: 1 10: l8 -> l4 : temp0_14^0'=temp0_14^post10, a_21^0'=a_21^post10, result_11^0'=result_11^post10, a_13^0'=a_13^post10, x_15^0'=x_15^post10, nondet_12^0'=nondet_12^post10, (temp0_14^0-temp0_14^post10 == 0 /\ -x_15^post10+x_15^0 == 0 /\ -a_13^post10+a_13^0 == 0 /\ -nondet_12^post10+nondet_12^0 == 0 /\ result_11^0-result_11^post10 == 0 /\ 1-a_21^0 <= 0 /\ a_21^0-a_21^post10 == 0), cost: 1 11: l4 -> l1 : temp0_14^0'=temp0_14^post11, a_21^0'=a_21^post11, result_11^0'=result_11^post11, a_13^0'=a_13^post11, x_15^0'=x_15^post11, nondet_12^0'=nondet_12^post11, (-a_21^post11+a_21^0 == 0 /\ temp0_14^0-temp0_14^post11 == 0 /\ result_11^0-result_11^post11 == 0 /\ a_13^0-a_13^post11 == 0 /\ -x_15^post11+x_15^0 == 0 /\ -nondet_12^post11+nondet_12^0 == 0), cost: 1 12: l9 -> l0 : temp0_14^0'=temp0_14^post12, a_21^0'=a_21^post12, result_11^0'=result_11^post12, a_13^0'=a_13^post12, x_15^0'=x_15^post12, nondet_12^0'=nondet_12^post12, (a_13^0-a_13^post12 == 0 /\ -a_21^post12+a_21^0 == 0 /\ temp0_14^0-temp0_14^post12 == 0 /\ result_11^0-result_11^post12 == 0 /\ -x_15^post12+x_15^0 == 0 /\ -nondet_12^post12+nondet_12^0 == 0), cost: 1 Removed unreachable rules and leafs Start location: l9 0: l0 -> l1 : temp0_14^0'=temp0_14^post0, a_21^0'=a_21^post0, result_11^0'=result_11^post0, a_13^0'=a_13^post0, x_15^0'=x_15^post0, nondet_12^0'=nondet_12^post0, (a_21^0-a_21^post0 == 0 /\ -result_11^post0+result_11^0 == 0 /\ -a_13^post0+a_13^0 == 0 /\ -nondet_12^post0+nondet_12^0 == 0 /\ x_15^0-x_15^post0 == 0 /\ temp0_14^0-temp0_14^post0 == 0), cost: 1 2: l1 -> l3 : temp0_14^0'=temp0_14^post2, a_21^0'=a_21^post2, result_11^0'=result_11^post2, a_13^0'=a_13^post2, x_15^0'=x_15^post2, nondet_12^0'=nondet_12^post2, (0 == 0 /\ temp0_14^0-temp0_14^post2 == 0 /\ -result_11^post2+result_11^0 == 0 /\ a_13^post2-x_15^post2 <= 0 /\ a_13^post2-x_15^post2 == 0 /\ -nondet_12^10+x_15^post2 == 0 /\ -a_13^0+2*x_15^post2 <= 0 /\ -a_13^post2+x_15^post2 <= 0 /\ a_13^0-2*x_15^post2 <= 0 /\ a_21^0-a_21^post2 == 0 /\ 1-2*x_15^post2 <= 0 /\ 1-a_13^0 <= 0), cost: 1 4: l1 -> l5 : temp0_14^0'=temp0_14^post4, a_21^0'=a_21^post4, result_11^0'=result_11^post4, a_13^0'=a_13^post4, x_15^0'=x_15^post4, nondet_12^0'=nondet_12^post4, (0 == 0 /\ temp0_14^0-temp0_14^post4 == 0 /\ a_13^0-a_13^post4 == 0 /\ x_15^post4-nondet_12^11 == 0 /\ 1-a_13^0 <= 0 /\ result_11^0-result_11^post4 == 0), cost: 1 3: l3 -> l1 : temp0_14^0'=temp0_14^post3, a_21^0'=a_21^post3, result_11^0'=result_11^post3, a_13^0'=a_13^post3, x_15^0'=x_15^post3, nondet_12^0'=nondet_12^post3, (result_11^0-result_11^post3 == 0 /\ temp0_14^0-temp0_14^post3 == 0 /\ -x_15^post3+x_15^0 == 0 /\ -nondet_12^post3+nondet_12^0 == 0 /\ a_13^0-a_13^post3 == 0 /\ -a_21^post3+a_21^0 == 0), cost: 1 5: l5 -> l6 : temp0_14^0'=temp0_14^post5, a_21^0'=a_21^post5, result_11^0'=result_11^post5, a_13^0'=a_13^post5, x_15^0'=x_15^post5, nondet_12^0'=nondet_12^post5, (result_11^0-result_11^post5 == 0 /\ 1+a_13^0-2*x_15^0 <= 0 /\ a_13^0-a_13^post5 == 0 /\ -a_21^post5+a_21^0 == 0 /\ temp0_14^0-temp0_14^post5 == 0 /\ -x_15^post5+x_15^0 == 0 /\ -nondet_12^post5+nondet_12^0 == 0), cost: 1 6: l5 -> l6 : temp0_14^0'=temp0_14^post6, a_21^0'=a_21^post6, result_11^0'=result_11^post6, a_13^0'=a_13^post6, x_15^0'=x_15^post6, nondet_12^0'=nondet_12^post6, (-result_11^post6+result_11^0 == 0 /\ -nondet_12^post6+nondet_12^0 == 0 /\ temp0_14^0-temp0_14^post6 == 0 /\ 1-a_13^0+2*x_15^0 <= 0 /\ a_13^0-a_13^post6 == 0 /\ a_21^0-a_21^post6 == 0 /\ x_15^0-x_15^post6 == 0), cost: 1 7: l6 -> l7 : temp0_14^0'=temp0_14^post7, a_21^0'=a_21^post7, result_11^0'=result_11^post7, a_13^0'=a_13^post7, x_15^0'=x_15^post7, nondet_12^0'=nondet_12^post7, (-nondet_12^post7+nondet_12^0 == 0 /\ a_21^0-a_21^post7 == 0 /\ 1+3*a_21^0-a_13^post7 <= 0 /\ -1+a_13^post7-3*a_13^0 == 0 /\ temp0_14^0-temp0_14^post7 == 0 /\ x_15^0-x_15^post7 == 0 /\ -result_11^post7+result_11^0 == 0 /\ -1-3*a_21^0+a_13^post7 <= 0), cost: 1 8: l7 -> l8 : temp0_14^0'=temp0_14^post8, a_21^0'=a_21^post8, result_11^0'=result_11^post8, a_13^0'=a_13^post8, x_15^0'=x_15^post8, nondet_12^0'=nondet_12^post8, (-a_13^post8+a_13^0 == 0 /\ -nondet_12^post8+nondet_12^0 == 0 /\ a_21^0-a_21^post8 == 0 /\ temp0_14^0-temp0_14^post8 == 0 /\ -result_11^post8+result_11^0 == 0 /\ x_15^0-x_15^post8 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 1 9: l7 -> l8 : temp0_14^0'=temp0_14^post9, a_21^0'=a_21^post9, result_11^0'=result_11^post9, a_13^0'=a_13^post9, x_15^0'=x_15^post9, nondet_12^0'=nondet_12^post9, (-x_15^post9+x_15^0 == 0 /\ -result_11^post9+result_11^0 == 0 /\ a_21^0-a_21^post9 == 0 /\ 1-a_21^0+2*x_15^0 <= 0 /\ nondet_12^0-nondet_12^post9 == 0 /\ -a_13^post9+a_13^0 == 0 /\ temp0_14^0-temp0_14^post9 == 0), cost: 1 10: l8 -> l4 : temp0_14^0'=temp0_14^post10, a_21^0'=a_21^post10, result_11^0'=result_11^post10, a_13^0'=a_13^post10, x_15^0'=x_15^post10, nondet_12^0'=nondet_12^post10, (temp0_14^0-temp0_14^post10 == 0 /\ -x_15^post10+x_15^0 == 0 /\ -a_13^post10+a_13^0 == 0 /\ -nondet_12^post10+nondet_12^0 == 0 /\ result_11^0-result_11^post10 == 0 /\ 1-a_21^0 <= 0 /\ a_21^0-a_21^post10 == 0), cost: 1 11: l4 -> l1 : temp0_14^0'=temp0_14^post11, a_21^0'=a_21^post11, result_11^0'=result_11^post11, a_13^0'=a_13^post11, x_15^0'=x_15^post11, nondet_12^0'=nondet_12^post11, (-a_21^post11+a_21^0 == 0 /\ temp0_14^0-temp0_14^post11 == 0 /\ result_11^0-result_11^post11 == 0 /\ a_13^0-a_13^post11 == 0 /\ -x_15^post11+x_15^0 == 0 /\ -nondet_12^post11+nondet_12^0 == 0), cost: 1 12: l9 -> l0 : temp0_14^0'=temp0_14^post12, a_21^0'=a_21^post12, result_11^0'=result_11^post12, a_13^0'=a_13^post12, x_15^0'=x_15^post12, nondet_12^0'=nondet_12^post12, (a_13^0-a_13^post12 == 0 /\ -a_21^post12+a_21^0 == 0 /\ temp0_14^0-temp0_14^post12 == 0 /\ result_11^0-result_11^post12 == 0 /\ -x_15^post12+x_15^0 == 0 /\ -nondet_12^post12+nondet_12^0 == 0), cost: 1 Applied preprocessing Original rule: l0 -> l1 : temp0_14^0'=temp0_14^post0, a_21^0'=a_21^post0, result_11^0'=result_11^post0, a_13^0'=a_13^post0, x_15^0'=x_15^post0, nondet_12^0'=nondet_12^post0, (a_21^0-a_21^post0 == 0 /\ -result_11^post0+result_11^0 == 0 /\ -a_13^post0+a_13^0 == 0 /\ -nondet_12^post0+nondet_12^0 == 0 /\ x_15^0-x_15^post0 == 0 /\ temp0_14^0-temp0_14^post0 == 0), cost: 1 New rule: l0 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l3 : temp0_14^0'=temp0_14^post2, a_21^0'=a_21^post2, result_11^0'=result_11^post2, a_13^0'=a_13^post2, x_15^0'=x_15^post2, nondet_12^0'=nondet_12^post2, (0 == 0 /\ temp0_14^0-temp0_14^post2 == 0 /\ -result_11^post2+result_11^0 == 0 /\ a_13^post2-x_15^post2 <= 0 /\ a_13^post2-x_15^post2 == 0 /\ -nondet_12^10+x_15^post2 == 0 /\ -a_13^0+2*x_15^post2 <= 0 /\ -a_13^post2+x_15^post2 <= 0 /\ a_13^0-2*x_15^post2 <= 0 /\ a_21^0-a_21^post2 == 0 /\ 1-2*x_15^post2 <= 0 /\ 1-a_13^0 <= 0), cost: 1 New rule: l1 -> l3 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 1 Applied preprocessing Original rule: l3 -> l1 : temp0_14^0'=temp0_14^post3, a_21^0'=a_21^post3, result_11^0'=result_11^post3, a_13^0'=a_13^post3, x_15^0'=x_15^post3, nondet_12^0'=nondet_12^post3, (result_11^0-result_11^post3 == 0 /\ temp0_14^0-temp0_14^post3 == 0 /\ -x_15^post3+x_15^0 == 0 /\ -nondet_12^post3+nondet_12^0 == 0 /\ a_13^0-a_13^post3 == 0 /\ -a_21^post3+a_21^0 == 0), cost: 1 New rule: l3 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l1 -> l5 : temp0_14^0'=temp0_14^post4, a_21^0'=a_21^post4, result_11^0'=result_11^post4, a_13^0'=a_13^post4, x_15^0'=x_15^post4, nondet_12^0'=nondet_12^post4, (0 == 0 /\ temp0_14^0-temp0_14^post4 == 0 /\ a_13^0-a_13^post4 == 0 /\ x_15^post4-nondet_12^11 == 0 /\ 1-a_13^0 <= 0 /\ result_11^0-result_11^post4 == 0), cost: 1 New rule: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 Applied preprocessing Original rule: l5 -> l6 : temp0_14^0'=temp0_14^post5, a_21^0'=a_21^post5, result_11^0'=result_11^post5, a_13^0'=a_13^post5, x_15^0'=x_15^post5, nondet_12^0'=nondet_12^post5, (result_11^0-result_11^post5 == 0 /\ 1+a_13^0-2*x_15^0 <= 0 /\ a_13^0-a_13^post5 == 0 /\ -a_21^post5+a_21^0 == 0 /\ temp0_14^0-temp0_14^post5 == 0 /\ -x_15^post5+x_15^0 == 0 /\ -nondet_12^post5+nondet_12^0 == 0), cost: 1 New rule: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 Applied preprocessing Original rule: l5 -> l6 : temp0_14^0'=temp0_14^post6, a_21^0'=a_21^post6, result_11^0'=result_11^post6, a_13^0'=a_13^post6, x_15^0'=x_15^post6, nondet_12^0'=nondet_12^post6, (-result_11^post6+result_11^0 == 0 /\ -nondet_12^post6+nondet_12^0 == 0 /\ temp0_14^0-temp0_14^post6 == 0 /\ 1-a_13^0+2*x_15^0 <= 0 /\ a_13^0-a_13^post6 == 0 /\ a_21^0-a_21^post6 == 0 /\ x_15^0-x_15^post6 == 0), cost: 1 New rule: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 Applied preprocessing Original rule: l6 -> l7 : temp0_14^0'=temp0_14^post7, a_21^0'=a_21^post7, result_11^0'=result_11^post7, a_13^0'=a_13^post7, x_15^0'=x_15^post7, nondet_12^0'=nondet_12^post7, (-nondet_12^post7+nondet_12^0 == 0 /\ a_21^0-a_21^post7 == 0 /\ 1+3*a_21^0-a_13^post7 <= 0 /\ -1+a_13^post7-3*a_13^0 == 0 /\ temp0_14^0-temp0_14^post7 == 0 /\ x_15^0-x_15^post7 == 0 /\ -result_11^post7+result_11^0 == 0 /\ -1-3*a_21^0+a_13^post7 <= 0), cost: 1 New rule: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 Applied preprocessing Original rule: l7 -> l8 : temp0_14^0'=temp0_14^post8, a_21^0'=a_21^post8, result_11^0'=result_11^post8, a_13^0'=a_13^post8, x_15^0'=x_15^post8, nondet_12^0'=nondet_12^post8, (-a_13^post8+a_13^0 == 0 /\ -nondet_12^post8+nondet_12^0 == 0 /\ a_21^0-a_21^post8 == 0 /\ temp0_14^0-temp0_14^post8 == 0 /\ -result_11^post8+result_11^0 == 0 /\ x_15^0-x_15^post8 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 1 New rule: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 Applied preprocessing Original rule: l7 -> l8 : temp0_14^0'=temp0_14^post9, a_21^0'=a_21^post9, result_11^0'=result_11^post9, a_13^0'=a_13^post9, x_15^0'=x_15^post9, nondet_12^0'=nondet_12^post9, (-x_15^post9+x_15^0 == 0 /\ -result_11^post9+result_11^0 == 0 /\ a_21^0-a_21^post9 == 0 /\ 1-a_21^0+2*x_15^0 <= 0 /\ nondet_12^0-nondet_12^post9 == 0 /\ -a_13^post9+a_13^0 == 0 /\ temp0_14^0-temp0_14^post9 == 0), cost: 1 New rule: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 Applied preprocessing Original rule: l8 -> l4 : temp0_14^0'=temp0_14^post10, a_21^0'=a_21^post10, result_11^0'=result_11^post10, a_13^0'=a_13^post10, x_15^0'=x_15^post10, nondet_12^0'=nondet_12^post10, (temp0_14^0-temp0_14^post10 == 0 /\ -x_15^post10+x_15^0 == 0 /\ -a_13^post10+a_13^0 == 0 /\ -nondet_12^post10+nondet_12^0 == 0 /\ result_11^0-result_11^post10 == 0 /\ 1-a_21^0 <= 0 /\ a_21^0-a_21^post10 == 0), cost: 1 New rule: l8 -> l4 : -1+a_21^0 >= 0, cost: 1 Applied preprocessing Original rule: l4 -> l1 : temp0_14^0'=temp0_14^post11, a_21^0'=a_21^post11, result_11^0'=result_11^post11, a_13^0'=a_13^post11, x_15^0'=x_15^post11, nondet_12^0'=nondet_12^post11, (-a_21^post11+a_21^0 == 0 /\ temp0_14^0-temp0_14^post11 == 0 /\ result_11^0-result_11^post11 == 0 /\ a_13^0-a_13^post11 == 0 /\ -x_15^post11+x_15^0 == 0 /\ -nondet_12^post11+nondet_12^0 == 0), cost: 1 New rule: l4 -> l1 : TRUE, cost: 1 Applied preprocessing Original rule: l9 -> l0 : temp0_14^0'=temp0_14^post12, a_21^0'=a_21^post12, result_11^0'=result_11^post12, a_13^0'=a_13^post12, x_15^0'=x_15^post12, nondet_12^0'=nondet_12^post12, (a_13^0-a_13^post12 == 0 /\ -a_21^post12+a_21^0 == 0 /\ temp0_14^0-temp0_14^post12 == 0 /\ result_11^0-result_11^post12 == 0 /\ -x_15^post12+x_15^0 == 0 /\ -nondet_12^post12+nondet_12^0 == 0), cost: 1 New rule: l9 -> l0 : TRUE, cost: 1 Simplified rules Start location: l9 13: l0 -> l1 : TRUE, cost: 1 14: l1 -> l3 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 1 16: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 15: l3 -> l1 : TRUE, cost: 1 17: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 18: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 19: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 20: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 21: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 22: l8 -> l4 : -1+a_21^0 >= 0, cost: 1 23: l4 -> l1 : TRUE, cost: 1 24: l9 -> l0 : TRUE, cost: 1 Eliminating location l0 by chaining: Applied chaining First rule: l9 -> l0 : TRUE, cost: 1 Second rule: l0 -> l1 : TRUE, cost: 1 New rule: l9 -> l1 : TRUE, cost: 2 Applied deletion Removed the following rules: 13 24 Eliminating location l3 by chaining: Applied chaining First rule: l1 -> l3 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 1 Second rule: l3 -> l1 : TRUE, cost: 1 New rule: l1 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 2 Applied deletion Removed the following rules: 14 15 Eliminating location l4 by chaining: Applied chaining First rule: l8 -> l4 : -1+a_21^0 >= 0, cost: 1 Second rule: l4 -> l1 : TRUE, cost: 1 New rule: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 Applied deletion Removed the following rules: 22 23 Eliminated locations on linear paths Start location: l9 16: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 26: l1 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 2 17: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 18: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 19: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 20: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 21: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 27: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 25: l9 -> l1 : TRUE, cost: 2 Accelerated simple loops Start location: l9 16: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 26: l1 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 2 17: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 18: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 19: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 20: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 21: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 27: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 25: l9 -> l1 : TRUE, cost: 2 Applied chaining First rule: l9 -> l1 : TRUE, cost: 2 Second rule: l1 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 2 New rule: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Applied chaining First rule: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 Second rule: l1 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 2 New rule: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 Applied deletion Removed the following rules: 26 Chained accelerated rules with incoming rules Start location: l9 16: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 17: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 18: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 19: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 20: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 21: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 27: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 29: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Eliminating location l5 by chaining: Applied chaining First rule: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 Second rule: l5 -> l6 : 1+a_13^0-2*x_15^0 <= 0, cost: 1 New rule: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 Applied chaining First rule: l1 -> l5 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, -1+a_13^0 >= 0, cost: 1 Second rule: l5 -> l6 : 1-a_13^0+2*x_15^0 <= 0, cost: 1 New rule: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 Applied deletion Removed the following rules: 16 17 18 Eliminating location l7 by chaining: Applied chaining First rule: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 Second rule: l7 -> l8 : 1+a_21^0-2*x_15^0 <= 0, cost: 1 New rule: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 2 Applied chaining First rule: l6 -> l7 : a_13^0'=1+3*a_21^0, 3*a_21^0-3*a_13^0 == 0, cost: 1 Second rule: l7 -> l8 : 1-a_21^0+2*x_15^0 <= 0, cost: 1 New rule: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1-a_21^0+2*x_15^0 <= 0), cost: 2 Applied deletion Removed the following rules: 19 20 21 Eliminated locations on tree-shaped paths Start location: l9 30: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 31: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 32: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 2 33: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1-a_21^0+2*x_15^0 <= 0), cost: 2 27: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 29: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Eliminating location l6 by chaining: Applied chaining First rule: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 Second rule: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1+a_21^0-2*x_15^0 <= 0), cost: 2 New rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ 1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Applied simplification Original rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ 1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 New rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Applied chaining First rule: l1 -> l6 : a_21^0'=a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 2 Second rule: l6 -> l8 : a_13^0'=1+3*a_21^0, (3*a_21^0-3*a_13^0 == 0 /\ 1-a_21^0+2*x_15^0 <= 0), cost: 2 New rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Applied simplification Original rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 New rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Applied deletion Removed the following rules: 30 31 32 33 Eliminated locations on tree-shaped paths Start location: l9 34: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 35: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 27: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 29: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Eliminating location l8 by chaining: Applied chaining First rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Second rule: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ -1+a_21^post4 >= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ -1+a_21^post4 >= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 Applied chaining First rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Second rule: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_21^post4-2*nondet_12^11 <= 0 /\ -1+a_21^post4 >= 0 /\ -3*a_21^post4 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_21^post4-2*nondet_12^11 <= 0 /\ -1+a_21^post4 >= 0 /\ -3*a_21^post4 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 Applied chaining First rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Second rule: l8 -> l1 : -1+a_21^0 >= 0, cost: 2 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (-1+a_21^post4 >= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (-1+a_21^post4 >= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 Applied chaining First rule: l1 -> l8 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 4 Second rule: l8 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ -1+a_21^0 >= 0 /\ 1-a_13^0 <= 0), cost: 4 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+a_21^post4 >= 0 /\ -3*a_21^post4 <= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+a_21^post4 >= 0 /\ -3*a_21^post4 <= 0 /\ 1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 New rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 Applied deletion Removed the following rules: 27 29 34 35 Eliminated locations on tree-shaped paths Start location: l9 36: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 37: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 38: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 39: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_21^post4-2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 New rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 8 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=1+3*a_21^post4, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 Applied simplification Original rule: l1 -> l1 : a_21^0'=a_21^post4, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1-a_21^post4+2*nondet_12^11 <= 0 /\ 3*a_21^post4-3*a_13^0 == 0 /\ -1+a_13^0 >= 0 /\ -1-3*a_21^post4+2*nondet_12^10 == 0), cost: 8 New rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 Simplified simple loops Start location: l9 40: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 41: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 8 42: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 43: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Applied nonterm Original rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l1 -> [11] : (-1+n2 >= 0 /\ -1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM Sub-proof via acceration calculus written to file:///tmp/tmpnam_LDBmDE.txt Applied deletion Removed the following rules: 42 Accelerated simple loops Start location: l9 40: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 41: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 8 43: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 44: l1 -> [11] : (-1+n2 >= 0 /\ -1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Applied chaining First rule: l9 -> l1 : TRUE, cost: 2 Second rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 Applied chaining First rule: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Second rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 6 New rule: l9 -> l1 : a_21^0'=nondet_12^10, a_13^0'=1+3*nondet_12^10, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+nondet_12^10-2*nondet_12^11 <= 0 /\ 2*nondet_12^10-a_13^0 == 0 /\ -1+nondet_12^10 >= 0), cost: 10 Applied chaining First rule: l9 -> l1 : TRUE, cost: 2 Second rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 8 New rule: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 10 Applied chaining First rule: l9 -> l1 : TRUE, cost: 2 Second rule: l1 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 New rule: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 10 Applied chaining First rule: l9 -> l1 : TRUE, cost: 2 Second rule: l1 -> [11] : (-1+n2 >= 0 /\ -1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM New rule: l9 -> [11] : (-1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM Applied chaining First rule: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 Second rule: l1 -> [11] : (-1+n2 >= 0 /\ -1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM New rule: l9 -> [11] : (2*nondet_12^10-a_13^0 == 0 /\ -1+nondet_12^10-2*nondet_12^11 >= 0 /\ -1+nondet_12^10 >= 0), cost: NONTERM Applied deletion Removed the following rules: 40 41 43 44 Chained accelerated rules with incoming rules Start location: l9 25: l9 -> l1 : TRUE, cost: 2 28: l9 -> l1 : a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (2*nondet_12^10-a_13^0 == 0 /\ 1-a_13^0 <= 0), cost: 4 45: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=1+3*a_13^0, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 8 46: l9 -> l1 : a_21^0'=nondet_12^10, a_13^0'=1+3*nondet_12^10, x_15^0'=nondet_12^11, nondet_12^0'=nondet_12^post4, (1+nondet_12^10-2*nondet_12^11 <= 0 /\ 2*nondet_12^10-a_13^0 == 0 /\ -1+nondet_12^10 >= 0), cost: 10 47: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (1+a_13^0-2*nondet_12^11 <= 0 /\ -1+2*nondet_12^10-3*a_13^0 == 0 /\ -1+a_13^0 >= 0), cost: 10 48: l9 -> l1 : a_21^0'=a_13^0, a_13^0'=nondet_12^10, x_15^0'=nondet_12^10, nondet_12^0'=nondet_12^post2, (-1+2*nondet_12^10-3*a_13^0 == 0 /\ 1-a_13^0+2*nondet_12^11 <= 0 /\ -1+a_13^0 >= 0), cost: 10 49: l9 -> [11] : (-1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM 50: l9 -> [11] : (2*nondet_12^10-a_13^0 == 0 /\ -1+nondet_12^10-2*nondet_12^11 >= 0 /\ -1+nondet_12^10 >= 0), cost: NONTERM Removed unreachable locations and irrelevant leafs Start location: l9 49: l9 -> [11] : (-1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0), cost: NONTERM 50: l9 -> [11] : (2*nondet_12^10-a_13^0 == 0 /\ -1+nondet_12^10-2*nondet_12^11 >= 0 /\ -1+nondet_12^10 >= 0), cost: NONTERM Computing asymptotic complexity Proved nontermination of rule 49 via SMT. Proved the following lower bound Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: (-1+a_13^0-2*nondet_12^11 >= 0 /\ -1+a_13^0 >= 0)