Initial Problem

Start: evalrealheapsortstep2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: evalrealheapsortstep2bb10in, evalrealheapsortstep2bb11in, evalrealheapsortstep2bb1in, evalrealheapsortstep2bb2in, evalrealheapsortstep2bb3in, evalrealheapsortstep2bb4in, evalrealheapsortstep2bb5in, evalrealheapsortstep2bb6in, evalrealheapsortstep2bb7in, evalrealheapsortstep2bb9in, evalrealheapsortstep2bbin, evalrealheapsortstep2entryin, evalrealheapsortstep2returnin, evalrealheapsortstep2start, evalrealheapsortstep2stop
Transitions:
19:evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,Arg_1+1,Arg_2,Arg_3)
4:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:2+Arg_1<=Arg_0
5:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=Arg_1+1
6:evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,0,Arg_3)
10:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+4+2*Arg_2<=Arg_0
11:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
9:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
12:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3)
13:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3)
14:evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+1)
15:evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+2)
16:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3)
17:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_0,Arg_3)
18:evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_3,Arg_3)
8:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
7:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+3+2*Arg_2<=Arg_0
3:evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,0,Arg_2,Arg_3)
1:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
20:evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstep2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3)

Preprocessing

Cut unsatisfiable transition 11: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb5in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb2in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb7in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb6in

Found invariant 3<=Arg_0 for location evalrealheapsortstep2bbin

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb4in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb3in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb10in

Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 for location evalrealheapsortstep2bb1in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb9in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb11in

Problem after Preprocessing

Start: evalrealheapsortstep2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: evalrealheapsortstep2bb10in, evalrealheapsortstep2bb11in, evalrealheapsortstep2bb1in, evalrealheapsortstep2bb2in, evalrealheapsortstep2bb3in, evalrealheapsortstep2bb4in, evalrealheapsortstep2bb5in, evalrealheapsortstep2bb6in, evalrealheapsortstep2bb7in, evalrealheapsortstep2bb9in, evalrealheapsortstep2bbin, evalrealheapsortstep2entryin, evalrealheapsortstep2returnin, evalrealheapsortstep2start, evalrealheapsortstep2stop
Transitions:
19:evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:0<=Arg_1
4:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && 2+Arg_1<=Arg_0
5:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=Arg_1+1
6:evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,0,Arg_3):|:2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0
10:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_1+4+2*Arg_2<=Arg_0
9:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
12:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
13:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
14:evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:0<=Arg_1
15:evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:0<=Arg_1
16:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
17:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_0,Arg_3):|:0<=Arg_1
18:evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_3,Arg_3):|:0<=Arg_1
8:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=2*Arg_2+2+Arg_1
7:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_1+3+2*Arg_2<=Arg_0
3:evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,0,Arg_2,Arg_3):|:3<=Arg_0
1:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
20:evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstep2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3)

MPRF for transition 4:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && 2+Arg_1<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [Arg_0+1-Arg_1 ]
evalrealheapsortstep2bb1in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb3in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb5in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb6in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb7in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb9in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb10in [Arg_0-Arg_1 ]

MPRF for transition 6:evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,0,Arg_3):|:2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [Arg_0-Arg_1-1 ]
evalrealheapsortstep2bb1in [Arg_0-Arg_1-1 ]
evalrealheapsortstep2bb3in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb4in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb5in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb6in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb7in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb2in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb9in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb10in [Arg_0-Arg_1-2 ]

MPRF for transition 19:evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:0<=Arg_1 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [0 ]
evalrealheapsortstep2bb1in [Arg_1+2-Arg_0 ]
evalrealheapsortstep2bb3in [1 ]
evalrealheapsortstep2bb4in [1 ]
evalrealheapsortstep2bb5in [1 ]
evalrealheapsortstep2bb6in [1 ]
evalrealheapsortstep2bb7in [1 ]
evalrealheapsortstep2bb2in [1 ]
evalrealheapsortstep2bb9in [1 ]
evalrealheapsortstep2bb10in [1 ]

