NO

Initial ITS
Start location: l28
   0: l0 -> l1 : __lengthofvisited^0'=__lengthofvisited^post0, j^0'=j^post0, sourceflag^0'=sourceflag^post0, edgecount^0'=edgecount^post0, k_1^0'=k_1^post0, i^0'=i^post0, nodecount^0'=nodecount^post0, destflag^0'=destflag^post0, k^0'=k^post0, h^0'=h^post0, min^0'=min^post0, (-i^post0+i^0 == 0 /\ k_1^0-k_1^post0 == 0 /\ h^0-h^post0 == 0 /\ -destflag^post0+destflag^0 == 0 /\ sourceflag^0-sourceflag^post0 == 0 /\ edgecount^0-edgecount^post0 == 0 /\ j^0-j^post0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post0 == 0 /\ -min^post0+min^0 == 0 /\ -k^post0+k^0 == 0 /\ nodecount^0-nodecount^post0 == 0), cost: 1
  42: l1 -> l2 : __lengthofvisited^0'=__lengthofvisited^post42, j^0'=j^post42, sourceflag^0'=sourceflag^post42, edgecount^0'=edgecount^post42, k_1^0'=k_1^post42, i^0'=i^post42, nodecount^0'=nodecount^post42, destflag^0'=destflag^post42, k^0'=k^post42, h^0'=h^post42, min^0'=min^post42, (-h^post42+h^0 == 0 /\ -k_1^post42+k_1^0 == 0 /\ edgecount^0-edgecount^post42 == 0 /\ sourceflag^0-sourceflag^post42 == 0 /\ j^0-j^post42 == 0 /\ -i^0+nodecount^0 <= 0 /\ -nodecount^post42+nodecount^0 == 0 /\ -min^post42+min^0 == 0 /\ k^0-k^post42 == 0 /\ __lengthofvisited^0-__lengthofvisited^post42 == 0 /\ i^post42 == 0 /\ -destflag^post42+destflag^0 == 0), cost: 1
  43: l1 -> l0 : __lengthofvisited^0'=__lengthofvisited^post43, j^0'=j^post43, sourceflag^0'=sourceflag^post43, edgecount^0'=edgecount^post43, k_1^0'=k_1^post43, i^0'=i^post43, nodecount^0'=nodecount^post43, destflag^0'=destflag^post43, k^0'=k^post43, h^0'=h^post43, min^0'=min^post43, (-min^post43+min^0 == 0 /\ -k^post43+k^0 == 0 /\ 1+i^0-nodecount^0 <= 0 /\ h^0-h^post43 == 0 /\ edgecount^0-edgecount^post43 == 0 /\ -destflag^post43+destflag^0 == 0 /\ nodecount^0-nodecount^post43 == 0 /\ sourceflag^0-sourceflag^post43 == 0 /\ -j^post43+j^0 == 0 /\ k_1^0-k_1^post43 == 0 /\ __lengthofvisited^0-__lengthofvisited^post43 == 0 /\ -1+i^post43-i^0 == 0), cost: 1
   1: l2 -> l3 : __lengthofvisited^0'=__lengthofvisited^post1, j^0'=j^post1, sourceflag^0'=sourceflag^post1, edgecount^0'=edgecount^post1, k_1^0'=k_1^post1, i^0'=i^post1, nodecount^0'=nodecount^post1, destflag^0'=destflag^post1, k^0'=k^post1, h^0'=h^post1, min^0'=min^post1, (-min^post1+min^0 == 0 /\ nodecount^0-nodecount^post1 == 0 /\ -k^post1+k^0 == 0 /\ -edgecount^post1+edgecount^0 == 0 /\ -destflag^post1+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post1 == 0 /\ i^0-i^post1 == 0 /\ -k_1^post1+k_1^0 == 0 /\ j^0-j^post1 == 0 /\ -h^post1+h^0 == 0 /\ sourceflag^0-sourceflag^post1 == 0), cost: 1
  39: l3 -> l4 : __lengthofvisited^0'=__lengthofvisited^post39, j^0'=j^post39, sourceflag^0'=sourceflag^post39, edgecount^0'=edgecount^post39, k_1^0'=k_1^post39, i^0'=i^post39, nodecount^0'=nodecount^post39, destflag^0'=destflag^post39, k^0'=k^post39, h^0'=h^post39, min^0'=min^post39, (-h^post39+h^0 == 0 /\ -k_1^post39+k_1^0 == 0 /\ -nodecount^post39+nodecount^0 == 0 /\ -edgecount^post39+edgecount^0 == 0 /\ j^0-j^post39 == 0 /\ -min^post39+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post39 == 0 /\ -1-i^0+nodecount^0 <= 0 /\ sourceflag^0-sourceflag^post39 == 0 /\ destflag^0-destflag^post39 == 0 /\ i^0-i^post39 == 0 /\ k^post39 == 0), cost: 1
  40: l3 -> l2 : __lengthofvisited^0'=__lengthofvisited^post40, j^0'=j^post40, sourceflag^0'=sourceflag^post40, edgecount^0'=edgecount^post40, k_1^0'=k_1^post40, i^0'=i^post40, nodecount^0'=nodecount^post40, destflag^0'=destflag^post40, k^0'=k^post40, h^0'=h^post40, min^0'=min^post40, (2+i^0-nodecount^0 <= 0 /\ h^0-h^post40 == 0 /\ sourceflag^0-sourceflag^post40 == 0 /\ -destflag^post40+destflag^0 == 0 /\ edgecount^0-edgecount^post40 == 0 /\ -1+i^post40-i^0 == 0 /\ j^0-j^post40 == 0 /\ -min^post40+min^0 == 0 /\ -k^post40+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post40 == 0 /\ k_1^0-k_1^post40 == 0 /\ nodecount^0-nodecount^post40 == 0), cost: 1
   2: l4 -> l5 : __lengthofvisited^0'=__lengthofvisited^post2, j^0'=j^post2, sourceflag^0'=sourceflag^post2, edgecount^0'=edgecount^post2, k_1^0'=k_1^post2, i^0'=i^post2, nodecount^0'=nodecount^post2, destflag^0'=destflag^post2, k^0'=k^post2, h^0'=h^post2, min^0'=min^post2, (-h^post2+h^0 == 0 /\ -k_1^post2+k_1^0 == 0 /\ k^0-k^post2 == 0 /\ -nodecount^post2+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post2 == 0 /\ -min^post2+min^0 == 0 /\ edgecount^0-edgecount^post2 == 0 /\ destflag^0-destflag^post2 == 0 /\ -sourceflag^post2+sourceflag^0 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1
  36: l5 -> l26 : __lengthofvisited^0'=__lengthofvisited^post36, j^0'=j^post36, sourceflag^0'=sourceflag^post36, edgecount^0'=edgecount^post36, k_1^0'=k_1^post36, i^0'=i^post36, nodecount^0'=nodecount^post36, destflag^0'=destflag^post36, k^0'=k^post36, h^0'=h^post36, min^0'=min^post36, (i^0-i^post36 == 0 /\ -k^post36+k^0 == 0 /\ nodecount^0-nodecount^post36 == 0 /\ -1+nodecount^0-k^0 <= 0 /\ -edgecount^post36+edgecount^0 == 0 /\ -destflag^post36+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post36 == 0 /\ -min^post36+min^0 == 0 /\ -k_1^post36+k_1^0 == 0 /\ j^0-j^post36 == 0 /\ -h^post36+h^0 == 0 /\ 1-nodecount^0+k^0 <= 0 /\ sourceflag^0-sourceflag^post36 == 0), cost: 1
  37: l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post37, j^0'=j^post37, sourceflag^0'=sourceflag^post37, edgecount^0'=edgecount^post37, k_1^0'=k_1^post37, i^0'=i^post37, nodecount^0'=nodecount^post37, destflag^0'=destflag^post37, k^0'=k^post37, h^0'=h^post37, min^0'=min^post37, (-k_1^post37+k_1^0 == 0 /\ -h^post37+h^0 == 0 /\ -nodecount^post37+nodecount^0 == 0 /\ k^0-k^post37 == 0 /\ -min^post37+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post37 == 0 /\ edgecount^0-edgecount^post37 == 0 /\ sourceflag^0-sourceflag^post37 == 0 /\ nodecount^0-k^0 <= 0 /\ j^0-j^post37 == 0 /\ i^0-i^post37 == 0 /\ -destflag^post37+destflag^0 == 0), cost: 1
  38: l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post38, j^0'=j^post38, sourceflag^0'=sourceflag^post38, edgecount^0'=edgecount^post38, k_1^0'=k_1^post38, i^0'=i^post38, nodecount^0'=nodecount^post38, destflag^0'=destflag^post38, k^0'=k^post38, h^0'=h^post38, min^0'=min^post38, (-i^post38+i^0 == 0 /\ -k^post38+k^0 == 0 /\ -min^post38+min^0 == 0 /\ h^0-h^post38 == 0 /\ edgecount^0-edgecount^post38 == 0 /\ nodecount^0-nodecount^post38 == 0 /\ sourceflag^0-sourceflag^post38 == 0 /\ -destflag^post38+destflag^0 == 0 /\ -j^post38+j^0 == 0 /\ k_1^0-k_1^post38 == 0 /\ 2-nodecount^0+k^0 <= 0 /\ __lengthofvisited^0-__lengthofvisited^post38 == 0), cost: 1
   3: l6 -> l7 : __lengthofvisited^0'=__lengthofvisited^post3, j^0'=j^post3, sourceflag^0'=sourceflag^post3, edgecount^0'=edgecount^post3, k_1^0'=k_1^post3, i^0'=i^post3, nodecount^0'=nodecount^post3, destflag^0'=destflag^post3, k^0'=k^post3, h^0'=h^post3, min^0'=min^post3, (-i^post3+i^0 == 0 /\ -1-k_1^0+k_1^post3 == 0 /\ h^0-h^post3 == 0 /\ edgecount^0-edgecount^post3 == 0 /\ sourceflag^0-sourceflag^post3 == 0 /\ -destflag^post3+destflag^0 == 0 /\ j^0-j^post3 == 0 /\ __lengthofvisited^0-__lengthofvisited^post3 == 0 /\ -min^post3+min^0 == 0 /\ -k^post3+k^0 == 0 /\ nodecount^0-nodecount^post3 == 0), cost: 1
  18: l7 -> l18 : __lengthofvisited^0'=__lengthofvisited^post18, j^0'=j^post18, sourceflag^0'=sourceflag^post18, edgecount^0'=edgecount^post18, k_1^0'=k_1^post18, i^0'=i^post18, nodecount^0'=nodecount^post18, destflag^0'=destflag^post18, k^0'=k^post18, h^0'=h^post18, min^0'=min^post18, (sourceflag^0-sourceflag^post18 == 0 /\ nodecount^0-nodecount^post18 == 0 /\ i^0-i^post18 == 0 /\ j^0-j^post18 == 0 /\ -min^post18+min^0 == 0 /\ -k^post18+k^0 == 0 /\ k_1^0-k_1^post18 == 0 /\ -destflag^post18+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post18 == 0 /\ -h^post18+h^0 == 0 /\ -edgecount^post18+edgecount^0 == 0), cost: 1
   4: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post4, j^0'=j^post4, sourceflag^0'=sourceflag^post4, edgecount^0'=edgecount^post4, k_1^0'=k_1^post4, i^0'=i^post4, nodecount^0'=nodecount^post4, destflag^0'=destflag^post4, k^0'=k^post4, h^0'=h^post4, min^0'=min^post4, (-edgecount^post4+edgecount^0 == 0 /\ -destflag^post4+destflag^0 == 0 /\ -min^post4+min^0 == 0 /\ -h^post4+h^0 == 0 /\ 1-destflag^0 <= 0 /\ -k_1^post4+k_1^0 == 0 /\ j^0-j^post4 == 0 /\ __lengthofvisited^0-__lengthofvisited^post4 == 0 /\ -nodecount^post4+nodecount^0 == 0 /\ i^0-i^post4 == 0 /\ sourceflag^0-sourceflag^post4 == 0 /\ k^0-k^post4 == 0), cost: 1
   5: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post5, j^0'=j^post5, sourceflag^0'=sourceflag^post5, edgecount^0'=edgecount^post5, k_1^0'=k_1^post5, i^0'=i^post5, nodecount^0'=nodecount^post5, destflag^0'=destflag^post5, k^0'=k^post5, h^0'=h^post5, min^0'=min^post5, (-i^post5+i^0 == 0 /\ h^0-h^post5 == 0 /\ -destflag^post5+destflag^0 == 0 /\ sourceflag^0-sourceflag^post5 == 0 /\ 1+destflag^0 <= 0 /\ edgecount^0-edgecount^post5 == 0 /\ k_1^0-k_1^post5 == 0 /\ j^0-j^post5 == 0 /\ __lengthofvisited^0-__lengthofvisited^post5 == 0 /\ -min^post5+min^0 == 0 /\ -k^post5+k^0 == 0 /\ nodecount^0-nodecount^post5 == 0), cost: 1
   6: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post6, j^0'=j^post6, sourceflag^0'=sourceflag^post6, edgecount^0'=edgecount^post6, k_1^0'=k_1^post6, i^0'=i^post6, nodecount^0'=nodecount^post6, destflag^0'=destflag^post6, k^0'=k^post6, h^0'=h^post6, min^0'=min^post6, (-k^post6+k^0 == 0 /\ -edgecount^post6+edgecount^0 == 0 /\ -destflag^post6+destflag^0 == 0 /\ -destflag^0 <= 0 /\ -min^post6+min^0 == 0 /\ j^0-j^post6 == 0 /\ i^0-i^post6 == 0 /\ -k_1^post6+k_1^0 == 0 /\ destflag^0 <= 0 /\ -h^post6+h^0 == 0 /\ -__lengthofvisited^post6+__lengthofvisited^0 == 0 /\ -nodecount^post6+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post6 == 0), cost: 1
   7: l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post7, j^0'=j^post7, sourceflag^0'=sourceflag^post7, edgecount^0'=edgecount^post7, k_1^0'=k_1^post7, i^0'=i^post7, nodecount^0'=nodecount^post7, destflag^0'=destflag^post7, k^0'=k^post7, h^0'=h^post7, min^0'=min^post7, (1-sourceflag^0 <= 0 /\ -h^post7+h^0 == 0 /\ edgecount^0-edgecount^post7 == 0 /\ sourceflag^0-sourceflag^post7 == 0 /\ j^0-j^post7 == 0 /\ -nodecount^post7+nodecount^0 == 0 /\ k^0-k^post7 == 0 /\ k_1^0-k_1^post7 == 0 /\ __lengthofvisited^0-__lengthofvisited^post7 == 0 /\ -min^post7+min^0 == 0 /\ destflag^0-destflag^post7 == 0 /\ i^0-i^post7 == 0), cost: 1
   8: l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post8, j^0'=j^post8, sourceflag^0'=sourceflag^post8, edgecount^0'=edgecount^post8, k_1^0'=k_1^post8, i^0'=i^post8, nodecount^0'=nodecount^post8, destflag^0'=destflag^post8, k^0'=k^post8, h^0'=h^post8, min^0'=min^post8, (-i^post8+i^0 == 0 /\ h^0-h^post8 == 0 /\ sourceflag^0-sourceflag^post8 == 0 /\ edgecount^0-edgecount^post8 == 0 /\ -destflag^post8+destflag^0 == 0 /\ j^0-j^post8 == 0 /\ -min^post8+min^0 == 0 /\ k_1^0-k_1^post8 == 0 /\ __lengthofvisited^0-__lengthofvisited^post8 == 0 /\ -k^post8+k^0 == 0 /\ 1+sourceflag^0 <= 0 /\ nodecount^0-nodecount^post8 == 0), cost: 1
   9: l9 -> l8 : __lengthofvisited^0'=__lengthofvisited^post9, j^0'=j^post9, sourceflag^0'=sourceflag^post9, edgecount^0'=edgecount^post9, k_1^0'=k_1^post9, i^0'=i^post9, nodecount^0'=nodecount^post9, destflag^0'=destflag^post9, k^0'=k^post9, h^0'=h^post9, min^0'=min^post9, (-sourceflag^0 <= 0 /\ -edgecount^post9+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post9 == 0 /\ -destflag^post9+destflag^0 == 0 /\ sourceflag^0 <= 0 /\ -min^post9+min^0 == 0 /\ -k^post9+k^0 == 0 /\ i^0-i^post9 == 0 /\ -h^post9+h^0 == 0 /\ -k_1^post9+k_1^0 == 0 /\ j^0-j^post9 == 0 /\ -nodecount^post9+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post9 == 0), cost: 1
  10: l10 -> l11 : __lengthofvisited^0'=__lengthofvisited^post10, j^0'=j^post10, sourceflag^0'=sourceflag^post10, edgecount^0'=edgecount^post10, k_1^0'=k_1^post10, i^0'=i^post10, nodecount^0'=nodecount^post10, destflag^0'=destflag^post10, k^0'=k^post10, h^0'=h^post10, min^0'=min^post10, (-i^post10+i^0 == 0 /\ edgecount^0-edgecount^post10 == 0 /\ sourceflag^0-sourceflag^post10 == 0 /\ j^0-j^post10 == 0 /\ h^0-h^post10 == 0 /\ -destflag^post10+destflag^0 == 0 /\ k_1^0-k_1^post10 == 0 /\ -min^post10+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post10 == 0 /\ -k^post10+k^0 == 0 /\ nodecount^0-nodecount^post10 == 0), cost: 1
  32: l11 -> l7 : __lengthofvisited^0'=__lengthofvisited^post32, j^0'=j^post32, sourceflag^0'=sourceflag^post32, edgecount^0'=edgecount^post32, k_1^0'=k_1^post32, i^0'=i^post32, nodecount^0'=nodecount^post32, destflag^0'=destflag^post32, k^0'=k^post32, h^0'=h^post32, min^0'=min^post32, (-h^post32+h^0 == 0 /\ k_1^post32 == 0 /\ -nodecount^post32+nodecount^0 == 0 /\ k^0-k^post32 == 0 /\ -min^post32+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post32 == 0 /\ edgecount^0-edgecount^post32 == 0 /\ sourceflag^0-sourceflag^post32 == 0 /\ j^0-j^post32 == 0 /\ i^0-i^post32 == 0 /\ -destflag^post32+destflag^0 == 0 /\ edgecount^0-i^0 <= 0), cost: 1
  33: l11 -> l10 : __lengthofvisited^0'=__lengthofvisited^post33, j^0'=j^post33, sourceflag^0'=sourceflag^post33, edgecount^0'=edgecount^post33, k_1^0'=k_1^post33, i^0'=i^post33, nodecount^0'=nodecount^post33, destflag^0'=destflag^post33, k^0'=k^post33, h^0'=h^post33, min^0'=min^post33, (-min^post33+min^0 == 0 /\ nodecount^0-nodecount^post33 == 0 /\ -k^post33+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post33 == 0 /\ -1+i^post33-i^0 == 0 /\ edgecount^0-edgecount^post33 == 0 /\ -destflag^post33+destflag^0 == 0 /\ sourceflag^0-sourceflag^post33 == 0 /\ -h^post33+h^0 == 0 /\ 1-edgecount^0+i^0 <= 0 /\ -j^post33+j^0 == 0 /\ k_1^0-k_1^post33 == 0), cost: 1
  11: l12 -> l13 : __lengthofvisited^0'=__lengthofvisited^post11, j^0'=j^post11, sourceflag^0'=sourceflag^post11, edgecount^0'=edgecount^post11, k_1^0'=k_1^post11, i^0'=i^post11, nodecount^0'=nodecount^post11, destflag^0'=destflag^post11, k^0'=k^post11, h^0'=h^post11, min^0'=min^post11, (-edgecount^post11+edgecount^0 == 0 /\ -1-j^0+j^post11 == 0 /\ __lengthofvisited^0-__lengthofvisited^post11 == 0 /\ -destflag^post11+destflag^0 == 0 /\ -min^post11+min^0 == 0 /\ -k^post11+k^0 == 0 /\ i^0-i^post11 == 0 /\ -k_1^post11+k_1^0 == 0 /\ -h^post11+h^0 == 0 /\ -nodecount^post11+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post11 == 0), cost: 1
  41: l13 -> l15 : __lengthofvisited^0'=__lengthofvisited^post41, j^0'=j^post41, sourceflag^0'=sourceflag^post41, edgecount^0'=edgecount^post41, k_1^0'=k_1^post41, i^0'=i^post41, nodecount^0'=nodecount^post41, destflag^0'=destflag^post41, k^0'=k^post41, h^0'=h^post41, min^0'=min^post41, (-edgecount^post41+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post41 == 0 /\ -destflag^post41+destflag^0 == 0 /\ -min^post41+min^0 == 0 /\ -k^post41+k^0 == 0 /\ i^0-i^post41 == 0 /\ j^0-j^post41 == 0 /\ -h^post41+h^0 == 0 /\ -k_1^post41+k_1^0 == 0 /\ -nodecount^post41+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post41 == 0), cost: 1
  12: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post12, j^0'=j^post12, sourceflag^0'=sourceflag^post12, edgecount^0'=edgecount^post12, k_1^0'=k_1^post12, i^0'=i^post12, nodecount^0'=nodecount^post12, destflag^0'=destflag^post12, k^0'=k^post12, h^0'=h^post12, min^0'=min^post12, (-h^post12+h^0 == 0 /\ edgecount^0-edgecount^post12 == 0 /\ destflag^0-destflag^post12 == 0 /\ __lengthofvisited^0-__lengthofvisited^post12 == 0 /\ sourceflag^0-sourceflag^post12 == 0 /\ -nodecount^post12+nodecount^0 == 0 /\ j^0-j^post12 == 0 /\ -min^post12+min^0 == 0 /\ -k^post12+k^0 == 0 /\ k_1^0-k_1^post12 == 0 /\ -i^post12+i^0 == 0), cost: 1
  13: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post13, j^0'=j^post13, sourceflag^0'=sourceflag^post13, edgecount^0'=edgecount^post13, k_1^0'=k_1^post13, i^0'=i^post13, nodecount^0'=nodecount^post13, destflag^0'=destflag^post13, k^0'=k^post13, h^0'=h^post13, min^0'=min^post13, (destflag^post13 == 0 /\ -i^post13+i^0 == 0 /\ j^0-j^post13 == 0 /\ h^0-h^post13 == 0 /\ sourceflag^0-sourceflag^post13 == 0 /\ __lengthofvisited^0-__lengthofvisited^post13 == 0 /\ -k^post13+k^0 == 0 /\ -min^post13+min^0 == 0 /\ k_1^0-k_1^post13 == 0 /\ -edgecount^post13+edgecount^0 == 0 /\ nodecount^0-nodecount^post13 == 0), cost: 1
  14: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post14, j^0'=j^post14, sourceflag^0'=sourceflag^post14, edgecount^0'=edgecount^post14, k_1^0'=k_1^post14, i^0'=i^post14, nodecount^0'=nodecount^post14, destflag^0'=destflag^post14, k^0'=k^post14, h^0'=h^post14, min^0'=min^post14, (-edgecount^post14+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post14 == 0 /\ -destflag^post14+destflag^0 == 0 /\ -min^post14+min^0 == 0 /\ -k^post14+k^0 == 0 /\ i^0-i^post14 == 0 /\ j^0-j^post14 == 0 /\ -k_1^post14+k_1^0 == 0 /\ -h^post14+h^0 == 0 /\ -nodecount^post14+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post14 == 0), cost: 1
  15: l15 -> l9 : __lengthofvisited^0'=__lengthofvisited^post15, j^0'=j^post15, sourceflag^0'=sourceflag^post15, edgecount^0'=edgecount^post15, k_1^0'=k_1^post15, i^0'=i^post15, nodecount^0'=nodecount^post15, destflag^0'=destflag^post15, k^0'=k^post15, h^0'=h^post15, min^0'=min^post15, (-h^post15+h^0 == 0 /\ destflag^0-destflag^post15 == 0 /\ edgecount^0-edgecount^post15 == 0 /\ sourceflag^0-sourceflag^post15 == 0 /\ j^0-j^post15 == 0 /\ -nodecount^post15+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post15 == 0 /\ k_1^0-k_1^post15 == 0 /\ -i^post15+i^0 == 0 /\ -j^0+nodecount^0 <= 0 /\ -k^post15+k^0 == 0 /\ -min^post15+min^0 == 0), cost: 1
  16: l15 -> l14 : __lengthofvisited^0'=__lengthofvisited^post16, j^0'=j^post16, sourceflag^0'=sourceflag^post16, edgecount^0'=edgecount^post16, k_1^0'=k_1^post16, i^0'=i^post16, nodecount^0'=nodecount^post16, destflag^0'=destflag^post16, k^0'=k^post16, h^0'=h^post16, min^0'=min^post16, (__lengthofvisited^0-__lengthofvisited^post16 == 0 /\ -destflag^post16+destflag^0 == 0 /\ -h^post16+h^0 == 0 /\ -k^post16+k^0 == 0 /\ -min^post16+min^0 == 0 /\ j^0-j^post16 == 0 /\ i^0-i^post16 == 0 /\ -k_1^post16+k_1^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -nodecount^post16+nodecount^0 == 0 /\ edgecount^0-edgecount^post16 == 0 /\ sourceflag^0-sourceflag^post16 == 0), cost: 1
  17: l16 -> l17 : __lengthofvisited^0'=__lengthofvisited^post17, j^0'=j^post17, sourceflag^0'=sourceflag^post17, edgecount^0'=edgecount^post17, k_1^0'=k_1^post17, i^0'=i^post17, nodecount^0'=nodecount^post17, destflag^0'=destflag^post17, k^0'=k^post17, h^0'=h^post17, min^0'=min^post17, (-h^post17+h^0 == 0 /\ edgecount^0-edgecount^post17 == 0 /\ __lengthofvisited^0-__lengthofvisited^post17 == 0 /\ destflag^0-destflag^post17 == 0 /\ sourceflag^0-sourceflag^post17 == 0 /\ -nodecount^post17+nodecount^0 == 0 /\ -min^post17+min^0 == 0 /\ -k^post17+k^0 == 0 /\ k_1^0-k_1^post17 == 0 /\ -i^post17+i^0 == 0 /\ -1-j^0+j^post17 == 0), cost: 1
  34: l17 -> l20 : __lengthofvisited^0'=__lengthofvisited^post34, j^0'=j^post34, sourceflag^0'=sourceflag^post34, edgecount^0'=edgecount^post34, k_1^0'=k_1^post34, i^0'=i^post34, nodecount^0'=nodecount^post34, destflag^0'=destflag^post34, k^0'=k^post34, h^0'=h^post34, min^0'=min^post34, (-h^post34+h^0 == 0 /\ -k_1^post34+k_1^0 == 0 /\ k^0-k^post34 == 0 /\ -nodecount^post34+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post34 == 0 /\ -min^post34+min^0 == 0 /\ edgecount^0-edgecount^post34 == 0 /\ destflag^0-destflag^post34 == 0 /\ j^0-j^post34 == 0 /\ i^0-i^post34 == 0 /\ -sourceflag^post34+sourceflag^0 == 0), cost: 1
  30: l18 -> l4 : __lengthofvisited^0'=__lengthofvisited^post30, j^0'=j^post30, sourceflag^0'=sourceflag^post30, edgecount^0'=edgecount^post30, k_1^0'=k_1^post30, i^0'=i^post30, nodecount^0'=nodecount^post30, destflag^0'=destflag^post30, k^0'=k^post30, h^0'=h^post30, min^0'=min^post30, (-i^post30+i^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post30 == 0 /\ -1+k^post30-k^0 == 0 /\ edgecount^0-edgecount^post30 == 0 /\ sourceflag^0-sourceflag^post30 == 0 /\ edgecount^0-k_1^0 <= 0 /\ -destflag^post30+destflag^0 == 0 /\ j^0-j^post30 == 0 /\ k_1^0-k_1^post30 == 0 /\ -min^post30+min^0 == 0 /\ nodecount^0-nodecount^post30 == 0 /\ -h^post30+h^0 == 0), cost: 1
  31: l18 -> l22 : __lengthofvisited^0'=__lengthofvisited^post31, j^0'=j^post31, sourceflag^0'=sourceflag^post31, edgecount^0'=edgecount^post31, k_1^0'=k_1^post31, i^0'=i^post31, nodecount^0'=nodecount^post31, destflag^0'=destflag^post31, k^0'=k^post31, h^0'=h^post31, min^0'=min^post31, (i^0-i^post31 == 0 /\ nodecount^0-nodecount^post31 == 0 /\ -min^post31+min^0 == 0 /\ -k^post31+k^0 == 0 /\ j^0-j^post31 == 0 /\ h^post31 == 0 /\ -destflag^post31+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post31 == 0 /\ k_1^0-k_1^post31 == 0 /\ sourceflag^0-sourceflag^post31 == 0 /\ 1-edgecount^0+k_1^0 <= 0 /\ edgecount^0-edgecount^post31 == 0), cost: 1
  19: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post19, j^0'=j^post19, sourceflag^0'=sourceflag^post19, edgecount^0'=edgecount^post19, k_1^0'=k_1^post19, i^0'=i^post19, nodecount^0'=nodecount^post19, destflag^0'=destflag^post19, k^0'=k^post19, h^0'=h^post19, min^0'=min^post19, (__lengthofvisited^0-__lengthofvisited^post19 == 0 /\ -destflag^post19+destflag^0 == 0 /\ -min^post19+min^0 == 0 /\ -k^post19+k^0 == 0 /\ -edgecount^post19+edgecount^0 == 0 /\ j^0-j^post19 == 0 /\ -k_1^post19+k_1^0 == 0 /\ -h^post19+h^0 == 0 /\ i^0-i^post19 == 0 /\ -nodecount^post19+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post19 == 0), cost: 1
  20: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post20, j^0'=j^post20, sourceflag^0'=sourceflag^post20, edgecount^0'=edgecount^post20, k_1^0'=k_1^post20, i^0'=i^post20, nodecount^0'=nodecount^post20, destflag^0'=destflag^post20, k^0'=k^post20, h^0'=h^post20, min^0'=min^post20, (-1+sourceflag^post20 == 0 /\ edgecount^0-edgecount^post20 == 0 /\ destflag^0-destflag^post20 == 0 /\ j^0-j^post20 == 0 /\ -nodecount^post20+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post20 == 0 /\ k_1^0-k_1^post20 == 0 /\ -i^post20+i^0 == 0 /\ -h^post20+h^0 == 0 /\ -min^post20+min^0 == 0 /\ -k^post20+k^0 == 0), cost: 1
  21: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post21, j^0'=j^post21, sourceflag^0'=sourceflag^post21, edgecount^0'=edgecount^post21, k_1^0'=k_1^post21, i^0'=i^post21, nodecount^0'=nodecount^post21, destflag^0'=destflag^post21, k^0'=k^post21, h^0'=h^post21, min^0'=min^post21, (i^0-i^post21 == 0 /\ nodecount^0-nodecount^post21 == 0 /\ -k^post21+k^0 == 0 /\ j^0-j^post21 == 0 /\ -min^post21+min^0 == 0 /\ sourceflag^0-sourceflag^post21 == 0 /\ __lengthofvisited^0-__lengthofvisited^post21 == 0 /\ k_1^0-k_1^post21 == 0 /\ -destflag^post21+destflag^0 == 0 /\ -h^post21+h^0 == 0 /\ edgecount^0-edgecount^post21 == 0), cost: 1
  22: l20 -> l13 : __lengthofvisited^0'=__lengthofvisited^post22, j^0'=j^post22, sourceflag^0'=sourceflag^post22, edgecount^0'=edgecount^post22, k_1^0'=k_1^post22, i^0'=i^post22, nodecount^0'=nodecount^post22, destflag^0'=destflag^post22, k^0'=k^post22, h^0'=h^post22, min^0'=min^post22, (-h^post22+h^0 == 0 /\ sourceflag^0-sourceflag^post22 == 0 /\ edgecount^0-edgecount^post22 == 0 /\ __lengthofvisited^0-__lengthofvisited^post22 == 0 /\ -nodecount^post22+nodecount^0 == 0 /\ -min^post22+min^0 == 0 /\ -k^post22+k^0 == 0 /\ k_1^0-k_1^post22 == 0 /\ -i^post22+i^0 == 0 /\ -1+destflag^post22 == 0 /\ j^post22 == 0 /\ -j^0+nodecount^0 <= 0), cost: 1
  23: l20 -> l19 : __lengthofvisited^0'=__lengthofvisited^post23, j^0'=j^post23, sourceflag^0'=sourceflag^post23, edgecount^0'=edgecount^post23, k_1^0'=k_1^post23, i^0'=i^post23, nodecount^0'=nodecount^post23, destflag^0'=destflag^post23, k^0'=k^post23, h^0'=h^post23, min^0'=min^post23, (i^0-i^post23 == 0 /\ nodecount^0-nodecount^post23 == 0 /\ -min^post23+min^0 == 0 /\ -k^post23+k^0 == 0 /\ j^0-j^post23 == 0 /\ k_1^0-k_1^post23 == 0 /\ -destflag^post23+destflag^0 == 0 /\ sourceflag^0-sourceflag^post23 == 0 /\ __lengthofvisited^0-__lengthofvisited^post23 == 0 /\ -h^post23+h^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -edgecount^post23+edgecount^0 == 0), cost: 1
  24: l21 -> l22 : __lengthofvisited^0'=__lengthofvisited^post24, j^0'=j^post24, sourceflag^0'=sourceflag^post24, edgecount^0'=edgecount^post24, k_1^0'=k_1^post24, i^0'=i^post24, nodecount^0'=nodecount^post24, destflag^0'=destflag^post24, k^0'=k^post24, h^0'=h^post24, min^0'=min^post24, (__lengthofvisited^0-__lengthofvisited^post24 == 0 /\ k_1^0-k_1^post24 == 0 /\ -min^post24+min^0 == 0 /\ -nodecount^post24+nodecount^0 == 0 /\ -1+h^post24-h^0 == 0 /\ edgecount^0-edgecount^post24 == 0 /\ destflag^0-destflag^post24 == 0 /\ j^0-j^post24 == 0 /\ -sourceflag^post24+sourceflag^0 == 0 /\ i^0-i^post24 == 0 /\ k^0-k^post24 == 0), cost: 1
  27: l22 -> l24 : __lengthofvisited^0'=__lengthofvisited^post27, j^0'=j^post27, sourceflag^0'=sourceflag^post27, edgecount^0'=edgecount^post27, k_1^0'=k_1^post27, i^0'=i^post27, nodecount^0'=nodecount^post27, destflag^0'=destflag^post27, k^0'=k^post27, h^0'=h^post27, min^0'=min^post27, (__lengthofvisited^0-__lengthofvisited^post27 == 0 /\ -h^post27+h^0 == 0 /\ -k_1^post27+k_1^0 == 0 /\ -nodecount^post27+nodecount^0 == 0 /\ -k^post27+k^0 == 0 /\ -min^post27+min^0 == 0 /\ sourceflag^0-sourceflag^post27 == 0 /\ i^0-i^post27 == 0 /\ edgecount^0-edgecount^post27 == 0 /\ -destflag^post27+destflag^0 == 0 /\ j^0-j^post27 == 0), cost: 1
  25: l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post25, j^0'=j^post25, sourceflag^0'=sourceflag^post25, edgecount^0'=edgecount^post25, k_1^0'=k_1^post25, i^0'=i^post25, nodecount^0'=nodecount^post25, destflag^0'=destflag^post25, k^0'=k^post25, h^0'=h^post25, min^0'=min^post25, (destflag^0-destflag^post25 == 0 /\ -nodecount^post25+nodecount^0 == 0 /\ edgecount^0-edgecount^post25 == 0 /\ sourceflag^0-sourceflag^post25 == 0 /\ j^0-j^post25 == 0 /\ __lengthofvisited^0-__lengthofvisited^post25 == 0 /\ k_1^0-k_1^post25 == 0 /\ -i^post25+i^0 == 0 /\ -h^post25+h^0 == 0 /\ min^post25-h^0 == 0 /\ -k^post25+k^0 == 0), cost: 1
  26: l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post26, j^0'=j^post26, sourceflag^0'=sourceflag^post26, edgecount^0'=edgecount^post26, k_1^0'=k_1^post26, i^0'=i^post26, nodecount^0'=nodecount^post26, destflag^0'=destflag^post26, k^0'=k^post26, h^0'=h^post26, min^0'=min^post26, (nodecount^0-nodecount^post26 == 0 /\ i^0-i^post26 == 0 /\ -min^post26+min^0 == 0 /\ -k^post26+k^0 == 0 /\ j^0-j^post26 == 0 /\ -destflag^post26+destflag^0 == 0 /\ sourceflag^0-sourceflag^post26 == 0 /\ k_1^0-k_1^post26 == 0 /\ __lengthofvisited^0-__lengthofvisited^post26 == 0 /\ -h^post26+h^0 == 0 /\ edgecount^0-edgecount^post26 == 0), cost: 1
  28: l24 -> l17 : __lengthofvisited^0'=__lengthofvisited^post28, j^0'=j^post28, sourceflag^0'=sourceflag^post28, edgecount^0'=edgecount^post28, k_1^0'=k_1^post28, i^0'=i^post28, nodecount^0'=nodecount^post28, destflag^0'=destflag^post28, k^0'=k^post28, h^0'=h^post28, min^0'=min^post28, (-min^post28+min^0 == 0 /\ nodecount^0-nodecount^post28 == 0 /\ i^0-i^post28 == 0 /\ -k^post28+k^0 == 0 /\ j^post28 == 0 /\ -destflag^post28+destflag^0 == 0 /\ k_1^0-k_1^post28 == 0 /\ __lengthofvisited^0-__lengthofvisited^post28 == 0 /\ sourceflag^post28 == 0 /\ edgecount^0-h^0 <= 0 /\ -h^post28+h^0 == 0 /\ -edgecount^post28+edgecount^0 == 0), cost: 1
  29: l24 -> l23 : __lengthofvisited^0'=__lengthofvisited^post29, j^0'=j^post29, sourceflag^0'=sourceflag^post29, edgecount^0'=edgecount^post29, k_1^0'=k_1^post29, i^0'=i^post29, nodecount^0'=nodecount^post29, destflag^0'=destflag^post29, k^0'=k^post29, h^0'=h^post29, min^0'=min^post29, (-k_1^post29+k_1^0 == 0 /\ -h^post29+h^0 == 0 /\ k^0-k^post29 == 0 /\ -nodecount^post29+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post29 == 0 /\ -min^post29+min^0 == 0 /\ edgecount^0-edgecount^post29 == 0 /\ destflag^0-destflag^post29 == 0 /\ -sourceflag^post29+sourceflag^0 == 0 /\ j^0-j^post29 == 0 /\ i^0-i^post29 == 0 /\ 1-edgecount^0+h^0 <= 0), cost: 1
  35: l25 -> l10 : __lengthofvisited^0'=__lengthofvisited^post35, j^0'=j^post35, sourceflag^0'=sourceflag^post35, edgecount^0'=edgecount^post35, k_1^0'=k_1^post35, i^0'=i^post35, nodecount^0'=nodecount^post35, destflag^0'=destflag^post35, k^0'=k^post35, h^0'=h^post35, min^0'=min^post35, (i^post35 == 0 /\ h^0-h^post35 == 0 /\ sourceflag^0-sourceflag^post35 == 0 /\ edgecount^0-edgecount^post35 == 0 /\ -destflag^post35+destflag^0 == 0 /\ j^0-j^post35 == 0 /\ k_1^0-k_1^post35 == 0 /\ __lengthofvisited^0-__lengthofvisited^post35 == 0 /\ -k^post35+k^0 == 0 /\ min^post35 == 0 /\ nodecount^0-nodecount^post35 == 0), cost: 1
  44: l27 -> l0 : __lengthofvisited^0'=__lengthofvisited^post44, j^0'=j^post44, sourceflag^0'=sourceflag^post44, edgecount^0'=edgecount^post44, k_1^0'=k_1^post44, i^0'=i^post44, nodecount^0'=nodecount^post44, destflag^0'=destflag^post44, k^0'=k^post44, h^0'=h^post44, min^0'=min^post44, (-destflag^post44+destflag^0 == 0 /\ -1+i^post44 == 0 /\ -h^post44+h^0 == 0 /\ -min^post44+min^0 == 0 /\ -k^post44+k^0 == 0 /\ -k_1^post44+k_1^0 == 0 /\ -edgecount^post44+edgecount^0 == 0 /\ j^0-j^post44 == 0 /\ -nodecount^post44+nodecount^0 == 0 /\ -edgecount^0+__lengthofvisited^post44 == 0 /\ sourceflag^0-sourceflag^post44 == 0), cost: 1
  45: l28 -> l27 : __lengthofvisited^0'=__lengthofvisited^post45, j^0'=j^post45, sourceflag^0'=sourceflag^post45, edgecount^0'=edgecount^post45, k_1^0'=k_1^post45, i^0'=i^post45, nodecount^0'=nodecount^post45, destflag^0'=destflag^post45, k^0'=k^post45, h^0'=h^post45, min^0'=min^post45, (-i^post45+i^0 == 0 /\ j^0-j^post45 == 0 /\ edgecount^0-edgecount^post45 == 0 /\ h^0-h^post45 == 0 /\ -destflag^post45+destflag^0 == 0 /\ sourceflag^0-sourceflag^post45 == 0 /\ -min^post45+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post45 == 0 /\ -k^post45+k^0 == 0 /\ k_1^0-k_1^post45 == 0 /\ nodecount^0-nodecount^post45 == 0), cost: 1


