Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D
Locations: f0, f4, f5
Transitions:
1:f0(Arg_0,Arg_1,Arg_2) -> f4(D,D+1,Arg_1)
2:f4(Arg_0,Arg_1,Arg_2) -> f4(D,D+1,Arg_1)
0:f4(Arg_0,Arg_1,Arg_2) -> f5(Arg_0,Arg_1,Arg_2):|:Arg_1+1<=Arg_0
Cut unsatisfiable transition 0: f4->f5
Cut unreachable locations [f5] from the program graph
Eliminate variables {D,Arg_0,Arg_1,Arg_2} that do not contribute to the problem
Start: f0
Program_Vars:
Temp_Vars:
Locations: f0, f4
Transitions:
8:f0 -> f4
9:f4 -> f4
Overall timebound:inf {Infinity}
8: f0->f4: 1 {O(1)}
9: f4->f4: inf {Infinity}
Overall costbound: inf {Infinity}
8: f0->f4: 1 {O(1)}
9: f4->f4: inf {Infinity}