Initial Problem

Start: f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars:
Locations: f2, f3, f300
Transitions:
3:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f3(0,Arg_1,0,0,0):|:Arg_1<=0
2:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f300(1,Arg_1,Arg_2,Arg_3,Arg_4):|:1<=Arg_1
1:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f3(Arg_0,Arg_1,0,0,0):|:101<=Arg_0
0:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f300(1+Arg_0,Arg_1,Arg_2,Arg_3,Arg_4):|:Arg_0<=100 && 1<=Arg_1

Preprocessing

Eliminate variables {Arg_2,Arg_3,Arg_4} that do not contribute to the problem

Found invariant Arg_0<=101 && 0<=Arg_0 for location f3

Found invariant 1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 1<=Arg_0 for location f300

Problem after Preprocessing

Start: f2
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: f2, f3, f300
Transitions:
9:f2(Arg_0,Arg_1) -> f3(0,Arg_1):|:Arg_1<=0
8:f2(Arg_0,Arg_1) -> f300(1,Arg_1):|:1<=Arg_1
11:f300(Arg_0,Arg_1) -> f3(Arg_0,Arg_1):|:1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 1<=Arg_0 && 101<=Arg_0
10:f300(Arg_0,Arg_1) -> f300(1+Arg_0,Arg_1):|:1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 1<=Arg_0 && Arg_0<=100 && 1<=Arg_1

MPRF for transition 10:f300(Arg_0,Arg_1) -> f300(1+Arg_0,Arg_1):|:1<=Arg_1 && 2<=Arg_0+Arg_1 && Arg_0<=100+Arg_1 && Arg_0<=101 && 1<=Arg_0 && Arg_0<=100 && 1<=Arg_1 of depth 1:

new bound:

102 {O(1)}

MPRF:

f300 [101-Arg_0 ]

All Bounds

Timebounds

Overall timebound:105 {O(1)}
8: f2->f300: 1 {O(1)}
9: f2->f3: 1 {O(1)}
10: f300->f300: 102 {O(1)}
11: f300->f3: 1 {O(1)}

Costbounds

Overall costbound: 105 {O(1)}
8: f2->f300: 1 {O(1)}
9: f2->f3: 1 {O(1)}
10: f300->f300: 102 {O(1)}
11: f300->f3: 1 {O(1)}

Sizebounds

8: f2->f300, Arg_0: 1 {O(1)}
8: f2->f300, Arg_1: Arg_1 {O(n)}
9: f2->f3, Arg_0: 0 {O(1)}
9: f2->f3, Arg_1: Arg_1 {O(n)}
10: f300->f300, Arg_0: 101 {O(1)}
10: f300->f300, Arg_1: Arg_1 {O(n)}
11: f300->f3, Arg_0: 101 {O(1)}
11: f300->f3, Arg_1: Arg_1 {O(n)}