Termination proof of /tmp/tmp92lWrW/Infix2Postfix.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBC2FIG (⇒)

↳2 JBCTerminationGraph

↳3 FIGtoITRSProof (⇒)

↳4 AND

    ↳5 IDP

        ↳6 IDPtoQDPProof (⇒)

        ↳7 QDP

        ↳8 UsableRulesProof (⇔)

        ↳9 QDP

        ↳10 QReductionProof (⇔)

        ↳11 QDP

        ↳12 QDPSizeChangeProof (⇔)

        ↳13 YES

    ↳14 IDP

        ↳15 IDPNonInfProof (⇒)

        ↳16 AND

            ↳17 IDP

                ↳18 IDependencyGraphProof (⇔)

                ↳19 TRUE

            ↳20 IDP

                ↳21 IDPtoQDPProof (⇒)

                ↳22 QDP

                ↳23 UsableRulesProof (⇔)

                ↳24 QDP

                ↳25 QReductionProof (⇔)

                ↳26 QDP

                ↳27 QDPSizeChangeProof (⇔)

                ↳28 YES

    ↳29 IDP

        ↳30 IDPNonInfProof (⇒)

        ↳31 AND

            ↳32 IDP

                ↳33 IDependencyGraphProof (⇔)

                ↳34 TRUE

            ↳35 IDP

                ↳36 IDependencyGraphProof (⇔)

                ↳37 TRUE

    ↳38 IDP

        ↳39 IDPNonInfProof (⇒)

        ↳40 AND

            ↳41 IDP

                ↳42 IDependencyGraphProof (⇔)

                ↳43 TRUE

            ↳44 IDP

                ↳45 IDependencyGraphProof (⇔)

                ↳46 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_20 (Apple Inc.) Main-Class: Infix2Postfix

public class Infix2Postfix {
    public static LinkedList buildExpression(int n) {
	LinkedList exp = null;
	for (int i = 1; i <= n; i++) {
	    if (i <= n-1) exp = new LinkedList(')', exp);
	    exp = new LinkedList(')', exp);
	    exp = new LinkedList('b', exp);
	    exp = new LinkedList('+', exp);
	    exp = new LinkedList('a', exp);
	    exp = new LinkedList('(', exp);
	    if (i <= n-1) exp = new LinkedList('*', exp);
	}

	for (int i = 1; i < n; i++)
	    exp = new LinkedList('(', exp);

	return exp;
    }

    public static LinkedList toPostfix(LinkedList infix) {
	LinkedList operators = null, operands = null;
	while (infix != null) {
	    char c = infix.getFirst();
	    switch (c) {
	    case '(': break;
	    case '+': case '-': case '*': case '/':
		operators = new LinkedList(c, operators);
		break;
	    case ')':
		operands = new LinkedList(operators.getFirst(), operands);
		operators = operators.getTail();
		break;
	    default:
		operands = new LinkedList(c, operands);
	    }
	    infix = infix.getTail();
	}

	LinkedList postfix = null;
	while (operands != null) {
	    postfix = new LinkedList(operands.getFirst(), postfix);
	    operands = operands.getTail();
	}

	return postfix;
    }

    public static void  main(String args[]) {
	LinkedList infix = buildExpression(args.length);
	// System.out.println("infix = " + infix);
	LinkedList postfix = toPostfix(infix);
	// System.out.println("postfix = " + postfix);
    }
}


public class LinkedList {
    private char head;
    private LinkedList tail;

    public LinkedList(char head, LinkedList tail) {
	this.head = head;
	this.tail = tail;
    }

    public char getFirst() {
	return this.head;
    }

    public LinkedList getTail() {
	return this.tail;
    }

    /*
    public String toString() {
	return head + (tail == null ? "" : " " + tail.toString());
    }
    */
}

(1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

(2) Obligation:

FIGraph based on JBC Program:
Infix2Postfix.main([Ljava/lang/String;)V: Graph of 26 nodes with 0 SCCs.

Infix2Postfix.buildExpression(I)LLinkedList;: Graph of 169 nodes with 2 SCCs.

Infix2Postfix.toPostfix(LLinkedList;)LLinkedList;: Graph of 439 nodes with 2 SCCs.

(3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Logs:

Log for SCC 0:

Generated 31 rules for P and 3 rules for R.

Combined rules. Obtained 1 rules for P and 1 rules for R.

Filtered ground terms:

8520_0_toPostfix_NULL(x1, x2, x3, x4) → 8520_0_toPostfix_NULL(x2, x3, x4)
LinkedList(x1, x2, x3) → LinkedList(x2, x3)
8614_0_toPostfix_Return(x1, x2) → 8614_0_toPostfix_Return(x2)

Filtered duplicate args:

8520_0_toPostfix_NULL(x1, x2, x3) → 8520_0_toPostfix_NULL(x2, x3)

Filtered unneeded arguments:

8520_0_toPostfix_NULL(x1, x2) → 8520_0_toPostfix_NULL(x2)

Filtered all free variables:

8614_0_toPostfix_Return(x1) → 8614_0_toPostfix_Return

Finished conversion. Obtained 1 rules for P and 1 rules for R. System has no predefined symbols.

Log for SCC 1:

Generated 368 rules for P and 81 rules for R.

Combined rules. Obtained 28 rules for P and 3 rules for R.

Filtered ground terms:

8517_0_toPostfix_Store(x1, x2, x3, x4) → 8517_0_toPostfix_Store(x2, x3, x4)
LinkedList(x1, x2, x3) → LinkedList(x2, x3)
6432_0_toPostfix_NULL(x1, x2, x3, x4, x5) → 6432_0_toPostfix_NULL(x2, x3, x4, x5)
8514_0_toPostfix_Store(x1, x2, x3, x4) → 8514_0_toPostfix_Store(x2, x3, x4)
8511_0_toPostfix_Store(x1, x2, x3, x4) → 8511_0_toPostfix_Store(x2, x3, x4)
8508_0_toPostfix_Store(x1, x2, x3, x4) → 8508_0_toPostfix_Store(x2, x3, x4)
8934_0_toPostfix_Store(x1, x2, x3, x4) → 8934_0_toPostfix_Store(x2, x3, x4)
7120_0_toPostfix_Store(x1, x2, x3, x4) → 7120_0_toPostfix_Store(x2, x3, x4)
6725_0_toPostfix_New(x1, x2, x3, x4, x5) → 6725_0_toPostfix_New(x2, x3, x4)
6715_0_toPostfix_New(x1, x2, x3, x4, x5) → 6715_0_toPostfix_New(x2, x3, x4)
6653_0_toPostfix_New(x1, x2, x3, x4, x5) → 6653_0_toPostfix_New(x2, x3, x4, x5)
Cond_6432_0_toPostfix_NULL2(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL2(x1, x3, x4, x5, x6)
Cond_6432_0_toPostfix_NULL1(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL1(x1, x3, x4, x5, x6)
Cond_6432_0_toPostfix_NULL(x1, x2, x3, x4, x5, x6) → Cond_6432_0_toPostfix_NULL(x1, x3, x4, x5, x6)
8520_0_toPostfix_NULL(x1, x2, x3, x4) → 8520_0_toPostfix_NULL(x2, x3, x4)
8614_0_toPostfix_Return(x1, x2) → 8614_0_toPostfix_Return(x2)

Filtered duplicate args:

6432_0_toPostfix_NULL(x1, x2, x3, x4) → 6432_0_toPostfix_NULL(x2, x3, x4)
Cond_6432_0_toPostfix_NULL2(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL2(x1, x3, x4, x5)
Cond_6432_0_toPostfix_NULL1(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL1(x1, x3, x4, x5)
Cond_6432_0_toPostfix_NULL(x1, x2, x3, x4, x5) → Cond_6432_0_toPostfix_NULL(x1, x3, x4, x5)
8520_0_toPostfix_NULL(x1, x2, x3) → 8520_0_toPostfix_NULL(x2, x3)

Filtered unneeded arguments:

8520_0_toPostfix_NULL(x1, x2) → 8520_0_toPostfix_NULL(x2)

Filtered all free variables:

8614_0_toPostfix_Return(x1) → 8614_0_toPostfix_Return

Combined rules. Obtained 27 rules for P and 3 rules for R.

Finished conversion. Obtained 27 rules for P and 3 rules for R. System has predefined symbols.

Log for SCC 2:

Generated 22 rules for P and 3 rules for R.

Combined rules. Obtained 1 rules for P and 0 rules for R.

Filtered ground terms:

9722_0_buildExpression_Load(x1, x2, x3, x4) → 9722_0_buildExpression_Load(x2, x3, x4)
Cond_9722_0_buildExpression_Load(x1, x2, x3, x4, x5) → Cond_9722_0_buildExpression_Load(x1, x3, x4, x5)

Filtered duplicate args:

9722_0_buildExpression_Load(x1, x2, x3) → 9722_0_buildExpression_Load(x1, x3)
Cond_9722_0_buildExpression_Load(x1, x2, x3, x4) → Cond_9722_0_buildExpression_Load(x1, x2, x4)

Combined rules. Obtained 1 rules for P and 0 rules for R.

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

Log for SCC 3:

Generated 132 rules for P and 32 rules for R.

Combined rules. Obtained 4 rules for P and 0 rules for R.

Filtered ground terms:

9911_0_buildExpression_GT(x1, x2, x3, x4, x5) → 9911_0_buildExpression_GT(x2, x3, x4, x5)
Cond_9262_0_buildExpression_Load1(x1, x2, x3, x4, x5) → Cond_9262_0_buildExpression_Load1(x1, x3, x4, x5)
9262_0_buildExpression_Load(x1, x2, x3, x4) → 9262_0_buildExpression_Load(x2, x3, x4)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4, x5, x6) → Cond_9911_0_buildExpression_GT1(x1, x3, x4, x5, x6)
Cond_9911_0_buildExpression_GT(x1, x2, x3, x4, x5, x6) → Cond_9911_0_buildExpression_GT(x1, x3, x4, x5, x6)
Cond_9262_0_buildExpression_Load(x1, x2, x3, x4, x5) → Cond_9262_0_buildExpression_Load(x1, x3, x4, x5)

Filtered duplicate args:

9911_0_buildExpression_GT(x1, x2, x3, x4) → 9911_0_buildExpression_GT(x1, x3, x4)
Cond_9262_0_buildExpression_Load1(x1, x2, x3, x4) → Cond_9262_0_buildExpression_Load1(x1, x2, x4)
9262_0_buildExpression_Load(x1, x2, x3) → 9262_0_buildExpression_Load(x1, x3)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4, x5) → Cond_9911_0_buildExpression_GT1(x1, x2, x4, x5)
Cond_9911_0_buildExpression_GT(x1, x2, x3, x4, x5) → Cond_9911_0_buildExpression_GT(x1, x2, x4, x5)
Cond_9262_0_buildExpression_Load(x1, x2, x3, x4) → Cond_9262_0_buildExpression_Load(x1, x2, x4)

Filtered unneeded arguments:

Cond_9911_0_buildExpression_GT(x1, x2, x3, x4) → Cond_9911_0_buildExpression_GT(x1, x2, x3)
Cond_9911_0_buildExpression_GT1(x1, x2, x3, x4) → Cond_9911_0_buildExpression_GT1(x1, x2, x3)

Combined rules. Obtained 4 rules for P and 0 rules for R.

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

(4) Complex Obligation (AND)

(5) 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:
none

The ITRS R consists of the following rules:
8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return

The integer pair graph contains the following rules and edges:
(0): 8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

(0) -> (0), if ((x1[0] →^* java.lang.Object(LinkedList(x0[0]', x1[0]'))))

The set Q consists of the following terms:
8520_0_toPostfix_NULL(NULL)

(6) IDPtoQDPProof (SOUND transformation)

Represented integers and predefined function symbols by Terms

(7) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

The TRS R consists of the following rules:

8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return

The set Q consists of the following terms:

8520_0_toPostfix_NULL(NULL)

We have to consider all minimal (P,Q,R)-chains.

(8) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

R is empty.
The set Q consists of the following terms:

8520_0_toPostfix_NULL(NULL)

We have to consider all minimal (P,Q,R)-chains.

(10) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

8520_0_toPostfix_NULL(NULL)

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

8520_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x0[0], x1[0]))) → 8520_0_TOPOSTFIX_NULL(x1[0])
The graph contains the following edges 1 > 1

(13) YES

(14) 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

The ITRS R consists of the following rules:
6432_0_toPostfix_NULL(x0, x1, NULL) → 8520_0_toPostfix_NULL(x1)
8520_0_toPostfix_NULL(NULL) → 8614_0_toPostfix_Return
8520_0_toPostfix_NULL(java.lang.Object(LinkedList(x0, x1))) → 8520_0_toPostfix_NULL(x1)

The integer pair graph contains the following rules and edges:
(0): 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])
(1): 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])
(2): 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])
(3): 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])
(4): 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])
(5): 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])
(6): 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(x0[6] < 40, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))
(7): COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])
(8): 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])
(9): 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9])
(10): 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10])
(11): 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11])
(12): 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12])
(13): 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13])
(14): 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14])
(15): 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15])
(16): 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(x0[16] > 47, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))
(17): 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[17])), x2[17], x3[17]) → 6432_0_TOPOSTFIX_NULL(x2[17], java.lang.Object(LinkedList(44, x3[17])), x1[17])
(18): 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[18])), x2[18], x3[18]) → 6432_0_TOPOSTFIX_NULL(x2[18], java.lang.Object(LinkedList(46, x3[18])), x1[18])
(19): 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19])
(20): 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20])
(21): 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21])
(22): 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22])
(23): 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23])
(24): 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24])
(25): 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25])
(26): 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26])

