YES(?,O(n^1))
* Step 1: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> f(A,B)         True         (1,1)
          1. f(A,B)     -> f(1 + A,2 + B) [A >= 1 + B] (?,1)
        Signature:
          {(f,2);(start,2)}
        Flow Graph:
          [0->{1},1->{1}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: LooptreeTransformer WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. start(A,B) -> f(A,B)         True         (1,1)
          1. f(A,B)     -> f(1 + A,2 + B) [A >= 1 + B] (?,1)
          2. f(A,B)     -> exitus616(A,B) True         (?,1)
        Signature:
          {(exitus616,2);(f,2);(start,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1]
* Step 3: SizeAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          0. start(A,B) -> f(A,B)         True         (1,1)
          1. f(A,B)     -> f(1 + A,2 + B) [A >= 1 + B] (?,1)
          2. f(A,B)     -> exitus616(A,B) True         (?,1)
        Signature:
          {(exitus616,2);(f,2);(start,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
        ,We construct a looptree:
          P: [0,1,2]
          |
          `- p:[1] c: [1])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 4: FlowAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           start  ~>  f           [A <= A, B <= B]
           f      ~>  f           [A <= K + A, B <= K + A + B]
           f      ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= A + B]
               f  ~>  f   [A <= K + A, B <= K + A + B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 5: LareProcessor WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           start  ~>  f           []
           f      ~>  f           [A ~+> A,A ~+> B,B ~+> B,K ~+> A,K ~+> B]
           f      ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0]
               f  ~>  f   [A ~+> A,A ~+> B,B ~+> B,K ~+> A,K ~+> B]
    + Applied Processor:
        LareProcessor
    + Details:
         start  ~>  exitus616   [A ~+> A
                                ,A ~+> B
                                ,A ~+> 0.0
                                ,A ~+> tick
                                ,B ~+> B
                                ,B ~+> 0.0
                                ,B ~+> tick
                                ,tick ~+> tick
                                ,K ~+> A
                                ,K ~+> B
                                ,A ~*> A
                                ,A ~*> B
                                ,B ~*> A
                                ,B ~*> B
                                ,K ~*> A
                                ,K ~*> B]
        + <f  ~>  f>  [A ~+> A
                      ,A ~+> B
                      ,A ~+> 0.0
                      ,A ~+> tick
                      ,B ~+> B
                      ,B ~+> 0.0
                      ,B ~+> tick
                      ,tick ~+> tick
                      ,K ~+> A
                      ,K ~+> B
                      ,A ~*> A
                      ,A ~*> B
                      ,B ~*> A
                      ,B ~*> B
                      ,K ~*> A
                      ,K ~*> B]

YES(?,O(n^1))