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