Start: start
Program_Vars: Arg_0
Temp_Vars: B, C
Locations: eval, start
Transitions:
0:eval(Arg_0) -> eval(2*C-1):|:2*B<=2*C && 2*C<=1+2*B && 1<=2*C && Arg_0<=2*C && 2*C<=Arg_0
1:start(Arg_0) -> eval(Arg_0)
Start: start
Program_Vars: Arg_0
Temp_Vars: B, C
Locations: eval, start
Transitions:
0:eval(Arg_0) -> eval(2*C-1):|:2*B<=2*C && 2*C<=1+2*B && 1<=2*C && Arg_0<=2*C && 2*C<=Arg_0
1:start(Arg_0) -> eval(Arg_0)
knowledge_propagation leads to new time bound 1 {O(1)} for transition 0:eval(Arg_0) -> eval(2*C-1):|:2*B<=2*C && 2*C<=1+2*B && 1<=2*C && Arg_0<=2*C && 2*C<=Arg_0
Overall timebound:2 {O(1)}
0: eval->eval: 1 {O(1)}
1: start->eval: 1 {O(1)}
Overall costbound: 2 {O(1)}
0: eval->eval: 1 {O(1)}
1: start->eval: 1 {O(1)}
0: eval->eval, Arg_0: Arg_0 {O(n)}
1: start->eval, Arg_0: Arg_0 {O(n)}