Start: n_f2
Program_Vars: Arg_0, Arg_1
Temp_Vars: NoDet0
Locations: n_f1___1, n_f1___3, n_f2, n_f300___2, n_f300___4
Transitions:
0:n_f2(Arg_0,Arg_1) -> n_f300___4(Arg_0,Arg_1)
1:n_f300___2(Arg_0,Arg_1) -> n_f1___1(Arg_0,NoDet0):|:0<=1+Arg_0 && 1+Arg_0<=0
2:n_f300___2(Arg_0,Arg_1) -> n_f300___2(Arg_0-1,Arg_1):|:0<=1+Arg_0 && 0<=Arg_0
3:n_f300___4(Arg_0,Arg_1) -> n_f1___3(Arg_0,NoDet0):|:1+Arg_0<=0
4:n_f300___4(Arg_0,Arg_1) -> n_f300___2(Arg_0-1,Arg_1):|:0<=Arg_0
Eliminate variables {NoDet0,Arg_1} that do not contribute to the problem
Found invariant 0<=1+Arg_0 for location n_f300___2
Found invariant 1+Arg_0<=0 for location n_f1___3
Found invariant 1+Arg_0<=0 && 0<=1+Arg_0 for location n_f1___1
Start: n_f2
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f1___1, n_f1___3, n_f2, n_f300___2, n_f300___4
Transitions:
10:n_f2(Arg_0) -> n_f300___4(Arg_0)
11:n_f300___2(Arg_0) -> n_f1___1(Arg_0):|:0<=1+Arg_0 && 0<=1+Arg_0 && 1+Arg_0<=0
12:n_f300___2(Arg_0) -> n_f300___2(Arg_0-1):|:0<=1+Arg_0 && 0<=1+Arg_0 && 0<=Arg_0
13:n_f300___4(Arg_0) -> n_f1___3(Arg_0):|:1+Arg_0<=0
14:n_f300___4(Arg_0) -> n_f300___2(Arg_0-1):|:0<=Arg_0
new bound:
Arg_0+2 {O(n)}
MPRF:
n_f300___2 [Arg_0+1 ]
Overall timebound:Arg_0+6 {O(n)}
10: n_f2->n_f300___4: 1 {O(1)}
11: n_f300___2->n_f1___1: 1 {O(1)}
12: n_f300___2->n_f300___2: Arg_0+2 {O(n)}
13: n_f300___4->n_f1___3: 1 {O(1)}
14: n_f300___4->n_f300___2: 1 {O(1)}
Overall costbound: Arg_0+6 {O(n)}
10: n_f2->n_f300___4: 1 {O(1)}
11: n_f300___2->n_f1___1: 1 {O(1)}
12: n_f300___2->n_f300___2: Arg_0+2 {O(n)}
13: n_f300___4->n_f1___3: 1 {O(1)}
14: n_f300___4->n_f300___2: 1 {O(1)}
10: n_f2->n_f300___4, Arg_0: Arg_0 {O(n)}
11: n_f300___2->n_f1___1, Arg_0: 1 {O(1)}
12: n_f300___2->n_f300___2, Arg_0: Arg_0+2 {O(n)}
13: n_f300___4->n_f1___3, Arg_0: Arg_0 {O(n)}
14: n_f300___4->n_f300___2, Arg_0: Arg_0+1 {O(n)}