(0) -> (6), if ((x0[0] →^* x2[6])∧(x1[0] →^* x3[6])∧(x2[0] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(0) -> (8), if ((x0[0] →^* x2[8])∧(x1[0] →^* x3[8])∧(x2[0] →^* java.lang.Object(LinkedList(40, x1[8]))))

(0) -> (9), if ((x0[0] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x1[0] →^* x4[9])∧(x2[0] →^* java.lang.Object(LinkedList(41, x1[9]))))

(0) -> (10), if ((x0[0] →^* x2[10])∧(x1[0] →^* x3[10])∧(x2[0] →^* java.lang.Object(LinkedList(42, x1[10]))))

(0) -> (11), if ((x0[0] →^* x2[11])∧(x1[0] →^* x3[11])∧(x2[0] →^* java.lang.Object(LinkedList(43, x1[11]))))

(0) -> (12), if ((x0[0] →^* x2[12])∧(x1[0] →^* x3[12])∧(x2[0] →^* java.lang.Object(LinkedList(44, x1[12]))))

(0) -> (13), if ((x0[0] →^* x2[13])∧(x1[0] →^* x3[13])∧(x2[0] →^* java.lang.Object(LinkedList(45, x1[13]))))

(0) -> (14), if ((x0[0] →^* x2[14])∧(x1[0] →^* x3[14])∧(x2[0] →^* java.lang.Object(LinkedList(46, x1[14]))))

(0) -> (15), if ((x0[0] →^* x2[15])∧(x1[0] →^* x3[15])∧(x2[0] →^* java.lang.Object(LinkedList(47, x1[15]))))

(0) -> (16), if ((x0[0] →^* x2[16])∧(x1[0] →^* x3[16])∧(x2[0] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(0) -> (19), if ((x0[0] →^* x2[19])∧(x1[0] →^* x3[19])∧(x2[0] →^* java.lang.Object(LinkedList(44, x1[19]))))

(0) -> (20), if ((x0[0] →^* x2[20])∧(x1[0] →^* x3[20])∧(x2[0] →^* java.lang.Object(LinkedList(46, x1[20]))))

(0) -> (21), if ((x0[0] →^* x2[21])∧(x1[0] →^* x3[21])∧(x2[0] →^* java.lang.Object(LinkedList(40, x1[21]))))

(0) -> (22), if ((x0[0] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x1[0] →^* x4[22])∧(x2[0] →^* java.lang.Object(LinkedList(41, x1[22]))))

(0) -> (23), if ((x0[0] →^* x2[23])∧(x1[0] →^* x3[23])∧(x2[0] →^* java.lang.Object(LinkedList(42, x1[23]))))

(0) -> (24), if ((x0[0] →^* x2[24])∧(x1[0] →^* x3[24])∧(x2[0] →^* java.lang.Object(LinkedList(43, x1[24]))))

(0) -> (25), if ((x0[0] →^* x2[25])∧(x1[0] →^* x3[25])∧(x2[0] →^* java.lang.Object(LinkedList(45, x1[25]))))

(0) -> (26), if ((x0[0] →^* x2[26])∧(x1[0] →^* x3[26])∧(x2[0] →^* java.lang.Object(LinkedList(47, x1[26]))))

(1) -> (6), if ((x0[1] →^* x2[6])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[6])∧(x3[1] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(1) -> (8), if ((x0[1] →^* x2[8])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[8])∧(x3[1] →^* java.lang.Object(LinkedList(40, x1[8]))))

(1) -> (9), if ((x0[1] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x4[9])∧(x3[1] →^* java.lang.Object(LinkedList(41, x1[9]))))

(1) -> (10), if ((x0[1] →^* x2[10])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[10])∧(x3[1] →^* java.lang.Object(LinkedList(42, x1[10]))))

(1) -> (11), if ((x0[1] →^* x2[11])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[11])∧(x3[1] →^* java.lang.Object(LinkedList(43, x1[11]))))

(1) -> (12), if ((x0[1] →^* x2[12])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[12])∧(x3[1] →^* java.lang.Object(LinkedList(44, x1[12]))))

(1) -> (13), if ((x0[1] →^* x2[13])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[13])∧(x3[1] →^* java.lang.Object(LinkedList(45, x1[13]))))

(1) -> (14), if ((x0[1] →^* x2[14])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[14])∧(x3[1] →^* java.lang.Object(LinkedList(46, x1[14]))))

(1) -> (15), if ((x0[1] →^* x2[15])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[15])∧(x3[1] →^* java.lang.Object(LinkedList(47, x1[15]))))

(1) -> (16), if ((x0[1] →^* x2[16])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[16])∧(x3[1] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(1) -> (19), if ((x0[1] →^* x2[19])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[19])∧(x3[1] →^* java.lang.Object(LinkedList(44, x1[19]))))

(1) -> (20), if ((x0[1] →^* x2[20])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[20])∧(x3[1] →^* java.lang.Object(LinkedList(46, x1[20]))))

(1) -> (21), if ((x0[1] →^* x2[21])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[21])∧(x3[1] →^* java.lang.Object(LinkedList(40, x1[21]))))

(1) -> (22), if ((x0[1] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x4[22])∧(x3[1] →^* java.lang.Object(LinkedList(41, x1[22]))))

(1) -> (23), if ((x0[1] →^* x2[23])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[23])∧(x3[1] →^* java.lang.Object(LinkedList(42, x1[23]))))

(1) -> (24), if ((x0[1] →^* x2[24])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[24])∧(x3[1] →^* java.lang.Object(LinkedList(43, x1[24]))))

(1) -> (25), if ((x0[1] →^* x2[25])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[25])∧(x3[1] →^* java.lang.Object(LinkedList(45, x1[25]))))

(1) -> (26), if ((x0[1] →^* x2[26])∧(java.lang.Object(LinkedList(x1[1], x2[1])) →^* x3[26])∧(x3[1] →^* java.lang.Object(LinkedList(47, x1[26]))))

(2) -> (6), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[6])∧(x2[2] →^* x3[6])∧(x3[2] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(2) -> (8), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[8])∧(x2[2] →^* x3[8])∧(x3[2] →^* java.lang.Object(LinkedList(40, x1[8]))))

(2) -> (9), if ((java.lang.Object(LinkedList(42, x1[2])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[2] →^* x4[9])∧(x3[2] →^* java.lang.Object(LinkedList(41, x1[9]))))

(2) -> (10), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[10])∧(x2[2] →^* x3[10])∧(x3[2] →^* java.lang.Object(LinkedList(42, x1[10]))))

(2) -> (11), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[11])∧(x2[2] →^* x3[11])∧(x3[2] →^* java.lang.Object(LinkedList(43, x1[11]))))

(2) -> (12), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[12])∧(x2[2] →^* x3[12])∧(x3[2] →^* java.lang.Object(LinkedList(44, x1[12]))))

(2) -> (13), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[13])∧(x2[2] →^* x3[13])∧(x3[2] →^* java.lang.Object(LinkedList(45, x1[13]))))

(2) -> (14), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[14])∧(x2[2] →^* x3[14])∧(x3[2] →^* java.lang.Object(LinkedList(46, x1[14]))))

(2) -> (15), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[15])∧(x2[2] →^* x3[15])∧(x3[2] →^* java.lang.Object(LinkedList(47, x1[15]))))

(2) -> (16), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[16])∧(x2[2] →^* x3[16])∧(x3[2] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(2) -> (19), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[19])∧(x2[2] →^* x3[19])∧(x3[2] →^* java.lang.Object(LinkedList(44, x1[19]))))

(2) -> (20), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[20])∧(x2[2] →^* x3[20])∧(x3[2] →^* java.lang.Object(LinkedList(46, x1[20]))))

(2) -> (21), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[21])∧(x2[2] →^* x3[21])∧(x3[2] →^* java.lang.Object(LinkedList(40, x1[21]))))

(2) -> (22), if ((java.lang.Object(LinkedList(42, x1[2])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[2] →^* x4[22])∧(x3[2] →^* java.lang.Object(LinkedList(41, x1[22]))))

(2) -> (23), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[23])∧(x2[2] →^* x3[23])∧(x3[2] →^* java.lang.Object(LinkedList(42, x1[23]))))

(2) -> (24), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[24])∧(x2[2] →^* x3[24])∧(x3[2] →^* java.lang.Object(LinkedList(43, x1[24]))))

(2) -> (25), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[25])∧(x2[2] →^* x3[25])∧(x3[2] →^* java.lang.Object(LinkedList(45, x1[25]))))

(2) -> (26), if ((java.lang.Object(LinkedList(42, x1[2])) →^* x2[26])∧(x2[2] →^* x3[26])∧(x3[2] →^* java.lang.Object(LinkedList(47, x1[26]))))

(3) -> (6), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[6])∧(x2[3] →^* x3[6])∧(x3[3] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(3) -> (8), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[8])∧(x2[3] →^* x3[8])∧(x3[3] →^* java.lang.Object(LinkedList(40, x1[8]))))

(3) -> (9), if ((java.lang.Object(LinkedList(43, x1[3])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[3] →^* x4[9])∧(x3[3] →^* java.lang.Object(LinkedList(41, x1[9]))))

(3) -> (10), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[10])∧(x2[3] →^* x3[10])∧(x3[3] →^* java.lang.Object(LinkedList(42, x1[10]))))

(3) -> (11), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[11])∧(x2[3] →^* x3[11])∧(x3[3] →^* java.lang.Object(LinkedList(43, x1[11]))))

(3) -> (12), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[12])∧(x2[3] →^* x3[12])∧(x3[3] →^* java.lang.Object(LinkedList(44, x1[12]))))

(3) -> (13), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[13])∧(x2[3] →^* x3[13])∧(x3[3] →^* java.lang.Object(LinkedList(45, x1[13]))))

(3) -> (14), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[14])∧(x2[3] →^* x3[14])∧(x3[3] →^* java.lang.Object(LinkedList(46, x1[14]))))

(3) -> (15), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[15])∧(x2[3] →^* x3[15])∧(x3[3] →^* java.lang.Object(LinkedList(47, x1[15]))))

(3) -> (16), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[16])∧(x2[3] →^* x3[16])∧(x3[3] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(3) -> (19), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[19])∧(x2[3] →^* x3[19])∧(x3[3] →^* java.lang.Object(LinkedList(44, x1[19]))))

(3) -> (20), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[20])∧(x2[3] →^* x3[20])∧(x3[3] →^* java.lang.Object(LinkedList(46, x1[20]))))

(3) -> (21), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[21])∧(x2[3] →^* x3[21])∧(x3[3] →^* java.lang.Object(LinkedList(40, x1[21]))))

(3) -> (22), if ((java.lang.Object(LinkedList(43, x1[3])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[3] →^* x4[22])∧(x3[3] →^* java.lang.Object(LinkedList(41, x1[22]))))

(3) -> (23), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[23])∧(x2[3] →^* x3[23])∧(x3[3] →^* java.lang.Object(LinkedList(42, x1[23]))))

(3) -> (24), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[24])∧(x2[3] →^* x3[24])∧(x3[3] →^* java.lang.Object(LinkedList(43, x1[24]))))

(3) -> (25), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[25])∧(x2[3] →^* x3[25])∧(x3[3] →^* java.lang.Object(LinkedList(45, x1[25]))))

(3) -> (26), if ((java.lang.Object(LinkedList(43, x1[3])) →^* x2[26])∧(x2[3] →^* x3[26])∧(x3[3] →^* java.lang.Object(LinkedList(47, x1[26]))))

(4) -> (6), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[6])∧(x2[4] →^* x3[6])∧(x3[4] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(4) -> (8), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[8])∧(x2[4] →^* x3[8])∧(x3[4] →^* java.lang.Object(LinkedList(40, x1[8]))))

(4) -> (9), if ((java.lang.Object(LinkedList(45, x1[4])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[4] →^* x4[9])∧(x3[4] →^* java.lang.Object(LinkedList(41, x1[9]))))

(4) -> (10), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[10])∧(x2[4] →^* x3[10])∧(x3[4] →^* java.lang.Object(LinkedList(42, x1[10]))))

(4) -> (11), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[11])∧(x2[4] →^* x3[11])∧(x3[4] →^* java.lang.Object(LinkedList(43, x1[11]))))

(4) -> (12), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[12])∧(x2[4] →^* x3[12])∧(x3[4] →^* java.lang.Object(LinkedList(44, x1[12]))))

(4) -> (13), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[13])∧(x2[4] →^* x3[13])∧(x3[4] →^* java.lang.Object(LinkedList(45, x1[13]))))

(4) -> (14), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[14])∧(x2[4] →^* x3[14])∧(x3[4] →^* java.lang.Object(LinkedList(46, x1[14]))))

(4) -> (15), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[15])∧(x2[4] →^* x3[15])∧(x3[4] →^* java.lang.Object(LinkedList(47, x1[15]))))

(4) -> (16), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[16])∧(x2[4] →^* x3[16])∧(x3[4] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(4) -> (19), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[19])∧(x2[4] →^* x3[19])∧(x3[4] →^* java.lang.Object(LinkedList(44, x1[19]))))

(4) -> (20), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[20])∧(x2[4] →^* x3[20])∧(x3[4] →^* java.lang.Object(LinkedList(46, x1[20]))))

(4) -> (21), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[21])∧(x2[4] →^* x3[21])∧(x3[4] →^* java.lang.Object(LinkedList(40, x1[21]))))

