Termination proof of /tmp/tmpnrPokt/PastaC9.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 380 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 JBCTerminationSCC

↳5 SCCToIDPv1Proof (⇒, 150 ms)

↳6 IDP

↳7 IDPNonInfProof (⇒, 610 ms)

↳8 IDP

↳9 IDependencyGraphProof (⇔, 0 ms)

↳10 IDP

↳11 IDPNonInfProof (⇒, 190 ms)

↳12 IDP

↳13 IDependencyGraphProof (⇔, 0 ms)

↳14 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_16 (Sun Microsystems Inc.) Main-Class: PastaC9

/**
 * Example taken from "A Term Rewriting Approach to the Automated Termination
 * Analysis of Imperative Programs" (http://www.cs.unm.edu/~spf/papers/2009-02.pdf)
 * and converted to Java.
 */

public class PastaC9 {
    public static void main(String[] args) {
        Random.args = args;
        int x = Random.random();
        int y = Random.random();

        while (x > 0 && y > 0) {
            if (Random.random() < 42) {
                x--;
                y = Random.random();
            } else {
                y--;
            }
        }
    } 
}


public class Random {
  static String[] args;
  static int index = 0;

  public static int random() {
    String string = args[index];
    index++;
    return string.length();
  }
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
PastaC9.main([Ljava/lang/String;)V: Graph of 322 nodes with 1 SCC.

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 1 SCCs.

(4) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: PastaC9.main([Ljava/lang/String;)V
SCC calls the following helper methods:
Performed SCC analyses: UsedFieldsAnalysis

(5) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 54 rules for P and 0 rules for R.

P rules:
1003_0_main_LE(EOS(STATIC_1003), i385, i375, i385) → 1006_0_main_LE(EOS(STATIC_1006), i385, i375, i385)
1006_0_main_LE(EOS(STATIC_1006), i385, i375, i385) → 1009_0_main_Load(EOS(STATIC_1009), i385, i375) | >(i385, 0)
1009_0_main_Load(EOS(STATIC_1009), i385, i375) → 1013_0_main_LE(EOS(STATIC_1013), i385, i375, i375)
1013_0_main_LE(EOS(STATIC_1013), i385, i387, i387) → 1016_0_main_LE(EOS(STATIC_1016), i385, i387, i387)
1016_0_main_LE(EOS(STATIC_1016), i385, i387, i387) → 1020_0_main_InvokeMethod(EOS(STATIC_1020), i385, i387) | >(i387, 0)
1020_0_main_InvokeMethod(EOS(STATIC_1020), i385, i387) → 1023_0_random_FieldAccess(EOS(STATIC_1023), i385, i387)
1023_0_random_FieldAccess(EOS(STATIC_1023), i385, i387) → 1025_0_random_FieldAccess(EOS(STATIC_1025), i385, i387)
1025_0_random_FieldAccess(EOS(STATIC_1025), i385, i387) → 1028_0_random_ArrayAccess(EOS(STATIC_1028), i385, i387)
1028_0_random_ArrayAccess(EOS(STATIC_1028), i385, i387) → 1030_0_random_ArrayAccess(EOS(STATIC_1030), i385, i387)
1030_0_random_ArrayAccess(EOS(STATIC_1030), i385, i387) → 1034_0_random_Store(EOS(STATIC_1034), i385, i387, o272)
1034_0_random_Store(EOS(STATIC_1034), i385, i387, o272) → 1038_0_random_FieldAccess(EOS(STATIC_1038), i385, i387, o272)
1038_0_random_FieldAccess(EOS(STATIC_1038), i385, i387, o272) → 1040_0_random_ConstantStackPush(EOS(STATIC_1040), i385, i387, o272)
1040_0_random_ConstantStackPush(EOS(STATIC_1040), i385, i387, o272) → 1044_0_random_IntArithmetic(EOS(STATIC_1044), i385, i387, o272)
1044_0_random_IntArithmetic(EOS(STATIC_1044), i385, i387, o272) → 1048_0_random_FieldAccess(EOS(STATIC_1048), i385, i387, o272)
1048_0_random_FieldAccess(EOS(STATIC_1048), i385, i387, o272) → 1051_0_random_Load(EOS(STATIC_1051), i385, i387, o272)
1051_0_random_Load(EOS(STATIC_1051), i385, i387, o272) → 1060_0_random_InvokeMethod(EOS(STATIC_1060), i385, i387, o272)
1060_0_random_InvokeMethod(EOS(STATIC_1060), i385, i387, java.lang.Object(o290sub)) → 1064_0_random_InvokeMethod(EOS(STATIC_1064), i385, i387, java.lang.Object(o290sub))
1064_0_random_InvokeMethod(EOS(STATIC_1064), i385, i387, java.lang.Object(o290sub)) → 1067_0_length_Load(EOS(STATIC_1067), i385, i387, java.lang.Object(o290sub), java.lang.Object(o290sub))
1067_0_length_Load(EOS(STATIC_1067), i385, i387, java.lang.Object(o290sub), java.lang.Object(o290sub)) → 1076_0_length_FieldAccess(EOS(STATIC_1076), i385, i387, java.lang.Object(o290sub), java.lang.Object(o290sub))
1076_0_length_FieldAccess(EOS(STATIC_1076), i385, i387, java.lang.Object(java.lang.String(o298sub, i423)), java.lang.Object(java.lang.String(o298sub, i423))) → 1078_0_length_FieldAccess(EOS(STATIC_1078), i385, i387, java.lang.Object(java.lang.String(o298sub, i423)), java.lang.Object(java.lang.String(o298sub, i423))) | &&(>=(i423, 0), >=(i424, 0))
1078_0_length_FieldAccess(EOS(STATIC_1078), i385, i387, java.lang.Object(java.lang.String(o298sub, i423)), java.lang.Object(java.lang.String(o298sub, i423))) → 1084_0_length_Return(EOS(STATIC_1084), i385, i387, java.lang.Object(java.lang.String(o298sub, i423)), i423)
1084_0_length_Return(EOS(STATIC_1084), i385, i387, java.lang.Object(java.lang.String(o298sub, i423)), i423) → 1089_0_random_Return(EOS(STATIC_1089), i385, i387, i423)
1089_0_random_Return(EOS(STATIC_1089), i385, i387, i423) → 1091_0_main_ConstantStackPush(EOS(STATIC_1091), i385, i387, i423)
1091_0_main_ConstantStackPush(EOS(STATIC_1091), i385, i387, i423) → 1099_0_main_GE(EOS(STATIC_1099), i385, i387, i423, 42)
1099_0_main_GE(EOS(STATIC_1099), i385, i387, i439, matching1) → 1106_0_main_GE(EOS(STATIC_1106), i385, i387, i439, 42) | =(matching1, 42)
1099_0_main_GE(EOS(STATIC_1099), i385, i387, i440, matching1) → 1107_0_main_GE(EOS(STATIC_1107), i385, i387, i440, 42) | =(matching1, 42)
1106_0_main_GE(EOS(STATIC_1106), i385, i387, i439, matching1) → 1111_0_main_Inc(EOS(STATIC_1111), i385) | &&(<(i439, 42), =(matching1, 42))
1111_0_main_Inc(EOS(STATIC_1111), i385) → 1120_0_main_InvokeMethod(EOS(STATIC_1120), +(i385, -1)) | >(i385, 0)
1120_0_main_InvokeMethod(EOS(STATIC_1120), i446) → 1129_0_random_FieldAccess(EOS(STATIC_1129), i446)
1129_0_random_FieldAccess(EOS(STATIC_1129), i446) → 1143_0_random_FieldAccess(EOS(STATIC_1143), i446)
1143_0_random_FieldAccess(EOS(STATIC_1143), i446) → 1154_0_random_ArrayAccess(EOS(STATIC_1154), i446)
1154_0_random_ArrayAccess(EOS(STATIC_1154), i446) → 1162_0_random_ArrayAccess(EOS(STATIC_1162), i446)
1162_0_random_ArrayAccess(EOS(STATIC_1162), i446) → 1171_0_random_Store(EOS(STATIC_1171), i446, o338)
1171_0_random_Store(EOS(STATIC_1171), i446, o338) → 1182_0_random_FieldAccess(EOS(STATIC_1182), i446, o338)
1182_0_random_FieldAccess(EOS(STATIC_1182), i446, o338) → 1190_0_random_ConstantStackPush(EOS(STATIC_1190), i446, o338)
1190_0_random_ConstantStackPush(EOS(STATIC_1190), i446, o338) → 1204_0_random_IntArithmetic(EOS(STATIC_1204), i446, o338)
1204_0_random_IntArithmetic(EOS(STATIC_1204), i446, o338) → 1211_0_random_FieldAccess(EOS(STATIC_1211), i446, o338)
1211_0_random_FieldAccess(EOS(STATIC_1211), i446, o338) → 1219_0_random_Load(EOS(STATIC_1219), i446, o338)
1219_0_random_Load(EOS(STATIC_1219), i446, o338) → 1232_0_random_InvokeMethod(EOS(STATIC_1232), i446, o338)
1232_0_random_InvokeMethod(EOS(STATIC_1232), i446, java.lang.Object(o396sub)) → 1237_0_random_InvokeMethod(EOS(STATIC_1237), i446, java.lang.Object(o396sub))
1237_0_random_InvokeMethod(EOS(STATIC_1237), i446, java.lang.Object(o396sub)) → 1243_0_length_Load(EOS(STATIC_1243), i446, java.lang.Object(o396sub), java.lang.Object(o396sub))
1243_0_length_Load(EOS(STATIC_1243), i446, java.lang.Object(o396sub), java.lang.Object(o396sub)) → 1257_0_length_FieldAccess(EOS(STATIC_1257), i446, java.lang.Object(o396sub), java.lang.Object(o396sub))
1257_0_length_FieldAccess(EOS(STATIC_1257), i446, java.lang.Object(java.lang.String(o418sub, i529)), java.lang.Object(java.lang.String(o418sub, i529))) → 1259_0_length_FieldAccess(EOS(STATIC_1259), i446, java.lang.Object(java.lang.String(o418sub, i529)), java.lang.Object(java.lang.String(o418sub, i529))) | &&(>=(i529, 0), >=(i530, 0))
1259_0_length_FieldAccess(EOS(STATIC_1259), i446, java.lang.Object(java.lang.String(o418sub, i529)), java.lang.Object(java.lang.String(o418sub, i529))) → 1266_0_length_Return(EOS(STATIC_1266), i446, java.lang.Object(java.lang.String(o418sub, i529)), i529)
1266_0_length_Return(EOS(STATIC_1266), i446, java.lang.Object(java.lang.String(o418sub, i529)), i529) → 1271_0_random_Return(EOS(STATIC_1271), i446, i529)
1271_0_random_Return(EOS(STATIC_1271), i446, i529) → 1273_0_main_Store(EOS(STATIC_1273), i446, i529)
1273_0_main_Store(EOS(STATIC_1273), i446, i529) → 1280_0_main_JMP(EOS(STATIC_1280), i446, i529)
1280_0_main_JMP(EOS(STATIC_1280), i446, i529) → 1287_0_main_Load(EOS(STATIC_1287), i446, i529)
1287_0_main_Load(EOS(STATIC_1287), i446, i529) → 999_0_main_Load(EOS(STATIC_999), i446, i529)
999_0_main_Load(EOS(STATIC_999), i374, i375) → 1003_0_main_LE(EOS(STATIC_1003), i374, i375, i374)
1107_0_main_GE(EOS(STATIC_1107), i385, i387, i440, matching1) → 1113_0_main_Inc(EOS(STATIC_1113), i385, i387) | &&(>=(i440, 42), =(matching1, 42))
1113_0_main_Inc(EOS(STATIC_1113), i385, i387) → 1121_0_main_JMP(EOS(STATIC_1121), i385, +(i387, -1)) | >(i387, 0)
1121_0_main_JMP(EOS(STATIC_1121), i385, i447) → 1132_0_main_Load(EOS(STATIC_1132), i385, i447)
1132_0_main_Load(EOS(STATIC_1132), i385, i447) → 999_0_main_Load(EOS(STATIC_999), i385, i447)
R rules:

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
1003_0_main_LE(EOS(STATIC_1003), x0, x1, x0) → 1003_0_main_LE(EOS(STATIC_1003), +(x0, -1), x2, +(x0, -1)) | &&(&&(>(+(x2, 1), 0), >(x1, 0)), >(x0, 0))
1003_0_main_LE(EOS(STATIC_1003), x0, x1, x0) → 1003_0_main_LE(EOS(STATIC_1003), x0, +(x1, -1), x0) | &&(>(x1, 0), >(x0, 0))
R rules:

Filtered ground terms:

1003_0_main_LE(x1, x2, x3, x4) → 1003_0_main_LE(x2, x3, x4)
EOS(x1) → EOS
Cond_1003_0_main_LE1(x1, x2, x3, x4, x5) → Cond_1003_0_main_LE1(x1, x3, x4, x5)
Cond_1003_0_main_LE(x1, x2, x3, x4, x5, x6) → Cond_1003_0_main_LE(x1, x3, x4, x5, x6)

Filtered duplicate args:

1003_0_main_LE(x1, x2, x3) → 1003_0_main_LE(x2, x3)
Cond_1003_0_main_LE(x1, x2, x3, x4, x5) → Cond_1003_0_main_LE(x1, x3, x4, x5)
Cond_1003_0_main_LE1(x1, x2, x3, x4) → Cond_1003_0_main_LE1(x1, x3, x4)

Filtered unneeded arguments:

Cond_1003_0_main_LE(x1, x2, x3, x4) → Cond_1003_0_main_LE(x1, x3, x4)

Combined rules. Obtained 2 conditional rules for P and 0 conditional rules for R.

P rules:
1003_0_main_LE(x1, x0) → 1003_0_main_LE(x2, +(x0, -1)) | &&(&&(>(x2, -1), >(x1, 0)), >(x0, 0))
1003_0_main_LE(x1, x0) → 1003_0_main_LE(+(x1, -1), x0) | &&(>(x1, 0), >(x0, 0))
R rules:

Finished conversion. Obtained 4 rules for P and 0 rules for R. System has predefined symbols.

P rules:
1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), x1, x0, x2)
COND_1003_0_MAIN_LE(TRUE, x1, x0, x2) → 1003_0_MAIN_LE(x2, +(x0, -1))
1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE1(&&(>(x1, 0), >(x0, 0)), x1, x0)
COND_1003_0_MAIN_LE1(TRUE, x1, x0) → 1003_0_MAIN_LE(+(x1, -1), x0)
R rules:

(6) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(x2[0] > -1 && x1[0] > 0 && x0[0] > 0, x1[0], x0[0], x2[0])
(1): COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], x0[1] + -1)
(2): 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(x1[2] > 0 && x0[2] > 0, x1[2], x0[2])
(3): COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(x1[3] + -1, x0[3])

