Start: eval_easy2_start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: eval_easy2_bb0_in, eval_easy2_bb1_in, eval_easy2_bb2_in, eval_easy2_bb3_in, eval_easy2_start, eval_easy2_stop
Transitions:
1:eval_easy2_bb0_in(Arg_0,Arg_1) -> eval_easy2_bb1_in(Arg_1,Arg_1)
2:eval_easy2_bb1_in(Arg_0,Arg_1) -> eval_easy2_bb2_in(Arg_0,Arg_1):|:0<Arg_0
3:eval_easy2_bb1_in(Arg_0,Arg_1) -> eval_easy2_bb3_in(Arg_0,Arg_1):|:Arg_0<=0
4:eval_easy2_bb2_in(Arg_0,Arg_1) -> eval_easy2_bb1_in(Arg_0-1,Arg_1)
5:eval_easy2_bb3_in(Arg_0,Arg_1) -> eval_easy2_stop(Arg_0,Arg_1)
0:eval_easy2_start(Arg_0,Arg_1) -> eval_easy2_bb0_in(Arg_0,Arg_1)
Found invariant 1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 1<=Arg_0 for location eval_easy2_bb2_in
Found invariant Arg_0<=Arg_1 for location eval_easy2_bb1_in
Found invariant Arg_0<=Arg_1 && Arg_0<=0 for location eval_easy2_bb3_in
Found invariant Arg_0<=Arg_1 && Arg_0<=0 for location eval_easy2_stop
Start: eval_easy2_start
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: eval_easy2_bb0_in, eval_easy2_bb1_in, eval_easy2_bb2_in, eval_easy2_bb3_in, eval_easy2_start, eval_easy2_stop
Transitions:
1:eval_easy2_bb0_in(Arg_0,Arg_1) -> eval_easy2_bb1_in(Arg_1,Arg_1)
2:eval_easy2_bb1_in(Arg_0,Arg_1) -> eval_easy2_bb2_in(Arg_0,Arg_1):|:Arg_0<=Arg_1 && 0<Arg_0
3:eval_easy2_bb1_in(Arg_0,Arg_1) -> eval_easy2_bb3_in(Arg_0,Arg_1):|:Arg_0<=Arg_1 && Arg_0<=0
4:eval_easy2_bb2_in(Arg_0,Arg_1) -> eval_easy2_bb1_in(Arg_0-1,Arg_1):|:1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 1<=Arg_0
5:eval_easy2_bb3_in(Arg_0,Arg_1) -> eval_easy2_stop(Arg_0,Arg_1):|:Arg_0<=Arg_1 && Arg_0<=0
0:eval_easy2_start(Arg_0,Arg_1) -> eval_easy2_bb0_in(Arg_0,Arg_1)
new bound:
Arg_1 {O(n)}
MPRF:
eval_easy2_bb2_in [Arg_0-1 ]
eval_easy2_bb1_in [Arg_0 ]
new bound:
Arg_1 {O(n)}
MPRF:
eval_easy2_bb2_in [Arg_0 ]
eval_easy2_bb1_in [Arg_0 ]
Overall timebound:2*Arg_1+4 {O(n)}
1: eval_easy2_bb0_in->eval_easy2_bb1_in: 1 {O(1)}
2: eval_easy2_bb1_in->eval_easy2_bb2_in: Arg_1 {O(n)}
3: eval_easy2_bb1_in->eval_easy2_bb3_in: 1 {O(1)}
4: eval_easy2_bb2_in->eval_easy2_bb1_in: Arg_1 {O(n)}
5: eval_easy2_bb3_in->eval_easy2_stop: 1 {O(1)}
0: eval_easy2_start->eval_easy2_bb0_in: 1 {O(1)}
Overall costbound: 2*Arg_1+4 {O(n)}
1: eval_easy2_bb0_in->eval_easy2_bb1_in: 1 {O(1)}
2: eval_easy2_bb1_in->eval_easy2_bb2_in: Arg_1 {O(n)}
3: eval_easy2_bb1_in->eval_easy2_bb3_in: 1 {O(1)}
4: eval_easy2_bb2_in->eval_easy2_bb1_in: Arg_1 {O(n)}
5: eval_easy2_bb3_in->eval_easy2_stop: 1 {O(1)}
0: eval_easy2_start->eval_easy2_bb0_in: 1 {O(1)}
1: eval_easy2_bb0_in->eval_easy2_bb1_in, Arg_0: Arg_1 {O(n)}
1: eval_easy2_bb0_in->eval_easy2_bb1_in, Arg_1: Arg_1 {O(n)}
2: eval_easy2_bb1_in->eval_easy2_bb2_in, Arg_0: Arg_1 {O(n)}
2: eval_easy2_bb1_in->eval_easy2_bb2_in, Arg_1: Arg_1 {O(n)}
3: eval_easy2_bb1_in->eval_easy2_bb3_in, Arg_0: 2*Arg_1 {O(n)}
3: eval_easy2_bb1_in->eval_easy2_bb3_in, Arg_1: 2*Arg_1 {O(n)}
4: eval_easy2_bb2_in->eval_easy2_bb1_in, Arg_0: Arg_1 {O(n)}
4: eval_easy2_bb2_in->eval_easy2_bb1_in, Arg_1: Arg_1 {O(n)}
5: eval_easy2_bb3_in->eval_easy2_stop, Arg_0: 2*Arg_1 {O(n)}
5: eval_easy2_bb3_in->eval_easy2_stop, Arg_1: 2*Arg_1 {O(n)}
0: eval_easy2_start->eval_easy2_bb0_in, Arg_0: Arg_0 {O(n)}
0: eval_easy2_start->eval_easy2_bb0_in, Arg_1: Arg_1 {O(n)}