********Inverse Method Result********
    a <= b
& a <= c+f
& c+e <= a
& c < e
& d+f < a+e
& e <= d
227 states reachable.
332 states visited.
The analysis may have been non-deterministic (2 random choices).
Number of transitions: 321
Maximal number of clocks: 6
Inequalities:
1)     e < a
2)     f < a
3)     c+f < a+e
4)     d < c+e
5)     d+f < a+e
6)     c < e
********Verification Statistics********
Visited States:0
Total Transitions:0
Time Used:0,6554678s
Estimated Memory Used:1261,568KB