Initial Problem

Start: n_start
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0) -> n_eval___1(A_P):|:0<=2+Arg_0 && 0<=2+A_P && Arg_0<=A_P+3 && 3+A_P<=Arg_0
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:0<=2+A_P && Arg_0<=A_P+3 && 3+A_P<=Arg_0
2:n_start(Arg_0) -> n_eval___2(Arg_0)

Preprocessing

Found invariant 0<=2+Arg_0 for location n_eval___1

Problem after Preprocessing

Start: n_start
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0) -> n_eval___1(A_P):|:0<=2+Arg_0 && 0<=2+Arg_0 && 0<=2+A_P && Arg_0<=A_P+3 && 3+A_P<=Arg_0
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:0<=2+A_P && Arg_0<=A_P+3 && 3+A_P<=Arg_0
2:n_start(Arg_0) -> n_eval___2(Arg_0)

MPRF for transition 0:n_eval___1(Arg_0) -> n_eval___1(A_P):|:0<=2+Arg_0 && 0<=2+Arg_0 && 0<=2+A_P && Arg_0<=A_P+3 && 3+A_P<=Arg_0 of depth 1:

new bound:

Arg_0+4 {O(n)}

n_eval___1 [Arg_0+3 ]

All Bounds

Timebounds

Overall timebound:Arg_0+6 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+4 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}

Costbounds

Overall costbound: Arg_0+6 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+4 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}

Sizebounds

0: n_eval___1->n_eval___1, Arg_0: 2*Arg_0+5 {O(n)}
1: n_eval___2->n_eval___1, Arg_0: Arg_0+1 {O(n)}
2: n_start->n_eval___2, Arg_0: Arg_0 {O(n)}