WORST_CASE(Omega(0),?)

Initial ITS
Start location: l13
   0: l0 -> l1 : x0^0'=x0^post0, oldX1^0'=oldX1^post0, oldX3^0'=oldX3^post0, oldX0^0'=oldX0^post0, x1^0'=x1^post0, oldX2^0'=oldX2^post0, (0 == 0 /\ -x0^0+oldX0^post0 == 0 /\ -oldX2^post0+x0^post0 == 0 /\ oldX1^post0-x1^0 == 0 /\ -oldX3^post0+x1^post0 == 0), cost: 1
   1: l2 -> l3 : x0^0'=x0^post1, oldX1^0'=oldX1^post1, oldX3^0'=oldX3^post1, oldX0^0'=oldX0^post1, x1^0'=x1^post1, oldX2^0'=oldX2^post1, (1-oldX1^post1+x1^post1 == 0 /\ -oldX2^post1+oldX2^0 == 0 /\ x0^post1-oldX0^post1 == 0 /\ oldX3^0-oldX3^post1 == 0 /\ -x0^0+oldX0^post1 == 0 /\ oldX1^post1-x1^0 == 0), cost: 1
   2: l3 -> l0 : x0^0'=x0^post2, oldX1^0'=oldX1^post2, oldX3^0'=oldX3^post2, oldX0^0'=oldX0^post2, x1^0'=x1^post2, oldX2^0'=oldX2^post2, (-x0^0+oldX0^post2 == 0 /\ -oldX2^post2+oldX2^0 == 0 /\ oldX1^post2-x1^0 == 0 /\ 1+oldX1^post2 <= 0 /\ oldX3^0-oldX3^post2 == 0 /\ -oldX1^post2+x1^post2 == 0 /\ x0^post2-oldX0^post2 == 0), cost: 1
   3: l3 -> l2 : x0^0'=x0^post3, oldX1^0'=oldX1^post3, oldX3^0'=oldX3^post3, oldX0^0'=oldX0^post3, x1^0'=x1^post3, oldX2^0'=oldX2^post3, (oldX1^post3-x1^0 == 0 /\ -oldX2^post3+oldX2^0 == 0 /\ oldX3^0-oldX3^post3 == 0 /\ -x0^0+oldX0^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -oldX1^post3+x1^post3 == 0 /\ -oldX1^post3 <= 0), cost: 1
   4: l4 -> l5 : x0^0'=x0^post4, oldX1^0'=oldX1^post4, oldX3^0'=oldX3^post4, oldX0^0'=oldX0^post4, x1^0'=x1^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ oldX3^0-oldX3^post4 == 0 /\ x1^post4-oldX2^post4 == 0 /\ -x0^0+oldX0^post4 == 0 /\ 1+x0^post4-oldX0^post4 == 0 /\ oldX1^post4-x1^0 == 0), cost: 1
   5: l5 -> l3 : x0^0'=x0^post5, oldX1^0'=oldX1^post5, oldX3^0'=oldX3^post5, oldX0^0'=oldX0^post5, x1^0'=x1^post5, oldX2^0'=oldX2^post5, (1+oldX0^post5 <= 0 /\ -oldX2^post5+oldX2^0 == 0 /\ -oldX3^post5+oldX3^0 == 0 /\ x0^post5-oldX0^post5 == 0 /\ -x1^0+oldX1^post5 == 0 /\ -7+x1^post5 == 0 /\ -x0^0+oldX0^post5 == 0), cost: 1
   6: l5 -> l4 : x0^0'=x0^post6, oldX1^0'=oldX1^post6, oldX3^0'=oldX3^post6, oldX0^0'=oldX0^post6, x1^0'=x1^post6, oldX2^0'=oldX2^post6, (0 == 0 /\ x0^post6-oldX0^post6 == 0 /\ -oldX0^post6 <= 0 /\ -x0^0+oldX0^post6 == 0 /\ oldX1^post6-x1^0 == 0 /\ -oldX3^post6+oldX3^0 == 0 /\ -oldX2^post6+x1^post6 == 0), cost: 1
   7: l6 -> l5 : x0^0'=x0^post7, oldX1^0'=oldX1^post7, oldX3^0'=oldX3^post7, oldX0^0'=oldX0^post7, x1^0'=x1^post7, oldX2^0'=oldX2^post7, (0 == 0 /\ -7+x0^post7 == 0 /\ x1^post7-oldX2^post7 == 0 /\ oldX1^post7-x1^0 == 0 /\ -x0^0+oldX0^post7 == 0 /\ oldX3^0-oldX3^post7 == 0), cost: 1
   8: l7 -> l8 : x0^0'=x0^post8, oldX1^0'=oldX1^post8, oldX3^0'=oldX3^post8, oldX0^0'=oldX0^post8, x1^0'=x1^post8, oldX2^0'=oldX2^post8, (0 == 0 /\ oldX1^post8-x1^0 == 0 /\ x0^post8-oldX2^post8 == 0 /\ x1^post8-oldX3^post8 == 0 /\ -x0^0+oldX0^post8 == 0), cost: 1
   9: l9 -> l10 : x0^0'=x0^post9, oldX1^0'=oldX1^post9, oldX3^0'=oldX3^post9, oldX0^0'=oldX0^post9, x1^0'=x1^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -1+x0^post9-oldX0^post9 == 0 /\ x1^post9-oldX2^post9 == 0 /\ oldX1^post9-x1^0 == 0 /\ oldX3^0-oldX3^post9 == 0 /\ -x0^0+oldX0^post9 == 0), cost: 1
  10: l10 -> l7 : x0^0'=x0^post10, oldX1^0'=oldX1^post10, oldX3^0'=oldX3^post10, oldX0^0'=oldX0^post10, x1^0'=x1^post10, oldX2^0'=oldX2^post10, (-oldX1^post10+x1^post10 == 0 /\ x0^post10-oldX0^post10 == 0 /\ -x0^0+oldX0^post10 == 0 /\ oldX3^0-oldX3^post10 == 0 /\ -oldX2^post10+oldX2^0 == 0 /\ oldX1^post10-x1^0 == 0 /\ 64-oldX0^post10 <= 0), cost: 1
  11: l10 -> l9 : x0^0'=x0^post11, oldX1^0'=oldX1^post11, oldX3^0'=oldX3^post11, oldX0^0'=oldX0^post11, x1^0'=x1^post11, oldX2^0'=oldX2^post11, (-63+oldX0^post11 <= 0 /\ -oldX2^post11+oldX2^0 == 0 /\ -x0^0+oldX0^post11 == 0 /\ x0^post11-oldX0^post11 == 0 /\ -x1^0+oldX1^post11 == 0 /\ -oldX1^post11+x1^post11 == 0 /\ oldX3^0-oldX3^post11 == 0), cost: 1
  12: l11 -> l10 : x0^0'=x0^post12, oldX1^0'=oldX1^post12, oldX3^0'=oldX3^post12, oldX0^0'=oldX0^post12, x1^0'=x1^post12, oldX2^0'=oldX2^post12, (x0^post12 == 0 /\ -oldX2^post12+oldX2^0 == 0 /\ -x1^0+oldX1^post12 == 0 /\ x1^post12 == 0 /\ -oldX3^post12+oldX3^0 == 0 /\ -x0^0+oldX0^post12 == 0), cost: 1
  13: l12 -> l11 : x0^0'=x0^post13, oldX1^0'=oldX1^post13, oldX3^0'=oldX3^post13, oldX0^0'=oldX0^post13, x1^0'=x1^post13, oldX2^0'=oldX2^post13, (0 == 0 /\ -x0^0+oldX0^post13 == 0 /\ -oldX2^post13+x0^post13 == 0 /\ oldX1^post13-x1^0 == 0 /\ -oldX3^post13+x1^post13 == 0), cost: 1
  14: l12 -> l6 : x0^0'=x0^post14, oldX1^0'=oldX1^post14, oldX3^0'=oldX3^post14, oldX0^0'=oldX0^post14, x1^0'=x1^post14, oldX2^0'=oldX2^post14, (0 == 0 /\ -x0^0+oldX0^post14 == 0 /\ x0^post14-oldX2^post14 == 0 /\ oldX1^post14-x1^0 == 0 /\ -oldX3^post14+x1^post14 == 0), cost: 1
  15: l12 -> l1 : x0^0'=x0^post15, oldX1^0'=oldX1^post15, oldX3^0'=oldX3^post15, oldX0^0'=oldX0^post15, x1^0'=x1^post15, oldX2^0'=oldX2^post15, (oldX2^0-oldX2^post15 == 0 /\ -oldX0^post15+oldX0^0 == 0 /\ -x1^post15+x1^0 == 0 /\ oldX1^0-oldX1^post15 == 0 /\ x0^0-x0^post15 == 0 /\ oldX3^0-oldX3^post15 == 0), cost: 1
  16: l12 -> l0 : x0^0'=x0^post16, oldX1^0'=oldX1^post16, oldX3^0'=oldX3^post16, oldX0^0'=oldX0^post16, x1^0'=x1^post16, oldX2^0'=oldX2^post16, (x0^0-x0^post16 == 0 /\ oldX3^0-oldX3^post16 == 0 /\ -oldX1^post16+oldX1^0 == 0 /\ -oldX0^post16+oldX0^0 == 0 /\ -oldX2^post16+oldX2^0 == 0 /\ -x1^post16+x1^0 == 0), cost: 1
  17: l12 -> l2 : x0^0'=x0^post17, oldX1^0'=oldX1^post17, oldX3^0'=oldX3^post17, oldX0^0'=oldX0^post17, x1^0'=x1^post17, oldX2^0'=oldX2^post17, (-oldX2^post17+oldX2^0 == 0 /\ -x1^post17+x1^0 == 0 /\ x0^0-x0^post17 == 0 /\ -oldX3^post17+oldX3^0 == 0 /\ oldX0^0-oldX0^post17 == 0 /\ oldX1^0-oldX1^post17 == 0), cost: 1
  18: l12 -> l3 : x0^0'=x0^post18, oldX1^0'=oldX1^post18, oldX3^0'=oldX3^post18, oldX0^0'=oldX0^post18, x1^0'=x1^post18, oldX2^0'=oldX2^post18, (x0^0-x0^post18 == 0 /\ oldX1^0-oldX1^post18 == 0 /\ x1^0-x1^post18 == 0 /\ -oldX3^post18+oldX3^0 == 0 /\ -oldX0^post18+oldX0^0 == 0 /\ -oldX2^post18+oldX2^0 == 0), cost: 1
  19: l12 -> l4 : x0^0'=x0^post19, oldX1^0'=oldX1^post19, oldX3^0'=oldX3^post19, oldX0^0'=oldX0^post19, x1^0'=x1^post19, oldX2^0'=oldX2^post19, (x0^0-x0^post19 == 0 /\ -oldX0^post19+oldX0^0 == 0 /\ -oldX3^post19+oldX3^0 == 0 /\ oldX1^0-oldX1^post19 == 0 /\ x1^0-x1^post19 == 0 /\ -oldX2^post19+oldX2^0 == 0), cost: 1
  20: l12 -> l5 : x0^0'=x0^post20, oldX1^0'=oldX1^post20, oldX3^0'=oldX3^post20, oldX0^0'=oldX0^post20, x1^0'=x1^post20, oldX2^0'=oldX2^post20, (oldX1^0-oldX1^post20 == 0 /\ -oldX3^post20+oldX3^0 == 0 /\ x0^0-x0^post20 == 0 /\ x1^0-x1^post20 == 0 /\ oldX2^0-oldX2^post20 == 0 /\ -oldX0^post20+oldX0^0 == 0), cost: 1
  21: l12 -> l6 : x0^0'=x0^post21, oldX1^0'=oldX1^post21, oldX3^0'=oldX3^post21, oldX0^0'=oldX0^post21, x1^0'=x1^post21, oldX2^0'=oldX2^post21, (oldX2^0-oldX2^post21 == 0 /\ -oldX0^post21+oldX0^0 == 0 /\ -x1^post21+x1^0 == 0 /\ oldX1^0-oldX1^post21 == 0 /\ x0^0-x0^post21 == 0 /\ oldX3^0-oldX3^post21 == 0), cost: 1
  22: l12 -> l8 : x0^0'=x0^post22, oldX1^0'=oldX1^post22, oldX3^0'=oldX3^post22, oldX0^0'=oldX0^post22, x1^0'=x1^post22, oldX2^0'=oldX2^post22, (-oldX2^post22+oldX2^0 == 0 /\ oldX1^0-oldX1^post22 == 0 /\ oldX0^0-oldX0^post22 == 0 /\ x0^0-x0^post22 == 0 /\ oldX3^0-oldX3^post22 == 0 /\ -x1^post22+x1^0 == 0), cost: 1
  23: l12 -> l7 : x0^0'=x0^post23, oldX1^0'=oldX1^post23, oldX3^0'=oldX3^post23, oldX0^0'=oldX0^post23, x1^0'=x1^post23, oldX2^0'=oldX2^post23, (-x1^post23+x1^0 == 0 /\ oldX0^0-oldX0^post23 == 0 /\ oldX3^0-oldX3^post23 == 0 /\ -oldX2^post23+oldX2^0 == 0 /\ -oldX1^post23+oldX1^0 == 0 /\ x0^0-x0^post23 == 0), cost: 1
  24: l12 -> l9 : x0^0'=x0^post24, oldX1^0'=oldX1^post24, oldX3^0'=oldX3^post24, oldX0^0'=oldX0^post24, x1^0'=x1^post24, oldX2^0'=oldX2^post24, (-oldX3^post24+oldX3^0 == 0 /\ -oldX2^post24+oldX2^0 == 0 /\ -oldX1^post24+oldX1^0 == 0 /\ x0^0-x0^post24 == 0 /\ oldX0^0-oldX0^post24 == 0 /\ x1^0-x1^post24 == 0), cost: 1
  25: l12 -> l10 : x0^0'=x0^post25, oldX1^0'=oldX1^post25, oldX3^0'=oldX3^post25, oldX0^0'=oldX0^post25, x1^0'=x1^post25, oldX2^0'=oldX2^post25, (-oldX3^post25+oldX3^0 == 0 /\ -oldX2^post25+oldX2^0 == 0 /\ x0^0-x0^post25 == 0 /\ oldX1^0-oldX1^post25 == 0 /\ x1^0-x1^post25 == 0 /\ oldX0^0-oldX0^post25 == 0), cost: 1
  26: l12 -> l11 : x0^0'=x0^post26, oldX1^0'=oldX1^post26, oldX3^0'=oldX3^post26, oldX0^0'=oldX0^post26, x1^0'=x1^post26, oldX2^0'=oldX2^post26, (-oldX2^post26+oldX2^0 == 0 /\ -oldX0^post26+oldX0^0 == 0 /\ oldX1^0-oldX1^post26 == 0 /\ x0^0-x0^post26 == 0 /\ x1^0-x1^post26 == 0 /\ -oldX3^post26+oldX3^0 == 0), cost: 1
  27: l13 -> l12 : x0^0'=x0^post27, oldX1^0'=oldX1^post27, oldX3^0'=oldX3^post27, oldX0^0'=oldX0^post27, x1^0'=x1^post27, oldX2^0'=oldX2^post27, (oldX2^0-oldX2^post27 == 0 /\ -oldX3^post27+oldX3^0 == 0 /\ -x1^post27+x1^0 == 0 /\ -oldX0^post27+oldX0^0 == 0 /\ oldX1^0-oldX1^post27 == 0 /\ x0^0-x0^post27 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l13
   1: l2 -> l3 : x0^0'=x0^post1, oldX1^0'=oldX1^post1, oldX3^0'=oldX3^post1, oldX0^0'=oldX0^post1, x1^0'=x1^post1, oldX2^0'=oldX2^post1, (1-oldX1^post1+x1^post1 == 0 /\ -oldX2^post1+oldX2^0 == 0 /\ x0^post1-oldX0^post1 == 0 /\ oldX3^0-oldX3^post1 == 0 /\ -x0^0+oldX0^post1 == 0 /\ oldX1^post1-x1^0 == 0), cost: 1
   3: l3 -> l2 : x0^0'=x0^post3, oldX1^0'=oldX1^post3, oldX3^0'=oldX3^post3, oldX0^0'=oldX0^post3, x1^0'=x1^post3, oldX2^0'=oldX2^post3, (oldX1^post3-x1^0 == 0 /\ -oldX2^post3+oldX2^0 == 0 /\ oldX3^0-oldX3^post3 == 0 /\ -x0^0+oldX0^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -oldX1^post3+x1^post3 == 0 /\ -oldX1^post3 <= 0), cost: 1
   4: l4 -> l5 : x0^0'=x0^post4, oldX1^0'=oldX1^post4, oldX3^0'=oldX3^post4, oldX0^0'=oldX0^post4, x1^0'=x1^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ oldX3^0-oldX3^post4 == 0 /\ x1^post4-oldX2^post4 == 0 /\ -x0^0+oldX0^post4 == 0 /\ 1+x0^post4-oldX0^post4 == 0 /\ oldX1^post4-x1^0 == 0), cost: 1
   5: l5 -> l3 : x0^0'=x0^post5, oldX1^0'=oldX1^post5, oldX3^0'=oldX3^post5, oldX0^0'=oldX0^post5, x1^0'=x1^post5, oldX2^0'=oldX2^post5, (1+oldX0^post5 <= 0 /\ -oldX2^post5+oldX2^0 == 0 /\ -oldX3^post5+oldX3^0 == 0 /\ x0^post5-oldX0^post5 == 0 /\ -x1^0+oldX1^post5 == 0 /\ -7+x1^post5 == 0 /\ -x0^0+oldX0^post5 == 0), cost: 1
   6: l5 -> l4 : x0^0'=x0^post6, oldX1^0'=oldX1^post6, oldX3^0'=oldX3^post6, oldX0^0'=oldX0^post6, x1^0'=x1^post6, oldX2^0'=oldX2^post6, (0 == 0 /\ x0^post6-oldX0^post6 == 0 /\ -oldX0^post6 <= 0 /\ -x0^0+oldX0^post6 == 0 /\ oldX1^post6-x1^0 == 0 /\ -oldX3^post6+oldX3^0 == 0 /\ -oldX2^post6+x1^post6 == 0), cost: 1
   7: l6 -> l5 : x0^0'=x0^post7, oldX1^0'=oldX1^post7, oldX3^0'=oldX3^post7, oldX0^0'=oldX0^post7, x1^0'=x1^post7, oldX2^0'=oldX2^post7, (0 == 0 /\ -7+x0^post7 == 0 /\ x1^post7-oldX2^post7 == 0 /\ oldX1^post7-x1^0 == 0 /\ -x0^0+oldX0^post7 == 0 /\ oldX3^0-oldX3^post7 == 0), cost: 1
   9: l9 -> l10 : x0^0'=x0^post9, oldX1^0'=oldX1^post9, oldX3^0'=oldX3^post9, oldX0^0'=oldX0^post9, x1^0'=x1^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -1+x0^post9-oldX0^post9 == 0 /\ x1^post9-oldX2^post9 == 0 /\ oldX1^post9-x1^0 == 0 /\ oldX3^0-oldX3^post9 == 0 /\ -x0^0+oldX0^post9 == 0), cost: 1
  11: l10 -> l9 : x0^0'=x0^post11, oldX1^0'=oldX1^post11, oldX3^0'=oldX3^post11, oldX0^0'=oldX0^post11, x1^0'=x1^post11, oldX2^0'=oldX2^post11, (-63+oldX0^post11 <= 0 /\ -oldX2^post11+oldX2^0 == 0 /\ -x0^0+oldX0^post11 == 0 /\ x0^post11-oldX0^post11 == 0 /\ -x1^0+oldX1^post11 == 0 /\ -oldX1^post11+x1^post11 == 0 /\ oldX3^0-oldX3^post11 == 0), cost: 1
  12: l11 -> l10 : x0^0'=x0^post12, oldX1^0'=oldX1^post12, oldX3^0'=oldX3^post12, oldX0^0'=oldX0^post12, x1^0'=x1^post12, oldX2^0'=oldX2^post12, (x0^post12 == 0 /\ -oldX2^post12+oldX2^0 == 0 /\ -x1^0+oldX1^post12 == 0 /\ x1^post12 == 0 /\ -oldX3^post12+oldX3^0 == 0 /\ -x0^0+oldX0^post12 == 0), cost: 1
  13: l12 -> l11 : x0^0'=x0^post13, oldX1^0'=oldX1^post13, oldX3^0'=oldX3^post13, oldX0^0'=oldX0^post13, x1^0'=x1^post13, oldX2^0'=oldX2^post13, (0 == 0 /\ -x0^0+oldX0^post13 == 0 /\ -oldX2^post13+x0^post13 == 0 /\ oldX1^post13-x1^0 == 0 /\ -oldX3^post13+x1^post13 == 0), cost: 1
  14: l12 -> l6 : x0^0'=x0^post14, oldX1^0'=oldX1^post14, oldX3^0'=oldX3^post14, oldX0^0'=oldX0^post14, x1^0'=x1^post14, oldX2^0'=oldX2^post14, (0 == 0 /\ -x0^0+oldX0^post14 == 0 /\ x0^post14-oldX2^post14 == 0 /\ oldX1^post14-x1^0 == 0 /\ -oldX3^post14+x1^post14 == 0), cost: 1
  17: l12 -> l2 : x0^0'=x0^post17, oldX1^0'=oldX1^post17, oldX3^0'=oldX3^post17, oldX0^0'=oldX0^post17, x1^0'=x1^post17, oldX2^0'=oldX2^post17, (-oldX2^post17+oldX2^0 == 0 /\ -x1^post17+x1^0 == 0 /\ x0^0-x0^post17 == 0 /\ -oldX3^post17+oldX3^0 == 0 /\ oldX0^0-oldX0^post17 == 0 /\ oldX1^0-oldX1^post17 == 0), cost: 1
  18: l12 -> l3 : x0^0'=x0^post18, oldX1^0'=oldX1^post18, oldX3^0'=oldX3^post18, oldX0^0'=oldX0^post18, x1^0'=x1^post18, oldX2^0'=oldX2^post18, (x0^0-x0^post18 == 0 /\ oldX1^0-oldX1^post18 == 0 /\ x1^0-x1^post18 == 0 /\ -oldX3^post18+oldX3^0 == 0 /\ -oldX0^post18+oldX0^0 == 0 /\ -oldX2^post18+oldX2^0 == 0), cost: 1
  19: l12 -> l4 : x0^0'=x0^post19, oldX1^0'=oldX1^post19, oldX3^0'=oldX3^post19, oldX0^0'=oldX0^post19, x1^0'=x1^post19, oldX2^0'=oldX2^post19, (x0^0-x0^post19 == 0 /\ -oldX0^post19+oldX0^0 == 0 /\ -oldX3^post19+oldX3^0 == 0 /\ oldX1^0-oldX1^post19 == 0 /\ x1^0-x1^post19 == 0 /\ -oldX2^post19+oldX2^0 == 0), cost: 1
  20: l12 -> l5 : x0^0'=x0^post20, oldX1^0'=oldX1^post20, oldX3^0'=oldX3^post20, oldX0^0'=oldX0^post20, x1^0'=x1^post20, oldX2^0'=oldX2^post20, (oldX1^0-oldX1^post20 == 0 /\ -oldX3^post20+oldX3^0 == 0 /\ x0^0-x0^post20 == 0 /\ x1^0-x1^post20 == 0 /\ oldX2^0-oldX2^post20 == 0 /\ -oldX0^post20+oldX0^0 == 0), cost: 1
  21: l12 -> l6 : x0^0'=x0^post21, oldX1^0'=oldX1^post21, oldX3^0'=oldX3^post21, oldX0^0'=oldX0^post21, x1^0'=x1^post21, oldX2^0'=oldX2^post21, (oldX2^0-oldX2^post21 == 0 /\ -oldX0^post21+oldX0^0 == 0 /\ -x1^post21+x1^0 == 0 /\ oldX1^0-oldX1^post21 == 0 /\ x0^0-x0^post21 == 0 /\ oldX3^0-oldX3^post21 == 0), cost: 1
  24: l12 -> l9 : x0^0'=x0^post24, oldX1^0'=oldX1^post24, oldX3^0'=oldX3^post24, oldX0^0'=oldX0^post24, x1^0'=x1^post24, oldX2^0'=oldX2^post24, (-oldX3^post24+oldX3^0 == 0 /\ -oldX2^post24+oldX2^0 == 0 /\ -oldX1^post24+oldX1^0 == 0 /\ x0^0-x0^post24 == 0 /\ oldX0^0-oldX0^post24 == 0 /\ x1^0-x1^post24 == 0), cost: 1
  25: l12 -> l10 : x0^0'=x0^post25, oldX1^0'=oldX1^post25, oldX3^0'=oldX3^post25, oldX0^0'=oldX0^post25, x1^0'=x1^post25, oldX2^0'=oldX2^post25, (-oldX3^post25+oldX3^0 == 0 /\ -oldX2^post25+oldX2^0 == 0 /\ x0^0-x0^post25 == 0 /\ oldX1^0-oldX1^post25 == 0 /\ x1^0-x1^post25 == 0 /\ oldX0^0-oldX0^post25 == 0), cost: 1
  26: l12 -> l11 : x0^0'=x0^post26, oldX1^0'=oldX1^post26, oldX3^0'=oldX3^post26, oldX0^0'=oldX0^post26, x1^0'=x1^post26, oldX2^0'=oldX2^post26, (-oldX2^post26+oldX2^0 == 0 /\ -oldX0^post26+oldX0^0 == 0 /\ oldX1^0-oldX1^post26 == 0 /\ x0^0-x0^post26 == 0 /\ x1^0-x1^post26 == 0 /\ -oldX3^post26+oldX3^0 == 0), cost: 1
  27: l13 -> l12 : x0^0'=x0^post27, oldX1^0'=oldX1^post27, oldX3^0'=oldX3^post27, oldX0^0'=oldX0^post27, x1^0'=x1^post27, oldX2^0'=oldX2^post27, (oldX2^0-oldX2^post27 == 0 /\ -oldX3^post27+oldX3^0 == 0 /\ -x1^post27+x1^0 == 0 /\ -oldX0^post27+oldX0^0 == 0 /\ oldX1^0-oldX1^post27 == 0 /\ x0^0-x0^post27 == 0), cost: 1


Applied preprocessing
Original rule:
l2 -> l3 : x0^0'=x0^post1, oldX1^0'=oldX1^post1, oldX3^0'=oldX3^post1, oldX0^0'=oldX0^post1, x1^0'=x1^post1, oldX2^0'=oldX2^post1, (1-oldX1^post1+x1^post1 == 0 /\ -oldX2^post1+oldX2^0 == 0 /\ x0^post1-oldX0^post1 == 0 /\ oldX3^0-oldX3^post1 == 0 /\ -x0^0+oldX0^post1 == 0 /\ oldX1^post1-x1^0 == 0), cost: 1
New rule:
l2 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : x0^0'=x0^post3, oldX1^0'=oldX1^post3, oldX3^0'=oldX3^post3, oldX0^0'=oldX0^post3, x1^0'=x1^post3, oldX2^0'=oldX2^post3, (oldX1^post3-x1^0 == 0 /\ -oldX2^post3+oldX2^0 == 0 /\ oldX3^0-oldX3^post3 == 0 /\ -x0^0+oldX0^post3 == 0 /\ -oldX0^post3+x0^post3 == 0 /\ -oldX1^post3+x1^post3 == 0 /\ -oldX1^post3 <= 0), cost: 1
New rule:
l3 -> l2 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : x0^0'=x0^post4, oldX1^0'=oldX1^post4, oldX3^0'=oldX3^post4, oldX0^0'=oldX0^post4, x1^0'=x1^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ oldX3^0-oldX3^post4 == 0 /\ x1^post4-oldX2^post4 == 0 /\ -x0^0+oldX0^post4 == 0 /\ 1+x0^post4-oldX0^post4 == 0 /\ oldX1^post4-x1^0 == 0), cost: 1
New rule:
l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l3 : x0^0'=x0^post5, oldX1^0'=oldX1^post5, oldX3^0'=oldX3^post5, oldX0^0'=oldX0^post5, x1^0'=x1^post5, oldX2^0'=oldX2^post5, (1+oldX0^post5 <= 0 /\ -oldX2^post5+oldX2^0 == 0 /\ -oldX3^post5+oldX3^0 == 0 /\ x0^post5-oldX0^post5 == 0 /\ -x1^0+oldX1^post5 == 0 /\ -7+x1^post5 == 0 /\ -x0^0+oldX0^post5 == 0), cost: 1
New rule:
l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l4 : x0^0'=x0^post6, oldX1^0'=oldX1^post6, oldX3^0'=oldX3^post6, oldX0^0'=oldX0^post6, x1^0'=x1^post6, oldX2^0'=oldX2^post6, (0 == 0 /\ x0^post6-oldX0^post6 == 0 /\ -oldX0^post6 <= 0 /\ -x0^0+oldX0^post6 == 0 /\ oldX1^post6-x1^0 == 0 /\ -oldX3^post6+oldX3^0 == 0 /\ -oldX2^post6+x1^post6 == 0), cost: 1
New rule:
l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : x0^0'=x0^post7, oldX1^0'=oldX1^post7, oldX3^0'=oldX3^post7, oldX0^0'=oldX0^post7, x1^0'=x1^post7, oldX2^0'=oldX2^post7, (0 == 0 /\ -7+x0^post7 == 0 /\ x1^post7-oldX2^post7 == 0 /\ oldX1^post7-x1^0 == 0 /\ -x0^0+oldX0^post7 == 0 /\ oldX3^0-oldX3^post7 == 0), cost: 1
New rule:
l6 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l10 : x0^0'=x0^post9, oldX1^0'=oldX1^post9, oldX3^0'=oldX3^post9, oldX0^0'=oldX0^post9, x1^0'=x1^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -1+x0^post9-oldX0^post9 == 0 /\ x1^post9-oldX2^post9 == 0 /\ oldX1^post9-x1^0 == 0 /\ oldX3^0-oldX3^post9 == 0 /\ -x0^0+oldX0^post9 == 0), cost: 1
New rule:
l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l10 -> l9 : x0^0'=x0^post11, oldX1^0'=oldX1^post11, oldX3^0'=oldX3^post11, oldX0^0'=oldX0^post11, x1^0'=x1^post11, oldX2^0'=oldX2^post11, (-63+oldX0^post11 <= 0 /\ -oldX2^post11+oldX2^0 == 0 /\ -x0^0+oldX0^post11 == 0 /\ x0^post11-oldX0^post11 == 0 /\ -x1^0+oldX1^post11 == 0 /\ -oldX1^post11+x1^post11 == 0 /\ oldX3^0-oldX3^post11 == 0), cost: 1
New rule:
l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l10 : x0^0'=x0^post12, oldX1^0'=oldX1^post12, oldX3^0'=oldX3^post12, oldX0^0'=oldX0^post12, x1^0'=x1^post12, oldX2^0'=oldX2^post12, (x0^post12 == 0 /\ -oldX2^post12+oldX2^0 == 0 /\ -x1^0+oldX1^post12 == 0 /\ x1^post12 == 0 /\ -oldX3^post12+oldX3^0 == 0 /\ -x0^0+oldX0^post12 == 0), cost: 1
New rule:
l11 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l11 : x0^0'=x0^post13, oldX1^0'=oldX1^post13, oldX3^0'=oldX3^post13, oldX0^0'=oldX0^post13, x1^0'=x1^post13, oldX2^0'=oldX2^post13, (0 == 0 /\ -x0^0+oldX0^post13 == 0 /\ -oldX2^post13+x0^post13 == 0 /\ oldX1^post13-x1^0 == 0 /\ -oldX3^post13+x1^post13 == 0), cost: 1
New rule:
l12 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l6 : x0^0'=x0^post14, oldX1^0'=oldX1^post14, oldX3^0'=oldX3^post14, oldX0^0'=oldX0^post14, x1^0'=x1^post14, oldX2^0'=oldX2^post14, (0 == 0 /\ -x0^0+oldX0^post14 == 0 /\ x0^post14-oldX2^post14 == 0 /\ oldX1^post14-x1^0 == 0 /\ -oldX3^post14+x1^post14 == 0), cost: 1
New rule:
l12 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l2 : x0^0'=x0^post17, oldX1^0'=oldX1^post17, oldX3^0'=oldX3^post17, oldX0^0'=oldX0^post17, x1^0'=x1^post17, oldX2^0'=oldX2^post17, (-oldX2^post17+oldX2^0 == 0 /\ -x1^post17+x1^0 == 0 /\ x0^0-x0^post17 == 0 /\ -oldX3^post17+oldX3^0 == 0 /\ oldX0^0-oldX0^post17 == 0 /\ oldX1^0-oldX1^post17 == 0), cost: 1
New rule:
l12 -> l2 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l3 : x0^0'=x0^post18, oldX1^0'=oldX1^post18, oldX3^0'=oldX3^post18, oldX0^0'=oldX0^post18, x1^0'=x1^post18, oldX2^0'=oldX2^post18, (x0^0-x0^post18 == 0 /\ oldX1^0-oldX1^post18 == 0 /\ x1^0-x1^post18 == 0 /\ -oldX3^post18+oldX3^0 == 0 /\ -oldX0^post18+oldX0^0 == 0 /\ -oldX2^post18+oldX2^0 == 0), cost: 1
New rule:
l12 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l4 : x0^0'=x0^post19, oldX1^0'=oldX1^post19, oldX3^0'=oldX3^post19, oldX0^0'=oldX0^post19, x1^0'=x1^post19, oldX2^0'=oldX2^post19, (x0^0-x0^post19 == 0 /\ -oldX0^post19+oldX0^0 == 0 /\ -oldX3^post19+oldX3^0 == 0 /\ oldX1^0-oldX1^post19 == 0 /\ x1^0-x1^post19 == 0 /\ -oldX2^post19+oldX2^0 == 0), cost: 1
New rule:
l12 -> l4 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l5 : x0^0'=x0^post20, oldX1^0'=oldX1^post20, oldX3^0'=oldX3^post20, oldX0^0'=oldX0^post20, x1^0'=x1^post20, oldX2^0'=oldX2^post20, (oldX1^0-oldX1^post20 == 0 /\ -oldX3^post20+oldX3^0 == 0 /\ x0^0-x0^post20 == 0 /\ x1^0-x1^post20 == 0 /\ oldX2^0-oldX2^post20 == 0 /\ -oldX0^post20+oldX0^0 == 0), cost: 1
New rule:
l12 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l6 : x0^0'=x0^post21, oldX1^0'=oldX1^post21, oldX3^0'=oldX3^post21, oldX0^0'=oldX0^post21, x1^0'=x1^post21, oldX2^0'=oldX2^post21, (oldX2^0-oldX2^post21 == 0 /\ -oldX0^post21+oldX0^0 == 0 /\ -x1^post21+x1^0 == 0 /\ oldX1^0-oldX1^post21 == 0 /\ x0^0-x0^post21 == 0 /\ oldX3^0-oldX3^post21 == 0), cost: 1
New rule:
l12 -> l6 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l9 : x0^0'=x0^post24, oldX1^0'=oldX1^post24, oldX3^0'=oldX3^post24, oldX0^0'=oldX0^post24, x1^0'=x1^post24, oldX2^0'=oldX2^post24, (-oldX3^post24+oldX3^0 == 0 /\ -oldX2^post24+oldX2^0 == 0 /\ -oldX1^post24+oldX1^0 == 0 /\ x0^0-x0^post24 == 0 /\ oldX0^0-oldX0^post24 == 0 /\ x1^0-x1^post24 == 0), cost: 1
New rule:
l12 -> l9 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l10 : x0^0'=x0^post25, oldX1^0'=oldX1^post25, oldX3^0'=oldX3^post25, oldX0^0'=oldX0^post25, x1^0'=x1^post25, oldX2^0'=oldX2^post25, (-oldX3^post25+oldX3^0 == 0 /\ -oldX2^post25+oldX2^0 == 0 /\ x0^0-x0^post25 == 0 /\ oldX1^0-oldX1^post25 == 0 /\ x1^0-x1^post25 == 0 /\ oldX0^0-oldX0^post25 == 0), cost: 1
New rule:
l12 -> l10 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l11 : x0^0'=x0^post26, oldX1^0'=oldX1^post26, oldX3^0'=oldX3^post26, oldX0^0'=oldX0^post26, x1^0'=x1^post26, oldX2^0'=oldX2^post26, (-oldX2^post26+oldX2^0 == 0 /\ -oldX0^post26+oldX0^0 == 0 /\ oldX1^0-oldX1^post26 == 0 /\ x0^0-x0^post26 == 0 /\ x1^0-x1^post26 == 0 /\ -oldX3^post26+oldX3^0 == 0), cost: 1
New rule:
l12 -> l11 : TRUE, cost: 1

Applied preprocessing
Original rule:
l13 -> l12 : x0^0'=x0^post27, oldX1^0'=oldX1^post27, oldX3^0'=oldX3^post27, oldX0^0'=oldX0^post27, x1^0'=x1^post27, oldX2^0'=oldX2^post27, (oldX2^0-oldX2^post27 == 0 /\ -oldX3^post27+oldX3^0 == 0 /\ -x1^post27+x1^0 == 0 /\ -oldX0^post27+oldX0^0 == 0 /\ oldX1^0-oldX1^post27 == 0 /\ x0^0-x0^post27 == 0), cost: 1
New rule:
l13 -> l12 : TRUE, cost: 1

Simplified rules
Start location: l13
  28: l2 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 1
  29: l3 -> l2 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0 >= 0, cost: 1
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  33: l6 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  36: l11 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 1
  37: l12 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 1
  38: l12 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 1
  39: l12 -> l2 : TRUE, cost: 1
  40: l12 -> l3 : TRUE, cost: 1
  41: l12 -> l4 : TRUE, cost: 1
  42: l12 -> l5 : TRUE, cost: 1
  43: l12 -> l6 : TRUE, cost: 1
  44: l12 -> l9 : TRUE, cost: 1
  45: l12 -> l10 : TRUE, cost: 1
  46: l12 -> l11 : TRUE, cost: 1
  47: l13 -> l12 : TRUE, cost: 1


Eliminating location l12 by chaining:

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 1
New rule:
l13 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 1
New rule:
l13 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l2 : TRUE, cost: 1
New rule:
l13 -> l2 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l3 : TRUE, cost: 1
New rule:
l13 -> l3 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l4 : TRUE, cost: 1
New rule:
l13 -> l4 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l5 : TRUE, cost: 1
New rule:
l13 -> l5 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l6 : TRUE, cost: 1
New rule:
l13 -> l6 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l9 : TRUE, cost: 1
New rule:
l13 -> l9 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l10 : TRUE, cost: 1
New rule:
l13 -> l10 : TRUE, cost: 2

Applied chaining
First rule:
l13 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l11 : TRUE, cost: 1
New rule:
l13 -> l11 : TRUE, cost: 2

Applied deletion
Removed the following rules: 37 38 39 40 41 42 43 44 45 46 47

Eliminated locations on tree-shaped paths
Start location: l13
  28: l2 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 1
  29: l3 -> l2 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0 >= 0, cost: 1
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  33: l6 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  36: l11 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 1
  48: l13 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 2
  49: l13 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 2
  50: l13 -> l2 : TRUE, cost: 2
  51: l13 -> l3 : TRUE, cost: 2
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  54: l13 -> l6 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  57: l13 -> l11 : TRUE, cost: 2


Eliminating location l6 by chaining:

Applied chaining
First rule:
l13 -> l6 : x0^0'=oldX2^post14, oldX1^0'=x1^0, oldX3^0'=x1^post14, oldX0^0'=x0^0, x1^0'=x1^post14, oldX2^0'=oldX2^post14, 0 == 0, cost: 2
Second rule:
l6 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 1
New rule:
l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3

Applied chaining
First rule:
l13 -> l6 : TRUE, cost: 2
Second rule:
l6 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 1
New rule:
l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3

Applied deletion
Removed the following rules: 33 49 54

Eliminating location l11 by chaining:

Applied chaining
First rule:
l13 -> l11 : x0^0'=x0^post13, oldX1^0'=x1^0, oldX3^0'=x1^post13, oldX0^0'=x0^0, x1^0'=x1^post13, oldX2^0'=x0^post13, 0 == 0, cost: 2
Second rule:
l11 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 1
New rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3

Applied chaining
First rule:
l13 -> l11 : TRUE, cost: 2
Second rule:
l11 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 1
New rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3

Applied deletion
Removed the following rules: 36 48 57

Eliminated locations on tree-shaped paths
Start location: l13
  28: l2 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 1
  29: l3 -> l2 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0 >= 0, cost: 1
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  50: l13 -> l2 : TRUE, cost: 2
  51: l13 -> l3 : TRUE, cost: 2
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3


Eliminated location l2
Start location: l13
  62: l3 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, x1^0 >= 0, cost: 2
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  51: l13 -> l3 : TRUE, cost: 2
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  63: l13 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 3


Applied acceleration
Original rule:
l3 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, x1^0 >= 0, cost: 2
New rule:
l3 -> l3 : oldX1^0'=1+x1^0-n, oldX0^0'=x0^0, x1^0'=x1^0-n, (-1+n >= 0 /\ 1+x1^0-n >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_eKGHfn.txt

Applied instantiation
Original rule:
l3 -> l3 : oldX1^0'=1+x1^0-n, oldX0^0'=x0^0, x1^0'=x1^0-n, (-1+n >= 0 /\ 1+x1^0-n >= 0), cost: 2*n
New rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, (0 >= 0 /\ x1^0 >= 0), cost: 2+2*x1^0

Applied simplification
Original rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, (0 >= 0 /\ x1^0 >= 0), cost: 2+2*x1^0
New rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 2+2*x1^0

Applied deletion
Removed the following rules: 62

Accelerated simple loops
Start location: l13
  65: l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 2+2*x1^0
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  51: l13 -> l3 : TRUE, cost: 2
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  63: l13 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 3


Applied chaining
First rule:
l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
Second rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 2+2*x1^0
New rule:
l5 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, 1+x0^0 <= 0, cost: 17

Applied chaining
First rule:
l13 -> l3 : TRUE, cost: 2
Second rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 2+2*x1^0
New rule:
l13 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 4+2*x1^0

Applied chaining
First rule:
l13 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 3
Second rule:
l3 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 2+2*x1^0
New rule:
l13 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, -1+x1^0 >= 0, cost: 3+2*x1^0

Applied deletion
Removed the following rules: 65

Chained accelerated rules with incoming rules
Start location: l13
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  31: l5 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=7, 1+x0^0 <= 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  66: l5 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, 1+x0^0 <= 0, cost: 17
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  51: l13 -> l3 : TRUE, cost: 2
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  63: l13 -> l3 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=-1+x1^0, TRUE, cost: 3
  67: l13 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, x1^0 >= 0, cost: 4+2*x1^0
  68: l13 -> l3 : oldX1^0'=0, oldX0^0'=x0^0, x1^0'=-1, -1+x1^0 >= 0, cost: 3+2*x1^0


Removed unreachable locations and irrelevant leafs
Start location: l13
  30: l4 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 1
  32: l5 -> l4 : oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=x1^post6, oldX2^0'=x1^post6, x0^0 >= 0, cost: 1
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  52: l13 -> l4 : TRUE, cost: 2
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3


Eliminated location l4
Start location: l13
  69: l5 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^post6, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  70: l13 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 3


Applied acceleration
Original rule:
l5 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^post6, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2
New rule:
l5 -> l5 : x0^0'=x0^0-n0, oldX1^0'=x1^post6, oldX0^0'=1+x0^0-n0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (-1+n0 >= 0 /\ 1+x0^0-n0 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_lohaKa.txt

Applied instantiation
Original rule:
l5 -> l5 : x0^0'=x0^0-n0, oldX1^0'=x1^post6, oldX0^0'=1+x0^0-n0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (-1+n0 >= 0 /\ 1+x0^0-n0 >= 0), cost: 2*n0
New rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 >= 0 /\ x0^0 >= 0), cost: 2+2*x0^0

