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