36.37/30.76 WORST_CASE(Omega(n^1), O(n^2)) 36.37/30.77 proof of /export/starexec/sandbox/benchmark/theBenchmark.koat 36.37/30.77 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 36.37/30.77 36.37/30.77 36.37/30.77 The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^2). 36.37/30.77 36.37/30.77 (0) CpxIntTrs 36.37/30.77 (1) Koat Proof [FINISHED, 692 ms] 36.37/30.77 (2) BOUNDS(1, n^2) 36.37/30.77 (3) Loat Proof [FINISHED, 2817 ms] 36.37/30.77 (4) BOUNDS(n^1, INF) 36.37/30.77 36.37/30.77 36.37/30.77 ---------------------------------------- 36.37/30.77 36.37/30.77 (0) 36.37/30.77 Obligation: 36.37/30.77 Complexity Int TRS consisting of the following rules: 36.37/30.77 evalrealheapsortstep2start(A, B, C, D) -> Com_1(evalrealheapsortstep2entryin(A, B, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2entryin(A, B, C, D) -> Com_1(evalrealheapsortstep2bbin(A, B, C, D)) :|: A >= 3 36.37/30.77 evalrealheapsortstep2entryin(A, B, C, D) -> Com_1(evalrealheapsortstep2returnin(A, B, C, D)) :|: 2 >= A 36.37/30.77 evalrealheapsortstep2bbin(A, B, C, D) -> Com_1(evalrealheapsortstep2bb11in(A, 0, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb11in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb1in(A, B, C, D)) :|: A >= 2 + B 36.37/30.77 evalrealheapsortstep2bb11in(A, B, C, D) -> Com_1(evalrealheapsortstep2returnin(A, B, C, D)) :|: B + 1 >= A 36.37/30.77 evalrealheapsortstep2bb1in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb9in(A, B, 0, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb9in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb2in(A, B, C, D)) :|: A >= B + 3 + 2 * C 36.37/30.77 evalrealheapsortstep2bb9in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb10in(A, B, C, D)) :|: 2 * C + 2 + B >= A 36.37/30.77 evalrealheapsortstep2bb2in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb4in(A, B, C, D)) :|: A >= 2 * C + 3 + B && A <= 2 * C + 3 + B 36.37/30.77 evalrealheapsortstep2bb2in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb3in(A, B, C, D)) :|: A >= B + 4 + 2 * C 36.37/30.77 evalrealheapsortstep2bb2in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb3in(A, B, C, D)) :|: 2 * C + 2 + B >= A 36.37/30.77 evalrealheapsortstep2bb3in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb4in(A, B, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb3in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb5in(A, B, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb4in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb6in(A, B, C, 2 * C + 1)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb5in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb6in(A, B, C, 2 * C + 2)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb6in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb7in(A, B, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb6in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb9in(A, B, A, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb7in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb9in(A, B, D, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2bb10in(A, B, C, D) -> Com_1(evalrealheapsortstep2bb11in(A, B + 1, C, D)) :|: TRUE 36.37/30.77 evalrealheapsortstep2returnin(A, B, C, D) -> Com_1(evalrealheapsortstep2stop(A, B, C, D)) :|: TRUE 36.37/30.77 36.37/30.77 The start-symbols are:[evalrealheapsortstep2start_4] 36.37/30.77 36.37/30.77 36.37/30.77 ---------------------------------------- 36.37/30.77 36.37/30.77 (1) Koat Proof (FINISHED) 36.37/30.77 YES(?, 86*ar_0 + 60*ar_0^2 + 34) 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Initial complexity problem: 36.37/30.77 36.37/30.77 1: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Testing for reachability in the complexity graph removes the following transition from problem 1: 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 We thus obtain the following problem: 36.37/30.77 36.37/30.77 2: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Repeatedly propagating knowledge in problem 2 produces the following problem: 36.37/30.77 36.37/30.77 3: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 A polynomial rank function with 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb7in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb9in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb6in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb5in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb3in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb4in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb10in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb11in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb2in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb1in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2returnin) = 1 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2stop) = 0 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bbin) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2entryin) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2start) = 2 36.37/30.77 36.37/30.77 Pol(koat_start) = 2 36.37/30.77 36.37/30.77 orients all transitions weakly and the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 strictly and produces the following problem: 36.37/30.77 36.37/30.77 4: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 A polynomial rank function with 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb9in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb2in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb10in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb7in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb6in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb5in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb4in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb3in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb1in) = V_1 - V_2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb11in) = V_1 - V_2 + 1 36.37/30.77 36.37/30.77 and size complexities 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-1) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-2) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-2) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 orients the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 weakly and the transition 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 strictly and produces the following problem: 36.37/30.77 36.37/30.77 5: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Repeatedly propagating knowledge in problem 5 produces the following problem: 36.37/30.77 36.37/30.77 6: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 A polynomial rank function with 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb9in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb2in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb10in) = 1 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb7in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb6in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb5in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb4in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb3in) = 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb11in) = 0 36.37/30.77 36.37/30.77 and size complexities 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-1) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3))", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-2) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-2) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-1) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 orients the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 weakly and the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 strictly and produces the following problem: 36.37/30.77 36.37/30.77 7: T: 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Applied AI with 'oct' on problem 7 to obtain the following invariants: 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb10in: X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb11in: X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb1in: X_1 - X_2 - 2 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb2in: X_1 - X_3 - 3 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_1 - X_2 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb3in: X_1 - X_3 - 4 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 4 >= 0 /\ X_1 - X_2 - 4 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 4 >= 0 /\ X_1 - 4 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb4in: X_1 - X_3 - 3 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_1 - X_2 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb5in: X_1 - X_3 - 4 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 4 >= 0 /\ X_1 - X_2 - 4 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 4 >= 0 /\ X_1 - 4 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb6in: X_4 - 1 >= 0 /\ X_3 + X_4 - 1 >= 0 /\ -X_3 + X_4 - 1 >= 0 /\ X_2 + X_4 - 1 >= 0 /\ X_1 + X_4 - 4 >= 0 /\ X_1 - X_3 - 3 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_1 - X_2 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb7in: X_4 - 1 >= 0 /\ X_3 + X_4 - 1 >= 0 /\ -X_3 + X_4 - 1 >= 0 /\ X_2 + X_4 - 1 >= 0 /\ X_1 + X_4 - 4 >= 0 /\ X_1 - X_3 - 3 >= 0 /\ X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_1 - X_2 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bb9in: X_3 >= 0 /\ X_2 + X_3 >= 0 /\ X_1 + X_3 - 3 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 - 3 >= 0 /\ X_1 - 3 >= 0 36.37/30.77 36.37/30.77 For symbol evalrealheapsortstep2bbin: X_1 - 3 >= 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 This yielded the following problem: 36.37/30.77 36.37/30.77 8: T: 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: ?, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 A polynomial rank function with 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb9in) = 6*V_1 - 6*V_3 + 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb2in) = 6*V_1 - 6*V_3 + 1 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb7in) = 6*V_1 - 6*V_3 - 3 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb6in) = 6*V_1 - 6*V_3 - 2 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb5in) = 6*V_1 - 6*V_3 - 1 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb4in) = 6*V_1 - 6*V_3 - 1 36.37/30.77 36.37/30.77 Pol(evalrealheapsortstep2bb3in) = 6*V_1 - 6*V_3 36.37/30.77 36.37/30.77 and size complexities 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\\ ar_2 + ar_3 - 1 >= 0 /\\ -ar_2 + ar_3 - 1 >= 0 /\\ ar_1 + ar_3 - 1 >= 0 /\\ ar_0 + ar_3 - 4 >= 0 /\\ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 4 >= 0 /\\ ar_0 - ar_1 - 4 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 4 >= 0 /\\ ar_0 - 4 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 4 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\\ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_0 - ar_1 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 = 2*ar_2 + ar_1 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ 2*ar_2 + ar_1 + 2 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\\ ar_1 + ar_2 >= 0 /\\ ar_0 + ar_2 - 3 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2*ar_2 + 3 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-2) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\\ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_1 + 1 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_1 + 1 >= ar_0 ]", 0-1) = 2*ar_0 + 16 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_1 + 1 >= ar_0 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_1 + 1 >= ar_0 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2 ]", 0-1) = 2*ar_0 + 8 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2 ]", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\\ ar_0 + ar_1 - 3 >= 0 /\\ ar_0 - 3 >= 0 /\\ ar_0 >= ar_1 + 2 ]", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-1) = 2*ar_0 + 2*ar_1 + 32 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-2) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3))", 0-3) = ? 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ]", 0-1) = 0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3))", 0-3) = ar_3 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-0) = ar_0 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-1) = ar_1 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-2) = ar_2 36.37/30.77 36.37/30.77 S("koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ]", 0-3) = ar_3 36.37/30.77 36.37/30.77 orients the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 weakly and the transitions 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 strictly and produces the following problem: 36.37/30.77 36.37/30.77 9: T: 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3)) [ ar_0 >= 3 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2entryin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 1, Cost: 1) evalrealheapsortstep2bbin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, 0, ar_2, ar_3)) [ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2stop(ar_0, ar_1, ar_2, ar_3)) 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2 ] 36.37/30.77 36.37/30.77 (Comp: 2, Cost: 1) evalrealheapsortstep2bb11in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2returnin(ar_0, ar_1, ar_2, ar_3)) [ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_1 + 1 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: ar_0 + 1, Cost: 1) evalrealheapsortstep2bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, 0, ar_3)) [ ar_0 - ar_1 - 2 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 3 ] 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb9in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ 2*ar_2 + ar_1 + 2 >= ar_0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 = 2*ar_2 + ar_1 + 3 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 /\ ar_0 >= ar_1 + 2*ar_2 + 4 ] 36.37/30.77 36.37/30.77 (Comp: 2*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb10in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb11in(ar_0, ar_1 + 1, ar_2, ar_3)) [ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 1)) [ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb4in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb5in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, 2*ar_2 + 2)) [ ar_0 - ar_2 - 4 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 4 >= 0 /\ ar_0 - ar_1 - 4 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 4 >= 0 /\ ar_0 - 4 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb6in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_0, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 (Comp: 6*ar_0^2 + 8*ar_0 + 2, Cost: 1) evalrealheapsortstep2bb7in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalrealheapsortstep2bb9in(ar_0, ar_1, ar_3, ar_3)) [ ar_3 - 1 >= 0 /\ ar_2 + ar_3 - 1 >= 0 /\ -ar_2 + ar_3 - 1 >= 0 /\ ar_1 + ar_3 - 1 >= 0 /\ ar_0 + ar_3 - 4 >= 0 /\ ar_0 - ar_2 - 3 >= 0 /\ ar_2 >= 0 /\ ar_1 + ar_2 >= 0 /\ ar_0 + ar_2 - 3 >= 0 /\ ar_0 - ar_1 - 3 >= 0 /\ ar_1 >= 0 /\ ar_0 + ar_1 - 3 >= 0 /\ ar_0 - 3 >= 0 ] 36.37/30.77 36.37/30.77 start location: koat_start 36.37/30.77 36.37/30.77 leaf cost: 0 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Complexity upper bound 86*ar_0 + 60*ar_0^2 + 34 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Time: 0.711 sec (SMT: 0.558 sec) 36.37/30.77 36.37/30.77 36.37/30.77 ---------------------------------------- 36.37/30.77 36.37/30.77 (2) 36.37/30.77 BOUNDS(1, n^2) 36.37/30.77 36.37/30.77 ---------------------------------------- 36.37/30.77 36.37/30.77 (3) Loat Proof (FINISHED) 36.37/30.77 36.37/30.77 36.37/30.77 ### Pre-processing the ITS problem ### 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Initial linear ITS problem 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 0: evalrealheapsortstep2start -> evalrealheapsortstep2entryin : [], cost: 1 36.37/30.77 36.37/30.77 1: evalrealheapsortstep2entryin -> evalrealheapsortstep2bbin : [ A>=3 ], cost: 1 36.37/30.77 36.37/30.77 2: evalrealheapsortstep2entryin -> evalrealheapsortstep2returnin : [ 2>=A ], cost: 1 36.37/30.77 36.37/30.77 3: evalrealheapsortstep2bbin -> evalrealheapsortstep2bb11in : B'=0, [], cost: 1 36.37/30.77 36.37/30.77 4: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb1in : [ A>=2+B ], cost: 1 36.37/30.77 36.37/30.77 5: evalrealheapsortstep2bb11in -> evalrealheapsortstep2returnin : [ 1+B>=A ], cost: 1 36.37/30.77 36.37/30.77 6: evalrealheapsortstep2bb1in -> evalrealheapsortstep2bb9in : C'=0, [], cost: 1 36.37/30.77 36.37/30.77 7: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb2in : [ A>=3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 8: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb10in : [ 2+2*C+B>=A ], cost: 1 36.37/30.77 36.37/30.77 9: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb4in : [ A==3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 10: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ A>=4+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 11: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ 2+2*C+B>=A ], cost: 1 36.37/30.77 36.37/30.77 12: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb4in : [], cost: 1 36.37/30.77 36.37/30.77 13: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb5in : [], cost: 1 36.37/30.77 36.37/30.77 14: evalrealheapsortstep2bb4in -> evalrealheapsortstep2bb6in : D'=1+2*C, [], cost: 1 36.37/30.77 36.37/30.77 15: evalrealheapsortstep2bb5in -> evalrealheapsortstep2bb6in : D'=2+2*C, [], cost: 1 36.37/30.77 36.37/30.77 16: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb7in : [], cost: 1 36.37/30.77 36.37/30.77 17: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=A, [], cost: 1 36.37/30.77 36.37/30.77 18: evalrealheapsortstep2bb7in -> evalrealheapsortstep2bb9in : C'=D, [], cost: 1 36.37/30.77 36.37/30.77 19: evalrealheapsortstep2bb10in -> evalrealheapsortstep2bb11in : B'=1+B, [], cost: 1 36.37/30.77 36.37/30.77 20: evalrealheapsortstep2returnin -> evalrealheapsortstep2stop : [], cost: 1 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Removed unreachable and leaf rules: 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 0: evalrealheapsortstep2start -> evalrealheapsortstep2entryin : [], cost: 1 36.37/30.77 36.37/30.77 1: evalrealheapsortstep2entryin -> evalrealheapsortstep2bbin : [ A>=3 ], cost: 1 36.37/30.77 36.37/30.77 3: evalrealheapsortstep2bbin -> evalrealheapsortstep2bb11in : B'=0, [], cost: 1 36.37/30.77 36.37/30.77 4: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb1in : [ A>=2+B ], cost: 1 36.37/30.77 36.37/30.77 6: evalrealheapsortstep2bb1in -> evalrealheapsortstep2bb9in : C'=0, [], cost: 1 36.37/30.77 36.37/30.77 7: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb2in : [ A>=3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 8: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb10in : [ 2+2*C+B>=A ], cost: 1 36.37/30.77 36.37/30.77 9: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb4in : [ A==3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 10: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ A>=4+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 11: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ 2+2*C+B>=A ], cost: 1 36.37/30.77 36.37/30.77 12: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb4in : [], cost: 1 36.37/30.77 36.37/30.77 13: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb5in : [], cost: 1 36.37/30.77 36.37/30.77 14: evalrealheapsortstep2bb4in -> evalrealheapsortstep2bb6in : D'=1+2*C, [], cost: 1 36.37/30.77 36.37/30.77 15: evalrealheapsortstep2bb5in -> evalrealheapsortstep2bb6in : D'=2+2*C, [], cost: 1 36.37/30.77 36.37/30.77 16: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb7in : [], cost: 1 36.37/30.77 36.37/30.77 17: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=A, [], cost: 1 36.37/30.77 36.37/30.77 18: evalrealheapsortstep2bb7in -> evalrealheapsortstep2bb9in : C'=D, [], cost: 1 36.37/30.77 36.37/30.77 19: evalrealheapsortstep2bb10in -> evalrealheapsortstep2bb11in : B'=1+B, [], cost: 1 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 ### Simplification by acceleration and chaining ### 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on linear paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 7: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb2in : [ A>=3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 9: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb4in : [ A==3+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 10: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ A>=4+2*C+B ], cost: 1 36.37/30.77 36.37/30.77 11: evalrealheapsortstep2bb2in -> evalrealheapsortstep2bb3in : [ 2+2*C+B>=A ], cost: 1 36.37/30.77 36.37/30.77 12: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb4in : [], cost: 1 36.37/30.77 36.37/30.77 25: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb6in : D'=2+2*C, [], cost: 2 36.37/30.77 36.37/30.77 14: evalrealheapsortstep2bb4in -> evalrealheapsortstep2bb6in : D'=1+2*C, [], cost: 1 36.37/30.77 36.37/30.77 17: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=A, [], cost: 1 36.37/30.77 36.37/30.77 26: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=D, [], cost: 2 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on tree-shaped paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 27: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb4in : [ A==3+2*C+B ], cost: 2 36.37/30.77 36.37/30.77 28: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb3in : [ A>=4+2*C+B ], cost: 2 36.37/30.77 36.37/30.77 12: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb4in : [], cost: 1 36.37/30.77 36.37/30.77 25: evalrealheapsortstep2bb3in -> evalrealheapsortstep2bb6in : D'=2+2*C, [], cost: 2 36.37/30.77 36.37/30.77 14: evalrealheapsortstep2bb4in -> evalrealheapsortstep2bb6in : D'=1+2*C, [], cost: 1 36.37/30.77 36.37/30.77 17: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=A, [], cost: 1 36.37/30.77 36.37/30.77 26: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=D, [], cost: 2 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on tree-shaped paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 30: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb6in : D'=2+2*C, [ A>=4+2*C+B ], cost: 4 36.37/30.77 36.37/30.77 31: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb6in : D'=1+2*C, [ A==3+2*C+B ], cost: 3 36.37/30.77 36.37/30.77 32: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb6in : D'=1+2*C, [ A>=4+2*C+B ], cost: 4 36.37/30.77 36.37/30.77 17: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=A, [], cost: 1 36.37/30.77 36.37/30.77 26: evalrealheapsortstep2bb6in -> evalrealheapsortstep2bb9in : C'=D, [], cost: 2 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on tree-shaped paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 33: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=2+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 34: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=2+2*C, D'=2+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 35: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A==3+2*C+B ], cost: 4 36.37/30.77 36.37/30.77 36: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A==3+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 37: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 38: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerating simple loops of location 5. 36.37/30.77 36.37/30.77 Accelerating the following rules: 36.37/30.77 36.37/30.77 33: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=2+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 34: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=2+2*C, D'=2+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 35: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A==3+2*C+B ], cost: 4 36.37/30.77 36.37/30.77 36: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A==3+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 37: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 38: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerated rule 33 with NONTERM (after strengthening guard), yielding the new rule 39. 36.37/30.77 36.37/30.77 Found no metering function for rule 34. 36.37/30.77 36.37/30.77 Accelerated rule 35 with NONTERM (after strengthening guard), yielding the new rule 40. 36.37/30.77 36.37/30.77 Found no metering function for rule 36. 36.37/30.77 36.37/30.77 Accelerated rule 37 with NONTERM (after strengthening guard), yielding the new rule 41. 36.37/30.77 36.37/30.77 Found no metering function for rule 38. 36.37/30.77 36.37/30.77 Removing the simple loops:. 36.37/30.77 36.37/30.77 Also removing duplicate rules:. 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerated all simple loops using metering functions (where possible): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 33: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=2+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 34: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=2+2*C, D'=2+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 35: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A==3+2*C+B ], cost: 4 36.37/30.77 36.37/30.77 36: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A==3+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 37: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=A, D'=1+2*C, [ A>=4+2*C+B ], cost: 5 36.37/30.77 36.37/30.77 38: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb9in : C'=1+2*C, D'=1+2*C, [ A>=4+2*C+B ], cost: 6 36.37/30.77 36.37/30.77 40: evalrealheapsortstep2bb9in -> [15] : [ A==3+2*C+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 41: evalrealheapsortstep2bb9in -> [15] : [ A>=4+2*C+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Chained accelerated rules (with incoming rules): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 23: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=0, [ A>=2+B ], cost: 2 36.37/30.77 36.37/30.77 42: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=A, D'=2, [ A>=4+B ], cost: 7 36.37/30.77 36.37/30.77 43: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=2, D'=2, [ A>=4+B ], cost: 8 36.37/30.77 36.37/30.77 44: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=A, D'=1, [ A==3+B ], cost: 6 36.37/30.77 36.37/30.77 45: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=1, D'=1, [ A==3+B ], cost: 7 36.37/30.77 36.37/30.77 46: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=A, D'=1, [ A>=4+B ], cost: 7 36.37/30.77 36.37/30.77 47: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb9in : C'=1, D'=1, [ A>=4+B ], cost: 8 36.37/30.77 36.37/30.77 48: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A==3+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 49: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A>=4+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 24: evalrealheapsortstep2bb9in -> evalrealheapsortstep2bb11in : B'=1+B, [ 2+2*C+B>=A ], cost: 2 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on tree-shaped paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 48: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A==3+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 49: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A>=4+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 50: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=0, [ A>=2+B && 2+B>=A ], cost: 4 36.37/30.77 36.37/30.77 51: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=2, [ A>=4+B && 2+2*A+B>=A ], cost: 9 36.37/30.77 36.37/30.77 52: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=2, D'=2, [ A>=4+B && 6+B>=A ], cost: 10 36.37/30.77 36.37/30.77 53: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=1, [ A==3+B && 2+2*A+B>=A ], cost: 8 36.37/30.77 36.37/30.77 54: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=1, D'=1, [ A==3+B ], cost: 9 36.37/30.77 36.37/30.77 55: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=1, [ A>=4+B && 2+2*A+B>=A ], cost: 9 36.37/30.77 36.37/30.77 56: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=1, D'=1, [ A>=4+B && 4+B>=A ], cost: 10 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Applied pruning (of leafs and parallel rules): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 48: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A==3+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 49: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A>=4+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 50: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=0, [ A>=2+B && 2+B>=A ], cost: 4 36.37/30.77 36.37/30.77 51: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=2, [ A>=4+B && 2+2*A+B>=A ], cost: 9 36.37/30.77 36.37/30.77 52: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=2, D'=2, [ A>=4+B && 6+B>=A ], cost: 10 36.37/30.77 36.37/30.77 53: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=1, [ A==3+B && 2+2*A+B>=A ], cost: 8 36.37/30.77 36.37/30.77 54: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=1, D'=1, [ A==3+B ], cost: 9 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerating simple loops of location 3. 36.37/30.77 36.37/30.77 Simplified some of the simple loops (and removed duplicate rules). 36.37/30.77 36.37/30.77 Accelerating the following rules: 36.37/30.77 36.37/30.77 50: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=0, [ 2-A+B==0 ], cost: 4 36.37/30.77 36.37/30.77 51: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=2, [ A>=4+B && 2+2*A+B>=A ], cost: 9 36.37/30.77 36.37/30.77 52: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=2, D'=2, [ A>=4+B && 6+B>=A ], cost: 10 36.37/30.77 36.37/30.77 53: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=A, D'=1, [ A==3+B && 2+2*A+B>=A ], cost: 8 36.37/30.77 36.37/30.77 54: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=1+B, C'=1, D'=1, [ A==3+B ], cost: 9 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerated rule 50 with metering function -1+A-B, yielding the new rule 57. 36.37/30.77 36.37/30.77 Accelerated rule 51 with metering function -3+A-B, yielding the new rule 58. 36.37/30.77 36.37/30.77 Accelerated rule 52 with metering function -3+A-B, yielding the new rule 59. 36.37/30.77 36.37/30.77 Accelerated rule 53 with metering function -2+A-B, yielding the new rule 60. 36.37/30.77 36.37/30.77 Accelerated rule 54 with metering function -2+A-B, yielding the new rule 61. 36.37/30.77 36.37/30.77 Removing the simple loops: 50 51 52 53 54. 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Accelerated all simple loops using metering functions (where possible): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 48: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A==3+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 49: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A>=4+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 57: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=-1+A, C'=0, [ 2-A+B==0 ], cost: -4+4*A-4*B 36.37/30.77 36.37/30.77 58: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=-3+A, C'=A, D'=2, [ A>=4+B && 2+2*A+B>=A ], cost: -27+9*A-9*B 36.37/30.77 36.37/30.77 59: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=-3+A, C'=2, D'=2, [ A>=4+B && 6+B>=A ], cost: -30+10*A-10*B 36.37/30.77 36.37/30.77 60: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=-2+A, C'=A, D'=1, [ A==3+B && 2+2*A+B>=A ], cost: -16+8*A-8*B 36.37/30.77 36.37/30.77 61: evalrealheapsortstep2bb11in -> evalrealheapsortstep2bb11in : B'=-2+A, C'=1, D'=1, [ A==3+B ], cost: -18+9*A-9*B 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Chained accelerated rules (with incoming rules): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 22: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=0, [ A>=3 ], cost: 3 36.37/30.77 36.37/30.77 62: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=-3+A, C'=A, D'=2, [ A>=4 ], cost: -24+9*A 36.37/30.77 36.37/30.77 63: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=-3+A, C'=2, D'=2, [ A>=4 && 6>=A ], cost: -27+10*A 36.37/30.77 36.37/30.77 64: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=-2+A, C'=A, D'=1, [ A==3 ], cost: -13+8*A 36.37/30.77 36.37/30.77 65: evalrealheapsortstep2start -> evalrealheapsortstep2bb11in : B'=-2+A, C'=1, D'=1, [ A==3 ], cost: -15+9*A 36.37/30.77 36.37/30.77 48: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A==3+B && A==3+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 49: evalrealheapsortstep2bb11in -> [15] : C'=0, [ A>=4+B && A>=4+2*A+B ], cost: INF 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Eliminated locations (on tree-shaped paths): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 66: evalrealheapsortstep2start -> [17] : [ A>=4 ], cost: -24+9*A 36.37/30.77 36.37/30.77 67: evalrealheapsortstep2start -> [17] : [ A>=4 && 6>=A ], cost: -27+10*A 36.37/30.77 36.37/30.77 68: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -13+8*A 36.37/30.77 36.37/30.77 69: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -15+9*A 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Applied pruning (of leafs and parallel rules): 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 66: evalrealheapsortstep2start -> [17] : [ A>=4 ], cost: -24+9*A 36.37/30.77 36.37/30.77 67: evalrealheapsortstep2start -> [17] : [ A>=4 && 6>=A ], cost: -27+10*A 36.37/30.77 36.37/30.77 68: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -13+8*A 36.37/30.77 36.37/30.77 69: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -15+9*A 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 ### Computing asymptotic complexity ### 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Fully simplified ITS problem 36.37/30.77 36.37/30.77 Start location: evalrealheapsortstep2start 36.37/30.77 36.37/30.77 66: evalrealheapsortstep2start -> [17] : [ A>=4 ], cost: -24+9*A 36.37/30.77 36.37/30.77 67: evalrealheapsortstep2start -> [17] : [ A>=4 && 6>=A ], cost: -27+10*A 36.37/30.77 36.37/30.77 68: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -13+8*A 36.37/30.77 36.37/30.77 69: evalrealheapsortstep2start -> [17] : [ A==3 ], cost: -15+9*A 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Computing asymptotic complexity for rule 66 36.37/30.77 36.37/30.77 Solved the limit problem by the following transformations: 36.37/30.77 36.37/30.77 Created initial limit problem: 36.37/30.77 36.37/30.77 -24+9*A (+), -3+A (+/+!) [not solved] 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 removing all constraints (solved by SMT) 36.37/30.77 36.37/30.77 resulting limit problem: [solved] 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 applying transformation rule (C) using substitution {A==n} 36.37/30.77 36.37/30.77 resulting limit problem: 36.37/30.77 36.37/30.77 [solved] 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Solution: 36.37/30.77 36.37/30.77 A / n 36.37/30.77 36.37/30.77 Resulting cost -24+9*n has complexity: Poly(n^1) 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Found new complexity Poly(n^1). 36.37/30.77 36.37/30.77 36.37/30.77 36.37/30.77 Obtained the following overall complexity (w.r.t. the length of the input n): 36.37/30.78 36.37/30.78 Complexity: Poly(n^1) 36.37/30.78 36.37/30.78 Cpx degree: 1 36.37/30.78 36.37/30.78 Solved cost: -24+9*n 36.37/30.78 36.37/30.78 Rule cost: -24+9*A 36.37/30.78 36.37/30.78 Rule guard: [ A>=4 ] 36.37/30.78 36.37/30.78 36.37/30.78 36.37/30.78 WORST_CASE(Omega(n^1),?) 36.37/30.78 36.37/30.78 36.37/30.78 ---------------------------------------- 36.37/30.78 36.37/30.78 (4) 36.37/30.78 BOUNDS(n^1, INF) 36.37/30.80 EOF