Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2) -> l1(Arg_0,Arg_1,Arg_2)
1:l1(Arg_0,Arg_1,Arg_2) -> l1(2*Arg_0+Arg_1,Arg_1+1,Arg_2):|:1<=Arg_0 && Arg_0<=Arg_2
Start: l0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1,Arg_2) -> l1(Arg_0,Arg_1,Arg_2)
1:l1(Arg_0,Arg_1,Arg_2) -> l1(2*Arg_0+Arg_1,Arg_1+1,Arg_2):|:1<=Arg_0 && Arg_0<=Arg_2
Overall timebound:inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
Overall costbound: inf {Infinity}
0: l0->l1: 1 {O(1)}
1: l1->l1: inf {Infinity}
0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
0: l0->l1, Arg_2: Arg_2 {O(n)}
1: l1->l1, Arg_2: Arg_2 {O(n)}