YES(?,O(n^1))
* Step 1: TrivialSCCs WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (?,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2},1->{0,1,2},2->{},3->{0,1,2}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (1,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2},1->{0,1,2},2->{},3->{0,1,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0)]
* Step 3: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (1,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2},1->{1,2},2->{},3->{0,1,2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (?,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
          4. f2(A,B,C) -> exitus616(A,B,C)  True               (?,1)
        Signature:
          {(exitus616,3);(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2,4},1->{0,1,2,4},2->{},3->{0,1,2,4},4->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0)]
* Step 5: LooptreeTransformer WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (?,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
          4. f2(A,B,C) -> exitus616(A,B,C)  True               (?,1)
        Signature:
          {(exitus616,3);(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2,4},1->{1,2,4},2->{},3->{0,1,2,4},4->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[0] c: [0]
          |
          `- p:[1] c: [1]
* Step 6: SizeAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          0. f2(A,B,C) -> f2(1 + A,1 + B,C) [1 >= A]           (?,1)
          1. f2(A,B,C) -> f2(1 + A,1 + B,C) [2 >= B && A >= 2] (?,1)
          2. f2(A,B,C) -> f300(A,B,D)       [B >= 3 && A >= 2] (?,1)
          3. f1(A,B,C) -> f2(A,B,C)         True               (1,1)
          4. f2(A,B,C) -> exitus616(A,B,C)  True               (?,1)
        Signature:
          {(exitus616,3);(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{0,1,2,4},1->{1,2,4},2->{},3->{0,1,2,4},4->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4]
          |
          +- p:[0] c: [0]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 7: FlowAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,C,0.0,0.1]
           f2  ~>  f2          [A <= K + A, B <= K + B, C <= C]
           f2  ~>  f2          [A <= K + A, B <= K + B, C <= C]
           f2  ~>  f300        [A <= A, B <= B, C <= unknown]
           f1  ~>  f2          [A <= A, B <= B, C <= C]
           f2  ~>  exitus616   [A <= A, B <= B, C <= C]
          + Loop: [0.0 <= 2*K + A]
               f2  ~>  f2   [A <= K + A, B <= K + B, C <= C]
          + Loop: [0.1 <= 3*K + B]
               f2  ~>  f2   [A <= K + A, B <= K + B, C <= C]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 8: LareProcessor WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,C,0.0,0.1]
           f2  ~>  f2          [A ~+> A,B ~+> B,K ~+> A,K ~+> B]
           f2  ~>  f2          [A ~+> A,B ~+> B,K ~+> A,K ~+> B]
           f2  ~>  f300        [huge ~=> C]
           f1  ~>  f2          []
           f2  ~>  exitus616   []
          + Loop: [A ~+> 0.0,K ~*> 0.0]
               f2  ~>  f2   [A ~+> A,B ~+> B,K ~+> A,K ~+> B]
          + Loop: [B ~+> 0.1,K ~*> 0.1]
               f2  ~>  f2   [A ~+> A,B ~+> B,K ~+> A,K ~+> B]
    + Applied Processor:
        LareProcessor
    + Details:
         f1  ~>  exitus616   [A ~+> A
                             ,A ~+> 0.0
                             ,A ~+> tick
                             ,B ~+> B
                             ,B ~+> 0.1
                             ,B ~+> tick
                             ,tick ~+> tick
                             ,K ~+> A
                             ,K ~+> B
                             ,A ~*> A
                             ,A ~*> B
                             ,B ~*> A
                             ,B ~*> B
                             ,K ~*> A
                             ,K ~*> B
                             ,K ~*> 0.0
                             ,K ~*> 0.1
                             ,K ~*> tick]
         f1  ~>  f300        [huge ~=> C
                             ,A ~+> A
                             ,A ~+> 0.0
                             ,A ~+> tick
                             ,B ~+> B
                             ,B ~+> 0.1
                             ,B ~+> tick
                             ,tick ~+> tick
                             ,K ~+> A
                             ,K ~+> B
                             ,A ~*> A
                             ,A ~*> B
                             ,B ~*> A
                             ,B ~*> B
                             ,K ~*> A
                             ,K ~*> B
                             ,K ~*> 0.0
                             ,K ~*> 0.1
                             ,K ~*> tick]
        + <f2  ~>  f2>  [A ~+> A
                        ,A ~+> 0.0
                        ,A ~+> tick
                        ,B ~+> B
                        ,tick ~+> tick
                        ,K ~+> A
                        ,K ~+> B
                        ,A ~*> A
                        ,A ~*> B
                        ,K ~*> A
                        ,K ~*> B
                        ,K ~*> 0.0
                        ,K ~*> tick]
        + <f2  ~>  f2>  [A ~+> A
                        ,B ~+> B
                        ,B ~+> 0.1
                        ,B ~+> tick
                        ,tick ~+> tick
                        ,K ~+> A
                        ,K ~+> B
                        ,B ~*> A
                        ,B ~*> B
                        ,K ~*> A
                        ,K ~*> B
                        ,K ~*> 0.1
                        ,K ~*> tick]

YES(?,O(n^1))