Removed unreachable rules and leafs
Start location: l28
   0: l0 -> l1 : __lengthofvisited^0'=__lengthofvisited^post0, j^0'=j^post0, sourceflag^0'=sourceflag^post0, edgecount^0'=edgecount^post0, k_1^0'=k_1^post0, i^0'=i^post0, nodecount^0'=nodecount^post0, destflag^0'=destflag^post0, k^0'=k^post0, h^0'=h^post0, min^0'=min^post0, (-i^post0+i^0 == 0 /\ k_1^0-k_1^post0 == 0 /\ h^0-h^post0 == 0 /\ -destflag^post0+destflag^0 == 0 /\ sourceflag^0-sourceflag^post0 == 0 /\ edgecount^0-edgecount^post0 == 0 /\ j^0-j^post0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post0 == 0 /\ -min^post0+min^0 == 0 /\ -k^post0+k^0 == 0 /\ nodecount^0-nodecount^post0 == 0), cost: 1
  42: l1 -> l2 : __lengthofvisited^0'=__lengthofvisited^post42, j^0'=j^post42, sourceflag^0'=sourceflag^post42, edgecount^0'=edgecount^post42, k_1^0'=k_1^post42, i^0'=i^post42, nodecount^0'=nodecount^post42, destflag^0'=destflag^post42, k^0'=k^post42, h^0'=h^post42, min^0'=min^post42, (-h^post42+h^0 == 0 /\ -k_1^post42+k_1^0 == 0 /\ edgecount^0-edgecount^post42 == 0 /\ sourceflag^0-sourceflag^post42 == 0 /\ j^0-j^post42 == 0 /\ -i^0+nodecount^0 <= 0 /\ -nodecount^post42+nodecount^0 == 0 /\ -min^post42+min^0 == 0 /\ k^0-k^post42 == 0 /\ __lengthofvisited^0-__lengthofvisited^post42 == 0 /\ i^post42 == 0 /\ -destflag^post42+destflag^0 == 0), cost: 1
  43: l1 -> l0 : __lengthofvisited^0'=__lengthofvisited^post43, j^0'=j^post43, sourceflag^0'=sourceflag^post43, edgecount^0'=edgecount^post43, k_1^0'=k_1^post43, i^0'=i^post43, nodecount^0'=nodecount^post43, destflag^0'=destflag^post43, k^0'=k^post43, h^0'=h^post43, min^0'=min^post43, (-min^post43+min^0 == 0 /\ -k^post43+k^0 == 0 /\ 1+i^0-nodecount^0 <= 0 /\ h^0-h^post43 == 0 /\ edgecount^0-edgecount^post43 == 0 /\ -destflag^post43+destflag^0 == 0 /\ nodecount^0-nodecount^post43 == 0 /\ sourceflag^0-sourceflag^post43 == 0 /\ -j^post43+j^0 == 0 /\ k_1^0-k_1^post43 == 0 /\ __lengthofvisited^0-__lengthofvisited^post43 == 0 /\ -1+i^post43-i^0 == 0), cost: 1
   1: l2 -> l3 : __lengthofvisited^0'=__lengthofvisited^post1, j^0'=j^post1, sourceflag^0'=sourceflag^post1, edgecount^0'=edgecount^post1, k_1^0'=k_1^post1, i^0'=i^post1, nodecount^0'=nodecount^post1, destflag^0'=destflag^post1, k^0'=k^post1, h^0'=h^post1, min^0'=min^post1, (-min^post1+min^0 == 0 /\ nodecount^0-nodecount^post1 == 0 /\ -k^post1+k^0 == 0 /\ -edgecount^post1+edgecount^0 == 0 /\ -destflag^post1+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post1 == 0 /\ i^0-i^post1 == 0 /\ -k_1^post1+k_1^0 == 0 /\ j^0-j^post1 == 0 /\ -h^post1+h^0 == 0 /\ sourceflag^0-sourceflag^post1 == 0), cost: 1
  39: l3 -> l4 : __lengthofvisited^0'=__lengthofvisited^post39, j^0'=j^post39, sourceflag^0'=sourceflag^post39, edgecount^0'=edgecount^post39, k_1^0'=k_1^post39, i^0'=i^post39, nodecount^0'=nodecount^post39, destflag^0'=destflag^post39, k^0'=k^post39, h^0'=h^post39, min^0'=min^post39, (-h^post39+h^0 == 0 /\ -k_1^post39+k_1^0 == 0 /\ -nodecount^post39+nodecount^0 == 0 /\ -edgecount^post39+edgecount^0 == 0 /\ j^0-j^post39 == 0 /\ -min^post39+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post39 == 0 /\ -1-i^0+nodecount^0 <= 0 /\ sourceflag^0-sourceflag^post39 == 0 /\ destflag^0-destflag^post39 == 0 /\ i^0-i^post39 == 0 /\ k^post39 == 0), cost: 1
  40: l3 -> l2 : __lengthofvisited^0'=__lengthofvisited^post40, j^0'=j^post40, sourceflag^0'=sourceflag^post40, edgecount^0'=edgecount^post40, k_1^0'=k_1^post40, i^0'=i^post40, nodecount^0'=nodecount^post40, destflag^0'=destflag^post40, k^0'=k^post40, h^0'=h^post40, min^0'=min^post40, (2+i^0-nodecount^0 <= 0 /\ h^0-h^post40 == 0 /\ sourceflag^0-sourceflag^post40 == 0 /\ -destflag^post40+destflag^0 == 0 /\ edgecount^0-edgecount^post40 == 0 /\ -1+i^post40-i^0 == 0 /\ j^0-j^post40 == 0 /\ -min^post40+min^0 == 0 /\ -k^post40+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post40 == 0 /\ k_1^0-k_1^post40 == 0 /\ nodecount^0-nodecount^post40 == 0), cost: 1
   2: l4 -> l5 : __lengthofvisited^0'=__lengthofvisited^post2, j^0'=j^post2, sourceflag^0'=sourceflag^post2, edgecount^0'=edgecount^post2, k_1^0'=k_1^post2, i^0'=i^post2, nodecount^0'=nodecount^post2, destflag^0'=destflag^post2, k^0'=k^post2, h^0'=h^post2, min^0'=min^post2, (-h^post2+h^0 == 0 /\ -k_1^post2+k_1^0 == 0 /\ k^0-k^post2 == 0 /\ -nodecount^post2+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post2 == 0 /\ -min^post2+min^0 == 0 /\ edgecount^0-edgecount^post2 == 0 /\ destflag^0-destflag^post2 == 0 /\ -sourceflag^post2+sourceflag^0 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1
  37: l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post37, j^0'=j^post37, sourceflag^0'=sourceflag^post37, edgecount^0'=edgecount^post37, k_1^0'=k_1^post37, i^0'=i^post37, nodecount^0'=nodecount^post37, destflag^0'=destflag^post37, k^0'=k^post37, h^0'=h^post37, min^0'=min^post37, (-k_1^post37+k_1^0 == 0 /\ -h^post37+h^0 == 0 /\ -nodecount^post37+nodecount^0 == 0 /\ k^0-k^post37 == 0 /\ -min^post37+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post37 == 0 /\ edgecount^0-edgecount^post37 == 0 /\ sourceflag^0-sourceflag^post37 == 0 /\ nodecount^0-k^0 <= 0 /\ j^0-j^post37 == 0 /\ i^0-i^post37 == 0 /\ -destflag^post37+destflag^0 == 0), cost: 1
  38: l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post38, j^0'=j^post38, sourceflag^0'=sourceflag^post38, edgecount^0'=edgecount^post38, k_1^0'=k_1^post38, i^0'=i^post38, nodecount^0'=nodecount^post38, destflag^0'=destflag^post38, k^0'=k^post38, h^0'=h^post38, min^0'=min^post38, (-i^post38+i^0 == 0 /\ -k^post38+k^0 == 0 /\ -min^post38+min^0 == 0 /\ h^0-h^post38 == 0 /\ edgecount^0-edgecount^post38 == 0 /\ nodecount^0-nodecount^post38 == 0 /\ sourceflag^0-sourceflag^post38 == 0 /\ -destflag^post38+destflag^0 == 0 /\ -j^post38+j^0 == 0 /\ k_1^0-k_1^post38 == 0 /\ 2-nodecount^0+k^0 <= 0 /\ __lengthofvisited^0-__lengthofvisited^post38 == 0), cost: 1
   3: l6 -> l7 : __lengthofvisited^0'=__lengthofvisited^post3, j^0'=j^post3, sourceflag^0'=sourceflag^post3, edgecount^0'=edgecount^post3, k_1^0'=k_1^post3, i^0'=i^post3, nodecount^0'=nodecount^post3, destflag^0'=destflag^post3, k^0'=k^post3, h^0'=h^post3, min^0'=min^post3, (-i^post3+i^0 == 0 /\ -1-k_1^0+k_1^post3 == 0 /\ h^0-h^post3 == 0 /\ edgecount^0-edgecount^post3 == 0 /\ sourceflag^0-sourceflag^post3 == 0 /\ -destflag^post3+destflag^0 == 0 /\ j^0-j^post3 == 0 /\ __lengthofvisited^0-__lengthofvisited^post3 == 0 /\ -min^post3+min^0 == 0 /\ -k^post3+k^0 == 0 /\ nodecount^0-nodecount^post3 == 0), cost: 1
  18: l7 -> l18 : __lengthofvisited^0'=__lengthofvisited^post18, j^0'=j^post18, sourceflag^0'=sourceflag^post18, edgecount^0'=edgecount^post18, k_1^0'=k_1^post18, i^0'=i^post18, nodecount^0'=nodecount^post18, destflag^0'=destflag^post18, k^0'=k^post18, h^0'=h^post18, min^0'=min^post18, (sourceflag^0-sourceflag^post18 == 0 /\ nodecount^0-nodecount^post18 == 0 /\ i^0-i^post18 == 0 /\ j^0-j^post18 == 0 /\ -min^post18+min^0 == 0 /\ -k^post18+k^0 == 0 /\ k_1^0-k_1^post18 == 0 /\ -destflag^post18+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post18 == 0 /\ -h^post18+h^0 == 0 /\ -edgecount^post18+edgecount^0 == 0), cost: 1
   4: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post4, j^0'=j^post4, sourceflag^0'=sourceflag^post4, edgecount^0'=edgecount^post4, k_1^0'=k_1^post4, i^0'=i^post4, nodecount^0'=nodecount^post4, destflag^0'=destflag^post4, k^0'=k^post4, h^0'=h^post4, min^0'=min^post4, (-edgecount^post4+edgecount^0 == 0 /\ -destflag^post4+destflag^0 == 0 /\ -min^post4+min^0 == 0 /\ -h^post4+h^0 == 0 /\ 1-destflag^0 <= 0 /\ -k_1^post4+k_1^0 == 0 /\ j^0-j^post4 == 0 /\ __lengthofvisited^0-__lengthofvisited^post4 == 0 /\ -nodecount^post4+nodecount^0 == 0 /\ i^0-i^post4 == 0 /\ sourceflag^0-sourceflag^post4 == 0 /\ k^0-k^post4 == 0), cost: 1
   5: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post5, j^0'=j^post5, sourceflag^0'=sourceflag^post5, edgecount^0'=edgecount^post5, k_1^0'=k_1^post5, i^0'=i^post5, nodecount^0'=nodecount^post5, destflag^0'=destflag^post5, k^0'=k^post5, h^0'=h^post5, min^0'=min^post5, (-i^post5+i^0 == 0 /\ h^0-h^post5 == 0 /\ -destflag^post5+destflag^0 == 0 /\ sourceflag^0-sourceflag^post5 == 0 /\ 1+destflag^0 <= 0 /\ edgecount^0-edgecount^post5 == 0 /\ k_1^0-k_1^post5 == 0 /\ j^0-j^post5 == 0 /\ __lengthofvisited^0-__lengthofvisited^post5 == 0 /\ -min^post5+min^0 == 0 /\ -k^post5+k^0 == 0 /\ nodecount^0-nodecount^post5 == 0), cost: 1
   6: l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post6, j^0'=j^post6, sourceflag^0'=sourceflag^post6, edgecount^0'=edgecount^post6, k_1^0'=k_1^post6, i^0'=i^post6, nodecount^0'=nodecount^post6, destflag^0'=destflag^post6, k^0'=k^post6, h^0'=h^post6, min^0'=min^post6, (-k^post6+k^0 == 0 /\ -edgecount^post6+edgecount^0 == 0 /\ -destflag^post6+destflag^0 == 0 /\ -destflag^0 <= 0 /\ -min^post6+min^0 == 0 /\ j^0-j^post6 == 0 /\ i^0-i^post6 == 0 /\ -k_1^post6+k_1^0 == 0 /\ destflag^0 <= 0 /\ -h^post6+h^0 == 0 /\ -__lengthofvisited^post6+__lengthofvisited^0 == 0 /\ -nodecount^post6+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post6 == 0), cost: 1
   7: l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post7, j^0'=j^post7, sourceflag^0'=sourceflag^post7, edgecount^0'=edgecount^post7, k_1^0'=k_1^post7, i^0'=i^post7, nodecount^0'=nodecount^post7, destflag^0'=destflag^post7, k^0'=k^post7, h^0'=h^post7, min^0'=min^post7, (1-sourceflag^0 <= 0 /\ -h^post7+h^0 == 0 /\ edgecount^0-edgecount^post7 == 0 /\ sourceflag^0-sourceflag^post7 == 0 /\ j^0-j^post7 == 0 /\ -nodecount^post7+nodecount^0 == 0 /\ k^0-k^post7 == 0 /\ k_1^0-k_1^post7 == 0 /\ __lengthofvisited^0-__lengthofvisited^post7 == 0 /\ -min^post7+min^0 == 0 /\ destflag^0-destflag^post7 == 0 /\ i^0-i^post7 == 0), cost: 1
   8: l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post8, j^0'=j^post8, sourceflag^0'=sourceflag^post8, edgecount^0'=edgecount^post8, k_1^0'=k_1^post8, i^0'=i^post8, nodecount^0'=nodecount^post8, destflag^0'=destflag^post8, k^0'=k^post8, h^0'=h^post8, min^0'=min^post8, (-i^post8+i^0 == 0 /\ h^0-h^post8 == 0 /\ sourceflag^0-sourceflag^post8 == 0 /\ edgecount^0-edgecount^post8 == 0 /\ -destflag^post8+destflag^0 == 0 /\ j^0-j^post8 == 0 /\ -min^post8+min^0 == 0 /\ k_1^0-k_1^post8 == 0 /\ __lengthofvisited^0-__lengthofvisited^post8 == 0 /\ -k^post8+k^0 == 0 /\ 1+sourceflag^0 <= 0 /\ nodecount^0-nodecount^post8 == 0), cost: 1
   9: l9 -> l8 : __lengthofvisited^0'=__lengthofvisited^post9, j^0'=j^post9, sourceflag^0'=sourceflag^post9, edgecount^0'=edgecount^post9, k_1^0'=k_1^post9, i^0'=i^post9, nodecount^0'=nodecount^post9, destflag^0'=destflag^post9, k^0'=k^post9, h^0'=h^post9, min^0'=min^post9, (-sourceflag^0 <= 0 /\ -edgecount^post9+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post9 == 0 /\ -destflag^post9+destflag^0 == 0 /\ sourceflag^0 <= 0 /\ -min^post9+min^0 == 0 /\ -k^post9+k^0 == 0 /\ i^0-i^post9 == 0 /\ -h^post9+h^0 == 0 /\ -k_1^post9+k_1^0 == 0 /\ j^0-j^post9 == 0 /\ -nodecount^post9+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post9 == 0), cost: 1
  10: l10 -> l11 : __lengthofvisited^0'=__lengthofvisited^post10, j^0'=j^post10, sourceflag^0'=sourceflag^post10, edgecount^0'=edgecount^post10, k_1^0'=k_1^post10, i^0'=i^post10, nodecount^0'=nodecount^post10, destflag^0'=destflag^post10, k^0'=k^post10, h^0'=h^post10, min^0'=min^post10, (-i^post10+i^0 == 0 /\ edgecount^0-edgecount^post10 == 0 /\ sourceflag^0-sourceflag^post10 == 0 /\ j^0-j^post10 == 0 /\ h^0-h^post10 == 0 /\ -destflag^post10+destflag^0 == 0 /\ k_1^0-k_1^post10 == 0 /\ -min^post10+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post10 == 0 /\ -k^post10+k^0 == 0 /\ nodecount^0-nodecount^post10 == 0), cost: 1
  32: l11 -> l7 : __lengthofvisited^0'=__lengthofvisited^post32, j^0'=j^post32, sourceflag^0'=sourceflag^post32, edgecount^0'=edgecount^post32, k_1^0'=k_1^post32, i^0'=i^post32, nodecount^0'=nodecount^post32, destflag^0'=destflag^post32, k^0'=k^post32, h^0'=h^post32, min^0'=min^post32, (-h^post32+h^0 == 0 /\ k_1^post32 == 0 /\ -nodecount^post32+nodecount^0 == 0 /\ k^0-k^post32 == 0 /\ -min^post32+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post32 == 0 /\ edgecount^0-edgecount^post32 == 0 /\ sourceflag^0-sourceflag^post32 == 0 /\ j^0-j^post32 == 0 /\ i^0-i^post32 == 0 /\ -destflag^post32+destflag^0 == 0 /\ edgecount^0-i^0 <= 0), cost: 1
  33: l11 -> l10 : __lengthofvisited^0'=__lengthofvisited^post33, j^0'=j^post33, sourceflag^0'=sourceflag^post33, edgecount^0'=edgecount^post33, k_1^0'=k_1^post33, i^0'=i^post33, nodecount^0'=nodecount^post33, destflag^0'=destflag^post33, k^0'=k^post33, h^0'=h^post33, min^0'=min^post33, (-min^post33+min^0 == 0 /\ nodecount^0-nodecount^post33 == 0 /\ -k^post33+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post33 == 0 /\ -1+i^post33-i^0 == 0 /\ edgecount^0-edgecount^post33 == 0 /\ -destflag^post33+destflag^0 == 0 /\ sourceflag^0-sourceflag^post33 == 0 /\ -h^post33+h^0 == 0 /\ 1-edgecount^0+i^0 <= 0 /\ -j^post33+j^0 == 0 /\ k_1^0-k_1^post33 == 0), cost: 1
  11: l12 -> l13 : __lengthofvisited^0'=__lengthofvisited^post11, j^0'=j^post11, sourceflag^0'=sourceflag^post11, edgecount^0'=edgecount^post11, k_1^0'=k_1^post11, i^0'=i^post11, nodecount^0'=nodecount^post11, destflag^0'=destflag^post11, k^0'=k^post11, h^0'=h^post11, min^0'=min^post11, (-edgecount^post11+edgecount^0 == 0 /\ -1-j^0+j^post11 == 0 /\ __lengthofvisited^0-__lengthofvisited^post11 == 0 /\ -destflag^post11+destflag^0 == 0 /\ -min^post11+min^0 == 0 /\ -k^post11+k^0 == 0 /\ i^0-i^post11 == 0 /\ -k_1^post11+k_1^0 == 0 /\ -h^post11+h^0 == 0 /\ -nodecount^post11+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post11 == 0), cost: 1
  41: l13 -> l15 : __lengthofvisited^0'=__lengthofvisited^post41, j^0'=j^post41, sourceflag^0'=sourceflag^post41, edgecount^0'=edgecount^post41, k_1^0'=k_1^post41, i^0'=i^post41, nodecount^0'=nodecount^post41, destflag^0'=destflag^post41, k^0'=k^post41, h^0'=h^post41, min^0'=min^post41, (-edgecount^post41+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post41 == 0 /\ -destflag^post41+destflag^0 == 0 /\ -min^post41+min^0 == 0 /\ -k^post41+k^0 == 0 /\ i^0-i^post41 == 0 /\ j^0-j^post41 == 0 /\ -h^post41+h^0 == 0 /\ -k_1^post41+k_1^0 == 0 /\ -nodecount^post41+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post41 == 0), cost: 1
  12: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post12, j^0'=j^post12, sourceflag^0'=sourceflag^post12, edgecount^0'=edgecount^post12, k_1^0'=k_1^post12, i^0'=i^post12, nodecount^0'=nodecount^post12, destflag^0'=destflag^post12, k^0'=k^post12, h^0'=h^post12, min^0'=min^post12, (-h^post12+h^0 == 0 /\ edgecount^0-edgecount^post12 == 0 /\ destflag^0-destflag^post12 == 0 /\ __lengthofvisited^0-__lengthofvisited^post12 == 0 /\ sourceflag^0-sourceflag^post12 == 0 /\ -nodecount^post12+nodecount^0 == 0 /\ j^0-j^post12 == 0 /\ -min^post12+min^0 == 0 /\ -k^post12+k^0 == 0 /\ k_1^0-k_1^post12 == 0 /\ -i^post12+i^0 == 0), cost: 1
  13: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post13, j^0'=j^post13, sourceflag^0'=sourceflag^post13, edgecount^0'=edgecount^post13, k_1^0'=k_1^post13, i^0'=i^post13, nodecount^0'=nodecount^post13, destflag^0'=destflag^post13, k^0'=k^post13, h^0'=h^post13, min^0'=min^post13, (destflag^post13 == 0 /\ -i^post13+i^0 == 0 /\ j^0-j^post13 == 0 /\ h^0-h^post13 == 0 /\ sourceflag^0-sourceflag^post13 == 0 /\ __lengthofvisited^0-__lengthofvisited^post13 == 0 /\ -k^post13+k^0 == 0 /\ -min^post13+min^0 == 0 /\ k_1^0-k_1^post13 == 0 /\ -edgecount^post13+edgecount^0 == 0 /\ nodecount^0-nodecount^post13 == 0), cost: 1
  14: l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post14, j^0'=j^post14, sourceflag^0'=sourceflag^post14, edgecount^0'=edgecount^post14, k_1^0'=k_1^post14, i^0'=i^post14, nodecount^0'=nodecount^post14, destflag^0'=destflag^post14, k^0'=k^post14, h^0'=h^post14, min^0'=min^post14, (-edgecount^post14+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post14 == 0 /\ -destflag^post14+destflag^0 == 0 /\ -min^post14+min^0 == 0 /\ -k^post14+k^0 == 0 /\ i^0-i^post14 == 0 /\ j^0-j^post14 == 0 /\ -k_1^post14+k_1^0 == 0 /\ -h^post14+h^0 == 0 /\ -nodecount^post14+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post14 == 0), cost: 1
  15: l15 -> l9 : __lengthofvisited^0'=__lengthofvisited^post15, j^0'=j^post15, sourceflag^0'=sourceflag^post15, edgecount^0'=edgecount^post15, k_1^0'=k_1^post15, i^0'=i^post15, nodecount^0'=nodecount^post15, destflag^0'=destflag^post15, k^0'=k^post15, h^0'=h^post15, min^0'=min^post15, (-h^post15+h^0 == 0 /\ destflag^0-destflag^post15 == 0 /\ edgecount^0-edgecount^post15 == 0 /\ sourceflag^0-sourceflag^post15 == 0 /\ j^0-j^post15 == 0 /\ -nodecount^post15+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post15 == 0 /\ k_1^0-k_1^post15 == 0 /\ -i^post15+i^0 == 0 /\ -j^0+nodecount^0 <= 0 /\ -k^post15+k^0 == 0 /\ -min^post15+min^0 == 0), cost: 1
  16: l15 -> l14 : __lengthofvisited^0'=__lengthofvisited^post16, j^0'=j^post16, sourceflag^0'=sourceflag^post16, edgecount^0'=edgecount^post16, k_1^0'=k_1^post16, i^0'=i^post16, nodecount^0'=nodecount^post16, destflag^0'=destflag^post16, k^0'=k^post16, h^0'=h^post16, min^0'=min^post16, (__lengthofvisited^0-__lengthofvisited^post16 == 0 /\ -destflag^post16+destflag^0 == 0 /\ -h^post16+h^0 == 0 /\ -k^post16+k^0 == 0 /\ -min^post16+min^0 == 0 /\ j^0-j^post16 == 0 /\ i^0-i^post16 == 0 /\ -k_1^post16+k_1^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -nodecount^post16+nodecount^0 == 0 /\ edgecount^0-edgecount^post16 == 0 /\ sourceflag^0-sourceflag^post16 == 0), cost: 1
  17: l16 -> l17 : __lengthofvisited^0'=__lengthofvisited^post17, j^0'=j^post17, sourceflag^0'=sourceflag^post17, edgecount^0'=edgecount^post17, k_1^0'=k_1^post17, i^0'=i^post17, nodecount^0'=nodecount^post17, destflag^0'=destflag^post17, k^0'=k^post17, h^0'=h^post17, min^0'=min^post17, (-h^post17+h^0 == 0 /\ edgecount^0-edgecount^post17 == 0 /\ __lengthofvisited^0-__lengthofvisited^post17 == 0 /\ destflag^0-destflag^post17 == 0 /\ sourceflag^0-sourceflag^post17 == 0 /\ -nodecount^post17+nodecount^0 == 0 /\ -min^post17+min^0 == 0 /\ -k^post17+k^0 == 0 /\ k_1^0-k_1^post17 == 0 /\ -i^post17+i^0 == 0 /\ -1-j^0+j^post17 == 0), cost: 1
  34: l17 -> l20 : __lengthofvisited^0'=__lengthofvisited^post34, j^0'=j^post34, sourceflag^0'=sourceflag^post34, edgecount^0'=edgecount^post34, k_1^0'=k_1^post34, i^0'=i^post34, nodecount^0'=nodecount^post34, destflag^0'=destflag^post34, k^0'=k^post34, h^0'=h^post34, min^0'=min^post34, (-h^post34+h^0 == 0 /\ -k_1^post34+k_1^0 == 0 /\ k^0-k^post34 == 0 /\ -nodecount^post34+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post34 == 0 /\ -min^post34+min^0 == 0 /\ edgecount^0-edgecount^post34 == 0 /\ destflag^0-destflag^post34 == 0 /\ j^0-j^post34 == 0 /\ i^0-i^post34 == 0 /\ -sourceflag^post34+sourceflag^0 == 0), cost: 1
  30: l18 -> l4 : __lengthofvisited^0'=__lengthofvisited^post30, j^0'=j^post30, sourceflag^0'=sourceflag^post30, edgecount^0'=edgecount^post30, k_1^0'=k_1^post30, i^0'=i^post30, nodecount^0'=nodecount^post30, destflag^0'=destflag^post30, k^0'=k^post30, h^0'=h^post30, min^0'=min^post30, (-i^post30+i^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post30 == 0 /\ -1+k^post30-k^0 == 0 /\ edgecount^0-edgecount^post30 == 0 /\ sourceflag^0-sourceflag^post30 == 0 /\ edgecount^0-k_1^0 <= 0 /\ -destflag^post30+destflag^0 == 0 /\ j^0-j^post30 == 0 /\ k_1^0-k_1^post30 == 0 /\ -min^post30+min^0 == 0 /\ nodecount^0-nodecount^post30 == 0 /\ -h^post30+h^0 == 0), cost: 1
  31: l18 -> l22 : __lengthofvisited^0'=__lengthofvisited^post31, j^0'=j^post31, sourceflag^0'=sourceflag^post31, edgecount^0'=edgecount^post31, k_1^0'=k_1^post31, i^0'=i^post31, nodecount^0'=nodecount^post31, destflag^0'=destflag^post31, k^0'=k^post31, h^0'=h^post31, min^0'=min^post31, (i^0-i^post31 == 0 /\ nodecount^0-nodecount^post31 == 0 /\ -min^post31+min^0 == 0 /\ -k^post31+k^0 == 0 /\ j^0-j^post31 == 0 /\ h^post31 == 0 /\ -destflag^post31+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post31 == 0 /\ k_1^0-k_1^post31 == 0 /\ sourceflag^0-sourceflag^post31 == 0 /\ 1-edgecount^0+k_1^0 <= 0 /\ edgecount^0-edgecount^post31 == 0), cost: 1
  19: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post19, j^0'=j^post19, sourceflag^0'=sourceflag^post19, edgecount^0'=edgecount^post19, k_1^0'=k_1^post19, i^0'=i^post19, nodecount^0'=nodecount^post19, destflag^0'=destflag^post19, k^0'=k^post19, h^0'=h^post19, min^0'=min^post19, (__lengthofvisited^0-__lengthofvisited^post19 == 0 /\ -destflag^post19+destflag^0 == 0 /\ -min^post19+min^0 == 0 /\ -k^post19+k^0 == 0 /\ -edgecount^post19+edgecount^0 == 0 /\ j^0-j^post19 == 0 /\ -k_1^post19+k_1^0 == 0 /\ -h^post19+h^0 == 0 /\ i^0-i^post19 == 0 /\ -nodecount^post19+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post19 == 0), cost: 1
  20: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post20, j^0'=j^post20, sourceflag^0'=sourceflag^post20, edgecount^0'=edgecount^post20, k_1^0'=k_1^post20, i^0'=i^post20, nodecount^0'=nodecount^post20, destflag^0'=destflag^post20, k^0'=k^post20, h^0'=h^post20, min^0'=min^post20, (-1+sourceflag^post20 == 0 /\ edgecount^0-edgecount^post20 == 0 /\ destflag^0-destflag^post20 == 0 /\ j^0-j^post20 == 0 /\ -nodecount^post20+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post20 == 0 /\ k_1^0-k_1^post20 == 0 /\ -i^post20+i^0 == 0 /\ -h^post20+h^0 == 0 /\ -min^post20+min^0 == 0 /\ -k^post20+k^0 == 0), cost: 1
  21: l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post21, j^0'=j^post21, sourceflag^0'=sourceflag^post21, edgecount^0'=edgecount^post21, k_1^0'=k_1^post21, i^0'=i^post21, nodecount^0'=nodecount^post21, destflag^0'=destflag^post21, k^0'=k^post21, h^0'=h^post21, min^0'=min^post21, (i^0-i^post21 == 0 /\ nodecount^0-nodecount^post21 == 0 /\ -k^post21+k^0 == 0 /\ j^0-j^post21 == 0 /\ -min^post21+min^0 == 0 /\ sourceflag^0-sourceflag^post21 == 0 /\ __lengthofvisited^0-__lengthofvisited^post21 == 0 /\ k_1^0-k_1^post21 == 0 /\ -destflag^post21+destflag^0 == 0 /\ -h^post21+h^0 == 0 /\ edgecount^0-edgecount^post21 == 0), cost: 1
  22: l20 -> l13 : __lengthofvisited^0'=__lengthofvisited^post22, j^0'=j^post22, sourceflag^0'=sourceflag^post22, edgecount^0'=edgecount^post22, k_1^0'=k_1^post22, i^0'=i^post22, nodecount^0'=nodecount^post22, destflag^0'=destflag^post22, k^0'=k^post22, h^0'=h^post22, min^0'=min^post22, (-h^post22+h^0 == 0 /\ sourceflag^0-sourceflag^post22 == 0 /\ edgecount^0-edgecount^post22 == 0 /\ __lengthofvisited^0-__lengthofvisited^post22 == 0 /\ -nodecount^post22+nodecount^0 == 0 /\ -min^post22+min^0 == 0 /\ -k^post22+k^0 == 0 /\ k_1^0-k_1^post22 == 0 /\ -i^post22+i^0 == 0 /\ -1+destflag^post22 == 0 /\ j^post22 == 0 /\ -j^0+nodecount^0 <= 0), cost: 1
  23: l20 -> l19 : __lengthofvisited^0'=__lengthofvisited^post23, j^0'=j^post23, sourceflag^0'=sourceflag^post23, edgecount^0'=edgecount^post23, k_1^0'=k_1^post23, i^0'=i^post23, nodecount^0'=nodecount^post23, destflag^0'=destflag^post23, k^0'=k^post23, h^0'=h^post23, min^0'=min^post23, (i^0-i^post23 == 0 /\ nodecount^0-nodecount^post23 == 0 /\ -min^post23+min^0 == 0 /\ -k^post23+k^0 == 0 /\ j^0-j^post23 == 0 /\ k_1^0-k_1^post23 == 0 /\ -destflag^post23+destflag^0 == 0 /\ sourceflag^0-sourceflag^post23 == 0 /\ __lengthofvisited^0-__lengthofvisited^post23 == 0 /\ -h^post23+h^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -edgecount^post23+edgecount^0 == 0), cost: 1
  24: l21 -> l22 : __lengthofvisited^0'=__lengthofvisited^post24, j^0'=j^post24, sourceflag^0'=sourceflag^post24, edgecount^0'=edgecount^post24, k_1^0'=k_1^post24, i^0'=i^post24, nodecount^0'=nodecount^post24, destflag^0'=destflag^post24, k^0'=k^post24, h^0'=h^post24, min^0'=min^post24, (__lengthofvisited^0-__lengthofvisited^post24 == 0 /\ k_1^0-k_1^post24 == 0 /\ -min^post24+min^0 == 0 /\ -nodecount^post24+nodecount^0 == 0 /\ -1+h^post24-h^0 == 0 /\ edgecount^0-edgecount^post24 == 0 /\ destflag^0-destflag^post24 == 0 /\ j^0-j^post24 == 0 /\ -sourceflag^post24+sourceflag^0 == 0 /\ i^0-i^post24 == 0 /\ k^0-k^post24 == 0), cost: 1
  27: l22 -> l24 : __lengthofvisited^0'=__lengthofvisited^post27, j^0'=j^post27, sourceflag^0'=sourceflag^post27, edgecount^0'=edgecount^post27, k_1^0'=k_1^post27, i^0'=i^post27, nodecount^0'=nodecount^post27, destflag^0'=destflag^post27, k^0'=k^post27, h^0'=h^post27, min^0'=min^post27, (__lengthofvisited^0-__lengthofvisited^post27 == 0 /\ -h^post27+h^0 == 0 /\ -k_1^post27+k_1^0 == 0 /\ -nodecount^post27+nodecount^0 == 0 /\ -k^post27+k^0 == 0 /\ -min^post27+min^0 == 0 /\ sourceflag^0-sourceflag^post27 == 0 /\ i^0-i^post27 == 0 /\ edgecount^0-edgecount^post27 == 0 /\ -destflag^post27+destflag^0 == 0 /\ j^0-j^post27 == 0), cost: 1
  25: l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post25, j^0'=j^post25, sourceflag^0'=sourceflag^post25, edgecount^0'=edgecount^post25, k_1^0'=k_1^post25, i^0'=i^post25, nodecount^0'=nodecount^post25, destflag^0'=destflag^post25, k^0'=k^post25, h^0'=h^post25, min^0'=min^post25, (destflag^0-destflag^post25 == 0 /\ -nodecount^post25+nodecount^0 == 0 /\ edgecount^0-edgecount^post25 == 0 /\ sourceflag^0-sourceflag^post25 == 0 /\ j^0-j^post25 == 0 /\ __lengthofvisited^0-__lengthofvisited^post25 == 0 /\ k_1^0-k_1^post25 == 0 /\ -i^post25+i^0 == 0 /\ -h^post25+h^0 == 0 /\ min^post25-h^0 == 0 /\ -k^post25+k^0 == 0), cost: 1
  26: l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post26, j^0'=j^post26, sourceflag^0'=sourceflag^post26, edgecount^0'=edgecount^post26, k_1^0'=k_1^post26, i^0'=i^post26, nodecount^0'=nodecount^post26, destflag^0'=destflag^post26, k^0'=k^post26, h^0'=h^post26, min^0'=min^post26, (nodecount^0-nodecount^post26 == 0 /\ i^0-i^post26 == 0 /\ -min^post26+min^0 == 0 /\ -k^post26+k^0 == 0 /\ j^0-j^post26 == 0 /\ -destflag^post26+destflag^0 == 0 /\ sourceflag^0-sourceflag^post26 == 0 /\ k_1^0-k_1^post26 == 0 /\ __lengthofvisited^0-__lengthofvisited^post26 == 0 /\ -h^post26+h^0 == 0 /\ edgecount^0-edgecount^post26 == 0), cost: 1
  28: l24 -> l17 : __lengthofvisited^0'=__lengthofvisited^post28, j^0'=j^post28, sourceflag^0'=sourceflag^post28, edgecount^0'=edgecount^post28, k_1^0'=k_1^post28, i^0'=i^post28, nodecount^0'=nodecount^post28, destflag^0'=destflag^post28, k^0'=k^post28, h^0'=h^post28, min^0'=min^post28, (-min^post28+min^0 == 0 /\ nodecount^0-nodecount^post28 == 0 /\ i^0-i^post28 == 0 /\ -k^post28+k^0 == 0 /\ j^post28 == 0 /\ -destflag^post28+destflag^0 == 0 /\ k_1^0-k_1^post28 == 0 /\ __lengthofvisited^0-__lengthofvisited^post28 == 0 /\ sourceflag^post28 == 0 /\ edgecount^0-h^0 <= 0 /\ -h^post28+h^0 == 0 /\ -edgecount^post28+edgecount^0 == 0), cost: 1
  29: l24 -> l23 : __lengthofvisited^0'=__lengthofvisited^post29, j^0'=j^post29, sourceflag^0'=sourceflag^post29, edgecount^0'=edgecount^post29, k_1^0'=k_1^post29, i^0'=i^post29, nodecount^0'=nodecount^post29, destflag^0'=destflag^post29, k^0'=k^post29, h^0'=h^post29, min^0'=min^post29, (-k_1^post29+k_1^0 == 0 /\ -h^post29+h^0 == 0 /\ k^0-k^post29 == 0 /\ -nodecount^post29+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post29 == 0 /\ -min^post29+min^0 == 0 /\ edgecount^0-edgecount^post29 == 0 /\ destflag^0-destflag^post29 == 0 /\ -sourceflag^post29+sourceflag^0 == 0 /\ j^0-j^post29 == 0 /\ i^0-i^post29 == 0 /\ 1-edgecount^0+h^0 <= 0), cost: 1
  35: l25 -> l10 : __lengthofvisited^0'=__lengthofvisited^post35, j^0'=j^post35, sourceflag^0'=sourceflag^post35, edgecount^0'=edgecount^post35, k_1^0'=k_1^post35, i^0'=i^post35, nodecount^0'=nodecount^post35, destflag^0'=destflag^post35, k^0'=k^post35, h^0'=h^post35, min^0'=min^post35, (i^post35 == 0 /\ h^0-h^post35 == 0 /\ sourceflag^0-sourceflag^post35 == 0 /\ edgecount^0-edgecount^post35 == 0 /\ -destflag^post35+destflag^0 == 0 /\ j^0-j^post35 == 0 /\ k_1^0-k_1^post35 == 0 /\ __lengthofvisited^0-__lengthofvisited^post35 == 0 /\ -k^post35+k^0 == 0 /\ min^post35 == 0 /\ nodecount^0-nodecount^post35 == 0), cost: 1
  44: l27 -> l0 : __lengthofvisited^0'=__lengthofvisited^post44, j^0'=j^post44, sourceflag^0'=sourceflag^post44, edgecount^0'=edgecount^post44, k_1^0'=k_1^post44, i^0'=i^post44, nodecount^0'=nodecount^post44, destflag^0'=destflag^post44, k^0'=k^post44, h^0'=h^post44, min^0'=min^post44, (-destflag^post44+destflag^0 == 0 /\ -1+i^post44 == 0 /\ -h^post44+h^0 == 0 /\ -min^post44+min^0 == 0 /\ -k^post44+k^0 == 0 /\ -k_1^post44+k_1^0 == 0 /\ -edgecount^post44+edgecount^0 == 0 /\ j^0-j^post44 == 0 /\ -nodecount^post44+nodecount^0 == 0 /\ -edgecount^0+__lengthofvisited^post44 == 0 /\ sourceflag^0-sourceflag^post44 == 0), cost: 1
  45: l28 -> l27 : __lengthofvisited^0'=__lengthofvisited^post45, j^0'=j^post45, sourceflag^0'=sourceflag^post45, edgecount^0'=edgecount^post45, k_1^0'=k_1^post45, i^0'=i^post45, nodecount^0'=nodecount^post45, destflag^0'=destflag^post45, k^0'=k^post45, h^0'=h^post45, min^0'=min^post45, (-i^post45+i^0 == 0 /\ j^0-j^post45 == 0 /\ edgecount^0-edgecount^post45 == 0 /\ h^0-h^post45 == 0 /\ -destflag^post45+destflag^0 == 0 /\ sourceflag^0-sourceflag^post45 == 0 /\ -min^post45+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post45 == 0 /\ -k^post45+k^0 == 0 /\ k_1^0-k_1^post45 == 0 /\ nodecount^0-nodecount^post45 == 0), cost: 1