(4) -> (22), if ((java.lang.Object(LinkedList(45, x1[4])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[4] →^* x4[22])∧(x3[4] →^* java.lang.Object(LinkedList(41, x1[22]))))

(4) -> (23), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[23])∧(x2[4] →^* x3[23])∧(x3[4] →^* java.lang.Object(LinkedList(42, x1[23]))))

(4) -> (24), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[24])∧(x2[4] →^* x3[24])∧(x3[4] →^* java.lang.Object(LinkedList(43, x1[24]))))

(4) -> (25), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[25])∧(x2[4] →^* x3[25])∧(x3[4] →^* java.lang.Object(LinkedList(45, x1[25]))))

(4) -> (26), if ((java.lang.Object(LinkedList(45, x1[4])) →^* x2[26])∧(x2[4] →^* x3[26])∧(x3[4] →^* java.lang.Object(LinkedList(47, x1[26]))))

(5) -> (6), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[6])∧(x2[5] →^* x3[6])∧(x3[5] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(5) -> (8), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[8])∧(x2[5] →^* x3[8])∧(x3[5] →^* java.lang.Object(LinkedList(40, x1[8]))))

(5) -> (9), if ((java.lang.Object(LinkedList(47, x1[5])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x2[5] →^* x4[9])∧(x3[5] →^* java.lang.Object(LinkedList(41, x1[9]))))

(5) -> (10), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[10])∧(x2[5] →^* x3[10])∧(x3[5] →^* java.lang.Object(LinkedList(42, x1[10]))))

(5) -> (11), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[11])∧(x2[5] →^* x3[11])∧(x3[5] →^* java.lang.Object(LinkedList(43, x1[11]))))

(5) -> (12), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[12])∧(x2[5] →^* x3[12])∧(x3[5] →^* java.lang.Object(LinkedList(44, x1[12]))))

(5) -> (13), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[13])∧(x2[5] →^* x3[13])∧(x3[5] →^* java.lang.Object(LinkedList(45, x1[13]))))

(5) -> (14), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[14])∧(x2[5] →^* x3[14])∧(x3[5] →^* java.lang.Object(LinkedList(46, x1[14]))))

(5) -> (15), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[15])∧(x2[5] →^* x3[15])∧(x3[5] →^* java.lang.Object(LinkedList(47, x1[15]))))

(5) -> (16), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[16])∧(x2[5] →^* x3[16])∧(x3[5] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(5) -> (19), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[19])∧(x2[5] →^* x3[19])∧(x3[5] →^* java.lang.Object(LinkedList(44, x1[19]))))

(5) -> (20), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[20])∧(x2[5] →^* x3[20])∧(x3[5] →^* java.lang.Object(LinkedList(46, x1[20]))))

(5) -> (21), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[21])∧(x2[5] →^* x3[21])∧(x3[5] →^* java.lang.Object(LinkedList(40, x1[21]))))

(5) -> (22), if ((java.lang.Object(LinkedList(47, x1[5])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x2[5] →^* x4[22])∧(x3[5] →^* java.lang.Object(LinkedList(41, x1[22]))))

(5) -> (23), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[23])∧(x2[5] →^* x3[23])∧(x3[5] →^* java.lang.Object(LinkedList(42, x1[23]))))

(5) -> (24), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[24])∧(x2[5] →^* x3[24])∧(x3[5] →^* java.lang.Object(LinkedList(43, x1[24]))))

(5) -> (25), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[25])∧(x2[5] →^* x3[25])∧(x3[5] →^* java.lang.Object(LinkedList(45, x1[25]))))

(5) -> (26), if ((java.lang.Object(LinkedList(47, x1[5])) →^* x2[26])∧(x2[5] →^* x3[26])∧(x3[5] →^* java.lang.Object(LinkedList(47, x1[26]))))

(6) -> (7), if ((x0[6] < 40 →^* TRUE)∧(x2[6] →^* x2[7])∧(x3[6] →^* x3[7])∧(java.lang.Object(LinkedList(x0[6], x1[6])) →^* java.lang.Object(LinkedList(x0[7], x1[7]))))

(7) -> (6), if ((x2[7] →^* x2[6])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[6])∧(x1[7] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(7) -> (8), if ((x2[7] →^* x2[8])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[8])∧(x1[7] →^* java.lang.Object(LinkedList(40, x1[8]))))

(7) -> (9), if ((x2[7] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x4[9])∧(x1[7] →^* java.lang.Object(LinkedList(41, x1[9]))))

(7) -> (10), if ((x2[7] →^* x2[10])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[10])∧(x1[7] →^* java.lang.Object(LinkedList(42, x1[10]))))

(7) -> (11), if ((x2[7] →^* x2[11])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[11])∧(x1[7] →^* java.lang.Object(LinkedList(43, x1[11]))))

(7) -> (12), if ((x2[7] →^* x2[12])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[12])∧(x1[7] →^* java.lang.Object(LinkedList(44, x1[12]))))

(7) -> (13), if ((x2[7] →^* x2[13])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[13])∧(x1[7] →^* java.lang.Object(LinkedList(45, x1[13]))))

(7) -> (14), if ((x2[7] →^* x2[14])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[14])∧(x1[7] →^* java.lang.Object(LinkedList(46, x1[14]))))

(7) -> (15), if ((x2[7] →^* x2[15])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[15])∧(x1[7] →^* java.lang.Object(LinkedList(47, x1[15]))))

(7) -> (16), if ((x2[7] →^* x2[16])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[16])∧(x1[7] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(7) -> (19), if ((x2[7] →^* x2[19])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[19])∧(x1[7] →^* java.lang.Object(LinkedList(44, x1[19]))))

(7) -> (20), if ((x2[7] →^* x2[20])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[20])∧(x1[7] →^* java.lang.Object(LinkedList(46, x1[20]))))

(7) -> (21), if ((x2[7] →^* x2[21])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[21])∧(x1[7] →^* java.lang.Object(LinkedList(40, x1[21]))))

(7) -> (22), if ((x2[7] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x4[22])∧(x1[7] →^* java.lang.Object(LinkedList(41, x1[22]))))

(7) -> (23), if ((x2[7] →^* x2[23])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[23])∧(x1[7] →^* java.lang.Object(LinkedList(42, x1[23]))))

(7) -> (24), if ((x2[7] →^* x2[24])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[24])∧(x1[7] →^* java.lang.Object(LinkedList(43, x1[24]))))

(7) -> (25), if ((x2[7] →^* x2[25])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[25])∧(x1[7] →^* java.lang.Object(LinkedList(45, x1[25]))))

(7) -> (26), if ((x2[7] →^* x2[26])∧(java.lang.Object(LinkedList(x0[7], x3[7])) →^* x3[26])∧(x1[7] →^* java.lang.Object(LinkedList(47, x1[26]))))

(8) -> (6), if ((x2[8] →^* x2[6])∧(x3[8] →^* x3[6])∧(x1[8] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(8) -> (8), if ((x2[8] →^* x2[8]')∧(x3[8] →^* x3[8]')∧(x1[8] →^* java.lang.Object(LinkedList(40, x1[8]'))))

(8) -> (9), if ((x2[8] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[8] →^* x4[9])∧(x1[8] →^* java.lang.Object(LinkedList(41, x1[9]))))

(8) -> (10), if ((x2[8] →^* x2[10])∧(x3[8] →^* x3[10])∧(x1[8] →^* java.lang.Object(LinkedList(42, x1[10]))))

(8) -> (11), if ((x2[8] →^* x2[11])∧(x3[8] →^* x3[11])∧(x1[8] →^* java.lang.Object(LinkedList(43, x1[11]))))

(8) -> (12), if ((x2[8] →^* x2[12])∧(x3[8] →^* x3[12])∧(x1[8] →^* java.lang.Object(LinkedList(44, x1[12]))))

(8) -> (13), if ((x2[8] →^* x2[13])∧(x3[8] →^* x3[13])∧(x1[8] →^* java.lang.Object(LinkedList(45, x1[13]))))

(8) -> (14), if ((x2[8] →^* x2[14])∧(x3[8] →^* x3[14])∧(x1[8] →^* java.lang.Object(LinkedList(46, x1[14]))))

(8) -> (15), if ((x2[8] →^* x2[15])∧(x3[8] →^* x3[15])∧(x1[8] →^* java.lang.Object(LinkedList(47, x1[15]))))

(8) -> (16), if ((x2[8] →^* x2[16])∧(x3[8] →^* x3[16])∧(x1[8] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(8) -> (19), if ((x2[8] →^* x2[19])∧(x3[8] →^* x3[19])∧(x1[8] →^* java.lang.Object(LinkedList(44, x1[19]))))

(8) -> (20), if ((x2[8] →^* x2[20])∧(x3[8] →^* x3[20])∧(x1[8] →^* java.lang.Object(LinkedList(46, x1[20]))))

(8) -> (21), if ((x2[8] →^* x2[21])∧(x3[8] →^* x3[21])∧(x1[8] →^* java.lang.Object(LinkedList(40, x1[21]))))

(8) -> (22), if ((x2[8] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[8] →^* x4[22])∧(x1[8] →^* java.lang.Object(LinkedList(41, x1[22]))))

(8) -> (23), if ((x2[8] →^* x2[23])∧(x3[8] →^* x3[23])∧(x1[8] →^* java.lang.Object(LinkedList(42, x1[23]))))

(8) -> (24), if ((x2[8] →^* x2[24])∧(x3[8] →^* x3[24])∧(x1[8] →^* java.lang.Object(LinkedList(43, x1[24]))))

(8) -> (25), if ((x2[8] →^* x2[25])∧(x3[8] →^* x3[25])∧(x1[8] →^* java.lang.Object(LinkedList(45, x1[25]))))

(8) -> (26), if ((x2[8] →^* x2[26])∧(x3[8] →^* x3[26])∧(x1[8] →^* java.lang.Object(LinkedList(47, x1[26]))))

(9) -> (6), if ((x3[9] →^* x2[6])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[6])∧(x1[9] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(9) -> (8), if ((x3[9] →^* x2[8])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[8])∧(x1[9] →^* java.lang.Object(LinkedList(40, x1[8]))))

(9) -> (9), if ((x3[9] →^* java.lang.Object(LinkedList(x2[9]', x3[9]')))∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x4[9]')∧(x1[9] →^* java.lang.Object(LinkedList(41, x1[9]'))))

(9) -> (10), if ((x3[9] →^* x2[10])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[10])∧(x1[9] →^* java.lang.Object(LinkedList(42, x1[10]))))

(9) -> (11), if ((x3[9] →^* x2[11])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[11])∧(x1[9] →^* java.lang.Object(LinkedList(43, x1[11]))))

(9) -> (12), if ((x3[9] →^* x2[12])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[12])∧(x1[9] →^* java.lang.Object(LinkedList(44, x1[12]))))

(9) -> (13), if ((x3[9] →^* x2[13])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[13])∧(x1[9] →^* java.lang.Object(LinkedList(45, x1[13]))))

(9) -> (14), if ((x3[9] →^* x2[14])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[14])∧(x1[9] →^* java.lang.Object(LinkedList(46, x1[14]))))

(9) -> (15), if ((x3[9] →^* x2[15])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[15])∧(x1[9] →^* java.lang.Object(LinkedList(47, x1[15]))))

(9) -> (16), if ((x3[9] →^* x2[16])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[16])∧(x1[9] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(9) -> (19), if ((x3[9] →^* x2[19])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[19])∧(x1[9] →^* java.lang.Object(LinkedList(44, x1[19]))))

(9) -> (20), if ((x3[9] →^* x2[20])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[20])∧(x1[9] →^* java.lang.Object(LinkedList(46, x1[20]))))

(9) -> (21), if ((x3[9] →^* x2[21])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[21])∧(x1[9] →^* java.lang.Object(LinkedList(40, x1[21]))))

(9) -> (22), if ((x3[9] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x4[22])∧(x1[9] →^* java.lang.Object(LinkedList(41, x1[22]))))

(9) -> (23), if ((x3[9] →^* x2[23])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[23])∧(x1[9] →^* java.lang.Object(LinkedList(42, x1[23]))))

(9) -> (24), if ((x3[9] →^* x2[24])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[24])∧(x1[9] →^* java.lang.Object(LinkedList(43, x1[24]))))

(9) -> (25), if ((x3[9] →^* x2[25])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[25])∧(x1[9] →^* java.lang.Object(LinkedList(45, x1[25]))))

(9) -> (26), if ((x3[9] →^* x2[26])∧(java.lang.Object(LinkedList(x2[9], x4[9])) →^* x3[26])∧(x1[9] →^* java.lang.Object(LinkedList(47, x1[26]))))

(10) -> (6), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[6])∧(x3[10] →^* x3[6])∧(x1[10] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(10) -> (8), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[8])∧(x3[10] →^* x3[8])∧(x1[10] →^* java.lang.Object(LinkedList(40, x1[8]))))

(10) -> (9), if ((java.lang.Object(LinkedList(42, x2[10])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[10] →^* x4[9])∧(x1[10] →^* java.lang.Object(LinkedList(41, x1[9]))))

(10) -> (10), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[10]')∧(x3[10] →^* x3[10]')∧(x1[10] →^* java.lang.Object(LinkedList(42, x1[10]'))))

(10) -> (11), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[11])∧(x3[10] →^* x3[11])∧(x1[10] →^* java.lang.Object(LinkedList(43, x1[11]))))

(10) -> (12), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[12])∧(x3[10] →^* x3[12])∧(x1[10] →^* java.lang.Object(LinkedList(44, x1[12]))))

(10) -> (13), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[13])∧(x3[10] →^* x3[13])∧(x1[10] →^* java.lang.Object(LinkedList(45, x1[13]))))

