Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D
Locations: f0, f1, f2
Transitions:
1:f0(Arg_0,Arg_1,Arg_2) -> f0(Arg_0+Arg_2,Arg_1,Arg_2-1):|:1<=Arg_0
0:f0(Arg_0,Arg_1,Arg_2) -> f2(Arg_0,D,Arg_2):|:Arg_0<=0
2:f1(Arg_0,Arg_1,Arg_2) -> f0(Arg_0,Arg_1,Arg_2)
Eliminate variables {D,Arg_1} that do not contribute to the problem
Found invariant Arg_0<=0 for location f2
Start: f1
Program_Vars: Arg_0, Arg_2
Temp_Vars:
Locations: f0, f1, f2
Transitions:
7:f0(Arg_0,Arg_2) -> f0(Arg_0+Arg_2,Arg_2-1):|:1<=Arg_0
6:f0(Arg_0,Arg_2) -> f2(Arg_0,Arg_2):|:Arg_0<=0
8:f1(Arg_0,Arg_2) -> f0(Arg_0,Arg_2)
new bound:
8*Arg_0+8*Arg_2+9 {O(n)}
MPRF:
f0 [Arg_2+1 ; Arg_0 ]
Overall timebound:8*Arg_0+8*Arg_2+11 {O(n)}
6: f0->f2: 1 {O(1)}
7: f0->f0: 8*Arg_0+8*Arg_2+9 {O(n)}
8: f1->f0: 1 {O(1)}
Overall costbound: 8*Arg_0+8*Arg_2+11 {O(n)}
6: f0->f2: 1 {O(1)}
7: f0->f0: 8*Arg_0+8*Arg_2+9 {O(n)}
8: f1->f0: 1 {O(1)}
6: f0->f2, Arg_0: 144*Arg_0*Arg_2+64*Arg_0*Arg_0+80*Arg_2*Arg_2+154*Arg_0+172*Arg_2+90 {O(n^2)}
6: f0->f2, Arg_2: 10*Arg_2+8*Arg_0+9 {O(n)}
7: f0->f0, Arg_0: 144*Arg_0*Arg_2+64*Arg_0*Arg_0+80*Arg_2*Arg_2+153*Arg_0+172*Arg_2+90 {O(n^2)}
7: f0->f0, Arg_2: 8*Arg_0+9*Arg_2+9 {O(n)}
8: f1->f0, Arg_0: Arg_0 {O(n)}
8: f1->f0, Arg_2: Arg_2 {O(n)}