Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval1___1, n_eval1___4, n_eval2___2, n_eval2___3, n_start
Transitions:
0:n_eval1___4(Arg_0,Arg_1,Arg_2) -> n_eval2___3(Arg_0,Arg_1,Arg_0):|:1+Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0
1:n_eval2___2(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_0 && Arg_0<=Arg_1
2:n_eval2___2(Arg_0,Arg_1,Arg_2) -> n_eval2___2(Arg_0-1,Arg_1,Arg_2-1):|:Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
3:n_eval2___3(Arg_0,Arg_1,Arg_2) -> n_eval2___2(Arg_0-1,Arg_1,Arg_2-1):|:1+Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
4:n_start(Arg_0,Arg_1,Arg_2) -> n_eval1___4(Arg_0,Arg_1,Arg_2)
Found invariant Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 for location n_eval2___2
Found invariant Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_eval1___1
Found invariant Arg_2<=Arg_0 && 1+Arg_1<=Arg_2 && Arg_0<=Arg_2 && 1+Arg_1<=Arg_0 for location n_eval2___3
Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval1___1, n_eval1___4, n_eval2___2, n_eval2___3, n_start
Transitions:
0:n_eval1___4(Arg_0,Arg_1,Arg_2) -> n_eval2___3(Arg_0,Arg_1,Arg_0):|:1+Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0
1:n_eval2___2(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_2):|:Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_1<=Arg_0 && Arg_0<=Arg_1
2:n_eval2___2(Arg_0,Arg_1,Arg_2) -> n_eval2___2(Arg_0-1,Arg_1,Arg_2-1):|:Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
3:n_eval2___3(Arg_0,Arg_1,Arg_2) -> n_eval2___2(Arg_0-1,Arg_1,Arg_2-1):|:Arg_2<=Arg_0 && 1+Arg_1<=Arg_2 && Arg_0<=Arg_2 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
4:n_start(Arg_0,Arg_1,Arg_2) -> n_eval1___4(Arg_0,Arg_1,Arg_2)
new bound:
Arg_0+Arg_1+2 {O(n)}
MPRF:
n_eval2___2 [Arg_2+1-Arg_1 ]
Overall timebound:Arg_0+Arg_1+6 {O(n)}
0: n_eval1___4->n_eval2___3: 1 {O(1)}
1: n_eval2___2->n_eval1___1: 1 {O(1)}
2: n_eval2___2->n_eval2___2: Arg_0+Arg_1+2 {O(n)}
3: n_eval2___3->n_eval2___2: 1 {O(1)}
4: n_start->n_eval1___4: 1 {O(1)}
Overall costbound: Arg_0+Arg_1+6 {O(n)}
0: n_eval1___4->n_eval2___3: 1 {O(1)}
1: n_eval2___2->n_eval1___1: 1 {O(1)}
2: n_eval2___2->n_eval2___2: Arg_0+Arg_1+2 {O(n)}
3: n_eval2___3->n_eval2___2: 1 {O(1)}
4: n_start->n_eval1___4: 1 {O(1)}
0: n_eval1___4->n_eval2___3, Arg_0: Arg_0 {O(n)}
0: n_eval1___4->n_eval2___3, Arg_1: Arg_1 {O(n)}
0: n_eval1___4->n_eval2___3, Arg_2: Arg_0 {O(n)}
1: n_eval2___2->n_eval1___1, Arg_0: 3*Arg_0+Arg_1+4 {O(n)}
1: n_eval2___2->n_eval1___1, Arg_1: 2*Arg_1 {O(n)}
1: n_eval2___2->n_eval1___1, Arg_2: 3*Arg_0+Arg_1+4 {O(n)}
2: n_eval2___2->n_eval2___2, Arg_0: 2*Arg_0+Arg_1+3 {O(n)}
2: n_eval2___2->n_eval2___2, Arg_1: Arg_1 {O(n)}
2: n_eval2___2->n_eval2___2, Arg_2: 2*Arg_0+Arg_1+3 {O(n)}
3: n_eval2___3->n_eval2___2, Arg_0: Arg_0+1 {O(n)}
3: n_eval2___3->n_eval2___2, Arg_1: Arg_1 {O(n)}
3: n_eval2___3->n_eval2___2, Arg_2: Arg_0+1 {O(n)}
4: n_start->n_eval1___4, Arg_0: Arg_0 {O(n)}
4: n_start->n_eval1___4, Arg_1: Arg_1 {O(n)}
4: n_start->n_eval1___4, Arg_2: Arg_2 {O(n)}