Applied preprocessing
Original rule:
l0 -> l1 : __lengthofvisited^0'=__lengthofvisited^post0, j^0'=j^post0, sourceflag^0'=sourceflag^post0, edgecount^0'=edgecount^post0, k_1^0'=k_1^post0, i^0'=i^post0, nodecount^0'=nodecount^post0, destflag^0'=destflag^post0, k^0'=k^post0, h^0'=h^post0, min^0'=min^post0, (-i^post0+i^0 == 0 /\ k_1^0-k_1^post0 == 0 /\ h^0-h^post0 == 0 /\ -destflag^post0+destflag^0 == 0 /\ sourceflag^0-sourceflag^post0 == 0 /\ edgecount^0-edgecount^post0 == 0 /\ j^0-j^post0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post0 == 0 /\ -min^post0+min^0 == 0 /\ -k^post0+k^0 == 0 /\ nodecount^0-nodecount^post0 == 0), cost: 1
New rule:
l0 -> l1 : TRUE, cost: 1

Applied preprocessing
Original rule:
l2 -> l3 : __lengthofvisited^0'=__lengthofvisited^post1, j^0'=j^post1, sourceflag^0'=sourceflag^post1, edgecount^0'=edgecount^post1, k_1^0'=k_1^post1, i^0'=i^post1, nodecount^0'=nodecount^post1, destflag^0'=destflag^post1, k^0'=k^post1, h^0'=h^post1, min^0'=min^post1, (-min^post1+min^0 == 0 /\ nodecount^0-nodecount^post1 == 0 /\ -k^post1+k^0 == 0 /\ -edgecount^post1+edgecount^0 == 0 /\ -destflag^post1+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post1 == 0 /\ i^0-i^post1 == 0 /\ -k_1^post1+k_1^0 == 0 /\ j^0-j^post1 == 0 /\ -h^post1+h^0 == 0 /\ sourceflag^0-sourceflag^post1 == 0), cost: 1
New rule:
l2 -> l3 : TRUE, cost: 1

