MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A) -> f5(B)     [B >= 1]                 (1,1)
          1. f5(A) -> f5(1 + A) [-1 + A >= 0 && 19 >= A] (?,1)
          2. f0(A) -> f12(B)    [0 >= B]                 (1,1)
          3. f5(A) -> f12(A)    [-1 + A >= 0 && A >= 20] (?,1)
        Signature:
          {(f0,1);(f12,1);(f5,1)}
        Flow Graph:
          [0->{1,3},1->{1,3},2->{},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(A) -> f5(B)      [B >= 1]
          f5(A) -> f5(1 + A)  [-1 + A >= 0 && 19 >= A]
          f0(A) -> f12(B)     [0 >= B]
          f5(A) -> f12(A)     [-1 + A >= 0 && A >= 20]
        Signature:
          {(f0,1);(f12,1);(f5,1)}
        Rule Graph:
          [0->{1,3},1->{1,3},2->{},3->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose MAYBE
    + Considered Problem:
        Rules:
          f0(A)  -> f5(B)         [B >= 1]
          f5(A)  -> f5(1 + A)     [-1 + A >= 0 && 19 >= A]
          f0(A)  -> f12(B)        [0 >= B]
          f5(A)  -> f12(A)        [-1 + A >= 0 && A >= 20]
          f12(A) -> exitus616(A)  True
          f12(A) -> exitus616(A)  True
        Signature:
          {(exitus616,1);(f0,1);(f12,1);(f5,1)}
        Rule Graph:
          [0->{1,3},1->{1,3},2->{4},3->{5}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1]
* Step 4: AbstractSize MAYBE
    + Considered Problem:
        (Rules:
          f0(A)  -> f5(B)         [B >= 1]
          f5(A)  -> f5(1 + A)     [-1 + A >= 0 && 19 >= A]
          f0(A)  -> f12(B)        [0 >= B]
          f5(A)  -> f12(A)        [-1 + A >= 0 && A >= 20]
          f12(A) -> exitus616(A)  True
          f12(A) -> exitus616(A)  True
        Signature:
          {(exitus616,1);(f0,1);(f12,1);(f5,1)}
        Rule Graph:
          [0->{1,3},1->{1,3},2->{4},3->{5}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow MAYBE
    + Considered Problem:
        Program:
          Domain: [A,0.0]
           f0   ~>  f5          [A <= unknown]
           f5   ~>  f5          [A <= 20*K]
           f0   ~>  f12         [A <= unknown]
           f5   ~>  f12         [A <= A]
           f12  ~>  exitus616   [A <= A]
           f12  ~>  exitus616   [A <= A]
          + Loop: [0.0 <= 19*K + A]
               f5  ~>  f5   [A <= 20*K]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,0.0]
         f0   ~>  f5          [huge ~=> A]
         f5   ~>  f5          [K ~=> A]
         f0   ~>  f12         [huge ~=> A]
         f5   ~>  f12         []
         f12  ~>  exitus616   []
         f12  ~>  exitus616   []
        + Loop: [A ~+> 0.0,K ~*> 0.0]
             f5  ~>  f5   [K ~=> A]
  + Applied Processor:
      Lare
  + Details:
      Unknown bound.
MAYBE