Start: n_f0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0) -> n_f1___2(Arg_0)
1:n_f1___1(Arg_0) -> n_f1___1(Arg_0-1000):|:201<=Arg_0 && 1201<=Arg_0
2:n_f1___2(Arg_0) -> n_f1___1(Arg_0-1000):|:1201<=Arg_0
Found invariant 201<=Arg_0 for location n_f1___1
Start: n_f0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0) -> n_f1___2(Arg_0)
1:n_f1___1(Arg_0) -> n_f1___1(Arg_0-1000):|:201<=Arg_0 && 201<=Arg_0 && 1201<=Arg_0
2:n_f1___2(Arg_0) -> n_f1___1(Arg_0-1000):|:1201<=Arg_0
new bound:
Arg_0+200 {O(n)}
MPRF:
n_f1___1 [Arg_0-200 ]
Overall timebound:Arg_0+202 {O(n)}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: Arg_0+200 {O(n)}
2: n_f1___2->n_f1___1: 1 {O(1)}
Overall costbound: Arg_0+202 {O(n)}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: Arg_0+200 {O(n)}
2: n_f1___2->n_f1___1: 1 {O(1)}
0: n_f0->n_f1___2, Arg_0: Arg_0 {O(n)}
1: n_f1___1->n_f1___1, Arg_0: Arg_0 {O(n)}
2: n_f1___2->n_f1___1, Arg_0: Arg_0 {O(n)}