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

YES(?,POLY)