Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: ack, start
Transitions:
0:ack(Arg_0,Arg_1) -> ack(Arg_0-1,C):|:1<=Arg_0 && 1<=Arg_1
1:ack(Arg_0,Arg_1) -> ack(Arg_0,Arg_1-1):|:1<=Arg_0 && 1<=Arg_1
2:start(Arg_0,Arg_1) -> ack(Arg_0,Arg_1)
Start: start
Program_Vars: Arg_0, Arg_1
Temp_Vars: C
Locations: ack, start
Transitions:
0:ack(Arg_0,Arg_1) -> ack(Arg_0-1,C):|:1<=Arg_0 && 1<=Arg_1
1:ack(Arg_0,Arg_1) -> ack(Arg_0,Arg_1-1):|:1<=Arg_0 && 1<=Arg_1
2:start(Arg_0,Arg_1) -> ack(Arg_0,Arg_1)
new bound:
Arg_0 {O(n)}
MPRF:
ack [Arg_0 ]
Overall timebound:inf {Infinity}
0: ack->ack: Arg_0 {O(n)}
1: ack->ack: inf {Infinity}
2: start->ack: 1 {O(1)}
Overall costbound: inf {Infinity}
0: ack->ack: Arg_0 {O(n)}
1: ack->ack: inf {Infinity}
2: start->ack: 1 {O(1)}
0: ack->ack, Arg_0: 2*Arg_0 {O(n)}
1: ack->ack, Arg_0: 2*Arg_0 {O(n)}
2: start->ack, Arg_0: Arg_0 {O(n)}
2: start->ack, Arg_1: Arg_1 {O(n)}