YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. evaleasy2start(A)    -> evaleasy2entryin(A)    True          (1,1)
          1. evaleasy2entryin(A)  -> evaleasy2bb1in(A)      True          (?,1)
          2. evaleasy2bb1in(A)    -> evaleasy2bbin(A)       [A >= 1]      (?,1)
          3. evaleasy2bb1in(A)    -> evaleasy2returnin(A)   [0 >= A]      (?,1)
          4. evaleasy2bbin(A)     -> evaleasy2bb1in(-1 + A) [-1 + A >= 0] (?,1)
          5. evaleasy2returnin(A) -> evaleasy2stop(A)       [-1*A >= 0]   (?,1)
        Signature:
          {(evaleasy2bb1in,1)
          ;(evaleasy2bbin,1)
          ;(evaleasy2entryin,1)
          ;(evaleasy2returnin,1)
          ;(evaleasy2start,1)
          ;(evaleasy2stop,1)}
        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:
          evaleasy2start(A)    -> evaleasy2entryin(A)     True
          evaleasy2entryin(A)  -> evaleasy2bb1in(A)       True
          evaleasy2bb1in(A)    -> evaleasy2bbin(A)        [A >= 1]
          evaleasy2bb1in(A)    -> evaleasy2returnin(A)    [0 >= A]
          evaleasy2bbin(A)     -> evaleasy2bb1in(-1 + A)  [-1 + A >= 0]
          evaleasy2returnin(A) -> evaleasy2stop(A)        [-1*A >= 0]
        Signature:
          {(evaleasy2bb1in,1)
          ;(evaleasy2bbin,1)
          ;(evaleasy2entryin,1)
          ;(evaleasy2returnin,1)
          ;(evaleasy2start,1)
          ;(evaleasy2stop,1)}
        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:
          evaleasy2start(A)    -> evaleasy2entryin(A)     True
          evaleasy2entryin(A)  -> evaleasy2bb1in(A)       True
          evaleasy2bb1in(A)    -> evaleasy2bbin(A)        [A >= 1]
          evaleasy2bb1in(A)    -> evaleasy2returnin(A)    [0 >= A]
          evaleasy2bbin(A)     -> evaleasy2bb1in(-1 + A)  [-1 + A >= 0]
          evaleasy2returnin(A) -> evaleasy2stop(A)        [-1*A >= 0]
          evaleasy2stop(A)     -> exitus616(A)            True
        Signature:
          {(evaleasy2bb1in,1)
          ;(evaleasy2bbin,1)
          ;(evaleasy2entryin,1)
          ;(evaleasy2returnin,1)
          ;(evaleasy2start,1)
          ;(evaleasy2stop,1)
          ;(exitus616,1)}
        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:
          evaleasy2start(A)    -> evaleasy2entryin(A)     True
          evaleasy2entryin(A)  -> evaleasy2bb1in(A)       True
          evaleasy2bb1in(A)    -> evaleasy2bbin(A)        [A >= 1]
          evaleasy2bb1in(A)    -> evaleasy2returnin(A)    [0 >= A]
          evaleasy2bbin(A)     -> evaleasy2bb1in(-1 + A)  [-1 + A >= 0]
          evaleasy2returnin(A) -> evaleasy2stop(A)        [-1*A >= 0]
          evaleasy2stop(A)     -> exitus616(A)            True
        Signature:
          {(evaleasy2bb1in,1)
          ;(evaleasy2bbin,1)
          ;(evaleasy2entryin,1)
          ;(evaleasy2returnin,1)
          ;(evaleasy2start,1)
          ;(evaleasy2stop,1)
          ;(exitus616,1)}
        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,0.0]
           evaleasy2start     ~>  evaleasy2entryin    [A <= A]
           evaleasy2entryin   ~>  evaleasy2bb1in      [A <= A]
           evaleasy2bb1in     ~>  evaleasy2bbin       [A <= A]
           evaleasy2bb1in     ~>  evaleasy2returnin   [A <= A]
           evaleasy2bbin      ~>  evaleasy2bb1in      [A <= A]
           evaleasy2returnin  ~>  evaleasy2stop       [A <= A]
           evaleasy2stop      ~>  exitus616           [A <= A]
          + Loop: [0.0 <= K + A]
               evaleasy2bb1in  ~>  evaleasy2bbin    [A <= A]
               evaleasy2bbin   ~>  evaleasy2bb1in   [A <= A]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,0.0]
           evaleasy2start     ~>  evaleasy2entryin    []
           evaleasy2entryin   ~>  evaleasy2bb1in      []
           evaleasy2bb1in     ~>  evaleasy2bbin       []
           evaleasy2bb1in     ~>  evaleasy2returnin   []
           evaleasy2bbin      ~>  evaleasy2bb1in      []
           evaleasy2returnin  ~>  evaleasy2stop       []
           evaleasy2stop      ~>  exitus616           []
          + Loop: [A ~+> 0.0,K ~+> 0.0]
               evaleasy2bb1in  ~>  evaleasy2bbin    []
               evaleasy2bbin   ~>  evaleasy2bb1in   []
    + Applied Processor:
        Lare
    + Details:
         evaleasy2start  ~>  exitus616   [A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick]
        + <evaleasy2bb1in  ~>  evaleasy2bb1in>  [A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~+> 0.0,K ~+> tick]

YES(?,O(n^1))