Applied simplification
Original rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 >= 0 /\ x0^0 >= 0), cost: 2+2*x0^0
New rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0

Applied deletion
Removed the following rules: 69

Accelerated simple loops
Start location: l13
  72: l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  70: l13 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 3


Applied chaining
First rule:
l13 -> l5 : TRUE, cost: 2
Second rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0
New rule:
l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 4+2*x0^0

Applied chaining
First rule:
l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
Second rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0
New rule:
l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX3^0'=x1^post14, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ 7 >= 0), cost: 19

Applied chaining
First rule:
l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
Second rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0
New rule:
l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ 7 >= 0), cost: 19

Applied chaining
First rule:
l13 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 3
Second rule:
l5 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 2+2*x0^0
New rule:
l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, -1+x0^0 >= 0, cost: 3+2*x0^0

Applied deletion
Removed the following rules: 72

Chained accelerated rules with incoming rules
Start location: l13
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  53: l13 -> l5 : TRUE, cost: 2
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  58: l13 -> l5 : x0^0'=7, oldX1^0'=x1^post14, oldX3^0'=x1^post14, oldX0^0'=oldX2^post14, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  59: l13 -> l5 : x0^0'=7, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post7, oldX2^0'=oldX2^post7, 0 == 0, cost: 3
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  70: l13 -> l5 : x0^0'=-1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, 0 == 0, cost: 3
  73: l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, x0^0 >= 0, cost: 4+2*x0^0
  74: l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX3^0'=x1^post14, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ 7 >= 0), cost: 19
  75: l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, (0 == 0 /\ 7 >= 0), cost: 19
  76: l13 -> l5 : x0^0'=-1, oldX1^0'=x1^post6, oldX0^0'=0, x1^0'=oldX2^post4, oldX2^0'=oldX2^post4, -1+x0^0 >= 0, cost: 3+2*x0^0