Applied preprocessing
Original rule:
l4 -> l5 : __lengthofvisited^0'=__lengthofvisited^post2, j^0'=j^post2, sourceflag^0'=sourceflag^post2, edgecount^0'=edgecount^post2, k_1^0'=k_1^post2, i^0'=i^post2, nodecount^0'=nodecount^post2, destflag^0'=destflag^post2, k^0'=k^post2, h^0'=h^post2, min^0'=min^post2, (-h^post2+h^0 == 0 /\ -k_1^post2+k_1^0 == 0 /\ k^0-k^post2 == 0 /\ -nodecount^post2+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post2 == 0 /\ -min^post2+min^0 == 0 /\ edgecount^0-edgecount^post2 == 0 /\ destflag^0-destflag^post2 == 0 /\ -sourceflag^post2+sourceflag^0 == 0 /\ j^0-j^post2 == 0 /\ i^0-i^post2 == 0), cost: 1
New rule:
l4 -> l5 : TRUE, cost: 1

Applied preprocessing
Original rule:
l6 -> l7 : __lengthofvisited^0'=__lengthofvisited^post3, j^0'=j^post3, sourceflag^0'=sourceflag^post3, edgecount^0'=edgecount^post3, k_1^0'=k_1^post3, i^0'=i^post3, nodecount^0'=nodecount^post3, destflag^0'=destflag^post3, k^0'=k^post3, h^0'=h^post3, min^0'=min^post3, (-i^post3+i^0 == 0 /\ -1-k_1^0+k_1^post3 == 0 /\ h^0-h^post3 == 0 /\ edgecount^0-edgecount^post3 == 0 /\ sourceflag^0-sourceflag^post3 == 0 /\ -destflag^post3+destflag^0 == 0 /\ j^0-j^post3 == 0 /\ __lengthofvisited^0-__lengthofvisited^post3 == 0 /\ -min^post3+min^0 == 0 /\ -k^post3+k^0 == 0 /\ nodecount^0-nodecount^post3 == 0), cost: 1
New rule:
l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post4, j^0'=j^post4, sourceflag^0'=sourceflag^post4, edgecount^0'=edgecount^post4, k_1^0'=k_1^post4, i^0'=i^post4, nodecount^0'=nodecount^post4, destflag^0'=destflag^post4, k^0'=k^post4, h^0'=h^post4, min^0'=min^post4, (-edgecount^post4+edgecount^0 == 0 /\ -destflag^post4+destflag^0 == 0 /\ -min^post4+min^0 == 0 /\ -h^post4+h^0 == 0 /\ 1-destflag^0 <= 0 /\ -k_1^post4+k_1^0 == 0 /\ j^0-j^post4 == 0 /\ __lengthofvisited^0-__lengthofvisited^post4 == 0 /\ -nodecount^post4+nodecount^0 == 0 /\ i^0-i^post4 == 0 /\ sourceflag^0-sourceflag^post4 == 0 /\ k^0-k^post4 == 0), cost: 1
New rule:
l8 -> l6 : -1+destflag^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post5, j^0'=j^post5, sourceflag^0'=sourceflag^post5, edgecount^0'=edgecount^post5, k_1^0'=k_1^post5, i^0'=i^post5, nodecount^0'=nodecount^post5, destflag^0'=destflag^post5, k^0'=k^post5, h^0'=h^post5, min^0'=min^post5, (-i^post5+i^0 == 0 /\ h^0-h^post5 == 0 /\ -destflag^post5+destflag^0 == 0 /\ sourceflag^0-sourceflag^post5 == 0 /\ 1+destflag^0 <= 0 /\ edgecount^0-edgecount^post5 == 0 /\ k_1^0-k_1^post5 == 0 /\ j^0-j^post5 == 0 /\ __lengthofvisited^0-__lengthofvisited^post5 == 0 /\ -min^post5+min^0 == 0 /\ -k^post5+k^0 == 0 /\ nodecount^0-nodecount^post5 == 0), cost: 1
New rule:
l8 -> l6 : 1+destflag^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l8 -> l6 : __lengthofvisited^0'=__lengthofvisited^post6, j^0'=j^post6, sourceflag^0'=sourceflag^post6, edgecount^0'=edgecount^post6, k_1^0'=k_1^post6, i^0'=i^post6, nodecount^0'=nodecount^post6, destflag^0'=destflag^post6, k^0'=k^post6, h^0'=h^post6, min^0'=min^post6, (-k^post6+k^0 == 0 /\ -edgecount^post6+edgecount^0 == 0 /\ -destflag^post6+destflag^0 == 0 /\ -destflag^0 <= 0 /\ -min^post6+min^0 == 0 /\ j^0-j^post6 == 0 /\ i^0-i^post6 == 0 /\ -k_1^post6+k_1^0 == 0 /\ destflag^0 <= 0 /\ -h^post6+h^0 == 0 /\ -__lengthofvisited^post6+__lengthofvisited^0 == 0 /\ -nodecount^post6+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post6 == 0), cost: 1
New rule:
l8 -> l6 : destflag^0 == 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post7, j^0'=j^post7, sourceflag^0'=sourceflag^post7, edgecount^0'=edgecount^post7, k_1^0'=k_1^post7, i^0'=i^post7, nodecount^0'=nodecount^post7, destflag^0'=destflag^post7, k^0'=k^post7, h^0'=h^post7, min^0'=min^post7, (1-sourceflag^0 <= 0 /\ -h^post7+h^0 == 0 /\ edgecount^0-edgecount^post7 == 0 /\ sourceflag^0-sourceflag^post7 == 0 /\ j^0-j^post7 == 0 /\ -nodecount^post7+nodecount^0 == 0 /\ k^0-k^post7 == 0 /\ k_1^0-k_1^post7 == 0 /\ __lengthofvisited^0-__lengthofvisited^post7 == 0 /\ -min^post7+min^0 == 0 /\ destflag^0-destflag^post7 == 0 /\ i^0-i^post7 == 0), cost: 1
New rule:
l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l6 : __lengthofvisited^0'=__lengthofvisited^post8, j^0'=j^post8, sourceflag^0'=sourceflag^post8, edgecount^0'=edgecount^post8, k_1^0'=k_1^post8, i^0'=i^post8, nodecount^0'=nodecount^post8, destflag^0'=destflag^post8, k^0'=k^post8, h^0'=h^post8, min^0'=min^post8, (-i^post8+i^0 == 0 /\ h^0-h^post8 == 0 /\ sourceflag^0-sourceflag^post8 == 0 /\ edgecount^0-edgecount^post8 == 0 /\ -destflag^post8+destflag^0 == 0 /\ j^0-j^post8 == 0 /\ -min^post8+min^0 == 0 /\ k_1^0-k_1^post8 == 0 /\ __lengthofvisited^0-__lengthofvisited^post8 == 0 /\ -k^post8+k^0 == 0 /\ 1+sourceflag^0 <= 0 /\ nodecount^0-nodecount^post8 == 0), cost: 1
New rule:
l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l9 -> l8 : __lengthofvisited^0'=__lengthofvisited^post9, j^0'=j^post9, sourceflag^0'=sourceflag^post9, edgecount^0'=edgecount^post9, k_1^0'=k_1^post9, i^0'=i^post9, nodecount^0'=nodecount^post9, destflag^0'=destflag^post9, k^0'=k^post9, h^0'=h^post9, min^0'=min^post9, (-sourceflag^0 <= 0 /\ -edgecount^post9+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post9 == 0 /\ -destflag^post9+destflag^0 == 0 /\ sourceflag^0 <= 0 /\ -min^post9+min^0 == 0 /\ -k^post9+k^0 == 0 /\ i^0-i^post9 == 0 /\ -h^post9+h^0 == 0 /\ -k_1^post9+k_1^0 == 0 /\ j^0-j^post9 == 0 /\ -nodecount^post9+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post9 == 0), cost: 1
New rule:
l9 -> l8 : sourceflag^0 == 0, cost: 1

