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_2,Arg_2):|:1<=Arg_0 && Arg_0<=Arg_1+1
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_2,Arg_2):|:1<=Arg_0 && Arg_0<=Arg_1+1
new bound:
8*Arg_0+8*Arg_1+8*Arg_2+17 {O(n)}
MPRF:
l1 [Arg_2+2-Arg_0 ; Arg_1 ]
Overall timebound:8*Arg_0+8*Arg_1+8*Arg_2+18 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 8*Arg_0+8*Arg_1+8*Arg_2+17 {O(n)}
Overall costbound: 8*Arg_0+8*Arg_1+8*Arg_2+18 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 8*Arg_0+8*Arg_1+8*Arg_2+17 {O(n)}
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_0: 2^(8*Arg_0+8*Arg_1+8*Arg_2+17)*Arg_0 {O(EXP)}
1: l1->l1, Arg_1: 2*Arg_2 {O(n)}
1: l1->l1, Arg_2: Arg_2 {O(n)}