Removed unreachable locations and irrelevant leafs
Start location: l13
  34: l9 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 1
  35: l10 -> l9 : oldX1^0'=x1^0, oldX0^0'=x0^0, -63+x0^0 <= 0, cost: 1
  55: l13 -> l9 : TRUE, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3


Eliminated location l9
Start location: l13
  77: l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
  56: l13 -> l10 : TRUE, cost: 2
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  78: l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 3


Applied acceleration
Original rule:
l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
New rule:
l10 -> l10 : x0^0'=x0^0+n1, oldX1^0'=oldX2^post9, oldX0^0'=-1+x0^0+n1, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (64-x0^0-n1 >= 0 /\ -2+n1 >= 0), cost: 2*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_kEifmJ.txt

Applied instantiation
Original rule:
l10 -> l10 : x0^0'=x0^0+n1, oldX1^0'=oldX2^post9, oldX0^0'=-1+x0^0+n1, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (64-x0^0-n1 >= 0 /\ -2+n1 >= 0), cost: 2*n1
New rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 >= 0 /\ 62-x0^0 >= 0), cost: 128-2*x0^0

Applied simplification
Original rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 >= 0 /\ 62-x0^0 >= 0), cost: 128-2*x0^0
New rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0

Accelerated simple loops
Start location: l13
  77: l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
  80: l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0
  56: l13 -> l10 : TRUE, cost: 2
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  78: l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 3


