YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + 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 + C] (?,1)
          2. f(A,B,C)     -> f(A,1 + B,C) [A >= 1 + B + C] (?,1)
        Signature:
          {(f,3);(start,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B,C) -> f(A,B,C)      True
          f(A,B,C)     -> f(A,B,1 + C)  [A >= 1 + B + C]
          f(A,B,C)     -> f(A,1 + B,C)  [A >= 1 + B + C]
        Signature:
          {(f,3);(start,3)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          start(A,B,C) -> f(A,B,C)          True
          f(A,B,C)     -> f(A,B,1 + C)      [A >= 1 + B + C]
          f(A,B,C)     -> f(A,1 + B,C)      [A >= 1 + B + C]
          f(A,B,C)     -> exitus616(A,B,C)  True
          f(A,B,C)     -> exitus616(A,B,C)  True
        Signature:
          {(exitus616,3);(f,3);(start,3)}
        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: [1,2]
* Step 4: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          start(A,B,C) -> f(A,B,C)          True
          f(A,B,C)     -> f(A,B,1 + C)      [A >= 1 + B + C]
          f(A,B,C)     -> f(A,1 + B,C)      [A >= 1 + B + C]
          f(A,B,C)     -> exitus616(A,B,C)  True
          f(A,B,C)     -> exitus616(A,B,C)  True
        Signature:
          {(exitus616,3);(f,3);(start,3)}
        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: [1,2])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,C,0.0]
           start  ~>  f           [A <= A, B <= B, C <= C]
           f      ~>  f           [A <= A, B <= B, C <= K + C]
           f      ~>  f           [A <= A, B <= K + B, C <= C]
           f      ~>  exitus616   [A <= A, B <= B, C <= C]
           f      ~>  exitus616   [A <= A, B <= B, C <= C]
          + Loop: [0.0 <= K + A + B + C]
               f  ~>  f   [A <= A, B <= B, C <= K + C]
               f  ~>  f   [A <= A, B <= K + B, C <= C]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,C,0.0]
           start  ~>  f           []
           f      ~>  f           [C ~+> C,K ~+> C]
           f      ~>  f           [B ~+> B,K ~+> B]
           f      ~>  exitus616   []
           f      ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0,C ~+> 0.0,K ~+> 0.0]
               f  ~>  f   [C ~+> C,K ~+> C]
               f  ~>  f   [B ~+> B,K ~+> B]
    + Applied Processor:
        Lare
    + Details:
         start  ~>  exitus616   [A ~+> 0.0
                                ,A ~+> tick
                                ,B ~+> B
                                ,B ~+> 0.0
                                ,B ~+> tick
                                ,C ~+> C
                                ,C ~+> 0.0
                                ,C ~+> tick
                                ,tick ~+> tick
                                ,K ~+> B
                                ,K ~+> C
                                ,K ~+> 0.0
                                ,K ~+> tick
                                ,A ~*> B
                                ,A ~*> C
                                ,B ~*> B
                                ,B ~*> C
                                ,C ~*> B
                                ,C ~*> C
                                ,K ~*> B
                                ,K ~*> C]
        + <f  ~>  f>  [A ~+> 0.0
                      ,A ~+> tick
                      ,B ~+> B
                      ,B ~+> 0.0
                      ,B ~+> tick
                      ,C ~+> C
                      ,C ~+> 0.0
                      ,C ~+> tick
                      ,tick ~+> tick
                      ,K ~+> B
                      ,K ~+> C
                      ,K ~+> 0.0
                      ,K ~+> tick
                      ,A ~*> B
                      ,A ~*> C
                      ,B ~*> B
                      ,B ~*> C
                      ,C ~*> B
                      ,C ~*> C
                      ,K ~*> B
                      ,K ~*> C]

YES(?,O(n^1))