Start: evalEx6start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalEx6bb1in, evalEx6bb2in, evalEx6bb3in, evalEx6bbin, evalEx6entryin, evalEx6returnin, evalEx6start, evalEx6stop
Transitions:
6:evalEx6bb1in(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_0,Arg_1+1,Arg_2)
7:evalEx6bb2in(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_0+1,Arg_1,Arg_2)
2:evalEx6bb3in(Arg_0,Arg_1,Arg_2) -> evalEx6bbin(Arg_0,Arg_1,Arg_2):|:Arg_1+1<=Arg_2
3:evalEx6bb3in(Arg_0,Arg_1,Arg_2) -> evalEx6returnin(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1
4:evalEx6bbin(Arg_0,Arg_1,Arg_2) -> evalEx6bb1in(Arg_0,Arg_1,Arg_2):|:Arg_1+1<=Arg_0
5:evalEx6bbin(Arg_0,Arg_1,Arg_2) -> evalEx6bb2in(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_1
1:evalEx6entryin(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_1,Arg_0,Arg_2)
8:evalEx6returnin(Arg_0,Arg_1,Arg_2) -> evalEx6stop(Arg_0,Arg_1,Arg_2)
0:evalEx6start(Arg_0,Arg_1,Arg_2) -> evalEx6entryin(Arg_0,Arg_1,Arg_2)
Found invariant Arg_2<=Arg_1 for location evalEx6returnin
Found invariant Arg_2<=Arg_1 for location evalEx6stop
Found invariant 1+Arg_1<=Arg_2 && 1+Arg_1<=Arg_0 for location evalEx6bb1in
Found invariant 1+Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_0<=Arg_1 for location evalEx6bb2in
Found invariant 1+Arg_1<=Arg_2 for location evalEx6bbin
Start: evalEx6start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: evalEx6bb1in, evalEx6bb2in, evalEx6bb3in, evalEx6bbin, evalEx6entryin, evalEx6returnin, evalEx6start, evalEx6stop
Transitions:
6:evalEx6bb1in(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_0,Arg_1+1,Arg_2):|:1+Arg_1<=Arg_2 && 1+Arg_1<=Arg_0
7:evalEx6bb2in(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_0+1,Arg_1,Arg_2):|:1+Arg_1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_0<=Arg_1
2:evalEx6bb3in(Arg_0,Arg_1,Arg_2) -> evalEx6bbin(Arg_0,Arg_1,Arg_2):|:Arg_1+1<=Arg_2
3:evalEx6bb3in(Arg_0,Arg_1,Arg_2) -> evalEx6returnin(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1
4:evalEx6bbin(Arg_0,Arg_1,Arg_2) -> evalEx6bb1in(Arg_0,Arg_1,Arg_2):|:1+Arg_1<=Arg_2 && Arg_1+1<=Arg_0
5:evalEx6bbin(Arg_0,Arg_1,Arg_2) -> evalEx6bb2in(Arg_0,Arg_1,Arg_2):|:1+Arg_1<=Arg_2 && Arg_0<=Arg_1
1:evalEx6entryin(Arg_0,Arg_1,Arg_2) -> evalEx6bb3in(Arg_1,Arg_0,Arg_2)
8:evalEx6returnin(Arg_0,Arg_1,Arg_2) -> evalEx6stop(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_1
0:evalEx6start(Arg_0,Arg_1,Arg_2) -> evalEx6entryin(Arg_0,Arg_1,Arg_2)
new bound:
Arg_0+Arg_2 {O(n)}
MPRF:
evalEx6bb3in [Arg_2-Arg_1 ]
evalEx6bb1in [Arg_2-Arg_1 ]
evalEx6bbin [Arg_2-Arg_1 ]
evalEx6bb2in [Arg_2-Arg_1 ]
new bound:
Arg_1+Arg_2 {O(n)}
MPRF:
evalEx6bb3in [Arg_2-Arg_0 ]
evalEx6bb1in [Arg_2-Arg_0 ]
evalEx6bbin [Arg_2-Arg_0 ]
evalEx6bb2in [Arg_2-Arg_0 ]
new bound:
Arg_0+Arg_2 {O(n)}
MPRF:
evalEx6bb3in [Arg_2-Arg_1 ]
evalEx6bb1in [Arg_2-Arg_1-1 ]
evalEx6bbin [Arg_2-Arg_1 ]
evalEx6bb2in [Arg_2-Arg_1 ]
new bound:
Arg_1+Arg_2 {O(n)}
MPRF:
evalEx6bb3in [Arg_2-Arg_0 ]
evalEx6bb1in [Arg_2-Arg_0 ]
evalEx6bbin [Arg_2-Arg_0 ]
evalEx6bb2in [Arg_2-Arg_0-1 ]
knowledge_propagation leads to new time bound 2*Arg_2+Arg_0+Arg_1+1 {O(n)} for transition 2:evalEx6bb3in(Arg_0,Arg_1,Arg_2) -> evalEx6bbin(Arg_0,Arg_1,Arg_2):|:Arg_1+1<=Arg_2
Overall timebound:3*Arg_0+3*Arg_1+6*Arg_2+5 {O(n)}
6: evalEx6bb1in->evalEx6bb3in: Arg_0+Arg_2 {O(n)}
7: evalEx6bb2in->evalEx6bb3in: Arg_1+Arg_2 {O(n)}
2: evalEx6bb3in->evalEx6bbin: 2*Arg_2+Arg_0+Arg_1+1 {O(n)}
3: evalEx6bb3in->evalEx6returnin: 1 {O(1)}
4: evalEx6bbin->evalEx6bb1in: Arg_0+Arg_2 {O(n)}
5: evalEx6bbin->evalEx6bb2in: Arg_1+Arg_2 {O(n)}
1: evalEx6entryin->evalEx6bb3in: 1 {O(1)}
8: evalEx6returnin->evalEx6stop: 1 {O(1)}
0: evalEx6start->evalEx6entryin: 1 {O(1)}
Overall costbound: 3*Arg_0+3*Arg_1+6*Arg_2+5 {O(n)}
6: evalEx6bb1in->evalEx6bb3in: Arg_0+Arg_2 {O(n)}
7: evalEx6bb2in->evalEx6bb3in: Arg_1+Arg_2 {O(n)}
2: evalEx6bb3in->evalEx6bbin: 2*Arg_2+Arg_0+Arg_1+1 {O(n)}
3: evalEx6bb3in->evalEx6returnin: 1 {O(1)}
4: evalEx6bbin->evalEx6bb1in: Arg_0+Arg_2 {O(n)}
5: evalEx6bbin->evalEx6bb2in: Arg_1+Arg_2 {O(n)}
1: evalEx6entryin->evalEx6bb3in: 1 {O(1)}
8: evalEx6returnin->evalEx6stop: 1 {O(1)}
0: evalEx6start->evalEx6entryin: 1 {O(1)}
6: evalEx6bb1in->evalEx6bb3in, Arg_0: 2*Arg_1+Arg_2 {O(n)}
6: evalEx6bb1in->evalEx6bb3in, Arg_1: 2*Arg_0+Arg_2 {O(n)}
6: evalEx6bb1in->evalEx6bb3in, Arg_2: Arg_2 {O(n)}
7: evalEx6bb2in->evalEx6bb3in, Arg_0: 2*Arg_1+Arg_2 {O(n)}
7: evalEx6bb2in->evalEx6bb3in, Arg_1: 2*Arg_0+Arg_2 {O(n)}
7: evalEx6bb2in->evalEx6bb3in, Arg_2: Arg_2 {O(n)}
2: evalEx6bb3in->evalEx6bbin, Arg_0: 2*Arg_1+Arg_2 {O(n)}
2: evalEx6bb3in->evalEx6bbin, Arg_1: 2*Arg_0+Arg_2 {O(n)}
2: evalEx6bb3in->evalEx6bbin, Arg_2: Arg_2 {O(n)}
3: evalEx6bb3in->evalEx6returnin, Arg_0: 3*Arg_1+Arg_2 {O(n)}
3: evalEx6bb3in->evalEx6returnin, Arg_1: 3*Arg_0+Arg_2 {O(n)}
3: evalEx6bb3in->evalEx6returnin, Arg_2: 2*Arg_2 {O(n)}
4: evalEx6bbin->evalEx6bb1in, Arg_0: 2*Arg_1+Arg_2 {O(n)}
4: evalEx6bbin->evalEx6bb1in, Arg_1: 2*Arg_0+Arg_2 {O(n)}
4: evalEx6bbin->evalEx6bb1in, Arg_2: Arg_2 {O(n)}
5: evalEx6bbin->evalEx6bb2in, Arg_0: 2*Arg_1+Arg_2 {O(n)}
5: evalEx6bbin->evalEx6bb2in, Arg_1: 2*Arg_0+Arg_2 {O(n)}
5: evalEx6bbin->evalEx6bb2in, Arg_2: Arg_2 {O(n)}
1: evalEx6entryin->evalEx6bb3in, Arg_0: Arg_1 {O(n)}
1: evalEx6entryin->evalEx6bb3in, Arg_1: Arg_0 {O(n)}
1: evalEx6entryin->evalEx6bb3in, Arg_2: Arg_2 {O(n)}
8: evalEx6returnin->evalEx6stop, Arg_0: 3*Arg_1+Arg_2 {O(n)}
8: evalEx6returnin->evalEx6stop, Arg_1: 3*Arg_0+Arg_2 {O(n)}
8: evalEx6returnin->evalEx6stop, Arg_2: 2*Arg_2 {O(n)}
0: evalEx6start->evalEx6entryin, Arg_0: Arg_0 {O(n)}
0: evalEx6start->evalEx6entryin, Arg_1: Arg_1 {O(n)}
0: evalEx6start->evalEx6entryin, Arg_2: Arg_2 {O(n)}