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

YES(?,O(n^1))