Initial Problem

Start: evalSimpleSingle2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: evalSimpleSingle2bb1in, evalSimpleSingle2bb2in, evalSimpleSingle2bb3in, evalSimpleSingle2bb4in, evalSimpleSingle2bbin, evalSimpleSingle2entryin, evalSimpleSingle2returnin, evalSimpleSingle2start, evalSimpleSingle2stop
Transitions:
7:evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3)
8:evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0+1<=Arg_3
9:evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_0
10:evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3)
2:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:E+1<=0
3:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=E
4:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3)
5:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+1<=Arg_2
6:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1
1:evalSimpleSingle2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(0,0,Arg_2,Arg_3)
11:evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalSimpleSingle2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2entryin(Arg_0,Arg_1,Arg_2,Arg_3)

Preprocessing

Found invariant 1<=Arg_2 && 1<=Arg_1+Arg_2 && 1+Arg_1<=Arg_2 && 1<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2bb1in

Found invariant Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2bb4in

Found invariant Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2stop

Found invariant 1<=Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 1+Arg_1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2bb3in

Found invariant Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2returnin

Found invariant Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 for location evalSimpleSingle2bbin

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

Problem after Preprocessing

Start: evalSimpleSingle2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: evalSimpleSingle2bb1in, evalSimpleSingle2bb2in, evalSimpleSingle2bb3in, evalSimpleSingle2bb4in, evalSimpleSingle2bbin, evalSimpleSingle2entryin, evalSimpleSingle2returnin, evalSimpleSingle2start, evalSimpleSingle2stop
Transitions:
7:evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3):|:1<=Arg_2 && 1<=Arg_1+Arg_2 && 1+Arg_1<=Arg_2 && 1<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0
8:evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_0+1<=Arg_3
9:evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_3<=Arg_0
10:evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3):|:1<=Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 1+Arg_1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0
2:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && E+1<=0
3:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && 1<=E
4:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0
5:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_1+1<=Arg_2
6:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_2<=Arg_1
1:evalSimpleSingle2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(0,0,Arg_2,Arg_3)
11:evalSimpleSingle2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2stop(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0
0:evalSimpleSingle2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2entryin(Arg_0,Arg_1,Arg_2,Arg_3)

MPRF for transition 7:evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3):|:1<=Arg_2 && 1<=Arg_1+Arg_2 && 1+Arg_1<=Arg_2 && 1<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 of depth 1:

new bound:

Arg_2 {O(n)}

MPRF:

evalSimpleSingle2bb3in [Arg_2-Arg_1 ]
evalSimpleSingle2bb4in [Arg_2-Arg_0 ]
evalSimpleSingle2bb1in [Arg_2-Arg_0 ]
evalSimpleSingle2bbin [Arg_2-Arg_1 ]
evalSimpleSingle2bb2in [Arg_2-Arg_0 ]

MPRF for transition 8:evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_0+1<=Arg_3 of depth 1:

new bound:

Arg_3 {O(n)}

MPRF:

evalSimpleSingle2bb3in [Arg_3-Arg_0-1 ]
evalSimpleSingle2bb4in [Arg_3-Arg_0 ]
evalSimpleSingle2bb1in [Arg_3-Arg_0-1 ]
evalSimpleSingle2bbin [Arg_3-Arg_1 ]
evalSimpleSingle2bb2in [Arg_3-Arg_0 ]

MPRF for transition 10:evalSimpleSingle2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb4in(Arg_0+1,Arg_1+1,Arg_2,Arg_3):|:1<=Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 1+Arg_1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 of depth 1:

new bound:

Arg_3 {O(n)}

MPRF:

evalSimpleSingle2bb3in [Arg_3-Arg_1 ]
evalSimpleSingle2bb4in [Arg_3-Arg_1 ]
evalSimpleSingle2bb1in [Arg_3-Arg_0 ]
evalSimpleSingle2bbin [Arg_3-Arg_0 ]
evalSimpleSingle2bb2in [Arg_3-Arg_0 ]

MPRF for transition 5:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_1+1<=Arg_2 of depth 1:

new bound:

Arg_2 {O(n)}

MPRF:

evalSimpleSingle2bb3in [Arg_2-Arg_0 ]
evalSimpleSingle2bb4in [Arg_2-Arg_1 ]
evalSimpleSingle2bb1in [Arg_2-Arg_0-1 ]
evalSimpleSingle2bbin [Arg_2-Arg_0 ]
evalSimpleSingle2bb2in [Arg_2-Arg_1 ]

knowledge_propagation leads to new time bound Arg_2+Arg_3+1 {O(n)} for transition 2:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && E+1<=0

knowledge_propagation leads to new time bound Arg_2+Arg_3+1 {O(n)} for transition 3:evalSimpleSingle2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && 1<=E