Applied preprocessing
Original rule:
l10 -> l11 : __lengthofvisited^0'=__lengthofvisited^post10, j^0'=j^post10, sourceflag^0'=sourceflag^post10, edgecount^0'=edgecount^post10, k_1^0'=k_1^post10, i^0'=i^post10, nodecount^0'=nodecount^post10, destflag^0'=destflag^post10, k^0'=k^post10, h^0'=h^post10, min^0'=min^post10, (-i^post10+i^0 == 0 /\ edgecount^0-edgecount^post10 == 0 /\ sourceflag^0-sourceflag^post10 == 0 /\ j^0-j^post10 == 0 /\ h^0-h^post10 == 0 /\ -destflag^post10+destflag^0 == 0 /\ k_1^0-k_1^post10 == 0 /\ -min^post10+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post10 == 0 /\ -k^post10+k^0 == 0 /\ nodecount^0-nodecount^post10 == 0), cost: 1
New rule:
l10 -> l11 : TRUE, cost: 1

Applied preprocessing
Original rule:
l12 -> l13 : __lengthofvisited^0'=__lengthofvisited^post11, j^0'=j^post11, sourceflag^0'=sourceflag^post11, edgecount^0'=edgecount^post11, k_1^0'=k_1^post11, i^0'=i^post11, nodecount^0'=nodecount^post11, destflag^0'=destflag^post11, k^0'=k^post11, h^0'=h^post11, min^0'=min^post11, (-edgecount^post11+edgecount^0 == 0 /\ -1-j^0+j^post11 == 0 /\ __lengthofvisited^0-__lengthofvisited^post11 == 0 /\ -destflag^post11+destflag^0 == 0 /\ -min^post11+min^0 == 0 /\ -k^post11+k^0 == 0 /\ i^0-i^post11 == 0 /\ -k_1^post11+k_1^0 == 0 /\ -h^post11+h^0 == 0 /\ -nodecount^post11+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post11 == 0), cost: 1
New rule:
l12 -> l13 : j^0'=1+j^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post12, j^0'=j^post12, sourceflag^0'=sourceflag^post12, edgecount^0'=edgecount^post12, k_1^0'=k_1^post12, i^0'=i^post12, nodecount^0'=nodecount^post12, destflag^0'=destflag^post12, k^0'=k^post12, h^0'=h^post12, min^0'=min^post12, (-h^post12+h^0 == 0 /\ edgecount^0-edgecount^post12 == 0 /\ destflag^0-destflag^post12 == 0 /\ __lengthofvisited^0-__lengthofvisited^post12 == 0 /\ sourceflag^0-sourceflag^post12 == 0 /\ -nodecount^post12+nodecount^0 == 0 /\ j^0-j^post12 == 0 /\ -min^post12+min^0 == 0 /\ -k^post12+k^0 == 0 /\ k_1^0-k_1^post12 == 0 /\ -i^post12+i^0 == 0), cost: 1
New rule:
l14 -> l12 : TRUE, cost: 1

Applied preprocessing
Original rule:
l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post13, j^0'=j^post13, sourceflag^0'=sourceflag^post13, edgecount^0'=edgecount^post13, k_1^0'=k_1^post13, i^0'=i^post13, nodecount^0'=nodecount^post13, destflag^0'=destflag^post13, k^0'=k^post13, h^0'=h^post13, min^0'=min^post13, (destflag^post13 == 0 /\ -i^post13+i^0 == 0 /\ j^0-j^post13 == 0 /\ h^0-h^post13 == 0 /\ sourceflag^0-sourceflag^post13 == 0 /\ __lengthofvisited^0-__lengthofvisited^post13 == 0 /\ -k^post13+k^0 == 0 /\ -min^post13+min^0 == 0 /\ k_1^0-k_1^post13 == 0 /\ -edgecount^post13+edgecount^0 == 0 /\ nodecount^0-nodecount^post13 == 0), cost: 1
New rule:
l14 -> l12 : destflag^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l14 -> l12 : __lengthofvisited^0'=__lengthofvisited^post14, j^0'=j^post14, sourceflag^0'=sourceflag^post14, edgecount^0'=edgecount^post14, k_1^0'=k_1^post14, i^0'=i^post14, nodecount^0'=nodecount^post14, destflag^0'=destflag^post14, k^0'=k^post14, h^0'=h^post14, min^0'=min^post14, (-edgecount^post14+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post14 == 0 /\ -destflag^post14+destflag^0 == 0 /\ -min^post14+min^0 == 0 /\ -k^post14+k^0 == 0 /\ i^0-i^post14 == 0 /\ j^0-j^post14 == 0 /\ -k_1^post14+k_1^0 == 0 /\ -h^post14+h^0 == 0 /\ -nodecount^post14+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post14 == 0), cost: 1
New rule:
l14 -> l12 : TRUE, cost: 1

Applied preprocessing
Original rule:
l15 -> l9 : __lengthofvisited^0'=__lengthofvisited^post15, j^0'=j^post15, sourceflag^0'=sourceflag^post15, edgecount^0'=edgecount^post15, k_1^0'=k_1^post15, i^0'=i^post15, nodecount^0'=nodecount^post15, destflag^0'=destflag^post15, k^0'=k^post15, h^0'=h^post15, min^0'=min^post15, (-h^post15+h^0 == 0 /\ destflag^0-destflag^post15 == 0 /\ edgecount^0-edgecount^post15 == 0 /\ sourceflag^0-sourceflag^post15 == 0 /\ j^0-j^post15 == 0 /\ -nodecount^post15+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post15 == 0 /\ k_1^0-k_1^post15 == 0 /\ -i^post15+i^0 == 0 /\ -j^0+nodecount^0 <= 0 /\ -k^post15+k^0 == 0 /\ -min^post15+min^0 == 0), cost: 1
New rule:
l15 -> l9 : -j^0+nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l15 -> l14 : __lengthofvisited^0'=__lengthofvisited^post16, j^0'=j^post16, sourceflag^0'=sourceflag^post16, edgecount^0'=edgecount^post16, k_1^0'=k_1^post16, i^0'=i^post16, nodecount^0'=nodecount^post16, destflag^0'=destflag^post16, k^0'=k^post16, h^0'=h^post16, min^0'=min^post16, (__lengthofvisited^0-__lengthofvisited^post16 == 0 /\ -destflag^post16+destflag^0 == 0 /\ -h^post16+h^0 == 0 /\ -k^post16+k^0 == 0 /\ -min^post16+min^0 == 0 /\ j^0-j^post16 == 0 /\ i^0-i^post16 == 0 /\ -k_1^post16+k_1^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -nodecount^post16+nodecount^0 == 0 /\ edgecount^0-edgecount^post16 == 0 /\ sourceflag^0-sourceflag^post16 == 0), cost: 1
New rule:
l15 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l16 -> l17 : __lengthofvisited^0'=__lengthofvisited^post17, j^0'=j^post17, sourceflag^0'=sourceflag^post17, edgecount^0'=edgecount^post17, k_1^0'=k_1^post17, i^0'=i^post17, nodecount^0'=nodecount^post17, destflag^0'=destflag^post17, k^0'=k^post17, h^0'=h^post17, min^0'=min^post17, (-h^post17+h^0 == 0 /\ edgecount^0-edgecount^post17 == 0 /\ __lengthofvisited^0-__lengthofvisited^post17 == 0 /\ destflag^0-destflag^post17 == 0 /\ sourceflag^0-sourceflag^post17 == 0 /\ -nodecount^post17+nodecount^0 == 0 /\ -min^post17+min^0 == 0 /\ -k^post17+k^0 == 0 /\ k_1^0-k_1^post17 == 0 /\ -i^post17+i^0 == 0 /\ -1-j^0+j^post17 == 0), cost: 1
New rule:
l16 -> l17 : j^0'=1+j^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l7 -> l18 : __lengthofvisited^0'=__lengthofvisited^post18, j^0'=j^post18, sourceflag^0'=sourceflag^post18, edgecount^0'=edgecount^post18, k_1^0'=k_1^post18, i^0'=i^post18, nodecount^0'=nodecount^post18, destflag^0'=destflag^post18, k^0'=k^post18, h^0'=h^post18, min^0'=min^post18, (sourceflag^0-sourceflag^post18 == 0 /\ nodecount^0-nodecount^post18 == 0 /\ i^0-i^post18 == 0 /\ j^0-j^post18 == 0 /\ -min^post18+min^0 == 0 /\ -k^post18+k^0 == 0 /\ k_1^0-k_1^post18 == 0 /\ -destflag^post18+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post18 == 0 /\ -h^post18+h^0 == 0 /\ -edgecount^post18+edgecount^0 == 0), cost: 1
New rule:
l7 -> l18 : TRUE, cost: 1

Applied preprocessing
Original rule:
l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post19, j^0'=j^post19, sourceflag^0'=sourceflag^post19, edgecount^0'=edgecount^post19, k_1^0'=k_1^post19, i^0'=i^post19, nodecount^0'=nodecount^post19, destflag^0'=destflag^post19, k^0'=k^post19, h^0'=h^post19, min^0'=min^post19, (__lengthofvisited^0-__lengthofvisited^post19 == 0 /\ -destflag^post19+destflag^0 == 0 /\ -min^post19+min^0 == 0 /\ -k^post19+k^0 == 0 /\ -edgecount^post19+edgecount^0 == 0 /\ j^0-j^post19 == 0 /\ -k_1^post19+k_1^0 == 0 /\ -h^post19+h^0 == 0 /\ i^0-i^post19 == 0 /\ -nodecount^post19+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post19 == 0), cost: 1
New rule:
l19 -> l16 : TRUE, cost: 1

Applied preprocessing
Original rule:
l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post20, j^0'=j^post20, sourceflag^0'=sourceflag^post20, edgecount^0'=edgecount^post20, k_1^0'=k_1^post20, i^0'=i^post20, nodecount^0'=nodecount^post20, destflag^0'=destflag^post20, k^0'=k^post20, h^0'=h^post20, min^0'=min^post20, (-1+sourceflag^post20 == 0 /\ edgecount^0-edgecount^post20 == 0 /\ destflag^0-destflag^post20 == 0 /\ j^0-j^post20 == 0 /\ -nodecount^post20+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post20 == 0 /\ k_1^0-k_1^post20 == 0 /\ -i^post20+i^0 == 0 /\ -h^post20+h^0 == 0 /\ -min^post20+min^0 == 0 /\ -k^post20+k^0 == 0), cost: 1
New rule:
l19 -> l16 : sourceflag^0'=1, TRUE, cost: 1

Applied preprocessing
Original rule:
l19 -> l16 : __lengthofvisited^0'=__lengthofvisited^post21, j^0'=j^post21, sourceflag^0'=sourceflag^post21, edgecount^0'=edgecount^post21, k_1^0'=k_1^post21, i^0'=i^post21, nodecount^0'=nodecount^post21, destflag^0'=destflag^post21, k^0'=k^post21, h^0'=h^post21, min^0'=min^post21, (i^0-i^post21 == 0 /\ nodecount^0-nodecount^post21 == 0 /\ -k^post21+k^0 == 0 /\ j^0-j^post21 == 0 /\ -min^post21+min^0 == 0 /\ sourceflag^0-sourceflag^post21 == 0 /\ __lengthofvisited^0-__lengthofvisited^post21 == 0 /\ k_1^0-k_1^post21 == 0 /\ -destflag^post21+destflag^0 == 0 /\ -h^post21+h^0 == 0 /\ edgecount^0-edgecount^post21 == 0), cost: 1
New rule:
l19 -> l16 : TRUE, cost: 1

Applied preprocessing
Original rule:
l20 -> l13 : __lengthofvisited^0'=__lengthofvisited^post22, j^0'=j^post22, sourceflag^0'=sourceflag^post22, edgecount^0'=edgecount^post22, k_1^0'=k_1^post22, i^0'=i^post22, nodecount^0'=nodecount^post22, destflag^0'=destflag^post22, k^0'=k^post22, h^0'=h^post22, min^0'=min^post22, (-h^post22+h^0 == 0 /\ sourceflag^0-sourceflag^post22 == 0 /\ edgecount^0-edgecount^post22 == 0 /\ __lengthofvisited^0-__lengthofvisited^post22 == 0 /\ -nodecount^post22+nodecount^0 == 0 /\ -min^post22+min^0 == 0 /\ -k^post22+k^0 == 0 /\ k_1^0-k_1^post22 == 0 /\ -i^post22+i^0 == 0 /\ -1+destflag^post22 == 0 /\ j^post22 == 0 /\ -j^0+nodecount^0 <= 0), cost: 1
New rule:
l20 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l20 -> l19 : __lengthofvisited^0'=__lengthofvisited^post23, j^0'=j^post23, sourceflag^0'=sourceflag^post23, edgecount^0'=edgecount^post23, k_1^0'=k_1^post23, i^0'=i^post23, nodecount^0'=nodecount^post23, destflag^0'=destflag^post23, k^0'=k^post23, h^0'=h^post23, min^0'=min^post23, (i^0-i^post23 == 0 /\ nodecount^0-nodecount^post23 == 0 /\ -min^post23+min^0 == 0 /\ -k^post23+k^0 == 0 /\ j^0-j^post23 == 0 /\ k_1^0-k_1^post23 == 0 /\ -destflag^post23+destflag^0 == 0 /\ sourceflag^0-sourceflag^post23 == 0 /\ __lengthofvisited^0-__lengthofvisited^post23 == 0 /\ -h^post23+h^0 == 0 /\ 1+j^0-nodecount^0 <= 0 /\ -edgecount^post23+edgecount^0 == 0), cost: 1
New rule:
l20 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l21 -> l22 : __lengthofvisited^0'=__lengthofvisited^post24, j^0'=j^post24, sourceflag^0'=sourceflag^post24, edgecount^0'=edgecount^post24, k_1^0'=k_1^post24, i^0'=i^post24, nodecount^0'=nodecount^post24, destflag^0'=destflag^post24, k^0'=k^post24, h^0'=h^post24, min^0'=min^post24, (__lengthofvisited^0-__lengthofvisited^post24 == 0 /\ k_1^0-k_1^post24 == 0 /\ -min^post24+min^0 == 0 /\ -nodecount^post24+nodecount^0 == 0 /\ -1+h^post24-h^0 == 0 /\ edgecount^0-edgecount^post24 == 0 /\ destflag^0-destflag^post24 == 0 /\ j^0-j^post24 == 0 /\ -sourceflag^post24+sourceflag^0 == 0 /\ i^0-i^post24 == 0 /\ k^0-k^post24 == 0), cost: 1
New rule:
l21 -> l22 : h^0'=1+h^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post25, j^0'=j^post25, sourceflag^0'=sourceflag^post25, edgecount^0'=edgecount^post25, k_1^0'=k_1^post25, i^0'=i^post25, nodecount^0'=nodecount^post25, destflag^0'=destflag^post25, k^0'=k^post25, h^0'=h^post25, min^0'=min^post25, (destflag^0-destflag^post25 == 0 /\ -nodecount^post25+nodecount^0 == 0 /\ edgecount^0-edgecount^post25 == 0 /\ sourceflag^0-sourceflag^post25 == 0 /\ j^0-j^post25 == 0 /\ __lengthofvisited^0-__lengthofvisited^post25 == 0 /\ k_1^0-k_1^post25 == 0 /\ -i^post25+i^0 == 0 /\ -h^post25+h^0 == 0 /\ min^post25-h^0 == 0 /\ -k^post25+k^0 == 0), cost: 1
New rule:
l23 -> l21 : min^0'=h^0, TRUE, cost: 1

Applied preprocessing
Original rule:
l23 -> l21 : __lengthofvisited^0'=__lengthofvisited^post26, j^0'=j^post26, sourceflag^0'=sourceflag^post26, edgecount^0'=edgecount^post26, k_1^0'=k_1^post26, i^0'=i^post26, nodecount^0'=nodecount^post26, destflag^0'=destflag^post26, k^0'=k^post26, h^0'=h^post26, min^0'=min^post26, (nodecount^0-nodecount^post26 == 0 /\ i^0-i^post26 == 0 /\ -min^post26+min^0 == 0 /\ -k^post26+k^0 == 0 /\ j^0-j^post26 == 0 /\ -destflag^post26+destflag^0 == 0 /\ sourceflag^0-sourceflag^post26 == 0 /\ k_1^0-k_1^post26 == 0 /\ __lengthofvisited^0-__lengthofvisited^post26 == 0 /\ -h^post26+h^0 == 0 /\ edgecount^0-edgecount^post26 == 0), cost: 1
New rule:
l23 -> l21 : TRUE, cost: 1

Applied preprocessing
Original rule:
l22 -> l24 : __lengthofvisited^0'=__lengthofvisited^post27, j^0'=j^post27, sourceflag^0'=sourceflag^post27, edgecount^0'=edgecount^post27, k_1^0'=k_1^post27, i^0'=i^post27, nodecount^0'=nodecount^post27, destflag^0'=destflag^post27, k^0'=k^post27, h^0'=h^post27, min^0'=min^post27, (__lengthofvisited^0-__lengthofvisited^post27 == 0 /\ -h^post27+h^0 == 0 /\ -k_1^post27+k_1^0 == 0 /\ -nodecount^post27+nodecount^0 == 0 /\ -k^post27+k^0 == 0 /\ -min^post27+min^0 == 0 /\ sourceflag^0-sourceflag^post27 == 0 /\ i^0-i^post27 == 0 /\ edgecount^0-edgecount^post27 == 0 /\ -destflag^post27+destflag^0 == 0 /\ j^0-j^post27 == 0), cost: 1
New rule:
l22 -> l24 : TRUE, cost: 1

