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

YES(?,O(n^1))