WORST_CASE(Omega(0),?)

Initial ITS
Start location: l14
   0: l0 -> l1 : i^0'=i^post0, i13^0'=i13^post0, tmp___0^0'=tmp___0^post0, i9^0'=i9^post0, i11^0'=i11^post0, tmp^0'=tmp^post0, i7^0'=i7^post0, (i^0-i^post0 == 0 /\ -i13^post0+i13^0 == 0 /\ -i7^post0+i7^0 == 0 /\ -tmp^post0+tmp^0 == 0 /\ -i11^post0+i11^0 == 0 /\ i9^0-i9^post0 == 0 /\ tmp___0^0-tmp___0^post0 == 0), cost: 1
  16: l1 -> l5 : i^0'=i^post16, i13^0'=i13^post16, tmp___0^0'=tmp___0^post16, i9^0'=i9^post16, i11^0'=i11^post16, tmp^0'=tmp^post16, i7^0'=i7^post16, (-i11^post16+i11^0 == 0 /\ i9^post16 == 0 /\ -i7^post16+i7^0 == 0 /\ i13^0-i13^post16 == 0 /\ i^0-i^post16 == 0 /\ i9^10 == 0 /\ -tmp^post16+tmp^0 == 0 /\ tmp___0^0-tmp___0^post16 == 0 /\ 50-i7^0 <= 0), cost: 1
  17: l1 -> l0 : i^0'=i^post17, i13^0'=i13^post17, tmp___0^0'=tmp___0^post17, i9^0'=i9^post17, i11^0'=i11^post17, tmp^0'=tmp^post17, i7^0'=i7^post17, (i13^0-i13^post17 == 0 /\ i^0-i^post17 == 0 /\ tmp^0-tmp^post17 == 0 /\ -49+i7^0 <= 0 /\ tmp___0^0-tmp___0^post17 == 0 /\ -i11^post17+i11^0 == 0 /\ -1-i7^0+i7^post17 == 0 /\ -i9^post17+i9^0 == 0), cost: 1
   1: l2 -> l3 : i^0'=i^post1, i13^0'=i13^post1, tmp___0^0'=tmp___0^post1, i9^0'=i9^post1, i11^0'=i11^post1, tmp^0'=tmp^post1, i7^0'=i7^post1, (-i11^post1+i11^0 == 0 /\ 50-i^0 <= 0 /\ tmp___0^0-tmp___0^post1 == 0 /\ i^0-i^post1 == 0 /\ i13^0-i13^post1 == 0 /\ -i7^post1+i7^0 == 0 /\ i9^0-i9^post1 == 0 /\ -tmp^post1+tmp^0 == 0), cost: 1
   2: l2 -> l4 : i^0'=i^post2, i13^0'=i13^post2, tmp___0^0'=tmp___0^post2, i9^0'=i9^post2, i11^0'=i11^post2, tmp^0'=tmp^post2, i7^0'=i7^post2, (i13^0-i13^post2 == 0 /\ i7^0-i7^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ -1-i^0+i^post2 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ -i9^post2+i9^0 == 0 /\ -i11^post2+i11^0 == 0 /\ -49+i^0 <= 0), cost: 1
  15: l4 -> l2 : i^0'=i^post15, i13^0'=i13^post15, tmp___0^0'=tmp___0^post15, i9^0'=i9^post15, i11^0'=i11^post15, tmp^0'=tmp^post15, i7^0'=i7^post15, (i7^0-i7^post15 == 0 /\ -tmp^post15+tmp^0 == 0 /\ -i9^post15+i9^0 == 0 /\ tmp___0^0-tmp___0^post15 == 0 /\ -i11^post15+i11^0 == 0 /\ i13^0-i13^post15 == 0 /\ i^0-i^post15 == 0), cost: 1
   3: l5 -> l6 : i^0'=i^post3, i13^0'=i13^post3, tmp___0^0'=tmp___0^post3, i9^0'=i9^post3, i11^0'=i11^post3, tmp^0'=tmp^post3, i7^0'=i7^post3, (-i7^post3+i7^0 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ i13^0-i13^post3 == 0 /\ i^0-i^post3 == 0 /\ -i9^post3+i9^0 == 0 /\ tmp^0-tmp^post3 == 0 /\ i11^0-i11^post3 == 0), cost: 1
  13: l6 -> l9 : i^0'=i^post13, i13^0'=i13^post13, tmp___0^0'=tmp___0^post13, i9^0'=i9^post13, i11^0'=i11^post13, tmp^0'=tmp^post13, i7^0'=i7^post13, (i9^0-i9^post13 == 0 /\ -tmp___0^post13+tmp___0^0 == 0 /\ i11^0-i11^post13 == 0 /\ -i13^post13+i13^0 == 0 /\ i^post13 == 0 /\ -tmp^post13+tmp^0 == 0 /\ -i7^post13+i7^0 == 0 /\ 50-i9^0 <= 0), cost: 1
  14: l6 -> l5 : i^0'=i^post14, i13^0'=i13^post14, tmp___0^0'=tmp___0^post14, i9^0'=i9^post14, i11^0'=i11^post14, tmp^0'=tmp^post14, i7^0'=i7^post14, (i^0-i^post14 == 0 /\ -49+i9^0 <= 0 /\ -1-i9^0+i9^post14 == 0 /\ -i13^post14+i13^0 == 0 /\ -i7^post14+i7^0 == 0 /\ -tmp^post14+tmp^0 == 0 /\ -i11^post14+i11^0 == 0 /\ tmp___0^0-tmp___0^post14 == 0), cost: 1
   4: l7 -> l4 : i^0'=i^post4, i13^0'=i13^post4, tmp___0^0'=tmp___0^post4, i9^0'=i9^post4, i11^0'=i11^post4, tmp^0'=tmp^post4, i7^0'=i7^post4, (-tmp___0^post4+tmp___0^0 == 0 /\ -i7^post4+i7^0 == 0 /\ 50-i13^0 <= 0 /\ i^post4 == 0 /\ -i9^post4+i9^0 == 0 /\ i11^0-i11^post4 == 0 /\ tmp^0-tmp^post4 == 0 /\ i13^0-i13^post4 == 0), cost: 1
   5: l7 -> l8 : i^0'=i^post5, i13^0'=i13^post5, tmp___0^0'=tmp___0^post5, i9^0'=i9^post5, i11^0'=i11^post5, tmp^0'=tmp^post5, i7^0'=i7^post5, (i9^0-i9^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -i7^post5+i7^0 == 0 /\ -1-i13^0+i13^post5 == 0 /\ i11^0-i11^post5 == 0 /\ -49+i13^0 <= 0 /\ -tmp^post5+tmp^0 == 0 /\ i^0-i^post5 == 0), cost: 1
  12: l8 -> l7 : i^0'=i^post12, i13^0'=i13^post12, tmp___0^0'=tmp___0^post12, i9^0'=i9^post12, i11^0'=i11^post12, tmp^0'=tmp^post12, i7^0'=i7^post12, (-tmp^post12+tmp^0 == 0 /\ i^0-i^post12 == 0 /\ i11^0-i11^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ i9^0-i9^post12 == 0 /\ -i7^post12+i7^0 == 0 /\ -i13^post12+i13^0 == 0), cost: 1
   6: l9 -> l10 : i^0'=i^post6, i13^0'=i13^post6, tmp___0^0'=tmp___0^post6, i9^0'=i9^post6, i11^0'=i11^post6, tmp^0'=tmp^post6, i7^0'=i7^post6, (i^0-i^post6 == 0 /\ -i11^post6+i11^0 == 0 /\ -tmp^post6+tmp^0 == 0 /\ i9^0-i9^post6 == 0 /\ -i7^post6+i7^0 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ -i13^post6+i13^0 == 0), cost: 1
  10: l10 -> l12 : i^0'=i^post10, i13^0'=i13^post10, tmp___0^0'=tmp___0^post10, i9^0'=i9^post10, i11^0'=i11^post10, tmp^0'=tmp^post10, i7^0'=i7^post10, (-tmp^post10+tmp^0 == 0 /\ i11^10 == 0 /\ tmp___0^0-tmp___0^post10 == 0 /\ 50-i^0 <= 0 /\ -i9^post10+i9^0 == 0 /\ i13^0-i13^post10 == 0 /\ -i7^post10+i7^0 == 0 /\ i11^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
  11: l10 -> l9 : i^0'=i^post11, i13^0'=i13^post11, tmp___0^0'=tmp___0^post11, i9^0'=i9^post11, i11^0'=i11^post11, tmp^0'=tmp^post11, i7^0'=i7^post11, (i11^0-i11^post11 == 0 /\ -1-i^0+i^post11 == 0 /\ i9^0-i9^post11 == 0 /\ -i7^post11+i7^0 == 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -49+i^0 <= 0 /\ tmp^0-tmp^post11 == 0 /\ i13^0-i13^post11 == 0), cost: 1
   7: l11 -> l8 : i^0'=i^post7, i13^0'=i13^post7, tmp___0^0'=tmp___0^post7, i9^0'=i9^post7, i11^0'=i11^post7, tmp^0'=tmp^post7, i7^0'=i7^post7, (-i11^post7+i11^0 == 0 /\ 50-i11^0 <= 0 /\ tmp___0^0-tmp___0^post7 == 0 /\ i13^post7 == 0 /\ i13^10 == 0 /\ -i7^post7+i7^0 == 0 /\ -tmp^post7+tmp^0 == 0 /\ -i^post7+i^0 == 0 /\ i9^0-i9^post7 == 0), cost: 1
   8: l11 -> l12 : i^0'=i^post8, i13^0'=i13^post8, tmp___0^0'=tmp___0^post8, i9^0'=i9^post8, i11^0'=i11^post8, tmp^0'=tmp^post8, i7^0'=i7^post8, (i7^0-i7^post8 == 0 /\ -1+i11^post8-i11^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ i13^0-i13^post8 == 0 /\ -49+i11^0 <= 0 /\ i9^0-i9^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
   9: l12 -> l11 : i^0'=i^post9, i13^0'=i13^post9, tmp___0^0'=tmp___0^post9, i9^0'=i9^post9, i11^0'=i11^post9, tmp^0'=tmp^post9, i7^0'=i7^post9, (-i11^post9+i11^0 == 0 /\ i13^0-i13^post9 == 0 /\ i7^0-i7^post9 == 0 /\ -i9^post9+i9^0 == 0 /\ tmp___0^0-tmp___0^post9 == 0 /\ i^0-i^post9 == 0 /\ -tmp^post9+tmp^0 == 0), cost: 1
  18: l13 -> l0 : i^0'=i^post18, i13^0'=i13^post18, tmp___0^0'=tmp___0^post18, i9^0'=i9^post18, i11^0'=i11^post18, tmp^0'=tmp^post18, i7^0'=i7^post18, (0 == 0 /\ i^post18 == 0 /\ -i9^post18+i9^0 == 0 /\ i13^0-i13^post18 == 0 /\ i7^post18 == 0 /\ i11^0-i11^post18 == 0 /\ i7^10 == 0), cost: 1
  19: l14 -> l13 : i^0'=i^post19, i13^0'=i13^post19, tmp___0^0'=tmp___0^post19, i9^0'=i9^post19, i11^0'=i11^post19, tmp^0'=tmp^post19, i7^0'=i7^post19, (-i7^post19+i7^0 == 0 /\ i9^0-i9^post19 == 0 /\ -tmp___0^post19+tmp___0^0 == 0 /\ i11^0-i11^post19 == 0 /\ -tmp^post19+tmp^0 == 0 /\ i13^0-i13^post19 == 0 /\ i^0-i^post19 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l14
   0: l0 -> l1 : i^0'=i^post0, i13^0'=i13^post0, tmp___0^0'=tmp___0^post0, i9^0'=i9^post0, i11^0'=i11^post0, tmp^0'=tmp^post0, i7^0'=i7^post0, (i^0-i^post0 == 0 /\ -i13^post0+i13^0 == 0 /\ -i7^post0+i7^0 == 0 /\ -tmp^post0+tmp^0 == 0 /\ -i11^post0+i11^0 == 0 /\ i9^0-i9^post0 == 0 /\ tmp___0^0-tmp___0^post0 == 0), cost: 1
  16: l1 -> l5 : i^0'=i^post16, i13^0'=i13^post16, tmp___0^0'=tmp___0^post16, i9^0'=i9^post16, i11^0'=i11^post16, tmp^0'=tmp^post16, i7^0'=i7^post16, (-i11^post16+i11^0 == 0 /\ i9^post16 == 0 /\ -i7^post16+i7^0 == 0 /\ i13^0-i13^post16 == 0 /\ i^0-i^post16 == 0 /\ i9^10 == 0 /\ -tmp^post16+tmp^0 == 0 /\ tmp___0^0-tmp___0^post16 == 0 /\ 50-i7^0 <= 0), cost: 1
  17: l1 -> l0 : i^0'=i^post17, i13^0'=i13^post17, tmp___0^0'=tmp___0^post17, i9^0'=i9^post17, i11^0'=i11^post17, tmp^0'=tmp^post17, i7^0'=i7^post17, (i13^0-i13^post17 == 0 /\ i^0-i^post17 == 0 /\ tmp^0-tmp^post17 == 0 /\ -49+i7^0 <= 0 /\ tmp___0^0-tmp___0^post17 == 0 /\ -i11^post17+i11^0 == 0 /\ -1-i7^0+i7^post17 == 0 /\ -i9^post17+i9^0 == 0), cost: 1
   2: l2 -> l4 : i^0'=i^post2, i13^0'=i13^post2, tmp___0^0'=tmp___0^post2, i9^0'=i9^post2, i11^0'=i11^post2, tmp^0'=tmp^post2, i7^0'=i7^post2, (i13^0-i13^post2 == 0 /\ i7^0-i7^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ -1-i^0+i^post2 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ -i9^post2+i9^0 == 0 /\ -i11^post2+i11^0 == 0 /\ -49+i^0 <= 0), cost: 1
  15: l4 -> l2 : i^0'=i^post15, i13^0'=i13^post15, tmp___0^0'=tmp___0^post15, i9^0'=i9^post15, i11^0'=i11^post15, tmp^0'=tmp^post15, i7^0'=i7^post15, (i7^0-i7^post15 == 0 /\ -tmp^post15+tmp^0 == 0 /\ -i9^post15+i9^0 == 0 /\ tmp___0^0-tmp___0^post15 == 0 /\ -i11^post15+i11^0 == 0 /\ i13^0-i13^post15 == 0 /\ i^0-i^post15 == 0), cost: 1
   3: l5 -> l6 : i^0'=i^post3, i13^0'=i13^post3, tmp___0^0'=tmp___0^post3, i9^0'=i9^post3, i11^0'=i11^post3, tmp^0'=tmp^post3, i7^0'=i7^post3, (-i7^post3+i7^0 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ i13^0-i13^post3 == 0 /\ i^0-i^post3 == 0 /\ -i9^post3+i9^0 == 0 /\ tmp^0-tmp^post3 == 0 /\ i11^0-i11^post3 == 0), cost: 1
  13: l6 -> l9 : i^0'=i^post13, i13^0'=i13^post13, tmp___0^0'=tmp___0^post13, i9^0'=i9^post13, i11^0'=i11^post13, tmp^0'=tmp^post13, i7^0'=i7^post13, (i9^0-i9^post13 == 0 /\ -tmp___0^post13+tmp___0^0 == 0 /\ i11^0-i11^post13 == 0 /\ -i13^post13+i13^0 == 0 /\ i^post13 == 0 /\ -tmp^post13+tmp^0 == 0 /\ -i7^post13+i7^0 == 0 /\ 50-i9^0 <= 0), cost: 1
  14: l6 -> l5 : i^0'=i^post14, i13^0'=i13^post14, tmp___0^0'=tmp___0^post14, i9^0'=i9^post14, i11^0'=i11^post14, tmp^0'=tmp^post14, i7^0'=i7^post14, (i^0-i^post14 == 0 /\ -49+i9^0 <= 0 /\ -1-i9^0+i9^post14 == 0 /\ -i13^post14+i13^0 == 0 /\ -i7^post14+i7^0 == 0 /\ -tmp^post14+tmp^0 == 0 /\ -i11^post14+i11^0 == 0 /\ tmp___0^0-tmp___0^post14 == 0), cost: 1
   4: l7 -> l4 : i^0'=i^post4, i13^0'=i13^post4, tmp___0^0'=tmp___0^post4, i9^0'=i9^post4, i11^0'=i11^post4, tmp^0'=tmp^post4, i7^0'=i7^post4, (-tmp___0^post4+tmp___0^0 == 0 /\ -i7^post4+i7^0 == 0 /\ 50-i13^0 <= 0 /\ i^post4 == 0 /\ -i9^post4+i9^0 == 0 /\ i11^0-i11^post4 == 0 /\ tmp^0-tmp^post4 == 0 /\ i13^0-i13^post4 == 0), cost: 1
   5: l7 -> l8 : i^0'=i^post5, i13^0'=i13^post5, tmp___0^0'=tmp___0^post5, i9^0'=i9^post5, i11^0'=i11^post5, tmp^0'=tmp^post5, i7^0'=i7^post5, (i9^0-i9^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -i7^post5+i7^0 == 0 /\ -1-i13^0+i13^post5 == 0 /\ i11^0-i11^post5 == 0 /\ -49+i13^0 <= 0 /\ -tmp^post5+tmp^0 == 0 /\ i^0-i^post5 == 0), cost: 1
  12: l8 -> l7 : i^0'=i^post12, i13^0'=i13^post12, tmp___0^0'=tmp___0^post12, i9^0'=i9^post12, i11^0'=i11^post12, tmp^0'=tmp^post12, i7^0'=i7^post12, (-tmp^post12+tmp^0 == 0 /\ i^0-i^post12 == 0 /\ i11^0-i11^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ i9^0-i9^post12 == 0 /\ -i7^post12+i7^0 == 0 /\ -i13^post12+i13^0 == 0), cost: 1
   6: l9 -> l10 : i^0'=i^post6, i13^0'=i13^post6, tmp___0^0'=tmp___0^post6, i9^0'=i9^post6, i11^0'=i11^post6, tmp^0'=tmp^post6, i7^0'=i7^post6, (i^0-i^post6 == 0 /\ -i11^post6+i11^0 == 0 /\ -tmp^post6+tmp^0 == 0 /\ i9^0-i9^post6 == 0 /\ -i7^post6+i7^0 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ -i13^post6+i13^0 == 0), cost: 1
  10: l10 -> l12 : i^0'=i^post10, i13^0'=i13^post10, tmp___0^0'=tmp___0^post10, i9^0'=i9^post10, i11^0'=i11^post10, tmp^0'=tmp^post10, i7^0'=i7^post10, (-tmp^post10+tmp^0 == 0 /\ i11^10 == 0 /\ tmp___0^0-tmp___0^post10 == 0 /\ 50-i^0 <= 0 /\ -i9^post10+i9^0 == 0 /\ i13^0-i13^post10 == 0 /\ -i7^post10+i7^0 == 0 /\ i11^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
  11: l10 -> l9 : i^0'=i^post11, i13^0'=i13^post11, tmp___0^0'=tmp___0^post11, i9^0'=i9^post11, i11^0'=i11^post11, tmp^0'=tmp^post11, i7^0'=i7^post11, (i11^0-i11^post11 == 0 /\ -1-i^0+i^post11 == 0 /\ i9^0-i9^post11 == 0 /\ -i7^post11+i7^0 == 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -49+i^0 <= 0 /\ tmp^0-tmp^post11 == 0 /\ i13^0-i13^post11 == 0), cost: 1
   7: l11 -> l8 : i^0'=i^post7, i13^0'=i13^post7, tmp___0^0'=tmp___0^post7, i9^0'=i9^post7, i11^0'=i11^post7, tmp^0'=tmp^post7, i7^0'=i7^post7, (-i11^post7+i11^0 == 0 /\ 50-i11^0 <= 0 /\ tmp___0^0-tmp___0^post7 == 0 /\ i13^post7 == 0 /\ i13^10 == 0 /\ -i7^post7+i7^0 == 0 /\ -tmp^post7+tmp^0 == 0 /\ -i^post7+i^0 == 0 /\ i9^0-i9^post7 == 0), cost: 1
   8: l11 -> l12 : i^0'=i^post8, i13^0'=i13^post8, tmp___0^0'=tmp___0^post8, i9^0'=i9^post8, i11^0'=i11^post8, tmp^0'=tmp^post8, i7^0'=i7^post8, (i7^0-i7^post8 == 0 /\ -1+i11^post8-i11^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ i13^0-i13^post8 == 0 /\ -49+i11^0 <= 0 /\ i9^0-i9^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
   9: l12 -> l11 : i^0'=i^post9, i13^0'=i13^post9, tmp___0^0'=tmp___0^post9, i9^0'=i9^post9, i11^0'=i11^post9, tmp^0'=tmp^post9, i7^0'=i7^post9, (-i11^post9+i11^0 == 0 /\ i13^0-i13^post9 == 0 /\ i7^0-i7^post9 == 0 /\ -i9^post9+i9^0 == 0 /\ tmp___0^0-tmp___0^post9 == 0 /\ i^0-i^post9 == 0 /\ -tmp^post9+tmp^0 == 0), cost: 1
  18: l13 -> l0 : i^0'=i^post18, i13^0'=i13^post18, tmp___0^0'=tmp___0^post18, i9^0'=i9^post18, i11^0'=i11^post18, tmp^0'=tmp^post18, i7^0'=i7^post18, (0 == 0 /\ i^post18 == 0 /\ -i9^post18+i9^0 == 0 /\ i13^0-i13^post18 == 0 /\ i7^post18 == 0 /\ i11^0-i11^post18 == 0 /\ i7^10 == 0), cost: 1
  19: l14 -> l13 : i^0'=i^post19, i13^0'=i13^post19, tmp___0^0'=tmp___0^post19, i9^0'=i9^post19, i11^0'=i11^post19, tmp^0'=tmp^post19, i7^0'=i7^post19, (-i7^post19+i7^0 == 0 /\ i9^0-i9^post19 == 0 /\ -tmp___0^post19+tmp___0^0 == 0 /\ i11^0-i11^post19 == 0 /\ -tmp^post19+tmp^0 == 0 /\ i13^0-i13^post19 == 0 /\ i^0-i^post19 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : i^0'=i^post0, i13^0'=i13^post0, tmp___0^0'=tmp___0^post0, i9^0'=i9^post0, i11^0'=i11^post0, tmp^0'=tmp^post0, i7^0'=i7^post0, (i^0-i^post0 == 0 /\ -i13^post0+i13^0 == 0 /\ -i7^post0+i7^0 == 0 /\ -tmp^post0+tmp^0 == 0 /\ -i11^post0+i11^0 == 0 /\ i9^0-i9^post0 == 0 /\ tmp___0^0-tmp___0^post0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l4 : i^0'=i^post2, i13^0'=i13^post2, tmp___0^0'=tmp___0^post2, i9^0'=i9^post2, i11^0'=i11^post2, tmp^0'=tmp^post2, i7^0'=i7^post2, (i13^0-i13^post2 == 0 /\ i7^0-i7^post2 == 0 /\ -tmp^post2+tmp^0 == 0 /\ -1-i^0+i^post2 == 0 /\ tmp___0^0-tmp___0^post2 == 0 /\ -i9^post2+i9^0 == 0 /\ -i11^post2+i11^0 == 0 /\ -49+i^0 <= 0), cost: 1
New rule:
l2 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l6 : i^0'=i^post3, i13^0'=i13^post3, tmp___0^0'=tmp___0^post3, i9^0'=i9^post3, i11^0'=i11^post3, tmp^0'=tmp^post3, i7^0'=i7^post3, (-i7^post3+i7^0 == 0 /\ -tmp___0^post3+tmp___0^0 == 0 /\ i13^0-i13^post3 == 0 /\ i^0-i^post3 == 0 /\ -i9^post3+i9^0 == 0 /\ tmp^0-tmp^post3 == 0 /\ i11^0-i11^post3 == 0), cost: 1
New rule:
l5 -> l6 : TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l4 : i^0'=i^post4, i13^0'=i13^post4, tmp___0^0'=tmp___0^post4, i9^0'=i9^post4, i11^0'=i11^post4, tmp^0'=tmp^post4, i7^0'=i7^post4, (-tmp___0^post4+tmp___0^0 == 0 /\ -i7^post4+i7^0 == 0 /\ 50-i13^0 <= 0 /\ i^post4 == 0 /\ -i9^post4+i9^0 == 0 /\ i11^0-i11^post4 == 0 /\ tmp^0-tmp^post4 == 0 /\ i13^0-i13^post4 == 0), cost: 1
New rule:
l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l7 -> l8 : i^0'=i^post5, i13^0'=i13^post5, tmp___0^0'=tmp___0^post5, i9^0'=i9^post5, i11^0'=i11^post5, tmp^0'=tmp^post5, i7^0'=i7^post5, (i9^0-i9^post5 == 0 /\ -tmp___0^post5+tmp___0^0 == 0 /\ -i7^post5+i7^0 == 0 /\ -1-i13^0+i13^post5 == 0 /\ i11^0-i11^post5 == 0 /\ -49+i13^0 <= 0 /\ -tmp^post5+tmp^0 == 0 /\ i^0-i^post5 == 0), cost: 1
New rule:
l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l10 : i^0'=i^post6, i13^0'=i13^post6, tmp___0^0'=tmp___0^post6, i9^0'=i9^post6, i11^0'=i11^post6, tmp^0'=tmp^post6, i7^0'=i7^post6, (i^0-i^post6 == 0 /\ -i11^post6+i11^0 == 0 /\ -tmp^post6+tmp^0 == 0 /\ i9^0-i9^post6 == 0 /\ -i7^post6+i7^0 == 0 /\ tmp___0^0-tmp___0^post6 == 0 /\ -i13^post6+i13^0 == 0), cost: 1
New rule:
l9 -> l10 : TRUE, cost: 1

Applied preprocessing
Original rule:
l11 -> l8 : i^0'=i^post7, i13^0'=i13^post7, tmp___0^0'=tmp___0^post7, i9^0'=i9^post7, i11^0'=i11^post7, tmp^0'=tmp^post7, i7^0'=i7^post7, (-i11^post7+i11^0 == 0 /\ 50-i11^0 <= 0 /\ tmp___0^0-tmp___0^post7 == 0 /\ i13^post7 == 0 /\ i13^10 == 0 /\ -i7^post7+i7^0 == 0 /\ -tmp^post7+tmp^0 == 0 /\ -i^post7+i^0 == 0 /\ i9^0-i9^post7 == 0), cost: 1
New rule:
l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l12 : i^0'=i^post8, i13^0'=i13^post8, tmp___0^0'=tmp___0^post8, i9^0'=i9^post8, i11^0'=i11^post8, tmp^0'=tmp^post8, i7^0'=i7^post8, (i7^0-i7^post8 == 0 /\ -1+i11^post8-i11^0 == 0 /\ tmp___0^0-tmp___0^post8 == 0 /\ -tmp^post8+tmp^0 == 0 /\ i13^0-i13^post8 == 0 /\ -49+i11^0 <= 0 /\ i9^0-i9^post8 == 0 /\ i^0-i^post8 == 0), cost: 1
New rule:
l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l12 -> l11 : i^0'=i^post9, i13^0'=i13^post9, tmp___0^0'=tmp___0^post9, i9^0'=i9^post9, i11^0'=i11^post9, tmp^0'=tmp^post9, i7^0'=i7^post9, (-i11^post9+i11^0 == 0 /\ i13^0-i13^post9 == 0 /\ i7^0-i7^post9 == 0 /\ -i9^post9+i9^0 == 0 /\ tmp___0^0-tmp___0^post9 == 0 /\ i^0-i^post9 == 0 /\ -tmp^post9+tmp^0 == 0), cost: 1
New rule:
l12 -> l11 : TRUE, cost: 1

Applied preprocessing
Original rule:
l10 -> l12 : i^0'=i^post10, i13^0'=i13^post10, tmp___0^0'=tmp___0^post10, i9^0'=i9^post10, i11^0'=i11^post10, tmp^0'=tmp^post10, i7^0'=i7^post10, (-tmp^post10+tmp^0 == 0 /\ i11^10 == 0 /\ tmp___0^0-tmp___0^post10 == 0 /\ 50-i^0 <= 0 /\ -i9^post10+i9^0 == 0 /\ i13^0-i13^post10 == 0 /\ -i7^post10+i7^0 == 0 /\ i11^post10 == 0 /\ -i^post10+i^0 == 0), cost: 1
New rule:
l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l10 -> l9 : i^0'=i^post11, i13^0'=i13^post11, tmp___0^0'=tmp___0^post11, i9^0'=i9^post11, i11^0'=i11^post11, tmp^0'=tmp^post11, i7^0'=i7^post11, (i11^0-i11^post11 == 0 /\ -1-i^0+i^post11 == 0 /\ i9^0-i9^post11 == 0 /\ -i7^post11+i7^0 == 0 /\ -tmp___0^post11+tmp___0^0 == 0 /\ -49+i^0 <= 0 /\ tmp^0-tmp^post11 == 0 /\ i13^0-i13^post11 == 0), cost: 1
New rule:
l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l7 : i^0'=i^post12, i13^0'=i13^post12, tmp___0^0'=tmp___0^post12, i9^0'=i9^post12, i11^0'=i11^post12, tmp^0'=tmp^post12, i7^0'=i7^post12, (-tmp^post12+tmp^0 == 0 /\ i^0-i^post12 == 0 /\ i11^0-i11^post12 == 0 /\ -tmp___0^post12+tmp___0^0 == 0 /\ i9^0-i9^post12 == 0 /\ -i7^post12+i7^0 == 0 /\ -i13^post12+i13^0 == 0), cost: 1
New rule:
l8 -> l7 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l9 : i^0'=i^post13, i13^0'=i13^post13, tmp___0^0'=tmp___0^post13, i9^0'=i9^post13, i11^0'=i11^post13, tmp^0'=tmp^post13, i7^0'=i7^post13, (i9^0-i9^post13 == 0 /\ -tmp___0^post13+tmp___0^0 == 0 /\ i11^0-i11^post13 == 0 /\ -i13^post13+i13^0 == 0 /\ i^post13 == 0 /\ -tmp^post13+tmp^0 == 0 /\ -i7^post13+i7^0 == 0 /\ 50-i9^0 <= 0), cost: 1
New rule:
l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l6 -> l5 : i^0'=i^post14, i13^0'=i13^post14, tmp___0^0'=tmp___0^post14, i9^0'=i9^post14, i11^0'=i11^post14, tmp^0'=tmp^post14, i7^0'=i7^post14, (i^0-i^post14 == 0 /\ -49+i9^0 <= 0 /\ -1-i9^0+i9^post14 == 0 /\ -i13^post14+i13^0 == 0 /\ -i7^post14+i7^0 == 0 /\ -tmp^post14+tmp^0 == 0 /\ -i11^post14+i11^0 == 0 /\ tmp___0^0-tmp___0^post14 == 0), cost: 1
New rule:
l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l4 -> l2 : i^0'=i^post15, i13^0'=i13^post15, tmp___0^0'=tmp___0^post15, i9^0'=i9^post15, i11^0'=i11^post15, tmp^0'=tmp^post15, i7^0'=i7^post15, (i7^0-i7^post15 == 0 /\ -tmp^post15+tmp^0 == 0 /\ -i9^post15+i9^0 == 0 /\ tmp___0^0-tmp___0^post15 == 0 /\ -i11^post15+i11^0 == 0 /\ i13^0-i13^post15 == 0 /\ i^0-i^post15 == 0), cost: 1
New rule:
l4 -> l2 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l5 : i^0'=i^post16, i13^0'=i13^post16, tmp___0^0'=tmp___0^post16, i9^0'=i9^post16, i11^0'=i11^post16, tmp^0'=tmp^post16, i7^0'=i7^post16, (-i11^post16+i11^0 == 0 /\ i9^post16 == 0 /\ -i7^post16+i7^0 == 0 /\ i13^0-i13^post16 == 0 /\ i^0-i^post16 == 0 /\ i9^10 == 0 /\ -tmp^post16+tmp^0 == 0 /\ tmp___0^0-tmp___0^post16 == 0 /\ 50-i7^0 <= 0), cost: 1
New rule:
l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : i^0'=i^post17, i13^0'=i13^post17, tmp___0^0'=tmp___0^post17, i9^0'=i9^post17, i11^0'=i11^post17, tmp^0'=tmp^post17, i7^0'=i7^post17, (i13^0-i13^post17 == 0 /\ i^0-i^post17 == 0 /\ tmp^0-tmp^post17 == 0 /\ -49+i7^0 <= 0 /\ tmp___0^0-tmp___0^post17 == 0 /\ -i11^post17+i11^0 == 0 /\ -1-i7^0+i7^post17 == 0 /\ -i9^post17+i9^0 == 0), cost: 1
New rule:
l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l13 -> l0 : i^0'=i^post18, i13^0'=i13^post18, tmp___0^0'=tmp___0^post18, i9^0'=i9^post18, i11^0'=i11^post18, tmp^0'=tmp^post18, i7^0'=i7^post18, (0 == 0 /\ i^post18 == 0 /\ -i9^post18+i9^0 == 0 /\ i13^0-i13^post18 == 0 /\ i7^post18 == 0 /\ i11^0-i11^post18 == 0 /\ i7^10 == 0), cost: 1
New rule:
l13 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 1

Applied preprocessing
Original rule:
l14 -> l13 : i^0'=i^post19, i13^0'=i13^post19, tmp___0^0'=tmp___0^post19, i9^0'=i9^post19, i11^0'=i11^post19, tmp^0'=tmp^post19, i7^0'=i7^post19, (-i7^post19+i7^0 == 0 /\ i9^0-i9^post19 == 0 /\ -tmp___0^post19+tmp___0^0 == 0 /\ i11^0-i11^post19 == 0 /\ -tmp^post19+tmp^0 == 0 /\ i13^0-i13^post19 == 0 /\ i^0-i^post19 == 0), cost: 1
New rule:
l14 -> l13 : TRUE, cost: 1

Simplified rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  21: l2 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  34: l4 -> l2 : TRUE, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  23: l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1
  24: l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
  31: l8 -> l7 : TRUE, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  37: l13 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 1
  38: l14 -> l13 : TRUE, cost: 1


Eliminating location l13 by chaining:

Applied chaining
First rule:
l14 -> l13 : TRUE, cost: 1
Second rule:
l13 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 1
New rule:
l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2

Applied deletion
Removed the following rules: 37 38

Eliminating location l2 by chaining:

Applied chaining
First rule:
l4 -> l2 : TRUE, cost: 1
Second rule:
l2 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
New rule:
l4 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 21 34

Eliminated locations on linear paths
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  40: l4 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  23: l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1
  24: l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
  31: l8 -> l7 : TRUE, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l4 -> l4 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2
New rule:
l4 -> l4 : i^0'=i^0+n, (n >= 0 /\ 50-i^0-n >= 0), cost: 2*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_fOILCP.txt

Applied instantiation
Original rule:
l4 -> l4 : i^0'=i^0+n, (n >= 0 /\ 50-i^0-n >= 0), cost: 2*n
New rule:
l4 -> l4 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0

Applied simplification
Original rule:
l4 -> l4 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0
New rule:
l4 -> l4 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0

Applied deletion
Removed the following rules: 40

Accelerated simple loops
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  42: l4 -> l4 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  23: l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1
  24: l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
  31: l8 -> l7 : TRUE, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1
Second rule:
l4 -> l4 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0
New rule:
l7 -> l4 : i^0'=50, -50+i13^0 >= 0, cost: 101

Applied deletion
Removed the following rules: 42

Chained accelerated rules with incoming rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  23: l7 -> l4 : i^0'=0, -50+i13^0 >= 0, cost: 1
  24: l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
  43: l7 -> l4 : i^0'=50, -50+i13^0 >= 0, cost: 101
  31: l8 -> l7 : TRUE, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  24: l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
  31: l8 -> l7 : TRUE, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Eliminating location l7 by chaining:

Applied chaining
First rule:
l8 -> l7 : TRUE, cost: 1
Second rule:
l7 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 1
New rule:
l8 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 24 31

Eliminated locations on linear paths
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  44: l8 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 2
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l8 -> l8 : i13^0'=1+i13^0, -49+i13^0 <= 0, cost: 2
New rule:
l8 -> l8 : i13^0'=i13^0+n0, (n0 >= 0 /\ 50-i13^0-n0 >= 0), cost: 2*n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_hkoKaL.txt

Applied instantiation
Original rule:
l8 -> l8 : i13^0'=i13^0+n0, (n0 >= 0 /\ 50-i13^0-n0 >= 0), cost: 2*n0
New rule:
l8 -> l8 : i13^0'=50, (0 >= 0 /\ 50-i13^0 >= 0), cost: 100-2*i13^0

Applied simplification
Original rule:
l8 -> l8 : i13^0'=50, (0 >= 0 /\ 50-i13^0 >= 0), cost: 100-2*i13^0
New rule:
l8 -> l8 : i13^0'=50, -50+i13^0 <= 0, cost: 100-2*i13^0

Applied deletion
Removed the following rules: 44

Accelerated simple loops
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  46: l8 -> l8 : i13^0'=50, -50+i13^0 <= 0, cost: 100-2*i13^0
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
Second rule:
l8 -> l8 : i13^0'=50, -50+i13^0 <= 0, cost: 100-2*i13^0
New rule:
l11 -> l8 : i13^0'=50, -50+i11^0 >= 0, cost: 101

Applied deletion
Removed the following rules: 46

Chained accelerated rules with incoming rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  26: l11 -> l8 : i13^0'=0, -50+i11^0 >= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  47: l11 -> l8 : i13^0'=50, -50+i11^0 >= 0, cost: 101
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  27: l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
  28: l12 -> l11 : TRUE, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Eliminating location l11 by chaining:

Applied chaining
First rule:
l12 -> l11 : TRUE, cost: 1
Second rule:
l11 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 1
New rule:
l12 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 27 28

Eliminated locations on linear paths
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  48: l12 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 2
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l12 -> l12 : i11^0'=1+i11^0, -49+i11^0 <= 0, cost: 2
New rule:
l12 -> l12 : i11^0'=i11^0+n1, (50-i11^0-n1 >= 0 /\ n1 >= 0), cost: 2*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_PCNcjG.txt

Applied instantiation
Original rule:
l12 -> l12 : i11^0'=i11^0+n1, (50-i11^0-n1 >= 0 /\ n1 >= 0), cost: 2*n1
New rule:
l12 -> l12 : i11^0'=50, (0 >= 0 /\ 50-i11^0 >= 0), cost: 100-2*i11^0

Applied simplification
Original rule:
l12 -> l12 : i11^0'=50, (0 >= 0 /\ 50-i11^0 >= 0), cost: 100-2*i11^0
New rule:
l12 -> l12 : i11^0'=50, -50+i11^0 <= 0, cost: 100-2*i11^0

Applied deletion
Removed the following rules: 48

Accelerated simple loops
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  50: l12 -> l12 : i11^0'=50, -50+i11^0 <= 0, cost: 100-2*i11^0
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
Second rule:
l12 -> l12 : i11^0'=50, -50+i11^0 <= 0, cost: 100-2*i11^0
New rule:
l10 -> l12 : i11^0'=50, -50+i^0 >= 0, cost: 101

Applied deletion
Removed the following rules: 50

Chained accelerated rules with incoming rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  29: l10 -> l12 : i11^0'=0, -50+i^0 >= 0, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  51: l10 -> l12 : i11^0'=50, -50+i^0 >= 0, cost: 101
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  25: l9 -> l10 : TRUE, cost: 1
  30: l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Eliminating location l10 by chaining:

Applied chaining
First rule:
l9 -> l10 : TRUE, cost: 1
Second rule:
l10 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 1
New rule:
l9 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 25 30

Eliminated locations on linear paths
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  52: l9 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l9 -> l9 : i^0'=1+i^0, -49+i^0 <= 0, cost: 2
New rule:
l9 -> l9 : i^0'=i^0+n2, (50-i^0-n2 >= 0 /\ n2 >= 0), cost: 2*n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jDBhko.txt

Applied instantiation
Original rule:
l9 -> l9 : i^0'=i^0+n2, (50-i^0-n2 >= 0 /\ n2 >= 0), cost: 2*n2
New rule:
l9 -> l9 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0

Applied simplification
Original rule:
l9 -> l9 : i^0'=50, (0 >= 0 /\ 50-i^0 >= 0), cost: 100-2*i^0
New rule:
l9 -> l9 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0

Applied deletion
Removed the following rules: 52

Accelerated simple loops
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  54: l9 -> l9 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
Second rule:
l9 -> l9 : i^0'=50, -50+i^0 <= 0, cost: 100-2*i^0
New rule:
l6 -> l9 : i^0'=50, -50+i9^0 >= 0, cost: 101

Applied deletion
Removed the following rules: 54

Chained accelerated rules with incoming rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  32: l6 -> l9 : i^0'=0, -50+i9^0 >= 0, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  55: l6 -> l9 : i^0'=50, -50+i9^0 >= 0, cost: 101
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  22: l5 -> l6 : TRUE, cost: 1
  33: l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Eliminating location l6 by chaining:

Applied chaining
First rule:
l5 -> l6 : TRUE, cost: 1
Second rule:
l6 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 1
New rule:
l5 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 22 33

Eliminated locations on linear paths
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  56: l5 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 2
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l5 -> l5 : i9^0'=1+i9^0, -49+i9^0 <= 0, cost: 2
New rule:
l5 -> l5 : i9^0'=i9^0+n3, (50-i9^0-n3 >= 0 /\ n3 >= 0), cost: 2*n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_fHBhjo.txt

Applied instantiation
Original rule:
l5 -> l5 : i9^0'=i9^0+n3, (50-i9^0-n3 >= 0 /\ n3 >= 0), cost: 2*n3
New rule:
l5 -> l5 : i9^0'=50, (0 >= 0 /\ 50-i9^0 >= 0), cost: 100-2*i9^0

Applied simplification
Original rule:
l5 -> l5 : i9^0'=50, (0 >= 0 /\ 50-i9^0 >= 0), cost: 100-2*i9^0
New rule:
l5 -> l5 : i9^0'=50, -50+i9^0 <= 0, cost: 100-2*i9^0

Applied deletion
Removed the following rules: 56

Accelerated simple loops
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  58: l5 -> l5 : i9^0'=50, -50+i9^0 <= 0, cost: 100-2*i9^0
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
Second rule:
l5 -> l5 : i9^0'=50, -50+i9^0 <= 0, cost: 100-2*i9^0
New rule:
l1 -> l5 : i9^0'=50, -50+i7^0 >= 0, cost: 101

Applied deletion
Removed the following rules: 58

Chained accelerated rules with incoming rules
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  35: l1 -> l5 : i9^0'=0, -50+i7^0 >= 0, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  59: l1 -> l5 : i9^0'=50, -50+i7^0 >= 0, cost: 101
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Removed unreachable locations and irrelevant leafs
Start location: l14
  20: l0 -> l1 : TRUE, cost: 1
  36: l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Eliminating location l1 by chaining:

Applied chaining
First rule:
l0 -> l1 : TRUE, cost: 1
Second rule:
l1 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 1
New rule:
l0 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 20 36

Eliminated locations on linear paths
Start location: l14
  60: l0 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 2
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : i7^0'=1+i7^0, -49+i7^0 <= 0, cost: 2
New rule:
l0 -> l0 : i7^0'=n4+i7^0, (n4 >= 0 /\ 50-n4-i7^0 >= 0), cost: 2*n4
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jdgohl.txt

Applied instantiation
Original rule:
l0 -> l0 : i7^0'=n4+i7^0, (n4 >= 0 /\ 50-n4-i7^0 >= 0), cost: 2*n4
New rule:
l0 -> l0 : i7^0'=50, (0 >= 0 /\ 50-i7^0 >= 0), cost: 100-2*i7^0

Applied simplification
Original rule:
l0 -> l0 : i7^0'=50, (0 >= 0 /\ 50-i7^0 >= 0), cost: 100-2*i7^0
New rule:
l0 -> l0 : i7^0'=50, -50+i7^0 <= 0, cost: 100-2*i7^0

Applied deletion
Removed the following rules: 60

Accelerated simple loops
Start location: l14
  62: l0 -> l0 : i7^0'=50, -50+i7^0 <= 0, cost: 100-2*i7^0
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2


Applied chaining
First rule:
l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2
Second rule:
l0 -> l0 : i7^0'=50, -50+i7^0 <= 0, cost: 100-2*i7^0
New rule:
l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=50, (0 == 0 /\ -50 <= 0), cost: 102

Applied deletion
Removed the following rules: 62

Chained accelerated rules with incoming rules
Start location: l14
  39: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=0, 0 == 0, cost: 2
  63: l14 -> l0 : i^0'=0, tmp___0^0'=tmp___0^post18, tmp^0'=tmp^post18, i7^0'=50, (0 == 0 /\ -50 <= 0), cost: 102


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


Computing asymptotic complexity

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

Solved cost: 0
Rule cost:   0