(0) -> (1), if (x2[0] > -1 && x1[0] > 0 && x0[0] > 0 ∧x1[0] →^* x1[1]∧x0[0] →^* x0[1]∧x2[0] →^* x2[1])

(1) -> (0), if (x2[1] →^* x1[0]∧x0[1] + -1 →^* x0[0])

(1) -> (2), if (x2[1] →^* x1[2]∧x0[1] + -1 →^* x0[2])

(2) -> (3), if (x1[2] > 0 && x0[2] > 0 ∧x1[2] →^* x1[3]∧x0[2] →^* x0[3])

(3) -> (0), if (x1[3] + -1 →^* x1[0]∧x0[3] →^* x0[0])

(3) -> (2), if (x1[3] + -1 →^* x1[2]∧x0[3] →^* x0[2])

The set Q is empty.

(7) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpDefaultShapeHeuristic@1c4e4471 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 1 Max Right Steps: 1

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair 1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), x1, x0, x2) the following chains were created:

We consider the chain COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1)), 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]), COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1)) which results in the following constraint:
(1)    (x2[1]=x1[0]∧+(x0[1], -1)=x0[0]∧&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0))=TRUE∧x1[0]=x1[1]1∧x0[0]=x0[1]1∧x2[0]=x2[1]1 ⇒ 1003_0_MAIN_LE(x1[0], x0[0])≥NonInfC∧1003_0_MAIN_LE(x1[0], x0[0])≥COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])∧(U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥))

