Initial Problem

Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: G
Locations: f1, f2, f300
Transitions:
0:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f2(G,G,Arg_2,Arg_3,Arg_4,Arg_5)
1:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,G,Arg_5):|:1+Arg_2<=Arg_3
2:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,G):|:Arg_3<=Arg_2

Preprocessing

Eliminate variables {G,Arg_0,Arg_1,Arg_4,Arg_5} that do not contribute to the problem

Found invariant Arg_3<=Arg_2 for location f300

Problem after Preprocessing

Start: f1
Program_Vars: Arg_2, Arg_3
Temp_Vars:
Locations: f1, f2, f300
Transitions:
8:f1(Arg_2,Arg_3) -> f2(Arg_2,Arg_3)
9:f2(Arg_2,Arg_3) -> f2(Arg_2,Arg_3):|:1+Arg_2<=Arg_3
10:f2(Arg_2,Arg_3) -> f300(Arg_2,Arg_3):|:Arg_3<=Arg_2

All Bounds

Timebounds

Overall timebound:inf {Infinity}
8: f1->f2: 1 {O(1)}
9: f2->f2: inf {Infinity}
10: f2->f300: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
8: f1->f2: 1 {O(1)}
9: f2->f2: inf {Infinity}
10: f2->f300: 1 {O(1)}

Sizebounds

8: f1->f2, Arg_2: Arg_2 {O(n)}
8: f1->f2, Arg_3: Arg_3 {O(n)}
9: f2->f2, Arg_2: Arg_2 {O(n)}
9: f2->f2, Arg_3: Arg_3 {O(n)}
10: f2->f300, Arg_2: Arg_2 {O(n)}
10: f2->f300, Arg_3: Arg_3 {O(n)}