Problem:
 c() -> f()
 f() -> g()

Proof:
 Bounds Processor:
  bound: 2
  enrichment: match
  automaton:
   final states: {2,1}
   transitions:
    g2() -> 8*
    f0() -> 2*
    g1() -> 5*
    f1() -> 4*
    c0() -> 1*
    4 -> 1*
    5 -> 2*
    8 -> 4,1
  problem:
   
  Qed