We simplified constraint (1) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(+(x0[1], -1), 0)=TRUE∧>(x2[0], -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ 1003_0_MAIN_LE(x1[0], +(x0[1], -1))≥NonInfC∧1003_0_MAIN_LE(x1[0], +(x0[1], -1))≥COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(+(x0[1], -1), 0)), x1[0], +(x0[1], -1), x2[0])∧(U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x0[1] + [-2] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-2)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x0[1] + [-2] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-2)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x0[1] + [-2] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-2)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x0[1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x0[1] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)
We consider the chain COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]), 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]), COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1)) which results in the following constraint:
(8)    (+(x1[3], -1)=x1[0]∧x0[3]=x0[0]∧&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1]∧x2[0]=x2[1] ⇒ 1003_0_MAIN_LE(x1[0], x0[0])≥NonInfC∧1003_0_MAIN_LE(x1[0], x0[0])≥COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])∧(U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥))

We simplified constraint (8) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(9)    (>(x0[0], 0)=TRUE∧>(x2[0], -1)=TRUE∧>(+(x1[3], -1), 0)=TRUE ⇒ 1003_0_MAIN_LE(+(x1[3], -1), x0[0])≥NonInfC∧1003_0_MAIN_LE(+(x1[3], -1), x0[0])≥COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(+(x1[3], -1), 0)), >(x0[0], 0)), +(x1[3], -1), x0[0], x2[0])∧(U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥))

