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

YES(?,POLY)