Applied preprocessing
Original rule:
l24 -> l17 : __lengthofvisited^0'=__lengthofvisited^post28, j^0'=j^post28, sourceflag^0'=sourceflag^post28, edgecount^0'=edgecount^post28, k_1^0'=k_1^post28, i^0'=i^post28, nodecount^0'=nodecount^post28, destflag^0'=destflag^post28, k^0'=k^post28, h^0'=h^post28, min^0'=min^post28, (-min^post28+min^0 == 0 /\ nodecount^0-nodecount^post28 == 0 /\ i^0-i^post28 == 0 /\ -k^post28+k^0 == 0 /\ j^post28 == 0 /\ -destflag^post28+destflag^0 == 0 /\ k_1^0-k_1^post28 == 0 /\ __lengthofvisited^0-__lengthofvisited^post28 == 0 /\ sourceflag^post28 == 0 /\ edgecount^0-h^0 <= 0 /\ -h^post28+h^0 == 0 /\ -edgecount^post28+edgecount^0 == 0), cost: 1
New rule:
l24 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l24 -> l23 : __lengthofvisited^0'=__lengthofvisited^post29, j^0'=j^post29, sourceflag^0'=sourceflag^post29, edgecount^0'=edgecount^post29, k_1^0'=k_1^post29, i^0'=i^post29, nodecount^0'=nodecount^post29, destflag^0'=destflag^post29, k^0'=k^post29, h^0'=h^post29, min^0'=min^post29, (-k_1^post29+k_1^0 == 0 /\ -h^post29+h^0 == 0 /\ k^0-k^post29 == 0 /\ -nodecount^post29+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post29 == 0 /\ -min^post29+min^0 == 0 /\ edgecount^0-edgecount^post29 == 0 /\ destflag^0-destflag^post29 == 0 /\ -sourceflag^post29+sourceflag^0 == 0 /\ j^0-j^post29 == 0 /\ i^0-i^post29 == 0 /\ 1-edgecount^0+h^0 <= 0), cost: 1
New rule:
l24 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l18 -> l4 : __lengthofvisited^0'=__lengthofvisited^post30, j^0'=j^post30, sourceflag^0'=sourceflag^post30, edgecount^0'=edgecount^post30, k_1^0'=k_1^post30, i^0'=i^post30, nodecount^0'=nodecount^post30, destflag^0'=destflag^post30, k^0'=k^post30, h^0'=h^post30, min^0'=min^post30, (-i^post30+i^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post30 == 0 /\ -1+k^post30-k^0 == 0 /\ edgecount^0-edgecount^post30 == 0 /\ sourceflag^0-sourceflag^post30 == 0 /\ edgecount^0-k_1^0 <= 0 /\ -destflag^post30+destflag^0 == 0 /\ j^0-j^post30 == 0 /\ k_1^0-k_1^post30 == 0 /\ -min^post30+min^0 == 0 /\ nodecount^0-nodecount^post30 == 0 /\ -h^post30+h^0 == 0), cost: 1
New rule:
l18 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l18 -> l22 : __lengthofvisited^0'=__lengthofvisited^post31, j^0'=j^post31, sourceflag^0'=sourceflag^post31, edgecount^0'=edgecount^post31, k_1^0'=k_1^post31, i^0'=i^post31, nodecount^0'=nodecount^post31, destflag^0'=destflag^post31, k^0'=k^post31, h^0'=h^post31, min^0'=min^post31, (i^0-i^post31 == 0 /\ nodecount^0-nodecount^post31 == 0 /\ -min^post31+min^0 == 0 /\ -k^post31+k^0 == 0 /\ j^0-j^post31 == 0 /\ h^post31 == 0 /\ -destflag^post31+destflag^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post31 == 0 /\ k_1^0-k_1^post31 == 0 /\ sourceflag^0-sourceflag^post31 == 0 /\ 1-edgecount^0+k_1^0 <= 0 /\ edgecount^0-edgecount^post31 == 0), cost: 1
New rule:
l18 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l7 : __lengthofvisited^0'=__lengthofvisited^post32, j^0'=j^post32, sourceflag^0'=sourceflag^post32, edgecount^0'=edgecount^post32, k_1^0'=k_1^post32, i^0'=i^post32, nodecount^0'=nodecount^post32, destflag^0'=destflag^post32, k^0'=k^post32, h^0'=h^post32, min^0'=min^post32, (-h^post32+h^0 == 0 /\ k_1^post32 == 0 /\ -nodecount^post32+nodecount^0 == 0 /\ k^0-k^post32 == 0 /\ -min^post32+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post32 == 0 /\ edgecount^0-edgecount^post32 == 0 /\ sourceflag^0-sourceflag^post32 == 0 /\ j^0-j^post32 == 0 /\ i^0-i^post32 == 0 /\ -destflag^post32+destflag^0 == 0 /\ edgecount^0-i^0 <= 0), cost: 1
New rule:
l11 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l11 -> l10 : __lengthofvisited^0'=__lengthofvisited^post33, j^0'=j^post33, sourceflag^0'=sourceflag^post33, edgecount^0'=edgecount^post33, k_1^0'=k_1^post33, i^0'=i^post33, nodecount^0'=nodecount^post33, destflag^0'=destflag^post33, k^0'=k^post33, h^0'=h^post33, min^0'=min^post33, (-min^post33+min^0 == 0 /\ nodecount^0-nodecount^post33 == 0 /\ -k^post33+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post33 == 0 /\ -1+i^post33-i^0 == 0 /\ edgecount^0-edgecount^post33 == 0 /\ -destflag^post33+destflag^0 == 0 /\ sourceflag^0-sourceflag^post33 == 0 /\ -h^post33+h^0 == 0 /\ 1-edgecount^0+i^0 <= 0 /\ -j^post33+j^0 == 0 /\ k_1^0-k_1^post33 == 0), cost: 1
New rule:
l11 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l17 -> l20 : __lengthofvisited^0'=__lengthofvisited^post34, j^0'=j^post34, sourceflag^0'=sourceflag^post34, edgecount^0'=edgecount^post34, k_1^0'=k_1^post34, i^0'=i^post34, nodecount^0'=nodecount^post34, destflag^0'=destflag^post34, k^0'=k^post34, h^0'=h^post34, min^0'=min^post34, (-h^post34+h^0 == 0 /\ -k_1^post34+k_1^0 == 0 /\ k^0-k^post34 == 0 /\ -nodecount^post34+nodecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post34 == 0 /\ -min^post34+min^0 == 0 /\ edgecount^0-edgecount^post34 == 0 /\ destflag^0-destflag^post34 == 0 /\ j^0-j^post34 == 0 /\ i^0-i^post34 == 0 /\ -sourceflag^post34+sourceflag^0 == 0), cost: 1
New rule:
l17 -> l20 : TRUE, cost: 1

Applied preprocessing
Original rule:
l25 -> l10 : __lengthofvisited^0'=__lengthofvisited^post35, j^0'=j^post35, sourceflag^0'=sourceflag^post35, edgecount^0'=edgecount^post35, k_1^0'=k_1^post35, i^0'=i^post35, nodecount^0'=nodecount^post35, destflag^0'=destflag^post35, k^0'=k^post35, h^0'=h^post35, min^0'=min^post35, (i^post35 == 0 /\ h^0-h^post35 == 0 /\ sourceflag^0-sourceflag^post35 == 0 /\ edgecount^0-edgecount^post35 == 0 /\ -destflag^post35+destflag^0 == 0 /\ j^0-j^post35 == 0 /\ k_1^0-k_1^post35 == 0 /\ __lengthofvisited^0-__lengthofvisited^post35 == 0 /\ -k^post35+k^0 == 0 /\ min^post35 == 0 /\ nodecount^0-nodecount^post35 == 0), cost: 1
New rule:
l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1

Applied preprocessing
Original rule:
l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post37, j^0'=j^post37, sourceflag^0'=sourceflag^post37, edgecount^0'=edgecount^post37, k_1^0'=k_1^post37, i^0'=i^post37, nodecount^0'=nodecount^post37, destflag^0'=destflag^post37, k^0'=k^post37, h^0'=h^post37, min^0'=min^post37, (-k_1^post37+k_1^0 == 0 /\ -h^post37+h^0 == 0 /\ -nodecount^post37+nodecount^0 == 0 /\ k^0-k^post37 == 0 /\ -min^post37+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post37 == 0 /\ edgecount^0-edgecount^post37 == 0 /\ sourceflag^0-sourceflag^post37 == 0 /\ nodecount^0-k^0 <= 0 /\ j^0-j^post37 == 0 /\ i^0-i^post37 == 0 /\ -destflag^post37+destflag^0 == 0), cost: 1
New rule:
l5 -> l25 : nodecount^0-k^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l5 -> l25 : __lengthofvisited^0'=__lengthofvisited^post38, j^0'=j^post38, sourceflag^0'=sourceflag^post38, edgecount^0'=edgecount^post38, k_1^0'=k_1^post38, i^0'=i^post38, nodecount^0'=nodecount^post38, destflag^0'=destflag^post38, k^0'=k^post38, h^0'=h^post38, min^0'=min^post38, (-i^post38+i^0 == 0 /\ -k^post38+k^0 == 0 /\ -min^post38+min^0 == 0 /\ h^0-h^post38 == 0 /\ edgecount^0-edgecount^post38 == 0 /\ nodecount^0-nodecount^post38 == 0 /\ sourceflag^0-sourceflag^post38 == 0 /\ -destflag^post38+destflag^0 == 0 /\ -j^post38+j^0 == 0 /\ k_1^0-k_1^post38 == 0 /\ 2-nodecount^0+k^0 <= 0 /\ __lengthofvisited^0-__lengthofvisited^post38 == 0), cost: 1
New rule:
l5 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l4 : __lengthofvisited^0'=__lengthofvisited^post39, j^0'=j^post39, sourceflag^0'=sourceflag^post39, edgecount^0'=edgecount^post39, k_1^0'=k_1^post39, i^0'=i^post39, nodecount^0'=nodecount^post39, destflag^0'=destflag^post39, k^0'=k^post39, h^0'=h^post39, min^0'=min^post39, (-h^post39+h^0 == 0 /\ -k_1^post39+k_1^0 == 0 /\ -nodecount^post39+nodecount^0 == 0 /\ -edgecount^post39+edgecount^0 == 0 /\ j^0-j^post39 == 0 /\ -min^post39+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post39 == 0 /\ -1-i^0+nodecount^0 <= 0 /\ sourceflag^0-sourceflag^post39 == 0 /\ destflag^0-destflag^post39 == 0 /\ i^0-i^post39 == 0 /\ k^post39 == 0), cost: 1
New rule:
l3 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l3 -> l2 : __lengthofvisited^0'=__lengthofvisited^post40, j^0'=j^post40, sourceflag^0'=sourceflag^post40, edgecount^0'=edgecount^post40, k_1^0'=k_1^post40, i^0'=i^post40, nodecount^0'=nodecount^post40, destflag^0'=destflag^post40, k^0'=k^post40, h^0'=h^post40, min^0'=min^post40, (2+i^0-nodecount^0 <= 0 /\ h^0-h^post40 == 0 /\ sourceflag^0-sourceflag^post40 == 0 /\ -destflag^post40+destflag^0 == 0 /\ edgecount^0-edgecount^post40 == 0 /\ -1+i^post40-i^0 == 0 /\ j^0-j^post40 == 0 /\ -min^post40+min^0 == 0 /\ -k^post40+k^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post40 == 0 /\ k_1^0-k_1^post40 == 0 /\ nodecount^0-nodecount^post40 == 0), cost: 1
New rule:
l3 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l13 -> l15 : __lengthofvisited^0'=__lengthofvisited^post41, j^0'=j^post41, sourceflag^0'=sourceflag^post41, edgecount^0'=edgecount^post41, k_1^0'=k_1^post41, i^0'=i^post41, nodecount^0'=nodecount^post41, destflag^0'=destflag^post41, k^0'=k^post41, h^0'=h^post41, min^0'=min^post41, (-edgecount^post41+edgecount^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post41 == 0 /\ -destflag^post41+destflag^0 == 0 /\ -min^post41+min^0 == 0 /\ -k^post41+k^0 == 0 /\ i^0-i^post41 == 0 /\ j^0-j^post41 == 0 /\ -h^post41+h^0 == 0 /\ -k_1^post41+k_1^0 == 0 /\ -nodecount^post41+nodecount^0 == 0 /\ sourceflag^0-sourceflag^post41 == 0), cost: 1
New rule:
l13 -> l15 : TRUE, cost: 1

Applied preprocessing
Original rule:
l1 -> l2 : __lengthofvisited^0'=__lengthofvisited^post42, j^0'=j^post42, sourceflag^0'=sourceflag^post42, edgecount^0'=edgecount^post42, k_1^0'=k_1^post42, i^0'=i^post42, nodecount^0'=nodecount^post42, destflag^0'=destflag^post42, k^0'=k^post42, h^0'=h^post42, min^0'=min^post42, (-h^post42+h^0 == 0 /\ -k_1^post42+k_1^0 == 0 /\ edgecount^0-edgecount^post42 == 0 /\ sourceflag^0-sourceflag^post42 == 0 /\ j^0-j^post42 == 0 /\ -i^0+nodecount^0 <= 0 /\ -nodecount^post42+nodecount^0 == 0 /\ -min^post42+min^0 == 0 /\ k^0-k^post42 == 0 /\ __lengthofvisited^0-__lengthofvisited^post42 == 0 /\ i^post42 == 0 /\ -destflag^post42+destflag^0 == 0), cost: 1
New rule:
l1 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l1 -> l0 : __lengthofvisited^0'=__lengthofvisited^post43, j^0'=j^post43, sourceflag^0'=sourceflag^post43, edgecount^0'=edgecount^post43, k_1^0'=k_1^post43, i^0'=i^post43, nodecount^0'=nodecount^post43, destflag^0'=destflag^post43, k^0'=k^post43, h^0'=h^post43, min^0'=min^post43, (-min^post43+min^0 == 0 /\ -k^post43+k^0 == 0 /\ 1+i^0-nodecount^0 <= 0 /\ h^0-h^post43 == 0 /\ edgecount^0-edgecount^post43 == 0 /\ -destflag^post43+destflag^0 == 0 /\ nodecount^0-nodecount^post43 == 0 /\ sourceflag^0-sourceflag^post43 == 0 /\ -j^post43+j^0 == 0 /\ k_1^0-k_1^post43 == 0 /\ __lengthofvisited^0-__lengthofvisited^post43 == 0 /\ -1+i^post43-i^0 == 0), cost: 1
New rule:
l1 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 1

Applied preprocessing
Original rule:
l27 -> l0 : __lengthofvisited^0'=__lengthofvisited^post44, j^0'=j^post44, sourceflag^0'=sourceflag^post44, edgecount^0'=edgecount^post44, k_1^0'=k_1^post44, i^0'=i^post44, nodecount^0'=nodecount^post44, destflag^0'=destflag^post44, k^0'=k^post44, h^0'=h^post44, min^0'=min^post44, (-destflag^post44+destflag^0 == 0 /\ -1+i^post44 == 0 /\ -h^post44+h^0 == 0 /\ -min^post44+min^0 == 0 /\ -k^post44+k^0 == 0 /\ -k_1^post44+k_1^0 == 0 /\ -edgecount^post44+edgecount^0 == 0 /\ j^0-j^post44 == 0 /\ -nodecount^post44+nodecount^0 == 0 /\ -edgecount^0+__lengthofvisited^post44 == 0 /\ sourceflag^0-sourceflag^post44 == 0), cost: 1
New rule:
l27 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 1

Applied preprocessing
Original rule:
l28 -> l27 : __lengthofvisited^0'=__lengthofvisited^post45, j^0'=j^post45, sourceflag^0'=sourceflag^post45, edgecount^0'=edgecount^post45, k_1^0'=k_1^post45, i^0'=i^post45, nodecount^0'=nodecount^post45, destflag^0'=destflag^post45, k^0'=k^post45, h^0'=h^post45, min^0'=min^post45, (-i^post45+i^0 == 0 /\ j^0-j^post45 == 0 /\ edgecount^0-edgecount^post45 == 0 /\ h^0-h^post45 == 0 /\ -destflag^post45+destflag^0 == 0 /\ sourceflag^0-sourceflag^post45 == 0 /\ -min^post45+min^0 == 0 /\ __lengthofvisited^0-__lengthofvisited^post45 == 0 /\ -k^post45+k^0 == 0 /\ k_1^0-k_1^post45 == 0 /\ nodecount^0-nodecount^post45 == 0), cost: 1
New rule:
l28 -> l27 : TRUE, cost: 1

Applied deletion
Removed the following rules: 58 65

Simplified rules
Start location: l28
  46: l0 -> l1 : TRUE, cost: 1
  87: l1 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 1
  88: l1 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 1
  47: l2 -> l3 : TRUE, cost: 1
  84: l3 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 1
  85: l3 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 1
  48: l4 -> l5 : TRUE, cost: 1
  82: l5 -> l25 : nodecount^0-k^0 <= 0, cost: 1
  83: l5 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 1
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
  64: l7 -> l18 : TRUE, cost: 1
  50: l8 -> l6 : -1+destflag^0 >= 0, cost: 1
  51: l8 -> l6 : 1+destflag^0 <= 0, cost: 1
  52: l8 -> l6 : destflag^0 == 0, cost: 1
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
  55: l9 -> l8 : sourceflag^0 == 0, cost: 1
  56: l10 -> l11 : TRUE, cost: 1
  78: l11 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 1
  79: l11 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 1
  57: l12 -> l13 : j^0'=1+j^0, TRUE, cost: 1
  86: l13 -> l15 : TRUE, cost: 1
  59: l14 -> l12 : destflag^0'=0, TRUE, cost: 1
  60: l14 -> l12 : TRUE, cost: 1
  61: l15 -> l9 : -j^0+nodecount^0 <= 0, cost: 1
  62: l15 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 1
  63: l16 -> l17 : j^0'=1+j^0, TRUE, cost: 1
  80: l17 -> l20 : TRUE, cost: 1
  76: l18 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 1
  77: l18 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 1
  66: l19 -> l16 : sourceflag^0'=1, TRUE, cost: 1
  67: l19 -> l16 : TRUE, cost: 1
  68: l20 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 1
  69: l20 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 1
  70: l21 -> l22 : h^0'=1+h^0, TRUE, cost: 1
  73: l22 -> l24 : TRUE, cost: 1
  71: l23 -> l21 : min^0'=h^0, TRUE, cost: 1
  72: l23 -> l21 : TRUE, cost: 1
  74: l24 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 1
  75: l24 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 1
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
  89: l27 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 1
  90: l28 -> l27 : TRUE, cost: 1


Eliminating location l27 by chaining:

Applied chaining
First rule:
l28 -> l27 : TRUE, cost: 1
Second rule:
l27 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 1
New rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2

Applied deletion
Removed the following rules: 89 90

Eliminated locations on linear paths
Start location: l28
  46: l0 -> l1 : TRUE, cost: 1
  87: l1 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 1
  88: l1 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 1
  47: l2 -> l3 : TRUE, cost: 1
  84: l3 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 1
  85: l3 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 1
  48: l4 -> l5 : TRUE, cost: 1
  82: l5 -> l25 : nodecount^0-k^0 <= 0, cost: 1
  83: l5 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 1
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
  64: l7 -> l18 : TRUE, cost: 1
  50: l8 -> l6 : -1+destflag^0 >= 0, cost: 1
  51: l8 -> l6 : 1+destflag^0 <= 0, cost: 1
  52: l8 -> l6 : destflag^0 == 0, cost: 1
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
  55: l9 -> l8 : sourceflag^0 == 0, cost: 1
  56: l10 -> l11 : TRUE, cost: 1
  78: l11 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 1
  79: l11 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 1
  57: l12 -> l13 : j^0'=1+j^0, TRUE, cost: 1
  86: l13 -> l15 : TRUE, cost: 1
  59: l14 -> l12 : destflag^0'=0, TRUE, cost: 1
  60: l14 -> l12 : TRUE, cost: 1
  61: l15 -> l9 : -j^0+nodecount^0 <= 0, cost: 1
  62: l15 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 1
  63: l16 -> l17 : j^0'=1+j^0, TRUE, cost: 1
  80: l17 -> l20 : TRUE, cost: 1
  76: l18 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 1
  77: l18 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 1
  66: l19 -> l16 : sourceflag^0'=1, TRUE, cost: 1
  67: l19 -> l16 : TRUE, cost: 1
  68: l20 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 1
  69: l20 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 1
  70: l21 -> l22 : h^0'=1+h^0, TRUE, cost: 1
  73: l22 -> l24 : TRUE, cost: 1
  71: l23 -> l21 : min^0'=h^0, TRUE, cost: 1
  72: l23 -> l21 : TRUE, cost: 1
  74: l24 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 1
  75: l24 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 1
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
  91: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2


Eliminating location l1 by chaining:

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

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

Applied deletion
Removed the following rules: 46 87 88

Eliminating location l3 by chaining:

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

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

Applied deletion
Removed the following rules: 47 84 85

Eliminating location l5 by chaining:

Applied chaining
First rule:
l4 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l25 : nodecount^0-k^0 <= 0, cost: 1
New rule:
l4 -> l25 : nodecount^0-k^0 <= 0, cost: 2

Applied chaining
First rule:
l4 -> l5 : TRUE, cost: 1
Second rule:
l5 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 1
New rule:
l4 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 48 82 83

Eliminating location l11 by chaining:

Applied chaining
First rule:
l10 -> l11 : TRUE, cost: 1
Second rule:
l11 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 1
New rule:
l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2

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

Applied deletion
Removed the following rules: 56 78 79

Eliminating location l18 by chaining:

Applied chaining
First rule:
l7 -> l18 : TRUE, cost: 1
Second rule:
l18 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 1
New rule:
l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2

Applied chaining
First rule:
l7 -> l18 : TRUE, cost: 1
Second rule:
l18 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 1
New rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 64 76 77

Eliminating location l24 by chaining:

Applied chaining
First rule:
l22 -> l24 : TRUE, cost: 1
Second rule:
l24 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 1
New rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2

Applied chaining
First rule:
l22 -> l24 : TRUE, cost: 1
Second rule:
l24 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 1
New rule:
l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 73 74 75

Eliminating location l20 by chaining:

Applied chaining
First rule:
l17 -> l20 : TRUE, cost: 1
Second rule:
l20 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 1
New rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2

Applied chaining
First rule:
l17 -> l20 : TRUE, cost: 1
Second rule:
l20 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 1
New rule:
l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 68 69 80

Eliminating location l15 by chaining:

Applied chaining
First rule:
l13 -> l15 : TRUE, cost: 1
Second rule:
l15 -> l9 : -j^0+nodecount^0 <= 0, cost: 1
New rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2

Applied chaining
First rule:
l13 -> l15 : TRUE, cost: 1
Second rule:
l15 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 1
New rule:
l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2

Applied deletion
Removed the following rules: 61 62 86

Eliminating location l8 by chaining:

Applied chaining
First rule:
l9 -> l8 : sourceflag^0 == 0, cost: 1
Second rule:
l8 -> l6 : -1+destflag^0 >= 0, cost: 1
New rule:
l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2

Applied chaining
First rule:
l9 -> l8 : sourceflag^0 == 0, cost: 1
Second rule:
l8 -> l6 : 1+destflag^0 <= 0, cost: 1
New rule:
l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2

Applied chaining
First rule:
l9 -> l8 : sourceflag^0 == 0, cost: 1
Second rule:
l8 -> l6 : destflag^0 == 0, cost: 1
New rule:
l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2

Applied deletion
Removed the following rules: 50 51 52 55

Eliminating location l12 by chaining:

Applied chaining
First rule:
l14 -> l12 : destflag^0'=0, TRUE, cost: 1
Second rule:
l12 -> l13 : j^0'=1+j^0, TRUE, cost: 1
New rule:
l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2

Applied chaining
First rule:
l14 -> l12 : TRUE, cost: 1
Second rule:
l12 -> l13 : j^0'=1+j^0, TRUE, cost: 1
New rule:
l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2

Applied deletion
Removed the following rules: 57 59 60

Eliminating location l16 by chaining:

Applied chaining
First rule:
l19 -> l16 : sourceflag^0'=1, TRUE, cost: 1
Second rule:
l16 -> l17 : j^0'=1+j^0, TRUE, cost: 1
New rule:
l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2

Applied chaining
First rule:
l19 -> l16 : TRUE, cost: 1
Second rule:
l16 -> l17 : j^0'=1+j^0, TRUE, cost: 1
New rule:
l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2

Applied deletion
Removed the following rules: 63 66 67

Eliminating location l21 by chaining:

Applied chaining
First rule:
l23 -> l21 : min^0'=h^0, TRUE, cost: 1
Second rule:
l21 -> l22 : h^0'=1+h^0, TRUE, cost: 1
New rule:
l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2

Applied chaining
First rule:
l23 -> l21 : TRUE, cost: 1
Second rule:
l21 -> l22 : h^0'=1+h^0, TRUE, cost: 1
New rule:
l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2