We simplified constraint (9) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(10)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[3] + [-2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (10) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(11)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[3] + [-2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (11) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(12)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[3] + [-2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(13)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[3] + [-2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(14)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[3] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)

For Pair COND_1003_0_MAIN_LE(TRUE, x1, x0, x2) → 1003_0_MAIN_LE(x2, +(x0, -1)) the following chains were created:

We consider the chain 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]), COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1)), 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]) which results in the following constraint:
(15)    (&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1]∧x2[0]=x2[1]∧x2[1]=x1[0]1∧+(x0[1], -1)=x0[0]1 ⇒ COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1])≥NonInfC∧COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1])≥1003_0_MAIN_LE(x2[1], +(x0[1], -1))∧(U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥))

We simplified constraint (15) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(16)    (>(x0[0], 0)=TRUE∧>(x2[0], -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_1003_0_MAIN_LE(TRUE, x1[0], x0[0], x2[0])≥NonInfC∧COND_1003_0_MAIN_LE(TRUE, x1[0], x0[0], x2[0])≥1003_0_MAIN_LE(x2[0], +(x0[0], -1))∧(U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥))

We simplified constraint (16) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(17)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (17) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(18)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (18) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(19)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (19) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(20)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (20) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(21)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)
We consider the chain 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]), COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1)), 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]) which results in the following constraint:
(22)    (&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0))=TRUE∧x1[0]=x1[1]∧x0[0]=x0[1]∧x2[0]=x2[1]∧x2[1]=x1[2]∧+(x0[1], -1)=x0[2] ⇒ COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1])≥NonInfC∧COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1])≥1003_0_MAIN_LE(x2[1], +(x0[1], -1))∧(U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥))

