MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (?,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (?,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{11},3->{5,6},4->{11},5->{7,8},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,4),(5,8)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0.  evalloopsstart(A,B)    -> evalloopsentryin(A,B)    True         (1,1)
          1.  evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)      [A >= 0]     (?,1)
          2.  evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          3.  evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)      [A >= 0]     (?,1)
          4.  evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)   [0 >= 1 + A] (?,1)
          5.  evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)      [A >= 2]     (?,1)
          6.  evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)      [1 >= A]     (?,1)
          7.  evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)      [A >= 1 + B] (?,1)
          8.  evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)      [B >= A]     (?,1)
          9.  evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)    True         (?,1)
          10. evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B) True         (?,1)
          11. evalloopsreturnin(A,B) -> evalloopsstop(A,B)       True         (?,1)
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Flow Graph:
          [0->{1,2},1->{3},2->{11},3->{5,6},4->{11},5->{7},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          evalloopsstart(A,B)    -> evalloopsentryin(A,B)     True
          evalloopsentryin(A,B)  -> evalloopsbb6in(A,B)       [A >= 0]
          evalloopsentryin(A,B)  -> evalloopsreturnin(A,B)    [0 >= 1 + A]
          evalloopsbb6in(A,B)    -> evalloopsbb1in(A,B)       [A >= 0]
          evalloopsbb6in(A,B)    -> evalloopsreturnin(A,B)    [0 >= 1 + A]
          evalloopsbb1in(A,B)    -> evalloopsbb4in(A,1)       [A >= 2]
          evalloopsbb1in(A,B)    -> evalloopsbb5in(A,C)       [1 >= A]
          evalloopsbb4in(A,B)    -> evalloopsbb3in(A,B)       [A >= 1 + B]
          evalloopsbb4in(A,B)    -> evalloopsbb5in(A,B)       [B >= A]
          evalloopsbb3in(A,B)    -> evalloopsbb4in(A,2*B)     True
          evalloopsbb5in(A,B)    -> evalloopsbb6in(-1 + A,B)  True
          evalloopsreturnin(A,B) -> evalloopsstop(A,B)        True
        Signature:
          {(evalloopsbb1in,2)
          ;(evalloopsbb3in,2)
          ;(evalloopsbb4in,2)
          ;(evalloopsbb5in,2)
          ;(evalloopsbb6in,2)
          ;(evalloopsentryin,2)
          ;(evalloopsreturnin,2)
          ;(evalloopsstart,2)
          ;(evalloopsstop,2)}
        Rule Graph:
          [0->{1,2},1->{3},2->{11},3->{5,6},4->{11},5->{7},6->{10},7->{9},8->{10},9->{7,8},10->{3,4},11->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          evalloopsstart.0(A,B)     -> evalloopsentryin.1(A,B)     True
          evalloopsstart.0(A,B)     -> evalloopsentryin.2(A,B)     True
          evalloopsentryin.1(A,B)   -> evalloopsbb6in.3(A,B)       [A >= 0]
          evalloopsentryin.2(A,B)   -> evalloopsreturnin.11(A,B)   [0 >= 1 + A]
          evalloopsbb6in.3(A,B)     -> evalloopsbb1in.5(A,B)       [A >= 0]
          evalloopsbb6in.3(A,B)     -> evalloopsbb1in.6(A,B)       [A >= 0]
          evalloopsbb6in.4(A,B)     -> evalloopsreturnin.11(A,B)   [0 >= 1 + A]
          evalloopsbb1in.5(A,B)     -> evalloopsbb4in.7(A,1)       [A >= 2]
          evalloopsbb1in.6(A,B)     -> evalloopsbb5in.10(A,C)      [1 >= A]
          evalloopsbb4in.7(A,B)     -> evalloopsbb3in.9(A,B)       [A >= 1 + B]
          evalloopsbb4in.8(A,B)     -> evalloopsbb5in.10(A,B)      [B >= A]
          evalloopsbb3in.9(A,B)     -> evalloopsbb4in.7(A,2*B)     True
          evalloopsbb3in.9(A,B)     -> evalloopsbb4in.8(A,2*B)     True
          evalloopsbb5in.10(A,B)    -> evalloopsbb6in.3(-1 + A,B)  True
          evalloopsbb5in.10(A,B)    -> evalloopsbb6in.4(-1 + A,B)  True
          evalloopsreturnin.11(A,B) -> evalloopsstop.12(A,B)       True
        Signature:
          {(evalloopsbb1in.5,2)
          ;(evalloopsbb1in.6,2)
          ;(evalloopsbb3in.9,2)
          ;(evalloopsbb4in.7,2)
          ;(evalloopsbb4in.8,2)
          ;(evalloopsbb5in.10,2)
          ;(evalloopsbb6in.3,2)
          ;(evalloopsbb6in.4,2)
          ;(evalloopsentryin.1,2)
          ;(evalloopsentryin.2,2)
          ;(evalloopsreturnin.11,2)
          ;(evalloopsstart.0,2)
          ;(evalloopsstop.12,2)}
        Rule Graph:
          [0->{2},1->{3},2->{4,5},3->{15},4->{7},5->{8},6->{15},7->{9},8->{13,14},9->{11,12},10->{13,14},11->{9}
          ,12->{10},13->{4,5},14->{6},15->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        evalloopsstart.0(A,B)     -> evalloopsentryin.1(A,B)     True
        evalloopsstart.0(A,B)     -> evalloopsentryin.2(A,B)     True
        evalloopsentryin.1(A,B)   -> evalloopsbb6in.3(A,B)       [A >= 0]
        evalloopsentryin.2(A,B)   -> evalloopsreturnin.11(A,B)   [0 >= 1 + A]
        evalloopsbb6in.3(A,B)     -> evalloopsbb1in.5(A,B)       [A >= 0]
        evalloopsbb6in.3(A,B)     -> evalloopsbb1in.6(A,B)       [A >= 0]
        evalloopsbb6in.4(A,B)     -> evalloopsreturnin.11(A,B)   [0 >= 1 + A]
        evalloopsbb1in.5(A,B)     -> evalloopsbb4in.7(A,1)       [A >= 2]
        evalloopsbb1in.6(A,B)     -> evalloopsbb5in.10(A,C)      [1 >= A]
        evalloopsbb4in.7(A,B)     -> evalloopsbb3in.9(A,B)       [A >= 1 + B]
        evalloopsbb4in.8(A,B)     -> evalloopsbb5in.10(A,B)      [B >= A]
        evalloopsbb3in.9(A,B)     -> evalloopsbb4in.7(A,2*B)     True
        evalloopsbb3in.9(A,B)     -> evalloopsbb4in.8(A,2*B)     True
        evalloopsbb5in.10(A,B)    -> evalloopsbb6in.3(-1 + A,B)  True
        evalloopsbb5in.10(A,B)    -> evalloopsbb6in.4(-1 + A,B)  True
        evalloopsreturnin.11(A,B) -> evalloopsstop.12(A,B)       True
        evalloopsstop.12(A,B)     -> exitus616(A,B)              True
        evalloopsstop.12(A,B)     -> exitus616(A,B)              True
      Signature:
        {(evalloopsbb1in.5,2)
        ;(evalloopsbb1in.6,2)
        ;(evalloopsbb3in.9,2)
        ;(evalloopsbb4in.7,2)
        ;(evalloopsbb4in.8,2)
        ;(evalloopsbb5in.10,2)
        ;(evalloopsbb6in.3,2)
        ;(evalloopsbb6in.4,2)
        ;(evalloopsentryin.1,2)
        ;(evalloopsentryin.2,2)
        ;(evalloopsreturnin.11,2)
        ;(evalloopsstart.0,2)
        ;(evalloopsstop.12,2)
        ;(exitus616,2)}
      Rule Graph:
        [0->{2},1->{3},2->{4,5},3->{15},4->{7},5->{8},6->{15},7->{9},8->{13,14},9->{11,12},10->{13,14},11->{9}
        ,12->{10},13->{4,5},14->{6},15->{16,17}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17]
        |
        `- p:[4,13,8,5,10,12,9,7,11] c: [4,5,7,8,10,12,13]
           |
           `- p:[9,11] c: []
MAYBE