Applied deletion
Removed the following rules: 70 71 72

Eliminated locations on tree-shaped paths
Start location: l28
  92: l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
  93: l0 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 2
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
  95: l2 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 2
  96: l4 -> l25 : nodecount^0-k^0 <= 0, cost: 2
  97: l4 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 2
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
 108: l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2
 109: l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2
 110: l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
  99: l10 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 2
 106: l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
 107: l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
 111: l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2
 112: l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 105: l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
 113: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2
 114: l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 103: l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
 115: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2
 116: l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
  91: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2


Applied merging
first rule:
l4 -> l25 : nodecount^0-k^0 <= 0, cost: 2
second rule:
l4 -> l25 : 2-nodecount^0+k^0 <= 0, cost: 2
new rule:
l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2

Merged rules
Start location: l28
  92: l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
  93: l0 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 2
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
  95: l2 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 2
 117: l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
 108: l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2
 109: l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2
 110: l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
  99: l10 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 2
 106: l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
 107: l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
 111: l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2
 112: l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 105: l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
 113: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2
 114: l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 103: l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
 115: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2
 116: l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
  91: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2


Applied acceleration
Original rule:
l0 -> l0 : i^0'=1+i^0, 1+i^0-nodecount^0 <= 0, cost: 2
New rule:
l0 -> l0 : i^0'=i^0+n0, (-i^0+nodecount^0-n0 >= 0 /\ n0 >= 0), cost: 2*n0

Applied instantiation
Original rule:
l0 -> l0 : i^0'=i^0+n0, (-i^0+nodecount^0-n0 >= 0 /\ n0 >= 0), cost: 2*n0
New rule:
l0 -> l0 : i^0'=nodecount^0, (0 >= 0 /\ -i^0+nodecount^0 >= 0), cost: -2*i^0+2*nodecount^0

Applied simplification
Original rule:
l0 -> l0 : i^0'=nodecount^0, (0 >= 0 /\ -i^0+nodecount^0 >= 0), cost: -2*i^0+2*nodecount^0
New rule:
l0 -> l0 : i^0'=nodecount^0, -i^0+nodecount^0 >= 0, cost: -2*i^0+2*nodecount^0

Applied deletion
Removed the following rules: 93

Applied acceleration
Original rule:
l2 -> l2 : i^0'=1+i^0, 2+i^0-nodecount^0 <= 0, cost: 2
New rule:
l2 -> l2 : i^0'=n3+i^0, (n3 >= 0 /\ -1-n3-i^0+nodecount^0 >= 0), cost: 2*n3

Applied instantiation
Original rule:
l2 -> l2 : i^0'=n3+i^0, (n3 >= 0 /\ -1-n3-i^0+nodecount^0 >= 0), cost: 2*n3
New rule:
l2 -> l2 : i^0'=-1+nodecount^0, (0 >= 0 /\ -1-i^0+nodecount^0 >= 0), cost: -2-2*i^0+2*nodecount^0

Applied simplification
Original rule:
l2 -> l2 : i^0'=-1+nodecount^0, (0 >= 0 /\ -1-i^0+nodecount^0 >= 0), cost: -2-2*i^0+2*nodecount^0
New rule:
l2 -> l2 : i^0'=-1+nodecount^0, -1-i^0+nodecount^0 >= 0, cost: -2-2*i^0+2*nodecount^0

Applied deletion
Removed the following rules: 95

Applied acceleration
Original rule:
l10 -> l10 : i^0'=1+i^0, 1-edgecount^0+i^0 <= 0, cost: 2
New rule:
l10 -> l10 : i^0'=i^0+n6, (edgecount^0-i^0-n6 >= 0 /\ n6 >= 0), cost: 2*n6

Applied instantiation
Original rule:
l10 -> l10 : i^0'=i^0+n6, (edgecount^0-i^0-n6 >= 0 /\ n6 >= 0), cost: 2*n6
New rule:
l10 -> l10 : i^0'=edgecount^0, (0 >= 0 /\ edgecount^0-i^0 >= 0), cost: 2*edgecount^0-2*i^0

Applied simplification
Original rule:
l10 -> l10 : i^0'=edgecount^0, (0 >= 0 /\ edgecount^0-i^0 >= 0), cost: 2*edgecount^0-2*i^0
New rule:
l10 -> l10 : i^0'=edgecount^0, edgecount^0-i^0 >= 0, cost: 2*edgecount^0-2*i^0

Applied deletion
Removed the following rules: 99

Accelerated simple loops
Start location: l28
  92: l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
 119: l0 -> l0 : i^0'=nodecount^0, -i^0+nodecount^0 >= 0, cost: -2*i^0+2*nodecount^0
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
 121: l2 -> l2 : i^0'=-1+nodecount^0, -1-i^0+nodecount^0 >= 0, cost: -2-2*i^0+2*nodecount^0
 117: l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
 108: l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2
 109: l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2
 110: l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
 123: l10 -> l10 : i^0'=edgecount^0, edgecount^0-i^0 >= 0, cost: 2*edgecount^0-2*i^0
 106: l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
 107: l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
 111: l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2
 112: l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 105: l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
 113: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2
 114: l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 103: l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
 115: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2
 116: l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
  91: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2


Applied chaining
First rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2
Second rule:
l0 -> l0 : i^0'=nodecount^0, -i^0+nodecount^0 >= 0, cost: -2*i^0+2*nodecount^0
New rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=nodecount^0, -1+nodecount^0 >= 0, cost: 2*nodecount^0

Applied deletion
Removed the following rules: 119

Applied chaining
First rule:
l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
Second rule:
l2 -> l2 : i^0'=-1+nodecount^0, -1-i^0+nodecount^0 >= 0, cost: -2-2*i^0+2*nodecount^0
New rule:
l0 -> l2 : i^0'=-1+nodecount^0, (-1+nodecount^0 >= 0 /\ -i^0+nodecount^0 <= 0), cost: 2*nodecount^0

Applied deletion
Removed the following rules: 121

Applied chaining
First rule:
l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
Second rule:
l10 -> l10 : i^0'=edgecount^0, edgecount^0-i^0 >= 0, cost: 2*edgecount^0-2*i^0
New rule:
l25 -> l10 : i^0'=edgecount^0, min^0'=0, edgecount^0 >= 0, cost: 1+2*edgecount^0

Applied deletion
Removed the following rules: 123

Chained accelerated rules with incoming rules
Start location: l28
  92: l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
 125: l0 -> l2 : i^0'=-1+nodecount^0, (-1+nodecount^0 >= 0 /\ -i^0+nodecount^0 <= 0), cost: 2*nodecount^0
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
 117: l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  53: l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
  54: l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
 108: l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2
 109: l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2
 110: l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
 106: l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
 107: l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
 111: l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2
 112: l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 105: l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
 113: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2
 114: l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 103: l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
 115: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2
 116: l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2
  81: l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
 126: l25 -> l10 : i^0'=edgecount^0, min^0'=0, edgecount^0 >= 0, cost: 1+2*edgecount^0
  91: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2
 124: l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=nodecount^0, -1+nodecount^0 >= 0, cost: 2*nodecount^0


Eliminating location l0 by chaining:

Applied chaining
First rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2
Second rule:
l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 <= 0, cost: 4

Applied chaining
First rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=1, TRUE, cost: 2
Second rule:
l0 -> l2 : i^0'=-1+nodecount^0, (-1+nodecount^0 >= 0 /\ -i^0+nodecount^0 <= 0), cost: 2*nodecount^0
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0

Applied chaining
First rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=nodecount^0, -1+nodecount^0 >= 0, cost: 2*nodecount^0
Second rule:
l0 -> l2 : i^0'=0, -i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0

Applied simplification
Original rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 >= 0, cost: 2+2*nodecount^0

Applied chaining
First rule:
l28 -> l0 : __lengthofvisited^0'=edgecount^0, i^0'=nodecount^0, -1+nodecount^0 >= 0, cost: 2*nodecount^0
Second rule:
l0 -> l2 : i^0'=-1+nodecount^0, (-1+nodecount^0 >= 0 /\ -i^0+nodecount^0 <= 0), cost: 2*nodecount^0
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4*nodecount^0

Applied simplification
Original rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4*nodecount^0
New rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, -1+nodecount^0 >= 0, cost: 4*nodecount^0

Applied deletion
Removed the following rules: 91 92 124 125

Eliminating location l25 by chaining:

Applied chaining
First rule:
l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2
Second rule:
l25 -> l10 : i^0'=0, min^0'=0, TRUE, cost: 1
New rule:
l4 -> l10 : i^0'=0, min^0'=0, (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 3

Applied chaining
First rule:
l4 -> l25 : (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 2
Second rule:
l25 -> l10 : i^0'=edgecount^0, min^0'=0, edgecount^0 >= 0, cost: 1+2*edgecount^0
New rule:
l4 -> l10 : i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 3+2*edgecount^0

Applied deletion
Removed the following rules: 81 117 126

Eliminating location l23 by chaining:

Applied chaining
First rule:
l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
Second rule:
l23 -> l22 : h^0'=1+h^0, min^0'=h^0, TRUE, cost: 2
New rule:
l22 -> l22 : h^0'=1+h^0, min^0'=h^0, 1-edgecount^0+h^0 <= 0, cost: 4

Applied chaining
First rule:
l22 -> l23 : 1-edgecount^0+h^0 <= 0, cost: 2
Second rule:
l23 -> l22 : h^0'=1+h^0, TRUE, cost: 2
New rule:
l22 -> l22 : h^0'=1+h^0, 1-edgecount^0+h^0 <= 0, cost: 4

Applied deletion
Removed the following rules: 103 115 116

Eliminating location l19 by chaining:

Applied chaining
First rule:
l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
Second rule:
l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, TRUE, cost: 2
New rule:
l17 -> l17 : j^0'=1+j^0, sourceflag^0'=1, 1+j^0-nodecount^0 <= 0, cost: 4

Applied chaining
First rule:
l17 -> l19 : 1+j^0-nodecount^0 <= 0, cost: 2
Second rule:
l19 -> l17 : j^0'=1+j^0, TRUE, cost: 2
New rule:
l17 -> l17 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4

Applied deletion
Removed the following rules: 105 113 114

Eliminating location l9 by chaining:

Applied chaining
First rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l9 -> l6 : -1+sourceflag^0 >= 0, cost: 1
New rule:
l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3

Applied chaining
First rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l9 -> l6 : 1+sourceflag^0 <= 0, cost: 1
New rule:
l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3

Applied chaining
First rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l9 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0), cost: 2
New rule:
l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4

Applied chaining
First rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l9 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0), cost: 2
New rule:
l13 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 4

Applied chaining
First rule:
l13 -> l9 : -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l9 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0), cost: 2
New rule:
l13 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0 /\ -j^0+nodecount^0 <= 0), cost: 4

Applied deletion
Removed the following rules: 53 54 106 108 109 110

Eliminating location l14 by chaining:

Applied chaining
First rule:
l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
Second rule:
l14 -> l13 : j^0'=1+j^0, destflag^0'=0, TRUE, cost: 2
New rule:
l13 -> l13 : j^0'=1+j^0, destflag^0'=0, 1+j^0-nodecount^0 <= 0, cost: 4

Applied chaining
First rule:
l13 -> l14 : 1+j^0-nodecount^0 <= 0, cost: 2
Second rule:
l14 -> l13 : j^0'=1+j^0, TRUE, cost: 2
New rule:
l13 -> l13 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4

Applied deletion
Removed the following rules: 107 111 112

