Start: n_start
Program_Vars: Arg_0
Temp_Vars:
Locations: n_a___1, n_a___2, n_a___3, n_start
Transitions:
0:n_a___1(Arg_0) -> n_a___1(Arg_0-1):|:0<=Arg_0 && 1<=Arg_0
1:n_a___2(Arg_0) -> n_a___3(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && Arg_0<=100 && 100<=Arg_0 && 1<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
2:n_a___3(Arg_0) -> n_a___1(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
3:n_start(Arg_0) -> n_a___2(100):|:Arg_0<=100 && 100<=Arg_0
4:n_start(Arg_0) -> n_a___3(Arg_0):|:1<=Arg_0
Found invariant 0<=Arg_0 for location n_a___1
Found invariant Arg_0<=100 && 100<=Arg_0 for location n_a___2
Found invariant 1<=Arg_0 for location n_a___3
Start: n_start
Program_Vars: Arg_0
Temp_Vars:
Locations: n_a___1, n_a___2, n_a___3, n_start
Transitions:
0:n_a___1(Arg_0) -> n_a___1(Arg_0-1):|:0<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
1:n_a___2(Arg_0) -> n_a___3(Arg_0-1):|:Arg_0<=100 && 100<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && Arg_0<=100 && 100<=Arg_0 && 1<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
2:n_a___3(Arg_0) -> n_a___1(Arg_0-1):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 0<=Arg_0 && 1<=Arg_0
3:n_start(Arg_0) -> n_a___2(100):|:Arg_0<=100 && 100<=Arg_0
4:n_start(Arg_0) -> n_a___3(Arg_0):|:1<=Arg_0
new bound:
Arg_0+100 {O(n)}
MPRF:
n_a___1 [Arg_0+1 ]
Overall timebound:Arg_0+104 {O(n)}
0: n_a___1->n_a___1: Arg_0+100 {O(n)}
1: n_a___2->n_a___3: 1 {O(1)}
2: n_a___3->n_a___1: 1 {O(1)}
3: n_start->n_a___2: 1 {O(1)}
4: n_start->n_a___3: 1 {O(1)}
Overall costbound: Arg_0+104 {O(n)}
0: n_a___1->n_a___1: Arg_0+100 {O(n)}
1: n_a___2->n_a___3: 1 {O(1)}
2: n_a___3->n_a___1: 1 {O(1)}
3: n_start->n_a___2: 1 {O(1)}
4: n_start->n_a___3: 1 {O(1)}
0: n_a___1->n_a___1, Arg_0: Arg_0+99 {O(n)}
1: n_a___2->n_a___3, Arg_0: 99 {O(1)}
2: n_a___3->n_a___1, Arg_0: Arg_0+99 {O(n)}
3: n_start->n_a___2, Arg_0: 100 {O(1)}
4: n_start->n_a___3, Arg_0: Arg_0 {O(n)}