Initial Problem

Start: n_evalrealheapsortstep1start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: C_P
Locations: n_evalrealheapsortstep1bb2in___11, n_evalrealheapsortstep1bb2in___16, n_evalrealheapsortstep1bb3in___14, n_evalrealheapsortstep1bb3in___18, n_evalrealheapsortstep1bb3in___8, n_evalrealheapsortstep1bb4in___13, n_evalrealheapsortstep1bb4in___17, n_evalrealheapsortstep1bb5in___10, n_evalrealheapsortstep1bb5in___12, n_evalrealheapsortstep1bb5in___15, n_evalrealheapsortstep1bb5in___6, n_evalrealheapsortstep1bb6in___20, n_evalrealheapsortstep1bb6in___4, n_evalrealheapsortstep1bb6in___9, n_evalrealheapsortstep1entryin___21, n_evalrealheapsortstep1returnin___19, n_evalrealheapsortstep1returnin___3, n_evalrealheapsortstep1returnin___7, n_evalrealheapsortstep1start, n_evalrealheapsortstep1stop___1, n_evalrealheapsortstep1stop___2, n_evalrealheapsortstep1stop___5
Transitions:
0:n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2
1:n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2
2:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2):|:0<=1+Arg_2 && 1<=Arg_2
3:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2):|:0<=1+Arg_2 && Arg_2<=0
4:n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:1<=Arg_2 && 0<=1+Arg_2 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_2
5:n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2
6:n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___6(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && Arg_2<=0
7:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
8:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
9:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,C_P):|:1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
10:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,C_P):|:1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
11:n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:1<=Arg_2
12:n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:Arg_2<=0 && 0<=1+Arg_2
13:n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1+1,Arg_2):|:1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1
14:n_evalrealheapsortstep1bb5in___6(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:Arg_1<=0 && 1+Arg_1<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1
15:n_evalrealheapsortstep1bb6in___20(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_1):|:1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=1 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
16:n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_1):|:1<=Arg_1 && 1+Arg_1<=Arg_0
17:n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___3(Arg_0,Arg_1,Arg_2):|:1<=Arg_1 && Arg_0<=Arg_1
18:n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_1):|:1+Arg_1<=Arg_0
19:n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___7(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_1
20:n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___20(Arg_0,1,Arg_2):|:3<=Arg_0
21:n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___19(Arg_0,Arg_1,Arg_2):|:Arg_0<=2
22:n_evalrealheapsortstep1returnin___19(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___1(Arg_0,Arg_1,Arg_2):|:Arg_0<=2
23:n_evalrealheapsortstep1returnin___3(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___2(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_1 && 1<=Arg_1
24:n_evalrealheapsortstep1returnin___7(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___5(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_1
25:n_evalrealheapsortstep1start(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2)

Preprocessing

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb3in___18

Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb6in___4

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb4in___17

Found invariant 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb4in___13

Found invariant 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb5in___10

Found invariant 1<=0 for location n_evalrealheapsortstep1bb5in___6

Found invariant 0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb6in___9

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 4<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb3in___8

Found invariant Arg_2<=0 && 1+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb5in___12

Found invariant Arg_0<=2 for location n_evalrealheapsortstep1returnin___19

Found invariant 0<=Arg_2 && 3<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1stop___5

Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 5<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 5<=Arg_0+Arg_2 && Arg_0<=1+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1stop___2

Found invariant 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb2in___11

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb5in___15

Found invariant 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb3in___14

Found invariant Arg_1<=1 && 2+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb6in___20

Found invariant 0<=Arg_2 && 3<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1returnin___7

Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 5<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 5<=Arg_0+Arg_2 && Arg_0<=1+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1returnin___3

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep1bb2in___16

Found invariant Arg_0<=2 for location n_evalrealheapsortstep1stop___1

Cut unsatisfiable transition 6: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb5in___6

Cut unsatisfiable transition 14: n_evalrealheapsortstep1bb5in___6->n_evalrealheapsortstep1bb6in___9

Cut unreachable locations [n_evalrealheapsortstep1bb5in___6] from the program graph

Problem after Preprocessing

Start: n_evalrealheapsortstep1start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: C_P
Locations: n_evalrealheapsortstep1bb2in___11, n_evalrealheapsortstep1bb2in___16, n_evalrealheapsortstep1bb3in___14, n_evalrealheapsortstep1bb3in___18, n_evalrealheapsortstep1bb3in___8, n_evalrealheapsortstep1bb4in___13, n_evalrealheapsortstep1bb4in___17, n_evalrealheapsortstep1bb5in___10, n_evalrealheapsortstep1bb5in___12, n_evalrealheapsortstep1bb5in___15, n_evalrealheapsortstep1bb6in___20, n_evalrealheapsortstep1bb6in___4, n_evalrealheapsortstep1bb6in___9, n_evalrealheapsortstep1entryin___21, n_evalrealheapsortstep1returnin___19, n_evalrealheapsortstep1returnin___3, n_evalrealheapsortstep1returnin___7, n_evalrealheapsortstep1start, n_evalrealheapsortstep1stop___1, n_evalrealheapsortstep1stop___2, n_evalrealheapsortstep1stop___5
Transitions:
0:n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2
1:n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2
2:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=1+Arg_2 && 1<=Arg_2
3:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=1+Arg_2 && Arg_2<=0
4:n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=1+Arg_2 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_2
5:n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 4<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2
7:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
8:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
9:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
10:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2
11:n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2
12:n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:Arg_2<=0 && 1+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=0 && 0<=1+Arg_2
13:n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1+1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1
15:n_evalrealheapsortstep1bb6in___20(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_1):|:Arg_1<=1 && 2+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=1 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
16:n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_1):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_1 && 1+Arg_1<=Arg_0
17:n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___3(Arg_0,Arg_1,Arg_2):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_1 && Arg_0<=Arg_1
18:n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_1):|:0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0
19:n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___7(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1
20:n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___20(Arg_0,1,Arg_2):|:3<=Arg_0
21:n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1returnin___19(Arg_0,Arg_1,Arg_2):|:Arg_0<=2
22:n_evalrealheapsortstep1returnin___19(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___1(Arg_0,Arg_1,Arg_2):|:Arg_0<=2 && Arg_0<=2
23:n_evalrealheapsortstep1returnin___3(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___2(Arg_0,Arg_1,Arg_2):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 5<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 5<=Arg_0+Arg_2 && Arg_0<=1+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1 && 1<=Arg_1
24:n_evalrealheapsortstep1returnin___7(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1stop___5(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 3<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1
25:n_evalrealheapsortstep1start(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1entryin___21(Arg_0,Arg_1,Arg_2)

MPRF for transition 1:n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_1 ]

MPRF for transition 3:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=1+Arg_2 && Arg_2<=0 of depth 1:

new bound:

Arg_0+3 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0+2-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0+2-Arg_1 ]

MPRF for transition 4:n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=1+Arg_2 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_2-1 ]

MPRF for transition 5:n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 2<=Arg_2 && 4<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2-2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_2-2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_1 ]

MPRF for transition 8:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 9:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___16(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 10:n_evalrealheapsortstep1bb4in___17(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,C_P):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_1 ]

MPRF for transition 11:n_evalrealheapsortstep1bb5in___10(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0+1-Arg_2 ]

MPRF for transition 12:n_evalrealheapsortstep1bb5in___12(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1+1,Arg_2):|:Arg_2<=0 && 1+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=0 && 0<=1+Arg_2 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0+1-Arg_2 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0+1-Arg_1 ]

MPRF for transition 13:n_evalrealheapsortstep1bb5in___15(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1+1,Arg_2):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_1<=Arg_2 && Arg_2<=Arg_1 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 16:n_evalrealheapsortstep1bb6in___4(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___18(Arg_0,Arg_1,Arg_1):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && Arg_1<=1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_1 && 1+Arg_1<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0+1-Arg_1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_1 ]

MPRF for transition 18:n_evalrealheapsortstep1bb6in___9(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___8(Arg_0,Arg_1,Arg_1):|:0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0-Arg_2-1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0-Arg_1-1 ]

MPRF for transition 0:n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 1+2*C_P<=Arg_2 && Arg_2<=2+2*C_P && 0<=Arg_2 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0 {O(n^2)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [2*Arg_2+1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0 ]
n_evalrealheapsortstep1bb2in___11 [Arg_2+1 ]
n_evalrealheapsortstep1bb4in___13 [2*Arg_2+1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_2 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0 ]
n_evalrealheapsortstep1bb5in___10 [2*Arg_2 ]
n_evalrealheapsortstep1bb5in___12 [2*Arg_2+1 ]
n_evalrealheapsortstep1bb6in___9 [2*Arg_2 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0 ]

MPRF for transition 2:n_evalrealheapsortstep1bb3in___14(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=1+Arg_2 && 1<=Arg_2 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0 {O(n^2)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [Arg_0+2*Arg_2-Arg_1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0 ]
n_evalrealheapsortstep1bb2in___11 [Arg_0+Arg_2-Arg_1-1 ]
n_evalrealheapsortstep1bb4in___13 [Arg_0+Arg_2-Arg_1-1 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0+Arg_2-Arg_1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0 ]
n_evalrealheapsortstep1bb5in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___12 [Arg_0-Arg_1-1 ]
n_evalrealheapsortstep1bb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0 ]

MPRF for transition 7:n_evalrealheapsortstep1bb4in___13(Arg_0,Arg_1,Arg_2) -> n_evalrealheapsortstep1bb2in___11(Arg_0,Arg_1,C_P):|:1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 0<=C_P && Arg_2<=C_P && C_P<=Arg_2 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0 {O(n^2)}

MPRF:

n_evalrealheapsortstep1bb3in___14 [2*Arg_2+1 ]
n_evalrealheapsortstep1bb3in___8 [Arg_0 ]
n_evalrealheapsortstep1bb2in___11 [Arg_2 ]
n_evalrealheapsortstep1bb4in___13 [Arg_2+2 ]
n_evalrealheapsortstep1bb2in___16 [Arg_0+Arg_2-Arg_1 ]
n_evalrealheapsortstep1bb4in___17 [Arg_0 ]
n_evalrealheapsortstep1bb5in___10 [Arg_2 ]
n_evalrealheapsortstep1bb5in___12 [0 ]
n_evalrealheapsortstep1bb6in___9 [Arg_2 ]
n_evalrealheapsortstep1bb5in___15 [Arg_0 ]
n_evalrealheapsortstep1bb6in___4 [Arg_0 ]
n_evalrealheapsortstep1bb3in___18 [Arg_0 ]

All Bounds

Timebounds

Overall timebound:3*Arg_0*Arg_0+21*Arg_0+28 {O(n^2)}
0: n_evalrealheapsortstep1bb2in___11->n_evalrealheapsortstep1bb3in___14: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
1: n_evalrealheapsortstep1bb2in___16->n_evalrealheapsortstep1bb3in___14: Arg_0+2 {O(n)}
2: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb4in___13: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
3: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb5in___12: Arg_0+3 {O(n)}
4: n_evalrealheapsortstep1bb3in___18->n_evalrealheapsortstep1bb4in___17: Arg_0+1 {O(n)}
5: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb4in___17: Arg_0+2 {O(n)}
7: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb2in___11: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
8: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb5in___10: Arg_0+1 {O(n)}
9: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb2in___16: Arg_0+1 {O(n)}
10: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb5in___15: Arg_0+1 {O(n)}
11: n_evalrealheapsortstep1bb5in___10->n_evalrealheapsortstep1bb6in___9: Arg_0+2 {O(n)}
12: n_evalrealheapsortstep1bb5in___12->n_evalrealheapsortstep1bb6in___9: Arg_0+2 {O(n)}
13: n_evalrealheapsortstep1bb5in___15->n_evalrealheapsortstep1bb6in___4: Arg_0+1 {O(n)}
15: n_evalrealheapsortstep1bb6in___20->n_evalrealheapsortstep1bb3in___18: 1 {O(1)}
16: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1bb3in___18: Arg_0+1 {O(n)}
17: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1returnin___3: 1 {O(1)}
18: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1bb3in___8: Arg_0+2 {O(n)}
19: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1returnin___7: 1 {O(1)}
20: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1bb6in___20: 1 {O(1)}
21: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1returnin___19: 1 {O(1)}
22: n_evalrealheapsortstep1returnin___19->n_evalrealheapsortstep1stop___1: 1 {O(1)}
23: n_evalrealheapsortstep1returnin___3->n_evalrealheapsortstep1stop___2: 1 {O(1)}
24: n_evalrealheapsortstep1returnin___7->n_evalrealheapsortstep1stop___5: 1 {O(1)}
25: n_evalrealheapsortstep1start->n_evalrealheapsortstep1entryin___21: 1 {O(1)}

Costbounds

Overall costbound: 3*Arg_0*Arg_0+21*Arg_0+28 {O(n^2)}
0: n_evalrealheapsortstep1bb2in___11->n_evalrealheapsortstep1bb3in___14: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
1: n_evalrealheapsortstep1bb2in___16->n_evalrealheapsortstep1bb3in___14: Arg_0+2 {O(n)}
2: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb4in___13: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
3: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb5in___12: Arg_0+3 {O(n)}
4: n_evalrealheapsortstep1bb3in___18->n_evalrealheapsortstep1bb4in___17: Arg_0+1 {O(n)}
5: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb4in___17: Arg_0+2 {O(n)}
7: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb2in___11: Arg_0*Arg_0+3*Arg_0 {O(n^2)}
8: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb5in___10: Arg_0+1 {O(n)}
9: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb2in___16: Arg_0+1 {O(n)}
10: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb5in___15: Arg_0+1 {O(n)}
11: n_evalrealheapsortstep1bb5in___10->n_evalrealheapsortstep1bb6in___9: Arg_0+2 {O(n)}
12: n_evalrealheapsortstep1bb5in___12->n_evalrealheapsortstep1bb6in___9: Arg_0+2 {O(n)}
13: n_evalrealheapsortstep1bb5in___15->n_evalrealheapsortstep1bb6in___4: Arg_0+1 {O(n)}
15: n_evalrealheapsortstep1bb6in___20->n_evalrealheapsortstep1bb3in___18: 1 {O(1)}
16: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1bb3in___18: Arg_0+1 {O(n)}
17: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1returnin___3: 1 {O(1)}
18: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1bb3in___8: Arg_0+2 {O(n)}
19: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1returnin___7: 1 {O(1)}
20: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1bb6in___20: 1 {O(1)}
21: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1returnin___19: 1 {O(1)}
22: n_evalrealheapsortstep1returnin___19->n_evalrealheapsortstep1stop___1: 1 {O(1)}
23: n_evalrealheapsortstep1returnin___3->n_evalrealheapsortstep1stop___2: 1 {O(1)}
24: n_evalrealheapsortstep1returnin___7->n_evalrealheapsortstep1stop___5: 1 {O(1)}
25: n_evalrealheapsortstep1start->n_evalrealheapsortstep1entryin___21: 1 {O(1)}

Sizebounds

0: n_evalrealheapsortstep1bb2in___11->n_evalrealheapsortstep1bb3in___14, Arg_0: Arg_0 {O(n)}
0: n_evalrealheapsortstep1bb2in___11->n_evalrealheapsortstep1bb3in___14, Arg_1: 3*Arg_0+6 {O(n)}
0: n_evalrealheapsortstep1bb2in___11->n_evalrealheapsortstep1bb3in___14, Arg_2: 9*Arg_0+19 {O(n)}
1: n_evalrealheapsortstep1bb2in___16->n_evalrealheapsortstep1bb3in___14, Arg_0: Arg_0 {O(n)}
1: n_evalrealheapsortstep1bb2in___16->n_evalrealheapsortstep1bb3in___14, Arg_1: 3*Arg_0+6 {O(n)}
1: n_evalrealheapsortstep1bb2in___16->n_evalrealheapsortstep1bb3in___14, Arg_2: 9*Arg_0+19 {O(n)}
2: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb4in___13, Arg_0: Arg_0 {O(n)}
2: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb4in___13, Arg_1: 3*Arg_0+6 {O(n)}
2: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb4in___13, Arg_2: 9*Arg_0+19 {O(n)}
3: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb5in___12, Arg_0: Arg_0 {O(n)}
3: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb5in___12, Arg_1: 3*Arg_0+6 {O(n)}
3: n_evalrealheapsortstep1bb3in___14->n_evalrealheapsortstep1bb5in___12, Arg_2: 0 {O(1)}
4: n_evalrealheapsortstep1bb3in___18->n_evalrealheapsortstep1bb4in___17, Arg_0: Arg_0 {O(n)}
4: n_evalrealheapsortstep1bb3in___18->n_evalrealheapsortstep1bb4in___17, Arg_1: 3*Arg_0+6 {O(n)}
4: n_evalrealheapsortstep1bb3in___18->n_evalrealheapsortstep1bb4in___17, Arg_2: 3*Arg_0+7 {O(n)}
5: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb4in___17, Arg_0: Arg_0 {O(n)}
5: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb4in___17, Arg_1: 3*Arg_0+6 {O(n)}
5: n_evalrealheapsortstep1bb3in___8->n_evalrealheapsortstep1bb4in___17, Arg_2: 6*Arg_0+12 {O(n)}
7: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb2in___11, Arg_0: Arg_0 {O(n)}
7: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb2in___11, Arg_1: 3*Arg_0+6 {O(n)}
7: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb2in___11, Arg_2: 9*Arg_0+19 {O(n)}
8: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb5in___10, Arg_0: Arg_0 {O(n)}
8: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb5in___10, Arg_1: 3*Arg_0+6 {O(n)}
8: n_evalrealheapsortstep1bb4in___13->n_evalrealheapsortstep1bb5in___10, Arg_2: 9*Arg_0+19 {O(n)}
9: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb2in___16, Arg_0: Arg_0 {O(n)}
9: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb2in___16, Arg_1: 3*Arg_0+6 {O(n)}
9: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb2in___16, Arg_2: 9*Arg_0+19 {O(n)}
10: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb5in___15, Arg_0: Arg_0 {O(n)}
10: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb5in___15, Arg_1: 3*Arg_0+6 {O(n)}
10: n_evalrealheapsortstep1bb4in___17->n_evalrealheapsortstep1bb5in___15, Arg_2: 9*Arg_0+19 {O(n)}
11: n_evalrealheapsortstep1bb5in___10->n_evalrealheapsortstep1bb6in___9, Arg_0: Arg_0 {O(n)}
11: n_evalrealheapsortstep1bb5in___10->n_evalrealheapsortstep1bb6in___9, Arg_1: 3*Arg_0+6 {O(n)}
11: n_evalrealheapsortstep1bb5in___10->n_evalrealheapsortstep1bb6in___9, Arg_2: 9*Arg_0+19 {O(n)}
12: n_evalrealheapsortstep1bb5in___12->n_evalrealheapsortstep1bb6in___9, Arg_0: Arg_0 {O(n)}
12: n_evalrealheapsortstep1bb5in___12->n_evalrealheapsortstep1bb6in___9, Arg_1: 3*Arg_0+6 {O(n)}
12: n_evalrealheapsortstep1bb5in___12->n_evalrealheapsortstep1bb6in___9, Arg_2: 0 {O(1)}
13: n_evalrealheapsortstep1bb5in___15->n_evalrealheapsortstep1bb6in___4, Arg_0: Arg_0 {O(n)}
13: n_evalrealheapsortstep1bb5in___15->n_evalrealheapsortstep1bb6in___4, Arg_1: 3*Arg_0+6 {O(n)}
13: n_evalrealheapsortstep1bb5in___15->n_evalrealheapsortstep1bb6in___4, Arg_2: 9*Arg_0+19 {O(n)}
15: n_evalrealheapsortstep1bb6in___20->n_evalrealheapsortstep1bb3in___18, Arg_0: Arg_0 {O(n)}
15: n_evalrealheapsortstep1bb6in___20->n_evalrealheapsortstep1bb3in___18, Arg_1: 1 {O(1)}
15: n_evalrealheapsortstep1bb6in___20->n_evalrealheapsortstep1bb3in___18, Arg_2: 1 {O(1)}
16: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1bb3in___18, Arg_0: Arg_0 {O(n)}
16: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1bb3in___18, Arg_1: 3*Arg_0+6 {O(n)}
16: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1bb3in___18, Arg_2: 3*Arg_0+6 {O(n)}
17: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1returnin___3, Arg_0: Arg_0 {O(n)}
17: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1returnin___3, Arg_1: 3*Arg_0+6 {O(n)}
17: n_evalrealheapsortstep1bb6in___4->n_evalrealheapsortstep1returnin___3, Arg_2: 9*Arg_0+19 {O(n)}
18: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1bb3in___8, Arg_0: Arg_0 {O(n)}
18: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1bb3in___8, Arg_1: 3*Arg_0+6 {O(n)}
18: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1bb3in___8, Arg_2: 6*Arg_0+12 {O(n)}
19: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1returnin___7, Arg_0: 2*Arg_0 {O(n)}
19: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1returnin___7, Arg_1: 6*Arg_0+12 {O(n)}
19: n_evalrealheapsortstep1bb6in___9->n_evalrealheapsortstep1returnin___7, Arg_2: 9*Arg_0+19 {O(n)}
20: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1bb6in___20, Arg_0: Arg_0 {O(n)}
20: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1bb6in___20, Arg_1: 1 {O(1)}
20: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1bb6in___20, Arg_2: Arg_2 {O(n)}
21: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1returnin___19, Arg_0: Arg_0 {O(n)}
21: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1returnin___19, Arg_1: Arg_1 {O(n)}
21: n_evalrealheapsortstep1entryin___21->n_evalrealheapsortstep1returnin___19, Arg_2: Arg_2 {O(n)}
22: n_evalrealheapsortstep1returnin___19->n_evalrealheapsortstep1stop___1, Arg_0: Arg_0 {O(n)}
22: n_evalrealheapsortstep1returnin___19->n_evalrealheapsortstep1stop___1, Arg_1: Arg_1 {O(n)}
22: n_evalrealheapsortstep1returnin___19->n_evalrealheapsortstep1stop___1, Arg_2: Arg_2 {O(n)}
23: n_evalrealheapsortstep1returnin___3->n_evalrealheapsortstep1stop___2, Arg_0: Arg_0 {O(n)}
23: n_evalrealheapsortstep1returnin___3->n_evalrealheapsortstep1stop___2, Arg_1: 3*Arg_0+6 {O(n)}
23: n_evalrealheapsortstep1returnin___3->n_evalrealheapsortstep1stop___2, Arg_2: 9*Arg_0+19 {O(n)}
24: n_evalrealheapsortstep1returnin___7->n_evalrealheapsortstep1stop___5, Arg_0: 2*Arg_0 {O(n)}
24: n_evalrealheapsortstep1returnin___7->n_evalrealheapsortstep1stop___5, Arg_1: 6*Arg_0+12 {O(n)}
24: n_evalrealheapsortstep1returnin___7->n_evalrealheapsortstep1stop___5, Arg_2: 9*Arg_0+19 {O(n)}
25: n_evalrealheapsortstep1start->n_evalrealheapsortstep1entryin___21, Arg_0: Arg_0 {O(n)}
25: n_evalrealheapsortstep1start->n_evalrealheapsortstep1entryin___21, Arg_1: Arg_1 {O(n)}
25: n_evalrealheapsortstep1start->n_evalrealheapsortstep1entryin___21, Arg_2: Arg_2 {O(n)}