6.62/4.38 WORST_CASE(?, O(n^1)) 6.62/4.39 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 6.62/4.39 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 6.62/4.39 6.62/4.39 6.62/4.39 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, max(5 + -1 * Arg_0 + 2 * Arg_2 + -1 * Arg_4, 6)). 6.62/4.39 6.62/4.39 (0) CpxIntTrs 6.62/4.39 (1) Koat2 Proof [FINISHED, 2468 ms] 6.62/4.39 (2) BOUNDS(1, max(5 + -1 * Arg_0 + 2 * Arg_2 + -1 * Arg_4, 6)) 6.62/4.39 6.62/4.39 6.62/4.39 ---------------------------------------- 6.62/4.39 6.62/4.39 (0) 6.62/4.39 Obligation: 6.62/4.39 Complexity Int TRS consisting of the following rules: 6.62/4.39 start(A, B, C, D, E, F, G, H) -> Com_1(stop(A, B, C, D, E, F, G, H)) :|: A >= 101 && B >= C && B <= C && D >= E && D <= E && F >= A && F <= A && G >= H && G <= H 6.62/4.39 start(A, B, C, D, E, F, G, H) -> Com_1(stop(A, B, C, D, E, F, G, H)) :|: E >= C + 1 && B >= C && B <= C && D >= E && D <= E && F >= A && F <= A && G >= H && G <= H 6.62/4.39 start(A, B, C, D, E, F, G, H) -> Com_1(lbl72(A, B - 1, C, 1 + F, E, D, F, H)) :|: C >= E && 100 >= A && B >= C && B <= C && D >= E && D <= E && F >= A && F <= A && G >= H && G <= H 6.62/4.39 lbl72(A, B, C, D, E, F, G, H) -> Com_1(stop(A, B, C, D, E, F, G, H)) :|: F >= 101 && 100 >= A && 101 + F + B >= A + E + C && B + 1 >= F && C >= 1 + B && C >= E && G + 1 + F + B >= A + E + C && G + 1 + F + B <= A + E + C && D + F + B >= A + E + C && D + F + B <= A + E + C 6.62/4.39 lbl72(A, B, C, D, E, F, G, H) -> Com_1(stop(A, B, C, D, E, F, G, H)) :|: A + E + C >= F + 2 * B + 1 && 100 >= A && 101 + F + B >= A + E + C && B + 1 >= F && C >= 1 + B && C >= E && G + 1 + F + B >= A + E + C && G + 1 + F + B <= A + E + C && D + F + B >= A + E + C && D + F + B <= A + E + C 6.62/4.39 lbl72(A, B, C, D, E, F, G, H) -> Com_1(lbl72(A, B - 1, C, 1 + F, E, D, F, H)) :|: 2 * B + F >= A + E + C && 100 >= F && 100 >= A && 101 + F + B >= A + E + C && B + 1 >= F && C >= 1 + B && C >= E && G + 1 + F + B >= A + E + C && G + 1 + F + B <= A + E + C && D + F + B >= A + E + C && D + F + B <= A + E + C 6.62/4.39 start0(A, B, C, D, E, F, G, H) -> Com_1(start(A, C, C, E, E, A, H, H)) :|: TRUE 6.62/4.39 6.62/4.39 The start-symbols are:[start0_8] 6.62/4.39 6.62/4.39 6.62/4.39 ---------------------------------------- 6.62/4.39 6.62/4.39 (1) Koat2 Proof (FINISHED) 6.62/4.39 YES( ?, max([6, 6+-1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)}) 6.62/4.39 6.62/4.39 6.62/4.39 6.62/4.39 Initial Complexity Problem: 6.62/4.39 6.62/4.39 Start: start0 6.62/4.39 6.62/4.39 Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7 6.62/4.39 6.62/4.39 Temp_Vars: 6.62/4.39 6.62/4.39 Locations: lbl72, start, start0, stop 6.62/4.39 6.62/4.39 Transitions: 6.62/4.39 6.62/4.39 lbl72(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> lbl72(Arg_0,Arg_1-1,Arg_2,1+Arg_5,Arg_4,Arg_3,Arg_5,Arg_7):|:Arg_6 <= 100 && 1+Arg_6 <= Arg_3 && Arg_3+Arg_6 <= 201 && Arg_0+Arg_6 <= 200 && Arg_3 <= 1+Arg_6 && Arg_4 <= Arg_2 && Arg_3 <= 101 && Arg_0+Arg_3 <= 201 && 1+Arg_1 <= Arg_2 && Arg_0 <= 100 && Arg_0+Arg_4+Arg_2 <= (2)*Arg_1+Arg_5 && Arg_5 <= 100 && Arg_0 <= 100 && Arg_0+Arg_4+Arg_2 <= 101+Arg_5+Arg_1 && Arg_5 <= Arg_1+1 && 1+Arg_1 <= Arg_2 && Arg_4 <= Arg_2 && Arg_6+1+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_6+1+Arg_5+Arg_1 && Arg_3+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_3+Arg_5+Arg_1 6.62/4.39 6.62/4.39 lbl72(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> stop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7):|:Arg_6 <= 100 && 1+Arg_6 <= Arg_3 && Arg_3+Arg_6 <= 201 && Arg_0+Arg_6 <= 200 && Arg_3 <= 1+Arg_6 && Arg_4 <= Arg_2 && Arg_3 <= 101 && Arg_0+Arg_3 <= 201 && 1+Arg_1 <= Arg_2 && Arg_0 <= 100 && 101 <= Arg_5 && Arg_0 <= 100 && Arg_0+Arg_4+Arg_2 <= 101+Arg_5+Arg_1 && Arg_5 <= Arg_1+1 && 1+Arg_1 <= Arg_2 && Arg_4 <= Arg_2 && Arg_6+1+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_6+1+Arg_5+Arg_1 && Arg_3+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_3+Arg_5+Arg_1 6.62/4.39 6.62/4.39 lbl72(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> stop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7):|:Arg_6 <= 100 && 1+Arg_6 <= Arg_3 && Arg_3+Arg_6 <= 201 && Arg_0+Arg_6 <= 200 && Arg_3 <= 1+Arg_6 && Arg_4 <= Arg_2 && Arg_3 <= 101 && Arg_0+Arg_3 <= 201 && 1+Arg_1 <= Arg_2 && Arg_0 <= 100 && Arg_5+(2)*Arg_1+1 <= Arg_0+Arg_4+Arg_2 && Arg_0 <= 100 && Arg_0+Arg_4+Arg_2 <= 101+Arg_5+Arg_1 && Arg_5 <= Arg_1+1 && 1+Arg_1 <= Arg_2 && Arg_4 <= Arg_2 && Arg_6+1+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_6+1+Arg_5+Arg_1 && Arg_3+Arg_5+Arg_1 <= Arg_0+Arg_4+Arg_2 && Arg_0+Arg_4+Arg_2 <= Arg_3+Arg_5+Arg_1 6.62/4.39 6.62/4.39 start(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> lbl72(Arg_0,Arg_1-1,Arg_2,1+Arg_5,Arg_4,Arg_3,Arg_5,Arg_7):|:Arg_7 <= Arg_6 && Arg_6 <= Arg_7 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_4 <= Arg_3 && Arg_3 <= Arg_4 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && Arg_4 <= Arg_2 && Arg_0 <= 100 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_4 && Arg_4 <= Arg_3 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_6 <= Arg_7 && Arg_7 <= Arg_6 6.62/4.39 6.62/4.39 start(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> stop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7):|:Arg_7 <= Arg_6 && Arg_6 <= Arg_7 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_4 <= Arg_3 && Arg_3 <= Arg_4 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && 101 <= Arg_0 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_4 && Arg_4 <= Arg_3 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_6 <= Arg_7 && Arg_7 <= Arg_6 6.62/4.39 6.62/4.39 start(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> stop(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7):|:Arg_7 <= Arg_6 && Arg_6 <= Arg_7 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_4 <= Arg_3 && Arg_3 <= Arg_4 && Arg_2 <= Arg_1 && Arg_1 <= Arg_2 && Arg_2+1 <= Arg_4 && Arg_1 <= Arg_2 && Arg_2 <= Arg_1 && Arg_3 <= Arg_4 && Arg_4 <= Arg_3 && Arg_5 <= Arg_0 && Arg_0 <= Arg_5 && Arg_6 <= Arg_7 && Arg_7 <= Arg_6 6.62/4.39 6.62/4.39 start0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> start(Arg_0,Arg_2,Arg_2,Arg_4,Arg_4,Arg_0,Arg_7,Arg_7):|: 6.62/4.39 6.62/4.39 6.62/4.39 6.62/4.39 Timebounds: 6.62/4.39 6.62/4.39 Overall timebound: max([6, 6+-1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72: max([0, -1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)} 6.62/4.39 6.62/4.39 0: start->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 1: start->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 2: start->lbl72: 1 {O(1)} 6.62/4.39 6.62/4.39 6: start0->start: 1 {O(1)} 6.62/4.39 6.62/4.39 6.62/4.39 6.62/4.39 Costbounds: 6.62/4.39 6.62/4.39 Overall costbound: max([6, 6+-1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72: max([0, -1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)} 6.62/4.39 6.62/4.39 0: start->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 1: start->stop: 1 {O(1)} 6.62/4.39 6.62/4.39 2: start->lbl72: 1 {O(1)} 6.62/4.39 6.62/4.39 6: start0->start: 1 {O(1)} 6.62/4.39 6.62/4.39 6.62/4.39 6.62/4.39 Sizebounds: 6.62/4.39 6.62/4.39 `Lower: 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_1: 100 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_2: 101 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_3: min([Arg_4, -(-1-Arg_0)]) {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_5: 101 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_6: min([Arg_0, min([Arg_4, min([Arg_4, -(-1-Arg_0)])])]) {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_1: min([-(1-Arg_2), -(1+-(Arg_2)+max([0, -1+-(Arg_4)-Arg_0+2*Arg_2]))]) {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_3: min([Arg_4, -(-1-Arg_0)]) {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_5: min([Arg_4, min([Arg_4, -(-1-Arg_0)])]) {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_6: min([Arg_0, min([Arg_4, min([Arg_4, -(-1-Arg_0)])])]) {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_1: -1+Arg_2-max([0, -1+-(Arg_4)-Arg_0+2*Arg_2]) {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_3: min([Arg_4, -(-1-Arg_0)]) {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_5: min([Arg_4, -(-1-Arg_0)]) {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_6: min([Arg_4, min([Arg_4, -(-1-Arg_0)])]) {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_0: 101 {O(1)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_5: 101 {O(1)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_5: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_1: -1+Arg_2 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_3: 1+Arg_0 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_5: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_6: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_5: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 `Upper: 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_0: 100 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_1: -1+Arg_2 {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_3: 101 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_5: max([101, Arg_4]) {O(n)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_6: 100 {O(1)} 6.62/4.39 6.62/4.39 3: lbl72->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_0: 100 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_1: 100 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_3: 101 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_5: 101 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_6: 100 {O(1)} 6.62/4.39 6.62/4.39 4: lbl72->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_0: 100 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_1: -1+Arg_2 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_3: 101 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_5: 101 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_6: 100 {O(1)} 6.62/4.39 6.62/4.39 5: lbl72->lbl72, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_5: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 0: start->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_5: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 1: start->stop, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_0: 100 {O(1)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_1: -1+Arg_2 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_3: 101 {O(1)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_5: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_6: 100 {O(1)} 6.62/4.39 6.62/4.39 2: start->lbl72, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_0: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_1: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_2: Arg_2 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_3: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_4: Arg_4 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_5: Arg_0 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_6: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 6: start0->start, Arg_7: Arg_7 {O(n)} 6.62/4.39 6.62/4.39 6.62/4.39 ---------------------------------------- 6.62/4.39 6.62/4.39 (2) 6.62/4.39 BOUNDS(1, max(5 + -1 * Arg_0 + 2 * Arg_2 + -1 * Arg_4, 6)) 6.75/4.41 EOF