Applied chaining
First rule:
l13 -> l10 : TRUE, cost: 2
Second rule:
l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
New rule:
l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 4

Applied chaining
First rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
Second rule:
l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
New rule:
l13 -> l10 : x0^0'=1, oldX1^0'=0, oldX3^0'=x1^post13, oldX0^0'=0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -63 <= 0), cost: 5

Applied chaining
First rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
Second rule:
l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
New rule:
l13 -> l10 : x0^0'=1, oldX1^0'=0, oldX0^0'=0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63 <= 0, cost: 5

Applied chaining
First rule:
l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 3
Second rule:
l10 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 2
New rule:
l13 -> l10 : x0^0'=2+x0^0, oldX1^0'=oldX2^post9, oldX0^0'=1+x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 5

Applied chaining
First rule:
l13 -> l10 : TRUE, cost: 2
Second rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0
New rule:
l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 130-2*x0^0

Applied chaining
First rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
Second rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0
New rule:
l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX3^0'=x1^post13, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -62 <= 0), cost: 131

Applied chaining
First rule:
l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
Second rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0
New rule:
l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62 <= 0, cost: 131

Applied chaining
First rule:
l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 3
Second rule:
l10 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 128-2*x0^0
New rule:
l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -61+x0^0 <= 0, cost: 129-2*x0^0

