Start: n_f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: B_P, NoDet0
Locations: n_f0, n_f1___3, n_f1___4, n_f4___1, n_f4___2
Transitions:
0:n_f0(Arg_0,Arg_1,Arg_2) -> n_f1___4(0,Arg_1,Arg_2)
1:n_f1___3(Arg_0,Arg_1,Arg_2) -> n_f1___3(Arg_0,B_P,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && 0<=Arg_1 && 0<=B_P && Arg_1<=B_P+1 && 1+B_P<=Arg_1
2:n_f1___3(Arg_0,Arg_1,Arg_2) -> n_f4___2(Arg_0,B_P,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && 0<=Arg_1 && B_P<=0 && Arg_1<=B_P && B_P<=Arg_1
3:n_f1___4(Arg_0,Arg_1,Arg_2) -> n_f1___3(Arg_0,B_P,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && 0<=B_P && Arg_1<=B_P+1 && 1+B_P<=Arg_1
4:n_f1___4(Arg_0,Arg_1,Arg_2) -> n_f4___2(Arg_0,B_P,NoDet0):|:Arg_0<=0 && 0<=Arg_0 && B_P<=0 && Arg_1<=B_P && B_P<=Arg_1
5:n_f4___1(Arg_0,Arg_1,Arg_2) -> n_f4___1(1,Arg_1,NoDet0):|:Arg_1<=0 && Arg_0<=1 && 1<=Arg_0
6:n_f4___2(Arg_0,Arg_1,Arg_2) -> n_f4___1(1,Arg_1,NoDet0):|:Arg_1<=0
Eliminate variables {NoDet0,Arg_2} that do not contribute to the problem
Found invariant Arg_1<=0 && 1+Arg_1<=Arg_0 && Arg_0+Arg_1<=1 && Arg_0<=1 && 1<=Arg_0 for location n_f4___1
Found invariant Arg_0<=0 && 0<=Arg_0 for location n_f1___4
Found invariant 0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=0 && 0<=Arg_0 for location n_f1___3
Found invariant Arg_1<=0 && Arg_1<=Arg_0 && Arg_0+Arg_1<=0 && Arg_0<=0 && 0<=Arg_0 for location n_f4___2
Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: B_P
Locations: n_f0, n_f1___3, n_f1___4, n_f4___1, n_f4___2
Transitions:
14:n_f0(Arg_0,Arg_1) -> n_f1___4(0,Arg_1)
15:n_f1___3(Arg_0,Arg_1) -> n_f1___3(Arg_0,B_P):|:0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 0<=Arg_1 && 0<=B_P && Arg_1<=B_P+1 && 1+B_P<=Arg_1
16:n_f1___3(Arg_0,Arg_1) -> n_f4___2(Arg_0,B_P):|:0<=Arg_1 && 0<=Arg_0+Arg_1 && Arg_0<=Arg_1 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 0<=Arg_1 && B_P<=0 && Arg_1<=B_P && B_P<=Arg_1
17:n_f1___4(Arg_0,Arg_1) -> n_f1___3(Arg_0,B_P):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && 0<=B_P && Arg_1<=B_P+1 && 1+B_P<=Arg_1
18:n_f1___4(Arg_0,Arg_1) -> n_f4___2(Arg_0,B_P):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 0<=Arg_0 && B_P<=0 && Arg_1<=B_P && B_P<=Arg_1
19:n_f4___1(Arg_0,Arg_1) -> n_f4___1(1,Arg_1):|:Arg_1<=0 && 1+Arg_1<=Arg_0 && Arg_0+Arg_1<=1 && Arg_0<=1 && 1<=Arg_0 && Arg_1<=0 && Arg_0<=1 && 1<=Arg_0
20:n_f4___2(Arg_0,Arg_1) -> n_f4___1(1,Arg_1):|:Arg_1<=0 && Arg_1<=Arg_0 && Arg_0+Arg_1<=0 && Arg_0<=0 && 0<=Arg_0 && Arg_1<=0
new bound:
Arg_1+1 {O(n)}
MPRF:
n_f1___3 [Arg_1+1 ]
Overall timebound:inf {Infinity}
14: n_f0->n_f1___4: 1 {O(1)}
15: n_f1___3->n_f1___3: Arg_1+1 {O(n)}
16: n_f1___3->n_f4___2: 1 {O(1)}
17: n_f1___4->n_f1___3: 1 {O(1)}
18: n_f1___4->n_f4___2: 1 {O(1)}
19: n_f4___1->n_f4___1: inf {Infinity}
20: n_f4___2->n_f4___1: 1 {O(1)}
Overall costbound: inf {Infinity}
14: n_f0->n_f1___4: 1 {O(1)}
15: n_f1___3->n_f1___3: Arg_1+1 {O(n)}
16: n_f1___3->n_f4___2: 1 {O(1)}
17: n_f1___4->n_f1___3: 1 {O(1)}
18: n_f1___4->n_f4___2: 1 {O(1)}
19: n_f4___1->n_f4___1: inf {Infinity}
20: n_f4___2->n_f4___1: 1 {O(1)}
14: n_f0->n_f1___4, Arg_0: 0 {O(1)}
14: n_f0->n_f1___4, Arg_1: Arg_1 {O(n)}
15: n_f1___3->n_f1___3, Arg_0: 0 {O(1)}
15: n_f1___3->n_f1___3, Arg_1: Arg_1 {O(n)}
16: n_f1___3->n_f4___2, Arg_0: 0 {O(1)}
16: n_f1___3->n_f4___2, Arg_1: 0 {O(1)}
17: n_f1___4->n_f1___3, Arg_0: 0 {O(1)}
17: n_f1___4->n_f1___3, Arg_1: Arg_1 {O(n)}
18: n_f1___4->n_f4___2, Arg_0: 0 {O(1)}
18: n_f1___4->n_f4___2, Arg_1: Arg_1 {O(n)}
19: n_f4___1->n_f4___1, Arg_0: 1 {O(1)}
19: n_f4___1->n_f4___1, Arg_1: Arg_1 {O(n)}
20: n_f4___2->n_f4___1, Arg_0: 1 {O(1)}
20: n_f4___2->n_f4___1, Arg_1: Arg_1 {O(n)}