(10) -> (14), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[14])∧(x3[10] →^* x3[14])∧(x1[10] →^* java.lang.Object(LinkedList(46, x1[14]))))

(10) -> (15), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[15])∧(x3[10] →^* x3[15])∧(x1[10] →^* java.lang.Object(LinkedList(47, x1[15]))))

(10) -> (16), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[16])∧(x3[10] →^* x3[16])∧(x1[10] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(10) -> (19), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[19])∧(x3[10] →^* x3[19])∧(x1[10] →^* java.lang.Object(LinkedList(44, x1[19]))))

(10) -> (20), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[20])∧(x3[10] →^* x3[20])∧(x1[10] →^* java.lang.Object(LinkedList(46, x1[20]))))

(10) -> (21), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[21])∧(x3[10] →^* x3[21])∧(x1[10] →^* java.lang.Object(LinkedList(40, x1[21]))))

(10) -> (22), if ((java.lang.Object(LinkedList(42, x2[10])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[10] →^* x4[22])∧(x1[10] →^* java.lang.Object(LinkedList(41, x1[22]))))

(10) -> (23), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[23])∧(x3[10] →^* x3[23])∧(x1[10] →^* java.lang.Object(LinkedList(42, x1[23]))))

(10) -> (24), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[24])∧(x3[10] →^* x3[24])∧(x1[10] →^* java.lang.Object(LinkedList(43, x1[24]))))

(10) -> (25), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[25])∧(x3[10] →^* x3[25])∧(x1[10] →^* java.lang.Object(LinkedList(45, x1[25]))))

(10) -> (26), if ((java.lang.Object(LinkedList(42, x2[10])) →^* x2[26])∧(x3[10] →^* x3[26])∧(x1[10] →^* java.lang.Object(LinkedList(47, x1[26]))))

(11) -> (6), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[6])∧(x3[11] →^* x3[6])∧(x1[11] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(11) -> (8), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[8])∧(x3[11] →^* x3[8])∧(x1[11] →^* java.lang.Object(LinkedList(40, x1[8]))))

(11) -> (9), if ((java.lang.Object(LinkedList(43, x2[11])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[11] →^* x4[9])∧(x1[11] →^* java.lang.Object(LinkedList(41, x1[9]))))

(11) -> (10), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[10])∧(x3[11] →^* x3[10])∧(x1[11] →^* java.lang.Object(LinkedList(42, x1[10]))))

(11) -> (11), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[11]')∧(x3[11] →^* x3[11]')∧(x1[11] →^* java.lang.Object(LinkedList(43, x1[11]'))))

(11) -> (12), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[12])∧(x3[11] →^* x3[12])∧(x1[11] →^* java.lang.Object(LinkedList(44, x1[12]))))

(11) -> (13), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[13])∧(x3[11] →^* x3[13])∧(x1[11] →^* java.lang.Object(LinkedList(45, x1[13]))))

(11) -> (14), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[14])∧(x3[11] →^* x3[14])∧(x1[11] →^* java.lang.Object(LinkedList(46, x1[14]))))

(11) -> (15), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[15])∧(x3[11] →^* x3[15])∧(x1[11] →^* java.lang.Object(LinkedList(47, x1[15]))))

(11) -> (16), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[16])∧(x3[11] →^* x3[16])∧(x1[11] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(11) -> (19), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[19])∧(x3[11] →^* x3[19])∧(x1[11] →^* java.lang.Object(LinkedList(44, x1[19]))))

(11) -> (20), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[20])∧(x3[11] →^* x3[20])∧(x1[11] →^* java.lang.Object(LinkedList(46, x1[20]))))

(11) -> (21), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[21])∧(x3[11] →^* x3[21])∧(x1[11] →^* java.lang.Object(LinkedList(40, x1[21]))))

(11) -> (22), if ((java.lang.Object(LinkedList(43, x2[11])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[11] →^* x4[22])∧(x1[11] →^* java.lang.Object(LinkedList(41, x1[22]))))

(11) -> (23), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[23])∧(x3[11] →^* x3[23])∧(x1[11] →^* java.lang.Object(LinkedList(42, x1[23]))))

(11) -> (24), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[24])∧(x3[11] →^* x3[24])∧(x1[11] →^* java.lang.Object(LinkedList(43, x1[24]))))

(11) -> (25), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[25])∧(x3[11] →^* x3[25])∧(x1[11] →^* java.lang.Object(LinkedList(45, x1[25]))))

(11) -> (26), if ((java.lang.Object(LinkedList(43, x2[11])) →^* x2[26])∧(x3[11] →^* x3[26])∧(x1[11] →^* java.lang.Object(LinkedList(47, x1[26]))))

(12) -> (6), if ((x2[12] →^* x2[6])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[6])∧(x1[12] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(12) -> (8), if ((x2[12] →^* x2[8])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[8])∧(x1[12] →^* java.lang.Object(LinkedList(40, x1[8]))))

(12) -> (9), if ((x2[12] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(44, x3[12])) →^* x4[9])∧(x1[12] →^* java.lang.Object(LinkedList(41, x1[9]))))

(12) -> (10), if ((x2[12] →^* x2[10])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[10])∧(x1[12] →^* java.lang.Object(LinkedList(42, x1[10]))))

(12) -> (11), if ((x2[12] →^* x2[11])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[11])∧(x1[12] →^* java.lang.Object(LinkedList(43, x1[11]))))

(12) -> (12), if ((x2[12] →^* x2[12]')∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[12]')∧(x1[12] →^* java.lang.Object(LinkedList(44, x1[12]'))))

(12) -> (13), if ((x2[12] →^* x2[13])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[13])∧(x1[12] →^* java.lang.Object(LinkedList(45, x1[13]))))

(12) -> (14), if ((x2[12] →^* x2[14])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[14])∧(x1[12] →^* java.lang.Object(LinkedList(46, x1[14]))))

(12) -> (15), if ((x2[12] →^* x2[15])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[15])∧(x1[12] →^* java.lang.Object(LinkedList(47, x1[15]))))

(12) -> (16), if ((x2[12] →^* x2[16])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[16])∧(x1[12] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(12) -> (19), if ((x2[12] →^* x2[19])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[19])∧(x1[12] →^* java.lang.Object(LinkedList(44, x1[19]))))

(12) -> (20), if ((x2[12] →^* x2[20])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[20])∧(x1[12] →^* java.lang.Object(LinkedList(46, x1[20]))))

(12) -> (21), if ((x2[12] →^* x2[21])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[21])∧(x1[12] →^* java.lang.Object(LinkedList(40, x1[21]))))

(12) -> (22), if ((x2[12] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(44, x3[12])) →^* x4[22])∧(x1[12] →^* java.lang.Object(LinkedList(41, x1[22]))))

(12) -> (23), if ((x2[12] →^* x2[23])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[23])∧(x1[12] →^* java.lang.Object(LinkedList(42, x1[23]))))

(12) -> (24), if ((x2[12] →^* x2[24])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[24])∧(x1[12] →^* java.lang.Object(LinkedList(43, x1[24]))))

(12) -> (25), if ((x2[12] →^* x2[25])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[25])∧(x1[12] →^* java.lang.Object(LinkedList(45, x1[25]))))

(12) -> (26), if ((x2[12] →^* x2[26])∧(java.lang.Object(LinkedList(44, x3[12])) →^* x3[26])∧(x1[12] →^* java.lang.Object(LinkedList(47, x1[26]))))

(13) -> (6), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[6])∧(x3[13] →^* x3[6])∧(x1[13] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(13) -> (8), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[8])∧(x3[13] →^* x3[8])∧(x1[13] →^* java.lang.Object(LinkedList(40, x1[8]))))

(13) -> (9), if ((java.lang.Object(LinkedList(45, x2[13])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[13] →^* x4[9])∧(x1[13] →^* java.lang.Object(LinkedList(41, x1[9]))))

(13) -> (10), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[10])∧(x3[13] →^* x3[10])∧(x1[13] →^* java.lang.Object(LinkedList(42, x1[10]))))

(13) -> (11), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[11])∧(x3[13] →^* x3[11])∧(x1[13] →^* java.lang.Object(LinkedList(43, x1[11]))))

(13) -> (12), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[12])∧(x3[13] →^* x3[12])∧(x1[13] →^* java.lang.Object(LinkedList(44, x1[12]))))

(13) -> (13), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[13]')∧(x3[13] →^* x3[13]')∧(x1[13] →^* java.lang.Object(LinkedList(45, x1[13]'))))

(13) -> (14), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[14])∧(x3[13] →^* x3[14])∧(x1[13] →^* java.lang.Object(LinkedList(46, x1[14]))))

(13) -> (15), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[15])∧(x3[13] →^* x3[15])∧(x1[13] →^* java.lang.Object(LinkedList(47, x1[15]))))

(13) -> (16), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[16])∧(x3[13] →^* x3[16])∧(x1[13] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(13) -> (19), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[19])∧(x3[13] →^* x3[19])∧(x1[13] →^* java.lang.Object(LinkedList(44, x1[19]))))

(13) -> (20), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[20])∧(x3[13] →^* x3[20])∧(x1[13] →^* java.lang.Object(LinkedList(46, x1[20]))))

(13) -> (21), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[21])∧(x3[13] →^* x3[21])∧(x1[13] →^* java.lang.Object(LinkedList(40, x1[21]))))

(13) -> (22), if ((java.lang.Object(LinkedList(45, x2[13])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[13] →^* x4[22])∧(x1[13] →^* java.lang.Object(LinkedList(41, x1[22]))))

(13) -> (23), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[23])∧(x3[13] →^* x3[23])∧(x1[13] →^* java.lang.Object(LinkedList(42, x1[23]))))

(13) -> (24), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[24])∧(x3[13] →^* x3[24])∧(x1[13] →^* java.lang.Object(LinkedList(43, x1[24]))))

(13) -> (25), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[25])∧(x3[13] →^* x3[25])∧(x1[13] →^* java.lang.Object(LinkedList(45, x1[25]))))

(13) -> (26), if ((java.lang.Object(LinkedList(45, x2[13])) →^* x2[26])∧(x3[13] →^* x3[26])∧(x1[13] →^* java.lang.Object(LinkedList(47, x1[26]))))

(14) -> (6), if ((x2[14] →^* x2[6])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[6])∧(x1[14] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(14) -> (8), if ((x2[14] →^* x2[8])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[8])∧(x1[14] →^* java.lang.Object(LinkedList(40, x1[8]))))

(14) -> (9), if ((x2[14] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(46, x3[14])) →^* x4[9])∧(x1[14] →^* java.lang.Object(LinkedList(41, x1[9]))))

(14) -> (10), if ((x2[14] →^* x2[10])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[10])∧(x1[14] →^* java.lang.Object(LinkedList(42, x1[10]))))

(14) -> (11), if ((x2[14] →^* x2[11])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[11])∧(x1[14] →^* java.lang.Object(LinkedList(43, x1[11]))))

(14) -> (12), if ((x2[14] →^* x2[12])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[12])∧(x1[14] →^* java.lang.Object(LinkedList(44, x1[12]))))

(14) -> (13), if ((x2[14] →^* x2[13])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[13])∧(x1[14] →^* java.lang.Object(LinkedList(45, x1[13]))))

(14) -> (14), if ((x2[14] →^* x2[14]')∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[14]')∧(x1[14] →^* java.lang.Object(LinkedList(46, x1[14]'))))

(14) -> (15), if ((x2[14] →^* x2[15])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[15])∧(x1[14] →^* java.lang.Object(LinkedList(47, x1[15]))))

(14) -> (16), if ((x2[14] →^* x2[16])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[16])∧(x1[14] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(14) -> (19), if ((x2[14] →^* x2[19])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[19])∧(x1[14] →^* java.lang.Object(LinkedList(44, x1[19]))))

(14) -> (20), if ((x2[14] →^* x2[20])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[20])∧(x1[14] →^* java.lang.Object(LinkedList(46, x1[20]))))

(14) -> (21), if ((x2[14] →^* x2[21])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[21])∧(x1[14] →^* java.lang.Object(LinkedList(40, x1[21]))))

(14) -> (22), if ((x2[14] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(46, x3[14])) →^* x4[22])∧(x1[14] →^* java.lang.Object(LinkedList(41, x1[22]))))

(14) -> (23), if ((x2[14] →^* x2[23])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[23])∧(x1[14] →^* java.lang.Object(LinkedList(42, x1[23]))))

(14) -> (24), if ((x2[14] →^* x2[24])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[24])∧(x1[14] →^* java.lang.Object(LinkedList(43, x1[24]))))

(14) -> (25), if ((x2[14] →^* x2[25])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[25])∧(x1[14] →^* java.lang.Object(LinkedList(45, x1[25]))))

(14) -> (26), if ((x2[14] →^* x2[26])∧(java.lang.Object(LinkedList(46, x3[14])) →^* x3[26])∧(x1[14] →^* java.lang.Object(LinkedList(47, x1[26]))))

(15) -> (6), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[6])∧(x3[15] →^* x3[6])∧(x1[15] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(15) -> (8), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[8])∧(x3[15] →^* x3[8])∧(x1[15] →^* java.lang.Object(LinkedList(40, x1[8]))))

(15) -> (9), if ((java.lang.Object(LinkedList(47, x2[15])) →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(x3[15] →^* x4[9])∧(x1[15] →^* java.lang.Object(LinkedList(41, x1[9]))))

(15) -> (10), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[10])∧(x3[15] →^* x3[10])∧(x1[15] →^* java.lang.Object(LinkedList(42, x1[10]))))

(15) -> (11), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[11])∧(x3[15] →^* x3[11])∧(x1[15] →^* java.lang.Object(LinkedList(43, x1[11]))))