MPRF for transition 8:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [0 ]
evalrealheapsortstep2bb1in [0 ]
evalrealheapsortstep2bb3in [1 ]
evalrealheapsortstep2bb4in [1 ]
evalrealheapsortstep2bb5in [1 ]
evalrealheapsortstep2bb6in [1 ]
evalrealheapsortstep2bb7in [1 ]
evalrealheapsortstep2bb2in [1 ]
evalrealheapsortstep2bb9in [1 ]
evalrealheapsortstep2bb10in [0 ]

Analysing control-flow refined program

Cut unsatisfiable transition 220: n_evalrealheapsortstep2bb9in___13->evalrealheapsortstep2bb10in

Cut unsatisfiable transition 221: n_evalrealheapsortstep2bb9in___14->evalrealheapsortstep2bb10in

Cut unsatisfiable transition 224: n_evalrealheapsortstep2bb9in___6->evalrealheapsortstep2bb10in

Found invariant 5+Arg_3<=0 && 2+Arg_3<=Arg_2 && 8+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && 3+Arg_2<=0 && 3+Arg_2<=Arg_1 && 3+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 6+Arg_0+Arg_2<=0 && 0<=3+Arg_1+Arg_2 && Arg_0<=Arg_2 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 0<=3+Arg_0+Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb6in___8

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb5in___37

Found invariant 5+Arg_3<=0 && Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && Arg_2<=Arg_3 && 5+Arg_2<=0 && 5+Arg_2<=Arg_1 && 5+Arg_1+Arg_2<=0 && 2+Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb2in___12

Found invariant 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb5in___17

Found invariant 7+Arg_3<=0 && 3+Arg_3<=Arg_2 && 11+Arg_2+Arg_3<=0 && 7+Arg_3<=Arg_1 && 7+Arg_1+Arg_3<=0 && 3+Arg_3<=Arg_0 && 11+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb6in___16

Found invariant 6+Arg_3<=0 && 2+Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 6+Arg_3<=Arg_1 && 6+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 10+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb2in___11

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep2bb6in___2

Found invariant 3<=Arg_0 for location evalrealheapsortstep2bbin

Found invariant 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 3+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb3in___20

Found invariant Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 for location n_evalrealheapsortstep2bb5in___28

Found invariant Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 for location n_evalrealheapsortstep2bb2in___32

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb6in___25

Found invariant 7+Arg_3<=0 && 3+Arg_3<=Arg_2 && 11+Arg_2+Arg_3<=0 && 7+Arg_3<=Arg_1 && 7+Arg_1+Arg_3<=0 && 3+Arg_3<=Arg_0 && 11+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb7in___15

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 for location evalrealheapsortstep2bb9in

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb11in

Found invariant 6+Arg_3<=0 && 2+Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 6+Arg_3<=Arg_1 && 6+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 10+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb6in___10

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb6in___23

Found invariant 5+Arg_3<=0 && 2+Arg_3<=Arg_2 && 8+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && 3+Arg_2<=0 && 3+Arg_2<=Arg_1 && 3+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 6+Arg_0+Arg_2<=0 && 0<=3+Arg_1+Arg_2 && Arg_0<=Arg_2 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 0<=3+Arg_0+Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb7in___7

Found invariant Arg_2<=Arg_0 && Arg_0<=Arg_2 && 0<=Arg_1 for location n_evalrealheapsortstep2bb2in___21

Found invariant 5+Arg_3<=0 && 2+Arg_3<=Arg_2 && 8+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && 3+Arg_2<=0 && 3+Arg_2<=Arg_1 && 3+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 6+Arg_0+Arg_2<=0 && 0<=3+Arg_1+Arg_2 && Arg_0<=Arg_2 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 0<=3+Arg_0+Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb9in___6

Found invariant 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb4in___18

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb4in___38

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

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep2bb7in___1

Found invariant 2+Arg_3<=Arg_0 && 0<=Arg_1 for location n_evalrealheapsortstep2bb7in___22

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb7in___26

Found invariant Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb6in___4

Found invariant Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 for location n_evalrealheapsortstep2bb9in___33

Found invariant 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortstep2bb4in___39

Found invariant 5+Arg_3<=0 && Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && Arg_2<=Arg_3 && 5+Arg_2<=0 && 5+Arg_2<=Arg_1 && 5+Arg_1+Arg_2<=0 && 2+Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb9in___13

Found invariant Arg_2<=Arg_0 && Arg_0<=Arg_2 && 0<=Arg_1 for location n_evalrealheapsortstep2bb9in___34

