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(Arg_0+Arg_1,Arg_1-1):|:1<=Arg_0 && Arg_1+1<=0
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(Arg_0+Arg_1,Arg_1-1):|:1<=Arg_0 && Arg_1+1<=0
new bound:
Arg_0 {O(n)}
MPRF:
l1 [Arg_0 ]
Overall timebound:Arg_0+1 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: Arg_0 {O(n)}
Overall costbound: Arg_0+1 {O(n)}
0: l0->l1: 1 {O(1)}
1: l1->l1: Arg_0 {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*Arg_0+2*Arg_1 {O(n)}
1: l1->l1, Arg_1: Arg_0+Arg_1 {O(n)}