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

YES(?,O(n^1))