Found invariant 5+Arg_3<=0 && 2+Arg_3<=Arg_2 && 8+Arg_2+Arg_3<=0 && 5+Arg_3<=Arg_1 && 5+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 8+Arg_0+Arg_3<=0 && 3+Arg_2<=0 && 3+Arg_2<=Arg_1 && 3+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 6+Arg_0+Arg_2<=0 && 0<=3+Arg_1+Arg_2 && Arg_0<=Arg_2 && 3+Arg_0+Arg_1<=0 && 0<=Arg_1 && 0<=3+Arg_0+Arg_1 && 3+Arg_0<=Arg_1 && 3+Arg_0<=0 for location n_evalrealheapsortstep2bb2in___5

Found invariant 6+Arg_3<=0 && 2+Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 6+Arg_3<=Arg_1 && 6+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 10+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb9in___14

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

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb7in___24

Found invariant 6+Arg_3<=0 && 2+Arg_3<=Arg_2 && 10+Arg_2+Arg_3<=0 && 6+Arg_3<=Arg_1 && 6+Arg_1+Arg_3<=0 && 2+Arg_3<=Arg_0 && 10+Arg_0+Arg_3<=0 && 4+Arg_2<=0 && 4+Arg_2<=Arg_1 && 4+Arg_1+Arg_2<=0 && Arg_2<=Arg_0 && 8+Arg_0+Arg_2<=0 && Arg_0<=Arg_2 && 4+Arg_0+Arg_1<=0 && 0<=Arg_1 && 4+Arg_0<=Arg_1 && 4+Arg_0<=0 for location n_evalrealheapsortstep2bb7in___9

Found invariant Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb7in___3

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb7in___35

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb4in___30

Found invariant 0<=Arg_1 for location n_evalrealheapsortstep2bb6in___27

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb6in___36

Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb10in

Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 for location evalrealheapsortstep2bb1in

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortstep2bb3in___40

Found invariant Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 for location n_evalrealheapsortstep2bb4in___29

