MAYBE
* Step 1: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. start(A) -> a(A) [A >= 1]                                 (1,1)
          1. start(A) -> a(A) [A >= 2]                                 (1,1)
          2. start(A) -> a(A) [A >= 4]                                 (1,1)
          3. a(A)     -> a(B) [-1 + A >= 0 && 2*B >= 2 && A = 2*B]     (?,1)
          4. a(A)     -> a(B) [-1 + A >= 0 && 2*B >= 1 && A = 1 + 2*B] (?,1)
        Signature:
          {(a,1);(start,1)}
        Flow Graph:
          [0->{3,4},1->{3,4},2->{3,4},3->{3,4},4->{3,4}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: LooptreeTransformer MAYBE
    + Considered Problem:
        Rules:
          0. start(A) -> a(A)         [A >= 1]                                 (1,1)
          1. start(A) -> a(A)         [A >= 2]                                 (1,1)
          2. start(A) -> a(A)         [A >= 4]                                 (1,1)
          3. a(A)     -> a(B)         [-1 + A >= 0 && 2*B >= 2 && A = 2*B]     (?,1)
          4. a(A)     -> a(B)         [-1 + A >= 0 && 2*B >= 1 && A = 1 + 2*B] (?,1)
          5. a(A)     -> exitus616(A) True                                     (?,1)
        Signature:
          {(a,1);(exitus616,1);(start,1)}
        Flow Graph:
          [0->{3,4,5},1->{3,4,5},2->{3,4,5},3->{3,4,5},4->{3,4,5},5->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[3,4] c: [4]
             |
             `- p:[3] c: [3]
* Step 3: SizeAbstraction MAYBE
    + Considered Problem:
        (Rules:
          0. start(A) -> a(A)         [A >= 1]                                 (1,1)
          1. start(A) -> a(A)         [A >= 2]                                 (1,1)
          2. start(A) -> a(A)         [A >= 4]                                 (1,1)
          3. a(A)     -> a(B)         [-1 + A >= 0 && 2*B >= 2 && A = 2*B]     (?,1)
          4. a(A)     -> a(B)         [-1 + A >= 0 && 2*B >= 1 && A = 1 + 2*B] (?,1)
          5. a(A)     -> exitus616(A) True                                     (?,1)
        Signature:
          {(a,1);(exitus616,1);(start,1)}
        Flow Graph:
          [0->{3,4,5},1->{3,4,5},2->{3,4,5},3->{3,4,5},4->{3,4,5},5->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[3,4] c: [4]
             |
             `- p:[3] c: [3])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 4: FlowAbstraction MAYBE
    + Considered Problem:
        Program:
          Domain: [A,0.0,0.0.0]
           start  ~>  a           [A <= A]
           start  ~>  a           [A <= A]
           start  ~>  a           [A <= A]
           a      ~>  a           [A <= unknown]
           a      ~>  a           [A <= unknown]
           a      ~>  exitus616   [A <= A]
          + Loop: [0.0 <= K + 2*A]
               a  ~>  a   [A <= unknown]
               a  ~>  a   [A <= unknown]
            + Loop: [0.0.0 <= 2*A]
                 a  ~>  a   [A <= unknown]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,0.0,0.0.0]
         start  ~>  a           []
         start  ~>  a           []
         start  ~>  a           []
         a      ~>  a           [huge ~=> A]
         a      ~>  a           [huge ~=> A]
         a      ~>  exitus616   []
        + Loop: [K ~+> 0.0,A ~*> 0.0]
             a  ~>  a   [huge ~=> A]
             a  ~>  a   [huge ~=> A]
          + Loop: [A ~*> 0.0.0]
               a  ~>  a   [huge ~=> A]
  + Applied Processor:
      LareProcessor
  + Details:
      Unknown bound.
MAYBE