We simplified constraint (22) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(23)    (>(x0[0], 0)=TRUE∧>(x2[0], -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_1003_0_MAIN_LE(TRUE, x1[0], x0[0], x2[0])≥NonInfC∧COND_1003_0_MAIN_LE(TRUE, x1[0], x0[0], x2[0])≥1003_0_MAIN_LE(x2[0], +(x0[0], -1))∧(U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥))

We simplified constraint (23) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(24)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (24) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(25)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (25) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(26)    (x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (26) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(27)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

We simplified constraint (27) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(28)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)

For Pair 1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE1(&&(>(x1, 0), >(x0, 0)), x1, x0) the following chains were created:

We consider the chain 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]), COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]) which results in the following constraint:
(29)    (&&(>(x1[2], 0), >(x0[2], 0))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3] ⇒ 1003_0_MAIN_LE(x1[2], x0[2])≥NonInfC∧1003_0_MAIN_LE(x1[2], x0[2])≥COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])∧(U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥))

We simplified constraint (29) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(30)    (>(x1[2], 0)=TRUE∧>(x0[2], 0)=TRUE ⇒ 1003_0_MAIN_LE(x1[2], x0[2])≥NonInfC∧1003_0_MAIN_LE(x1[2], x0[2])≥COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])∧(U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥))