Found invariant Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 for location n_evalrealheapsortstep2bb3in___31

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 201:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb2in___41(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 2<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1 && 2+Arg_1<=Arg_0 && 3+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 152:n_evalrealheapsortstep2bb2in___41(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb3in___40(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 4+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 153:n_evalrealheapsortstep2bb2in___41(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb4in___39(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && Arg_0<=Arg_1+2*Arg2_P+3 && 3+Arg_1+2*Arg2_P<=Arg_0

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 159:n_evalrealheapsortstep2bb3in___40(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb4in___38(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 160:n_evalrealheapsortstep2bb3in___40(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb5in___37(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 165:n_evalrealheapsortstep2bb4in___38(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb6in___36(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 166:n_evalrealheapsortstep2bb4in___39(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb6in___2(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 169:n_evalrealheapsortstep2bb5in___37(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb6in___4(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 174:n_evalrealheapsortstep2bb6in___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb7in___1(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 175:n_evalrealheapsortstep2bb6in___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___34(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 182:n_evalrealheapsortstep2bb6in___36(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb7in___35(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 183:n_evalrealheapsortstep2bb6in___36(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___34(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 184:n_evalrealheapsortstep2bb6in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb7in___3(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 185:n_evalrealheapsortstep2bb6in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___34(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 188:n_evalrealheapsortstep2bb7in___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___33(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 193:n_evalrealheapsortstep2bb7in___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___33(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 194:n_evalrealheapsortstep2bb7in___35(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortstep2bb9in___33(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1

MPRF for transition 222:n_evalrealheapsortstep2bb9in___33(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && Arg_2<=Arg_3 && 0<=Arg_1 && 0<=Arg_1 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

6*Arg_0+6 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [0 ]
evalrealheapsortstep2bb1in [0 ]
evalrealheapsortstep2bb9in [0 ]
n_evalrealheapsortstep2bb2in___41 [0 ]
n_evalrealheapsortstep2bb3in___20 [1 ]
n_evalrealheapsortstep2bb3in___31 [1 ]
n_evalrealheapsortstep2bb3in___40 [0 ]
n_evalrealheapsortstep2bb4in___18 [1 ]
n_evalrealheapsortstep2bb4in___19 [Arg_0+Arg_1+4 ]
n_evalrealheapsortstep2bb4in___29 [1 ]
n_evalrealheapsortstep2bb4in___30 [1 ]
n_evalrealheapsortstep2bb4in___38 [0 ]
n_evalrealheapsortstep2bb4in___39 [0 ]
n_evalrealheapsortstep2bb5in___17 [1 ]
n_evalrealheapsortstep2bb5in___28 [1 ]
n_evalrealheapsortstep2bb5in___37 [0 ]
n_evalrealheapsortstep2bb6in___10 [2*Arg_2+3-Arg_3 ]
n_evalrealheapsortstep2bb6in___16 [1 ]
n_evalrealheapsortstep2bb6in___2 [0 ]
n_evalrealheapsortstep2bb7in___1 [0 ]
n_evalrealheapsortstep2bb6in___23 [1 ]
n_evalrealheapsortstep2bb6in___25 [1 ]
n_evalrealheapsortstep2bb6in___27 [1 ]
n_evalrealheapsortstep2bb6in___36 [0 ]
n_evalrealheapsortstep2bb7in___35 [Arg_1+4-Arg_0 ]
n_evalrealheapsortstep2bb6in___4 [0 ]
n_evalrealheapsortstep2bb7in___3 [0 ]
n_evalrealheapsortstep2bb6in___8 [1 ]
n_evalrealheapsortstep2bb7in___15 [1 ]
n_evalrealheapsortstep2bb7in___22 [1 ]
n_evalrealheapsortstep2bb7in___24 [1 ]
n_evalrealheapsortstep2bb7in___26 [1 ]
n_evalrealheapsortstep2bb7in___7 [1 ]
n_evalrealheapsortstep2bb7in___9 [2*Arg_2+3-Arg_3 ]
n_evalrealheapsortstep2bb9in___13 [1 ]
n_evalrealheapsortstep2bb2in___12 [1 ]
n_evalrealheapsortstep2bb9in___14 [1 ]
n_evalrealheapsortstep2bb2in___11 [1 ]
n_evalrealheapsortstep2bb2in___32 [1 ]
n_evalrealheapsortstep2bb9in___33 [1 ]
n_evalrealheapsortstep2bb2in___21 [1 ]
n_evalrealheapsortstep2bb9in___34 [1 ]
evalrealheapsortstep2bb10in [0 ]
n_evalrealheapsortstep2bb9in___6 [Arg_0+Arg_1+4 ]
n_evalrealheapsortstep2bb2in___5 [Arg_0+Arg_1+4 ]

MPRF for transition 223:n_evalrealheapsortstep2bb9in___34(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0 && Arg_0<=Arg_2 && 0<=Arg_1 && 0<=Arg_1 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

6*Arg_0+8 {O(n)}

MPRF:

evalrealheapsortstep2bb11in [2-2*Arg_1 ]
evalrealheapsortstep2bb1in [2-2*Arg_1 ]
evalrealheapsortstep2bb9in [2-2*Arg_1 ]
n_evalrealheapsortstep2bb2in___41 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb3in___20 [1 ]
n_evalrealheapsortstep2bb3in___31 [Arg_2+1-Arg_3 ]
n_evalrealheapsortstep2bb3in___40 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb4in___18 [1 ]
n_evalrealheapsortstep2bb4in___19 [1 ]
n_evalrealheapsortstep2bb4in___29 [1 ]
n_evalrealheapsortstep2bb4in___30 [1 ]
n_evalrealheapsortstep2bb4in___38 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb4in___39 [8-2*Arg_0 ]
n_evalrealheapsortstep2bb5in___17 [1 ]
n_evalrealheapsortstep2bb5in___28 [1 ]
n_evalrealheapsortstep2bb5in___37 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb6in___10 [1 ]
n_evalrealheapsortstep2bb6in___16 [1 ]
n_evalrealheapsortstep2bb6in___2 [2*Arg_3-2*Arg_1 ]
n_evalrealheapsortstep2bb7in___1 [2*Arg_0-4*Arg_1-4*Arg_3 ]
n_evalrealheapsortstep2bb6in___23 [1 ]
n_evalrealheapsortstep2bb6in___25 [1 ]
n_evalrealheapsortstep2bb6in___27 [Arg_3-2*Arg_2 ]
n_evalrealheapsortstep2bb6in___36 [Arg_3+1-2*Arg_1 ]
n_evalrealheapsortstep2bb7in___35 [2*Arg_3-2*Arg_1 ]
n_evalrealheapsortstep2bb6in___4 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb7in___3 [2-2*Arg_1 ]
n_evalrealheapsortstep2bb6in___8 [1 ]
n_evalrealheapsortstep2bb7in___15 [1 ]
n_evalrealheapsortstep2bb7in___22 [1 ]
n_evalrealheapsortstep2bb7in___24 [1 ]
n_evalrealheapsortstep2bb7in___26 [Arg_3-2*Arg_2 ]
n_evalrealheapsortstep2bb7in___7 [1 ]
n_evalrealheapsortstep2bb7in___9 [1 ]
n_evalrealheapsortstep2bb9in___13 [1 ]
n_evalrealheapsortstep2bb2in___12 [Arg_2+1-Arg_3 ]
n_evalrealheapsortstep2bb9in___14 [1 ]
n_evalrealheapsortstep2bb2in___11 [1 ]
n_evalrealheapsortstep2bb2in___32 [1 ]
n_evalrealheapsortstep2bb9in___33 [1 ]
n_evalrealheapsortstep2bb2in___21 [1 ]
n_evalrealheapsortstep2bb9in___34 [1 ]
evalrealheapsortstep2bb10in [-2*Arg_1 ]
n_evalrealheapsortstep2bb9in___6 [-Arg_0-Arg_1-2 ]
n_evalrealheapsortstep2bb2in___5 [-Arg_0-Arg_1-2 ]

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:inf {Infinity}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin: 1 {O(1)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in: Arg_0+1 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in: inf {Infinity}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in: inf {Infinity}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in: inf {Infinity}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in: inf {Infinity}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in: inf {Infinity}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in: inf {Infinity}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in: inf {Infinity}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in: inf {Infinity}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in: inf {Infinity}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in: inf {Infinity}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in: 1 {O(1)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin: 1 {O(1)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin: 1 {O(1)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop: 1 {O(1)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin: 1 {O(1)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in: Arg_0+1 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in: inf {Infinity}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in: inf {Infinity}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in: inf {Infinity}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in: inf {Infinity}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in: inf {Infinity}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in: inf {Infinity}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in: inf {Infinity}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in: inf {Infinity}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in: inf {Infinity}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in: inf {Infinity}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in: 1 {O(1)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin: 1 {O(1)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin: 1 {O(1)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop: 1 {O(1)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin: 1 {O(1)}

Sizebounds

19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in, Arg_0: Arg_0 {O(n)}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in, Arg_1: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in, Arg_0: Arg_0 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in, Arg_1: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin, Arg_0: Arg_0 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin, Arg_1: Arg_0+1 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_2: 0 {O(1)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in, Arg_0: Arg_0 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in, Arg_1: Arg_0+1 {O(n)}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in, Arg_0: Arg_0 {O(n)}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in, Arg_1: Arg_0+1 {O(n)}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in, Arg_0: Arg_0 {O(n)}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in, Arg_1: Arg_0+1 {O(n)}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in, Arg_0: Arg_0 {O(n)}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in, Arg_1: Arg_0+1 {O(n)}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in, Arg_0: Arg_0 {O(n)}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in, Arg_1: Arg_0+1 {O(n)}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in, Arg_0: Arg_0 {O(n)}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in, Arg_1: Arg_0+1 {O(n)}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in, Arg_0: Arg_0 {O(n)}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in, Arg_1: Arg_0+1 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_2: 2*Arg_0 {O(n)}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in, Arg_0: Arg_0 {O(n)}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in, Arg_1: Arg_0+1 {O(n)}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in, Arg_0: Arg_0 {O(n)}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in, Arg_1: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_0: Arg_0 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_1: 0 {O(1)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_2: Arg_2 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_3: Arg_3 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_0: Arg_0 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_1: Arg_1 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_2: Arg_2 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_3: Arg_3 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_0: Arg_0 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_1: Arg_1 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_2: Arg_2 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_3: Arg_3 {O(n)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop, Arg_0: 2*Arg_0 {O(n)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop, Arg_1: Arg_0+Arg_1+1 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_0: Arg_0 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_1: Arg_1 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_2: Arg_2 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_3: Arg_3 {O(n)}