Start: n_start
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f___1, n_start
Transitions:
0:n_f___1(Arg_0) -> n_f___1(Arg_0)
1:n_start(Arg_0) -> n_f___1(Arg_0)
Eliminate variables {Arg_0} that do not contribute to the problem
Start: n_start
Program_Vars:
Temp_Vars:
Locations: n_f___1, n_start
Transitions:
4:n_f___1 -> n_f___1
5:n_start -> n_f___1
Overall timebound:inf {Infinity}
4: n_f___1->n_f___1: inf {Infinity}
5: n_start->n_f___1: 1 {O(1)}
Overall costbound: inf {Infinity}
4: n_f___1->n_f___1: inf {Infinity}
5: n_start->n_f___1: 1 {O(1)}