We simplified constraint (30) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(31)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_21 + (-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)

We simplified constraint (31) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(32)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_21 + (-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)

We simplified constraint (32) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(33)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_21 + (-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)

We simplified constraint (33) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(34)    (x1[2] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_21 + (-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)

We simplified constraint (34) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(35)    (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)

For Pair COND_1003_0_MAIN_LE1(TRUE, x1, x0) → 1003_0_MAIN_LE(+(x1, -1), x0) the following chains were created:

We consider the chain 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]), COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]), 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0]) which results in the following constraint:
(36)    (&&(>(x1[2], 0), >(x0[2], 0))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3]∧+(x1[3], -1)=x1[0]∧x0[3]=x0[0] ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥1003_0_MAIN_LE(+(x1[3], -1), x0[3])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (36) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(37)    (>(x1[2], 0)=TRUE∧>(x0[2], 0)=TRUE ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥1003_0_MAIN_LE(+(x1[2], -1), x0[2])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (37) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(38)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (38) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(39)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (39) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(40)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (40) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(41)    (x1[2] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (41) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(42)    (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)
We consider the chain 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]), COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]), 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]) which results in the following constraint:
(43)    (&&(>(x1[2], 0), >(x0[2], 0))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3]∧+(x1[3], -1)=x1[2]1∧x0[3]=x0[2]1 ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥1003_0_MAIN_LE(+(x1[3], -1), x0[3])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (43) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(44)    (>(x1[2], 0)=TRUE∧>(x0[2], 0)=TRUE ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥1003_0_MAIN_LE(+(x1[2], -1), x0[2])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (44) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(45)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (45) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(46)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (46) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(47)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (47) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(48)    (x1[2] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

We simplified constraint (48) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(49)    (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), x1, x0, x2)
- (x0[1] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[1] ≥ 0∧[(-1)bso_18] ≥ 0)
- (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[3] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[0] ≥ 0∧[(-1)bso_18] ≥ 0)
COND_1003_0_MAIN_LE(TRUE, x1, x0, x2) → 1003_0_MAIN_LE(x2, +(x0, -1))
- (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)
- (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(x2[1], +(x0[1], -1))), ≥)∧[(-1)Bound*bni_19] + [bni_19]x0[0] ≥ 0∧[1 + (-1)bso_20] ≥ 0)
1003_0_MAIN_LE(x1, x0) → COND_1003_0_MAIN_LE1(&&(>(x1, 0), >(x0, 0)), x1, x0)
- (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_21] + [bni_21]x0[2] ≥ 0∧[(-1)bso_22] ≥ 0)
COND_1003_0_MAIN_LE1(TRUE, x1, x0) → 1003_0_MAIN_LE(+(x1, -1), x0)
- (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)
- (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)Bound*bni_23] + [bni_23]x0[2] ≥ 0∧[(-1)bso_24] ≥ 0)

The constraints for P_> respective P_bound are constructed from P_≥ where we just replace every occurence of "t ≥ s" in P_≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for P_bound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers[POLO]:

POL(TRUE) = 0
POL(FALSE) = 0
POL(1003_0_MAIN_LE(x₁, x₂)) = [-1] + x₂
POL(COND_1003_0_MAIN_LE(x₁, x₂, x₃, x₄)) = [-1] + x₃ + [-1]x₁
POL(&&(x₁, x₂)) = 0
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(0) = 0
POL(+(x₁, x₂)) = x₁ + x₂
POL(COND_1003_0_MAIN_LE1(x₁, x₂, x₃)) = [-1] + x₃ + [-1]x₁

