14.49/5.35	WORST_CASE(NON_POLY, ?)
14.49/5.36	proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
14.49/5.36	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
14.49/5.36	
14.49/5.36	
14.49/5.36	The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(INF, INF).
14.49/5.36	
14.49/5.36	(0) CpxIntTrs
14.49/5.36	(1) Loat Proof [FINISHED, 3527 ms]
14.49/5.36	(2) BOUNDS(INF, INF)
14.49/5.36	
14.49/5.36	
14.49/5.36	----------------------------------------
14.49/5.36	
14.49/5.36	(0)
14.49/5.36	Obligation:
14.49/5.36	Complexity Int TRS consisting of the following rules:
14.49/5.36	f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(1, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= 1 && A <= 1
14.49/5.36	f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(A, 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: 0 >= A
14.49/5.36	f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(A, 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= 2
14.49/5.36	f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f20(A, B, B + 1, S, T, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= B
14.49/5.36	f20(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f20(A, B, C, S, T, F + 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= F
14.49/5.37	f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f31(A, B, C, D, E, F + 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= F
14.49/5.37	f45(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f45(A, B, C, D, E, F + 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: B >= F
14.49/5.37	f60(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f60(A, B, C, D, E, F + 1, G, H, I, J, K - 1, S, T, U, V, K, Q, R)) :|: J >= F
14.49/5.37	f60(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f13(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + J
14.49/5.37	f45(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f60(A, B, C, D, E, 1, G, H, I, S, B, L, M, N, O, P, T, U)) :|: F >= 1 + B
14.49/5.37	f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(A, B, A, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + B && A >= C && A <= C
14.49/5.37	f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f45(A, B, C, D, E, 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: A >= C + 1 && F >= 1 + B
14.49/5.37	f31(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f45(A, B, C, D, E, 1, S, T, U, J, K, L, M, N, O, P, Q, R)) :|: C >= 1 + A && F >= 1 + B
14.49/5.37	f20(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f31(A, B, C, D, E, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: 0 >= E + 1 && F >= 1 + B
14.49/5.37	f20(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f31(A, B, C, D, E, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: E >= 1 && F >= 1 + B
14.49/5.37	f20(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f31(A, B, C, D, 0, 1, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: F >= 1 + B && E >= 0 && E <= 0
14.49/5.37	f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= 1 + A
14.49/5.37	
14.49/5.37	The start-symbols are:[f2_18]
14.49/5.37	
14.49/5.37	
14.49/5.37	----------------------------------------
14.49/5.37	
14.49/5.37	(1) Loat Proof (FINISHED)
14.49/5.37	
14.49/5.37	
14.49/5.37	### Pre-processing the ITS problem ###
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Initial linear ITS problem
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      0: f2 -> f1 : A'=1, [ A==1 ], cost: 1
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	      3: f13 -> f20 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1
14.49/5.37	
14.49/5.37	     16: f13 -> f1 : [ B>=1+A ], cost: 1
14.49/5.37	
14.49/5.37	      4: f20 -> f20 : D'=free_2, E'=free_3, F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	     13: f20 -> f31 : F'=1, [ 0>=1+E && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     14: f20 -> f31 : F'=1, [ E>=1 && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     15: f20 -> f31 : E'=0, F'=1, [ F>=1+B && E==0 ], cost: 1
14.49/5.37	
14.49/5.37	      5: f31 -> f31 : F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	     10: f31 -> f1 : C'=A, [ F>=1+B && A==C ], cost: 1
14.49/5.37	
14.49/5.37	     11: f31 -> f45 : F'=1, G'=free_14, H'=free_15, Q'=free_16, [ A>=1+C && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     12: f31 -> f45 : F'=1, G'=free_17, H'=free_18, Q'=free_19, [ C>=1+A && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	      6: f45 -> f45 : F'=1+F, G'=free_4, H'=free_5, Q'=free_6, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	      9: f45 -> f60 : F'=1, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	      7: f60 -> f60 : F'=1+F, K'=-1+K, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=K, [ J>=F ], cost: 1
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Removed unreachable and leaf rules:
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	      3: f13 -> f20 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1
14.49/5.37	
14.49/5.37	      4: f20 -> f20 : D'=free_2, E'=free_3, F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	     13: f20 -> f31 : F'=1, [ 0>=1+E && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     14: f20 -> f31 : F'=1, [ E>=1 && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     15: f20 -> f31 : E'=0, F'=1, [ F>=1+B && E==0 ], cost: 1
14.49/5.37	
14.49/5.37	      5: f31 -> f31 : F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	     11: f31 -> f45 : F'=1, G'=free_14, H'=free_15, Q'=free_16, [ A>=1+C && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     12: f31 -> f45 : F'=1, G'=free_17, H'=free_18, Q'=free_19, [ C>=1+A && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	      6: f45 -> f45 : F'=1+F, G'=free_4, H'=free_5, Q'=free_6, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	      9: f45 -> f60 : F'=1, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	      7: f60 -> f60 : F'=1+F, K'=-1+K, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=K, [ J>=F ], cost: 1
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	### Simplification by acceleration and chaining ###
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerating simple loops of location 2.
14.49/5.37	
14.49/5.37	   Accelerating the following rules:
14.49/5.37	
14.49/5.37	      4: f20 -> f20 : D'=free_2, E'=free_3, F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Accelerated rule 4 with metering function 1-F+B, yielding the new rule 17.
14.49/5.37	
14.49/5.37	   Removing the simple loops: 4.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerating simple loops of location 3.
14.49/5.37	
14.49/5.37	   Accelerating the following rules:
14.49/5.37	
14.49/5.37	      5: f31 -> f31 : F'=1+F, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Accelerated rule 5 with metering function 1-F+B, yielding the new rule 18.
14.49/5.37	
14.49/5.37	   Removing the simple loops: 5.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerating simple loops of location 4.
14.49/5.37	
14.49/5.37	   Accelerating the following rules:
14.49/5.37	
14.49/5.37	      6: f45 -> f45 : F'=1+F, G'=free_4, H'=free_5, Q'=free_6, [ B>=F ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Accelerated rule 6 with metering function 1-F+B, yielding the new rule 19.
14.49/5.37	
14.49/5.37	   Removing the simple loops: 6.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerating simple loops of location 5.
14.49/5.37	
14.49/5.37	   Accelerating the following rules:
14.49/5.37	
14.49/5.37	      7: f60 -> f60 : F'=1+F, K'=-1+K, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=K, [ J>=F ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Accelerated rule 7 with metering function 1-F+J, yielding the new rule 20.
14.49/5.37	
14.49/5.37	   Removing the simple loops: 7.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerated all simple loops using metering functions (where possible):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	      3: f13 -> f20 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1
14.49/5.37	
14.49/5.37	     13: f20 -> f31 : F'=1, [ 0>=1+E && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     14: f20 -> f31 : F'=1, [ E>=1 && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     15: f20 -> f31 : E'=0, F'=1, [ F>=1+B && E==0 ], cost: 1
14.49/5.37	
14.49/5.37	     17: f20 -> f20 : D'=free_2, E'=free_3, F'=1+B, [ B>=F ], cost: 1-F+B
14.49/5.37	
14.49/5.37	     11: f31 -> f45 : F'=1, G'=free_14, H'=free_15, Q'=free_16, [ A>=1+C && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     12: f31 -> f45 : F'=1, G'=free_17, H'=free_18, Q'=free_19, [ C>=1+A && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     18: f31 -> f31 : F'=1+B, [ B>=F ], cost: 1-F+B
14.49/5.37	
14.49/5.37	      9: f45 -> f60 : F'=1, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     19: f45 -> f45 : F'=1+B, G'=free_4, H'=free_5, Q'=free_6, [ B>=F ], cost: 1-F+B
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	     20: f60 -> f60 : F'=1+J, K'=-1+F-J+K, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=F-J+K, [ J>=F ], cost: 1-F+J
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Chained accelerated rules (with incoming rules):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	      3: f13 -> f20 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B ], cost: 1
14.49/5.37	
14.49/5.37	     21: f13 -> f20 : C'=1+B, D'=free_2, E'=free_3, F'=1+B, [ A>=B && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	     13: f20 -> f31 : F'=1, [ 0>=1+E && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     14: f20 -> f31 : F'=1, [ E>=1 && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     15: f20 -> f31 : E'=0, F'=1, [ F>=1+B && E==0 ], cost: 1
14.49/5.37	
14.49/5.37	     22: f20 -> f31 : F'=1+B, [ 0>=1+E && F>=1+B && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	     23: f20 -> f31 : F'=1+B, [ E>=1 && F>=1+B && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	     24: f20 -> f31 : E'=0, F'=1+B, [ F>=1+B && E==0 && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	     11: f31 -> f45 : F'=1, G'=free_14, H'=free_15, Q'=free_16, [ A>=1+C && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     12: f31 -> f45 : F'=1, G'=free_17, H'=free_18, Q'=free_19, [ C>=1+A && F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     25: f31 -> f45 : F'=1+B, G'=free_4, H'=free_5, Q'=free_6, [ A>=1+C && F>=1+B && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	     26: f31 -> f45 : F'=1+B, G'=free_4, H'=free_5, Q'=free_6, [ C>=1+A && F>=1+B && B>=1 ], cost: 1+B
14.49/5.37	
14.49/5.37	      9: f45 -> f60 : F'=1, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ F>=1+B ], cost: 1
14.49/5.37	
14.49/5.37	     27: f45 -> f60 : F'=1+free_11, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ F>=1+B && free_11>=1 ], cost: 1+free_11
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Eliminated locations (on tree-shaped paths):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     28: f13 -> f31 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B && 0>=1+free_1 && 1>=1+B ], cost: 2
14.49/5.37	
14.49/5.37	     29: f13 -> f31 : C'=1+B, D'=free, E'=free_1, F'=1, [ A>=B && free_1>=1 && 1>=1+B ], cost: 2
14.49/5.37	
14.49/5.37	     30: f13 -> f31 : C'=1+B, D'=free, E'=0, F'=1, [ A>=B && 1>=1+B && free_1==0 ], cost: 2
14.49/5.37	
14.49/5.37	     31: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1, [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     32: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1, [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     33: f13 -> f31 : C'=1+B, D'=free_2, E'=0, F'=1, [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     34: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1+B, [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     35: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1+B, [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     36: f13 -> f31 : C'=1+B, D'=free_2, E'=0, F'=1+B, [ A>=B && B>=1 && free_3==0 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     37: f31 -> f60 : F'=1, G'=free_14, H'=free_15, Q'=free_16, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && 1>=1+B ], cost: 2
14.49/5.37	
14.49/5.37	     38: f31 -> f60 : F'=1+free_11, G'=free_14, H'=free_15, Q'=free_16, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && 1>=1+B && free_11>=1 ], cost: 2+free_11
14.49/5.37	
14.49/5.37	     39: f31 -> f60 : F'=1, G'=free_17, H'=free_18, Q'=free_19, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && 1>=1+B ], cost: 2
14.49/5.37	
14.49/5.37	     40: f31 -> f60 : F'=1+free_11, G'=free_17, H'=free_18, Q'=free_19, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && 1>=1+B && free_11>=1 ], cost: 2+free_11
14.49/5.37	
14.49/5.37	     41: f31 -> f60 : F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && B>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     42: f31 -> f60 : F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && B>=1 && free_11>=1 ], cost: 2+free_11+B
14.49/5.37	
14.49/5.37	     43: f31 -> f60 : F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && B>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     44: f31 -> f60 : F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && B>=1 && free_11>=1 ], cost: 2+free_11+B
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Applied pruning (of leafs and parallel rules):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     31: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1, [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     32: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1, [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     33: f13 -> f31 : C'=1+B, D'=free_2, E'=0, F'=1, [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     34: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1+B, [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     35: f13 -> f31 : C'=1+B, D'=free_2, E'=free_3, F'=1+B, [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     38: f31 -> f60 : F'=1+free_11, G'=free_14, H'=free_15, Q'=free_16, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && 1>=1+B && free_11>=1 ], cost: 2+free_11
14.49/5.37	
14.49/5.37	     40: f31 -> f60 : F'=1+free_11, G'=free_17, H'=free_18, Q'=free_19, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && 1>=1+B && free_11>=1 ], cost: 2+free_11
14.49/5.37	
14.49/5.37	     42: f31 -> f60 : F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=1+C && F>=1+B && B>=1 && free_11>=1 ], cost: 2+free_11+B
14.49/5.37	
14.49/5.37	     43: f31 -> f60 : F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && B>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     44: f31 -> f60 : F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ C>=1+A && F>=1+B && B>=1 && free_11>=1 ], cost: 2+free_11+B
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Eliminated locations (on tree-shaped paths):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     45: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && 0>=1+free_3 && A>=2+B && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     46: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && 0>=1+free_3 && 1+B>=1+A ], cost: 4+3*B
14.49/5.37	
14.49/5.37	     47: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && 0>=1+free_3 && 1+B>=1+A && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     48: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && free_3>=1 && A>=2+B && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     49: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A ], cost: 4+3*B
14.49/5.37	
14.49/5.37	     50: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     51: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     52: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     53: f13 -> [11] : [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     54: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     55: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Applied pruning (of leafs and parallel rules):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     45: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && 0>=1+free_3 && A>=2+B && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     47: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && 0>=1+free_3 && 1+B>=1+A && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     48: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && free_3>=1 && A>=2+B && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     49: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A ], cost: 4+3*B
14.49/5.37	
14.49/5.37	     50: f13 -> f60 : C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A && free_11>=1 ], cost: 4+free_11+3*B
14.49/5.37	
14.49/5.37	     51: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     52: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     53: f13 -> [11] : [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     54: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     55: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	      8: f60 -> f13 : B'=1+B, [ F>=1+J ], cost: 1
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Eliminated locations (on tree-shaped paths):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     51: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     52: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     53: f13 -> [11] : [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     54: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     55: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     56: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && 0>=1+free_3 && A>=2+B && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     57: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && 0>=1+free_3 && 1+B>=1+A && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     58: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && free_3>=1 && A>=2+B && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     59: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A && 1>=1+free_11 ], cost: 5+3*B
14.49/5.37	
14.49/5.37	     60: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ A>=B && B>=1 && free_3>=1 && 1+B>=1+A && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerating simple loops of location 1.
14.49/5.37	
14.49/5.37	   Simplified some of the simple loops (and removed duplicate rules).
14.49/5.37	
14.49/5.37	   Accelerating the following rules:
14.49/5.37	
14.49/5.37	     56: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && 0>=1+free_3 && A>=2+B && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     57: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && 0>=1+free_3 && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     58: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ B>=1 && free_3>=1 && A>=2+B && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	     59: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=B, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && free_3>=1 && 1>=1+free_11 ], cost: 5+3*B
14.49/5.37	
14.49/5.37	     60: f13 -> f13 : B'=1+B, C'=1+B, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+B, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+B, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && free_3>=1 && free_11>=1 ], cost: 5+free_11+3*B
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Accelerated rule 56 with metering function -1+A-B, yielding the new rule 61.
14.49/5.37	
14.49/5.37	   Accelerated rule 57 with metering function 1+A-B, yielding the new rule 62.
14.49/5.37	
14.49/5.37	   Accelerated rule 58 with metering function -1+A-B, yielding the new rule 63.
14.49/5.37	
14.49/5.37	   Accelerated rule 59 with metering function 1+A-B, yielding the new rule 64.
14.49/5.37	
14.49/5.37	   Accelerated rule 60 with metering function 1+A-B, yielding the new rule 65.
14.49/5.37	
14.49/5.37	   Removing the simple loops: 56 57 58 59 60.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Accelerated all simple loops using metering functions (where possible):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     51: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     52: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     53: f13 -> [11] : [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     54: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     55: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     61: f13 -> f13 : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ B>=1 && 0>=1+free_3 && A>=2+B && free_11>=1 ], cost: -7/2+free_11*(-1+A-B)+7/2*A+3*(-1+A-B)*B+3/2*(-1+A-B)^2-7/2*B
14.49/5.37	
14.49/5.37	     62: f13 -> f13 : B'=1+A, C'=1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+A, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && 0>=1+free_3 && free_11>=1 ], cost: 7/2+free_11*(1+A-B)+3/2*(1+A-B)^2+7/2*A+3*(1+A-B)*B-7/2*B
14.49/5.37	
14.49/5.37	     63: f13 -> f13 : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ B>=1 && free_3>=1 && A>=2+B && free_11>=1 ], cost: -7/2+free_11*(-1+A-B)+7/2*A+3*(-1+A-B)*B+3/2*(-1+A-B)^2-7/2*B
14.49/5.37	
14.49/5.37	     64: f13 -> f13 : B'=1+A, C'=1+A, D'=free_2, E'=free_3, F'=1, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=A, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && free_3>=1 && 1>=1+free_11 ], cost: 7/2+3/2*(1+A-B)^2+7/2*A+3*(1+A-B)*B-7/2*B
14.49/5.37	
14.49/5.37	     65: f13 -> f13 : B'=1+A, C'=1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=1-free_11+A, Q_1'=free_12, R'=free_13, [ -A+B==0 && B>=1 && free_3>=1 && free_11>=1 ], cost: 7/2+free_11*(1+A-B)+3/2*(1+A-B)^2+7/2*A+3*(1+A-B)*B-7/2*B
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Chained accelerated rules (with incoming rules):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	      1: f2 -> f13 : B'=1, [ 0>=A ], cost: 1
14.49/5.37	
14.49/5.37	      2: f2 -> f13 : B'=1, [ A>=2 ], cost: 1
14.49/5.37	
14.49/5.37	     66: f2 -> f13 : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	     67: f2 -> f13 : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	     51: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+B
14.49/5.37	
14.49/5.37	     52: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+B
14.49/5.37	
14.49/5.37	     53: f13 -> [11] : [ A>=B && B>=1 && free_3==0 ], cost: 2+B
14.49/5.37	
14.49/5.37	     54: f13 -> [11] : [ A>=B && B>=1 && 0>=1+free_3 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	     55: f13 -> [11] : [ A>=B && B>=1 && free_3>=1 ], cost: 2+2*B
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Eliminated locations (on tree-shaped paths):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	     68: f2 -> [11] : B'=1, [ A>=2 && 0>=1+free_3 ], cost: 4
14.49/5.37	
14.49/5.37	     69: f2 -> [11] : B'=1, [ A>=2 && free_3>=1 ], cost: 4
14.49/5.37	
14.49/5.37	     70: f2 -> [11] : B'=1, [ A>=2 && free_3==0 ], cost: 4
14.49/5.37	
14.49/5.37	     71: f2 -> [11] : B'=1, [ A>=2 && 0>=1+free_3 ], cost: 5
14.49/5.37	
14.49/5.37	     72: f2 -> [11] : B'=1, [ A>=2 && free_3>=1 ], cost: 5
14.49/5.37	
14.49/5.37	     73: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     74: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     75: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     76: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     77: f2 -> [13] : [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	     78: f2 -> [13] : [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Applied pruning (of leafs and parallel rules):
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	     73: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     74: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     75: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     76: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     77: f2 -> [13] : [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	     78: f2 -> [13] : [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	### Computing asymptotic complexity ###
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Fully simplified ITS problem
14.49/5.37	
14.49/5.37	   Start location: f2
14.49/5.37	
14.49/5.37	     73: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     74: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     75: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	     76: f2 -> [11] : B'=-1+A, C'=-1+A, D'=free_2, E'=free_3, F'=1+free_11, G'=free_4, H'=free_5, Q'=free_6, J'=free_11, K'=-2-free_11+A, L'=free_8, M'=free_9, N'=free_10, O'=free_7, P'=-1-free_11+A, Q_1'=free_12, R'=free_13, [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+17/2*A
14.49/5.37	
14.49/5.37	     77: f2 -> [13] : [ 0>=1+free_3 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	     78: f2 -> [13] : [ free_3>=1 && A>=3 && free_11>=1 ], cost: -12+3/2*(-2+A)^2+free_11*(-2+A)+13/2*A
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Computing asymptotic complexity for rule 73
14.49/5.37	
14.49/5.37	   Solved the limit problem by the following transformations:
14.49/5.37	
14.49/5.37	      Created initial limit problem:
14.49/5.37	
14.49/5.37	      -5-2*free_11+free_11*A+3/2*A+3/2*A^2 (+), free_11 (+/+!), -free_3 (+/+!), -2+A (+/+!) [not solved]
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	      removing all constraints (solved by SMT)
14.49/5.37	
14.49/5.37	      resulting limit problem: [solved]
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	      applying transformation rule (C) using substitution {free_11==1+n,free_3==-1,A==3}
14.49/5.37	
14.49/5.37	      resulting limit problem:
14.49/5.37	
14.49/5.37	      [solved]
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	   Solution:
14.49/5.37	
14.49/5.37	      free_11 / 1+n
14.49/5.37	
14.49/5.37	      free_3 / -1
14.49/5.37	
14.49/5.37	      A / 3
14.49/5.37	
14.49/5.37	   Resulting cost 14+n has complexity: Unbounded
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Found new complexity Unbounded.
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	Obtained the following overall complexity (w.r.t. the length of the input n):
14.49/5.37	
14.49/5.37	   Complexity:  Unbounded
14.49/5.37	
14.49/5.37	   Cpx degree:  Unbounded
14.49/5.37	
14.49/5.37	   Solved cost: 14+n
14.49/5.37	
14.49/5.37	   Rule cost:   -11+3/2*(-2+A)^2+free_11*(-2+A)+15/2*A
14.49/5.37	
14.49/5.37	   Rule guard:  [ 0>=1+free_3 && A>=3 && free_11>=1 ]
14.49/5.37	
14.49/5.37	
14.49/5.37	
14.49/5.37	WORST_CASE(INF,?)
14.49/5.37	
14.49/5.37	
14.49/5.37	----------------------------------------
14.49/5.37	
14.49/5.37	(2)
14.49/5.37	BOUNDS(INF, INF)
14.63/5.39	EOF