/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(n^1), ?)
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 13.8 s]
(2) BOUNDS(n^1, INF)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f2(A, B + 1, C, D1, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && C >= D1
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f2(A, B + 1, E1, D1, E1, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1 + C
f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f15(A, B + 1, C, D, E, 0, 0, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f15(A, B + 1, C, D, E, D1, D1 * D1, H + D1 * D1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && 0 >= D1 + 1
f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f15(A, B + 1, C, D, E, D1, D1 * D1, H + D1 * D1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f30(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 0 >= I + 1 && 200 >= J
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f30(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: I >= 1 && 200 >= J
f30(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f33(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f42(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f47(A, B, C, D, E, F, G, H, I, J, K, L, D1, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1 && 0 >= D1 + 1
f42(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f47(A, B, C, D, E, F, G, H, I, J, K, L, D1, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1 && D1 >= 1
f47(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f51(A, B, C, D, E, F, G, 0, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f51(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f51(A, B + 1, C, D, E, F, G, H + D1 * E1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f58(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f58(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f42(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f42(A, B, C, D, E, F, G, H, I, J, K, L + 1, 0, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1
f68(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f72(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f72(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f72(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= K + 1
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f81(A, B, C, D, E, F, G, H, 0, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 200 >= J && I >= 0 && I <= 0
f81(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f81(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f87(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f90(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f90(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f90(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f100(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f103(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f103(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f103(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f119(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f122(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f122(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f122(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f131(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f131(A, B + 1, C, D, E, 0, G, H, I, J, K, L, M, 0, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f131(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f131(A, B + 1, C, D, E, D1, G, H, I, J, K, L, M, D1 * D1, O + D1 * D1, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && 0 >= D1 + 1
f131(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f131(A, B + 1, C, D, E, D1, G, H, I, J, K, L, M, D1 * D1, O + D1 * D1, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1
f141(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f141(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f147(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f147(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f155(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f155(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f155(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f164(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f167(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1
f167(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f167(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= K
f176(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f176(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f184(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f187(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f187(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f187(A, B, C, D, E, F, G, H + D1 * E1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K
f199(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f199(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, D1, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && C >= D1
f199(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f199(A, B + 1, D1, D, E, F, G, H, I, J, K, L, M, N, O, E1, D1, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && E1 >= 1 + C
f210(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f210(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B
f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, D1, E1, E1, 1, E1, G1, X, Y, Z, A1, B1, C1)) :|: E1 >= 2 && A >= B && D1 >= E1 * F1 && E1 * F1 + F1 >= D1 + 1 && F1 >= G1 && D1 >= E1 * H1 && E1 * H1 + H1 >= D1 + 1 && G1 >= H1
f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, D1, E1, E1, 1, 1, D1, X, Y, Z, A1, B1, C1)) :|: A >= B && 1 >= E1
f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: C >= W
f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B + 1, W, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: W >= 1 + C
f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J + 1, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && C >= 0
f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= C + 1
f210(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J + 1, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f199(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f210(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, D1, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= D1 + 1
f199(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f210(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, D1, Y, Z, A1, B1, C1)) :|: B >= 1 + A && D1 >= 1
f199(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B, 0, D, E, F, G, H, 0, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, 0, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f187(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f184(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f184(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f199(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f176(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f184(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, D1, Z, A1, B1, C1)) :|: B >= 1 + A
f167(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f164(A, B - 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + B
f164(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f176(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 0 >= B
f155(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f152(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f164(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f147(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f141(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f147(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f131(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f141(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f122(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f119(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f119(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f131(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f103(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f100(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 0, D1, E1, G1)) :|: K >= 1 + A && D1 >= E1 + G1
f103(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f100(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, D1, E1, G1)) :|: K >= 1 + A && E1 + G1 >= D1 + 1
f100(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= Z + 1
f100(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && Z >= 1
f100(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f119(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 0, A1, B1, C1)) :|: B >= 1 + A && Z >= 0 && Z <= 0
f90(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f87(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f87(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f100(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 1, A1, B1, C1)) :|: B >= 1 + A
f81(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f87(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f72(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f68(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= B
f68(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f152(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f58(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f47(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f51(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f58(A, B, C, D, E, F, G, D1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && H >= E1 * G1 && E1 * G1 + E1 >= H + 1 && E1 >= D1 && H >= F1 * G1 && F1 * G1 + F1 >= H + 1 && D1 >= F1
f47(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f42(A, B, C, D, E, F, G, H, I, J, K, L + 1, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f42(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f68(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: L >= A
f33(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f30(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A
f30(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f42(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: J >= 201
f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f26(A, B, C, D, E, F, G, H, 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= C + 1
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f15(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && C >= 0
start(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: TRUE

The start-symbols are:[start_29]


----------------------------------------

(1) Loat Proof (FINISHED)


### Pre-processing the ITS problem ###



Initial linear ITS problem

   Start location: start

      0: f2 -> f2 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1

      1: f2 -> f2 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1

     80: f2 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, G1'=N, H'=O, H1'=P, Q'=Q_1, J'=R, K'=S, L'=T, M'=U, N'=V, O'=W, P'=X, Q_1'=Y, R'=Z, S'=A1, T'=B1, U'=C1, [ B>=1+A && 0>=1+C ], cost: 1

     81: f2 -> f15 : [ B>=1+A && C>=0 ], cost: 1

      2: f15 -> f15 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1

      3: f15 -> f15 : B'=1+B, F'=free_3, G'=free_3^2, H'=free_3^2+H, [ A>=B && 0>=1+free_3 ], cost: 1

      4: f15 -> f15 : B'=1+B, F'=free_4, G'=free_4^2, H'=free_4^2+H, [ A>=B && free_4>=1 ], cost: 1

     79: f15 -> f26 : Q'=1, [ B>=1+A ], cost: 1

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

     17: f26 -> f81 : Q'=0, [ 200>=J && Q==0 ], cost: 1

     78: f26 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, G1'=N, H'=O, H1'=P, Q'=Q_1, J'=R, K'=S, L'=T, M'=U, N'=V, O'=W, P'=X, Q_1'=Y, R'=Z, S'=A1, T'=B1, U'=C1, [ J>=201 ], cost: 1

      7: f30 -> f33 : [ A>=B ], cost: 1

     77: f30 -> f42 : [ B>=1+A ], cost: 1

      8: f33 -> f33 : K'=1+K, [ A>=K ], cost: 1

     76: f33 -> f30 : B'=1+B, [ K>=1+A ], cost: 1

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     14: f42 -> f42 : L'=1+L, M'=0, [ A>=1+L ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     11: f47 -> f51 : H'=0, [ A>=K ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

     12: f51 -> f51 : B'=1+B, H'=free_7*free_8+H, [ A>=B ], cost: 1

     73: f51 -> f58 : H'=free_44, [ B>=1+A && H>=free_43*free_42 && free_43*free_42+free_42>=1+H && free_42>=free_44 && H>=free_43*free_45 && free_43*free_45+free_45>=1+H && free_44>=free_45 ], cost: 1

     13: f58 -> f58 : B'=1+B, [ A>=B ], cost: 1

     72: f58 -> f47 : K'=1+K, [ B>=1+A ], cost: 1

     15: f68 -> f72 : [ A>=B ], cost: 1

     71: f68 -> f152 : [ B>=1+A ], cost: 1

     16: f72 -> f72 : K'=1+K, [ B>=1+K ], cost: 1

     70: f72 -> f68 : B'=1+B, [ K>=B ], cost: 1

     18: f81 -> f81 : B'=1+B, [ A>=B ], cost: 1

     69: f81 -> f87 : [ B>=1+A ], cost: 1

     19: f87 -> f90 : [ A>=B ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

     20: f90 -> f90 : H'=free_10*free_9+H, K'=1+K, [ A>=K ], cost: 1

     67: f90 -> f87 : B'=1+B, [ K>=1+A ], cost: 1

     21: f100 -> f103 : [ A>=B ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

     22: f103 -> f103 : H'=free_11*free_12+H, K'=1+K, [ A>=K ], cost: 1

     62: f103 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ K>=1+A && free_38>=free_36+free_37 ], cost: 1

     63: f103 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ K>=1+A && free_39+free_40>=1+free_41 ], cost: 1

     23: f119 -> f122 : [ A>=B ], cost: 1

     61: f119 -> f131 : [ B>=1+A ], cost: 1

     24: f122 -> f122 : H'=H+free_13*free_14, K'=1+K, [ A>=K ], cost: 1

     60: f122 -> f119 : B'=1+B, [ K>=1+A ], cost: 1

     25: f131 -> f131 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1

     26: f131 -> f131 : B'=1+B, F'=free_15, N'=free_15^2, O'=free_15^2+O, [ A>=B && 0>=1+free_15 ], cost: 1

     27: f131 -> f131 : B'=1+B, F'=free_16, N'=free_16^2, O'=O+free_16^2, [ A>=B && free_16>=1 ], cost: 1

     59: f131 -> f141 : [ B>=1+A ], cost: 1

     28: f141 -> f141 : B'=1+B, [ A>=B ], cost: 1

     58: f141 -> f147 : [ B>=1+A ], cost: 1

     29: f147 -> f147 : B'=1+B, [ A>=B ], cost: 1

     57: f147 -> f152 : [ B>=1+A ], cost: 1

     30: f152 -> f155 : [ A>=B ], cost: 1

     56: f152 -> f164 : [ B>=1+A ], cost: 1

     31: f155 -> f155 : H'=free_17*free_18+H, K'=1+K, [ A>=K ], cost: 1

     55: f155 -> f152 : B'=1+B, [ K>=1+A ], cost: 1

     32: f164 -> f167 : [ B>=1 ], cost: 1

     54: f164 -> f176 : [ 0>=B ], cost: 1

     33: f167 -> f167 : H'=free_20*free_19+H, K'=1+K, [ B>=K ], cost: 1

     53: f167 -> f164 : B'=-1+B, [ K>=1+B ], cost: 1

     34: f176 -> f176 : B'=1+B, [ A>=B ], cost: 1

     52: f176 -> f184 : Y'=free_35, [ B>=1+A ], cost: 1

     35: f184 -> f187 : [ A>=B ], cost: 1

     51: f184 -> f199 : C'=0, [ B>=1+A ], cost: 1

     36: f187 -> f187 : H'=free_21*free_22+H, K'=1+K, [ A>=K ], cost: 1

     50: f187 -> f184 : B'=1+B, [ K>=1+A ], cost: 1

     37: f199 -> f199 : B'=1+B, P'=free_23, [ A>=B && C>=free_23 ], cost: 1

     38: f199 -> f199 : B'=1+B, C'=free_25, P'=free_24, Q_1'=free_25, [ A>=B && free_24>=1+C ], cost: 1

     47: f199 -> f210 : X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 1

     48: f199 -> f210 : X'=free_34, [ B>=1+A && free_34>=1 ], cost: 1

     49: f199 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1

     39: f210 -> f210 : B'=1+B, [ A>=B ], cost: 1

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     40: f218 -> f228 : R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 ], cost: 1

     41: f218 -> f228 : R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

     45: f218 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, G1'=N, H'=O, H1'=P, Q'=Q_1, J'=R, K'=S, L'=T, M'=U, N'=V, O'=W, P'=X, Q_1'=Y, R'=Z, S'=A1, T'=B1, U'=C1, [ B>=1+A && 0>=1+C ], cost: 1

     42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1

     43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1

     82: start -> f2 : [], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

     82: start -> f2 : [], cost: 1



Removed unreachable and leaf rules:

   Start location: start

      0: f2 -> f2 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1

      1: f2 -> f2 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1

     81: f2 -> f15 : [ B>=1+A && C>=0 ], cost: 1

      2: f15 -> f15 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1

      3: f15 -> f15 : B'=1+B, F'=free_3, G'=free_3^2, H'=free_3^2+H, [ A>=B && 0>=1+free_3 ], cost: 1

      4: f15 -> f15 : B'=1+B, F'=free_4, G'=free_4^2, H'=free_4^2+H, [ A>=B && free_4>=1 ], cost: 1

     79: f15 -> f26 : Q'=1, [ B>=1+A ], cost: 1

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

     17: f26 -> f81 : Q'=0, [ 200>=J && Q==0 ], cost: 1

      7: f30 -> f33 : [ A>=B ], cost: 1

     77: f30 -> f42 : [ B>=1+A ], cost: 1

      8: f33 -> f33 : K'=1+K, [ A>=K ], cost: 1

     76: f33 -> f30 : B'=1+B, [ K>=1+A ], cost: 1

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     14: f42 -> f42 : L'=1+L, M'=0, [ A>=1+L ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     11: f47 -> f51 : H'=0, [ A>=K ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

     12: f51 -> f51 : B'=1+B, H'=free_7*free_8+H, [ A>=B ], cost: 1

     73: f51 -> f58 : H'=free_44, [ B>=1+A && H>=free_43*free_42 && free_43*free_42+free_42>=1+H && free_42>=free_44 && H>=free_43*free_45 && free_43*free_45+free_45>=1+H && free_44>=free_45 ], cost: 1

     13: f58 -> f58 : B'=1+B, [ A>=B ], cost: 1

     72: f58 -> f47 : K'=1+K, [ B>=1+A ], cost: 1

     15: f68 -> f72 : [ A>=B ], cost: 1

     71: f68 -> f152 : [ B>=1+A ], cost: 1

     16: f72 -> f72 : K'=1+K, [ B>=1+K ], cost: 1

     70: f72 -> f68 : B'=1+B, [ K>=B ], cost: 1

     18: f81 -> f81 : B'=1+B, [ A>=B ], cost: 1

     69: f81 -> f87 : [ B>=1+A ], cost: 1

     19: f87 -> f90 : [ A>=B ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

     20: f90 -> f90 : H'=free_10*free_9+H, K'=1+K, [ A>=K ], cost: 1

     67: f90 -> f87 : B'=1+B, [ K>=1+A ], cost: 1

     21: f100 -> f103 : [ A>=B ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

     22: f103 -> f103 : H'=free_11*free_12+H, K'=1+K, [ A>=K ], cost: 1

     62: f103 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ K>=1+A && free_38>=free_36+free_37 ], cost: 1

     63: f103 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ K>=1+A && free_39+free_40>=1+free_41 ], cost: 1

     23: f119 -> f122 : [ A>=B ], cost: 1

     61: f119 -> f131 : [ B>=1+A ], cost: 1

     24: f122 -> f122 : H'=H+free_13*free_14, K'=1+K, [ A>=K ], cost: 1

     60: f122 -> f119 : B'=1+B, [ K>=1+A ], cost: 1

     25: f131 -> f131 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1

     26: f131 -> f131 : B'=1+B, F'=free_15, N'=free_15^2, O'=free_15^2+O, [ A>=B && 0>=1+free_15 ], cost: 1

     27: f131 -> f131 : B'=1+B, F'=free_16, N'=free_16^2, O'=O+free_16^2, [ A>=B && free_16>=1 ], cost: 1

     59: f131 -> f141 : [ B>=1+A ], cost: 1

     28: f141 -> f141 : B'=1+B, [ A>=B ], cost: 1

     58: f141 -> f147 : [ B>=1+A ], cost: 1

     29: f147 -> f147 : B'=1+B, [ A>=B ], cost: 1

     57: f147 -> f152 : [ B>=1+A ], cost: 1

     30: f152 -> f155 : [ A>=B ], cost: 1

     56: f152 -> f164 : [ B>=1+A ], cost: 1

     31: f155 -> f155 : H'=free_17*free_18+H, K'=1+K, [ A>=K ], cost: 1

     55: f155 -> f152 : B'=1+B, [ K>=1+A ], cost: 1

     32: f164 -> f167 : [ B>=1 ], cost: 1

     54: f164 -> f176 : [ 0>=B ], cost: 1

     33: f167 -> f167 : H'=free_20*free_19+H, K'=1+K, [ B>=K ], cost: 1

     53: f167 -> f164 : B'=-1+B, [ K>=1+B ], cost: 1

     34: f176 -> f176 : B'=1+B, [ A>=B ], cost: 1

     52: f176 -> f184 : Y'=free_35, [ B>=1+A ], cost: 1

     35: f184 -> f187 : [ A>=B ], cost: 1

     51: f184 -> f199 : C'=0, [ B>=1+A ], cost: 1

     36: f187 -> f187 : H'=free_21*free_22+H, K'=1+K, [ A>=K ], cost: 1

     50: f187 -> f184 : B'=1+B, [ K>=1+A ], cost: 1

     37: f199 -> f199 : B'=1+B, P'=free_23, [ A>=B && C>=free_23 ], cost: 1

     38: f199 -> f199 : B'=1+B, C'=free_25, P'=free_24, Q_1'=free_25, [ A>=B && free_24>=1+C ], cost: 1

     47: f199 -> f210 : X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 1

     48: f199 -> f210 : X'=free_34, [ B>=1+A && free_34>=1 ], cost: 1

     49: f199 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1

     39: f210 -> f210 : B'=1+B, [ A>=B ], cost: 1

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     40: f218 -> f228 : R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 ], cost: 1

     41: f218 -> f228 : R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

     42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1

     43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1

     82: start -> f2 : [], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 0.

   Accelerating the following rules:

      0: f2 -> f2 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1

      1: f2 -> f2 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1



   Accelerated rule 0 with metering function 1-B+A, yielding the new rule 83.

      During metering: Instantiating temporary variables by {free_1==1+C}

   Accelerated rule 1 with metering function 1-B+A, yielding the new rule 84.

   Removing the simple loops: 0 1.



Accelerating simple loops of location 1.

   Accelerating the following rules:

      2: f15 -> f15 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1

      3: f15 -> f15 : B'=1+B, F'=free_3, G'=free_3^2, H'=free_3^2+H, [ A>=B && 0>=1+free_3 ], cost: 1

      4: f15 -> f15 : B'=1+B, F'=free_4, G'=free_4^2, H'=free_4^2+H, [ A>=B && free_4>=1 ], cost: 1



   Accelerated rule 2 with metering function 1-B+A, yielding the new rule 85.

   Accelerated rule 3 with metering function 1-B+A, yielding the new rule 86.

   Accelerated rule 4 with metering function 1-B+A, yielding the new rule 87.

   Removing the simple loops: 2 3 4.



Accelerating simple loops of location 4.

   Accelerating the following rules:

      8: f33 -> f33 : K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 8 with metering function 1-K+A, yielding the new rule 88.

   Removing the simple loops: 8.



Accelerating simple loops of location 5.

   Accelerating the following rules:

     14: f42 -> f42 : L'=1+L, M'=0, [ A>=1+L ], cost: 1



   Accelerated rule 14 with metering function -L+A, yielding the new rule 89.

   Removing the simple loops: 14.



Accelerating simple loops of location 7.

   Accelerating the following rules:

     12: f51 -> f51 : B'=1+B, H'=free_7*free_8+H, [ A>=B ], cost: 1



   Accelerated rule 12 with metering function 1-B+A, yielding the new rule 90.

   Removing the simple loops: 12.



Accelerating simple loops of location 8.

   Accelerating the following rules:

     13: f58 -> f58 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 13 with metering function 1-B+A, yielding the new rule 91.

   Removing the simple loops: 13.



Accelerating simple loops of location 10.

   Accelerating the following rules:

     16: f72 -> f72 : K'=1+K, [ B>=1+K ], cost: 1



   Accelerated rule 16 with metering function -K+B, yielding the new rule 92.

   Removing the simple loops: 16.



Accelerating simple loops of location 11.

   Accelerating the following rules:

     18: f81 -> f81 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 18 with metering function 1-B+A, yielding the new rule 93.

   Removing the simple loops: 18.



Accelerating simple loops of location 13.

   Accelerating the following rules:

     20: f90 -> f90 : H'=free_10*free_9+H, K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 20 with metering function 1-K+A, yielding the new rule 94.

   Removing the simple loops: 20.



Accelerating simple loops of location 15.

   Accelerating the following rules:

     22: f103 -> f103 : H'=free_11*free_12+H, K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 22 with metering function 1-K+A, yielding the new rule 95.

   Removing the simple loops: 22.



Accelerating simple loops of location 17.

   Accelerating the following rules:

     24: f122 -> f122 : H'=H+free_13*free_14, K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 24 with metering function 1-K+A, yielding the new rule 96.

   Removing the simple loops: 24.



Accelerating simple loops of location 18.

   Accelerating the following rules:

     25: f131 -> f131 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1

     26: f131 -> f131 : B'=1+B, F'=free_15, N'=free_15^2, O'=free_15^2+O, [ A>=B && 0>=1+free_15 ], cost: 1

     27: f131 -> f131 : B'=1+B, F'=free_16, N'=free_16^2, O'=O+free_16^2, [ A>=B && free_16>=1 ], cost: 1



   Accelerated rule 25 with metering function 1-B+A, yielding the new rule 97.

   Accelerated rule 26 with metering function 1-B+A, yielding the new rule 98.

   Accelerated rule 27 with metering function 1-B+A, yielding the new rule 99.

   Removing the simple loops: 25 26 27.



Accelerating simple loops of location 19.

   Accelerating the following rules:

     28: f141 -> f141 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 28 with metering function 1-B+A, yielding the new rule 100.

   Removing the simple loops: 28.



Accelerating simple loops of location 20.

   Accelerating the following rules:

     29: f147 -> f147 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 29 with metering function 1-B+A, yielding the new rule 101.

   Removing the simple loops: 29.



Accelerating simple loops of location 22.

   Accelerating the following rules:

     31: f155 -> f155 : H'=free_17*free_18+H, K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 31 with metering function 1-K+A, yielding the new rule 102.

   Removing the simple loops: 31.



Accelerating simple loops of location 24.

   Accelerating the following rules:

     33: f167 -> f167 : H'=free_20*free_19+H, K'=1+K, [ B>=K ], cost: 1



   Accelerated rule 33 with metering function 1-K+B, yielding the new rule 103.

   Removing the simple loops: 33.



Accelerating simple loops of location 25.

   Accelerating the following rules:

     34: f176 -> f176 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 34 with metering function 1-B+A, yielding the new rule 104.

   Removing the simple loops: 34.



Accelerating simple loops of location 27.

   Accelerating the following rules:

     36: f187 -> f187 : H'=free_21*free_22+H, K'=1+K, [ A>=K ], cost: 1



   Accelerated rule 36 with metering function 1-K+A, yielding the new rule 105.

   Removing the simple loops: 36.



Accelerating simple loops of location 28.

   Accelerating the following rules:

     37: f199 -> f199 : B'=1+B, P'=free_23, [ A>=B && C>=free_23 ], cost: 1

     38: f199 -> f199 : B'=1+B, C'=free_25, P'=free_24, Q_1'=free_25, [ A>=B && free_24>=1+C ], cost: 1



   Accelerated rule 37 with metering function 1-B+A, yielding the new rule 106.

      During metering: Instantiating temporary variables by {free_24==1+C}

   Accelerated rule 38 with metering function 1-B+A, yielding the new rule 107.

   Removing the simple loops: 37 38.



Accelerating simple loops of location 29.

   Accelerating the following rules:

     39: f210 -> f210 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 39 with metering function 1-B+A, yielding the new rule 108.

   Removing the simple loops: 39.



Accelerated all simple loops using metering functions (where possible):

   Start location: start

     81: f2 -> f15 : [ B>=1+A && C>=0 ], cost: 1

     83: f2 -> f2 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 1-B+A

     84: f2 -> f2 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 1-B+A

     79: f15 -> f26 : Q'=1, [ B>=1+A ], cost: 1

     85: f15 -> f15 : B'=1+A, F'=0, G'=0, [ A>=B ], cost: 1-B+A

     86: f15 -> f15 : B'=1+A, F'=free_3, G'=free_3^2, H'=-(-1+B-A)*free_3^2+H, [ A>=B && 0>=1+free_3 ], cost: 1-B+A

     87: f15 -> f15 : B'=1+A, F'=free_4, G'=free_4^2, H'=-free_4^2*(-1+B-A)+H, [ A>=B && free_4>=1 ], cost: 1-B+A

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

     17: f26 -> f81 : Q'=0, [ 200>=J && Q==0 ], cost: 1

      7: f30 -> f33 : [ A>=B ], cost: 1

     77: f30 -> f42 : [ B>=1+A ], cost: 1

     76: f33 -> f30 : B'=1+B, [ K>=1+A ], cost: 1

     88: f33 -> f33 : K'=1+A, [ A>=K ], cost: 1-K+A

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     89: f42 -> f42 : L'=A, M'=0, [ A>=1+L ], cost: -L+A

     11: f47 -> f51 : H'=0, [ A>=K ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

     73: f51 -> f58 : H'=free_44, [ B>=1+A && H>=free_43*free_42 && free_43*free_42+free_42>=1+H && free_42>=free_44 && H>=free_43*free_45 && free_43*free_45+free_45>=1+H && free_44>=free_45 ], cost: 1

     90: f51 -> f51 : B'=1+A, H'=-free_7*free_8*(-1+B-A)+H, [ A>=B ], cost: 1-B+A

     72: f58 -> f47 : K'=1+K, [ B>=1+A ], cost: 1

     91: f58 -> f58 : B'=1+A, [ A>=B ], cost: 1-B+A

     15: f68 -> f72 : [ A>=B ], cost: 1

     71: f68 -> f152 : [ B>=1+A ], cost: 1

     70: f72 -> f68 : B'=1+B, [ K>=B ], cost: 1

     92: f72 -> f72 : K'=B, [ B>=1+K ], cost: -K+B

     69: f81 -> f87 : [ B>=1+A ], cost: 1

     93: f81 -> f81 : B'=1+A, [ A>=B ], cost: 1-B+A

     19: f87 -> f90 : [ A>=B ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

     67: f90 -> f87 : B'=1+B, [ K>=1+A ], cost: 1

     94: f90 -> f90 : H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=K ], cost: 1-K+A

     21: f100 -> f103 : [ A>=B ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

     62: f103 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ K>=1+A && free_38>=free_36+free_37 ], cost: 1

     63: f103 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ K>=1+A && free_39+free_40>=1+free_41 ], cost: 1

     95: f103 -> f103 : H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=K ], cost: 1-K+A

     23: f119 -> f122 : [ A>=B ], cost: 1

     61: f119 -> f131 : [ B>=1+A ], cost: 1

     60: f122 -> f119 : B'=1+B, [ K>=1+A ], cost: 1

     96: f122 -> f122 : H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=K ], cost: 1-K+A

     59: f131 -> f141 : [ B>=1+A ], cost: 1

     97: f131 -> f131 : B'=1+A, F'=0, N'=0, [ A>=B ], cost: 1-B+A

     98: f131 -> f131 : B'=1+A, F'=free_15, N'=free_15^2, O'=O-free_15^2*(-1+B-A), [ A>=B && 0>=1+free_15 ], cost: 1-B+A

     99: f131 -> f131 : B'=1+A, F'=free_16, N'=free_16^2, O'=-(-1+B-A)*free_16^2+O, [ A>=B && free_16>=1 ], cost: 1-B+A

     58: f141 -> f147 : [ B>=1+A ], cost: 1

    100: f141 -> f141 : B'=1+A, [ A>=B ], cost: 1-B+A

     57: f147 -> f152 : [ B>=1+A ], cost: 1

    101: f147 -> f147 : B'=1+A, [ A>=B ], cost: 1-B+A

     30: f152 -> f155 : [ A>=B ], cost: 1

     56: f152 -> f164 : [ B>=1+A ], cost: 1

     55: f155 -> f152 : B'=1+B, [ K>=1+A ], cost: 1

    102: f155 -> f155 : H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=K ], cost: 1-K+A

     32: f164 -> f167 : [ B>=1 ], cost: 1

     54: f164 -> f176 : [ 0>=B ], cost: 1

     53: f167 -> f164 : B'=-1+B, [ K>=1+B ], cost: 1

    103: f167 -> f167 : H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=K ], cost: 1-K+B

     52: f176 -> f184 : Y'=free_35, [ B>=1+A ], cost: 1

    104: f176 -> f176 : B'=1+A, [ A>=B ], cost: 1-B+A

     35: f184 -> f187 : [ A>=B ], cost: 1

     51: f184 -> f199 : C'=0, [ B>=1+A ], cost: 1

     50: f187 -> f184 : B'=1+B, [ K>=1+A ], cost: 1

    105: f187 -> f187 : H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=K ], cost: 1-K+A

     47: f199 -> f210 : X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 1

     48: f199 -> f210 : X'=free_34, [ B>=1+A && free_34>=1 ], cost: 1

     49: f199 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1

    106: f199 -> f199 : B'=1+A, P'=free_23, [ A>=B && C>=free_23 ], cost: 1-B+A

    107: f199 -> f199 : B'=1+A, C'=free_25, P'=1+free_25, Q_1'=free_25, [ A>=B ], cost: 1-B+A

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

    108: f210 -> f210 : B'=1+A, [ A>=B ], cost: 1-B+A

     40: f218 -> f228 : R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 ], cost: 1

     41: f218 -> f228 : R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

     42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1

     43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1

     82: start -> f2 : [], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: start

     81: f2 -> f15 : [ B>=1+A && C>=0 ], cost: 1

     79: f15 -> f26 : Q'=1, [ B>=1+A ], cost: 1

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

     17: f26 -> f81 : Q'=0, [ 200>=J && Q==0 ], cost: 1

    116: f26 -> f81 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 2-B+A

      7: f30 -> f33 : [ A>=B ], cost: 1

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    111: f30 -> f33 : K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

     76: f33 -> f30 : B'=1+B, [ K>=1+A ], cost: 1

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     11: f47 -> f51 : H'=0, [ A>=K ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

    114: f47 -> f51 : B'=1+A, H'=-free_7*free_8*(-1+B-A), [ A>=K && A>=B ], cost: 2-B+A

     73: f51 -> f58 : H'=free_44, [ B>=1+A && H>=free_43*free_42 && free_43*free_42+free_42>=1+H && free_42>=free_44 && H>=free_43*free_45 && free_43*free_45+free_45>=1+H && free_44>=free_45 ], cost: 1

     72: f58 -> f47 : K'=1+K, [ B>=1+A ], cost: 1

     15: f68 -> f72 : [ A>=B ], cost: 1

     71: f68 -> f152 : [ B>=1+A ], cost: 1

    115: f68 -> f72 : K'=B, [ A>=B && B>=1+K ], cost: 1-K+B

     70: f72 -> f68 : B'=1+B, [ K>=B ], cost: 1

     69: f81 -> f87 : [ B>=1+A ], cost: 1

     19: f87 -> f90 : [ A>=B ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

    117: f87 -> f90 : H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     67: f90 -> f87 : B'=1+B, [ K>=1+A ], cost: 1

     21: f100 -> f103 : [ A>=B ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

    118: f100 -> f103 : H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     62: f103 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ K>=1+A && free_38>=free_36+free_37 ], cost: 1

     63: f103 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ K>=1+A && free_39+free_40>=1+free_41 ], cost: 1

     23: f119 -> f122 : [ A>=B ], cost: 1

     61: f119 -> f131 : [ B>=1+A ], cost: 1

    119: f119 -> f122 : H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     60: f122 -> f119 : B'=1+B, [ K>=1+A ], cost: 1

     59: f131 -> f141 : [ B>=1+A ], cost: 1

     58: f141 -> f147 : [ B>=1+A ], cost: 1

     57: f147 -> f152 : [ B>=1+A ], cost: 1

     30: f152 -> f155 : [ A>=B ], cost: 1

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    120: f152 -> f155 : H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     55: f155 -> f152 : B'=1+B, [ K>=1+A ], cost: 1

     32: f164 -> f167 : [ B>=1 ], cost: 1

     54: f164 -> f176 : [ 0>=B ], cost: 1

    121: f164 -> f167 : H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1 && B>=K ], cost: 2-K+B

    122: f164 -> f176 : B'=1+A, [ 0>=B && A>=B ], cost: 2-B+A

     53: f167 -> f164 : B'=-1+B, [ K>=1+B ], cost: 1

     52: f176 -> f184 : Y'=free_35, [ B>=1+A ], cost: 1

     35: f184 -> f187 : [ A>=B ], cost: 1

     51: f184 -> f199 : C'=0, [ B>=1+A ], cost: 1

    123: f184 -> f187 : H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     50: f187 -> f184 : B'=1+B, [ K>=1+A ], cost: 1

     47: f199 -> f210 : X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 1

     48: f199 -> f210 : X'=free_34, [ B>=1+A && free_34>=1 ], cost: 1

     49: f199 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     40: f218 -> f228 : R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 ], cost: 1

     41: f218 -> f228 : R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

     42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1

     43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1

     82: start -> f2 : [], cost: 1

    109: start -> f2 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 2-B+A

    110: start -> f2 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 2-B+A



Eliminated locations (on linear paths):

   Start location: start

    124: f2 -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 2

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

     17: f26 -> f81 : Q'=0, [ 200>=J && Q==0 ], cost: 1

    116: f26 -> f81 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 2-B+A

      7: f30 -> f33 : [ A>=B ], cost: 1

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    111: f30 -> f33 : K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

     76: f33 -> f30 : B'=1+B, [ K>=1+A ], cost: 1

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     11: f47 -> f51 : H'=0, [ A>=K ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

    114: f47 -> f51 : B'=1+A, H'=-free_7*free_8*(-1+B-A), [ A>=K && A>=B ], cost: 2-B+A

    125: f51 -> f47 : H'=free_44, K'=1+K, [ B>=1+A && H>=free_43*free_42 && free_43*free_42+free_42>=1+H && free_42>=free_44 && H>=free_43*free_45 && free_43*free_45+free_45>=1+H && free_44>=free_45 ], cost: 2

     15: f68 -> f72 : [ A>=B ], cost: 1

     71: f68 -> f152 : [ B>=1+A ], cost: 1

    115: f68 -> f72 : K'=B, [ A>=B && B>=1+K ], cost: 1-K+B

     70: f72 -> f68 : B'=1+B, [ K>=B ], cost: 1

     69: f81 -> f87 : [ B>=1+A ], cost: 1

     19: f87 -> f90 : [ A>=B ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

    117: f87 -> f90 : H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     67: f90 -> f87 : B'=1+B, [ K>=1+A ], cost: 1

     21: f100 -> f103 : [ A>=B ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

    118: f100 -> f103 : H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     62: f103 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ K>=1+A && free_38>=free_36+free_37 ], cost: 1

     63: f103 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ K>=1+A && free_39+free_40>=1+free_41 ], cost: 1

     23: f119 -> f122 : [ A>=B ], cost: 1

    119: f119 -> f122 : H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

    128: f119 -> f152 : [ B>=1+A ], cost: 4

     60: f122 -> f119 : B'=1+B, [ K>=1+A ], cost: 1

     30: f152 -> f155 : [ A>=B ], cost: 1

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    120: f152 -> f155 : H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     55: f155 -> f152 : B'=1+B, [ K>=1+A ], cost: 1

     32: f164 -> f167 : [ B>=1 ], cost: 1

     54: f164 -> f176 : [ 0>=B ], cost: 1

    121: f164 -> f167 : H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1 && B>=K ], cost: 2-K+B

    122: f164 -> f176 : B'=1+A, [ 0>=B && A>=B ], cost: 2-B+A

     53: f167 -> f164 : B'=-1+B, [ K>=1+B ], cost: 1

     52: f176 -> f184 : Y'=free_35, [ B>=1+A ], cost: 1

     35: f184 -> f187 : [ A>=B ], cost: 1

     51: f184 -> f199 : C'=0, [ B>=1+A ], cost: 1

    123: f184 -> f187 : H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A

     50: f187 -> f184 : B'=1+B, [ K>=1+A ], cost: 1

     47: f199 -> f210 : X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 1

     48: f199 -> f210 : X'=free_34, [ B>=1+A && free_34>=1 ], cost: 1

     49: f199 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     40: f218 -> f228 : R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 ], cost: 1

     41: f218 -> f228 : R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

     42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1

     43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1

     82: start -> f2 : [], cost: 1

    109: start -> f2 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 2-B+A

    110: start -> f2 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 2-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

    132: f26 -> f87 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2

    133: f26 -> f87 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

    134: f30 -> f30 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    135: f30 -> f30 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

    136: f47 -> f47 : H'=free_44, K'=1+K, [ A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 3

    137: f47 -> f47 : B'=1+A, H'=free_44, K'=1+K, [ A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 4-B+A

     71: f68 -> f152 : [ B>=1+A ], cost: 1

    138: f68 -> f68 : B'=1+B, [ A>=B && K>=B ], cost: 2

    139: f68 -> f68 : B'=1+B, K'=B, [ A>=B && B>=1+K ], cost: 2-K+B

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

    155: f87 -> f87 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    156: f87 -> f87 : B'=1+B, H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

    157: f100 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ A>=B && K>=1+A && free_38>=free_36+free_37 ], cost: 2

    158: f100 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ A>=B && K>=1+A && free_39+free_40>=1+free_41 ], cost: 2

    159: f100 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, Z'=0, [ A>=B && A>=K && free_38>=free_36+free_37 ], cost: 3-K+A

    160: f100 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K && free_39+free_40>=1+free_41 ], cost: 3-K+A

    128: f119 -> f152 : [ B>=1+A ], cost: 4

    161: f119 -> f119 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    162: f119 -> f119 : B'=1+B, H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    140: f152 -> f152 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    141: f152 -> f152 : B'=1+B, H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    142: f164 -> f164 : B'=-1+B, [ B>=1 && K>=1+B ], cost: 2

    143: f164 -> f164 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1 && B>=K ], cost: 3-K+B

    144: f164 -> f184 : Y'=free_35, [ 0>=B && B>=1+A ], cost: 2

    145: f164 -> f184 : B'=1+A, Y'=free_35, [ 0>=B && A>=B ], cost: 3-B+A

    146: f184 -> f184 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    147: f184 -> f184 : B'=1+B, H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    148: f184 -> f210 : C'=0, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 2

    149: f184 -> f210 : C'=0, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 2

    150: f184 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

    151: f218 -> f218 : B'=1+B, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && C>=free_28 ], cost: 2

    152: f218 -> f218 : B'=1+B, C'=free_28, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && free_28>=1+C ], cost: 2

    153: f218 -> f218 : B'=1+B, R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 && C>=free_32 ], cost: 2

    154: f218 -> f218 : B'=1+B, C'=free_32, R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 && free_32>=1+C ], cost: 2

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Accelerating simple loops of location 3.

   Accelerating the following rules:

    134: f30 -> f30 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    135: f30 -> f30 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A



   Accelerated rule 134 with metering function 1-B+A, yielding the new rule 163.

   Found no metering function for rule 135.

   Removing the simple loops: 134.



Accelerating simple loops of location 6.

   Accelerating the following rules:

    136: f47 -> f47 : H'=free_44, K'=1+K, [ A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 3

    137: f47 -> f47 : B'=1+A, H'=free_44, K'=1+K, [ A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 4-B+A



   Accelerated rule 136 with metering function 1-K+A, yielding the new rule 164.

   Found no metering function for rule 137 (rule is too complicated).

   Removing the simple loops: 136.



Accelerating simple loops of location 9.

   Accelerating the following rules:

    138: f68 -> f68 : B'=1+B, [ A>=B && K>=B ], cost: 2

    139: f68 -> f68 : B'=1+B, K'=B, [ A>=B && B>=1+K ], cost: 2-K+B



   Found no metering function for rule 138.

   Accelerated rule 139 with metering function 1-B+A, yielding the new rule 165.

   Removing the simple loops: 139.



Accelerating simple loops of location 12.

   Accelerating the following rules:

    155: f87 -> f87 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    156: f87 -> f87 : B'=1+B, H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=B && A>=K ], cost: 3-K+A



   Accelerated rule 155 with metering function 1-B+A, yielding the new rule 166.

   Found no metering function for rule 156.

   Removing the simple loops: 155.



Accelerating simple loops of location 14.

   Accelerating the following rules:

    157: f100 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, Z'=0, [ A>=B && K>=1+A && free_38>=free_36+free_37 ], cost: 2

    158: f100 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, [ A>=B && K>=1+A && free_39+free_40>=1+free_41 ], cost: 2

    159: f100 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, Z'=0, [ A>=B && A>=K && free_38>=free_36+free_37 ], cost: 3-K+A

    160: f100 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K && free_39+free_40>=1+free_41 ], cost: 3-K+A



   Accelerated rule 157 with metering function 1-B+A, yielding the new rule 167.

   Accelerated rule 158 with metering function 1-B+A, yielding the new rule 168.

   Found no metering function for rule 159.

   Found no metering function for rule 160.

   Removing the simple loops: 157 158.



Accelerating simple loops of location 16.

   Accelerating the following rules:

    161: f119 -> f119 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    162: f119 -> f119 : B'=1+B, H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A



   Accelerated rule 161 with metering function 1-B+A, yielding the new rule 169.

   Found no metering function for rule 162.

   Removing the simple loops: 161.



Accelerating simple loops of location 21.

   Accelerating the following rules:

    140: f152 -> f152 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    141: f152 -> f152 : B'=1+B, H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A



   Accelerated rule 140 with metering function 1-B+A, yielding the new rule 170.

   Found no metering function for rule 141.

   Removing the simple loops: 140.



Accelerating simple loops of location 23.

   Accelerating the following rules:

    142: f164 -> f164 : B'=-1+B, [ B>=1 && K>=1+B ], cost: 2

    143: f164 -> f164 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1 && B>=K ], cost: 3-K+B



   Accelerated rule 142 with metering function B, yielding the new rule 171.

   Found no metering function for rule 143.

   Removing the simple loops: 142.



Accelerating simple loops of location 26.

   Accelerating the following rules:

    146: f184 -> f184 : B'=1+B, [ A>=B && K>=1+A ], cost: 2

    147: f184 -> f184 : B'=1+B, H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A



   Accelerated rule 146 with metering function 1-B+A, yielding the new rule 172.

   Found no metering function for rule 147.

   Removing the simple loops: 146.



Accelerating simple loops of location 30.

   Accelerating the following rules:

    151: f218 -> f218 : B'=1+B, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && C>=free_28 ], cost: 2

    152: f218 -> f218 : B'=1+B, C'=free_28, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && free_28>=1+C ], cost: 2

    153: f218 -> f218 : B'=1+B, R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 && C>=free_32 ], cost: 2

    154: f218 -> f218 : B'=1+B, C'=free_32, R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 && free_32>=1+C ], cost: 2



   Accelerated rule 151 with metering function 1-B+A, yielding the new rule 173.

      During metering: Instantiating temporary variables by {free_26==free_28,free_30==free_28,free_28==1+C}

   Found no metering function for rule 152 (rule is too complicated).

   Accelerated rule 153 with metering function 1-B+A, yielding the new rule 174.

      During metering: Instantiating temporary variables by {free_32==1+C}

   Accelerated rule 154 with metering function 1-B+A, yielding the new rule 175.

   Removing the simple loops: 151 153 154.



Accelerated all simple loops using metering functions (where possible):

   Start location: start

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

    132: f26 -> f87 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2

    133: f26 -> f87 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

    135: f30 -> f30 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    163: f30 -> f30 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

    137: f47 -> f47 : B'=1+A, H'=free_44, K'=1+K, [ A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 4-B+A

    164: f47 -> f47 : H'=free_44, K'=1+A, [ A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 3-3*K+3*A

     71: f68 -> f152 : [ B>=1+A ], cost: 1

    138: f68 -> f68 : B'=1+B, [ A>=B && K>=B ], cost: 2

    165: f68 -> f68 : B'=1+A, K'=A, [ A>=B && B>=1+K ], cost: 3-3*B+3*A

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

    156: f87 -> f87 : B'=1+B, H'=H-free_10*free_9*(-1+K-A), K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    166: f87 -> f87 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

    159: f100 -> f100 : A1'=free_38, B'=1+B, B1'=free_36, C1'=free_37, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, Z'=0, [ A>=B && A>=K && free_38>=free_36+free_37 ], cost: 3-K+A

    160: f100 -> f100 : A1'=free_41, B'=1+B, B1'=free_39, C1'=free_40, H'=-free_11*free_12*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K && free_39+free_40>=1+free_41 ], cost: 3-K+A

    167: f100 -> f100 : A1'=free_38, B'=1+A, B1'=free_36, C1'=free_37, Z'=0, [ A>=B && K>=1+A && free_38>=free_36+free_37 ], cost: 2-2*B+2*A

    168: f100 -> f100 : A1'=free_41, B'=1+A, B1'=free_39, C1'=free_40, [ A>=B && K>=1+A && free_39+free_40>=1+free_41 ], cost: 2-2*B+2*A

    128: f119 -> f152 : [ B>=1+A ], cost: 4

    162: f119 -> f119 : B'=1+B, H'=-free_13*free_14*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    169: f119 -> f119 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    141: f152 -> f152 : B'=1+B, H'=-free_17*free_18*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    170: f152 -> f152 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A

    143: f164 -> f164 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1 && B>=K ], cost: 3-K+B

    144: f164 -> f184 : Y'=free_35, [ 0>=B && B>=1+A ], cost: 2

    145: f164 -> f184 : B'=1+A, Y'=free_35, [ 0>=B && A>=B ], cost: 3-B+A

    171: f164 -> f164 : B'=0, [ B>=1 && K>=1+B ], cost: 2*B

    147: f184 -> f184 : B'=1+B, H'=-free_21*free_22*(-1+K-A)+H, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A

    148: f184 -> f210 : C'=0, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 2

    149: f184 -> f210 : C'=0, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 2

    150: f184 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2

    172: f184 -> f184 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

    152: f218 -> f218 : B'=1+B, C'=free_28, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && free_28>=1+C ], cost: 2

    173: f218 -> f218 : B'=1+A, R'=free_29, S'=free_27, T'=free_27, U'=1, V'=free_27, W'=free_28, [ free_27>=2 && A>=B && free_29>=free_30*free_27 && free_30+free_30*free_27>=1+free_29 && free_30>=free_28 && free_29>=free_26*free_27 && free_26+free_26*free_27>=1+free_29 && free_28>=free_26 && C>=free_28 ], cost: 2-2*B+2*A

    174: f218 -> f218 : B'=1+A, R'=free_32, S'=free_31, T'=free_31, U'=1, V'=1, W'=free_32, [ A>=B && 1>=free_31 && C>=free_32 ], cost: 2-2*B+2*A

    175: f218 -> f218 : B'=1+A, C'=1-B+A+C, R'=1-B+A+C, S'=free_31, T'=free_31, U'=1, V'=1, W'=1-B+A+C, [ A>=B && 1>=free_31 ], cost: 2-2*B+2*A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

    132: f26 -> f87 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2

    133: f26 -> f87 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A

    176: f26 -> f30 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K ], cost: 4-K+A

    177: f26 -> f30 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K ], cost: 4-K+A

    178: f26 -> f30 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A

    179: f26 -> f30 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

    180: f42 -> f47 : B'=1+A, H'=free_44, K'=1+K, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 5-B+A

    181: f42 -> f47 : B'=1+A, H'=free_44, K'=1+K, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 5-B+A

    182: f42 -> f47 : H'=free_44, K'=1+A, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 4-3*K+3*A

    183: f42 -> f47 : H'=free_44, K'=1+A, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 4-3*K+3*A

    184: f42 -> f68 : B'=1+B, [ L>=A && A>=B && K>=B ], cost: 3

    185: f42 -> f68 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 4-3*B+3*A

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

     71: f68 -> f152 : [ B>=1+A ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

     66: f100 -> f119 : Z'=0, [ B>=1+A && Z==0 ], cost: 1

    128: f119 -> f152 : [ B>=1+A ], cost: 4

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    186: f152 -> f164 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1+A && B>=1 && B>=K ], cost: 4-K+B

    187: f152 -> f164 : B'=0, [ B>=1+A && B>=1 && K>=1+B ], cost: 1+2*B

    144: f164 -> f184 : Y'=free_35, [ 0>=B && B>=1+A ], cost: 2

    145: f164 -> f184 : B'=1+A, Y'=free_35, [ 0>=B && A>=B ], cost: 3-B+A

    148: f184 -> f210 : C'=0, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 2

    149: f184 -> f210 : C'=0, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 2

    150: f184 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

     44: f218 -> f26 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Eliminated locations (on linear paths):

   Start location: start

      5: f26 -> f30 : [ 0>=1+Q && 200>=J ], cost: 1

      6: f26 -> f30 : [ Q>=1 && 200>=J ], cost: 1

    132: f26 -> f87 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2

    133: f26 -> f87 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A

    176: f26 -> f30 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K ], cost: 4-K+A

    177: f26 -> f30 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K ], cost: 4-K+A

    178: f26 -> f30 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A

    179: f26 -> f30 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A

     77: f30 -> f42 : [ B>=1+A ], cost: 1

    113: f30 -> f42 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1-L+A

      9: f42 -> f47 : M'=free_5, [ A>=1+L && 0>=1+free_5 ], cost: 1

     10: f42 -> f47 : M'=free_6, [ A>=1+L && free_6>=1 ], cost: 1

     75: f42 -> f68 : [ L>=A ], cost: 1

    180: f42 -> f47 : B'=1+A, H'=free_44, K'=1+K, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 5-B+A

    181: f42 -> f47 : B'=1+A, H'=free_44, K'=1+K, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 ], cost: 5-B+A

    182: f42 -> f47 : H'=free_44, K'=1+A, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 4-3*K+3*A

    183: f42 -> f47 : H'=free_44, K'=1+A, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 4-3*K+3*A

    184: f42 -> f68 : B'=1+B, [ L>=A && A>=B && K>=B ], cost: 3

    185: f42 -> f68 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 4-3*B+3*A

     74: f47 -> f42 : L'=1+L, [ K>=1+A ], cost: 1

    112: f47 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: -L+A

     71: f68 -> f152 : [ B>=1+A ], cost: 1

     68: f87 -> f100 : Z'=1, [ B>=1+A ], cost: 1

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

    189: f100 -> f152 : Z'=0, [ B>=1+A && Z==0 ], cost: 5

     56: f152 -> f164 : [ B>=1+A ], cost: 1

    186: f152 -> f164 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, [ B>=1+A && B>=1 && B>=K ], cost: 4-K+B

    187: f152 -> f164 : B'=0, [ B>=1+A && B>=1 && K>=1+B ], cost: 1+2*B

    144: f164 -> f184 : Y'=free_35, [ 0>=B && B>=1+A ], cost: 2

    145: f164 -> f184 : B'=1+A, Y'=free_35, [ 0>=B && A>=B ], cost: 3-B+A

    148: f184 -> f210 : C'=0, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 2

    149: f184 -> f210 : C'=0, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 2

    188: f184 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3

     46: f210 -> f26 : J'=1+J, [ B>=1+A ], cost: 1

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

    190: f26 -> f42 : [ 0>=1+Q && 200>=J && B>=1+A ], cost: 2

    191: f26 -> f42 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    192: f26 -> f42 : [ Q>=1 && 200>=J && B>=1+A ], cost: 2

    193: f26 -> f42 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    194: f26 -> f42 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    195: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    196: f26 -> f42 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    197: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    198: f26 -> f42 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 4-2*B+2*A

    199: f26 -> f42 : B'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    200: f26 -> f42 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 4-2*B+2*A

    201: f26 -> f42 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    202: f26 -> f100 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3

    203: f26 -> f100 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    204: f42 -> f42 : L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && K>=1+A ], cost: 2

    205: f42 -> f42 : L'=A, M'=0, [ 0>=1+free_5 && K>=1+A && A>=2+L ], cost: 1-L+A

    206: f42 -> f42 : L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && K>=1+A ], cost: 2

    207: f42 -> f42 : L'=A, M'=0, [ free_6>=1 && K>=1+A && A>=2+L ], cost: 1-L+A

    208: f42 -> f42 : B'=1+A, H'=free_44, K'=1+K, L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 && 1+K>=1+A ], cost: 6-B+A

    209: f42 -> f42 : B'=1+A, H'=free_44, K'=1+K, L'=A, M'=0, [ 0>=1+free_5 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 && 1+K>=1+A && A>=2+L ], cost: 5-B-L+2*A

    210: f42 -> f42 : B'=1+A, H'=free_44, K'=1+K, L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 && 1+K>=1+A ], cost: 6-B+A

    211: f42 -> f42 : B'=1+A, H'=free_44, K'=1+K, L'=A, M'=0, [ free_6>=1 && A>=K && A>=B && -free_7*free_8*(-1+B-A)>=free_43*free_42 && free_43*free_42+free_42>=1-free_7*free_8*(-1+B-A) && free_42>=free_44 && -free_7*free_8*(-1+B-A)>=free_43*free_45 && free_43*free_45+free_45>=1-free_7*free_8*(-1+B-A) && free_44>=free_45 && 1+K>=1+A && A>=2+L ], cost: 5-B-L+2*A

    212: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    213: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A

    214: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    215: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A

    216: f42 -> f152 : [ L>=A && B>=1+A ], cost: 2

    217: f42 -> f152 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4

    218: f42 -> f152 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

    189: f100 -> f152 : Z'=0, [ B>=1+A && Z==0 ], cost: 5

    219: f152 -> f184 : Y'=free_35, [ B>=1+A && 0>=B ], cost: 3

    220: f152 -> f184 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6-K+B

    221: f152 -> f184 : B'=1+A, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A

    222: f152 -> f184 : B'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B

    223: f152 -> f184 : B'=1+A, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A

    188: f184 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3

    224: f184 -> f26 : C'=0, J'=1+J, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 3

    225: f184 -> f26 : C'=0, J'=1+J, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 3

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Applied pruning (of leafs and parallel rules):

   Start location: start

    191: f26 -> f42 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    193: f26 -> f42 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    195: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    196: f26 -> f42 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    201: f26 -> f42 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    202: f26 -> f100 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3

    203: f26 -> f100 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    207: f42 -> f42 : L'=A, M'=0, [ free_6>=1 && K>=1+A && A>=2+L ], cost: 1-L+A

    212: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    213: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A

    214: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    215: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A

    216: f42 -> f152 : [ L>=A && B>=1+A ], cost: 2

    217: f42 -> f152 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4

    218: f42 -> f152 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

    189: f100 -> f152 : Z'=0, [ B>=1+A && Z==0 ], cost: 5

    219: f152 -> f184 : Y'=free_35, [ B>=1+A && 0>=B ], cost: 3

    220: f152 -> f184 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6-K+B

    221: f152 -> f184 : B'=1+A, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A

    222: f152 -> f184 : B'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B

    223: f152 -> f184 : B'=1+A, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A

    188: f184 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3

    224: f184 -> f26 : C'=0, J'=1+J, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 3

    225: f184 -> f26 : C'=0, J'=1+J, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 3

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Accelerating simple loops of location 5.

   Simplified some of the simple loops (and removed duplicate rules).

   Accelerating the following rules:

    207: f42 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: 1-L+A

    212: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    214: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    215: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A



   Found no metering function for rule 207.

   Found no metering function for rule 212.

   Found no metering function for rule 214.

   Found no metering function for rule 215.

   Removing the simple loops:.



Accelerated all simple loops using metering functions (where possible):

   Start location: start

    191: f26 -> f42 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    193: f26 -> f42 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    195: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    196: f26 -> f42 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    201: f26 -> f42 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    202: f26 -> f100 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3

    203: f26 -> f100 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    207: f42 -> f42 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: 1-L+A

    212: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_5, [ A>=1+L && 0>=1+free_5 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    214: f42 -> f42 : H'=free_44, K'=1+A, L'=1+L, M'=free_6, [ A>=1+L && free_6>=1 && A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 ], cost: 5-3*K+3*A

    215: f42 -> f42 : H'=free_44, K'=1+A, L'=A, M'=0, [ A>=K && B>=1+A && 0>=free_43*free_42 && free_43*free_42+free_42>=1 && free_42>=free_44 && 0>=free_43*free_45 && free_43*free_45+free_45>=1 && free_44>=free_45 && A>=2+L ], cost: 4-3*K-L+4*A

    216: f42 -> f152 : [ L>=A && B>=1+A ], cost: 2

    217: f42 -> f152 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4

    218: f42 -> f152 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

    189: f100 -> f152 : Z'=0, [ B>=1+A && Z==0 ], cost: 5

    219: f152 -> f184 : Y'=free_35, [ B>=1+A && 0>=B ], cost: 3

    220: f152 -> f184 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6-K+B

    221: f152 -> f184 : B'=1+A, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A

    222: f152 -> f184 : B'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B

    223: f152 -> f184 : B'=1+A, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A

    188: f184 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3

    224: f184 -> f26 : C'=0, J'=1+J, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 3

    225: f184 -> f26 : C'=0, J'=1+J, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 3

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

    191: f26 -> f42 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    193: f26 -> f42 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    195: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    196: f26 -> f42 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    201: f26 -> f42 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    202: f26 -> f100 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3

    203: f26 -> f100 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    226: f26 -> f42 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    216: f42 -> f152 : [ L>=A && B>=1+A ], cost: 2

    217: f42 -> f152 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4

    218: f42 -> f152 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A

     64: f100 -> f152 : [ B>=1+A && 0>=1+Z ], cost: 1

     65: f100 -> f152 : [ B>=1+A && Z>=1 ], cost: 1

    189: f100 -> f152 : Z'=0, [ B>=1+A && Z==0 ], cost: 5

    219: f152 -> f184 : Y'=free_35, [ B>=1+A && 0>=B ], cost: 3

    220: f152 -> f184 : B'=-1+B, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6-K+B

    221: f152 -> f184 : B'=1+A, H'=-free_20*(-1+K-B)*free_19+H, K'=1+B, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A

    222: f152 -> f184 : B'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B

    223: f152 -> f184 : B'=1+A, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A

    188: f184 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3

    224: f184 -> f26 : C'=0, J'=1+J, X'=free_33, [ B>=1+A && 0>=1+free_33 ], cost: 3

    225: f184 -> f26 : C'=0, J'=1+J, X'=free_34, [ B>=1+A && free_34>=1 ], cost: 3

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

    227: f26 -> f152 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 4-L+A

    228: f26 -> f152 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 4-L+A

    229: f26 -> f152 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    230: f26 -> f152 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    231: f26 -> f152 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 6-2*B-L+3*A

    232: f26 -> f152 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    237: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B-L+3*A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    239: f26 -> f152 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 4

    240: f26 -> f152 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 5-B+A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    242: f152 -> f26 : C'=0, Q'=0, J'=1+J, X'=0, Y'=free_35, [ B>=1+A && 0>=B ], cost: 6

    243: f152 -> f26 : C'=0, J'=1+J, X'=free_33, Y'=free_35, [ B>=1+A && 0>=B && 0>=1+free_33 ], cost: 6

    244: f152 -> f26 : C'=0, J'=1+J, X'=free_34, Y'=free_35, [ B>=1+A && 0>=B && free_34>=1 ], cost: 6

    245: f152 -> f26 : B'=-1+B, C'=0, H'=-free_20*(-1+K-B)*free_19+H, Q'=0, J'=1+J, K'=1+B, X'=0, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 9-K+B

    246: f152 -> f26 : B'=-1+B, C'=0, H'=-free_20*(-1+K-B)*free_19+H, J'=1+J, K'=1+B, X'=free_33, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && 0>=1+free_33 ], cost: 9-K+B

    247: f152 -> f26 : B'=-1+B, C'=0, H'=-free_20*(-1+K-B)*free_19+H, J'=1+J, K'=1+B, X'=free_34, Y'=free_35, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && free_34>=1 ], cost: 9-K+B

    248: f152 -> f26 : B'=1+A, C'=0, H'=-free_20*(-1+K-B)*free_19+H, Q'=0, J'=1+J, K'=1+B, X'=0, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 11-K+A

    249: f152 -> f26 : B'=1+A, C'=0, H'=-free_20*(-1+K-B)*free_19+H, J'=1+J, K'=1+B, X'=free_33, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B && 0>=1+free_33 ], cost: 11-K+A

    250: f152 -> f26 : B'=1+A, C'=0, H'=-free_20*(-1+K-B)*free_19+H, J'=1+J, K'=1+B, X'=free_34, Y'=free_35, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B && free_34>=1 ], cost: 11-K+A

    251: f152 -> f26 : B'=0, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 6+2*B

    252: f152 -> f26 : B'=0, C'=0, J'=1+J, X'=free_33, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 6+2*B

    253: f152 -> f26 : B'=0, C'=0, J'=1+J, X'=free_34, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 6+2*B

    254: f152 -> f26 : B'=1+A, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 7+2*B+A

    255: f152 -> f26 : B'=1+A, C'=0, J'=1+J, X'=free_33, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 7+2*B+A

    256: f152 -> f26 : B'=1+A, C'=0, J'=1+J, X'=free_34, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 7+2*B+A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Applied pruning (of leafs and parallel rules):

   Start location: start

    227: f26 -> f152 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 4-L+A

    228: f26 -> f152 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 4-L+A

    229: f26 -> f152 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    230: f26 -> f152 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    232: f26 -> f152 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    251: f152 -> f26 : B'=0, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 6+2*B

    252: f152 -> f26 : B'=0, C'=0, J'=1+J, X'=free_33, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 6+2*B

    253: f152 -> f26 : B'=0, C'=0, J'=1+J, X'=free_34, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 6+2*B

    255: f152 -> f26 : B'=1+A, C'=0, J'=1+J, X'=free_33, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 7+2*B+A

    256: f152 -> f26 : B'=1+A, C'=0, J'=1+J, X'=free_34, Y'=free_35, [ B>=1+A && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 7+2*B+A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    257: f26 -> f26 : B'=0, C'=0, Q'=0, J'=1+J, L'=A, M'=0, X'=0, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A ], cost: 10+2*B-L+A

    258: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 10+2*B-L+A

    259: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 10+2*B-L+A

    260: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 11+2*B-L+2*A

    261: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    262: f26 -> f26 : B'=0, C'=0, Q'=0, J'=1+J, L'=A, M'=0, X'=0, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A ], cost: 10+2*B-L+A

    263: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 10+2*B-L+A

    264: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 10+2*B-L+A

    265: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 11+2*B-L+2*A

    266: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    267: f26 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    268: f26 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    269: f26 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Applied pruning (of leafs and parallel rules):

   Start location: start

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    258: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 10+2*B-L+A

    260: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 11+2*B-L+2*A

    261: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    264: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 10+2*B-L+A

    266: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    267: f26 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    268: f26 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    269: f26 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Accelerating simple loops of location 2.

   Accelerating the following rules:

    258: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 10+2*B-L+A

    260: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 11+2*B-L+2*A

    261: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    264: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 10+2*B-L+A

    266: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A



   Found no metering function for rule 258.

   Found no metering function for rule 260.

   Found no metering function for rule 261.

   Found no metering function for rule 264.

   Found no metering function for rule 266.

   Removing the simple loops:.



Accelerated all simple loops using metering functions (where possible):

   Start location: start

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    258: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_33 ], cost: 10+2*B-L+A

    260: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_33, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_33 ], cost: 11+2*B-L+2*A

    261: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    264: f26 -> f26 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 10+2*B-L+A

    266: f26 -> f26 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 11+2*B-L+2*A

    267: f26 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    268: f26 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    269: f26 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

    233: f26 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    234: f26 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2-L+A

    235: f26 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K-L+2*A

    236: f26 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A

    238: f26 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K-L+2*A

    241: f26 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A

    267: f26 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K-L+2*A

    268: f26 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A

    269: f26 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K-L+2*A

    129: start -> f26 : Q'=1, [ B>=1+A && C>=0 ], cost: 3

    130: start -> f26 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    131: start -> f26 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 ], cost: 4-B+A

    270: start -> f26 : B'=0, C'=0, Q'=1, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 13+2*B-L+A

    271: start -> f26 : B'=1+A, C'=0, Q'=1, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 14+2*B-L+2*A

    272: start -> f26 : B'=1+A, C'=0, D'=free, Q'=1, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A

    273: start -> f26 : B'=1+A, C'=0, D'=1+free_2, E'=free_2, Q'=1, J'=1+J, L'=A, M'=0, X'=free_34, Y'=free_35, [ A>=B && free_2>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A



Eliminated locations (on tree-shaped paths):

   Start location: start

    274: start -> [65] : Q'=1, [ B>=1+A && C>=0 && 200>=J && A>=1+L ], cost: 5-L+A

    275: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    276: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    277: start -> [69] : [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    278: start -> [69] : [ A>=B && free_2>=0 ], cost: 4-B+A

    279: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 13+2*B-L+A

    280: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 14+2*B-L+2*A

    281: start -> [69] : [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A

    282: start -> [69] : [ A>=B && free_2>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A



Applied pruning (of leafs and parallel rules):

   Start location: start

    274: start -> [65] : Q'=1, [ B>=1+A && C>=0 && 200>=J && A>=1+L ], cost: 5-L+A

    275: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    276: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    277: start -> [69] : [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    279: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 13+2*B-L+A

    280: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 14+2*B-L+2*A

    281: start -> [69] : [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A

    282: start -> [69] : [ A>=B && free_2>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: start

    274: start -> [65] : Q'=1, [ B>=1+A && C>=0 && 200>=J && A>=1+L ], cost: 5-L+A

    275: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    276: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=0 && 200>=J && A>=1+L ], cost: 6-B-L+2*A

    277: start -> [69] : [ A>=B && C>=free && C>=0 ], cost: 4-B+A

    279: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && free_34>=1 ], cost: 13+2*B-L+A

    280: start -> [69] : [ B>=1+A && C>=0 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && free_34>=1 ], cost: 14+2*B-L+2*A

    281: start -> [69] : [ A>=B && C>=free && C>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A

    282: start -> [69] : [ A>=B && free_2>=0 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && free_34>=1 ], cost: 17-B-L+5*A



Computing asymptotic complexity for rule 274

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      -L+A (+/+!), B-A (+/+!), 1+C (+/+!), 201-J (+/+!), 5-L+A (+) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {B==0,L==-n,A==-1,C==n,J==-n}

      resulting limit problem:

      [solved]



   Solution:

      B / 0

      L / -n

      A / -1

      C / n

      J / -n

   Resulting cost 4+n has complexity: Poly(n^1)



Found new complexity Poly(n^1).



Obtained the following overall complexity (w.r.t. the length of the input n):

   Complexity:  Poly(n^1)

   Cpx degree:  1

   Solved cost: 4+n

   Rule cost:   5-L+A

   Rule guard:  [ B>=1+A && C>=0 && 200>=J && A>=1+L ]



WORST_CASE(Omega(n^1),?)


----------------------------------------

(2)
BOUNDS(n^1, INF)