The following pairs are in P_>:

COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1))

The following pairs are in P_bound:

1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])
COND_1003_0_MAIN_LE(TRUE, x1[1], x0[1], x2[1]) → 1003_0_MAIN_LE(x2[1], +(x0[1], -1))
1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])
COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3])

The following pairs are in P_≥:

1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), x1[0], x0[0], x2[0])
1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])
COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3])

At least the following rules have been oriented under context sensitive arithmetic replacement:

&&(TRUE, TRUE)¹ ↔ TRUE¹
&&(TRUE, FALSE)¹ ↔ FALSE¹
&&(FALSE, TRUE)¹ ↔ FALSE¹
&&(FALSE, FALSE)¹ ↔ FALSE¹

(8) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1003_0_MAIN_LE(x1[0], x0[0]) → COND_1003_0_MAIN_LE(x2[0] > -1 && x1[0] > 0 && x0[0] > 0, x1[0], x0[0], x2[0])
(2): 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(x1[2] > 0 && x0[2] > 0, x1[2], x0[2])
(3): COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(x1[3] + -1, x0[3])

(3) -> (0), if (x1[3] + -1 →^* x1[0]∧x0[3] →^* x0[0])

(3) -> (2), if (x1[3] + -1 →^* x1[2]∧x0[3] →^* x0[2])

(2) -> (3), if (x1[2] > 0 && x0[2] > 0 ∧x1[2] →^* x1[3]∧x0[2] →^* x0[3])

The set Q is empty.

(9) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(10) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer, Boolean

R is empty.

The integer pair graph contains the following rules and edges:
(3): COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(x1[3] + -1, x0[3])
(2): 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(x1[2] > 0 && x0[2] > 0, x1[2], x0[2])

(3) -> (2), if (x1[3] + -1 →^* x1[2]∧x0[3] →^* x0[2])

(2) -> (3), if (x1[2] > 0 && x0[2] > 0 ∧x1[2] →^* x1[3]∧x0[2] →^* x0[3])

The set Q is empty.

(11) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpDefaultShapeHeuristic@1c4e4471 Constraint Generator: NonInfConstraintGenerator: PathGenerator: MetricPathGenerator: Max Left Steps: 1 Max Right Steps: 1

The constraints were generated the following way:
The DP Problem is simplified using the Induction Calculus [NONINF] with the following steps:
Note that final constraints are written in bold face.

For Pair COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]) the following chains were created:

We consider the chain 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]), COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]), 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]) which results in the following constraint:
(1)    (&&(>(x1[2], 0), >(x0[2], 0))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3]∧+(x1[3], -1)=x1[2]1∧x0[3]=x0[2]1 ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3])≥1003_0_MAIN_LE(+(x1[3], -1), x0[3])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (1) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x1[2], 0)=TRUE∧>(x0[2], 0)=TRUE ⇒ COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥NonInfC∧COND_1003_0_MAIN_LE1(TRUE, x1[2], x0[2])≥1003_0_MAIN_LE(+(x1[2], -1), x0[2])∧(U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-2)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-2)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-2)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x1[2] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)

For Pair 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]) the following chains were created:

We consider the chain 1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2]), COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3]) which results in the following constraint:
(8)    (&&(>(x1[2], 0), >(x0[2], 0))=TRUE∧x1[2]=x1[3]∧x0[2]=x0[3] ⇒ 1003_0_MAIN_LE(x1[2], x0[2])≥NonInfC∧1003_0_MAIN_LE(x1[2], x0[2])≥COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])∧(U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥))

We simplified constraint (8) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(9)    (>(x1[2], 0)=TRUE∧>(x0[2], 0)=TRUE ⇒ 1003_0_MAIN_LE(x1[2], x0[2])≥NonInfC∧1003_0_MAIN_LE(x1[2], x0[2])≥COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])∧(U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥))

We simplified constraint (9) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(10)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

