Start: eval_foo_start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
1:eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_3,Arg_1,Arg_2,Arg_3)
2:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<Arg_2
3:eval_foo_bb1_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_0
4:eval_foo_bb2_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_2+1,Arg_1,Arg_2,Arg_3)
5:eval_foo_bb3_in(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:eval_foo_start(Arg_0,Arg_1,Arg_2,Arg_3) -> eval_foo_bb0_in(Arg_0,Arg_1,Arg_2,Arg_3)
Eliminate variables {Arg_1} that do not contribute to the problem
Found invariant Arg_3<=Arg_0 && Arg_2<=Arg_0 for location eval_foo_stop
Found invariant Arg_3<=Arg_0 && Arg_2<=Arg_0 for location eval_foo_bb3_in
Found invariant 1+Arg_3<=Arg_2 && Arg_3<=Arg_0 && 1+Arg_0<=Arg_2 for location eval_foo_bb2_in
Found invariant Arg_3<=Arg_0 for location eval_foo_bb1_in
Start: eval_foo_start
Program_Vars: Arg_0, Arg_2, Arg_3
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
13:eval_foo_bb0_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_3,Arg_2,Arg_3)
14:eval_foo_bb1_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_2,Arg_3):|:Arg_3<=Arg_0 && Arg_0<Arg_2
15:eval_foo_bb1_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb3_in(Arg_0,Arg_2,Arg_3):|:Arg_3<=Arg_0 && Arg_2<=Arg_0
16:eval_foo_bb2_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_2+1,Arg_2,Arg_3):|:1+Arg_3<=Arg_2 && Arg_3<=Arg_0 && 1+Arg_0<=Arg_2
17:eval_foo_bb3_in(Arg_0,Arg_2,Arg_3) -> eval_foo_stop(Arg_0,Arg_2,Arg_3):|:Arg_3<=Arg_0 && Arg_2<=Arg_0
18:eval_foo_start(Arg_0,Arg_2,Arg_3) -> eval_foo_bb0_in(Arg_0,Arg_2,Arg_3)
knowledge_propagation leads to new time bound 1 {O(1)} for transition 14:eval_foo_bb1_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb2_in(Arg_0,Arg_2,Arg_3):|:Arg_3<=Arg_0 && Arg_0<Arg_2
knowledge_propagation leads to new time bound 1 {O(1)} for transition 16:eval_foo_bb2_in(Arg_0,Arg_2,Arg_3) -> eval_foo_bb1_in(Arg_2+1,Arg_2,Arg_3):|:1+Arg_3<=Arg_2 && Arg_3<=Arg_0 && 1+Arg_0<=Arg_2
Overall timebound:6 {O(1)}
13: eval_foo_bb0_in->eval_foo_bb1_in: 1 {O(1)}
14: eval_foo_bb1_in->eval_foo_bb2_in: 1 {O(1)}
15: eval_foo_bb1_in->eval_foo_bb3_in: 1 {O(1)}
16: eval_foo_bb2_in->eval_foo_bb1_in: 1 {O(1)}
17: eval_foo_bb3_in->eval_foo_stop: 1 {O(1)}
18: eval_foo_start->eval_foo_bb0_in: 1 {O(1)}
Overall costbound: 6 {O(1)}
13: eval_foo_bb0_in->eval_foo_bb1_in: 1 {O(1)}
14: eval_foo_bb1_in->eval_foo_bb2_in: 1 {O(1)}
15: eval_foo_bb1_in->eval_foo_bb3_in: 1 {O(1)}
16: eval_foo_bb2_in->eval_foo_bb1_in: 1 {O(1)}
17: eval_foo_bb3_in->eval_foo_stop: 1 {O(1)}
18: eval_foo_start->eval_foo_bb0_in: 1 {O(1)}
13: eval_foo_bb0_in->eval_foo_bb1_in, Arg_0: Arg_3 {O(n)}
13: eval_foo_bb0_in->eval_foo_bb1_in, Arg_2: Arg_2 {O(n)}
13: eval_foo_bb0_in->eval_foo_bb1_in, Arg_3: Arg_3 {O(n)}
14: eval_foo_bb1_in->eval_foo_bb2_in, Arg_0: Arg_3 {O(n)}
14: eval_foo_bb1_in->eval_foo_bb2_in, Arg_2: Arg_2 {O(n)}
14: eval_foo_bb1_in->eval_foo_bb2_in, Arg_3: Arg_3 {O(n)}
15: eval_foo_bb1_in->eval_foo_bb3_in, Arg_0: Arg_2+Arg_3+1 {O(n)}
15: eval_foo_bb1_in->eval_foo_bb3_in, Arg_2: 2*Arg_2 {O(n)}
15: eval_foo_bb1_in->eval_foo_bb3_in, Arg_3: 2*Arg_3 {O(n)}
16: eval_foo_bb2_in->eval_foo_bb1_in, Arg_0: Arg_2+1 {O(n)}
16: eval_foo_bb2_in->eval_foo_bb1_in, Arg_2: Arg_2 {O(n)}
16: eval_foo_bb2_in->eval_foo_bb1_in, Arg_3: Arg_3 {O(n)}
17: eval_foo_bb3_in->eval_foo_stop, Arg_0: Arg_2+Arg_3+1 {O(n)}
17: eval_foo_bb3_in->eval_foo_stop, Arg_2: 2*Arg_2 {O(n)}
17: eval_foo_bb3_in->eval_foo_stop, Arg_3: 2*Arg_3 {O(n)}
18: eval_foo_start->eval_foo_bb0_in, Arg_0: Arg_0 {O(n)}
18: eval_foo_start->eval_foo_bb0_in, Arg_2: Arg_2 {O(n)}
18: eval_foo_start->eval_foo_bb0_in, Arg_3: Arg_3 {O(n)}