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

YES(?,O(n^1))