We simplified constraint (10) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(11)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

We simplified constraint (11) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(12)    (x1[2] + [-1] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)bni_14 + (-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

We simplified constraint (12) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(13)    (x1[2] ≥ 0∧x0[2] + [-1] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(14)    (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

To summarize, we get the following constraints P_≥ for the following pairs.

COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3])
- (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(1003_0_MAIN_LE(+(x1[3], -1), x0[3])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [bni_12]x1[2] ≥ 0∧[(-1)bso_13] ≥ 0)
1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])
- (x1[2] ≥ 0∧x0[2] ≥ 0 ⇒ (U^Increasing(COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])), ≥)∧[(-1)Bound*bni_14] + [bni_14]x1[2] ≥ 0∧[1 + (-1)bso_15] ≥ 0)

POL(TRUE) = [2]
POL(FALSE) = [2]
POL(COND_1003_0_MAIN_LE1(x₁, x₂, x₃)) = x₂ + [-1]x₁
POL(1003_0_MAIN_LE(x₁, x₂)) = [-1] + x₁
POL(+(x₁, x₂)) = x₁ + x₂
POL(-1) = [-1]
POL(&&(x₁, x₂)) = [2]
POL(>(x₁, x₂)) = [-1]
POL(0) = 0

The following pairs are in P_>:

1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])

The following pairs are in P_bound:

COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3])
1003_0_MAIN_LE(x1[2], x0[2]) → COND_1003_0_MAIN_LE1(&&(>(x1[2], 0), >(x0[2], 0)), x1[2], x0[2])

The following pairs are in P_≥:

COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(+(x1[3], -1), x0[3])

At least the following rules have been oriented under context sensitive arithmetic replacement:

TRUE¹ → &&(TRUE, TRUE)¹
&&(TRUE, FALSE)¹ ↔ FALSE¹
FALSE¹ → &&(FALSE, TRUE)¹
&&(FALSE, FALSE)¹ ↔ FALSE¹

(12) Obligation:

IDP problem:
The following function symbols are pre-defined:

!=	~	Neq: (Integer, Integer) -> Boolean
*	~	Mul: (Integer, Integer) -> Integer
>=	~	Ge: (Integer, Integer) -> Boolean
-1	~	UnaryMinus: (Integer) -> Integer
\|	~	Bwor: (Integer, Integer) -> Integer
/	~	Div: (Integer, Integer) -> Integer
=	~	Eq: (Integer, Integer) -> Boolean
	~	Bwxor: (Integer, Integer) -> Integer
\|\|	~	Lor: (Boolean, Boolean) -> Boolean
!	~	Lnot: (Boolean) -> Boolean
<	~	Lt: (Integer, Integer) -> Boolean
-	~	Sub: (Integer, Integer) -> Integer
<=	~	Le: (Integer, Integer) -> Boolean
>	~	Gt: (Integer, Integer) -> Boolean
~	~	Bwnot: (Integer) -> Integer
%	~	Mod: (Integer, Integer) -> Integer
&	~	Bwand: (Integer, Integer) -> Integer
+	~	Add: (Integer, Integer) -> Integer
&&	~	Land: (Boolean, Boolean) -> Boolean

The following domains are used:

Integer

R is empty.

The integer pair graph contains the following rules and edges:
(3): COND_1003_0_MAIN_LE1(TRUE, x1[3], x0[3]) → 1003_0_MAIN_LE(x1[3] + -1, x0[3])

The set Q is empty.

(13) IDependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(0) Obligation:

(1) JBCToGraph (SOUND transformation)

(2) Obligation:

(3) TerminationGraphToSCCProof (SOUND transformation)

(4) Obligation:

(5) SCCToIDPv1Proof (SOUND transformation)

(6) Obligation:

(7) IDPNonInfProof (SOUND transformation)

(8) Obligation:

(9) IDependencyGraphProof (EQUIVALENT transformation)

(10) Obligation:

(11) IDPNonInfProof (SOUND transformation)

(12) Obligation:

(13) IDependencyGraphProof (EQUIVALENT transformation)

(14) TRUE