YES(?,O(n^1))
* Step 1: ArgumentFilter WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B,C)   -> f300(A,B,C)     True         (1,1)
          1. f300(A,B,C) -> f1(A,B,D)       [A >= B]     (?,1)
          2. f300(A,B,C) -> f300(1 + A,B,C) [B >= 1 + A] (?,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{1,2},1->{},2->{1,2}]
        
    + Applied Processor:
        ArgumentFilter [2]
    + Details:
        We remove following argument positions: [2].
* Step 2: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B)   -> f300(A,B)     True         (1,1)
          1. f300(A,B) -> f1(A,B)       [A >= B]     (?,1)
          2. f300(A,B) -> f300(1 + A,B) [B >= 1 + A] (?,1)
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Flow Graph:
          [0->{1,2},1->{},2->{1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f2(A,B)   -> f300(A,B)      True
          f300(A,B) -> f1(A,B)        [A >= B]
          f300(A,B) -> f300(1 + A,B)  [B >= 1 + A]
        Signature:
          {(f1,3);(f2,3);(f300,3)}
        Rule Graph:
          [0->{1,2},1->{},2->{1,2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f2(A,B)   -> f300(A,B)       True
          f300(A,B) -> f1(A,B)         [A >= B]
          f300(A,B) -> f300(1 + A,B)   [B >= 1 + A]
          f1(A,B)   -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f1,3);(f2,3);(f300,3)}
        Rule Graph:
          [0->{1,2},1->{3},2->{1,2}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[2] c: [2]
* Step 5: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          f2(A,B)   -> f300(A,B)       True
          f300(A,B) -> f1(A,B)         [A >= B]
          f300(A,B) -> f300(1 + A,B)   [B >= 1 + A]
          f1(A,B)   -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f1,3);(f2,3);(f300,3)}
        Rule Graph:
          [0->{1,2},1->{3},2->{1,2}]
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 6: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f2    ~>  f300        [A <= A, B <= B]
           f300  ~>  f1          [A <= A, B <= B]
           f300  ~>  f300        [A <= A + B, B <= B]
           f1    ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= K + A + B]
               f300  ~>  f300   [A <= A + B, B <= B]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 7: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f2    ~>  f300        []
           f300  ~>  f1          []
           f300  ~>  f300        [A ~+> A,B ~+> A]
           f1    ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0,K ~+> 0.0]
               f300  ~>  f300   [A ~+> A,B ~+> A]
    + Applied Processor:
        Lare
    + Details:
         f2  ~>  exitus616   [A ~+> A
                             ,A ~+> 0.0
                             ,A ~+> tick
                             ,B ~+> A
                             ,B ~+> 0.0
                             ,B ~+> tick
                             ,tick ~+> tick
                             ,K ~+> 0.0
                             ,K ~+> tick
                             ,A ~*> A
                             ,B ~*> A
                             ,K ~*> A]
        + <f300  ~>  f300>  [A ~+> A
                            ,A ~+> 0.0
                            ,A ~+> tick
                            ,B ~+> A
                            ,B ~+> 0.0
                            ,B ~+> tick
                            ,tick ~+> tick
                            ,K ~+> 0.0
                            ,K ~+> tick
                            ,A ~*> A
                            ,B ~*> A
                            ,K ~*> A]

YES(?,O(n^1))