knowledge_propagation leads to new time bound 2*Arg_2+2*Arg_3+2 {O(n)} for transition 6:evalSimpleSingle2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalSimpleSingle2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 0<=Arg_0 && Arg_2<=Arg_1

All Bounds

Timebounds

Overall timebound:6*Arg_2+6*Arg_3+9 {O(n)}
7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in: Arg_2 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in: Arg_3 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin: 1 {O(1)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in: Arg_3 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin: Arg_2+Arg_3+1 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin: Arg_2+Arg_3+1 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin: 1 {O(1)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in: Arg_2 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in: 2*Arg_2+2*Arg_3+2 {O(n)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in: 1 {O(1)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop: 1 {O(1)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin: 1 {O(1)}

Costbounds

Overall costbound: 6*Arg_2+6*Arg_3+9 {O(n)}
7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in: Arg_2 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in: Arg_3 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin: 1 {O(1)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in: Arg_3 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin: Arg_2+Arg_3+1 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin: Arg_2+Arg_3+1 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin: 1 {O(1)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in: Arg_2 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in: 2*Arg_2+2*Arg_3+2 {O(n)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in: 1 {O(1)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop: 1 {O(1)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin: 1 {O(1)}

Sizebounds

7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in, Arg_0: Arg_2+Arg_3 {O(n)}
7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in, Arg_1: Arg_2+Arg_3 {O(n)}
7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in, Arg_2: 2*Arg_2 {O(n)}
7: evalSimpleSingle2bb1in->evalSimpleSingle2bb4in, Arg_3: 2*Arg_3 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in, Arg_0: Arg_2+Arg_3 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in, Arg_1: Arg_2+Arg_3 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in, Arg_2: 2*Arg_2 {O(n)}
8: evalSimpleSingle2bb2in->evalSimpleSingle2bb3in, Arg_3: 2*Arg_3 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin, Arg_0: Arg_2+Arg_3 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin, Arg_1: Arg_2+Arg_3 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin, Arg_2: 2*Arg_2 {O(n)}
9: evalSimpleSingle2bb2in->evalSimpleSingle2returnin, Arg_3: 2*Arg_3 {O(n)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in, Arg_0: Arg_2+Arg_3 {O(n)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in, Arg_1: Arg_2+Arg_3 {O(n)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in, Arg_2: 2*Arg_2 {O(n)}
10: evalSimpleSingle2bb3in->evalSimpleSingle2bb4in, Arg_3: 2*Arg_3 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_0: Arg_2+Arg_3 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_1: Arg_2+Arg_3 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_2: 2*Arg_2 {O(n)}
2: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_3: 2*Arg_3 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_0: Arg_2+Arg_3 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_1: Arg_2+Arg_3 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_2: 2*Arg_2 {O(n)}
3: evalSimpleSingle2bb4in->evalSimpleSingle2bbin, Arg_3: 2*Arg_3 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin, Arg_0: 2*Arg_2+2*Arg_3 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin, Arg_1: 2*Arg_2+2*Arg_3 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin, Arg_2: 5*Arg_2 {O(n)}
4: evalSimpleSingle2bb4in->evalSimpleSingle2returnin, Arg_3: 5*Arg_3 {O(n)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in, Arg_0: Arg_2+Arg_3 {O(n)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in, Arg_1: Arg_2+Arg_3 {O(n)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in, Arg_2: 2*Arg_2 {O(n)}
5: evalSimpleSingle2bbin->evalSimpleSingle2bb1in, Arg_3: 2*Arg_3 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in, Arg_0: Arg_2+Arg_3 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in, Arg_1: Arg_2+Arg_3 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in, Arg_2: 2*Arg_2 {O(n)}
6: evalSimpleSingle2bbin->evalSimpleSingle2bb2in, Arg_3: 2*Arg_3 {O(n)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in, Arg_0: 0 {O(1)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in, Arg_1: 0 {O(1)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in, Arg_2: Arg_2 {O(n)}
1: evalSimpleSingle2entryin->evalSimpleSingle2bb4in, Arg_3: Arg_3 {O(n)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop, Arg_0: 3*Arg_2+3*Arg_3 {O(n)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop, Arg_1: 3*Arg_2+3*Arg_3 {O(n)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop, Arg_2: 7*Arg_2 {O(n)}
11: evalSimpleSingle2returnin->evalSimpleSingle2stop, Arg_3: 7*Arg_3 {O(n)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin, Arg_0: Arg_0 {O(n)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin, Arg_1: Arg_1 {O(n)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin, Arg_2: Arg_2 {O(n)}
0: evalSimpleSingle2start->evalSimpleSingle2entryin, Arg_3: Arg_3 {O(n)}