Start: l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1) -> l1(Arg_0,Arg_1)
1:l1(Arg_0,Arg_1) -> l1(2*Arg_0,Arg_1+1):|:1<=Arg_0 && Arg_0<=Arg_1+1
Start: l0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: l0, l1
Transitions:
0:l0(Arg_0,Arg_1) -> l1(Arg_0,Arg_1)
1:l1(Arg_0,Arg_1) -> l1(2*Arg_0,Arg_1+1):|:1<=Arg_0 && Arg_0<=Arg_1+1
new bound:
16*Arg_0+8*Arg_1+25 {O(n)}
MPRF:
l1 [2-Arg_0 ; Arg_1+1-Arg_0 ]
Overall timebound:16*Arg_0+8*Arg_1+26 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 16*Arg_0+8*Arg_1+25 {O(n)}
Overall costbound: 16*Arg_0+8*Arg_1+26 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: 16*Arg_0+8*Arg_1+25 {O(n)}
0: l0->l1, Arg_0: Arg_0 {O(n)}
0: l0->l1, Arg_1: Arg_1 {O(n)}
1: l1->l1, Arg_0: 2^(16*Arg_0+8*Arg_1+25)*Arg_0 {O(EXP)}
1: l1->l1, Arg_1: 16*Arg_0+9*Arg_1+25 {O(n)}