NO ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: l28 0: l0 -> l1 : ___lengthofvisited^0'=___lengthofvisited^post_1, destflag^0'=destflag^post_1, edgecount^0'=edgecount^post_1, h^0'=h^post_1, i^0'=i^post_1, j^0'=j^post_1, k^0'=k^post_1, k_1^0'=k_1^post_1, min^0'=min^post_1, nodecount^0'=nodecount^post_1, sourceflag^0'=sourceflag^post_1, [ ___lengthofvisited^0==___lengthofvisited^post_1 && destflag^0==destflag^post_1 && edgecount^0==edgecount^post_1 && h^0==h^post_1 && i^0==i^post_1 && j^0==j^post_1 && k^0==k^post_1 && k_1^0==k_1^post_1 && min^0==min^post_1 && nodecount^0==nodecount^post_1 && sourceflag^0==sourceflag^post_1 ], cost: 1 42: l1 -> l2 : ___lengthofvisited^0'=___lengthofvisited^post_43, destflag^0'=destflag^post_43, edgecount^0'=edgecount^post_43, h^0'=h^post_43, i^0'=i^post_43, j^0'=j^post_43, k^0'=k^post_43, k_1^0'=k_1^post_43, min^0'=min^post_43, nodecount^0'=nodecount^post_43, sourceflag^0'=sourceflag^post_43, [ nodecount^0<=i^0 && i^post_43==0 && ___lengthofvisited^0==___lengthofvisited^post_43 && destflag^0==destflag^post_43 && edgecount^0==edgecount^post_43 && h^0==h^post_43 && j^0==j^post_43 && k^0==k^post_43 && k_1^0==k_1^post_43 && min^0==min^post_43 && nodecount^0==nodecount^post_43 && sourceflag^0==sourceflag^post_43 ], cost: 1 43: l1 -> l0 : ___lengthofvisited^0'=___lengthofvisited^post_44, destflag^0'=destflag^post_44, edgecount^0'=edgecount^post_44, h^0'=h^post_44, i^0'=i^post_44, j^0'=j^post_44, k^0'=k^post_44, k_1^0'=k_1^post_44, min^0'=min^post_44, nodecount^0'=nodecount^post_44, sourceflag^0'=sourceflag^post_44, [ 1+i^0<=nodecount^0 && i^post_44==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_44 && destflag^0==destflag^post_44 && edgecount^0==edgecount^post_44 && h^0==h^post_44 && j^0==j^post_44 && k^0==k^post_44 && k_1^0==k_1^post_44 && min^0==min^post_44 && nodecount^0==nodecount^post_44 && sourceflag^0==sourceflag^post_44 ], cost: 1 1: l2 -> l3 : ___lengthofvisited^0'=___lengthofvisited^post_2, destflag^0'=destflag^post_2, edgecount^0'=edgecount^post_2, h^0'=h^post_2, i^0'=i^post_2, j^0'=j^post_2, k^0'=k^post_2, k_1^0'=k_1^post_2, min^0'=min^post_2, nodecount^0'=nodecount^post_2, sourceflag^0'=sourceflag^post_2, [ ___lengthofvisited^0==___lengthofvisited^post_2 && destflag^0==destflag^post_2 && edgecount^0==edgecount^post_2 && h^0==h^post_2 && i^0==i^post_2 && j^0==j^post_2 && k^0==k^post_2 && k_1^0==k_1^post_2 && min^0==min^post_2 && nodecount^0==nodecount^post_2 && sourceflag^0==sourceflag^post_2 ], cost: 1 39: l3 -> l4 : ___lengthofvisited^0'=___lengthofvisited^post_40, destflag^0'=destflag^post_40, edgecount^0'=edgecount^post_40, h^0'=h^post_40, i^0'=i^post_40, j^0'=j^post_40, k^0'=k^post_40, k_1^0'=k_1^post_40, min^0'=min^post_40, nodecount^0'=nodecount^post_40, sourceflag^0'=sourceflag^post_40, [ -1+nodecount^0<=i^0 && k^post_40==0 && ___lengthofvisited^0==___lengthofvisited^post_40 && destflag^0==destflag^post_40 && edgecount^0==edgecount^post_40 && h^0==h^post_40 && i^0==i^post_40 && j^0==j^post_40 && k_1^0==k_1^post_40 && min^0==min^post_40 && nodecount^0==nodecount^post_40 && sourceflag^0==sourceflag^post_40 ], cost: 1 40: l3 -> l2 : ___lengthofvisited^0'=___lengthofvisited^post_41, destflag^0'=destflag^post_41, edgecount^0'=edgecount^post_41, h^0'=h^post_41, i^0'=i^post_41, j^0'=j^post_41, k^0'=k^post_41, k_1^0'=k_1^post_41, min^0'=min^post_41, nodecount^0'=nodecount^post_41, sourceflag^0'=sourceflag^post_41, [ 1+i^0<=-1+nodecount^0 && i^post_41==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_41 && destflag^0==destflag^post_41 && edgecount^0==edgecount^post_41 && h^0==h^post_41 && j^0==j^post_41 && k^0==k^post_41 && k_1^0==k_1^post_41 && min^0==min^post_41 && nodecount^0==nodecount^post_41 && sourceflag^0==sourceflag^post_41 ], cost: 1 2: l4 -> l5 : ___lengthofvisited^0'=___lengthofvisited^post_3, destflag^0'=destflag^post_3, edgecount^0'=edgecount^post_3, h^0'=h^post_3, i^0'=i^post_3, j^0'=j^post_3, k^0'=k^post_3, k_1^0'=k_1^post_3, min^0'=min^post_3, nodecount^0'=nodecount^post_3, sourceflag^0'=sourceflag^post_3, [ ___lengthofvisited^0==___lengthofvisited^post_3 && destflag^0==destflag^post_3 && edgecount^0==edgecount^post_3 && h^0==h^post_3 && i^0==i^post_3 && j^0==j^post_3 && k^0==k^post_3 && k_1^0==k_1^post_3 && min^0==min^post_3 && nodecount^0==nodecount^post_3 && sourceflag^0==sourceflag^post_3 ], cost: 1 36: l5 -> l26 : ___lengthofvisited^0'=___lengthofvisited^post_37, destflag^0'=destflag^post_37, edgecount^0'=edgecount^post_37, h^0'=h^post_37, i^0'=i^post_37, j^0'=j^post_37, k^0'=k^post_37, k_1^0'=k_1^post_37, min^0'=min^post_37, nodecount^0'=nodecount^post_37, sourceflag^0'=sourceflag^post_37, [ k^0<=-1+nodecount^0 && -1+nodecount^0<=k^0 && ___lengthofvisited^0==___lengthofvisited^post_37 && destflag^0==destflag^post_37 && edgecount^0==edgecount^post_37 && h^0==h^post_37 && i^0==i^post_37 && j^0==j^post_37 && k^0==k^post_37 && k_1^0==k_1^post_37 && min^0==min^post_37 && nodecount^0==nodecount^post_37 && sourceflag^0==sourceflag^post_37 ], cost: 1 37: l5 -> l25 : ___lengthofvisited^0'=___lengthofvisited^post_38, destflag^0'=destflag^post_38, edgecount^0'=edgecount^post_38, h^0'=h^post_38, i^0'=i^post_38, j^0'=j^post_38, k^0'=k^post_38, k_1^0'=k_1^post_38, min^0'=min^post_38, nodecount^0'=nodecount^post_38, sourceflag^0'=sourceflag^post_38, [ nodecount^0<=k^0 && ___lengthofvisited^0==___lengthofvisited^post_38 && destflag^0==destflag^post_38 && edgecount^0==edgecount^post_38 && h^0==h^post_38 && i^0==i^post_38 && j^0==j^post_38 && k^0==k^post_38 && k_1^0==k_1^post_38 && min^0==min^post_38 && nodecount^0==nodecount^post_38 && sourceflag^0==sourceflag^post_38 ], cost: 1 38: l5 -> l25 : ___lengthofvisited^0'=___lengthofvisited^post_39, destflag^0'=destflag^post_39, edgecount^0'=edgecount^post_39, h^0'=h^post_39, i^0'=i^post_39, j^0'=j^post_39, k^0'=k^post_39, k_1^0'=k_1^post_39, min^0'=min^post_39, nodecount^0'=nodecount^post_39, sourceflag^0'=sourceflag^post_39, [ 1+k^0<=-1+nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_39 && destflag^0==destflag^post_39 && edgecount^0==edgecount^post_39 && h^0==h^post_39 && i^0==i^post_39 && j^0==j^post_39 && k^0==k^post_39 && k_1^0==k_1^post_39 && min^0==min^post_39 && nodecount^0==nodecount^post_39 && sourceflag^0==sourceflag^post_39 ], cost: 1 3: l6 -> l7 : ___lengthofvisited^0'=___lengthofvisited^post_4, destflag^0'=destflag^post_4, edgecount^0'=edgecount^post_4, h^0'=h^post_4, i^0'=i^post_4, j^0'=j^post_4, k^0'=k^post_4, k_1^0'=k_1^post_4, min^0'=min^post_4, nodecount^0'=nodecount^post_4, sourceflag^0'=sourceflag^post_4, [ k_1^post_4==1+k_1^0 && ___lengthofvisited^0==___lengthofvisited^post_4 && destflag^0==destflag^post_4 && edgecount^0==edgecount^post_4 && h^0==h^post_4 && i^0==i^post_4 && j^0==j^post_4 && k^0==k^post_4 && min^0==min^post_4 && nodecount^0==nodecount^post_4 && sourceflag^0==sourceflag^post_4 ], cost: 1 18: l7 -> l18 : ___lengthofvisited^0'=___lengthofvisited^post_19, destflag^0'=destflag^post_19, edgecount^0'=edgecount^post_19, h^0'=h^post_19, i^0'=i^post_19, j^0'=j^post_19, k^0'=k^post_19, k_1^0'=k_1^post_19, min^0'=min^post_19, nodecount^0'=nodecount^post_19, sourceflag^0'=sourceflag^post_19, [ ___lengthofvisited^0==___lengthofvisited^post_19 && destflag^0==destflag^post_19 && edgecount^0==edgecount^post_19 && h^0==h^post_19 && i^0==i^post_19 && j^0==j^post_19 && k^0==k^post_19 && k_1^0==k_1^post_19 && min^0==min^post_19 && nodecount^0==nodecount^post_19 && sourceflag^0==sourceflag^post_19 ], cost: 1 4: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_5, destflag^0'=destflag^post_5, edgecount^0'=edgecount^post_5, h^0'=h^post_5, i^0'=i^post_5, j^0'=j^post_5, k^0'=k^post_5, k_1^0'=k_1^post_5, min^0'=min^post_5, nodecount^0'=nodecount^post_5, sourceflag^0'=sourceflag^post_5, [ 1<=destflag^0 && ___lengthofvisited^0==___lengthofvisited^post_5 && destflag^0==destflag^post_5 && edgecount^0==edgecount^post_5 && h^0==h^post_5 && i^0==i^post_5 && j^0==j^post_5 && k^0==k^post_5 && k_1^0==k_1^post_5 && min^0==min^post_5 && nodecount^0==nodecount^post_5 && sourceflag^0==sourceflag^post_5 ], cost: 1 5: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_6, destflag^0'=destflag^post_6, edgecount^0'=edgecount^post_6, h^0'=h^post_6, i^0'=i^post_6, j^0'=j^post_6, k^0'=k^post_6, k_1^0'=k_1^post_6, min^0'=min^post_6, nodecount^0'=nodecount^post_6, sourceflag^0'=sourceflag^post_6, [ 1+destflag^0<=0 && ___lengthofvisited^0==___lengthofvisited^post_6 && destflag^0==destflag^post_6 && edgecount^0==edgecount^post_6 && h^0==h^post_6 && i^0==i^post_6 && j^0==j^post_6 && k^0==k^post_6 && k_1^0==k_1^post_6 && min^0==min^post_6 && nodecount^0==nodecount^post_6 && sourceflag^0==sourceflag^post_6 ], cost: 1 6: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_7, destflag^0'=destflag^post_7, edgecount^0'=edgecount^post_7, h^0'=h^post_7, i^0'=i^post_7, j^0'=j^post_7, k^0'=k^post_7, k_1^0'=k_1^post_7, min^0'=min^post_7, nodecount^0'=nodecount^post_7, sourceflag^0'=sourceflag^post_7, [ destflag^0<=0 && 0<=destflag^0 && ___lengthofvisited^0==___lengthofvisited^post_7 && destflag^0==destflag^post_7 && edgecount^0==edgecount^post_7 && h^0==h^post_7 && i^0==i^post_7 && j^0==j^post_7 && k^0==k^post_7 && k_1^0==k_1^post_7 && min^0==min^post_7 && nodecount^0==nodecount^post_7 && sourceflag^0==sourceflag^post_7 ], cost: 1 7: l9 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_8, destflag^0'=destflag^post_8, edgecount^0'=edgecount^post_8, h^0'=h^post_8, i^0'=i^post_8, j^0'=j^post_8, k^0'=k^post_8, k_1^0'=k_1^post_8, min^0'=min^post_8, nodecount^0'=nodecount^post_8, sourceflag^0'=sourceflag^post_8, [ 1<=sourceflag^0 && ___lengthofvisited^0==___lengthofvisited^post_8 && destflag^0==destflag^post_8 && edgecount^0==edgecount^post_8 && h^0==h^post_8 && i^0==i^post_8 && j^0==j^post_8 && k^0==k^post_8 && k_1^0==k_1^post_8 && min^0==min^post_8 && nodecount^0==nodecount^post_8 && sourceflag^0==sourceflag^post_8 ], cost: 1 8: l9 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_9, destflag^0'=destflag^post_9, edgecount^0'=edgecount^post_9, h^0'=h^post_9, i^0'=i^post_9, j^0'=j^post_9, k^0'=k^post_9, k_1^0'=k_1^post_9, min^0'=min^post_9, nodecount^0'=nodecount^post_9, sourceflag^0'=sourceflag^post_9, [ 1+sourceflag^0<=0 && ___lengthofvisited^0==___lengthofvisited^post_9 && destflag^0==destflag^post_9 && edgecount^0==edgecount^post_9 && h^0==h^post_9 && i^0==i^post_9 && j^0==j^post_9 && k^0==k^post_9 && k_1^0==k_1^post_9 && min^0==min^post_9 && nodecount^0==nodecount^post_9 && sourceflag^0==sourceflag^post_9 ], cost: 1 9: l9 -> l8 : ___lengthofvisited^0'=___lengthofvisited^post_10, destflag^0'=destflag^post_10, edgecount^0'=edgecount^post_10, h^0'=h^post_10, i^0'=i^post_10, j^0'=j^post_10, k^0'=k^post_10, k_1^0'=k_1^post_10, min^0'=min^post_10, nodecount^0'=nodecount^post_10, sourceflag^0'=sourceflag^post_10, [ sourceflag^0<=0 && 0<=sourceflag^0 && ___lengthofvisited^0==___lengthofvisited^post_10 && destflag^0==destflag^post_10 && edgecount^0==edgecount^post_10 && h^0==h^post_10 && i^0==i^post_10 && j^0==j^post_10 && k^0==k^post_10 && k_1^0==k_1^post_10 && min^0==min^post_10 && nodecount^0==nodecount^post_10 && sourceflag^0==sourceflag^post_10 ], cost: 1 10: l10 -> l11 : ___lengthofvisited^0'=___lengthofvisited^post_11, destflag^0'=destflag^post_11, edgecount^0'=edgecount^post_11, h^0'=h^post_11, i^0'=i^post_11, j^0'=j^post_11, k^0'=k^post_11, k_1^0'=k_1^post_11, min^0'=min^post_11, nodecount^0'=nodecount^post_11, sourceflag^0'=sourceflag^post_11, [ ___lengthofvisited^0==___lengthofvisited^post_11 && destflag^0==destflag^post_11 && edgecount^0==edgecount^post_11 && h^0==h^post_11 && i^0==i^post_11 && j^0==j^post_11 && k^0==k^post_11 && k_1^0==k_1^post_11 && min^0==min^post_11 && nodecount^0==nodecount^post_11 && sourceflag^0==sourceflag^post_11 ], cost: 1 32: l11 -> l7 : ___lengthofvisited^0'=___lengthofvisited^post_33, destflag^0'=destflag^post_33, edgecount^0'=edgecount^post_33, h^0'=h^post_33, i^0'=i^post_33, j^0'=j^post_33, k^0'=k^post_33, k_1^0'=k_1^post_33, min^0'=min^post_33, nodecount^0'=nodecount^post_33, sourceflag^0'=sourceflag^post_33, [ edgecount^0<=i^0 && k_1^post_33==0 && ___lengthofvisited^0==___lengthofvisited^post_33 && destflag^0==destflag^post_33 && edgecount^0==edgecount^post_33 && h^0==h^post_33 && i^0==i^post_33 && j^0==j^post_33 && k^0==k^post_33 && min^0==min^post_33 && nodecount^0==nodecount^post_33 && sourceflag^0==sourceflag^post_33 ], cost: 1 33: l11 -> l10 : ___lengthofvisited^0'=___lengthofvisited^post_34, destflag^0'=destflag^post_34, edgecount^0'=edgecount^post_34, h^0'=h^post_34, i^0'=i^post_34, j^0'=j^post_34, k^0'=k^post_34, k_1^0'=k_1^post_34, min^0'=min^post_34, nodecount^0'=nodecount^post_34, sourceflag^0'=sourceflag^post_34, [ 1+i^0<=edgecount^0 && i^post_34==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_34 && destflag^0==destflag^post_34 && edgecount^0==edgecount^post_34 && h^0==h^post_34 && j^0==j^post_34 && k^0==k^post_34 && k_1^0==k_1^post_34 && min^0==min^post_34 && nodecount^0==nodecount^post_34 && sourceflag^0==sourceflag^post_34 ], cost: 1 11: l12 -> l13 : ___lengthofvisited^0'=___lengthofvisited^post_12, destflag^0'=destflag^post_12, edgecount^0'=edgecount^post_12, h^0'=h^post_12, i^0'=i^post_12, j^0'=j^post_12, k^0'=k^post_12, k_1^0'=k_1^post_12, min^0'=min^post_12, nodecount^0'=nodecount^post_12, sourceflag^0'=sourceflag^post_12, [ j^post_12==1+j^0 && ___lengthofvisited^0==___lengthofvisited^post_12 && destflag^0==destflag^post_12 && edgecount^0==edgecount^post_12 && h^0==h^post_12 && i^0==i^post_12 && k^0==k^post_12 && k_1^0==k_1^post_12 && min^0==min^post_12 && nodecount^0==nodecount^post_12 && sourceflag^0==sourceflag^post_12 ], cost: 1 41: l13 -> l15 : ___lengthofvisited^0'=___lengthofvisited^post_42, destflag^0'=destflag^post_42, edgecount^0'=edgecount^post_42, h^0'=h^post_42, i^0'=i^post_42, j^0'=j^post_42, k^0'=k^post_42, k_1^0'=k_1^post_42, min^0'=min^post_42, nodecount^0'=nodecount^post_42, sourceflag^0'=sourceflag^post_42, [ ___lengthofvisited^0==___lengthofvisited^post_42 && destflag^0==destflag^post_42 && edgecount^0==edgecount^post_42 && h^0==h^post_42 && i^0==i^post_42 && j^0==j^post_42 && k^0==k^post_42 && k_1^0==k_1^post_42 && min^0==min^post_42 && nodecount^0==nodecount^post_42 && sourceflag^0==sourceflag^post_42 ], cost: 1 12: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_13, destflag^0'=destflag^post_13, edgecount^0'=edgecount^post_13, h^0'=h^post_13, i^0'=i^post_13, j^0'=j^post_13, k^0'=k^post_13, k_1^0'=k_1^post_13, min^0'=min^post_13, nodecount^0'=nodecount^post_13, sourceflag^0'=sourceflag^post_13, [ ___lengthofvisited^0==___lengthofvisited^post_13 && destflag^0==destflag^post_13 && edgecount^0==edgecount^post_13 && h^0==h^post_13 && i^0==i^post_13 && j^0==j^post_13 && k^0==k^post_13 && k_1^0==k_1^post_13 && min^0==min^post_13 && nodecount^0==nodecount^post_13 && sourceflag^0==sourceflag^post_13 ], cost: 1 13: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_14, destflag^0'=destflag^post_14, edgecount^0'=edgecount^post_14, h^0'=h^post_14, i^0'=i^post_14, j^0'=j^post_14, k^0'=k^post_14, k_1^0'=k_1^post_14, min^0'=min^post_14, nodecount^0'=nodecount^post_14, sourceflag^0'=sourceflag^post_14, [ destflag^post_14==0 && ___lengthofvisited^0==___lengthofvisited^post_14 && edgecount^0==edgecount^post_14 && h^0==h^post_14 && i^0==i^post_14 && j^0==j^post_14 && k^0==k^post_14 && k_1^0==k_1^post_14 && min^0==min^post_14 && nodecount^0==nodecount^post_14 && sourceflag^0==sourceflag^post_14 ], cost: 1 14: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_15, destflag^0'=destflag^post_15, edgecount^0'=edgecount^post_15, h^0'=h^post_15, i^0'=i^post_15, j^0'=j^post_15, k^0'=k^post_15, k_1^0'=k_1^post_15, min^0'=min^post_15, nodecount^0'=nodecount^post_15, sourceflag^0'=sourceflag^post_15, [ ___lengthofvisited^0==___lengthofvisited^post_15 && destflag^0==destflag^post_15 && edgecount^0==edgecount^post_15 && h^0==h^post_15 && i^0==i^post_15 && j^0==j^post_15 && k^0==k^post_15 && k_1^0==k_1^post_15 && min^0==min^post_15 && nodecount^0==nodecount^post_15 && sourceflag^0==sourceflag^post_15 ], cost: 1 15: l15 -> l9 : ___lengthofvisited^0'=___lengthofvisited^post_16, destflag^0'=destflag^post_16, edgecount^0'=edgecount^post_16, h^0'=h^post_16, i^0'=i^post_16, j^0'=j^post_16, k^0'=k^post_16, k_1^0'=k_1^post_16, min^0'=min^post_16, nodecount^0'=nodecount^post_16, sourceflag^0'=sourceflag^post_16, [ nodecount^0<=j^0 && ___lengthofvisited^0==___lengthofvisited^post_16 && destflag^0==destflag^post_16 && edgecount^0==edgecount^post_16 && h^0==h^post_16 && i^0==i^post_16 && j^0==j^post_16 && k^0==k^post_16 && k_1^0==k_1^post_16 && min^0==min^post_16 && nodecount^0==nodecount^post_16 && sourceflag^0==sourceflag^post_16 ], cost: 1 16: l15 -> l14 : ___lengthofvisited^0'=___lengthofvisited^post_17, destflag^0'=destflag^post_17, edgecount^0'=edgecount^post_17, h^0'=h^post_17, i^0'=i^post_17, j^0'=j^post_17, k^0'=k^post_17, k_1^0'=k_1^post_17, min^0'=min^post_17, nodecount^0'=nodecount^post_17, sourceflag^0'=sourceflag^post_17, [ 1+j^0<=nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_17 && destflag^0==destflag^post_17 && edgecount^0==edgecount^post_17 && h^0==h^post_17 && i^0==i^post_17 && j^0==j^post_17 && k^0==k^post_17 && k_1^0==k_1^post_17 && min^0==min^post_17 && nodecount^0==nodecount^post_17 && sourceflag^0==sourceflag^post_17 ], cost: 1 17: l16 -> l17 : ___lengthofvisited^0'=___lengthofvisited^post_18, destflag^0'=destflag^post_18, edgecount^0'=edgecount^post_18, h^0'=h^post_18, i^0'=i^post_18, j^0'=j^post_18, k^0'=k^post_18, k_1^0'=k_1^post_18, min^0'=min^post_18, nodecount^0'=nodecount^post_18, sourceflag^0'=sourceflag^post_18, [ j^post_18==1+j^0 && ___lengthofvisited^0==___lengthofvisited^post_18 && destflag^0==destflag^post_18 && edgecount^0==edgecount^post_18 && h^0==h^post_18 && i^0==i^post_18 && k^0==k^post_18 && k_1^0==k_1^post_18 && min^0==min^post_18 && nodecount^0==nodecount^post_18 && sourceflag^0==sourceflag^post_18 ], cost: 1 34: l17 -> l20 : ___lengthofvisited^0'=___lengthofvisited^post_35, destflag^0'=destflag^post_35, edgecount^0'=edgecount^post_35, h^0'=h^post_35, i^0'=i^post_35, j^0'=j^post_35, k^0'=k^post_35, k_1^0'=k_1^post_35, min^0'=min^post_35, nodecount^0'=nodecount^post_35, sourceflag^0'=sourceflag^post_35, [ ___lengthofvisited^0==___lengthofvisited^post_35 && destflag^0==destflag^post_35 && edgecount^0==edgecount^post_35 && h^0==h^post_35 && i^0==i^post_35 && j^0==j^post_35 && k^0==k^post_35 && k_1^0==k_1^post_35 && min^0==min^post_35 && nodecount^0==nodecount^post_35 && sourceflag^0==sourceflag^post_35 ], cost: 1 30: l18 -> l4 : ___lengthofvisited^0'=___lengthofvisited^post_31, destflag^0'=destflag^post_31, edgecount^0'=edgecount^post_31, h^0'=h^post_31, i^0'=i^post_31, j^0'=j^post_31, k^0'=k^post_31, k_1^0'=k_1^post_31, min^0'=min^post_31, nodecount^0'=nodecount^post_31, sourceflag^0'=sourceflag^post_31, [ edgecount^0<=k_1^0 && k^post_31==1+k^0 && ___lengthofvisited^0==___lengthofvisited^post_31 && destflag^0==destflag^post_31 && edgecount^0==edgecount^post_31 && h^0==h^post_31 && i^0==i^post_31 && j^0==j^post_31 && k_1^0==k_1^post_31 && min^0==min^post_31 && nodecount^0==nodecount^post_31 && sourceflag^0==sourceflag^post_31 ], cost: 1 31: l18 -> l22 : ___lengthofvisited^0'=___lengthofvisited^post_32, destflag^0'=destflag^post_32, edgecount^0'=edgecount^post_32, h^0'=h^post_32, i^0'=i^post_32, j^0'=j^post_32, k^0'=k^post_32, k_1^0'=k_1^post_32, min^0'=min^post_32, nodecount^0'=nodecount^post_32, sourceflag^0'=sourceflag^post_32, [ 1+k_1^0<=edgecount^0 && h^post_32==0 && ___lengthofvisited^0==___lengthofvisited^post_32 && destflag^0==destflag^post_32 && edgecount^0==edgecount^post_32 && i^0==i^post_32 && j^0==j^post_32 && k^0==k^post_32 && k_1^0==k_1^post_32 && min^0==min^post_32 && nodecount^0==nodecount^post_32 && sourceflag^0==sourceflag^post_32 ], cost: 1 19: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_20, destflag^0'=destflag^post_20, edgecount^0'=edgecount^post_20, h^0'=h^post_20, i^0'=i^post_20, j^0'=j^post_20, k^0'=k^post_20, k_1^0'=k_1^post_20, min^0'=min^post_20, nodecount^0'=nodecount^post_20, sourceflag^0'=sourceflag^post_20, [ ___lengthofvisited^0==___lengthofvisited^post_20 && destflag^0==destflag^post_20 && edgecount^0==edgecount^post_20 && h^0==h^post_20 && i^0==i^post_20 && j^0==j^post_20 && k^0==k^post_20 && k_1^0==k_1^post_20 && min^0==min^post_20 && nodecount^0==nodecount^post_20 && sourceflag^0==sourceflag^post_20 ], cost: 1 20: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_21, destflag^0'=destflag^post_21, edgecount^0'=edgecount^post_21, h^0'=h^post_21, i^0'=i^post_21, j^0'=j^post_21, k^0'=k^post_21, k_1^0'=k_1^post_21, min^0'=min^post_21, nodecount^0'=nodecount^post_21, sourceflag^0'=sourceflag^post_21, [ sourceflag^post_21==1 && ___lengthofvisited^0==___lengthofvisited^post_21 && destflag^0==destflag^post_21 && edgecount^0==edgecount^post_21 && h^0==h^post_21 && i^0==i^post_21 && j^0==j^post_21 && k^0==k^post_21 && k_1^0==k_1^post_21 && min^0==min^post_21 && nodecount^0==nodecount^post_21 ], cost: 1 21: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_22, destflag^0'=destflag^post_22, edgecount^0'=edgecount^post_22, h^0'=h^post_22, i^0'=i^post_22, j^0'=j^post_22, k^0'=k^post_22, k_1^0'=k_1^post_22, min^0'=min^post_22, nodecount^0'=nodecount^post_22, sourceflag^0'=sourceflag^post_22, [ ___lengthofvisited^0==___lengthofvisited^post_22 && destflag^0==destflag^post_22 && edgecount^0==edgecount^post_22 && h^0==h^post_22 && i^0==i^post_22 && j^0==j^post_22 && k^0==k^post_22 && k_1^0==k_1^post_22 && min^0==min^post_22 && nodecount^0==nodecount^post_22 && sourceflag^0==sourceflag^post_22 ], cost: 1 22: l20 -> l13 : ___lengthofvisited^0'=___lengthofvisited^post_23, destflag^0'=destflag^post_23, edgecount^0'=edgecount^post_23, h^0'=h^post_23, i^0'=i^post_23, j^0'=j^post_23, k^0'=k^post_23, k_1^0'=k_1^post_23, min^0'=min^post_23, nodecount^0'=nodecount^post_23, sourceflag^0'=sourceflag^post_23, [ nodecount^0<=j^0 && destflag^post_23==1 && j^post_23==0 && ___lengthofvisited^0==___lengthofvisited^post_23 && edgecount^0==edgecount^post_23 && h^0==h^post_23 && i^0==i^post_23 && k^0==k^post_23 && k_1^0==k_1^post_23 && min^0==min^post_23 && nodecount^0==nodecount^post_23 && sourceflag^0==sourceflag^post_23 ], cost: 1 23: l20 -> l19 : ___lengthofvisited^0'=___lengthofvisited^post_24, destflag^0'=destflag^post_24, edgecount^0'=edgecount^post_24, h^0'=h^post_24, i^0'=i^post_24, j^0'=j^post_24, k^0'=k^post_24, k_1^0'=k_1^post_24, min^0'=min^post_24, nodecount^0'=nodecount^post_24, sourceflag^0'=sourceflag^post_24, [ 1+j^0<=nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_24 && destflag^0==destflag^post_24 && edgecount^0==edgecount^post_24 && h^0==h^post_24 && i^0==i^post_24 && j^0==j^post_24 && k^0==k^post_24 && k_1^0==k_1^post_24 && min^0==min^post_24 && nodecount^0==nodecount^post_24 && sourceflag^0==sourceflag^post_24 ], cost: 1 24: l21 -> l22 : ___lengthofvisited^0'=___lengthofvisited^post_25, destflag^0'=destflag^post_25, edgecount^0'=edgecount^post_25, h^0'=h^post_25, i^0'=i^post_25, j^0'=j^post_25, k^0'=k^post_25, k_1^0'=k_1^post_25, min^0'=min^post_25, nodecount^0'=nodecount^post_25, sourceflag^0'=sourceflag^post_25, [ h^post_25==1+h^0 && ___lengthofvisited^0==___lengthofvisited^post_25 && destflag^0==destflag^post_25 && edgecount^0==edgecount^post_25 && i^0==i^post_25 && j^0==j^post_25 && k^0==k^post_25 && k_1^0==k_1^post_25 && min^0==min^post_25 && nodecount^0==nodecount^post_25 && sourceflag^0==sourceflag^post_25 ], cost: 1 27: l22 -> l24 : ___lengthofvisited^0'=___lengthofvisited^post_28, destflag^0'=destflag^post_28, edgecount^0'=edgecount^post_28, h^0'=h^post_28, i^0'=i^post_28, j^0'=j^post_28, k^0'=k^post_28, k_1^0'=k_1^post_28, min^0'=min^post_28, nodecount^0'=nodecount^post_28, sourceflag^0'=sourceflag^post_28, [ ___lengthofvisited^0==___lengthofvisited^post_28 && destflag^0==destflag^post_28 && edgecount^0==edgecount^post_28 && h^0==h^post_28 && i^0==i^post_28 && j^0==j^post_28 && k^0==k^post_28 && k_1^0==k_1^post_28 && min^0==min^post_28 && nodecount^0==nodecount^post_28 && sourceflag^0==sourceflag^post_28 ], cost: 1 25: l23 -> l21 : ___lengthofvisited^0'=___lengthofvisited^post_26, destflag^0'=destflag^post_26, edgecount^0'=edgecount^post_26, h^0'=h^post_26, i^0'=i^post_26, j^0'=j^post_26, k^0'=k^post_26, k_1^0'=k_1^post_26, min^0'=min^post_26, nodecount^0'=nodecount^post_26, sourceflag^0'=sourceflag^post_26, [ min^post_26==h^0 && ___lengthofvisited^0==___lengthofvisited^post_26 && destflag^0==destflag^post_26 && edgecount^0==edgecount^post_26 && h^0==h^post_26 && i^0==i^post_26 && j^0==j^post_26 && k^0==k^post_26 && k_1^0==k_1^post_26 && nodecount^0==nodecount^post_26 && sourceflag^0==sourceflag^post_26 ], cost: 1 26: l23 -> l21 : ___lengthofvisited^0'=___lengthofvisited^post_27, destflag^0'=destflag^post_27, edgecount^0'=edgecount^post_27, h^0'=h^post_27, i^0'=i^post_27, j^0'=j^post_27, k^0'=k^post_27, k_1^0'=k_1^post_27, min^0'=min^post_27, nodecount^0'=nodecount^post_27, sourceflag^0'=sourceflag^post_27, [ ___lengthofvisited^0==___lengthofvisited^post_27 && destflag^0==destflag^post_27 && edgecount^0==edgecount^post_27 && h^0==h^post_27 && i^0==i^post_27 && j^0==j^post_27 && k^0==k^post_27 && k_1^0==k_1^post_27 && min^0==min^post_27 && nodecount^0==nodecount^post_27 && sourceflag^0==sourceflag^post_27 ], cost: 1 28: l24 -> l17 : ___lengthofvisited^0'=___lengthofvisited^post_29, destflag^0'=destflag^post_29, edgecount^0'=edgecount^post_29, h^0'=h^post_29, i^0'=i^post_29, j^0'=j^post_29, k^0'=k^post_29, k_1^0'=k_1^post_29, min^0'=min^post_29, nodecount^0'=nodecount^post_29, sourceflag^0'=sourceflag^post_29, [ edgecount^0<=h^0 && sourceflag^post_29==0 && j^post_29==0 && ___lengthofvisited^0==___lengthofvisited^post_29 && destflag^0==destflag^post_29 && edgecount^0==edgecount^post_29 && h^0==h^post_29 && i^0==i^post_29 && k^0==k^post_29 && k_1^0==k_1^post_29 && min^0==min^post_29 && nodecount^0==nodecount^post_29 ], cost: 1 29: l24 -> l23 : ___lengthofvisited^0'=___lengthofvisited^post_30, destflag^0'=destflag^post_30, edgecount^0'=edgecount^post_30, h^0'=h^post_30, i^0'=i^post_30, j^0'=j^post_30, k^0'=k^post_30, k_1^0'=k_1^post_30, min^0'=min^post_30, nodecount^0'=nodecount^post_30, sourceflag^0'=sourceflag^post_30, [ 1+h^0<=edgecount^0 && ___lengthofvisited^0==___lengthofvisited^post_30 && destflag^0==destflag^post_30 && edgecount^0==edgecount^post_30 && h^0==h^post_30 && i^0==i^post_30 && j^0==j^post_30 && k^0==k^post_30 && k_1^0==k_1^post_30 && min^0==min^post_30 && nodecount^0==nodecount^post_30 && sourceflag^0==sourceflag^post_30 ], cost: 1 35: l25 -> l10 : ___lengthofvisited^0'=___lengthofvisited^post_36, destflag^0'=destflag^post_36, edgecount^0'=edgecount^post_36, h^0'=h^post_36, i^0'=i^post_36, j^0'=j^post_36, k^0'=k^post_36, k_1^0'=k_1^post_36, min^0'=min^post_36, nodecount^0'=nodecount^post_36, sourceflag^0'=sourceflag^post_36, [ min^post_36==0 && i^post_36==0 && ___lengthofvisited^0==___lengthofvisited^post_36 && destflag^0==destflag^post_36 && edgecount^0==edgecount^post_36 && h^0==h^post_36 && j^0==j^post_36 && k^0==k^post_36 && k_1^0==k_1^post_36 && nodecount^0==nodecount^post_36 && sourceflag^0==sourceflag^post_36 ], cost: 1 44: l27 -> l0 : ___lengthofvisited^0'=___lengthofvisited^post_45, destflag^0'=destflag^post_45, edgecount^0'=edgecount^post_45, h^0'=h^post_45, i^0'=i^post_45, j^0'=j^post_45, k^0'=k^post_45, k_1^0'=k_1^post_45, min^0'=min^post_45, nodecount^0'=nodecount^post_45, sourceflag^0'=sourceflag^post_45, [ ___lengthofvisited^post_45==edgecount^0 && i^post_45==1 && destflag^0==destflag^post_45 && edgecount^0==edgecount^post_45 && h^0==h^post_45 && j^0==j^post_45 && k^0==k^post_45 && k_1^0==k_1^post_45 && min^0==min^post_45 && nodecount^0==nodecount^post_45 && sourceflag^0==sourceflag^post_45 ], cost: 1 45: l28 -> l27 : ___lengthofvisited^0'=___lengthofvisited^post_46, destflag^0'=destflag^post_46, edgecount^0'=edgecount^post_46, h^0'=h^post_46, i^0'=i^post_46, j^0'=j^post_46, k^0'=k^post_46, k_1^0'=k_1^post_46, min^0'=min^post_46, nodecount^0'=nodecount^post_46, sourceflag^0'=sourceflag^post_46, [ ___lengthofvisited^0==___lengthofvisited^post_46 && destflag^0==destflag^post_46 && edgecount^0==edgecount^post_46 && h^0==h^post_46 && i^0==i^post_46 && j^0==j^post_46 && k^0==k^post_46 && k_1^0==k_1^post_46 && min^0==min^post_46 && nodecount^0==nodecount^post_46 && sourceflag^0==sourceflag^post_46 ], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 45: l28 -> l27 : ___lengthofvisited^0'=___lengthofvisited^post_46, destflag^0'=destflag^post_46, edgecount^0'=edgecount^post_46, h^0'=h^post_46, i^0'=i^post_46, j^0'=j^post_46, k^0'=k^post_46, k_1^0'=k_1^post_46, min^0'=min^post_46, nodecount^0'=nodecount^post_46, sourceflag^0'=sourceflag^post_46, [ ___lengthofvisited^0==___lengthofvisited^post_46 && destflag^0==destflag^post_46 && edgecount^0==edgecount^post_46 && h^0==h^post_46 && i^0==i^post_46 && j^0==j^post_46 && k^0==k^post_46 && k_1^0==k_1^post_46 && min^0==min^post_46 && nodecount^0==nodecount^post_46 && sourceflag^0==sourceflag^post_46 ], cost: 1 Removed unreachable and leaf rules: Start location: l28 0: l0 -> l1 : ___lengthofvisited^0'=___lengthofvisited^post_1, destflag^0'=destflag^post_1, edgecount^0'=edgecount^post_1, h^0'=h^post_1, i^0'=i^post_1, j^0'=j^post_1, k^0'=k^post_1, k_1^0'=k_1^post_1, min^0'=min^post_1, nodecount^0'=nodecount^post_1, sourceflag^0'=sourceflag^post_1, [ ___lengthofvisited^0==___lengthofvisited^post_1 && destflag^0==destflag^post_1 && edgecount^0==edgecount^post_1 && h^0==h^post_1 && i^0==i^post_1 && j^0==j^post_1 && k^0==k^post_1 && k_1^0==k_1^post_1 && min^0==min^post_1 && nodecount^0==nodecount^post_1 && sourceflag^0==sourceflag^post_1 ], cost: 1 42: l1 -> l2 : ___lengthofvisited^0'=___lengthofvisited^post_43, destflag^0'=destflag^post_43, edgecount^0'=edgecount^post_43, h^0'=h^post_43, i^0'=i^post_43, j^0'=j^post_43, k^0'=k^post_43, k_1^0'=k_1^post_43, min^0'=min^post_43, nodecount^0'=nodecount^post_43, sourceflag^0'=sourceflag^post_43, [ nodecount^0<=i^0 && i^post_43==0 && ___lengthofvisited^0==___lengthofvisited^post_43 && destflag^0==destflag^post_43 && edgecount^0==edgecount^post_43 && h^0==h^post_43 && j^0==j^post_43 && k^0==k^post_43 && k_1^0==k_1^post_43 && min^0==min^post_43 && nodecount^0==nodecount^post_43 && sourceflag^0==sourceflag^post_43 ], cost: 1 43: l1 -> l0 : ___lengthofvisited^0'=___lengthofvisited^post_44, destflag^0'=destflag^post_44, edgecount^0'=edgecount^post_44, h^0'=h^post_44, i^0'=i^post_44, j^0'=j^post_44, k^0'=k^post_44, k_1^0'=k_1^post_44, min^0'=min^post_44, nodecount^0'=nodecount^post_44, sourceflag^0'=sourceflag^post_44, [ 1+i^0<=nodecount^0 && i^post_44==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_44 && destflag^0==destflag^post_44 && edgecount^0==edgecount^post_44 && h^0==h^post_44 && j^0==j^post_44 && k^0==k^post_44 && k_1^0==k_1^post_44 && min^0==min^post_44 && nodecount^0==nodecount^post_44 && sourceflag^0==sourceflag^post_44 ], cost: 1 1: l2 -> l3 : ___lengthofvisited^0'=___lengthofvisited^post_2, destflag^0'=destflag^post_2, edgecount^0'=edgecount^post_2, h^0'=h^post_2, i^0'=i^post_2, j^0'=j^post_2, k^0'=k^post_2, k_1^0'=k_1^post_2, min^0'=min^post_2, nodecount^0'=nodecount^post_2, sourceflag^0'=sourceflag^post_2, [ ___lengthofvisited^0==___lengthofvisited^post_2 && destflag^0==destflag^post_2 && edgecount^0==edgecount^post_2 && h^0==h^post_2 && i^0==i^post_2 && j^0==j^post_2 && k^0==k^post_2 && k_1^0==k_1^post_2 && min^0==min^post_2 && nodecount^0==nodecount^post_2 && sourceflag^0==sourceflag^post_2 ], cost: 1 39: l3 -> l4 : ___lengthofvisited^0'=___lengthofvisited^post_40, destflag^0'=destflag^post_40, edgecount^0'=edgecount^post_40, h^0'=h^post_40, i^0'=i^post_40, j^0'=j^post_40, k^0'=k^post_40, k_1^0'=k_1^post_40, min^0'=min^post_40, nodecount^0'=nodecount^post_40, sourceflag^0'=sourceflag^post_40, [ -1+nodecount^0<=i^0 && k^post_40==0 && ___lengthofvisited^0==___lengthofvisited^post_40 && destflag^0==destflag^post_40 && edgecount^0==edgecount^post_40 && h^0==h^post_40 && i^0==i^post_40 && j^0==j^post_40 && k_1^0==k_1^post_40 && min^0==min^post_40 && nodecount^0==nodecount^post_40 && sourceflag^0==sourceflag^post_40 ], cost: 1 40: l3 -> l2 : ___lengthofvisited^0'=___lengthofvisited^post_41, destflag^0'=destflag^post_41, edgecount^0'=edgecount^post_41, h^0'=h^post_41, i^0'=i^post_41, j^0'=j^post_41, k^0'=k^post_41, k_1^0'=k_1^post_41, min^0'=min^post_41, nodecount^0'=nodecount^post_41, sourceflag^0'=sourceflag^post_41, [ 1+i^0<=-1+nodecount^0 && i^post_41==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_41 && destflag^0==destflag^post_41 && edgecount^0==edgecount^post_41 && h^0==h^post_41 && j^0==j^post_41 && k^0==k^post_41 && k_1^0==k_1^post_41 && min^0==min^post_41 && nodecount^0==nodecount^post_41 && sourceflag^0==sourceflag^post_41 ], cost: 1 2: l4 -> l5 : ___lengthofvisited^0'=___lengthofvisited^post_3, destflag^0'=destflag^post_3, edgecount^0'=edgecount^post_3, h^0'=h^post_3, i^0'=i^post_3, j^0'=j^post_3, k^0'=k^post_3, k_1^0'=k_1^post_3, min^0'=min^post_3, nodecount^0'=nodecount^post_3, sourceflag^0'=sourceflag^post_3, [ ___lengthofvisited^0==___lengthofvisited^post_3 && destflag^0==destflag^post_3 && edgecount^0==edgecount^post_3 && h^0==h^post_3 && i^0==i^post_3 && j^0==j^post_3 && k^0==k^post_3 && k_1^0==k_1^post_3 && min^0==min^post_3 && nodecount^0==nodecount^post_3 && sourceflag^0==sourceflag^post_3 ], cost: 1 37: l5 -> l25 : ___lengthofvisited^0'=___lengthofvisited^post_38, destflag^0'=destflag^post_38, edgecount^0'=edgecount^post_38, h^0'=h^post_38, i^0'=i^post_38, j^0'=j^post_38, k^0'=k^post_38, k_1^0'=k_1^post_38, min^0'=min^post_38, nodecount^0'=nodecount^post_38, sourceflag^0'=sourceflag^post_38, [ nodecount^0<=k^0 && ___lengthofvisited^0==___lengthofvisited^post_38 && destflag^0==destflag^post_38 && edgecount^0==edgecount^post_38 && h^0==h^post_38 && i^0==i^post_38 && j^0==j^post_38 && k^0==k^post_38 && k_1^0==k_1^post_38 && min^0==min^post_38 && nodecount^0==nodecount^post_38 && sourceflag^0==sourceflag^post_38 ], cost: 1 38: l5 -> l25 : ___lengthofvisited^0'=___lengthofvisited^post_39, destflag^0'=destflag^post_39, edgecount^0'=edgecount^post_39, h^0'=h^post_39, i^0'=i^post_39, j^0'=j^post_39, k^0'=k^post_39, k_1^0'=k_1^post_39, min^0'=min^post_39, nodecount^0'=nodecount^post_39, sourceflag^0'=sourceflag^post_39, [ 1+k^0<=-1+nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_39 && destflag^0==destflag^post_39 && edgecount^0==edgecount^post_39 && h^0==h^post_39 && i^0==i^post_39 && j^0==j^post_39 && k^0==k^post_39 && k_1^0==k_1^post_39 && min^0==min^post_39 && nodecount^0==nodecount^post_39 && sourceflag^0==sourceflag^post_39 ], cost: 1 3: l6 -> l7 : ___lengthofvisited^0'=___lengthofvisited^post_4, destflag^0'=destflag^post_4, edgecount^0'=edgecount^post_4, h^0'=h^post_4, i^0'=i^post_4, j^0'=j^post_4, k^0'=k^post_4, k_1^0'=k_1^post_4, min^0'=min^post_4, nodecount^0'=nodecount^post_4, sourceflag^0'=sourceflag^post_4, [ k_1^post_4==1+k_1^0 && ___lengthofvisited^0==___lengthofvisited^post_4 && destflag^0==destflag^post_4 && edgecount^0==edgecount^post_4 && h^0==h^post_4 && i^0==i^post_4 && j^0==j^post_4 && k^0==k^post_4 && min^0==min^post_4 && nodecount^0==nodecount^post_4 && sourceflag^0==sourceflag^post_4 ], cost: 1 18: l7 -> l18 : ___lengthofvisited^0'=___lengthofvisited^post_19, destflag^0'=destflag^post_19, edgecount^0'=edgecount^post_19, h^0'=h^post_19, i^0'=i^post_19, j^0'=j^post_19, k^0'=k^post_19, k_1^0'=k_1^post_19, min^0'=min^post_19, nodecount^0'=nodecount^post_19, sourceflag^0'=sourceflag^post_19, [ ___lengthofvisited^0==___lengthofvisited^post_19 && destflag^0==destflag^post_19 && edgecount^0==edgecount^post_19 && h^0==h^post_19 && i^0==i^post_19 && j^0==j^post_19 && k^0==k^post_19 && k_1^0==k_1^post_19 && min^0==min^post_19 && nodecount^0==nodecount^post_19 && sourceflag^0==sourceflag^post_19 ], cost: 1 4: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_5, destflag^0'=destflag^post_5, edgecount^0'=edgecount^post_5, h^0'=h^post_5, i^0'=i^post_5, j^0'=j^post_5, k^0'=k^post_5, k_1^0'=k_1^post_5, min^0'=min^post_5, nodecount^0'=nodecount^post_5, sourceflag^0'=sourceflag^post_5, [ 1<=destflag^0 && ___lengthofvisited^0==___lengthofvisited^post_5 && destflag^0==destflag^post_5 && edgecount^0==edgecount^post_5 && h^0==h^post_5 && i^0==i^post_5 && j^0==j^post_5 && k^0==k^post_5 && k_1^0==k_1^post_5 && min^0==min^post_5 && nodecount^0==nodecount^post_5 && sourceflag^0==sourceflag^post_5 ], cost: 1 5: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_6, destflag^0'=destflag^post_6, edgecount^0'=edgecount^post_6, h^0'=h^post_6, i^0'=i^post_6, j^0'=j^post_6, k^0'=k^post_6, k_1^0'=k_1^post_6, min^0'=min^post_6, nodecount^0'=nodecount^post_6, sourceflag^0'=sourceflag^post_6, [ 1+destflag^0<=0 && ___lengthofvisited^0==___lengthofvisited^post_6 && destflag^0==destflag^post_6 && edgecount^0==edgecount^post_6 && h^0==h^post_6 && i^0==i^post_6 && j^0==j^post_6 && k^0==k^post_6 && k_1^0==k_1^post_6 && min^0==min^post_6 && nodecount^0==nodecount^post_6 && sourceflag^0==sourceflag^post_6 ], cost: 1 6: l8 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_7, destflag^0'=destflag^post_7, edgecount^0'=edgecount^post_7, h^0'=h^post_7, i^0'=i^post_7, j^0'=j^post_7, k^0'=k^post_7, k_1^0'=k_1^post_7, min^0'=min^post_7, nodecount^0'=nodecount^post_7, sourceflag^0'=sourceflag^post_7, [ destflag^0<=0 && 0<=destflag^0 && ___lengthofvisited^0==___lengthofvisited^post_7 && destflag^0==destflag^post_7 && edgecount^0==edgecount^post_7 && h^0==h^post_7 && i^0==i^post_7 && j^0==j^post_7 && k^0==k^post_7 && k_1^0==k_1^post_7 && min^0==min^post_7 && nodecount^0==nodecount^post_7 && sourceflag^0==sourceflag^post_7 ], cost: 1 7: l9 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_8, destflag^0'=destflag^post_8, edgecount^0'=edgecount^post_8, h^0'=h^post_8, i^0'=i^post_8, j^0'=j^post_8, k^0'=k^post_8, k_1^0'=k_1^post_8, min^0'=min^post_8, nodecount^0'=nodecount^post_8, sourceflag^0'=sourceflag^post_8, [ 1<=sourceflag^0 && ___lengthofvisited^0==___lengthofvisited^post_8 && destflag^0==destflag^post_8 && edgecount^0==edgecount^post_8 && h^0==h^post_8 && i^0==i^post_8 && j^0==j^post_8 && k^0==k^post_8 && k_1^0==k_1^post_8 && min^0==min^post_8 && nodecount^0==nodecount^post_8 && sourceflag^0==sourceflag^post_8 ], cost: 1 8: l9 -> l6 : ___lengthofvisited^0'=___lengthofvisited^post_9, destflag^0'=destflag^post_9, edgecount^0'=edgecount^post_9, h^0'=h^post_9, i^0'=i^post_9, j^0'=j^post_9, k^0'=k^post_9, k_1^0'=k_1^post_9, min^0'=min^post_9, nodecount^0'=nodecount^post_9, sourceflag^0'=sourceflag^post_9, [ 1+sourceflag^0<=0 && ___lengthofvisited^0==___lengthofvisited^post_9 && destflag^0==destflag^post_9 && edgecount^0==edgecount^post_9 && h^0==h^post_9 && i^0==i^post_9 && j^0==j^post_9 && k^0==k^post_9 && k_1^0==k_1^post_9 && min^0==min^post_9 && nodecount^0==nodecount^post_9 && sourceflag^0==sourceflag^post_9 ], cost: 1 9: l9 -> l8 : ___lengthofvisited^0'=___lengthofvisited^post_10, destflag^0'=destflag^post_10, edgecount^0'=edgecount^post_10, h^0'=h^post_10, i^0'=i^post_10, j^0'=j^post_10, k^0'=k^post_10, k_1^0'=k_1^post_10, min^0'=min^post_10, nodecount^0'=nodecount^post_10, sourceflag^0'=sourceflag^post_10, [ sourceflag^0<=0 && 0<=sourceflag^0 && ___lengthofvisited^0==___lengthofvisited^post_10 && destflag^0==destflag^post_10 && edgecount^0==edgecount^post_10 && h^0==h^post_10 && i^0==i^post_10 && j^0==j^post_10 && k^0==k^post_10 && k_1^0==k_1^post_10 && min^0==min^post_10 && nodecount^0==nodecount^post_10 && sourceflag^0==sourceflag^post_10 ], cost: 1 10: l10 -> l11 : ___lengthofvisited^0'=___lengthofvisited^post_11, destflag^0'=destflag^post_11, edgecount^0'=edgecount^post_11, h^0'=h^post_11, i^0'=i^post_11, j^0'=j^post_11, k^0'=k^post_11, k_1^0'=k_1^post_11, min^0'=min^post_11, nodecount^0'=nodecount^post_11, sourceflag^0'=sourceflag^post_11, [ ___lengthofvisited^0==___lengthofvisited^post_11 && destflag^0==destflag^post_11 && edgecount^0==edgecount^post_11 && h^0==h^post_11 && i^0==i^post_11 && j^0==j^post_11 && k^0==k^post_11 && k_1^0==k_1^post_11 && min^0==min^post_11 && nodecount^0==nodecount^post_11 && sourceflag^0==sourceflag^post_11 ], cost: 1 32: l11 -> l7 : ___lengthofvisited^0'=___lengthofvisited^post_33, destflag^0'=destflag^post_33, edgecount^0'=edgecount^post_33, h^0'=h^post_33, i^0'=i^post_33, j^0'=j^post_33, k^0'=k^post_33, k_1^0'=k_1^post_33, min^0'=min^post_33, nodecount^0'=nodecount^post_33, sourceflag^0'=sourceflag^post_33, [ edgecount^0<=i^0 && k_1^post_33==0 && ___lengthofvisited^0==___lengthofvisited^post_33 && destflag^0==destflag^post_33 && edgecount^0==edgecount^post_33 && h^0==h^post_33 && i^0==i^post_33 && j^0==j^post_33 && k^0==k^post_33 && min^0==min^post_33 && nodecount^0==nodecount^post_33 && sourceflag^0==sourceflag^post_33 ], cost: 1 33: l11 -> l10 : ___lengthofvisited^0'=___lengthofvisited^post_34, destflag^0'=destflag^post_34, edgecount^0'=edgecount^post_34, h^0'=h^post_34, i^0'=i^post_34, j^0'=j^post_34, k^0'=k^post_34, k_1^0'=k_1^post_34, min^0'=min^post_34, nodecount^0'=nodecount^post_34, sourceflag^0'=sourceflag^post_34, [ 1+i^0<=edgecount^0 && i^post_34==1+i^0 && ___lengthofvisited^0==___lengthofvisited^post_34 && destflag^0==destflag^post_34 && edgecount^0==edgecount^post_34 && h^0==h^post_34 && j^0==j^post_34 && k^0==k^post_34 && k_1^0==k_1^post_34 && min^0==min^post_34 && nodecount^0==nodecount^post_34 && sourceflag^0==sourceflag^post_34 ], cost: 1 11: l12 -> l13 : ___lengthofvisited^0'=___lengthofvisited^post_12, destflag^0'=destflag^post_12, edgecount^0'=edgecount^post_12, h^0'=h^post_12, i^0'=i^post_12, j^0'=j^post_12, k^0'=k^post_12, k_1^0'=k_1^post_12, min^0'=min^post_12, nodecount^0'=nodecount^post_12, sourceflag^0'=sourceflag^post_12, [ j^post_12==1+j^0 && ___lengthofvisited^0==___lengthofvisited^post_12 && destflag^0==destflag^post_12 && edgecount^0==edgecount^post_12 && h^0==h^post_12 && i^0==i^post_12 && k^0==k^post_12 && k_1^0==k_1^post_12 && min^0==min^post_12 && nodecount^0==nodecount^post_12 && sourceflag^0==sourceflag^post_12 ], cost: 1 41: l13 -> l15 : ___lengthofvisited^0'=___lengthofvisited^post_42, destflag^0'=destflag^post_42, edgecount^0'=edgecount^post_42, h^0'=h^post_42, i^0'=i^post_42, j^0'=j^post_42, k^0'=k^post_42, k_1^0'=k_1^post_42, min^0'=min^post_42, nodecount^0'=nodecount^post_42, sourceflag^0'=sourceflag^post_42, [ ___lengthofvisited^0==___lengthofvisited^post_42 && destflag^0==destflag^post_42 && edgecount^0==edgecount^post_42 && h^0==h^post_42 && i^0==i^post_42 && j^0==j^post_42 && k^0==k^post_42 && k_1^0==k_1^post_42 && min^0==min^post_42 && nodecount^0==nodecount^post_42 && sourceflag^0==sourceflag^post_42 ], cost: 1 12: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_13, destflag^0'=destflag^post_13, edgecount^0'=edgecount^post_13, h^0'=h^post_13, i^0'=i^post_13, j^0'=j^post_13, k^0'=k^post_13, k_1^0'=k_1^post_13, min^0'=min^post_13, nodecount^0'=nodecount^post_13, sourceflag^0'=sourceflag^post_13, [ ___lengthofvisited^0==___lengthofvisited^post_13 && destflag^0==destflag^post_13 && edgecount^0==edgecount^post_13 && h^0==h^post_13 && i^0==i^post_13 && j^0==j^post_13 && k^0==k^post_13 && k_1^0==k_1^post_13 && min^0==min^post_13 && nodecount^0==nodecount^post_13 && sourceflag^0==sourceflag^post_13 ], cost: 1 13: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_14, destflag^0'=destflag^post_14, edgecount^0'=edgecount^post_14, h^0'=h^post_14, i^0'=i^post_14, j^0'=j^post_14, k^0'=k^post_14, k_1^0'=k_1^post_14, min^0'=min^post_14, nodecount^0'=nodecount^post_14, sourceflag^0'=sourceflag^post_14, [ destflag^post_14==0 && ___lengthofvisited^0==___lengthofvisited^post_14 && edgecount^0==edgecount^post_14 && h^0==h^post_14 && i^0==i^post_14 && j^0==j^post_14 && k^0==k^post_14 && k_1^0==k_1^post_14 && min^0==min^post_14 && nodecount^0==nodecount^post_14 && sourceflag^0==sourceflag^post_14 ], cost: 1 14: l14 -> l12 : ___lengthofvisited^0'=___lengthofvisited^post_15, destflag^0'=destflag^post_15, edgecount^0'=edgecount^post_15, h^0'=h^post_15, i^0'=i^post_15, j^0'=j^post_15, k^0'=k^post_15, k_1^0'=k_1^post_15, min^0'=min^post_15, nodecount^0'=nodecount^post_15, sourceflag^0'=sourceflag^post_15, [ ___lengthofvisited^0==___lengthofvisited^post_15 && destflag^0==destflag^post_15 && edgecount^0==edgecount^post_15 && h^0==h^post_15 && i^0==i^post_15 && j^0==j^post_15 && k^0==k^post_15 && k_1^0==k_1^post_15 && min^0==min^post_15 && nodecount^0==nodecount^post_15 && sourceflag^0==sourceflag^post_15 ], cost: 1 15: l15 -> l9 : ___lengthofvisited^0'=___lengthofvisited^post_16, destflag^0'=destflag^post_16, edgecount^0'=edgecount^post_16, h^0'=h^post_16, i^0'=i^post_16, j^0'=j^post_16, k^0'=k^post_16, k_1^0'=k_1^post_16, min^0'=min^post_16, nodecount^0'=nodecount^post_16, sourceflag^0'=sourceflag^post_16, [ nodecount^0<=j^0 && ___lengthofvisited^0==___lengthofvisited^post_16 && destflag^0==destflag^post_16 && edgecount^0==edgecount^post_16 && h^0==h^post_16 && i^0==i^post_16 && j^0==j^post_16 && k^0==k^post_16 && k_1^0==k_1^post_16 && min^0==min^post_16 && nodecount^0==nodecount^post_16 && sourceflag^0==sourceflag^post_16 ], cost: 1 16: l15 -> l14 : ___lengthofvisited^0'=___lengthofvisited^post_17, destflag^0'=destflag^post_17, edgecount^0'=edgecount^post_17, h^0'=h^post_17, i^0'=i^post_17, j^0'=j^post_17, k^0'=k^post_17, k_1^0'=k_1^post_17, min^0'=min^post_17, nodecount^0'=nodecount^post_17, sourceflag^0'=sourceflag^post_17, [ 1+j^0<=nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_17 && destflag^0==destflag^post_17 && edgecount^0==edgecount^post_17 && h^0==h^post_17 && i^0==i^post_17 && j^0==j^post_17 && k^0==k^post_17 && k_1^0==k_1^post_17 && min^0==min^post_17 && nodecount^0==nodecount^post_17 && sourceflag^0==sourceflag^post_17 ], cost: 1 17: l16 -> l17 : ___lengthofvisited^0'=___lengthofvisited^post_18, destflag^0'=destflag^post_18, edgecount^0'=edgecount^post_18, h^0'=h^post_18, i^0'=i^post_18, j^0'=j^post_18, k^0'=k^post_18, k_1^0'=k_1^post_18, min^0'=min^post_18, nodecount^0'=nodecount^post_18, sourceflag^0'=sourceflag^post_18, [ j^post_18==1+j^0 && ___lengthofvisited^0==___lengthofvisited^post_18 && destflag^0==destflag^post_18 && edgecount^0==edgecount^post_18 && h^0==h^post_18 && i^0==i^post_18 && k^0==k^post_18 && k_1^0==k_1^post_18 && min^0==min^post_18 && nodecount^0==nodecount^post_18 && sourceflag^0==sourceflag^post_18 ], cost: 1 34: l17 -> l20 : ___lengthofvisited^0'=___lengthofvisited^post_35, destflag^0'=destflag^post_35, edgecount^0'=edgecount^post_35, h^0'=h^post_35, i^0'=i^post_35, j^0'=j^post_35, k^0'=k^post_35, k_1^0'=k_1^post_35, min^0'=min^post_35, nodecount^0'=nodecount^post_35, sourceflag^0'=sourceflag^post_35, [ ___lengthofvisited^0==___lengthofvisited^post_35 && destflag^0==destflag^post_35 && edgecount^0==edgecount^post_35 && h^0==h^post_35 && i^0==i^post_35 && j^0==j^post_35 && k^0==k^post_35 && k_1^0==k_1^post_35 && min^0==min^post_35 && nodecount^0==nodecount^post_35 && sourceflag^0==sourceflag^post_35 ], cost: 1 30: l18 -> l4 : ___lengthofvisited^0'=___lengthofvisited^post_31, destflag^0'=destflag^post_31, edgecount^0'=edgecount^post_31, h^0'=h^post_31, i^0'=i^post_31, j^0'=j^post_31, k^0'=k^post_31, k_1^0'=k_1^post_31, min^0'=min^post_31, nodecount^0'=nodecount^post_31, sourceflag^0'=sourceflag^post_31, [ edgecount^0<=k_1^0 && k^post_31==1+k^0 && ___lengthofvisited^0==___lengthofvisited^post_31 && destflag^0==destflag^post_31 && edgecount^0==edgecount^post_31 && h^0==h^post_31 && i^0==i^post_31 && j^0==j^post_31 && k_1^0==k_1^post_31 && min^0==min^post_31 && nodecount^0==nodecount^post_31 && sourceflag^0==sourceflag^post_31 ], cost: 1 31: l18 -> l22 : ___lengthofvisited^0'=___lengthofvisited^post_32, destflag^0'=destflag^post_32, edgecount^0'=edgecount^post_32, h^0'=h^post_32, i^0'=i^post_32, j^0'=j^post_32, k^0'=k^post_32, k_1^0'=k_1^post_32, min^0'=min^post_32, nodecount^0'=nodecount^post_32, sourceflag^0'=sourceflag^post_32, [ 1+k_1^0<=edgecount^0 && h^post_32==0 && ___lengthofvisited^0==___lengthofvisited^post_32 && destflag^0==destflag^post_32 && edgecount^0==edgecount^post_32 && i^0==i^post_32 && j^0==j^post_32 && k^0==k^post_32 && k_1^0==k_1^post_32 && min^0==min^post_32 && nodecount^0==nodecount^post_32 && sourceflag^0==sourceflag^post_32 ], cost: 1 19: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_20, destflag^0'=destflag^post_20, edgecount^0'=edgecount^post_20, h^0'=h^post_20, i^0'=i^post_20, j^0'=j^post_20, k^0'=k^post_20, k_1^0'=k_1^post_20, min^0'=min^post_20, nodecount^0'=nodecount^post_20, sourceflag^0'=sourceflag^post_20, [ ___lengthofvisited^0==___lengthofvisited^post_20 && destflag^0==destflag^post_20 && edgecount^0==edgecount^post_20 && h^0==h^post_20 && i^0==i^post_20 && j^0==j^post_20 && k^0==k^post_20 && k_1^0==k_1^post_20 && min^0==min^post_20 && nodecount^0==nodecount^post_20 && sourceflag^0==sourceflag^post_20 ], cost: 1 20: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_21, destflag^0'=destflag^post_21, edgecount^0'=edgecount^post_21, h^0'=h^post_21, i^0'=i^post_21, j^0'=j^post_21, k^0'=k^post_21, k_1^0'=k_1^post_21, min^0'=min^post_21, nodecount^0'=nodecount^post_21, sourceflag^0'=sourceflag^post_21, [ sourceflag^post_21==1 && ___lengthofvisited^0==___lengthofvisited^post_21 && destflag^0==destflag^post_21 && edgecount^0==edgecount^post_21 && h^0==h^post_21 && i^0==i^post_21 && j^0==j^post_21 && k^0==k^post_21 && k_1^0==k_1^post_21 && min^0==min^post_21 && nodecount^0==nodecount^post_21 ], cost: 1 21: l19 -> l16 : ___lengthofvisited^0'=___lengthofvisited^post_22, destflag^0'=destflag^post_22, edgecount^0'=edgecount^post_22, h^0'=h^post_22, i^0'=i^post_22, j^0'=j^post_22, k^0'=k^post_22, k_1^0'=k_1^post_22, min^0'=min^post_22, nodecount^0'=nodecount^post_22, sourceflag^0'=sourceflag^post_22, [ ___lengthofvisited^0==___lengthofvisited^post_22 && destflag^0==destflag^post_22 && edgecount^0==edgecount^post_22 && h^0==h^post_22 && i^0==i^post_22 && j^0==j^post_22 && k^0==k^post_22 && k_1^0==k_1^post_22 && min^0==min^post_22 && nodecount^0==nodecount^post_22 && sourceflag^0==sourceflag^post_22 ], cost: 1 22: l20 -> l13 : ___lengthofvisited^0'=___lengthofvisited^post_23, destflag^0'=destflag^post_23, edgecount^0'=edgecount^post_23, h^0'=h^post_23, i^0'=i^post_23, j^0'=j^post_23, k^0'=k^post_23, k_1^0'=k_1^post_23, min^0'=min^post_23, nodecount^0'=nodecount^post_23, sourceflag^0'=sourceflag^post_23, [ nodecount^0<=j^0 && destflag^post_23==1 && j^post_23==0 && ___lengthofvisited^0==___lengthofvisited^post_23 && edgecount^0==edgecount^post_23 && h^0==h^post_23 && i^0==i^post_23 && k^0==k^post_23 && k_1^0==k_1^post_23 && min^0==min^post_23 && nodecount^0==nodecount^post_23 && sourceflag^0==sourceflag^post_23 ], cost: 1 23: l20 -> l19 : ___lengthofvisited^0'=___lengthofvisited^post_24, destflag^0'=destflag^post_24, edgecount^0'=edgecount^post_24, h^0'=h^post_24, i^0'=i^post_24, j^0'=j^post_24, k^0'=k^post_24, k_1^0'=k_1^post_24, min^0'=min^post_24, nodecount^0'=nodecount^post_24, sourceflag^0'=sourceflag^post_24, [ 1+j^0<=nodecount^0 && ___lengthofvisited^0==___lengthofvisited^post_24 && destflag^0==destflag^post_24 && edgecount^0==edgecount^post_24 && h^0==h^post_24 && i^0==i^post_24 && j^0==j^post_24 && k^0==k^post_24 && k_1^0==k_1^post_24 && min^0==min^post_24 && nodecount^0==nodecount^post_24 && sourceflag^0==sourceflag^post_24 ], cost: 1 24: l21 -> l22 : ___lengthofvisited^0'=___lengthofvisited^post_25, destflag^0'=destflag^post_25, edgecount^0'=edgecount^post_25, h^0'=h^post_25, i^0'=i^post_25, j^0'=j^post_25, k^0'=k^post_25, k_1^0'=k_1^post_25, min^0'=min^post_25, nodecount^0'=nodecount^post_25, sourceflag^0'=sourceflag^post_25, [ h^post_25==1+h^0 && ___lengthofvisited^0==___lengthofvisited^post_25 && destflag^0==destflag^post_25 && edgecount^0==edgecount^post_25 && i^0==i^post_25 && j^0==j^post_25 && k^0==k^post_25 && k_1^0==k_1^post_25 && min^0==min^post_25 && nodecount^0==nodecount^post_25 && sourceflag^0==sourceflag^post_25 ], cost: 1 27: l22 -> l24 : ___lengthofvisited^0'=___lengthofvisited^post_28, destflag^0'=destflag^post_28, edgecount^0'=edgecount^post_28, h^0'=h^post_28, i^0'=i^post_28, j^0'=j^post_28, k^0'=k^post_28, k_1^0'=k_1^post_28, min^0'=min^post_28, nodecount^0'=nodecount^post_28, sourceflag^0'=sourceflag^post_28, [ ___lengthofvisited^0==___lengthofvisited^post_28 && destflag^0==destflag^post_28 && edgecount^0==edgecount^post_28 && h^0==h^post_28 && i^0==i^post_28 && j^0==j^post_28 && k^0==k^post_28 && k_1^0==k_1^post_28 && min^0==min^post_28 && nodecount^0==nodecount^post_28 && sourceflag^0==sourceflag^post_28 ], cost: 1 25: l23 -> l21 : ___lengthofvisited^0'=___lengthofvisited^post_26, destflag^0'=destflag^post_26, edgecount^0'=edgecount^post_26, h^0'=h^post_26, i^0'=i^post_26, j^0'=j^post_26, k^0'=k^post_26, k_1^0'=k_1^post_26, min^0'=min^post_26, nodecount^0'=nodecount^post_26, sourceflag^0'=sourceflag^post_26, [ min^post_26==h^0 && ___lengthofvisited^0==___lengthofvisited^post_26 && destflag^0==destflag^post_26 && edgecount^0==edgecount^post_26 && h^0==h^post_26 && i^0==i^post_26 && j^0==j^post_26 && k^0==k^post_26 && k_1^0==k_1^post_26 && nodecount^0==nodecount^post_26 && sourceflag^0==sourceflag^post_26 ], cost: 1 26: l23 -> l21 : ___lengthofvisited^0'=___lengthofvisited^post_27, destflag^0'=destflag^post_27, edgecount^0'=edgecount^post_27, h^0'=h^post_27, i^0'=i^post_27, j^0'=j^post_27, k^0'=k^post_27, k_1^0'=k_1^post_27, min^0'=min^post_27, nodecount^0'=nodecount^post_27, sourceflag^0'=sourceflag^post_27, [ ___lengthofvisited^0==___lengthofvisited^post_27 && destflag^0==destflag^post_27 && edgecount^0==edgecount^post_27 && h^0==h^post_27 && i^0==i^post_27 && j^0==j^post_27 && k^0==k^post_27 && k_1^0==k_1^post_27 && min^0==min^post_27 && nodecount^0==nodecount^post_27 && sourceflag^0==sourceflag^post_27 ], cost: 1 28: l24 -> l17 : ___lengthofvisited^0'=___lengthofvisited^post_29, destflag^0'=destflag^post_29, edgecount^0'=edgecount^post_29, h^0'=h^post_29, i^0'=i^post_29, j^0'=j^post_29, k^0'=k^post_29, k_1^0'=k_1^post_29, min^0'=min^post_29, nodecount^0'=nodecount^post_29, sourceflag^0'=sourceflag^post_29, [ edgecount^0<=h^0 && sourceflag^post_29==0 && j^post_29==0 && ___lengthofvisited^0==___lengthofvisited^post_29 && destflag^0==destflag^post_29 && edgecount^0==edgecount^post_29 && h^0==h^post_29 && i^0==i^post_29 && k^0==k^post_29 && k_1^0==k_1^post_29 && min^0==min^post_29 && nodecount^0==nodecount^post_29 ], cost: 1 29: l24 -> l23 : ___lengthofvisited^0'=___lengthofvisited^post_30, destflag^0'=destflag^post_30, edgecount^0'=edgecount^post_30, h^0'=h^post_30, i^0'=i^post_30, j^0'=j^post_30, k^0'=k^post_30, k_1^0'=k_1^post_30, min^0'=min^post_30, nodecount^0'=nodecount^post_30, sourceflag^0'=sourceflag^post_30, [ 1+h^0<=edgecount^0 && ___lengthofvisited^0==___lengthofvisited^post_30 && destflag^0==destflag^post_30 && edgecount^0==edgecount^post_30 && h^0==h^post_30 && i^0==i^post_30 && j^0==j^post_30 && k^0==k^post_30 && k_1^0==k_1^post_30 && min^0==min^post_30 && nodecount^0==nodecount^post_30 && sourceflag^0==sourceflag^post_30 ], cost: 1 35: l25 -> l10 : ___lengthofvisited^0'=___lengthofvisited^post_36, destflag^0'=destflag^post_36, edgecount^0'=edgecount^post_36, h^0'=h^post_36, i^0'=i^post_36, j^0'=j^post_36, k^0'=k^post_36, k_1^0'=k_1^post_36, min^0'=min^post_36, nodecount^0'=nodecount^post_36, sourceflag^0'=sourceflag^post_36, [ min^post_36==0 && i^post_36==0 && ___lengthofvisited^0==___lengthofvisited^post_36 && destflag^0==destflag^post_36 && edgecount^0==edgecount^post_36 && h^0==h^post_36 && j^0==j^post_36 && k^0==k^post_36 && k_1^0==k_1^post_36 && nodecount^0==nodecount^post_36 && sourceflag^0==sourceflag^post_36 ], cost: 1 44: l27 -> l0 : ___lengthofvisited^0'=___lengthofvisited^post_45, destflag^0'=destflag^post_45, edgecount^0'=edgecount^post_45, h^0'=h^post_45, i^0'=i^post_45, j^0'=j^post_45, k^0'=k^post_45, k_1^0'=k_1^post_45, min^0'=min^post_45, nodecount^0'=nodecount^post_45, sourceflag^0'=sourceflag^post_45, [ ___lengthofvisited^post_45==edgecount^0 && i^post_45==1 && destflag^0==destflag^post_45 && edgecount^0==edgecount^post_45 && h^0==h^post_45 && j^0==j^post_45 && k^0==k^post_45 && k_1^0==k_1^post_45 && min^0==min^post_45 && nodecount^0==nodecount^post_45 && sourceflag^0==sourceflag^post_45 ], cost: 1 45: l28 -> l27 : ___lengthofvisited^0'=___lengthofvisited^post_46, destflag^0'=destflag^post_46, edgecount^0'=edgecount^post_46, h^0'=h^post_46, i^0'=i^post_46, j^0'=j^post_46, k^0'=k^post_46, k_1^0'=k_1^post_46, min^0'=min^post_46, nodecount^0'=nodecount^post_46, sourceflag^0'=sourceflag^post_46, [ ___lengthofvisited^0==___lengthofvisited^post_46 && destflag^0==destflag^post_46 && edgecount^0==edgecount^post_46 && h^0==h^post_46 && i^0==i^post_46 && j^0==j^post_46 && k^0==k^post_46 && k_1^0==k_1^post_46 && min^0==min^post_46 && nodecount^0==nodecount^post_46 && sourceflag^0==sourceflag^post_46 ], cost: 1 Simplified all rules, resulting in: Start location: l28 0: l0 -> l1 : [], cost: 1 42: l1 -> l2 : i^0'=0, [ nodecount^0<=i^0 ], cost: 1 43: l1 -> l0 : i^0'=1+i^0, [ 1+i^0<=nodecount^0 ], cost: 1 1: l2 -> l3 : [], cost: 1 39: l3 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 1 40: l3 -> l2 : i^0'=1+i^0, [ 1+i^0<=-1+nodecount^0 ], cost: 1 2: l4 -> l5 : [], cost: 1 37: l5 -> l25 : [ nodecount^0<=k^0 ], cost: 1 38: l5 -> l25 : [ 1+k^0<=-1+nodecount^0 ], cost: 1 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 18: l7 -> l18 : [], cost: 1 4: l8 -> l6 : [ 1<=destflag^0 ], cost: 1 5: l8 -> l6 : [ 1+destflag^0<=0 ], cost: 1 6: l8 -> l6 : [ destflag^0==0 ], cost: 1 7: l9 -> l6 : [ 1<=sourceflag^0 ], cost: 1 8: l9 -> l6 : [ 1+sourceflag^0<=0 ], cost: 1 9: l9 -> l8 : [ sourceflag^0==0 ], cost: 1 10: l10 -> l11 : [], cost: 1 32: l11 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 1 33: l11 -> l10 : i^0'=1+i^0, [ 1+i^0<=edgecount^0 ], cost: 1 11: l12 -> l13 : j^0'=1+j^0, [], cost: 1 41: l13 -> l15 : [], cost: 1 13: l14 -> l12 : destflag^0'=0, [], cost: 1 14: l14 -> l12 : [], cost: 1 15: l15 -> l9 : [ nodecount^0<=j^0 ], cost: 1 16: l15 -> l14 : [ 1+j^0<=nodecount^0 ], cost: 1 17: l16 -> l17 : j^0'=1+j^0, [], cost: 1 34: l17 -> l20 : [], cost: 1 30: l18 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 1 31: l18 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 1 20: l19 -> l16 : sourceflag^0'=1, [], cost: 1 21: l19 -> l16 : [], cost: 1 22: l20 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 1 23: l20 -> l19 : [ 1+j^0<=nodecount^0 ], cost: 1 24: l21 -> l22 : h^0'=1+h^0, [], cost: 1 27: l22 -> l24 : [], cost: 1 25: l23 -> l21 : min^0'=h^0, [], cost: 1 26: l23 -> l21 : [], cost: 1 28: l24 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 1 29: l24 -> l23 : [ 1+h^0<=edgecount^0 ], cost: 1 35: l25 -> l10 : i^0'=0, min^0'=0, [], cost: 1 44: l27 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=1, [], cost: 1 45: l28 -> l27 : [], cost: 1 ### Simplification by acceleration and chaining ### Eliminated locations (on linear paths): Start location: l28 0: l0 -> l1 : [], cost: 1 42: l1 -> l2 : i^0'=0, [ nodecount^0<=i^0 ], cost: 1 43: l1 -> l0 : i^0'=1+i^0, [ 1+i^0<=nodecount^0 ], cost: 1 1: l2 -> l3 : [], cost: 1 39: l3 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 1 40: l3 -> l2 : i^0'=1+i^0, [ 1+i^0<=-1+nodecount^0 ], cost: 1 2: l4 -> l5 : [], cost: 1 37: l5 -> l25 : [ nodecount^0<=k^0 ], cost: 1 38: l5 -> l25 : [ 1+k^0<=-1+nodecount^0 ], cost: 1 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 18: l7 -> l18 : [], cost: 1 4: l8 -> l6 : [ 1<=destflag^0 ], cost: 1 5: l8 -> l6 : [ 1+destflag^0<=0 ], cost: 1 6: l8 -> l6 : [ destflag^0==0 ], cost: 1 7: l9 -> l6 : [ 1<=sourceflag^0 ], cost: 1 8: l9 -> l6 : [ 1+sourceflag^0<=0 ], cost: 1 9: l9 -> l8 : [ sourceflag^0==0 ], cost: 1 10: l10 -> l11 : [], cost: 1 32: l11 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 1 33: l11 -> l10 : i^0'=1+i^0, [ 1+i^0<=edgecount^0 ], cost: 1 11: l12 -> l13 : j^0'=1+j^0, [], cost: 1 41: l13 -> l15 : [], cost: 1 13: l14 -> l12 : destflag^0'=0, [], cost: 1 14: l14 -> l12 : [], cost: 1 15: l15 -> l9 : [ nodecount^0<=j^0 ], cost: 1 16: l15 -> l14 : [ 1+j^0<=nodecount^0 ], cost: 1 17: l16 -> l17 : j^0'=1+j^0, [], cost: 1 34: l17 -> l20 : [], cost: 1 30: l18 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 1 31: l18 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 1 20: l19 -> l16 : sourceflag^0'=1, [], cost: 1 21: l19 -> l16 : [], cost: 1 22: l20 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 1 23: l20 -> l19 : [ 1+j^0<=nodecount^0 ], cost: 1 24: l21 -> l22 : h^0'=1+h^0, [], cost: 1 27: l22 -> l24 : [], cost: 1 25: l23 -> l21 : min^0'=h^0, [], cost: 1 26: l23 -> l21 : [], cost: 1 28: l24 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 1 29: l24 -> l23 : [ 1+h^0<=edgecount^0 ], cost: 1 35: l25 -> l10 : i^0'=0, min^0'=0, [], cost: 1 46: l28 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=1, [], cost: 2 Eliminated locations (on tree-shaped paths): Start location: l28 47: l0 -> l2 : i^0'=0, [ nodecount^0<=i^0 ], cost: 2 48: l0 -> l0 : i^0'=1+i^0, [ 1+i^0<=nodecount^0 ], cost: 2 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 50: l2 -> l2 : i^0'=1+i^0, [ 1+i^0<=-1+nodecount^0 ], cost: 2 51: l4 -> l25 : [ nodecount^0<=k^0 ], cost: 2 52: l4 -> l25 : [ 1+k^0<=-1+nodecount^0 ], cost: 2 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 7: l9 -> l6 : [ 1<=sourceflag^0 ], cost: 1 8: l9 -> l6 : [ 1+sourceflag^0<=0 ], cost: 1 63: l9 -> l6 : [ sourceflag^0==0 && 1<=destflag^0 ], cost: 2 64: l9 -> l6 : [ sourceflag^0==0 && 1+destflag^0<=0 ], cost: 2 65: l9 -> l6 : [ sourceflag^0==0 && destflag^0==0 ], cost: 2 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 54: l10 -> l10 : i^0'=1+i^0, [ 1+i^0<=edgecount^0 ], cost: 2 61: l13 -> l9 : [ nodecount^0<=j^0 ], cost: 2 62: l13 -> l14 : [ 1+j^0<=nodecount^0 ], cost: 2 66: l14 -> l13 : destflag^0'=0, j^0'=1+j^0, [], cost: 2 67: l14 -> l13 : j^0'=1+j^0, [], cost: 2 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 60: l17 -> l19 : [ 1+j^0<=nodecount^0 ], cost: 2 68: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, [], cost: 2 69: l19 -> l17 : j^0'=1+j^0, [], cost: 2 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 58: l22 -> l23 : [ 1+h^0<=edgecount^0 ], cost: 2 70: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, [], cost: 2 71: l23 -> l22 : h^0'=1+h^0, [], cost: 2 35: l25 -> l10 : i^0'=0, min^0'=0, [], cost: 1 46: l28 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=1, [], cost: 2 Accelerating simple loops of location 0. Accelerating the following rules: 48: l0 -> l0 : i^0'=1+i^0, [ 1+i^0<=nodecount^0 ], cost: 2 Accelerated rule 48 with backward acceleration, yielding the new rule 72. [accelerate] Nesting with 1 inner and 1 outer candidates Removing the simple loops: 48. Accelerating simple loops of location 2. Accelerating the following rules: 50: l2 -> l2 : i^0'=1+i^0, [ 1+i^0<=-1+nodecount^0 ], cost: 2 Accelerated rule 50 with backward acceleration, yielding the new rule 73. [accelerate] Nesting with 1 inner and 1 outer candidates Removing the simple loops: 50. Accelerating simple loops of location 10. Accelerating the following rules: 54: l10 -> l10 : i^0'=1+i^0, [ 1+i^0<=edgecount^0 ], cost: 2 Accelerated rule 54 with backward acceleration, yielding the new rule 74. [accelerate] Nesting with 1 inner and 1 outer candidates Removing the simple loops: 54. Accelerated all simple loops using metering functions (where possible): Start location: l28 47: l0 -> l2 : i^0'=0, [ nodecount^0<=i^0 ], cost: 2 72: l0 -> l0 : i^0'=nodecount^0, [ -i^0+nodecount^0>=0 ], cost: -2*i^0+2*nodecount^0 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 73: l2 -> l2 : i^0'=-1+nodecount^0, [ -1-i^0+nodecount^0>=0 ], cost: -2-2*i^0+2*nodecount^0 51: l4 -> l25 : [ nodecount^0<=k^0 ], cost: 2 52: l4 -> l25 : [ 1+k^0<=-1+nodecount^0 ], cost: 2 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 7: l9 -> l6 : [ 1<=sourceflag^0 ], cost: 1 8: l9 -> l6 : [ 1+sourceflag^0<=0 ], cost: 1 63: l9 -> l6 : [ sourceflag^0==0 && 1<=destflag^0 ], cost: 2 64: l9 -> l6 : [ sourceflag^0==0 && 1+destflag^0<=0 ], cost: 2 65: l9 -> l6 : [ sourceflag^0==0 && destflag^0==0 ], cost: 2 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 74: l10 -> l10 : i^0'=edgecount^0, [ -i^0+edgecount^0>=0 ], cost: -2*i^0+2*edgecount^0 61: l13 -> l9 : [ nodecount^0<=j^0 ], cost: 2 62: l13 -> l14 : [ 1+j^0<=nodecount^0 ], cost: 2 66: l14 -> l13 : destflag^0'=0, j^0'=1+j^0, [], cost: 2 67: l14 -> l13 : j^0'=1+j^0, [], cost: 2 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 60: l17 -> l19 : [ 1+j^0<=nodecount^0 ], cost: 2 68: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, [], cost: 2 69: l19 -> l17 : j^0'=1+j^0, [], cost: 2 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 58: l22 -> l23 : [ 1+h^0<=edgecount^0 ], cost: 2 70: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, [], cost: 2 71: l23 -> l22 : h^0'=1+h^0, [], cost: 2 35: l25 -> l10 : i^0'=0, min^0'=0, [], cost: 1 46: l28 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=1, [], cost: 2 Chained accelerated rules (with incoming rules): Start location: l28 47: l0 -> l2 : i^0'=0, [ nodecount^0<=i^0 ], cost: 2 76: l0 -> l2 : i^0'=-1+nodecount^0, [ nodecount^0<=i^0 && -1+nodecount^0>=0 ], cost: 2*nodecount^0 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 51: l4 -> l25 : [ nodecount^0<=k^0 ], cost: 2 52: l4 -> l25 : [ 1+k^0<=-1+nodecount^0 ], cost: 2 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 7: l9 -> l6 : [ 1<=sourceflag^0 ], cost: 1 8: l9 -> l6 : [ 1+sourceflag^0<=0 ], cost: 1 63: l9 -> l6 : [ sourceflag^0==0 && 1<=destflag^0 ], cost: 2 64: l9 -> l6 : [ sourceflag^0==0 && 1+destflag^0<=0 ], cost: 2 65: l9 -> l6 : [ sourceflag^0==0 && destflag^0==0 ], cost: 2 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 61: l13 -> l9 : [ nodecount^0<=j^0 ], cost: 2 62: l13 -> l14 : [ 1+j^0<=nodecount^0 ], cost: 2 66: l14 -> l13 : destflag^0'=0, j^0'=1+j^0, [], cost: 2 67: l14 -> l13 : j^0'=1+j^0, [], cost: 2 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 60: l17 -> l19 : [ 1+j^0<=nodecount^0 ], cost: 2 68: l19 -> l17 : j^0'=1+j^0, sourceflag^0'=1, [], cost: 2 69: l19 -> l17 : j^0'=1+j^0, [], cost: 2 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 58: l22 -> l23 : [ 1+h^0<=edgecount^0 ], cost: 2 70: l23 -> l22 : h^0'=1+h^0, min^0'=h^0, [], cost: 2 71: l23 -> l22 : h^0'=1+h^0, [], cost: 2 35: l25 -> l10 : i^0'=0, min^0'=0, [], cost: 1 77: l25 -> l10 : i^0'=edgecount^0, min^0'=0, [ edgecount^0>=0 ], cost: 1+2*edgecount^0 46: l28 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=1, [], cost: 2 75: l28 -> l0 : ___lengthofvisited^0'=edgecount^0, i^0'=nodecount^0, [ -1+nodecount^0>=0 ], cost: 2*nodecount^0 Eliminated locations (on tree-shaped paths): Start location: l28 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 82: l4 -> l10 : i^0'=0, min^0'=0, [ nodecount^0<=k^0 ], cost: 3 83: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 84: l4 -> l10 : i^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 ], cost: 3 85: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 90: l13 -> l6 : [ nodecount^0<=j^0 && 1<=sourceflag^0 ], cost: 3 91: l13 -> l6 : [ nodecount^0<=j^0 && 1+sourceflag^0<=0 ], cost: 3 92: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1<=destflag^0 ], cost: 4 93: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1+destflag^0<=0 ], cost: 4 94: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && destflag^0==0 ], cost: 4 95: l13 -> l13 : destflag^0'=0, j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 96: l13 -> l13 : j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 88: l17 -> l17 : j^0'=1+j^0, sourceflag^0'=1, [ 1+j^0<=nodecount^0 ], cost: 4 89: l17 -> l17 : j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 86: l22 -> l22 : h^0'=1+h^0, min^0'=h^0, [ 1+h^0<=edgecount^0 ], cost: 4 87: l22 -> l22 : h^0'=1+h^0, [ 1+h^0<=edgecount^0 ], cost: 4 78: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ nodecount^0<=1 ], cost: 4 79: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 80: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 81: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ -1+nodecount^0>=0 ], cost: 4*nodecount^0 Accelerating simple loops of location 13. Accelerating the following rules: 95: l13 -> l13 : destflag^0'=0, j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 96: l13 -> l13 : j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 Accelerated rule 95 with backward acceleration, yielding the new rule 97. Accelerated rule 96 with backward acceleration, yielding the new rule 98. [accelerate] Nesting with 2 inner and 2 outer candidates Removing the simple loops: 95 96. Accelerating simple loops of location 17. Accelerating the following rules: 88: l17 -> l17 : j^0'=1+j^0, sourceflag^0'=1, [ 1+j^0<=nodecount^0 ], cost: 4 89: l17 -> l17 : j^0'=1+j^0, [ 1+j^0<=nodecount^0 ], cost: 4 Accelerated rule 88 with backward acceleration, yielding the new rule 99. Accelerated rule 89 with backward acceleration, yielding the new rule 100. [accelerate] Nesting with 2 inner and 2 outer candidates Removing the simple loops: 88 89. Accelerating simple loops of location 22. Accelerating the following rules: 86: l22 -> l22 : h^0'=1+h^0, min^0'=h^0, [ 1+h^0<=edgecount^0 ], cost: 4 87: l22 -> l22 : h^0'=1+h^0, [ 1+h^0<=edgecount^0 ], cost: 4 Accelerated rule 86 with backward acceleration, yielding the new rule 101. Accelerated rule 87 with backward acceleration, yielding the new rule 102. [accelerate] Nesting with 2 inner and 2 outer candidates Removing the simple loops: 86 87. Accelerated all simple loops using metering functions (where possible): Start location: l28 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 82: l4 -> l10 : i^0'=0, min^0'=0, [ nodecount^0<=k^0 ], cost: 3 83: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 84: l4 -> l10 : i^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 ], cost: 3 85: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 90: l13 -> l6 : [ nodecount^0<=j^0 && 1<=sourceflag^0 ], cost: 3 91: l13 -> l6 : [ nodecount^0<=j^0 && 1+sourceflag^0<=0 ], cost: 3 92: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1<=destflag^0 ], cost: 4 93: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1+destflag^0<=0 ], cost: 4 94: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && destflag^0==0 ], cost: 4 97: l13 -> l13 : destflag^0'=0, j^0'=nodecount^0, [ -j^0+nodecount^0>=1 ], cost: -4*j^0+4*nodecount^0 98: l13 -> l13 : j^0'=nodecount^0, [ -j^0+nodecount^0>=0 ], cost: -4*j^0+4*nodecount^0 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 99: l17 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, [ -j^0+nodecount^0>=1 ], cost: -4*j^0+4*nodecount^0 100: l17 -> l17 : j^0'=nodecount^0, [ -j^0+nodecount^0>=0 ], cost: -4*j^0+4*nodecount^0 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 101: l22 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, [ edgecount^0-h^0>=1 ], cost: 4*edgecount^0-4*h^0 102: l22 -> l22 : h^0'=edgecount^0, [ edgecount^0-h^0>=0 ], cost: 4*edgecount^0-4*h^0 78: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ nodecount^0<=1 ], cost: 4 79: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 80: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 81: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ -1+nodecount^0>=0 ], cost: 4*nodecount^0 Chained accelerated rules (with incoming rules): Start location: l28 49: l2 -> l4 : k^0'=0, [ -1+nodecount^0<=i^0 ], cost: 2 82: l4 -> l10 : i^0'=0, min^0'=0, [ nodecount^0<=k^0 ], cost: 3 83: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 84: l4 -> l10 : i^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 ], cost: 3 85: l4 -> l10 : i^0'=edgecount^0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 3+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 56: l7 -> l22 : h^0'=0, [ 1+k_1^0<=edgecount^0 ], cost: 2 107: l7 -> l22 : h^0'=edgecount^0, min^0'=-1+edgecount^0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 2+4*edgecount^0 108: l7 -> l22 : h^0'=edgecount^0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 2+4*edgecount^0 53: l10 -> l7 : k_1^0'=0, [ edgecount^0<=i^0 ], cost: 2 90: l13 -> l6 : [ nodecount^0<=j^0 && 1<=sourceflag^0 ], cost: 3 91: l13 -> l6 : [ nodecount^0<=j^0 && 1+sourceflag^0<=0 ], cost: 3 92: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1<=destflag^0 ], cost: 4 93: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && 1+destflag^0<=0 ], cost: 4 94: l13 -> l6 : [ nodecount^0<=j^0 && sourceflag^0==0 && destflag^0==0 ], cost: 4 59: l17 -> l13 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 ], cost: 2 103: l17 -> l13 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 ], cost: 2+4*nodecount^0 104: l17 -> l13 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 ], cost: 2+4*nodecount^0 57: l22 -> l17 : j^0'=0, sourceflag^0'=0, [ edgecount^0<=h^0 ], cost: 2 105: l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=1, [ edgecount^0<=h^0 && nodecount^0>=1 ], cost: 2+4*nodecount^0 106: l22 -> l17 : j^0'=nodecount^0, sourceflag^0'=0, [ edgecount^0<=h^0 && nodecount^0>=0 ], cost: 2+4*nodecount^0 78: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ nodecount^0<=1 ], cost: 4 79: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 80: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=0, [ -1+nodecount^0>=0 ], cost: 2+2*nodecount^0 81: l28 -> l2 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, [ -1+nodecount^0>=0 ], cost: 4*nodecount^0 Eliminated locations (on tree-shaped paths): Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 117: l7 -> l17 : h^0'=0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 ], cost: 4 118: l7 -> l17 : h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 119: l7 -> l17 : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 120: l7 -> l17 : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 121: l7 -> l17 : h^0'=edgecount^0, j^0'=nodecount^0, min^0'=-1+edgecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0>=1 ], cost: 4+4*edgecount^0+4*nodecount^0 122: l7 -> l17 : h^0'=edgecount^0, j^0'=nodecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 123: l7 -> l17 : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 124: l7 -> l17 : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 4+4*edgecount^0+4*nodecount^0 125: l7 -> l17 : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 126: l17 -> l6 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 && nodecount^0<=0 && 1<=sourceflag^0 ], cost: 5 127: l17 -> l6 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 && nodecount^0<=0 && 1+sourceflag^0<=0 ], cost: 5 128: l17 -> l6 : destflag^0'=1, j^0'=0, [ nodecount^0<=j^0 && nodecount^0<=0 && sourceflag^0==0 ], cost: 6 129: l17 -> l6 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 && 1<=sourceflag^0 ], cost: 5+4*nodecount^0 130: l17 -> l6 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 && 1+sourceflag^0<=0 ], cost: 5+4*nodecount^0 131: l17 -> l6 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 && sourceflag^0==0 ], cost: 6+4*nodecount^0 132: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && 1<=sourceflag^0 ], cost: 5+4*nodecount^0 133: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && 1+sourceflag^0<=0 ], cost: 5+4*nodecount^0 134: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && sourceflag^0==0 ], cost: 6+4*nodecount^0 135: l17 -> [35] : [ nodecount^0<=j^0 && nodecount^0>=1 ], cost: 2+4*nodecount^0 136: l17 -> [35] : [ nodecount^0<=j^0 && nodecount^0>=0 ], cost: 2+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: 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 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 118: l7 -> l17 : h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 119: l7 -> l17 : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 120: l7 -> l17 : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 123: l7 -> l17 : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 125: l7 -> l17 : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 129: l17 -> l6 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 && 1<=sourceflag^0 ], cost: 5+4*nodecount^0 130: l17 -> l6 : destflag^0'=0, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=1 && 1+sourceflag^0<=0 ], cost: 5+4*nodecount^0 132: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && 1<=sourceflag^0 ], cost: 5+4*nodecount^0 133: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && 1+sourceflag^0<=0 ], cost: 5+4*nodecount^0 134: l17 -> l6 : destflag^0'=1, j^0'=nodecount^0, [ nodecount^0<=j^0 && nodecount^0>=0 && sourceflag^0==0 ], cost: 6+4*nodecount^0 135: l17 -> [35] : [ nodecount^0<=j^0 && nodecount^0>=1 ], cost: 2+4*nodecount^0 136: l17 -> [35] : [ nodecount^0<=j^0 && nodecount^0>=0 ], cost: 2+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Eliminated locations (on tree-shaped paths): Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 137: l7 -> l6 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 138: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 139: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 6+8*nodecount^0 140: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 6+8*nodecount^0 141: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 10+8*nodecount^0 142: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 6+8*nodecount^0 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 144: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 146: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 148: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+8*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Merged rules: Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 137: l7 -> l6 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 138: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 141: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 10+8*nodecount^0 142: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 6+8*nodecount^0 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 144: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 146: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 148: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+8*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 156: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 6+8*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: 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 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 3: l6 -> l7 : k_1^0'=1+k_1^0, [], cost: 1 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 137: l7 -> l6 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 138: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 9+8*nodecount^0 141: l7 -> l6 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 10+8*nodecount^0 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 144: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 146: l7 -> l6 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 10+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Eliminated locations (on tree-shaped paths): Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 157: l7 -> l7 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 10+8*nodecount^0 158: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 10+8*nodecount^0 159: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 11+8*nodecount^0 160: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=1+k_1^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+4*edgecount^0+4*nodecount^0 161: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+4*edgecount^0+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Accelerating simple loops of location 7. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 157: l7 -> l7 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 10+8*nodecount^0 158: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=1, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 10+8*nodecount^0 159: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 11+8*nodecount^0 160: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=1+k_1^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 11+4*edgecount^0+4*nodecount^0 161: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=1+k_1^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0==0 ], cost: 11+4*edgecount^0+4*nodecount^0 Accelerated rule 157 with backward acceleration, yielding the new rule 162. Accelerated rule 158 with backward acceleration, yielding the new rule 163. Accelerated rule 159 with backward acceleration, yielding the new rule 164. Accelerated rule 160 with backward acceleration, yielding the new rule 165. Accelerated rule 161 with backward acceleration, yielding the new rule 166. [accelerate] Nesting with 5 inner and 5 outer candidates Removing the simple loops: 157 158 159 160 161. Accelerated all simple loops using metering functions (where possible): Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 162: l7 -> l7 : destflag^0'=0, h^0'=0, j^0'=nodecount^0, k_1^0'=edgecount^0, sourceflag^0'=1, [ edgecount^0<=0 && nodecount^0>=1 && -k_1^0+edgecount^0>=1 ], cost: -10*k_1^0+10*edgecount^0-8*nodecount^0*(k_1^0-edgecount^0) 163: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=edgecount^0, sourceflag^0'=1, [ edgecount^0<=0 && nodecount^0>=1 && -k_1^0+edgecount^0>=1 ], cost: -10*k_1^0+10*edgecount^0-8*nodecount^0*(k_1^0-edgecount^0) 164: l7 -> l7 : destflag^0'=1, h^0'=0, j^0'=nodecount^0, k_1^0'=edgecount^0, sourceflag^0'=0, [ edgecount^0<=0 && nodecount^0>=0 && -k_1^0+edgecount^0>=1 ], cost: -11*k_1^0+11*edgecount^0-8*nodecount^0*(k_1^0-edgecount^0) 165: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ edgecount^0>=1 && nodecount^0==0 && -k_1^0+edgecount^0>=1 ], cost: -11*k_1^0-4*edgecount^0*(k_1^0-edgecount^0)+11*edgecount^0-4*nodecount^0*(k_1^0-edgecount^0) 166: l7 -> l7 : destflag^0'=1, h^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, sourceflag^0'=0, [ edgecount^0>=0 && nodecount^0==0 && -k_1^0+edgecount^0>=1 ], cost: -11*k_1^0-4*edgecount^0*(k_1^0-edgecount^0)+11*edgecount^0-4*nodecount^0*(k_1^0-edgecount^0) 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Chained accelerated rules (with incoming rules): Start location: l28 113: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 5 114: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 115: l4 -> l7 : i^0'=0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 5 116: l4 -> l7 : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 167: l4 -> l7 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 168: l4 -> l7 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 169: l4 -> l7 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 170: l4 -> l7 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 55: l7 -> l4 : k^0'=1+k^0, [ edgecount^0<=k_1^0 ], cost: 2 143: l7 -> [35] : h^0'=0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 6+8*nodecount^0 145: l7 -> [35] : h^0'=edgecount^0, j^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 147: l7 -> [35] : h^0'=edgecount^0, j^0'=0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+4*nodecount^0 149: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=1 ], cost: 6+4*edgecount^0+8*nodecount^0 150: l7 -> [35] : h^0'=edgecount^0, j^0'=nodecount^0, sourceflag^0'=0, [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 6+4*edgecount^0+8*nodecount^0 151: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=1 ], cost: 4+4*nodecount^0 152: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0<=0 && nodecount^0>=0 ], cost: 4+4*nodecount^0 153: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=1 ], cost: 4+4*edgecount^0 154: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 ], cost: 4+4*edgecount^0 155: l7 -> [36] : [ 1+k_1^0<=edgecount^0 && edgecount^0>=0 && nodecount^0>=0 ], cost: 4+4*edgecount^0+4*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Eliminated locations (on tree-shaped paths): Start location: l28 171: l4 -> l4 : i^0'=0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 7 172: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 && edgecount^0<=0 ], cost: 7+2*edgecount^0 173: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 174: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 175: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=1 ], cost: 11+6*edgecount^0+8*nodecount^0 176: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 177: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 178: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 179: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 180: l4 -> l4 : i^0'=0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 7 181: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 && edgecount^0<=0 ], cost: 7+2*edgecount^0 182: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 183: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 184: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=1 ], cost: 11+6*edgecount^0+8*nodecount^0 185: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 186: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 187: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 188: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 189: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 190: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 191: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 192: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 193: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 194: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 195: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 196: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 197: l4 -> [38] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 198: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Merged rules: Start location: l28 171: l4 -> l4 : i^0'=0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0<=0 ], cost: 7 172: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 && edgecount^0<=0 ], cost: 7+2*edgecount^0 173: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 174: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 175: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=1 ], cost: 11+6*edgecount^0+8*nodecount^0 176: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 179: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 180: l4 -> l4 : i^0'=0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0<=0 ], cost: 7 181: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 && edgecount^0<=0 ], cost: 7+2*edgecount^0 182: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 183: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 184: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=1 ], cost: 11+6*edgecount^0+8*nodecount^0 185: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 188: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 189: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 190: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 191: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 192: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 193: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 194: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 199: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 200: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 201: l4 -> [38] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 202: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: 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 172: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && edgecount^0>=0 && edgecount^0<=0 ], cost: 7+2*edgecount^0 173: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 174: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 176: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 179: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 182: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 183: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 188: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 189: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 190: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 191: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 192: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 193: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 194: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 199: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 200: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 201: l4 -> [38] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 202: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Accelerating simple loops of location 4. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 172: l4 -> l4 : i^0'=edgecount^0, k^0'=1+k^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && -edgecount^0==0 ], cost: 7+2*edgecount^0 189: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 190: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && edgecount^0>=1 && nodecount^0==0 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 191: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 192: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=1+k^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 7+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 Accelerated rule 172 with non-termination, yielding the new rule 203. Accelerated rule 189 with non-termination, yielding the new rule 204. Accelerated rule 190 with backward acceleration, yielding the new rule 205. Accelerated rule 191 with non-termination, yielding the new rule 206. Accelerated rule 192 with backward acceleration, yielding the new rule 207. [accelerate] Nesting with 2 inner and 2 outer candidates Removing the simple loops: 172 189 190 191 192. Accelerated all simple loops using metering functions (where possible): Start location: l28 173: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 174: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 176: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 179: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 182: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 183: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 188: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 193: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 194: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 199: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 200: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 201: l4 -> [38] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 202: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 203: l4 -> [39] : [ nodecount^0<=k^0 && -edgecount^0==0 ], cost: NONTERM 204: l4 -> [39] : [ nodecount^0<=k^0 && edgecount^0>=1 && nodecount^0==0 ], cost: NONTERM 205: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=-1+nodecount^0, k_1^0'=edgecount^0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ edgecount^0>=1 && nodecount^0==0 && -1+nodecount^0-k^0>=1 ], cost: -7+4*(-1+nodecount^0-k^0)*edgecount^0^2+13*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0 206: l4 -> [39] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: NONTERM 207: l4 -> l4 : destflag^0'=1, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=-1+nodecount^0, k_1^0'=edgecount^0, min^0'=0, sourceflag^0'=0, [ nodecount^0==0 && edgecount^0>=1 && -1+nodecount^0-k^0>=1 ], cost: -7+4*(-1+nodecount^0-k^0)*edgecount^0^2+13*(-1+nodecount^0-k^0)*edgecount^0+4*(-1+nodecount^0-k^0)*edgecount^0*nodecount^0+7*nodecount^0-7*k^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Chained accelerated rules (with incoming rules): Start location: l28 173: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 174: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 176: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+8*nodecount^0 179: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 182: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 183: l4 -> [35] : h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0<=0 && nodecount^0>=0 ], cost: 11+6*edgecount^0+4*nodecount^0 188: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 9+6*edgecount^0+4*nodecount^0 193: l4 -> [38] : [ nodecount^0<=k^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 194: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && edgecount^0>=0 ], cost: 5+2*edgecount^0 199: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ nodecount^0<=k^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 200: l4 -> [36] : i^0'=edgecount^0, k_1^0'=0, min^0'=0, [ 1+k^0<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 9+6*edgecount^0 201: l4 -> [38] : [ nodecount^0<=k^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 202: l4 -> [38] : [ 1+k^0<=-1+nodecount^0 && nodecount^0==0 && edgecount^0>=1 ], cost: 5+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 109: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=1 ], cost: 6 110: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 111: 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 112: l28 -> l4 : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 208: l28 -> [39] : [ nodecount^0<=0 && -edgecount^0==0 ], cost: NONTERM 209: l28 -> [39] : [ edgecount^0>=1 && nodecount^0==0 ], cost: NONTERM 210: l28 -> [39] : [ nodecount^0==0 && edgecount^0>=1 ], cost: NONTERM Eliminated locations (on tree-shaped paths): Start location: l28 208: l28 -> [39] : [ nodecount^0<=0 && -edgecount^0==0 ], cost: NONTERM 209: l28 -> [39] : [ edgecount^0>=1 && nodecount^0==0 ], cost: NONTERM 210: l28 -> [39] : [ nodecount^0==0 && edgecount^0>=1 ], cost: NONTERM 211: l28 -> [35] : ___lengthofvisited^0'=edgecount^0, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k^0'=0, k_1^0'=0, min^0'=-1+edgecount^0, sourceflag^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 17+6*edgecount^0+4*nodecount^0 212: l28 -> [35] : ___lengthofvisited^0'=edgecount^0, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 17+6*edgecount^0+4*nodecount^0 213: l28 -> [35] : ___lengthofvisited^0'=edgecount^0, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 17+6*edgecount^0+8*nodecount^0 214: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 15+6*edgecount^0+4*nodecount^0 215: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=0 && edgecount^0>=0 ], cost: 11+2*edgecount^0 216: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 ], cost: 15+6*edgecount^0 217: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0==0 && edgecount^0>=1 ], cost: 11+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 218: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ 1<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 11+6*edgecount^0+8*nodecount^0 219: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ 1<=-1+nodecount^0 && edgecount^0>=0 ], cost: 7+2*edgecount^0+4*nodecount^0 220: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ 1<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 11+6*edgecount^0+4*nodecount^0 221: l28 -> [40] : [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 222: l28 -> [40] : [ -1+nodecount^0>=0 && -1+nodecount^0<=0 ], cost: 4+2*nodecount^0 223: l28 -> [40] : [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: l28 208: l28 -> [39] : [ nodecount^0<=0 && -edgecount^0==0 ], cost: NONTERM 209: l28 -> [39] : [ edgecount^0>=1 && nodecount^0==0 ], cost: NONTERM 210: l28 -> [39] : [ nodecount^0==0 && edgecount^0>=1 ], cost: NONTERM 212: l28 -> [35] : ___lengthofvisited^0'=edgecount^0, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=0, k^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 17+6*edgecount^0+4*nodecount^0 213: l28 -> [35] : ___lengthofvisited^0'=edgecount^0, h^0'=edgecount^0, i^0'=edgecount^0, j^0'=nodecount^0, k^0'=0, k_1^0'=0, min^0'=0, sourceflag^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 && nodecount^0>=0 ], cost: 17+6*edgecount^0+8*nodecount^0 215: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0<=0 && edgecount^0>=0 ], cost: 11+2*edgecount^0 216: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ nodecount^0<=0 && 1<=edgecount^0 ], cost: 15+6*edgecount^0 217: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=0, k^0'=0, [ nodecount^0==0 && edgecount^0>=1 ], cost: 11+4*edgecount^0^2+13*edgecount^0+4*edgecount^0*nodecount^0 218: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ 1<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 11+6*edgecount^0+8*nodecount^0 219: l28 -> [38] : ___lengthofvisited^0'=edgecount^0, i^0'=-1+nodecount^0, k^0'=0, [ 1<=-1+nodecount^0 && edgecount^0>=0 ], cost: 7+2*edgecount^0+4*nodecount^0 220: l28 -> [36] : ___lengthofvisited^0'=edgecount^0, i^0'=edgecount^0, k^0'=0, k_1^0'=0, min^0'=0, [ 1<=-1+nodecount^0 && 1<=edgecount^0 ], cost: 11+6*edgecount^0+4*nodecount^0 221: l28 -> [40] : [ nodecount^0<=1 && -1+nodecount^0>=0 ], cost: 4+2*nodecount^0 222: l28 -> [40] : [ -1+nodecount^0>=0 && -1+nodecount^0<=0 ], cost: 4+2*nodecount^0 223: l28 -> [40] : [ -1+nodecount^0>=0 ], cost: 2+4*nodecount^0 Computing asymptotic complexity for rule 208 Guard is satisfiable, yielding nontermination Resulting cost NONTERM has complexity: Nonterm Found new complexity Nonterm. Obtained the following overall complexity (w.r.t. the length of the input n): Complexity: Nonterm Cpx degree: Nonterm Solved cost: NONTERM Rule cost: NONTERM Rule guard: [ nodecount^0<=0 && -edgecount^0==0 ] NO