MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0.  evalEx3start(A,B,C)    -> evalEx3entryin(A,B,C)    True         (1,1)
          1.  evalEx3entryin(A,B,C)  -> evalEx3bb4in(A,B,C)      True         (?,1)
          2.  evalEx3bb4in(A,B,C)    -> evalEx3bbin(A,B,C)       [A >= 1]     (?,1)
          3.  evalEx3bb4in(A,B,C)    -> evalEx3returnin(A,B,C)   [0 >= A]     (?,1)
          4.  evalEx3bbin(A,B,C)     -> evalEx3bb2in(A,D,A)      True         (?,1)
          5.  evalEx3bb2in(A,B,C)    -> evalEx3bb4in(C,B,C)      [0 >= C]     (?,1)
          6.  evalEx3bb2in(A,B,C)    -> evalEx3bb3in(A,B,C)      [C >= 1]     (?,1)
          7.  evalEx3bb3in(A,B,C)    -> evalEx3bb1in(A,B,C)      True         (?,1)
          8.  evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)      [B >= 1 + D] (?,1)
          9.  evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)      [D >= 1 + B] (?,1)
          10. evalEx3bb1in(A,B,C)    -> evalEx3bb2in(A,B,-1 + C) True         (?,1)
          11. evalEx3returnin(A,B,C) -> evalEx3stop(A,B,C)       True         (?,1)
        Signature:
          {(evalEx3bb1in,3)
          ;(evalEx3bb2in,3)
          ;(evalEx3bb3in,3)
          ;(evalEx3bb4in,3)
          ;(evalEx3bbin,3)
          ;(evalEx3entryin,3)
          ;(evalEx3returnin,3)
          ;(evalEx3start,3)
          ;(evalEx3stop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{2,3},6->{7,8,9},7->{10},8->{2,3},9->{2,3},10->{5,6},11->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(5,2)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0.  evalEx3start(A,B,C)    -> evalEx3entryin(A,B,C)    True         (1,1)
          1.  evalEx3entryin(A,B,C)  -> evalEx3bb4in(A,B,C)      True         (?,1)
          2.  evalEx3bb4in(A,B,C)    -> evalEx3bbin(A,B,C)       [A >= 1]     (?,1)
          3.  evalEx3bb4in(A,B,C)    -> evalEx3returnin(A,B,C)   [0 >= A]     (?,1)
          4.  evalEx3bbin(A,B,C)     -> evalEx3bb2in(A,D,A)      True         (?,1)
          5.  evalEx3bb2in(A,B,C)    -> evalEx3bb4in(C,B,C)      [0 >= C]     (?,1)
          6.  evalEx3bb2in(A,B,C)    -> evalEx3bb3in(A,B,C)      [C >= 1]     (?,1)
          7.  evalEx3bb3in(A,B,C)    -> evalEx3bb1in(A,B,C)      True         (?,1)
          8.  evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)      [B >= 1 + D] (?,1)
          9.  evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)      [D >= 1 + B] (?,1)
          10. evalEx3bb1in(A,B,C)    -> evalEx3bb2in(A,B,-1 + C) True         (?,1)
          11. evalEx3returnin(A,B,C) -> evalEx3stop(A,B,C)       True         (?,1)
        Signature:
          {(evalEx3bb1in,3)
          ;(evalEx3bb2in,3)
          ;(evalEx3bb3in,3)
          ;(evalEx3bb4in,3)
          ;(evalEx3bbin,3)
          ;(evalEx3entryin,3)
          ;(evalEx3returnin,3)
          ;(evalEx3start,3)
          ;(evalEx3stop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{3},6->{7,8,9},7->{10},8->{2,3},9->{2,3},10->{5,6},11->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          evalEx3start(A,B,C)    -> evalEx3entryin(A,B,C)     True
          evalEx3entryin(A,B,C)  -> evalEx3bb4in(A,B,C)       True
          evalEx3bb4in(A,B,C)    -> evalEx3bbin(A,B,C)        [A >= 1]
          evalEx3bb4in(A,B,C)    -> evalEx3returnin(A,B,C)    [0 >= A]
          evalEx3bbin(A,B,C)     -> evalEx3bb2in(A,D,A)       True
          evalEx3bb2in(A,B,C)    -> evalEx3bb4in(C,B,C)       [0 >= C]
          evalEx3bb2in(A,B,C)    -> evalEx3bb3in(A,B,C)       [C >= 1]
          evalEx3bb3in(A,B,C)    -> evalEx3bb1in(A,B,C)       True
          evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)       [B >= 1 + D]
          evalEx3bb3in(A,B,C)    -> evalEx3bb4in(C,B,C)       [D >= 1 + B]
          evalEx3bb1in(A,B,C)    -> evalEx3bb2in(A,B,-1 + C)  True
          evalEx3returnin(A,B,C) -> evalEx3stop(A,B,C)        True
        Signature:
          {(evalEx3bb1in,3)
          ;(evalEx3bb2in,3)
          ;(evalEx3bb3in,3)
          ;(evalEx3bb4in,3)
          ;(evalEx3bbin,3)
          ;(evalEx3entryin,3)
          ;(evalEx3returnin,3)
          ;(evalEx3start,3)
          ;(evalEx3stop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{4},3->{11},4->{5,6},5->{3},6->{7,8,9},7->{10},8->{2,3},9->{2,3},10->{5,6},11->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          evalEx3start.0(A,B,C)     -> evalEx3entryin.1(A,B,C)     True
          evalEx3entryin.1(A,B,C)   -> evalEx3bb4in.2(A,B,C)       True
          evalEx3entryin.1(A,B,C)   -> evalEx3bb4in.3(A,B,C)       True
          evalEx3bb4in.2(A,B,C)     -> evalEx3bbin.4(A,B,C)        [A >= 1]
          evalEx3bb4in.3(A,B,C)     -> evalEx3returnin.11(A,B,C)   [0 >= A]
          evalEx3bbin.4(A,B,C)      -> evalEx3bb2in.5(A,D,A)       True
          evalEx3bbin.4(A,B,C)      -> evalEx3bb2in.6(A,D,A)       True
          evalEx3bb2in.5(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [0 >= C]
          evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.7(A,B,C)       [C >= 1]
          evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.8(A,B,C)       [C >= 1]
          evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.9(A,B,C)       [C >= 1]
          evalEx3bb3in.7(A,B,C)     -> evalEx3bb1in.10(A,B,C)      True
          evalEx3bb3in.8(A,B,C)     -> evalEx3bb4in.2(C,B,C)       [B >= 1 + D]
          evalEx3bb3in.8(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [B >= 1 + D]
          evalEx3bb3in.9(A,B,C)     -> evalEx3bb4in.2(C,B,C)       [D >= 1 + B]
          evalEx3bb3in.9(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [D >= 1 + B]
          evalEx3bb1in.10(A,B,C)    -> evalEx3bb2in.5(A,B,-1 + C)  True
          evalEx3bb1in.10(A,B,C)    -> evalEx3bb2in.6(A,B,-1 + C)  True
          evalEx3returnin.11(A,B,C) -> evalEx3stop.12(A,B,C)       True
        Signature:
          {(evalEx3bb1in.10,3)
          ;(evalEx3bb2in.5,3)
          ;(evalEx3bb2in.6,3)
          ;(evalEx3bb3in.7,3)
          ;(evalEx3bb3in.8,3)
          ;(evalEx3bb3in.9,3)
          ;(evalEx3bb4in.2,3)
          ;(evalEx3bb4in.3,3)
          ;(evalEx3bbin.4,3)
          ;(evalEx3entryin.1,3)
          ;(evalEx3returnin.11,3)
          ;(evalEx3start.0,3)
          ;(evalEx3stop.12,3)}
        Rule Graph:
          [0->{1,2},1->{3},2->{4},3->{5,6},4->{18},5->{7},6->{8,9,10},7->{4},8->{11},9->{12,13},10->{14,15},11->{16
          ,17},12->{3},13->{4},14->{3},15->{4},16->{7},17->{8,9,10},18->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        evalEx3start.0(A,B,C)     -> evalEx3entryin.1(A,B,C)     True
        evalEx3entryin.1(A,B,C)   -> evalEx3bb4in.2(A,B,C)       True
        evalEx3entryin.1(A,B,C)   -> evalEx3bb4in.3(A,B,C)       True
        evalEx3bb4in.2(A,B,C)     -> evalEx3bbin.4(A,B,C)        [A >= 1]
        evalEx3bb4in.3(A,B,C)     -> evalEx3returnin.11(A,B,C)   [0 >= A]
        evalEx3bbin.4(A,B,C)      -> evalEx3bb2in.5(A,D,A)       True
        evalEx3bbin.4(A,B,C)      -> evalEx3bb2in.6(A,D,A)       True
        evalEx3bb2in.5(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [0 >= C]
        evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.7(A,B,C)       [C >= 1]
        evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.8(A,B,C)       [C >= 1]
        evalEx3bb2in.6(A,B,C)     -> evalEx3bb3in.9(A,B,C)       [C >= 1]
        evalEx3bb3in.7(A,B,C)     -> evalEx3bb1in.10(A,B,C)      True
        evalEx3bb3in.8(A,B,C)     -> evalEx3bb4in.2(C,B,C)       [B >= 1 + D]
        evalEx3bb3in.8(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [B >= 1 + D]
        evalEx3bb3in.9(A,B,C)     -> evalEx3bb4in.2(C,B,C)       [D >= 1 + B]
        evalEx3bb3in.9(A,B,C)     -> evalEx3bb4in.3(C,B,C)       [D >= 1 + B]
        evalEx3bb1in.10(A,B,C)    -> evalEx3bb2in.5(A,B,-1 + C)  True
        evalEx3bb1in.10(A,B,C)    -> evalEx3bb2in.6(A,B,-1 + C)  True
        evalEx3returnin.11(A,B,C) -> evalEx3stop.12(A,B,C)       True
        evalEx3stop.12(A,B,C)     -> exitus616(A,B,C)            True
        evalEx3stop.12(A,B,C)     -> exitus616(A,B,C)            True
        evalEx3stop.12(A,B,C)     -> exitus616(A,B,C)            True
        evalEx3stop.12(A,B,C)     -> exitus616(A,B,C)            True
        evalEx3stop.12(A,B,C)     -> exitus616(A,B,C)            True
      Signature:
        {(evalEx3bb1in.10,3)
        ;(evalEx3bb2in.5,3)
        ;(evalEx3bb2in.6,3)
        ;(evalEx3bb3in.7,3)
        ;(evalEx3bb3in.8,3)
        ;(evalEx3bb3in.9,3)
        ;(evalEx3bb4in.2,3)
        ;(evalEx3bb4in.3,3)
        ;(evalEx3bbin.4,3)
        ;(evalEx3entryin.1,3)
        ;(evalEx3returnin.11,3)
        ;(evalEx3start.0,3)
        ;(evalEx3stop.12,3)
        ;(exitus616,3)}
      Rule Graph:
        [0->{1,2},1->{3},2->{4},3->{5,6},4->{18},5->{7},6->{8,9,10},7->{4},8->{11},9->{12,13},10->{14,15},11->{16
        ,17},12->{3},13->{4},14->{3},15->{4},16->{7},17->{8,9,10},18->{19,20,21,22,23}]
  + 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,18,19,20,21,22,23]
        |
        `- p:[3,12,9,6,17,11,8,14,10] c: [8,11,17]
           |
           `- p:[3,12,9,6,14,10] c: []
MAYBE