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