(15) -> (12), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[12])∧(x3[15] →^* x3[12])∧(x1[15] →^* java.lang.Object(LinkedList(44, x1[12]))))

(15) -> (13), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[13])∧(x3[15] →^* x3[13])∧(x1[15] →^* java.lang.Object(LinkedList(45, x1[13]))))

(15) -> (14), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[14])∧(x3[15] →^* x3[14])∧(x1[15] →^* java.lang.Object(LinkedList(46, x1[14]))))

(15) -> (15), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[15]')∧(x3[15] →^* x3[15]')∧(x1[15] →^* java.lang.Object(LinkedList(47, x1[15]'))))

(15) -> (16), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[16])∧(x3[15] →^* x3[16])∧(x1[15] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(15) -> (19), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[19])∧(x3[15] →^* x3[19])∧(x1[15] →^* java.lang.Object(LinkedList(44, x1[19]))))

(15) -> (20), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[20])∧(x3[15] →^* x3[20])∧(x1[15] →^* java.lang.Object(LinkedList(46, x1[20]))))

(15) -> (21), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[21])∧(x3[15] →^* x3[21])∧(x1[15] →^* java.lang.Object(LinkedList(40, x1[21]))))

(15) -> (22), if ((java.lang.Object(LinkedList(47, x2[15])) →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(x3[15] →^* x4[22])∧(x1[15] →^* java.lang.Object(LinkedList(41, x1[22]))))

(15) -> (23), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[23])∧(x3[15] →^* x3[23])∧(x1[15] →^* java.lang.Object(LinkedList(42, x1[23]))))

(15) -> (24), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[24])∧(x3[15] →^* x3[24])∧(x1[15] →^* java.lang.Object(LinkedList(43, x1[24]))))

(15) -> (25), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[25])∧(x3[15] →^* x3[25])∧(x1[15] →^* java.lang.Object(LinkedList(45, x1[25]))))

(15) -> (26), if ((java.lang.Object(LinkedList(47, x2[15])) →^* x2[26])∧(x3[15] →^* x3[26])∧(x1[15] →^* java.lang.Object(LinkedList(47, x1[26]))))

(16) -> (7), if ((x0[16] > 47 →^* TRUE)∧(x2[16] →^* x2[7])∧(x3[16] →^* x3[7])∧(java.lang.Object(LinkedList(x0[16], x1[16])) →^* java.lang.Object(LinkedList(x0[7], x1[7]))))

(17) -> (6), if ((x2[17] →^* x2[6])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[6])∧(x1[17] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(17) -> (8), if ((x2[17] →^* x2[8])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[8])∧(x1[17] →^* java.lang.Object(LinkedList(40, x1[8]))))

(17) -> (9), if ((x2[17] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(44, x3[17])) →^* x4[9])∧(x1[17] →^* java.lang.Object(LinkedList(41, x1[9]))))

(17) -> (10), if ((x2[17] →^* x2[10])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[10])∧(x1[17] →^* java.lang.Object(LinkedList(42, x1[10]))))

(17) -> (11), if ((x2[17] →^* x2[11])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[11])∧(x1[17] →^* java.lang.Object(LinkedList(43, x1[11]))))

(17) -> (12), if ((x2[17] →^* x2[12])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[12])∧(x1[17] →^* java.lang.Object(LinkedList(44, x1[12]))))

(17) -> (13), if ((x2[17] →^* x2[13])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[13])∧(x1[17] →^* java.lang.Object(LinkedList(45, x1[13]))))

(17) -> (14), if ((x2[17] →^* x2[14])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[14])∧(x1[17] →^* java.lang.Object(LinkedList(46, x1[14]))))

(17) -> (15), if ((x2[17] →^* x2[15])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[15])∧(x1[17] →^* java.lang.Object(LinkedList(47, x1[15]))))

(17) -> (16), if ((x2[17] →^* x2[16])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[16])∧(x1[17] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(17) -> (19), if ((x2[17] →^* x2[19])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[19])∧(x1[17] →^* java.lang.Object(LinkedList(44, x1[19]))))

(17) -> (20), if ((x2[17] →^* x2[20])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[20])∧(x1[17] →^* java.lang.Object(LinkedList(46, x1[20]))))

(17) -> (21), if ((x2[17] →^* x2[21])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[21])∧(x1[17] →^* java.lang.Object(LinkedList(40, x1[21]))))

(17) -> (22), if ((x2[17] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(44, x3[17])) →^* x4[22])∧(x1[17] →^* java.lang.Object(LinkedList(41, x1[22]))))

(17) -> (23), if ((x2[17] →^* x2[23])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[23])∧(x1[17] →^* java.lang.Object(LinkedList(42, x1[23]))))

(17) -> (24), if ((x2[17] →^* x2[24])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[24])∧(x1[17] →^* java.lang.Object(LinkedList(43, x1[24]))))

(17) -> (25), if ((x2[17] →^* x2[25])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[25])∧(x1[17] →^* java.lang.Object(LinkedList(45, x1[25]))))

(17) -> (26), if ((x2[17] →^* x2[26])∧(java.lang.Object(LinkedList(44, x3[17])) →^* x3[26])∧(x1[17] →^* java.lang.Object(LinkedList(47, x1[26]))))

(18) -> (6), if ((x2[18] →^* x2[6])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[6])∧(x1[18] →^* java.lang.Object(LinkedList(x0[6], x1[6]))))

(18) -> (8), if ((x2[18] →^* x2[8])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[8])∧(x1[18] →^* java.lang.Object(LinkedList(40, x1[8]))))

(18) -> (9), if ((x2[18] →^* java.lang.Object(LinkedList(x2[9], x3[9])))∧(java.lang.Object(LinkedList(46, x3[18])) →^* x4[9])∧(x1[18] →^* java.lang.Object(LinkedList(41, x1[9]))))

(18) -> (10), if ((x2[18] →^* x2[10])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[10])∧(x1[18] →^* java.lang.Object(LinkedList(42, x1[10]))))

(18) -> (11), if ((x2[18] →^* x2[11])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[11])∧(x1[18] →^* java.lang.Object(LinkedList(43, x1[11]))))

(18) -> (12), if ((x2[18] →^* x2[12])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[12])∧(x1[18] →^* java.lang.Object(LinkedList(44, x1[12]))))

(18) -> (13), if ((x2[18] →^* x2[13])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[13])∧(x1[18] →^* java.lang.Object(LinkedList(45, x1[13]))))

(18) -> (14), if ((x2[18] →^* x2[14])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[14])∧(x1[18] →^* java.lang.Object(LinkedList(46, x1[14]))))

(18) -> (15), if ((x2[18] →^* x2[15])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[15])∧(x1[18] →^* java.lang.Object(LinkedList(47, x1[15]))))

(18) -> (16), if ((x2[18] →^* x2[16])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[16])∧(x1[18] →^* java.lang.Object(LinkedList(x0[16], x1[16]))))

(18) -> (19), if ((x2[18] →^* x2[19])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[19])∧(x1[18] →^* java.lang.Object(LinkedList(44, x1[19]))))

(18) -> (20), if ((x2[18] →^* x2[20])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[20])∧(x1[18] →^* java.lang.Object(LinkedList(46, x1[20]))))

(18) -> (21), if ((x2[18] →^* x2[21])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[21])∧(x1[18] →^* java.lang.Object(LinkedList(40, x1[21]))))

(18) -> (22), if ((x2[18] →^* java.lang.Object(LinkedList(x2[22], x3[22])))∧(java.lang.Object(LinkedList(46, x3[18])) →^* x4[22])∧(x1[18] →^* java.lang.Object(LinkedList(41, x1[22]))))

(18) -> (23), if ((x2[18] →^* x2[23])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[23])∧(x1[18] →^* java.lang.Object(LinkedList(42, x1[23]))))

(18) -> (24), if ((x2[18] →^* x2[24])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[24])∧(x1[18] →^* java.lang.Object(LinkedList(43, x1[24]))))

(18) -> (25), if ((x2[18] →^* x2[25])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[25])∧(x1[18] →^* java.lang.Object(LinkedList(45, x1[25]))))

(18) -> (26), if ((x2[18] →^* x2[26])∧(java.lang.Object(LinkedList(46, x3[18])) →^* x3[26])∧(x1[18] →^* java.lang.Object(LinkedList(47, x1[26]))))

(19) -> (17), if ((java.lang.Object(LinkedList(44, x1[19])) →^* java.lang.Object(LinkedList(44, x1[17])))∧(x2[19] →^* x2[17])∧(x3[19] →^* x3[17]))

(20) -> (18), if ((java.lang.Object(LinkedList(46, x1[20])) →^* java.lang.Object(LinkedList(46, x1[18])))∧(x2[20] →^* x2[18])∧(x3[20] →^* x3[18]))

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

(22) -> (1), if ((x3[22] →^* x0[1])∧(java.lang.Object(LinkedList(x2[22], x4[22])) →^* java.lang.Object(LinkedList(x1[1], x2[1])))∧(x1[22] →^* x3[1]))

(23) -> (2), if ((java.lang.Object(LinkedList(42, x2[23])) →^* java.lang.Object(LinkedList(42, x1[2])))∧(x3[23] →^* x2[2])∧(x1[23] →^* x3[2]))

(24) -> (3), if ((java.lang.Object(LinkedList(43, x2[24])) →^* java.lang.Object(LinkedList(43, x1[3])))∧(x3[24] →^* x2[3])∧(x1[24] →^* x3[3]))

(25) -> (4), if ((java.lang.Object(LinkedList(45, x2[25])) →^* java.lang.Object(LinkedList(45, x1[4])))∧(x3[25] →^* x2[4])∧(x1[25] →^* x3[4]))

(26) -> (5), if ((java.lang.Object(LinkedList(47, x2[26])) →^* java.lang.Object(LinkedList(47, x1[5])))∧(x3[26] →^* x2[5])∧(x1[26] →^* x3[5]))

The set Q consists of the following terms:
6432_0_toPostfix_NULL(x0, x1, NULL)
8520_0_toPostfix_NULL(NULL)
8520_0_toPostfix_NULL(java.lang.Object(LinkedList(x0, x1)))