Applied deletion
Removed the following rules: 77 80

Chained accelerated rules with incoming rules
Start location: l13
  56: l13 -> l10 : TRUE, cost: 2
  60: l13 -> l10 : x0^0'=0, oldX1^0'=x1^post13, oldX3^0'=x1^post13, oldX0^0'=x0^post13, x1^0'=0, oldX2^0'=x0^post13, 0 == 0, cost: 3
  61: l13 -> l10 : x0^0'=0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=0, TRUE, cost: 3
  78: l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, 0 == 0, cost: 3
  81: l13 -> l10 : x0^0'=1+x0^0, oldX1^0'=x1^0, oldX0^0'=x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63+x0^0 <= 0, cost: 4
  82: l13 -> l10 : x0^0'=1, oldX1^0'=0, oldX3^0'=x1^post13, oldX0^0'=0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -63 <= 0), cost: 5
  83: l13 -> l10 : x0^0'=1, oldX1^0'=0, oldX0^0'=0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -63 <= 0, cost: 5
  84: l13 -> l10 : x0^0'=2+x0^0, oldX1^0'=oldX2^post9, oldX0^0'=1+x0^0, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 5
  85: l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62+x0^0 <= 0, cost: 130-2*x0^0
  86: l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX3^0'=x1^post13, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, (0 == 0 /\ -62 <= 0), cost: 131
  87: l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -62 <= 0, cost: 131
  88: l13 -> l10 : x0^0'=64, oldX1^0'=oldX2^post9, oldX0^0'=63, x1^0'=oldX2^post9, oldX2^0'=oldX2^post9, -61+x0^0 <= 0, cost: 129-2*x0^0


Removed unreachable locations and irrelevant leafs
Start location: l13
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0