MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J) -> f15(1,4,K,0,L,0,0,0,0,0) [K >= 0 && L >= 0] (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,0,0,0,0,0) [0 >= D && 0 >= C && B >= 1 && I = 0] (?,1) 2. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,K,0,0,0,0) [D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I = 0] (?,1) 3. f15(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,L,0,0,0,0) [0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I = 0] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,K,0,0,0,0) [C >= 1 && 1 >= K && K >= 0 && I = 0] (?,1) 5. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [0 >= H && J >= 1 + E] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,C,1 + D,E,F,0,H,I,J) [E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1] (?,1) 8. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,-1 + B,C,0,E,F,K,H,I,J) [E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f48(1 + A,4 + A,K,0,E,F,L,H,I,J) [E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 10. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,-1 + C,D,E,F,K,H,I,J) [E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0] (?,1) 11. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [0 >= G] (?,1) 12. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [F >= 1 && G >= 1] (?,1) 13. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,0,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && 0 >= D && 0 >= C && B >= 1] (?,1) 14. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 15. f48(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,F,G,L,I,1 + J) [G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 16. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && C >= 1 && 1 >= K && K >= 0] (?,1) 17. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 18. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,1,J) [0 >= H] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + I] (?,1) 20. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [I >= 1] (?,1) Signature: {(f0,10);(f15,10);(f36,10);(f48,10);(f77,10);(f81,10)} Flow Graph: [0->{1,2,3,4,19,20},1->{5,6,7,8,9,10},2->{5,6,7,8,9,10},3->{5,6,7,8,9,10},4->{5,6,7,8,9,10},5->{17,18} ,6->{17,18},7->{11,12,13,14,15,16},8->{11,12,13,14,15,16},9->{11,12,13,14,15,16},10->{11,12,13,14,15,16} ,11->{5,6,7,8,9,10},12->{5,6,7,8,9,10},13->{5,6,7,8,9,10},14->{5,6,7,8,9,10},15->{5,6,7,8,9,10},16->{5,6,7,8 ,9,10},17->{1,2,3,4,19,20},18->{1,2,3,4,19,20},19->{},20->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J) -> f15(1,4,K,0,L,0,0,0,0,0) [K >= 0 && L >= 0] (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,0,0,0,0,0) [0 >= D && 0 >= C && B >= 1 && I = 0] (?,1) 2. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,K,0,0,0,0) [D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I = 0] (?,1) 3. f15(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,L,0,0,0,0) [0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I = 0] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,K,0,0,0,0) [C >= 1 && 1 >= K && K >= 0 && I = 0] (?,1) 5. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [0 >= H && J >= 1 + E] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,C,1 + D,E,F,0,H,I,J) [E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1] (?,1) 8. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,-1 + B,C,0,E,F,K,H,I,J) [E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f48(1 + A,4 + A,K,0,E,F,L,H,I,J) [E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 10. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,-1 + C,D,E,F,K,H,I,J) [E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0] (?,1) 11. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [0 >= G] (?,1) 12. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [F >= 1 && G >= 1] (?,1) 13. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,0,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && 0 >= D && 0 >= C && B >= 1] (?,1) 14. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 15. f48(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,F,G,L,I,1 + J) [G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 16. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && C >= 1 && 1 >= K && K >= 0] (?,1) 17. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 18. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,1,J) [0 >= H] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + I] (1,1) 20. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [I >= 1] (1,1) Signature: {(f0,10);(f15,10);(f36,10);(f48,10);(f77,10);(f81,10)} Flow Graph: [0->{1,2,3,4,19,20},1->{5,6,7,8,9,10},2->{5,6,7,8,9,10},3->{5,6,7,8,9,10},4->{5,6,7,8,9,10},5->{17,18} ,6->{17,18},7->{11,12,13,14,15,16},8->{11,12,13,14,15,16},9->{11,12,13,14,15,16},10->{11,12,13,14,15,16} ,11->{5,6,7,8,9,10},12->{5,6,7,8,9,10},13->{5,6,7,8,9,10},14->{5,6,7,8,9,10},15->{5,6,7,8,9,10},16->{5,6,7,8 ,9,10},17->{1,2,3,4,19,20},18->{1,2,3,4,19,20},19->{},20->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2) ,(0,3) ,(0,19) ,(0,20) ,(1,6) ,(1,9) ,(1,10) ,(2,6) ,(2,8) ,(2,10) ,(3,6) ,(3,8) ,(4,6) ,(5,17) ,(6,18) ,(7,12) ,(7,13) ,(7,14) ,(7,15) ,(7,16) ,(8,14) ,(8,16) ,(9,14) ,(13,6) ,(13,9) ,(13,10) ,(14,8) ,(14,10) ,(15,8) ,(18,1) ,(18,2) ,(18,3) ,(18,4) ,(18,19)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J) -> f15(1,4,K,0,L,0,0,0,0,0) [K >= 0 && L >= 0] (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,0,0,0,0,0) [0 >= D && 0 >= C && B >= 1 && I = 0] (?,1) 2. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,K,0,0,0,0) [D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I = 0] (?,1) 3. f15(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,L,0,0,0,0) [0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I = 0] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,K,0,0,0,0) [C >= 1 && 1 >= K && K >= 0 && I = 0] (?,1) 5. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [0 >= H && J >= 1 + E] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,C,1 + D,E,F,0,H,I,J) [E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1] (?,1) 8. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,-1 + B,C,0,E,F,K,H,I,J) [E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f48(1 + A,4 + A,K,0,E,F,L,H,I,J) [E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 10. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,-1 + C,D,E,F,K,H,I,J) [E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0] (?,1) 11. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [0 >= G] (?,1) 12. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [F >= 1 && G >= 1] (?,1) 13. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,0,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && 0 >= D && 0 >= C && B >= 1] (?,1) 14. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 15. f48(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,F,G,L,I,1 + J) [G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 16. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && C >= 1 && 1 >= K && K >= 0] (?,1) 17. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 18. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,1,J) [0 >= H] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + I] (1,1) 20. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [I >= 1] (1,1) Signature: {(f0,10);(f15,10);(f36,10);(f48,10);(f77,10);(f81,10)} Flow Graph: [0->{1,4},1->{5,7,8},2->{5,7,9},3->{5,7,9,10},4->{5,7,8,9,10},5->{18},6->{17},7->{11},8->{11,12,13,15} ,9->{11,12,13,15,16},10->{11,12,13,14,15,16},11->{5,6,7,8,9,10},12->{5,6,7,8,9,10},13->{5,7,8},14->{5,6,7,9} ,15->{5,6,7,9,10},16->{5,6,7,8,9,10},17->{1,2,3,4,19,20},18->{20},19->{},20->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J) -> f15(1,4,K,0,L,0,0,0,0,0) [K >= 0 && L >= 0] (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,0,0,0,0,0) [0 >= D && 0 >= C && B >= 1 && I = 0] (?,1) 2. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,K,0,0,0,0) [D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I = 0] (?,1) 3. f15(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,L,0,0,0,0) [0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I = 0] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,K,0,0,0,0) [C >= 1 && 1 >= K && K >= 0 && I = 0] (?,1) 5. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [0 >= H && J >= 1 + E] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,C,1 + D,E,F,0,H,I,J) [E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1] (?,1) 8. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,-1 + B,C,0,E,F,K,H,I,J) [E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f48(1 + A,4 + A,K,0,E,F,L,H,I,J) [E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 10. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,-1 + C,D,E,F,K,H,I,J) [E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0] (?,1) 11. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [0 >= G] (?,1) 12. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [F >= 1 && G >= 1] (?,1) 13. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,0,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && 0 >= D && 0 >= C && B >= 1] (?,1) 14. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 15. f48(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,F,G,L,I,1 + J) [G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 16. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && C >= 1 && 1 >= K && K >= 0] (?,1) 17. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 18. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,1,J) [0 >= H] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + I] (?,1) 20. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [I >= 1] (?,1) 21. f15(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True (?,1) Signature: {(exitus616,10);(f0,10);(f15,10);(f36,10);(f48,10);(f77,10);(f81,10)} Flow Graph: [0->{1,2,3,4,19,20,21},1->{5,6,7,8,9,10},2->{5,6,7,8,9,10},3->{5,6,7,8,9,10},4->{5,6,7,8,9,10},5->{17,18} ,6->{17,18},7->{11,12,13,14,15,16},8->{11,12,13,14,15,16},9->{11,12,13,14,15,16},10->{11,12,13,14,15,16} ,11->{5,6,7,8,9,10},12->{5,6,7,8,9,10},13->{5,6,7,8,9,10},14->{5,6,7,8,9,10},15->{5,6,7,8,9,10},16->{5,6,7,8 ,9,10},17->{1,2,3,4,19,20,21},18->{1,2,3,4,19,20,21},19->{},20->{},21->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2) ,(0,3) ,(0,19) ,(0,20) ,(1,6) ,(1,9) ,(1,10) ,(2,6) ,(2,8) ,(2,10) ,(3,6) ,(3,8) ,(4,6) ,(5,17) ,(6,18) ,(7,12) ,(7,13) ,(7,14) ,(7,15) ,(7,16) ,(8,14) ,(8,16) ,(9,14) ,(13,6) ,(13,9) ,(13,10) ,(14,8) ,(14,10) ,(15,8) ,(18,1) ,(18,2) ,(18,3) ,(18,4) ,(18,19)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J) -> f15(1,4,K,0,L,0,0,0,0,0) [K >= 0 && L >= 0] (1,1) 1. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,0,0,0,0,0) [0 >= D && 0 >= C && B >= 1 && I = 0] (?,1) 2. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,K,0,0,0,0) [D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I = 0] (?,1) 3. f15(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,L,0,0,0,0) [0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I = 0] (?,1) 4. f15(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,K,0,0,0,0) [C >= 1 && 1 >= K && K >= 0 && I = 0] (?,1) 5. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [0 >= H && J >= 1 + E] (?,1) 6. f36(A,B,C,D,E,F,G,H,I,J) -> f77(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 7. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,C,1 + D,E,F,0,H,I,J) [E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1] (?,1) 8. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,-1 + B,C,0,E,F,K,H,I,J) [E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f48(1 + A,4 + A,K,0,E,F,L,H,I,J) [E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 10. f36(A,B,C,D,E,F,G,H,I,J) -> f48(A,B,-1 + C,D,E,F,K,H,I,J) [E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0] (?,1) 11. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [0 >= G] (?,1) 12. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,D,E,F,G,H,I,1 + J) [F >= 1 && G >= 1] (?,1) 13. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,0,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && 0 >= D && 0 >= C && B >= 1] (?,1) 14. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,-1 + B,C,0,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K] (?,1) 15. f48(A,B,C,D,E,F,G,H,I,J) -> f36(1 + A,4 + A,K,0,E,F,G,L,I,1 + J) [G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0] (?,1) 16. f48(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,-1 + C,D,E,F,G,K,I,1 + J) [G >= 1 && 0 >= F && 1 + E >= A && C >= 1 && 1 >= K && K >= 0] (?,1) 17. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,I,J) [H >= 1] (?,1) 18. f77(A,B,C,D,E,F,G,H,I,J) -> f15(A,B,C,D,E,F,G,H,1,J) [0 >= H] (?,1) 19. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [0 >= 1 + I] (?,1) 20. f15(A,B,C,D,E,F,G,H,I,J) -> f81(A,B,C,D,E,F,G,H,I,J) [I >= 1] (?,1) 21. f15(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True (?,1) Signature: {(exitus616,10);(f0,10);(f15,10);(f36,10);(f48,10);(f77,10);(f81,10)} Flow Graph: [0->{1,4,21},1->{5,7,8},2->{5,7,9},3->{5,7,9,10},4->{5,7,8,9,10},5->{18},6->{17},7->{11},8->{11,12,13,15} ,9->{11,12,13,15,16},10->{11,12,13,14,15,16},11->{5,6,7,8,9,10},12->{5,6,7,8,9,10},13->{5,7,8},14->{5,6,7,9} ,15->{5,6,7,9,10},16->{5,6,7,8,9,10},17->{1,2,3,4,19,20,21},18->{20,21},19->{},20->{},21->{}] + Applied Processor: LooptreeTransformer + 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] | `- p:[1,17,6,11,7,2,3,4,12,8,13,9,14,10,15,16] c: [15] | `- p:[1,17,6,11,7,2,3,4,12,8,13,9,14,10,16] c: [] MAYBE