(15) IDPNonInfProof (SOUND transformation)

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 7120_0_TOPOSTFIX_STORE(x0, x1, x2) → 6432_0_TOPOSTFIX_NULL(x0, x1, x2) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(1)    (x0[0]=x2[6]∧x1[0]=x3[6]∧x2[0]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (1) using rules (III), (IV) which results in the following new constraint:
(2)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(6)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(7)    (x0[0]=x2[8]∧x1[0]=x3[8]∧x2[0]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (7) using rules (III), (IV) which results in the following new constraint:
(8)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(13)    (x0[0]=java.lang.Object(LinkedList(x2[9], x3[9]))∧x1[0]=x4[9]∧x2[0]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (13) using rules (III), (IV) which results in the following new constraint:
(14)    (7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x1[0], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (14) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(15)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (15) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(16)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (16) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(17)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (17) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(18)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(19)    (x0[0]=x2[10]∧x1[0]=x3[10]∧x2[0]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (19) using rules (III), (IV) which results in the following new constraint:
(20)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (20) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(21)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (21) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(22)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (22) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(23)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (23) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(24)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(25)    (x0[0]=x2[11]∧x1[0]=x3[11]∧x2[0]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (25) using rules (III), (IV) which results in the following new constraint:
(26)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (26) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(28)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (28) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(29)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (29) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(30)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(31)    (x0[0]=x2[12]∧x1[0]=x3[12]∧x2[0]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (31) using rules (III), (IV) which results in the following new constraint:
(32)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (32) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(33)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (33) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(35)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (35) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(36)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(37)    (x0[0]=x2[13]∧x1[0]=x3[13]∧x2[0]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (37) using rules (III), (IV) which results in the following new constraint:
(38)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (38) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(39)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (39) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(40)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (40) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(41)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (41) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(42)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(43)    (x0[0]=x2[14]∧x1[0]=x3[14]∧x2[0]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (43) using rules (III), (IV) which results in the following new constraint:
(44)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (44) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(45)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (45) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(46)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (46) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(47)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (47) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(48)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(49)    (x0[0]=x2[15]∧x1[0]=x3[15]∧x2[0]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (49) using rules (III), (IV) which results in the following new constraint:
(50)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (50) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(51)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (51) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(52)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (52) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(53)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (53) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(54)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(55)    (x0[0]=x2[16]∧x1[0]=x3[16]∧x2[0]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (55) using rules (III), (IV) which results in the following new constraint:
(56)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (56) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(57)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (57) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(58)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (58) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(59)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (59) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(60)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(61)    (x0[0]=x2[19]∧x1[0]=x3[19]∧x2[0]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (61) using rules (III), (IV) which results in the following new constraint:
(62)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (62) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(63)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (63) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(64)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (64) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(65)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (65) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(66)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(67)    (x0[0]=x2[20]∧x1[0]=x3[20]∧x2[0]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (67) using rules (III), (IV) which results in the following new constraint:
(68)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (68) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(69)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (69) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(70)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (70) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(71)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (71) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(72)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(73)    (x0[0]=x2[21]∧x1[0]=x3[21]∧x2[0]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (73) using rules (III), (IV) which results in the following new constraint:
(74)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (74) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(75)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (75) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(76)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (76) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(77)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (77) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(78)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(79)    (x0[0]=java.lang.Object(LinkedList(x2[22], x3[22]))∧x1[0]=x4[22]∧x2[0]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (79) using rules (III), (IV) which results in the following new constraint:
(80)    (7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x1[0], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (80) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(81)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (81) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(82)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (82) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(83)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (83) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(84)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(85)    (x0[0]=x2[23]∧x1[0]=x3[23]∧x2[0]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (85) using rules (III), (IV) which results in the following new constraint:
(86)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (86) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(87)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (87) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(88)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (88) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(89)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (89) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(90)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(91)    (x0[0]=x2[24]∧x1[0]=x3[24]∧x2[0]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (91) using rules (III), (IV) which results in the following new constraint:
(92)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (92) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(93)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (93) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(94)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (94) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(95)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (95) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(96)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(97)    (x0[0]=x2[25]∧x1[0]=x3[25]∧x2[0]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (97) using rules (III), (IV) which results in the following new constraint:
(98)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (98) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(99)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (99) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(100)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (100) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(101)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (101) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(102)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)
We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(103)    (x0[0]=x2[26]∧x1[0]=x3[26]∧x2[0]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0])≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (103) using rules (III), (IV) which results in the following new constraint:
(104)    (7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧7120_0_TOPOSTFIX_STORE(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥))

We simplified constraint (104) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(105)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (105) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(106)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (106) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(107)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧[2 + (-1)bso_56] ≥ 0)

We simplified constraint (107) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(108)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_56] ≥ 0)

For Pair 8934_0_TOPOSTFIX_STORE(x0, java.lang.Object(LinkedList(x1, x2)), x3) → 6432_0_TOPOSTFIX_NULL(x0, java.lang.Object(LinkedList(x1, x2)), x3) the following chains were created:

We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(109)    (x0[1]=x2[6]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[6]∧x3[1]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (109) using rules (III), (IV) which results in the following new constraint:
(110)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (110) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(111)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (111) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(112)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (112) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(113)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (113) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(114)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(115)    (x0[1]=x2[8]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[8]∧x3[1]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (115) using rules (III), (IV) which results in the following new constraint:
(116)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (116) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(117)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (117) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(118)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (118) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(119)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (119) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(120)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(121)    (x0[1]=java.lang.Object(LinkedList(x2[9], x3[9]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[9]∧x3[1]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (121) using rules (III), (IV) which results in the following new constraint:
(122)    (8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (122) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(123)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (123) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(124)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (124) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(125)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (125) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(126)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(127)    (x0[1]=x2[10]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[10]∧x3[1]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (127) using rules (III), (IV) which results in the following new constraint:
(128)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (128) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(129)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (129) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(130)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (130) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(131)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (131) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(132)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(133)    (x0[1]=x2[11]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[11]∧x3[1]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (133) using rules (III), (IV) which results in the following new constraint:
(134)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (134) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(135)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (135) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(136)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (136) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(137)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (137) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(138)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(139)    (x0[1]=x2[12]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[12]∧x3[1]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (139) using rules (III), (IV) which results in the following new constraint:
(140)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (140) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(141)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (141) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(142)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (142) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(143)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (143) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(144)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(145)    (x0[1]=x2[13]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[13]∧x3[1]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (145) using rules (III), (IV) which results in the following new constraint:
(146)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (146) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(147)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (147) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(148)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (148) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(149)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (149) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(150)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(151)    (x0[1]=x2[14]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[14]∧x3[1]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (151) using rules (III), (IV) which results in the following new constraint:
(152)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (152) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(153)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (153) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(154)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (154) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(155)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (155) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(156)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(157)    (x0[1]=x2[15]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[15]∧x3[1]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (157) using rules (III), (IV) which results in the following new constraint:
(158)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (158) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(159)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (159) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(160)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (160) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(161)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (161) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(162)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(163)    (x0[1]=x2[16]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[16]∧x3[1]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (163) using rules (III), (IV) which results in the following new constraint:
(164)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (164) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(165)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (165) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(166)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (166) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(167)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (167) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(168)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(169)    (x0[1]=x2[19]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[19]∧x3[1]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (169) using rules (III), (IV) which results in the following new constraint:
(170)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (170) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(171)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (171) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(172)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (172) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(173)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (173) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(174)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(175)    (x0[1]=x2[20]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[20]∧x3[1]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (175) using rules (III), (IV) which results in the following new constraint:
(176)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (176) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(177)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (177) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(178)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (178) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(179)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (179) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(180)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(181)    (x0[1]=x2[21]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[21]∧x3[1]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (181) using rules (III), (IV) which results in the following new constraint:
(182)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (182) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(183)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (183) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(184)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (184) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(185)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (185) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(186)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(187)    (x0[1]=java.lang.Object(LinkedList(x2[22], x3[22]))∧java.lang.Object(LinkedList(x1[1], x2[1]))=x4[22]∧x3[1]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (187) using rules (III), (IV) which results in the following new constraint:
(188)    (8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (188) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(189)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (189) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(190)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (190) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(191)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (191) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(192)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(193)    (x0[1]=x2[23]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[23]∧x3[1]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (193) using rules (III), (IV) which results in the following new constraint:
(194)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (194) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(195)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (195) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(196)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (196) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(197)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (197) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(198)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(199)    (x0[1]=x2[24]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[24]∧x3[1]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (199) using rules (III), (IV) which results in the following new constraint:
(200)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (200) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(201)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (201) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(202)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (202) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(203)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (203) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(204)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(205)    (x0[1]=x2[25]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[25]∧x3[1]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (205) using rules (III), (IV) which results in the following new constraint:
(206)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (206) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(207)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (207) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(208)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (208) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(209)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (209) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(210)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(211)    (x0[1]=x2[26]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[26]∧x3[1]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (211) using rules (III), (IV) which results in the following new constraint:
(212)    (8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥))

We simplified constraint (212) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(213)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (213) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(214)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (214) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(215)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧[(-1)bso_58] ≥ 0)

We simplified constraint (215) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(216)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

For Pair 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1)), x2, x3) the following chains were created:

We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(217)    (java.lang.Object(LinkedList(42, x1[2]))=x2[6]∧x2[2]=x3[6]∧x3[2]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (217) using rules (III), (IV) which results in the following new constraint:
(218)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (218) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(219)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (219) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(220)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (220) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(221)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (221) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(222)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(223)    (java.lang.Object(LinkedList(42, x1[2]))=x2[8]∧x2[2]=x3[8]∧x3[2]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (223) using rules (III), (IV) which results in the following new constraint:
(224)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (224) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(225)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (225) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(226)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (226) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(227)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[8] ≥ 0)

We simplified constraint (227) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(228)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(229)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[2]=x4[9]∧x3[2]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (229) using rules (I), (II), (III), (IV) which results in the following new constraint:
(230)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (230) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(231)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (231) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(232)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (232) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(233)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[9] ≥ 0)

We simplified constraint (233) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(234)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(235)    (java.lang.Object(LinkedList(42, x1[2]))=x2[10]∧x2[2]=x3[10]∧x3[2]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (235) using rules (III), (IV) which results in the following new constraint:
(236)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (236) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(237)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (237) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(238)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (238) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(239)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[10] ≥ 0)

We simplified constraint (239) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(240)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(241)    (java.lang.Object(LinkedList(42, x1[2]))=x2[11]∧x2[2]=x3[11]∧x3[2]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (241) using rules (III), (IV) which results in the following new constraint:
(242)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (242) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(243)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (243) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(244)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (244) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(245)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[11] ≥ 0)

We simplified constraint (245) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(246)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(247)    (java.lang.Object(LinkedList(42, x1[2]))=x2[12]∧x2[2]=x3[12]∧x3[2]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (247) using rules (III), (IV) which results in the following new constraint:
(248)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (248) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(249)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (249) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(250)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (250) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(251)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[12] ≥ 0)

We simplified constraint (251) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(252)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(253)    (java.lang.Object(LinkedList(42, x1[2]))=x2[13]∧x2[2]=x3[13]∧x3[2]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (253) using rules (III), (IV) which results in the following new constraint:
(254)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (254) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(255)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (255) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(256)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (256) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(257)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[13] ≥ 0)

We simplified constraint (257) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(258)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(259)    (java.lang.Object(LinkedList(42, x1[2]))=x2[14]∧x2[2]=x3[14]∧x3[2]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (259) using rules (III), (IV) which results in the following new constraint:
(260)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (260) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(261)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (261) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(262)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (262) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(263)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[14] ≥ 0)

We simplified constraint (263) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(264)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(265)    (java.lang.Object(LinkedList(42, x1[2]))=x2[15]∧x2[2]=x3[15]∧x3[2]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (265) using rules (III), (IV) which results in the following new constraint:
(266)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (266) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(267)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (267) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(268)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (268) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(269)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[15] ≥ 0)

We simplified constraint (269) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(270)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(271)    (java.lang.Object(LinkedList(42, x1[2]))=x2[16]∧x2[2]=x3[16]∧x3[2]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (271) using rules (III), (IV) which results in the following new constraint:
(272)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (272) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(273)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (273) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(274)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (274) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(275)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[3 + (-1)bso_60] + [4]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (275) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(276)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[3 + (-1)bso_60] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(277)    (java.lang.Object(LinkedList(42, x1[2]))=x2[19]∧x2[2]=x3[19]∧x3[2]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (277) using rules (III), (IV) which results in the following new constraint:
(278)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (278) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(279)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (279) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(280)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (280) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(281)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[267 + (-1)bso_60] + [4]x1[19] ≥ 0)

We simplified constraint (281) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(282)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[267 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(283)    (java.lang.Object(LinkedList(42, x1[2]))=x2[20]∧x2[2]=x3[20]∧x3[2]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (283) using rules (III), (IV) which results in the following new constraint:
(284)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (284) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(285)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (285) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(286)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (286) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(287)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[279 + (-1)bso_60] + [4]x1[20] ≥ 0)

We simplified constraint (287) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(288)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[279 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(289)    (java.lang.Object(LinkedList(42, x1[2]))=x2[21]∧x2[2]=x3[21]∧x3[2]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (289) using rules (III), (IV) which results in the following new constraint:
(290)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (290) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(291)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (291) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(292)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (292) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(293)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[243 + (-1)bso_60] + [4]x1[21] ≥ 0)

We simplified constraint (293) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(294)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[243 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(295)    (java.lang.Object(LinkedList(42, x1[2]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[2]=x4[22]∧x3[2]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (295) using rules (I), (II), (III), (IV) which results in the following new constraint:
(296)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (296) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(297)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (297) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(298)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (298) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(299)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[249 + (-1)bso_60] + [4]x1[22] ≥ 0)

We simplified constraint (299) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(300)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[249 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(301)    (java.lang.Object(LinkedList(42, x1[2]))=x2[23]∧x2[2]=x3[23]∧x3[2]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (301) using rules (III), (IV) which results in the following new constraint:
(302)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (302) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(303)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (303) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(304)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (304) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(305)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[255 + (-1)bso_60] + [4]x1[23] ≥ 0)

We simplified constraint (305) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(306)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[255 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(307)    (java.lang.Object(LinkedList(42, x1[2]))=x2[24]∧x2[2]=x3[24]∧x3[2]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (307) using rules (III), (IV) which results in the following new constraint:
(308)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (308) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(309)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (309) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(310)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (310) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(311)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[261 + (-1)bso_60] + [4]x1[24] ≥ 0)

We simplified constraint (311) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(312)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[261 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(313)    (java.lang.Object(LinkedList(42, x1[2]))=x2[25]∧x2[2]=x3[25]∧x3[2]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (313) using rules (III), (IV) which results in the following new constraint:
(314)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (314) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(315)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (315) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(316)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (316) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(317)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[273 + (-1)bso_60] + [4]x1[25] ≥ 0)

We simplified constraint (317) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(318)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[273 + (-1)bso_60] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(319)    (java.lang.Object(LinkedList(42, x1[2]))=x2[26]∧x2[2]=x3[26]∧x3[2]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (319) using rules (III), (IV) which results in the following new constraint:
(320)    (8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥))

We simplified constraint (320) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(321)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (321) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(322)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (322) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(323)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧[285 + (-1)bso_60] + [4]x1[26] ≥ 0)

We simplified constraint (323) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(324)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2])), ≥)∧0 ≥ 0∧0 ≥ 0∧[285 + (-1)bso_60] ≥ 0∧[1] ≥ 0)

For Pair 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1)), x2, x3) the following chains were created:

We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(325)    (java.lang.Object(LinkedList(43, x1[3]))=x2[6]∧x2[3]=x3[6]∧x3[3]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (325) using rules (III), (IV) which results in the following new constraint:
(326)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (326) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(327)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (327) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(328)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (328) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(329)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (329) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(330)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(331)    (java.lang.Object(LinkedList(43, x1[3]))=x2[8]∧x2[3]=x3[8]∧x3[3]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (331) using rules (III), (IV) which results in the following new constraint:
(332)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (332) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(333)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (333) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(334)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (334) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(335)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (335) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(336)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(337)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[3]=x4[9]∧x3[3]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (337) using rules (I), (II), (III), (IV) which results in the following new constraint:
(338)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (338) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(339)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (339) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(340)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (340) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(341)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (341) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(342)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(343)    (java.lang.Object(LinkedList(43, x1[3]))=x2[10]∧x2[3]=x3[10]∧x3[3]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (343) using rules (III), (IV) which results in the following new constraint:
(344)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (344) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(345)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (345) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(346)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (346) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(347)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (347) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(348)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(349)    (java.lang.Object(LinkedList(43, x1[3]))=x2[11]∧x2[3]=x3[11]∧x3[3]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (349) using rules (III), (IV) which results in the following new constraint:
(350)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (350) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(351)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (351) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(352)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (352) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(353)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (353) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(354)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(355)    (java.lang.Object(LinkedList(43, x1[3]))=x2[12]∧x2[3]=x3[12]∧x3[3]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (355) using rules (III), (IV) which results in the following new constraint:
(356)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (356) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(357)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (357) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(358)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (358) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(359)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (359) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(360)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(361)    (java.lang.Object(LinkedList(43, x1[3]))=x2[13]∧x2[3]=x3[13]∧x3[3]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (361) using rules (III), (IV) which results in the following new constraint:
(362)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (362) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(363)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (363) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(364)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (364) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(365)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (365) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(366)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(367)    (java.lang.Object(LinkedList(43, x1[3]))=x2[14]∧x2[3]=x3[14]∧x3[3]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (367) using rules (III), (IV) which results in the following new constraint:
(368)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (368) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(369)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (369) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(370)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (370) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(371)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (371) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(372)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(373)    (java.lang.Object(LinkedList(43, x1[3]))=x2[15]∧x2[3]=x3[15]∧x3[3]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (373) using rules (III), (IV) which results in the following new constraint:
(374)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (374) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(375)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (375) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(376)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (376) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(377)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (377) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(378)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(379)    (java.lang.Object(LinkedList(43, x1[3]))=x2[16]∧x2[3]=x3[16]∧x3[3]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (379) using rules (III), (IV) which results in the following new constraint:
(380)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (380) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(381)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (381) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(382)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (382) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(383)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (383) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(384)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(385)    (java.lang.Object(LinkedList(43, x1[3]))=x2[19]∧x2[3]=x3[19]∧x3[3]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (385) using rules (III), (IV) which results in the following new constraint:
(386)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (386) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(387)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (387) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(388)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (388) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(389)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (389) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(390)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(391)    (java.lang.Object(LinkedList(43, x1[3]))=x2[20]∧x2[3]=x3[20]∧x3[3]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (391) using rules (III), (IV) which results in the following new constraint:
(392)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (392) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(393)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (393) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(394)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (394) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(395)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (395) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(396)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(397)    (java.lang.Object(LinkedList(43, x1[3]))=x2[21]∧x2[3]=x3[21]∧x3[3]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (397) using rules (III), (IV) which results in the following new constraint:
(398)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (398) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(399)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (399) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(400)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (400) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(401)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (401) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(402)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(403)    (java.lang.Object(LinkedList(43, x1[3]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[3]=x4[22]∧x3[3]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (403) using rules (I), (II), (III), (IV) which results in the following new constraint:
(404)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (404) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(405)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (405) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(406)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (406) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(407)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (407) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(408)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(409)    (java.lang.Object(LinkedList(43, x1[3]))=x2[23]∧x2[3]=x3[23]∧x3[3]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (409) using rules (III), (IV) which results in the following new constraint:
(410)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (410) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(411)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (411) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(412)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (412) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(413)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (413) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(414)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(415)    (java.lang.Object(LinkedList(43, x1[3]))=x2[24]∧x2[3]=x3[24]∧x3[3]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (415) using rules (III), (IV) which results in the following new constraint:
(416)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (416) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(417)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (417) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(418)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (418) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(419)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (419) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(420)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(421)    (java.lang.Object(LinkedList(43, x1[3]))=x2[25]∧x2[3]=x3[25]∧x3[3]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (421) using rules (III), (IV) which results in the following new constraint:
(422)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (422) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(423)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (423) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(424)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (424) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(425)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (425) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(426)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(427)    (java.lang.Object(LinkedList(43, x1[3]))=x2[26]∧x2[3]=x3[26]∧x3[3]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (427) using rules (III), (IV) which results in the following new constraint:
(428)    (8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥))

We simplified constraint (428) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(429)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (429) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(430)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (430) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(431)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧[2 + (-1)bso_62] ≥ 0)

We simplified constraint (431) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(432)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_62] ≥ 0)

For Pair 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1)), x2, x3) the following chains were created:

We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(433)    (java.lang.Object(LinkedList(45, x1[4]))=x2[6]∧x2[4]=x3[6]∧x3[4]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (433) using rules (III), (IV) which results in the following new constraint:
(434)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (434) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(435)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (435) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(436)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (436) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(437)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (437) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(438)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(439)    (java.lang.Object(LinkedList(45, x1[4]))=x2[8]∧x2[4]=x3[8]∧x3[4]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (439) using rules (III), (IV) which results in the following new constraint:
(440)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (440) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(441)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (441) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(442)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (442) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(443)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (443) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(444)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(445)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[4]=x4[9]∧x3[4]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (445) using rules (I), (II), (III), (IV) which results in the following new constraint:
(446)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (446) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(447)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (447) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(448)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (448) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(449)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (449) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(450)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(451)    (java.lang.Object(LinkedList(45, x1[4]))=x2[10]∧x2[4]=x3[10]∧x3[4]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (451) using rules (III), (IV) which results in the following new constraint:
(452)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (452) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(453)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (453) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(454)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (454) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(455)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (455) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(456)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(457)    (java.lang.Object(LinkedList(45, x1[4]))=x2[11]∧x2[4]=x3[11]∧x3[4]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (457) using rules (III), (IV) which results in the following new constraint:
(458)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (458) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(459)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (459) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(460)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (460) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(461)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (461) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(462)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(463)    (java.lang.Object(LinkedList(45, x1[4]))=x2[12]∧x2[4]=x3[12]∧x3[4]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (463) using rules (III), (IV) which results in the following new constraint:
(464)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (464) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(465)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (465) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(466)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (466) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(467)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (467) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(468)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(469)    (java.lang.Object(LinkedList(45, x1[4]))=x2[13]∧x2[4]=x3[13]∧x3[4]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (469) using rules (III), (IV) which results in the following new constraint:
(470)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (470) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(471)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (471) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(472)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (472) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(473)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (473) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(474)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(475)    (java.lang.Object(LinkedList(45, x1[4]))=x2[14]∧x2[4]=x3[14]∧x3[4]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (475) using rules (III), (IV) which results in the following new constraint:
(476)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (476) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(477)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (477) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(478)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (478) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(479)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (479) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(480)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(481)    (java.lang.Object(LinkedList(45, x1[4]))=x2[15]∧x2[4]=x3[15]∧x3[4]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (481) using rules (III), (IV) which results in the following new constraint:
(482)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (482) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(483)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (483) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(484)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (484) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(485)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (485) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(486)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(487)    (java.lang.Object(LinkedList(45, x1[4]))=x2[16]∧x2[4]=x3[16]∧x3[4]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (487) using rules (III), (IV) which results in the following new constraint:
(488)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (488) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(489)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (489) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(490)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (490) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(491)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (491) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(492)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(493)    (java.lang.Object(LinkedList(45, x1[4]))=x2[19]∧x2[4]=x3[19]∧x3[4]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (493) using rules (III), (IV) which results in the following new constraint:
(494)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (494) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(495)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (495) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(496)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (496) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(497)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (497) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(498)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(499)    (java.lang.Object(LinkedList(45, x1[4]))=x2[20]∧x2[4]=x3[20]∧x3[4]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (499) using rules (III), (IV) which results in the following new constraint:
(500)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (500) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(501)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (501) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(502)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (502) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(503)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (503) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(504)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(505)    (java.lang.Object(LinkedList(45, x1[4]))=x2[21]∧x2[4]=x3[21]∧x3[4]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (505) using rules (III), (IV) which results in the following new constraint:
(506)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (506) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(507)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (507) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(508)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (508) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(509)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (509) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(510)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(511)    (java.lang.Object(LinkedList(45, x1[4]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[4]=x4[22]∧x3[4]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (511) using rules (I), (II), (III), (IV) which results in the following new constraint:
(512)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (512) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(513)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (513) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(514)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (514) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(515)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (515) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(516)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(517)    (java.lang.Object(LinkedList(45, x1[4]))=x2[23]∧x2[4]=x3[23]∧x3[4]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (517) using rules (III), (IV) which results in the following new constraint:
(518)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (518) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(519)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (519) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(520)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (520) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(521)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (521) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(522)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(523)    (java.lang.Object(LinkedList(45, x1[4]))=x2[24]∧x2[4]=x3[24]∧x3[4]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (523) using rules (III), (IV) which results in the following new constraint:
(524)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (524) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(525)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (525) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(526)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (526) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(527)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (527) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(528)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(529)    (java.lang.Object(LinkedList(45, x1[4]))=x2[25]∧x2[4]=x3[25]∧x3[4]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (529) using rules (III), (IV) which results in the following new constraint:
(530)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (530) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(531)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (531) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(532)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (532) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(533)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (533) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(534)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(535)    (java.lang.Object(LinkedList(45, x1[4]))=x2[26]∧x2[4]=x3[26]∧x3[4]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (535) using rules (III), (IV) which results in the following new constraint:
(536)    (8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥))

We simplified constraint (536) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(537)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (537) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(538)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (538) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(539)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧[(-1)bso_64] ≥ 0)

We simplified constraint (539) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(540)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_64] ≥ 0)

For Pair 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1)), x2, x3) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1)), x2, x3) the following chains were created:

We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) which results in the following constraint:
(541)    (java.lang.Object(LinkedList(47, x1[5]))=x2[6]∧x2[5]=x3[6]∧x3[5]=java.lang.Object(LinkedList(x0[6], x1[6])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (541) using rules (III), (IV) which results in the following new constraint:
(542)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (542) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(543)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (543) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(544)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (544) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(545)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (545) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(546)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(547)    (java.lang.Object(LinkedList(47, x1[5]))=x2[8]∧x2[5]=x3[8]∧x3[5]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (547) using rules (III), (IV) which results in the following new constraint:
(548)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (548) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(549)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (549) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(550)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (550) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(551)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (551) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(552)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]) which results in the following constraint:
(553)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[9], x3[9]))∧x2[5]=x4[9]∧x3[5]=java.lang.Object(LinkedList(41, x1[9])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (553) using rules (I), (II), (III), (IV) which results in the following new constraint:
(554)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[9])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (554) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(555)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (555) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(556)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (556) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(557)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (557) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(558)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]) which results in the following constraint:
(559)    (java.lang.Object(LinkedList(47, x1[5]))=x2[10]∧x2[5]=x3[10]∧x3[5]=java.lang.Object(LinkedList(42, x1[10])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (559) using rules (III), (IV) which results in the following new constraint:
(560)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[10])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (560) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(561)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (561) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(562)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (562) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(563)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (563) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(564)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]) which results in the following constraint:
(565)    (java.lang.Object(LinkedList(47, x1[5]))=x2[11]∧x2[5]=x3[11]∧x3[5]=java.lang.Object(LinkedList(43, x1[11])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (565) using rules (III), (IV) which results in the following new constraint:
(566)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[11])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (566) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(567)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (567) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(568)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (568) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(569)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (569) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(570)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]) which results in the following constraint:
(571)    (java.lang.Object(LinkedList(47, x1[5]))=x2[12]∧x2[5]=x3[12]∧x3[5]=java.lang.Object(LinkedList(44, x1[12])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (571) using rules (III), (IV) which results in the following new constraint:
(572)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[12])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (572) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(573)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (573) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(574)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (574) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(575)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (575) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(576)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]) which results in the following constraint:
(577)    (java.lang.Object(LinkedList(47, x1[5]))=x2[13]∧x2[5]=x3[13]∧x3[5]=java.lang.Object(LinkedList(45, x1[13])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (577) using rules (III), (IV) which results in the following new constraint:
(578)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[13])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (578) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(579)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (579) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(580)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (580) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(581)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (581) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(582)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[14], x3[14], java.lang.Object(LinkedList(46, x1[14]))) → 6432_0_TOPOSTFIX_NULL(x2[14], java.lang.Object(LinkedList(46, x3[14])), x1[14]) which results in the following constraint:
(583)    (java.lang.Object(LinkedList(47, x1[5]))=x2[14]∧x2[5]=x3[14]∧x3[5]=java.lang.Object(LinkedList(46, x1[14])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (583) using rules (III), (IV) which results in the following new constraint:
(584)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[14])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (584) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(585)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (585) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(586)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (586) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(587)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (587) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(588)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[15], x3[15], java.lang.Object(LinkedList(47, x1[15]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x2[15])), x3[15], x1[15]) which results in the following constraint:
(589)    (java.lang.Object(LinkedList(47, x1[5]))=x2[15]∧x2[5]=x3[15]∧x3[5]=java.lang.Object(LinkedList(47, x1[15])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (589) using rules (III), (IV) which results in the following new constraint:
(590)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[15])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (590) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(591)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (591) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(592)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (592) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(593)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (593) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(594)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) which results in the following constraint:
(595)    (java.lang.Object(LinkedList(47, x1[5]))=x2[16]∧x2[5]=x3[16]∧x3[5]=java.lang.Object(LinkedList(x0[16], x1[16])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (595) using rules (III), (IV) which results in the following new constraint:
(596)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(x0[16], x1[16])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (596) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(597)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (597) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(598)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (598) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(599)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (599) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(600)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[19], x3[19], java.lang.Object(LinkedList(44, x1[19]))) → 6715_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(44, x1[19])), x2[19], x3[19]) which results in the following constraint:
(601)    (java.lang.Object(LinkedList(47, x1[5]))=x2[19]∧x2[5]=x3[19]∧x3[5]=java.lang.Object(LinkedList(44, x1[19])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (601) using rules (III), (IV) which results in the following new constraint:
(602)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(44, x1[19])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (602) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(603)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (603) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(604)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (604) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(605)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (605) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(606)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[20], x3[20], java.lang.Object(LinkedList(46, x1[20]))) → 6725_0_TOPOSTFIX_NEW(java.lang.Object(LinkedList(46, x1[20])), x2[20], x3[20]) which results in the following constraint:
(607)    (java.lang.Object(LinkedList(47, x1[5]))=x2[20]∧x2[5]=x3[20]∧x3[5]=java.lang.Object(LinkedList(46, x1[20])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (607) using rules (III), (IV) which results in the following new constraint:
(608)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(46, x1[20])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (608) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(609)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (609) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(610)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (610) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(611)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (611) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(612)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[21], x3[21], java.lang.Object(LinkedList(40, x1[21]))) → 7120_0_TOPOSTFIX_STORE(x2[21], x3[21], x1[21]) which results in the following constraint:
(613)    (java.lang.Object(LinkedList(47, x1[5]))=x2[21]∧x2[5]=x3[21]∧x3[5]=java.lang.Object(LinkedList(40, x1[21])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (613) using rules (III), (IV) which results in the following new constraint:
(614)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[21])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (614) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(615)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (615) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(616)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (616) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(617)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (617) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(618)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[22], x3[22])), x4[22], java.lang.Object(LinkedList(41, x1[22]))) → 8934_0_TOPOSTFIX_STORE(x3[22], java.lang.Object(LinkedList(x2[22], x4[22])), x1[22]) which results in the following constraint:
(619)    (java.lang.Object(LinkedList(47, x1[5]))=java.lang.Object(LinkedList(x2[22], x3[22]))∧x2[5]=x4[22]∧x3[5]=java.lang.Object(LinkedList(41, x1[22])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (619) using rules (I), (II), (III), (IV) which results in the following new constraint:
(620)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(41, x1[22])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (620) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(621)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (621) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(622)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (622) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(623)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (623) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(624)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[23], x3[23], java.lang.Object(LinkedList(42, x1[23]))) → 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x2[23])), x3[23], x1[23]) which results in the following constraint:
(625)    (java.lang.Object(LinkedList(47, x1[5]))=x2[23]∧x2[5]=x3[23]∧x3[5]=java.lang.Object(LinkedList(42, x1[23])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (625) using rules (III), (IV) which results in the following new constraint:
(626)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(42, x1[23])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (626) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(627)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (627) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(628)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (628) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(629)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (629) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(630)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[24], x3[24], java.lang.Object(LinkedList(43, x1[24]))) → 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x2[24])), x3[24], x1[24]) which results in the following constraint:
(631)    (java.lang.Object(LinkedList(47, x1[5]))=x2[24]∧x2[5]=x3[24]∧x3[5]=java.lang.Object(LinkedList(43, x1[24])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (631) using rules (III), (IV) which results in the following new constraint:
(632)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(43, x1[24])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (632) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(633)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (633) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(634)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (634) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(635)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (635) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(636)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[25], x3[25], java.lang.Object(LinkedList(45, x1[25]))) → 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x2[25])), x3[25], x1[25]) which results in the following constraint:
(637)    (java.lang.Object(LinkedList(47, x1[5]))=x2[25]∧x2[5]=x3[25]∧x3[5]=java.lang.Object(LinkedList(45, x1[25])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (637) using rules (III), (IV) which results in the following new constraint:
(638)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(45, x1[25])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (638) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(639)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (639) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(640)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (640) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(641)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (641) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(642)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[26], x3[26], java.lang.Object(LinkedList(47, x1[26]))) → 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x2[26])), x3[26], x1[26]) which results in the following constraint:
(643)    (java.lang.Object(LinkedList(47, x1[5]))=x2[26]∧x2[5]=x3[26]∧x3[5]=java.lang.Object(LinkedList(47, x1[26])) ⇒ 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (643) using rules (III), (IV) which results in the following new constraint:
(644)    (8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥NonInfC∧8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(47, x1[26])))∧(U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥))

We simplified constraint (644) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(645)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (645) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(646)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (646) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(647)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧[(-1)bso_66] ≥ 0)

We simplified constraint (647) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(648)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_66] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(x0, x1))) → COND_6432_0_TOPOSTFIX_NULL(<(x0, 40), x2, x3, java.lang.Object(LinkedList(x0, x1))) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(649)    (<(x0[6], 40)=TRUE∧x2[6]=x2[7]∧x3[6]=x3[7]∧java.lang.Object(LinkedList(x0[6], x1[6]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥))

We simplified constraint (649) using rules (I), (II), (IV) which results in the following new constraint:
(650)    (<(x0[6], 40)=TRUE ⇒ 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))∧(U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥))

We simplified constraint (650) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(651)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (651) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(652)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (652) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(653)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[bni_67 + (-1)Bound*bni_67] + [(4)bni_67]x1[6] + [(6)bni_67]x0[6] ≥ 0∧[(-1)bso_68] ≥ 0)

We simplified constraint (653) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(654)    (0 ≥ 0 ⇒ (U^Increasing(COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))), ≥)∧[(4)bni_67] ≥ 0∧[(6)bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_67 + (-1)Bound*bni_67] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_68] ≥ 0)

For Pair COND_6432_0_TOPOSTFIX_NULL(TRUE, x2, x3, java.lang.Object(LinkedList(x0, x1))) → 6432_0_TOPOSTFIX_NULL(x2, java.lang.Object(LinkedList(x0, x3)), x1) the following chains were created:

We consider the chain 6432_0_TOPOSTFIX_NULL(x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))) → COND_6432_0_TOPOSTFIX_NULL(<(x0[6], 40), x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(655)    (<(x0[6], 40)=TRUE∧x2[6]=x2[7]∧x3[6]=x3[7]∧java.lang.Object(LinkedList(x0[6], x1[6]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (655) using rules (I), (II), (III) which results in the following new constraint:
(656)    (<(x0[6], 40)=TRUE ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[6], x3[6], java.lang.Object(LinkedList(x0[6], x1[6])))≥6432_0_TOPOSTFIX_NULL(x2[6], java.lang.Object(LinkedList(x0[6], x3[6])), x1[6])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (656) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(657)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (657) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(658)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (658) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(659)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[6] + [(6)bni_69]x0[6] ≥ 0∧[2 + (-1)bso_70] + [3]x1[6] + [6]x0[6] ≥ 0)

We simplified constraint (659) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(660)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))) → COND_6432_0_TOPOSTFIX_NULL(>(x0[16], 47), x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16]))), COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]) which results in the following constraint:
(661)    (>(x0[16], 47)=TRUE∧x2[16]=x2[7]∧x3[16]=x3[7]∧java.lang.Object(LinkedList(x0[16], x1[16]))=java.lang.Object(LinkedList(x0[7], x1[7])) ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (661) using rules (I), (II), (III) which results in the following new constraint:
(662)    (>(x0[16], 47)=TRUE ⇒ COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥NonInfC∧COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[16], x3[16], java.lang.Object(LinkedList(x0[16], x1[16])))≥6432_0_TOPOSTFIX_NULL(x2[16], java.lang.Object(LinkedList(x0[16], x3[16])), x1[16])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥))

We simplified constraint (662) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(663)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (663) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(664)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (664) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(665)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[bni_69 + (-1)Bound*bni_69] + [(4)bni_69]x1[16] + [(6)bni_69]x0[16] ≥ 0∧[2 + (-1)bso_70] + [3]x1[16] + [6]x0[16] ≥ 0)

We simplified constraint (665) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(666)    (0 ≥ 0 ⇒ (U^Increasing(6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7])), ≥)∧[(4)bni_69] ≥ 0∧[(6)bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[bni_69 + (-1)Bound*bni_69] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_70] ≥ 0∧[1] ≥ 0∧[1] ≥ 0)

For Pair 6432_0_TOPOSTFIX_NULL(x2, x3, java.lang.Object(LinkedList(40, x1))) → 6432_0_TOPOSTFIX_NULL(x2, x3, x1) the following chains were created:

We consider the chain 7120_0_TOPOSTFIX_STORE(x0[0], x1[0], x2[0]) → 6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x2[0]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(667)    (x0[0]=x2[8]∧x1[0]=x3[8]∧x2[0]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (667) using rule (III) which results in the following new constraint:
(668)    (6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[0], x1[0], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[0], x1[0], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (668) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(669)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (669) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(670)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (670) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(671)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (671) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(672)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8934_0_TOPOSTFIX_STORE(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]) → 6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x3[1]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(673)    (x0[1]=x2[8]∧java.lang.Object(LinkedList(x1[1], x2[1]))=x3[8]∧x3[1]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (673) using rule (III) which results in the following new constraint:
(674)    (6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x0[1], java.lang.Object(LinkedList(x1[1], x2[1])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (674) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(675)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (675) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(676)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (676) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(677)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (677) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(678)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8508_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x3[2]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(679)    (java.lang.Object(LinkedList(42, x1[2]))=x2[8]∧x2[2]=x3[8]∧x3[2]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (679) using rule (III) which results in the following new constraint:
(680)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x1[2])), x2[2], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (680) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(681)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (681) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(682)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (682) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(683)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (683) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(684)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8511_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x3[3]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(685)    (java.lang.Object(LinkedList(43, x1[3]))=x2[8]∧x2[3]=x3[8]∧x3[3]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (685) using rule (III) which results in the following new constraint:
(686)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x1[3])), x2[3], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (686) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(687)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (687) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(688)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (688) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(689)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (689) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(690)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8514_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x3[4]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(691)    (java.lang.Object(LinkedList(45, x1[4]))=x2[8]∧x2[4]=x3[8]∧x3[4]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (691) using rule (III) which results in the following new constraint:
(692)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x1[4])), x2[4], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (692) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(693)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (693) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(694)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (694) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(695)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (695) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(696)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 8517_0_TOPOSTFIX_STORE(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x3[5]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(697)    (java.lang.Object(LinkedList(47, x1[5]))=x2[8]∧x2[5]=x3[8]∧x3[5]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (697) using rule (III) which results in the following new constraint:
(698)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(47, x1[5])), x2[5], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (698) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(699)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (699) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(700)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (700) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(701)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (701) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(702)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain COND_6432_0_TOPOSTFIX_NULL(TRUE, x2[7], x3[7], java.lang.Object(LinkedList(x0[7], x1[7]))) → 6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[7]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(703)    (x2[7]=x2[8]∧java.lang.Object(LinkedList(x0[7], x3[7]))=x3[8]∧x1[7]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (703) using rule (III) which results in the following new constraint:
(704)    (6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[7], java.lang.Object(LinkedList(x0[7], x3[7])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (704) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(705)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (705) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(706)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (706) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(707)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (707) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(708)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(709)    (x2[8]=x2[8]1∧x3[8]=x3[8]1∧x1[8]=java.lang.Object(LinkedList(40, x1[8]1)) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, java.lang.Object(LinkedList(40, x1[8]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, java.lang.Object(LinkedList(40, x1[8]1)))≥6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥))

We simplified constraint (709) using rule (III) which results in the following new constraint:
(710)    (6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]1)))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]1)))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]1)∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥))

We simplified constraint (710) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(711)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (711) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(712)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (712) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(713)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧[242 + (-1)bso_72] + [3]x1[8]1 ≥ 0)

We simplified constraint (713) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(714)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8]1, x3[8]1, x1[8]1)), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(x2[9], x3[9])), x4[9], java.lang.Object(LinkedList(41, x1[9]))) → 6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[9]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(715)    (x3[9]=x2[8]∧java.lang.Object(LinkedList(x2[9], x4[9]))=x3[8]∧x1[9]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (715) using rule (III) which results in the following new constraint:
(716)    (6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x3[9], java.lang.Object(LinkedList(x2[9], x4[9])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (716) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(717)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (717) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(718)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (718) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(719)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (719) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(720)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[10], x3[10], java.lang.Object(LinkedList(42, x1[10]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[10]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(721)    (java.lang.Object(LinkedList(42, x2[10]))=x2[8]∧x3[10]=x3[8]∧x1[10]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (721) using rule (III) which results in the following new constraint:
(722)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(42, x2[10])), x3[10], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (722) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(723)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (723) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(724)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (724) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(725)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (725) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(726)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[11], x3[11], java.lang.Object(LinkedList(43, x1[11]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[11]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(727)    (java.lang.Object(LinkedList(43, x2[11]))=x2[8]∧x3[11]=x3[8]∧x1[11]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (727) using rule (III) which results in the following new constraint:
(728)    (6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(43, x2[11])), x3[11], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (728) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(729)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (729) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(730)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (730) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(731)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (731) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(732)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[12], x3[12], java.lang.Object(LinkedList(44, x1[12]))) → 6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[12]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]) which results in the following constraint:
(733)    (x2[12]=x2[8]∧java.lang.Object(LinkedList(44, x3[12]))=x3[8]∧x1[12]=java.lang.Object(LinkedList(40, x1[8])) ⇒ 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (733) using rule (III) which results in the following new constraint:
(734)    (6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[8])))≥NonInfC∧6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), java.lang.Object(LinkedList(40, x1[8])))≥6432_0_TOPOSTFIX_NULL(x2[12], java.lang.Object(LinkedList(44, x3[12])), x1[8])∧(U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥))

We simplified constraint (734) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(735)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (735) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(736)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (736) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(737)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧[242 + (-1)bso_72] + [3]x1[8] ≥ 0)

We simplified constraint (737) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(738)    ((U^Increasing(6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8])), ≥)∧0 ≥ 0∧0 ≥ 0∧[242 + (-1)bso_72] ≥ 0∧[1] ≥ 0)
We consider the chain 6432_0_TOPOSTFIX_NULL(x2[13], x3[13], java.lang.Object(LinkedList(45, x1[13]))) → 6432_0_TOPOSTFIX_NULL(java.lang.Object(LinkedList(45, x2[13])), x3[13], x1[13]), 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], java.lang.Object(LinkedList(40, x1[8]))) → 6432_0_TOPOSTFIX_NULL(x2[8], x3[8], x1[8]