/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), O(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, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 307 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 3956 ms] (4) 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) -> Com_1(f5(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= 2 f5(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f9(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= B + 1 f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f9(A, B, C, D + 1, C, S, S, H, I, J, K, L, M, N, O, P, Q, R)) :|: C >= 1 + S && A >= D f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f9(A, B, S, D + 1, C, S, S, H, I, J, K, L, M, N, O, P, Q, R)) :|: S >= C && A >= D f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f26(A, B, C, D + 1, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= D f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f32(A, B, C, D + 1, E, F, G, 0, 0, J, K, L, M, N, O, P, Q, R)) :|: A >= D f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f32(A, B, C, D + 1, E, F, G, S, T, J + T, K, L, M, N, O, P, Q, R)) :|: 0 >= S + 1 && A >= D f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f32(A, B, C, D + 1, E, F, G, S, T, J + T, K, L, M, N, O, P, Q, R)) :|: S >= 1 && A >= D f52(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f55(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= K f55(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f55(A, B, C, D + 1, E, F, G, H, I, S, K, L, M, N, O, P, Q, R)) :|: A >= D f62(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f62(A, B, C, D + 1, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: A >= D f62(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f52(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R)) :|: D >= 1 + A f55(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f62(A, B, C, D, E, F, G, H, I, J, K, S, M, N, O, P, Q, R)) :|: D >= 1 + A f52(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f5(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: K >= 1 + A f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f52(A, B, C, D, E, F, G, H, I, J, K, L, S, T, T, P, Q, R)) :|: U >= 0 && D >= 1 + A f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f52(A, B, C, D, E, F, G, H, I, J, K, L, M, N, -(S), T, S, R)) :|: 0 >= U + 1 && D >= 1 + A f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f32(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: D >= 1 + A f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f5(A, B + 1, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, 0)) :|: D >= 1 + A && C >= 0 && C <= 0 f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: 0 >= C + 1 && D >= 1 + A f9(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: C >= 1 && D >= 1 + A f5(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= A && 0 >= S + 1 f5(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= A && S >= 1 f5(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R)) :|: B >= A The start-symbols are:[f2_18] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 37*Ar_0 + 3*Ar_10 + 32*Ar_3 + 2*Ar_1 + 39) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= 2 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_2, Fresh_11, Fresh_11, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_2, Fresh_10, Fresh_10, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, 0, 0, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, Fresh_8, Fresh_9, Ar_9 + Fresh_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ 0 >= Fresh_8 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, Fresh_6, Fresh_7, Ar_9 + Fresh_7, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Fresh_6 >= 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Fresh_5, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10 + 1, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Fresh_4, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Fresh_2, Fresh_3, Fresh_3, Ar_15, Ar_16, Ar_17)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, -Fresh_0, Fresh_1, Fresh_0, Ar_17)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, 0)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5, Ar_6, Ar_7, Ar_8, Ar_9, Ar_10, Ar_11, Ar_12, Ar_13, Ar_14, Ar_15, Ar_16, Ar_17)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0, Ar_1, Ar_2, Ar_3, Ar_10]. We thus obtain the following problem: 2: T: (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Fresh_6 >= 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ 0 >= Fresh_8 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 2: f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Fresh_6 >= 1 /\ Ar_0 >= Ar_3 ] f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ 0 >= Fresh_8 + 1 /\ Ar_0 >= Ar_3 ] f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] We thus obtain the following problem: 3: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: ?, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 3 produces the following problem: 4: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f62) = 1 Pol(f52) = 1 Pol(f55) = 1 Pol(f5) = 1 Pol(f32) = 1 Pol(f26) = 1 Pol(f9) = 1 Pol(f1) = 0 Pol(f2) = 1 Pol(koat_start) = 1 orients all transitions weakly and the transitions f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] strictly and produces the following problem: 5: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f62) = V_1 - V_4 + 1 Pol(f52) = V_1 - V_4 + 1 Pol(f55) = V_1 - V_4 + 1 Pol(f5) = V_1 - V_4 + 1 Pol(f32) = V_1 - V_4 + 1 Pol(f26) = V_1 - V_4 + 1 Pol(f9) = V_1 - V_4 + 1 Pol(f1) = V_1 - V_4 Pol(f2) = V_1 - V_4 + 1 Pol(koat_start) = V_1 - V_4 + 1 orients all transitions weakly and the transitions f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] strictly and produces the following problem: 6: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 6 produces the following problem: 7: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f9) = 0 Pol(f5) = 0 Pol(f62) = 1 Pol(f52) = 1 Pol(f55) = 1 and size complexities S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ]", 0-0) = Ar_0 S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ]", 0-1) = Ar_1 S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ]", 0-2) = Ar_2 S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ]", 0-3) = Ar_3 S("koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ]", 0-4) = Ar_10 S("f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ]", 0-0) = Ar_0 S("f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ]", 0-1) = Ar_1 S("f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ]", 0-2) = Ar_2 S("f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ]", 0-3) = Ar_3 S("f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ]", 0-4) = Ar_10 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ]", 0-0) = Ar_0 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ]", 0-1) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ]", 0-2) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 192 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ]", 0-4) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ S >= 1 ]", 0-0) = Ar_0 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ S >= 1 ]", 0-1) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ S >= 1 ]", 0-2) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ S >= 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 192 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ S >= 1 ]", 0-4) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ 0 >= S + 1 ]", 0-0) = Ar_0 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ 0 >= S + 1 ]", 0-1) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ 0 >= S + 1 ]", 0-2) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ 0 >= S + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 192 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\\ 0 >= S + 1 ]", 0-4) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ]", 0-0) = Ar_0 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ]", 0-1) = ? S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ]", 0-2) = 0 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ]", 0-4) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\\ Ar_2 = 0 ]", 0-0) = Ar_0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\\ Ar_2 = 0 ]", 0-1) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\\ Ar_2 = 0 ]", 0-2) = 0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\\ Ar_2 = 0 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\\ Ar_2 = 0 ]", 0-4) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\\ Ar_0 >= Ar_3 ]", 0-0) = Ar_0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\\ Ar_0 >= Ar_3 ]", 0-1) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\\ Ar_0 >= Ar_3 ]", 0-2) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\\ Ar_0 >= Ar_3 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\\ Ar_0 >= Ar_3 ]", 0-4) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\\ Ar_0 >= Ar_3 ]", 0-0) = Ar_0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\\ Ar_0 >= Ar_3 ]", 0-1) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\\ Ar_0 >= Ar_3 ]", 0-2) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\\ Ar_0 >= Ar_3 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\\ Ar_0 >= Ar_3 ]", 0-4) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\\ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\\ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\\ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\\ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\\ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\\ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ]", 0-1) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ]", 0-2) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ]", 0-4) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ]", 0-0) = Ar_0 S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ]", 0-1) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ]", 0-2) = ? S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ]", 0-4) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ]", 0-0) = Ar_0 S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ]", 0-1) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ]", 0-2) = ? S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ]", 0-4) = ? S("f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ]", 0-0) = Ar_0 S("f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ]", 0-1) = ? S("f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ]", 0-2) = ? S("f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ]", 0-3) = 4*Ar_0 + 4*Ar_3 + 48 S("f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ]", 0-4) = ? orients the transitions f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] weakly and the transition f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] strictly and produces the following problem: 8: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: ?, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: 9*Ar_0 + 9*Ar_3 + 9, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f62) = V_1 - V_5 Pol(f52) = V_1 - V_5 + 1 Pol(f55) = V_1 - V_5 Pol(f5) = V_1 - V_5 + 1 Pol(f32) = V_1 - V_5 + 1 Pol(f26) = V_1 - V_5 + 1 Pol(f9) = V_1 - V_5 + 1 Pol(f1) = V_1 - V_5 Pol(f2) = V_1 - V_5 + 1 Pol(koat_start) = V_1 - V_5 + 1 orients all transitions weakly and the transition f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] strictly and produces the following problem: 9: T: (Comp: ?, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_10 + 1, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: 9*Ar_0 + 9*Ar_3 + 9, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 9 produces the following problem: 10: T: (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_10 + 1, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: 9*Ar_0 + 9*Ar_3 + 9, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: ?, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 A polynomial rank function with Pol(f62) = V_1 - V_2 - 1 Pol(f52) = V_1 - V_2 - 1 Pol(f55) = V_1 - V_2 - 1 Pol(f5) = V_1 - V_2 Pol(f32) = V_1 - V_2 - 1 Pol(f26) = V_1 - V_2 - 1 Pol(f9) = V_1 - V_2 - 1 Pol(f1) = V_1 - V_2 Pol(f2) = V_1 - V_2 Pol(koat_start) = V_1 - V_2 orients all transitions weakly and the transition f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] strictly and produces the following problem: 11: T: (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_10 + 1, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: 9*Ar_0 + 9*Ar_3 + 9, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: ?, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: Ar_0 + Ar_1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 11 produces the following problem: 12: T: (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10 + 1)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_0 >= Ar_3 ] (Comp: 2*Ar_0 + Ar_10 + Ar_3 + 2, Cost: 1) f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f62(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_10 + 1, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f55(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= Ar_10 ] (Comp: 9*Ar_0 + 9*Ar_3 + 9, Cost: 1) f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_10)) [ Ar_10 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ U >= 0 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f52(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= U + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 4*Ar_0 + 4*Ar_3 + 4, Cost: 1) f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f32(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 >= Ar_2 + 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: 2*Ar_0 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f26(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_2 >= 1 /\ Ar_3 >= Ar_0 + 1 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Ar_2, Ar_3 + 1, Ar_10)) [ Ar_2 >= Fresh_11 + 1 /\ Ar_0 >= Ar_3 ] (Comp: Ar_0 + Ar_3 + 1, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, Fresh_10, Ar_3 + 1, Ar_10)) [ Fresh_10 >= Ar_2 /\ Ar_0 >= Ar_3 ] (Comp: 3*Ar_0 + Ar_1 + 2*Ar_3 + 2, Cost: 1) f9(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1 + 1, 0, Ar_3, Ar_10)) [ Ar_3 >= Ar_0 + 1 /\ Ar_2 = 0 ] (Comp: Ar_0 + Ar_1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f9(Ar_0, Ar_1, 0, Ar_3, Ar_10)) [ Ar_0 >= Ar_1 + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ 0 >= S + 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 /\ S >= 1 ] (Comp: 1, Cost: 1) f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_1 >= Ar_0 ] (Comp: 1, Cost: 1) f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ Ar_0 >= 2 ] (Comp: 1, Cost: 0) koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10) -> Com_1(f2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_10)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Complexity upper bound 37*Ar_0 + 3*Ar_10 + 32*Ar_3 + 2*Ar_1 + 39 Time: 0.308 sec (SMT: 0.212 sec) ---------------------------------------- (2) BOUNDS(1, n^1) ---------------------------------------- (3) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 20: f5 -> f1 : [ B>=A && 0>=1+free_14 ], cost: 1 21: f5 -> f1 : [ B>=A && free_15>=1 ], cost: 1 22: f5 -> f1 : [ B>=A ], cost: 1 2: f9 -> f9 : D'=1+D, E'=C, F'=free, G'=free, [ C>=1+free && A>=D ], cost: 1 3: f9 -> f9 : C'=free_1, D'=1+D, E'=C, F'=free_1, G'=free_1, [ free_1>=C && A>=D ], cost: 1 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 4: f26 -> f26 : D'=1+D, [ A>=D ], cost: 1 16: f26 -> f32 : [ D>=1+A ], cost: 1 5: f32 -> f32 : D'=1+D, H'=0, Q'=0, [ A>=D ], cost: 1 6: f32 -> f32 : D'=1+D, H'=free_2, Q'=free_3, J'=J+free_3, [ 0>=1+free_2 && A>=D ], cost: 1 7: f32 -> f32 : D'=1+D, H'=free_4, Q'=free_5, J'=J+free_5, [ free_4>=1 && A>=D ], cost: 1 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ free_10>=0 && D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ 0>=1+free_13 && D>=1+A ], cost: 1 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 9: f55 -> f55 : D'=1+D, J'=free_6, [ A>=D ], cost: 1 12: f55 -> f62 : L'=free_7, [ D>=1+A ], cost: 1 10: f62 -> f62 : D'=1+D, [ A>=D ], cost: 1 11: f62 -> f52 : K'=1+K, [ D>=1+A ], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 0: f2 -> f5 : [ A>=2 ], cost: 1 Removed unreachable and leaf rules: Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 2: f9 -> f9 : D'=1+D, E'=C, F'=free, G'=free, [ C>=1+free && A>=D ], cost: 1 3: f9 -> f9 : C'=free_1, D'=1+D, E'=C, F'=free_1, G'=free_1, [ free_1>=C && A>=D ], cost: 1 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 4: f26 -> f26 : D'=1+D, [ A>=D ], cost: 1 16: f26 -> f32 : [ D>=1+A ], cost: 1 5: f32 -> f32 : D'=1+D, H'=0, Q'=0, [ A>=D ], cost: 1 6: f32 -> f32 : D'=1+D, H'=free_2, Q'=free_3, J'=J+free_3, [ 0>=1+free_2 && A>=D ], cost: 1 7: f32 -> f32 : D'=1+D, H'=free_4, Q'=free_5, J'=J+free_5, [ free_4>=1 && A>=D ], cost: 1 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ free_10>=0 && D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ 0>=1+free_13 && D>=1+A ], cost: 1 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 9: f55 -> f55 : D'=1+D, J'=free_6, [ A>=D ], cost: 1 12: f55 -> f62 : L'=free_7, [ D>=1+A ], cost: 1 10: f62 -> f62 : D'=1+D, [ A>=D ], cost: 1 11: f62 -> f52 : K'=1+K, [ D>=1+A ], cost: 1 Simplified all rules, resulting in: Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 2: f9 -> f9 : D'=1+D, E'=C, F'=free, G'=free, [ C>=1+free && A>=D ], cost: 1 3: f9 -> f9 : C'=free_1, D'=1+D, E'=C, F'=free_1, G'=free_1, [ free_1>=C && A>=D ], cost: 1 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 4: f26 -> f26 : D'=1+D, [ A>=D ], cost: 1 16: f26 -> f32 : [ D>=1+A ], cost: 1 5: f32 -> f32 : D'=1+D, H'=0, Q'=0, [ A>=D ], cost: 1 6: f32 -> f32 : D'=1+D, H'=free_2, Q'=free_3, J'=J+free_3, [ 0>=1+free_2 && A>=D ], cost: 1 7: f32 -> f32 : D'=1+D, H'=free_4, Q'=free_5, J'=J+free_5, [ free_4>=1 && A>=D ], cost: 1 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 1 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 9: f55 -> f55 : D'=1+D, J'=free_6, [ A>=D ], cost: 1 12: f55 -> f62 : L'=free_7, [ D>=1+A ], cost: 1 10: f62 -> f62 : D'=1+D, [ A>=D ], cost: 1 11: f62 -> f52 : K'=1+K, [ D>=1+A ], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 2. Accelerating the following rules: 2: f9 -> f9 : D'=1+D, E'=C, F'=free, G'=free, [ C>=1+free && A>=D ], cost: 1 3: f9 -> f9 : C'=free_1, D'=1+D, E'=C, F'=free_1, G'=free_1, [ free_1>=C && A>=D ], cost: 1 Accelerated rule 2 with metering function 1-D+A, yielding the new rule 23. Accelerated rule 3 with metering function 1-D+A, yielding the new rule 24. Removing the simple loops: 2 3. Accelerating simple loops of location 3. Accelerating the following rules: 4: f26 -> f26 : D'=1+D, [ A>=D ], cost: 1 Accelerated rule 4 with metering function 1-D+A, yielding the new rule 25. Removing the simple loops: 4. Accelerating simple loops of location 4. Accelerating the following rules: 5: f32 -> f32 : D'=1+D, H'=0, Q'=0, [ A>=D ], cost: 1 6: f32 -> f32 : D'=1+D, H'=free_2, Q'=free_3, J'=J+free_3, [ 0>=1+free_2 && A>=D ], cost: 1 7: f32 -> f32 : D'=1+D, H'=free_4, Q'=free_5, J'=J+free_5, [ free_4>=1 && A>=D ], cost: 1 Accelerated rule 5 with metering function 1-D+A, yielding the new rule 26. Accelerated rule 6 with metering function 1-D+A, yielding the new rule 27. Accelerated rule 7 with metering function 1-D+A, yielding the new rule 28. Removing the simple loops: 5 6 7. Accelerating simple loops of location 6. Accelerating the following rules: 9: f55 -> f55 : D'=1+D, J'=free_6, [ A>=D ], cost: 1 Accelerated rule 9 with metering function 1-D+A, yielding the new rule 29. Removing the simple loops: 9. Accelerating simple loops of location 7. Accelerating the following rules: 10: f62 -> f62 : D'=1+D, [ A>=D ], cost: 1 Accelerated rule 10 with metering function 1-D+A, yielding the new rule 30. Removing the simple loops: 10. Accelerated all simple loops using metering functions (where possible): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 23: f9 -> f9 : D'=1+A, E'=C, F'=free, G'=free, [ C>=1+free && A>=D ], cost: 1-D+A 24: f9 -> f9 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ free_1>=C && A>=D ], cost: 1-D+A 16: f26 -> f32 : [ D>=1+A ], cost: 1 25: f26 -> f26 : D'=1+A, [ A>=D ], cost: 1-D+A 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 1 26: f32 -> f32 : D'=1+A, H'=0, Q'=0, [ A>=D ], cost: 1-D+A 27: f32 -> f32 : D'=1+A, H'=free_2, Q'=free_3, J'=-(-1+D-A)*free_3+J, [ 0>=1+free_2 && A>=D ], cost: 1-D+A 28: f32 -> f32 : D'=1+A, H'=free_4, Q'=free_5, J'=J-(-1+D-A)*free_5, [ free_4>=1 && A>=D ], cost: 1-D+A 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 12: f55 -> f62 : L'=free_7, [ D>=1+A ], cost: 1 29: f55 -> f55 : D'=1+A, J'=free_6, [ A>=D ], cost: 1-D+A 11: f62 -> f52 : K'=1+K, [ D>=1+A ], cost: 1 30: f62 -> f62 : D'=1+A, [ A>=D ], cost: 1-D+A Chained accelerated rules (with incoming rules): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 31: f5 -> f9 : C'=0, D'=1+A, E'=0, F'=free, G'=free, [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 32: f5 -> f9 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 16: f26 -> f32 : [ D>=1+A ], cost: 1 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 1 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 33: f52 -> f55 : D'=1+A, J'=free_6, [ A>=K && A>=D ], cost: 2-D+A 12: f55 -> f62 : L'=free_7, [ D>=1+A ], cost: 1 11: f62 -> f52 : K'=1+K, [ D>=1+A ], cost: 1 Eliminated locations (on linear paths): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 1: f5 -> f9 : C'=0, [ A>=1+B ], cost: 1 31: f5 -> f9 : C'=0, D'=1+A, E'=0, F'=free, G'=free, [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 32: f5 -> f9 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 17: f9 -> f5 : B'=1+B, C'=0, R'=0, [ D>=1+A && C==0 ], cost: 1 18: f9 -> f26 : [ 0>=1+C && D>=1+A ], cost: 1 19: f9 -> f26 : [ C>=1 && D>=1+A ], cost: 1 16: f26 -> f32 : [ D>=1+A ], cost: 1 14: f32 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 1 15: f32 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 1 8: f52 -> f55 : [ A>=K ], cost: 1 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 33: f52 -> f55 : D'=1+A, J'=free_6, [ A>=K && A>=D ], cost: 2-D+A 34: f55 -> f52 : K'=1+K, L'=free_7, [ D>=1+A ], cost: 2 Eliminated locations (on tree-shaped paths): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 35: f5 -> f5 : B'=1+B, C'=0, R'=0, [ A>=1+B && D>=1+A ], cost: 2 36: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=1+B && 0>=1+free && A>=D ], cost: 3-D+A 37: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, R'=0, [ A>=1+B && A>=D && free_1==0 ], cost: 3-D+A 38: f5 -> f26 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ A>=1+B && A>=D && free_1>=1 ], cost: 3-D+A 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 41: f26 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 2 42: f26 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 2 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 43: f52 -> f52 : K'=1+K, L'=free_7, [ A>=K && D>=1+A ], cost: 3 44: f52 -> f52 : D'=1+A, J'=free_6, K'=1+K, L'=free_7, [ A>=K && A>=D ], cost: 4-D+A Accelerating simple loops of location 1. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 35: f5 -> f5 : B'=1+B, C'=0, R'=0, [ A>=1+B && D>=1+A ], cost: 2 36: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=1+B && 0>=1+free && A>=D ], cost: 3-D+A 37: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=1+B && A>=D ], cost: 3-D+A Accelerated rule 35 with metering function A-B, yielding the new rule 45. Found no metering function for rule 36. Found no metering function for rule 37. Removing the simple loops: 35. Accelerating simple loops of location 5. Accelerating the following rules: 43: f52 -> f52 : K'=1+K, L'=free_7, [ A>=K && D>=1+A ], cost: 3 44: f52 -> f52 : D'=1+A, J'=free_6, K'=1+K, L'=free_7, [ A>=K && A>=D ], cost: 4-D+A Accelerated rule 43 with metering function 1+A-K, yielding the new rule 46. Found no metering function for rule 44. Removing the simple loops: 43. Accelerated all simple loops using metering functions (where possible): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 36: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=1+B && 0>=1+free && A>=D ], cost: 3-D+A 37: f5 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=1+B && A>=D ], cost: 3-D+A 38: f5 -> f26 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ A>=1+B && A>=D && free_1>=1 ], cost: 3-D+A 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 45: f5 -> f5 : B'=A, C'=0, R'=0, [ A>=1+B && D>=1+A ], cost: 2*A-2*B 41: f26 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 2 42: f26 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 2 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 44: f52 -> f52 : D'=1+A, J'=free_6, K'=1+K, L'=free_7, [ A>=K && A>=D ], cost: 4-D+A 46: f52 -> f52 : K'=1+A, L'=free_7, [ A>=K && D>=1+A ], cost: 3+3*A-3*K Chained accelerated rules (with incoming rules): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 38: f5 -> f26 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, [ A>=1+B && A>=D && free_1>=1 ], cost: 3-D+A 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 41: f26 -> f52 : M'=free_8, N'=free_9, O'=free_9, [ D>=1+A ], cost: 2 42: f26 -> f52 : O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A ], cost: 2 53: f26 -> f52 : K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ D>=1+A && A>=K ], cost: 5+3*A-3*K 54: f26 -> f52 : K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ D>=1+A && A>=K ], cost: 5+3*A-3*K 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 48: f52 -> f5 : B'=2+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ K>=1+A && A>=2+B && 0>=1+free && A>=D ], cost: 4-D+A 50: f52 -> f5 : B'=2+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ K>=1+A && A>=2+B && A>=D ], cost: 4-D+A 52: f52 -> f5 : B'=A, C'=0, R'=0, [ K>=1+A && A>=2+B && D>=1+A ], cost: -1+2*A-2*B Eliminated locations (on tree-shaped paths): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 55: f5 -> f52 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 56: f5 -> f52 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 57: f5 -> f52 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K 58: f5 -> f52 : C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K 13: f52 -> f5 : B'=1+B, [ K>=1+A ], cost: 1 48: f52 -> f5 : B'=2+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ K>=1+A && A>=2+B && 0>=1+free && A>=D ], cost: 4-D+A 50: f52 -> f5 : B'=2+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ K>=1+A && A>=2+B && A>=D ], cost: 4-D+A 52: f52 -> f5 : B'=A, C'=0, R'=0, [ K>=1+A && A>=2+B && D>=1+A ], cost: -1+2*A-2*B Eliminated locations (on tree-shaped paths): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 59: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 60: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 4-D+3*A-2*B 61: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 62: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, R'=0, [ A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 4-D+3*A-2*B 63: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 64: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=D && free_1>=1 && A>=K && A>=2+B ], cost: 7-D+6*A-3*K-2*B 65: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 66: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, R'=0, [ A>=D && free_1>=1 && A>=K && A>=2+B ], cost: 7-D+6*A-3*K-2*B 67: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 68: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 69: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K 70: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K Applied pruning (of leafs and parallel rules): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 59: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 60: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 4-D+3*A-2*B 61: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 63: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 65: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 68: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 70: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K Accelerating simple loops of location 1. Accelerating the following rules: 59: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 60: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 4-D+3*A-2*B 61: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 63: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 65: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K Found no metering function for rule 59. Found no metering function for rule 60. Found no metering function for rule 61. Found no metering function for rule 63. Found no metering function for rule 65. Removing the simple loops:. Accelerated all simple loops using metering functions (where possible): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 59: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 60: f5 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 4-D+3*A-2*B 61: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 6-D+A 63: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 65: f5 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 68: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 70: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K Chained accelerated rules (with incoming rules): Start location: f2 0: f2 -> f5 : [ A>=2 ], cost: 1 47: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=free, G'=free, R'=0, [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 49: f2 -> f5 : B'=1+B, C'=0, D'=1+A, E'=0, F'=0, G'=0, R'=0, [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 51: f2 -> f5 : B'=A, C'=0, R'=0, [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 71: f2 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 72: f2 -> f5 : B'=A, C'=0, D'=1+A, E'=free_1, F'=free_1, G'=free_1, M'=free_8, N'=free_9, O'=free_9, R'=0, [ A>=2 && A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 5-D+3*A-2*B 73: f2 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 74: f2 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, M'=free_8, N'=free_9, O'=free_9, [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K 75: f2 -> f5 : B'=1+B, C'=free_1, D'=1+A, E'=free_1, F'=free_1, G'=free_1, K'=1+A, L'=free_7, O'=-free_11, P'=free_12, Q_1'=free_11, [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K 39: f5 -> [14] : [ A>=1+B && 0>=1+free && A>=D ], cost: 2-D+A 40: f5 -> [14] : [ A>=1+B && free_1>=0 && A>=D ], cost: 2-D+A 68: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 ], cost: 5-D+A 70: f5 -> [17] : [ A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 8-D+4*A-3*K Eliminated locations (on tree-shaped paths): Start location: f2 76: f2 -> [14] : [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 3-D+A 77: f2 -> [14] : [ A>=2 && A>=1+B && free_1>=0 && A>=D ], cost: 3-D+A 78: f2 -> [17] : [ A>=2 && A>=1+B && A>=D && free_1>=1 ], cost: 6-D+A 79: f2 -> [17] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 80: f2 -> [19] : [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 81: f2 -> [19] : [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 82: f2 -> [19] : [ A>=2 && A>=1+B && D>=1+A ], cost: 1+2*A-2*B 83: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 84: f2 -> [19] : [ A>=2 && A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 5-D+3*A-2*B 85: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 86: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K 87: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K Applied pruning (of leafs and parallel rules): Start location: f2 76: f2 -> [14] : [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 3-D+A 77: f2 -> [14] : [ A>=2 && A>=1+B && free_1>=0 && A>=D ], cost: 3-D+A 78: f2 -> [17] : [ A>=2 && A>=1+B && A>=D && free_1>=1 ], cost: 6-D+A 79: f2 -> [17] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 9-D+4*A-3*K 80: f2 -> [19] : [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 81: f2 -> [19] : [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 84: f2 -> [19] : [ A>=2 && A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 5-D+3*A-2*B 85: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 87: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: f2 77: f2 -> [14] : [ A>=2 && A>=1+B && free_1>=0 && A>=D ], cost: 3-D+A 78: f2 -> [17] : [ A>=2 && A>=1+B && A>=D && free_1>=1 ], cost: 6-D+A 80: f2 -> [19] : [ A>=2 && A>=1+B && 0>=1+free && A>=D ], cost: 4-D+A 81: f2 -> [19] : [ A>=2 && A>=1+B && A>=D ], cost: 4-D+A 84: f2 -> [19] : [ A>=2 && A>=D && free_1>=1 && K>=1+A && A>=2+B ], cost: 5-D+3*A-2*B 85: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && K>=1+A ], cost: 7-D+A 87: f2 -> [19] : [ A>=2 && A>=1+B && A>=D && free_1>=1 && A>=K ], cost: 10-D+4*A-3*K Computing asymptotic complexity for rule 77 Solved the limit problem by the following transformations: Created initial limit problem: -1+A (+/+!), A-B (+/+!), 1+free_1 (+/+!), 3-D+A (+), 1-D+A (+/+!) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {free_1==n,D==0,A==n,B==-1+n} resulting limit problem: [solved] Solution: free_1 / n D / 0 A / n B / -1+n Resulting cost 3+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: 3+n Rule cost: 3-D+A Rule guard: [ A>=2 && A>=1+B && free_1>=0 && A>=D ] WORST_CASE(Omega(n^1),?) ---------------------------------------- (4) BOUNDS(n^1, INF)