Eliminated locations on tree-shaped paths
Start location: l28
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
 131: l4 -> l10 : i^0'=0, min^0'=0, (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 3
 132: l4 -> l10 : i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 3+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
 137: l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 138: l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 139: l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 140: l13 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 141: l13 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 142: l13 -> l13 : j^0'=1+j^0, destflag^0'=0, 1+j^0-nodecount^0 <= 0, cost: 4
 143: l13 -> l13 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 135: l17 -> l17 : j^0'=1+j^0, sourceflag^0'=1, 1+j^0-nodecount^0 <= 0, cost: 4
 136: l17 -> l17 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 133: l22 -> l22 : h^0'=1+h^0, min^0'=h^0, 1-edgecount^0+h^0 <= 0, cost: 4
 134: l22 -> l22 : h^0'=1+h^0, 1-edgecount^0+h^0 <= 0, cost: 4
 127: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 <= 0, cost: 4
 128: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0
 129: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 >= 0, cost: 2+2*nodecount^0
 130: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, -1+nodecount^0 >= 0, cost: 4*nodecount^0


Applied acceleration
Original rule:
l13 -> l13 : j^0'=1+j^0, destflag^0'=0, 1+j^0-nodecount^0 <= 0, cost: 4
New rule:
l13 -> l13 : j^0'=j^0+n10, destflag^0'=0, (-1+n10 >= 0 /\ -j^0+nodecount^0-n10 >= 0), cost: 4*n10

Applied instantiation
Original rule:
l13 -> l13 : j^0'=j^0+n10, destflag^0'=0, (-1+n10 >= 0 /\ -j^0+nodecount^0-n10 >= 0), cost: 4*n10
New rule:
l13 -> l13 : j^0'=nodecount^0, destflag^0'=0, (0 >= 0 /\ -1-j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0

Applied acceleration
Original rule:
l13 -> l13 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4
New rule:
l13 -> l13 : j^0'=j^0+n12, (-j^0-n12+nodecount^0 >= 0 /\ n12 >= 0), cost: 4*n12

Applied instantiation
Original rule:
l13 -> l13 : j^0'=j^0+n12, (-j^0-n12+nodecount^0 >= 0 /\ n12 >= 0), cost: 4*n12
New rule:
l13 -> l13 : j^0'=nodecount^0, (0 >= 0 /\ -j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0

Applied simplification
Original rule:
l13 -> l13 : j^0'=nodecount^0, destflag^0'=0, (0 >= 0 /\ -1-j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0
New rule:
l13 -> l13 : j^0'=nodecount^0, destflag^0'=0, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0

Applied simplification
Original rule:
l13 -> l13 : j^0'=nodecount^0, (0 >= 0 /\ -j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0
New rule:
l13 -> l13 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0

Applied deletion
Removed the following rules: 142 143

Applied acceleration
Original rule:
l17 -> l17 : j^0'=1+j^0, sourceflag^0'=1, 1+j^0-nodecount^0 <= 0, cost: 4
New rule:
l17 -> l17 : j^0'=j^0+n22, sourceflag^0'=1, (-j^0-n22+nodecount^0 >= 0 /\ -1+n22 >= 0), cost: 4*n22

Applied instantiation
Original rule:
l17 -> l17 : j^0'=j^0+n22, sourceflag^0'=1, (-j^0-n22+nodecount^0 >= 0 /\ -1+n22 >= 0), cost: 4*n22
New rule:
l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (0 >= 0 /\ -1-j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0

Applied acceleration
Original rule:
l17 -> l17 : j^0'=1+j^0, 1+j^0-nodecount^0 <= 0, cost: 4
New rule:
l17 -> l17 : j^0'=j^0+n24, (-j^0+nodecount^0-n24 >= 0 /\ n24 >= 0), cost: 4*n24

Applied instantiation
Original rule:
l17 -> l17 : j^0'=j^0+n24, (-j^0+nodecount^0-n24 >= 0 /\ n24 >= 0), cost: 4*n24
New rule:
l17 -> l17 : j^0'=nodecount^0, (0 >= 0 /\ -j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0

Applied simplification
Original rule:
l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (0 >= 0 /\ -1-j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0
New rule:
l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0

Applied simplification
Original rule:
l17 -> l17 : j^0'=nodecount^0, (0 >= 0 /\ -j^0+nodecount^0 >= 0), cost: -4*j^0+4*nodecount^0
New rule:
l17 -> l17 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0

Applied deletion
Removed the following rules: 135 136

Applied acceleration
Original rule:
l22 -> l22 : h^0'=1+h^0, min^0'=h^0, 1-edgecount^0+h^0 <= 0, cost: 4
New rule:
l22 -> l22 : h^0'=n34+h^0, min^0'=-1+n34+h^0, (-1+n34 >= 0 /\ -n34+edgecount^0-h^0 >= 0), cost: 4*n34

Applied instantiation
Original rule:
l22 -> l22 : h^0'=n34+h^0, min^0'=-1+n34+h^0, (-1+n34 >= 0 /\ -n34+edgecount^0-h^0 >= 0), cost: 4*n34
New rule:
l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0-h^0 >= 0), cost: 4*edgecount^0-4*h^0

Applied acceleration
Original rule:
l22 -> l22 : h^0'=1+h^0, 1-edgecount^0+h^0 <= 0, cost: 4
New rule:
l22 -> l22 : h^0'=n36+h^0, (n36 >= 0 /\ edgecount^0-n36-h^0 >= 0), cost: 4*n36

Applied instantiation
Original rule:
l22 -> l22 : h^0'=n36+h^0, (n36 >= 0 /\ edgecount^0-n36-h^0 >= 0), cost: 4*n36
New rule:
l22 -> l22 : h^0'=edgecount^0, (0 >= 0 /\ edgecount^0-h^0 >= 0), cost: 4*edgecount^0-4*h^0

Applied simplification
Original rule:
l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0-h^0 >= 0), cost: 4*edgecount^0-4*h^0
New rule:
l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, -1+edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0

Applied simplification
Original rule:
l22 -> l22 : h^0'=edgecount^0, (0 >= 0 /\ edgecount^0-h^0 >= 0), cost: 4*edgecount^0-4*h^0
New rule:
l22 -> l22 : h^0'=edgecount^0, edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0

Applied deletion
Removed the following rules: 133 134

Accelerated simple loops
Start location: l28
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
 131: l4 -> l10 : i^0'=0, min^0'=0, (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 3
 132: l4 -> l10 : i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 3+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
 137: l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 138: l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 139: l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 140: l13 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 141: l13 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 146: l13 -> l13 : j^0'=nodecount^0, destflag^0'=0, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
 147: l13 -> l13 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 150: l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
 151: l17 -> l17 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 154: l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, -1+edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0
 155: l22 -> l22 : h^0'=edgecount^0, edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0
 127: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 <= 0, cost: 4
 128: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0
 129: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 >= 0, cost: 2+2*nodecount^0
 130: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, -1+nodecount^0 >= 0, cost: 4*nodecount^0


Applied chaining
First rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l13 -> l13 : j^0'=nodecount^0, destflag^0'=0, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
New rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l13 -> l13 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
New rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0

Applied deletion
Removed the following rules: 146 147

Applied chaining
First rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
Second rule:
l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, -1-j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
New rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (-1+nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0

Applied chaining
First rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
Second rule:
l17 -> l17 : j^0'=nodecount^0, -j^0+nodecount^0 >= 0, cost: -4*j^0+4*nodecount^0
New rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, (nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0

Applied deletion
Removed the following rules: 150 151

Applied chaining
First rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
Second rule:
l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, -1+edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0
New rule:
l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
Second rule:
l22 -> l22 : h^0'=edgecount^0, edgecount^0-h^0 >= 0, cost: 4*edgecount^0-4*h^0
New rule:
l7 -> l22 : h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0

Applied deletion
Removed the following rules: 154 155

Chained accelerated rules with incoming rules
Start location: l28
  94: l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
 131: l4 -> l10 : i^0'=0, min^0'=0, (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 3
 132: l4 -> l10 : i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 3+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 101: l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
 160: l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
 161: l7 -> l22 : h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
  98: l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
 137: l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 138: l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
 139: l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 140: l13 -> l6 : (sourceflag^0 == 0 /\ 1+destflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 141: l13 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0 /\ -j^0+nodecount^0 <= 0), cost: 4
 104: l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
 156: l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
 157: l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
 102: l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
 158: l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (-1+nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
 159: l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, (nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
 127: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 <= 0, cost: 4
 128: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0
 129: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 >= 0, cost: 2+2*nodecount^0
 130: l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, -1+nodecount^0 >= 0, cost: 4*nodecount^0


Eliminating location l2 by chaining:

Applied chaining
First rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 <= 0, cost: 4
Second rule:
l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6

Applied chaining
First rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+2*nodecount^0
Second rule:
l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (0 <= 0 /\ -1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0

Applied simplification
Original rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (0 <= 0 /\ -1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0

Applied chaining
First rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=0, -1+nodecount^0 >= 0, cost: 2+2*nodecount^0
Second rule:
l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0

Applied chaining
First rule:
l28 -> l2 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, -1+nodecount^0 >= 0, cost: 4*nodecount^0
Second rule:
l2 -> l4 : k^0'=0, -1-i^0+nodecount^0 <= 0, cost: 2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+4*nodecount^0

Applied simplification
Original rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0), cost: 2+4*nodecount^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0

Applied deletion
Removed the following rules: 94 127 128 129 130

Eliminating location l10 by chaining:

Applied chaining
First rule:
l4 -> l10 : i^0'=0, min^0'=0, (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0), cost: 3
Second rule:
l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
New rule:
l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5

Applied chaining
First rule:
l4 -> l10 : i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 3+2*edgecount^0
Second rule:
l10 -> l7 : k_1^0'=0, edgecount^0-i^0 <= 0, cost: 2
New rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0

Applied simplification
Original rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
New rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0

Applied deletion
Removed the following rules: 98 131 132

Eliminating location l22 by chaining:

Applied chaining
First rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
Second rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
New rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4

Applied chaining
First rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (-1+nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=0, 1-edgecount^0+k_1^0 <= 0, cost: 2
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, (nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
New rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
New rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (-1+nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, (nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=0, sourceflag^0'=0, edgecount^0-h^0 <= 0, cost: 2
New rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
New rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, (-1+nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, (edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied chaining
First rule:
l7 -> l22 : h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 2+4*edgecount^0
Second rule:
l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, (nodecount^0 >= 0 /\ edgecount^0-h^0 <= 0), cost: 2+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied simplification
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, (0 <= 0 /\ edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
New rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied deletion
Removed the following rules: 101 102 158 159 160 161

Eliminating location l13 by chaining:

Applied chaining
First rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5

Applied chaining
First rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=0, destflag^0'=1, (nodecount^0 <= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5

Applied chaining
First rule:
l17 -> l13 : j^0'=0, destflag^0'=1, -j^0+nodecount^0 <= 0, cost: 2
Second rule:
l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
New rule:
l17 -> l6 : j^0'=0, destflag^0'=1, (0 >= 0 /\ sourceflag^0 == 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 6

Applied simplification
Original rule:
l17 -> l6 : j^0'=0, destflag^0'=1, (0 >= 0 /\ sourceflag^0 == 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 6
New rule:
l17 -> l6 : j^0'=0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 6

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ -1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ -1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (sourceflag^0 == 0 /\ destflag^0 == 0 /\ -j^0+nodecount^0 <= 0), cost: 4
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ 0 == 0 /\ sourceflag^0 == 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (0 <= 0 /\ 0 == 0 /\ sourceflag^0 == 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (sourceflag^0 == 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (-1+sourceflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ -1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ -1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 3
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0

Applied chaining
First rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
Second rule:
l13 -> l6 : (sourceflag^0 == 0 /\ -1+destflag^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 4
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ 0 >= 0 /\ sourceflag^0 == 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0

Applied simplification
Original rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (0 <= 0 /\ 0 >= 0 /\ sourceflag^0 == 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
New rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0

Applied partial deletion
Original rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
New rule:
l17 -> [35] : (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0

Applied partial deletion
Original rule:
l17 -> l13 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
New rule:
l17 -> [35] : (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0

Applied deletion
Removed the following rules: 104 137 138 139 140 141 156 157

Eliminated locations on tree-shaped paths
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 168: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4
 169: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 170: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 171: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 172: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 173: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 174: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 175: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, (edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 176: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 177: l17 -> l6 : j^0'=0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 178: l17 -> l6 : j^0'=0, destflag^0'=1, (nodecount^0 <= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 179: l17 -> l6 : j^0'=0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 6
 180: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 181: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 182: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (sourceflag^0 == 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
 183: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 184: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 185: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
 186: l17 -> [35] : (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
 187: l17 -> [35] : (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied merging
first rule:
l17 -> [35] : (-1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
second rule:
l17 -> [35] : (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
new rule:
l17 -> [35] : (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0

Merged rules
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 168: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4
 169: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 170: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 171: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 172: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 173: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 174: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 175: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, (edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 176: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 177: l17 -> l6 : j^0'=0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 178: l17 -> l6 : j^0'=0, destflag^0'=1, (nodecount^0 <= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 179: l17 -> l6 : j^0'=0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 6
 180: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 181: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 182: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (sourceflag^0 == 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
 183: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 184: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 185: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (sourceflag^0 == 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 6+4*nodecount^0
 188: l17 -> [35] : (nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 2+4*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied pruning (of leafs and parallel rules):
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 168: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4
 169: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 171: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 172: l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 174: l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 177: l17 -> l6 : j^0'=0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 178: l17 -> l6 : j^0'=0, destflag^0'=1, (nodecount^0 <= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5
 180: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 181: l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+nodecount^0 >= 0 /\ 1+sourceflag^0 <= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 183: l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Eliminating location l17 by chaining:

Applied chaining
First rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
Second rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (0 <= 0 /\ 0 >= 0 /\ edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0

Applied simplification
Original rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (0 <= 0 /\ 0 >= 0 /\ edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0

Applied chaining
First rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
Second rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (0 <= 0 /\ 0 >= 0 /\ edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0

Applied simplification
Original rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (0 <= 0 /\ 0 >= 0 /\ edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0

Applied chaining
First rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
Second rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=0, (-1+sourceflag^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ 0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0

Applied simplification
Original rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ 0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0

Applied chaining
First rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
Second rule:
l17 -> l6 : j^0'=nodecount^0, destflag^0'=1, (-1+sourceflag^0 >= 0 /\ nodecount^0 >= 0 /\ -j^0+nodecount^0 <= 0), cost: 5+4*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ 0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0

Applied simplification
Original rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ 0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
New rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0

Applied partial deletion
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
New rule:
l7 -> [36] : (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0

Applied partial deletion
Original rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
New rule:
l7 -> [36] : (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied partial deletion
Original rule:
l7 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
New rule:
l7 -> [36] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied partial deletion
Original rule:
l7 -> l17 : j^0'=0, sourceflag^0'=0, h^0'=edgecount^0, (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
New rule:
l7 -> [36] : (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0

Applied deletion
Removed the following rules: 168 169 171 172 174 177 178 180 181 183

Eliminated locations on tree-shaped paths
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 189: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 190: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 191: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 192: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 193: l7 -> [36] : (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
 194: l7 -> [36] : (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 195: l7 -> [36] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
 196: l7 -> [36] : (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied merging
first rule:
l7 -> [36] : (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*nodecount^0
second rule:
l7 -> [36] : (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
new rule:
l7 -> [36] : ((-1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0) \/ (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0)), cost: 4+4*nodecount^0

Applied merging
first rule:
l7 -> [36] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
second rule:
l7 -> [36] : (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0
new rule:
l7 -> [36] : (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0

Applied merging
first rule:
l7 -> [36] : ((-1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0) \/ (-1+edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0)), cost: 4+4*nodecount^0
second rule:
l7 -> [36] : (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 4+4*edgecount^0+4*nodecount^0
new rule:
l7 -> [36] : ((-1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0) \/ (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0)), cost: 4+4*nodecount^0

Merged rules
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 189: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 190: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 191: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 192: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 199: l7 -> [36] : ((-1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0) \/ (edgecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0)), cost: 4+4*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied pruning (of leafs and parallel rules):
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
  49: l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 189: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 190: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
 191: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 192: l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Eliminating location l6 by chaining:

Applied chaining
First rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
Second rule:
l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0

Applied chaining
First rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+8*nodecount^0
Second rule:
l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0

Applied chaining
First rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
Second rule:
l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0

Applied chaining
First rule:
l7 -> l6 : j^0'=nodecount^0, sourceflag^0'=1, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 9+4*edgecount^0+8*nodecount^0
Second rule:
l6 -> l7 : k_1^0'=1+k_1^0, TRUE, cost: 1
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0

Applied deletion
Removed the following rules: 49 189 190 191 192

Eliminated locations on tree-shaped paths
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 200: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0
 201: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0
 202: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0
 203: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied acceleration
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=k_1^0+n66, destflag^0'=0, h^0'=0, (-edgecount^0 >= 0 /\ edgecount^0-k_1^0-n66 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n66 >= 0), cost: 10*n66+8*n66*nodecount^0

Applied instantiation
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=k_1^0+n66, destflag^0'=0, h^0'=0, (-edgecount^0 >= 0 /\ edgecount^0-k_1^0-n66 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n66 >= 0), cost: 10*n66+8*n66*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=0, (0 >= 0 /\ -edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0

Applied acceleration
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+8*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=n68+k_1^0, destflag^0'=1, h^0'=0, (-1+n68 >= 0 /\ -edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -n68+edgecount^0-k_1^0 >= 0), cost: 10*n68+8*n68*nodecount^0

Applied instantiation
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=n68+k_1^0, destflag^0'=1, h^0'=0, (-1+n68 >= 0 /\ -edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -n68+edgecount^0-k_1^0 >= 0), cost: 10*n68+8*n68*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=0, (0 >= 0 /\ -edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0

Applied acceleration
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=n70+k_1^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n70 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -n70+edgecount^0-k_1^0 >= 0), cost: 10*n70+8*n70*nodecount^0+4*n70*edgecount^0

Applied instantiation
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=n70+k_1^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n70 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -n70+edgecount^0-k_1^0 >= 0), cost: 10*n70+8*n70*nodecount^0+4*n70*edgecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)

Applied acceleration
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=1+k_1^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-edgecount^0+k_1^0 <= 0), cost: 10+4*edgecount^0+8*nodecount^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=k_1^0+n72, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+n72 >= 0 /\ -1+nodecount^0 >= 0 /\ edgecount^0-k_1^0-n72 >= 0), cost: 8*nodecount^0*n72+10*n72+4*edgecount^0*n72

Applied instantiation
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=k_1^0+n72, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+n72 >= 0 /\ -1+nodecount^0 >= 0 /\ edgecount^0-k_1^0-n72 >= 0), cost: 8*nodecount^0*n72+10*n72+4*edgecount^0*n72
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)

Applied simplification
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=0, (0 >= 0 /\ -edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0

Applied simplification
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=0, (0 >= 0 /\ -edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0

Applied simplification
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)

Applied simplification
Original rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
New rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)

Applied deletion
Removed the following rules: 200 201 202 203

Accelerated simple loops
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 208: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=0, (edgecount^0 <= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0
 209: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=0, (edgecount^0 <= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0
 210: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
 211: l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied chaining
First rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
Second rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
New rule:
l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied chaining
First rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
Second rule:
l7 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+edgecount^0-k_1^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 8*nodecount^0*(edgecount^0-k_1^0)+10*edgecount^0-10*k_1^0+4*edgecount^0*(edgecount^0-k_1^0)
New rule:
l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied deletion
Removed the following rules: 208 209 210 211

Chained accelerated rules with incoming rules
Start location: l28
 166: l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
 167: l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
 212: l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
 213: l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
 100: l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Eliminating location l7 by chaining:

Applied chaining
First rule:
l4 -> l7 : k_1^0'=0, i^0'=0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5
Second rule:
l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7

Applied chaining
First rule:
l4 -> l7 : k_1^0'=0, i^0'=edgecount^0, min^0'=0, (edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+2*edgecount^0
Second rule:
l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0

Applied chaining
First rule:
l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied chaining
First rule:
l4 -> l7 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 5+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l7 -> l4 : k^0'=1+k^0, edgecount^0-k_1^0 <= 0, cost: 2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (0 <= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2

Applied deletion
Removed the following rules: 100 166 167 212 213

Eliminated locations on tree-shaped paths
Start location: l28
 214: l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
 215: l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
 216: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
 217: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied nonterm
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=n90+k^0, min^0'=0, (-edgecount^0 >= 0 /\ -1+n90 >= 0 /\ (-1-n90+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 7*n90

Applied instantiation
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=n90+k^0, min^0'=0, (-edgecount^0 >= 0 /\ -1+n90 >= 0 /\ (-1-n90+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 7*n90
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (-edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+7*nodecount^0-7*k^0

Applied nonterm
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=n92+k^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n92 >= 0 /\ (-1+nodecount^0-n92-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 7*n92+2*edgecount^0*n92

Applied instantiation
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=n92+k^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n92 >= 0 /\ (-1+nodecount^0-n92-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 7*n92+2*edgecount^0*n92
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+2*(-1+nodecount^0-k^0)*edgecount^0+7*nodecount^0-7*k^0

Applied nonterm
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=k^0+n94, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n94 >= 0 /\ (-1+nodecount^0-k^0-n94 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 12*edgecount^0*n94+8*edgecount^0*nodecount^0*n94+4*edgecount^0^2*n94+7*n94

Applied instantiation
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=k^0+n94, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n94 >= 0 /\ (-1+nodecount^0-k^0-n94 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 12*edgecount^0*n94+8*edgecount^0*nodecount^0*n94+4*edgecount^0^2*n94+7*n94
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0

Applied nonterm
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=n96+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n96 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-nodecount^0+k^0 >= 0 \/ -1-n96+nodecount^0-k^0 >= 0)), cost: 7*n96+8*n96*edgecount^0*nodecount^0+12*n96*edgecount^0+4*n96*edgecount^0^2

Applied instantiation
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=n96+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n96 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-nodecount^0+k^0 >= 0 \/ -1-n96+nodecount^0-k^0 >= 0)), cost: 7*n96+8*n96*edgecount^0*nodecount^0+12*n96*edgecount^0+4*n96*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0

Applied chaining
First rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
Second rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0

Applied nonterm
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=k^0+2*n98, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n98 >= 0 /\ (nodecount^0-k^0-2*n98 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (-1+nodecount^0-k^0-2*n98 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0))), cost: 2*edgecount^0*n98+14*n98

Applied chaining
First rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
Second rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM

Heuristically decided not to add the following rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=k^0+2*n98, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n98 >= 0 /\ (nodecount^0-k^0-2*n98 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (-1+nodecount^0-k^0-2*n98 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0))), cost: 2*edgecount^0*n98+14*n98

Applied chaining
First rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+2*edgecount^0
Second rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0

Applied nonterm
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=2+k^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+2*edgecount^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=2*n100+k^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n100 >= 0 /\ (-1-2*n100+nodecount^0-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0)) /\ (-2*n100+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 14*n100+2*n100*edgecount^0

Applied chaining
First rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=1+k^0, min^0'=0, (edgecount^0 <= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7
Second rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM

Heuristically decided not to add the following rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=2*n100+k^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -1+n100 >= 0 /\ (-1-2*n100+nodecount^0-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0)) /\ (-2*n100+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 14*n100+2*n100*edgecount^0

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2

Applied nonterm
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (-1+nodecount^0-2*n102-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0)) /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (-1+nodecount^0-2*n102-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0)) /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ ((1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0) \/ -2+nodecount^0-2*n102-k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2

Applied nonterm
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM

Applied acceleration
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-1+nodecount^0-k^0 <= 0 \/ 3-nodecount^0+k^0 <= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 14+24*edgecount^0+16*edgecount^0*nodecount^0+8*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2*n104+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (-1-2*n104+nodecount^0-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0))), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM

Applied chaining
First rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0*nodecount^0+4*edgecount^0^2
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2*n104+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (-1-2*n104+nodecount^0-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0))), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (1-nodecount^0+k^0 >= 0 \/ -1-2*n104+nodecount^0-k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ ((1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0) \/ -2-2*n104+nodecount^0-k^0 >= 0)), cost: 7+14*n104+12*edgecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (-edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+7*nodecount^0-7*k^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+7*nodecount^0-7*k^0

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+2*(-1+nodecount^0-k^0)*edgecount^0+7*nodecount^0-7*k^0
New rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+2*(-1+nodecount^0-k^0)*edgecount^0+7*nodecount^0-7*k^0

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0 /\ (0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-edgecount^0 >= 0 /\ edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM
New rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (-1+nodecount^0-2*n102-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0)) /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ ((1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0) \/ -2+nodecount^0-2*n102-k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+12*edgecount^0+8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-2+nodecount^0-2*n102-k^0 >= 0 \/ 2-nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 7+12*edgecount^0+8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2

Applied simplification
Original rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: NONTERM
New rule:
l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2*n104+nodecount^0-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (-1-2*n104+nodecount^0-k^0 >= 0 \/ (-nodecount^0+k^0 >= 0 /\ 1-nodecount^0+k^0 >= 0))), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-nodecount^0+k^0 >= 0 \/ -1-2*n104+nodecount^0-k^0 >= 0)), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0

Applied simplification
Original rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (1-nodecount^0+k^0 >= 0 \/ -1-2*n104+nodecount^0-k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ ((1-nodecount^0+k^0 >= 0 /\ 2-nodecount^0+k^0 >= 0) \/ -2-2*n104+nodecount^0-k^0 >= 0)), cost: 7+14*n104+12*edgecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2
New rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2-2*n104+nodecount^0-k^0 >= 0 \/ 1-nodecount^0+k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+14*n104+12*edgecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2

Applied deletion
Removed the following rules: 214 215 216 217

Applied deletion
Removed the following rules: 222 224 240 244 245 248 249

Accelerated simple loops
Start location: l28
 238: l4 -> [38] : (edgecount^0 <= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
 239: l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+7*nodecount^0-7*k^0
 241: l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+2*(-1+nodecount^0-k^0)*edgecount^0+7*nodecount^0-7*k^0
 242: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
 243: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
 246: l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
 247: l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM
 250: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102
 251: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-2+nodecount^0-2*n102-k^0 >= 0 \/ 2-nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 7+12*edgecount^0+8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2
 252: l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
 253: l4 -> [38] : (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM
 254: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-nodecount^0+k^0 >= 0 \/ -1-2*n104+nodecount^0-k^0 >= 0)), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0
 255: l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2-2*n104+nodecount^0-k^0 >= 0 \/ 1-nodecount^0+k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+14*n104+12*edgecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0


Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
Second rule:
l4 -> [38] : (edgecount^0 <= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l28 -> [38] : (edgecount^0 <= 0 /\ nodecount^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+7*nodecount^0-7*k^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ -2+nodecount^0 >= 0), cost: -5+11*nodecount^0

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+2*(-1+nodecount^0-k^0)*edgecount^0+7*nodecount^0-7*k^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 == 0 /\ -2+nodecount^0 >= 0), cost: -5+2*edgecount^0*(-1+nodecount^0)+11*nodecount^0

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0 >= 0), cost: -5+12*edgecount^0*(-1+nodecount^0)+8*edgecount^0*(-1+nodecount^0)*nodecount^0+11*nodecount^0+4*edgecount^0^2*(-1+nodecount^0)

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0-k^0 >= 0), cost: -7+12*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0^2+8*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0 >= 0), cost: -5+12*edgecount^0*(-1+nodecount^0)+8*edgecount^0*(-1+nodecount^0)*nodecount^0+11*nodecount^0+4*edgecount^0^2*(-1+nodecount^0)

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
Second rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ -nodecount^0+k^0 >= 0), cost: NONTERM
New rule:
l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
Second rule:
l4 -> [38] : (edgecount^0 <= 0 /\ edgecount^0 >= 0 /\ 1-nodecount^0+k^0 >= 0 /\ nodecount^0-k^0 <= 0), cost: NONTERM
New rule:
l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-2*n102-k^0 >= 0 \/ -nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ nodecount^0-2*n102 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ -1+nodecount^0-2*n102 >= 0), cost: 2+8*edgecount^0^2*n102+4*nodecount^0+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0) /\ (-2+nodecount^0-2*n102-k^0 >= 0 \/ 2-nodecount^0+k^0 >= 0) /\ (1-nodecount^0+k^0 >= 0 \/ -1+nodecount^0-2*n102-k^0 >= 0)), cost: 7+12*edgecount^0+8*edgecount^0^2*n102+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0-2*n102 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ -2+nodecount^0 >= 0 /\ -1+nodecount^0-2*n102 >= 0), cost: 9+12*edgecount^0+8*edgecount^0^2*n102+4*nodecount^0+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-nodecount^0+k^0 >= 0 \/ -1-2*n104+nodecount^0-k^0 >= 0)), cost: 14*n104+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1-2*n104+nodecount^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 2+14*n104+4*nodecount^0+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0

Applied chaining
First rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
Second rule:
l4 -> l4 : j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104+k^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ (-2-2*n104+nodecount^0-k^0 >= 0 \/ 1-nodecount^0+k^0 >= 0) /\ (nodecount^0-k^0 <= 0 \/ 2-nodecount^0+k^0 <= 0)), cost: 7+14*n104+12*edgecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2
New rule:
l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0 >= 0 /\ -2-2*n104+nodecount^0 >= 0), cost: 9+14*n104+12*edgecount^0+4*nodecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2

Applied deletion
Removed the following rules: 238 239 241 242 243 246 247 250 251 252 253 254 255

Chained accelerated rules with incoming rules
Start location: l28
 162: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, -1+nodecount^0 <= 0, cost: 6
 163: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 164: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, (-1+nodecount^0 <= 0 /\ -1+nodecount^0 >= 0), cost: 4+2*nodecount^0
 165: l28 -> l4 : __lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, -1+nodecount^0 >= 0, cost: 2+4*nodecount^0
 256: l28 -> [38] : (edgecount^0 <= 0 /\ nodecount^0 <= 0), cost: NONTERM
 257: l28 -> l4 : __lengthofvisited^0'=edgecount^0, k_1^0'=0, i^0'=0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 <= 0 /\ -2+nodecount^0 >= 0), cost: -5+11*nodecount^0
 258: l28 -> l4 : __lengthofvisited^0'=edgecount^0, k_1^0'=0, i^0'=edgecount^0, k^0'=-1+nodecount^0, min^0'=0, (edgecount^0 == 0 /\ -2+nodecount^0 >= 0), cost: -5+2*edgecount^0*(-1+nodecount^0)+11*nodecount^0
 259: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0 >= 0), cost: -5+12*edgecount^0*(-1+nodecount^0)+8*edgecount^0*(-1+nodecount^0)*nodecount^0+11*nodecount^0+4*edgecount^0^2*(-1+nodecount^0)
 260: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=-1+nodecount^0, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0 >= 0), cost: -5+12*edgecount^0*(-1+nodecount^0)+8*edgecount^0*(-1+nodecount^0)*nodecount^0+11*nodecount^0+4*edgecount^0^2*(-1+nodecount^0)
 261: l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM
 262: l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM
 263: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=2*n102, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ nodecount^0-2*n102 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ -1+nodecount^0-2*n102 >= 0), cost: 2+8*edgecount^0^2*n102+4*nodecount^0+16*edgecount^0*nodecount^0*n102+14*n102+24*edgecount^0*n102
 264: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=1, k^0'=1+2*n102, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+edgecount^0 >= 0 /\ -2+nodecount^0-2*n102 >= 0 /\ -1+nodecount^0 >= 0 /\ -1+n102 >= 0 /\ -2+nodecount^0 >= 0 /\ -1+nodecount^0-2*n102 >= 0), cost: 9+12*edgecount^0+8*edgecount^0^2*n102+4*nodecount^0+16*edgecount^0*nodecount^0*n102+14*n102+8*edgecount^0*nodecount^0+24*edgecount^0*n102+4*edgecount^0^2
 265: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=2*n104, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1-2*n104+nodecount^0 >= 0 /\ -1+nodecount^0 >= 0), cost: 2+14*n104+4*nodecount^0+8*n104*edgecount^0^2+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0
 266: l28 -> l4 : __lengthofvisited^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, k_1^0'=edgecount^0, i^0'=edgecount^0, destflag^0'=0, k^0'=1+2*n104, h^0'=edgecount^0, min^0'=-1+edgecount^0, (-1+n104 >= 0 /\ -1+edgecount^0 >= 0 /\ -1+nodecount^0 >= 0 /\ -2+nodecount^0 >= 0 /\ -2-2*n104+nodecount^0 >= 0), cost: 9+14*n104+12*edgecount^0+4*nodecount^0+8*n104*edgecount^0^2+8*edgecount^0*nodecount^0+16*n104*edgecount^0*nodecount^0+24*n104*edgecount^0+4*edgecount^0^2


Removed unreachable locations and irrelevant leafs
Start location: l28
 256: l28 -> [38] : (edgecount^0 <= 0 /\ nodecount^0 <= 0), cost: NONTERM
 261: l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM
 262: l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM


Removed duplicate rules (ignoring updates)
Start location: l28
 256: l28 -> [38] : (edgecount^0 <= 0 /\ nodecount^0 <= 0), cost: NONTERM
 262: l28 -> [38] : (edgecount^0 == 0 /\ nodecount^0 <= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 256 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (edgecount^0 <= 0 /\ nodecount^0 <= 0)