MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [0 >= P && Q >= 1] (1,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [P >= 1 && Q >= 1] (1,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,P,K,L,M,N,O) [0 >= P] (1,1) 3. f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) [-1*J >= 0 && A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && A >= 0] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f28(0,P,C,D,E,F,0,P,P,J,K,L,M,N,O) [-1*J >= 0 && -1 + A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && -1 + A >= 0 && A >= 1] (?,1) 5. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (?,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && P >= 1000 + B] 6. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (?,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && 999 + B >= P] Signature: {(f0,15);(f20,15);(f28,15);(f40,15)} Flow Graph: [0->{3},1->{4},2->{4},3->{3},4->{5,6},5->{3},6->{3}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: AddSinks MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [0 >= P && Q >= 1] (1,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [P >= 1 && Q >= 1] (1,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,P,K,L,M,N,O) [0 >= P] (1,1) 3. f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) [-1*J >= 0 && A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && A >= 0] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f28(0,P,C,D,E,F,0,P,P,J,K,L,M,N,O) [-1*J >= 0 && -1 + A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && -1 + A >= 0 && A >= 1] (1,1) 5. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (1,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && P >= 1000 + B] 6. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (1,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && 999 + B >= P] Signature: {(f0,15);(f20,15);(f28,15);(f40,15)} Flow Graph: [0->{3},1->{4},2->{4},3->{3},4->{5,6},5->{3},6->{3}] + Applied Processor: AddSinks + Details: () * Step 3: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [0 >= P && Q >= 1] (1,1) 1. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,0,1,P,P,P,P) [P >= 1 && Q >= 1] (1,1) 2. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f20(1,B,C,D,E,F,G,H,I,P,K,L,M,N,O) [0 >= P] (1,1) 3. f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) [-1*J >= 0 && A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && A >= 0] (?,1) 4. f20(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f28(0,P,C,D,E,F,0,P,P,J,K,L,M,N,O) [-1*J >= 0 && -1 + A + -1*J >= 0 && 1 + -1*A + -1*J >= 0 && 1 + -1*A >= 0 && -1 + A >= 0 && A >= 1] (?,1) 5. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(1,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (?,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && P >= 1000 + B] 6. f28(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> f40(A,B,0,P,P,P,G,H,I,J,K,L,M,N,O) [-1*G >= 0 (?,1) && -1*G + -1*J >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && G >= 0 && G + -1*J >= 0 && A + G >= 0 && -1*A + G >= 0 && -1*J >= 0 && A + -1*J >= 0 && -1*A + -1*J >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && 999 + B >= P] 7. f40(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O) True (?,1) Signature: {(exitus616,15);(f0,15);(f20,15);(f28,15);(f40,15)} Flow Graph: [0->{3,7},1->{4},2->{4},3->{3,7},4->{5,6},5->{3,7},6->{3,7},7->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7] | `- p:[3] c: [] MAYBE