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