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):|:Arg_0<=10 && A_P<=10 && 2*Arg_0+A_P<=10 && 10<=2*Arg_0+A_P
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:A_P<=10 && 2*Arg_0+A_P<=10 && 10<=2*Arg_0+A_P
2:n_start(Arg_0) -> n_eval___2(Arg_0)

Preprocessing

Found invariant Arg_0<=10 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):|:Arg_0<=10 && Arg_0<=10 && A_P<=10 && 2*Arg_0+A_P<=10 && 10<=2*Arg_0+A_P
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:A_P<=10 && 2*Arg_0+A_P<=10 && 10<=2*Arg_0+A_P
2:n_start(Arg_0) -> n_eval___2(Arg_0)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
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: 10 {O(1)}
2: n_start->n_eval___2, Arg_0: Arg_0 {O(n)}