Termination of the given JBC could be proven:

0 JBC
↳1 JBC2FIG (⇒)
↳2 JBCTerminationGraph
↳3 FIGtoITRSProof (⇒)
↳4 AND
    ↳5 IDP
        ↳6 IDPNonInfProof (⇒)
        ↳7 IDP
        ↳8 IDependencyGraphProof (⇔)
        ↳9 TRUE
    ↳10 IDP
        ↳11 IDPtoQDPProof (⇒)
        ↳12 QDP
        ↳13 UsableRulesProof (⇔)
        ↳14 QDP
        ↳15 QReductionProof (⇔)
        ↳16 QDP
        ↳17 QDPSizeChangeProof (⇔)
        ↳18 YES
    ↳19 IDP
        ↳20 IDPNonInfProof (⇒)
        ↳21 AND
            ↳22 IDP
                ↳23 IDependencyGraphProof (⇔)
                ↳24 TRUE
            ↳25 IDP
                ↳26 IDependencyGraphProof (⇔)
                ↳27 TRUE

(0) Obligation:

JBC Problem based on JBC Program:
Manifest-Version: 1.0 Created-By: 1.6.0_14 (Sun Microsystems Inc.) Main-Class: DoublyLinkedList/MainDelete 
package DoublyLinkedList;

/**
 * A linked list with pointers to the previous and next elements
 * @author cotto
 */
public class DoublyLinkedList {
    public int value;
    public DoublyLinkedList prev;
    public DoublyLinkedList next;

    public DoublyLinkedList(final int v) {
        this.value = v;
    }

    public DoublyLinkedList getFirst() {
        if (this.prev == null) {
            return this;
        }
        return this.prev.getFirst();
    }

    public void move(final int relativePosition) {
        if (relativePosition == 0) {
            return;
        }
        if (relativePosition > 0 && this.next != null) {
            final DoublyLinkedList temp = this.next;
            if (this.prev != null) {
                this.prev.next = temp;
            }
            temp.prev = this.prev;
            this.next = temp.next;
            temp.next = this;
            this.prev = temp;
            move(relativePosition - 1);
        }
        if (relativePosition < 0 && this.prev != null) {
            final DoublyLinkedList temp = this.prev;
            if (this.next != null) {
                this.next.prev = temp;
            }
            temp.next = this.next;
            this.prev = temp.prev;
            temp.prev = this;
            this.next = temp;
            move(relativePosition - 1);
        }
    }

    public DoublyLinkedList get(final int index) {
        DoublyLinkedList current = this.getFirst();
        while (index > 0 && current != null) {
            current = current.next;
        }
        return current;
    }

    public DoublyLinkedList find(final int v) {
        final DoublyLinkedList first = this.getFirst();
        return first.findR(v);
    }

    private DoublyLinkedList findR(final int v) {
        if (this.value == v) {
            return this;
        }
        if (this.next != null) {
            return this.next.findR(v);
        }
        return null;
    }

    public void delete(final int v) {
        final DoublyLinkedList elem = find(v);
        if (elem != null) {
            if (elem.prev != null) {
                elem.prev.next = elem.next;
            }
            if (elem.next != null) {
                elem.next.prev = elem.prev;
            }
        }
    }

    public DoublyLinkedList copy() {
        final DoublyLinkedList first = this.getFirst();
        return first.copyR(null);
    }

    private DoublyLinkedList copyR(final DoublyLinkedList p) {
        final DoublyLinkedList copy = new DoublyLinkedList(this.value);
        copy.prev = p;
        if (p != null) {
            p.next = copy;
        }
        if (this.next != null) {
            this.next.copyR(copy);
        }
        return copy;
    }

    static DoublyLinkedList createList() {
        final int count = Random.random();
        DoublyLinkedList cur = null;
        for (int i = 0; i < count; i++) {
            final DoublyLinkedList old = cur;
            cur = new DoublyLinkedList(Random.random());
            cur.prev = old;
            if (old != null) {
              old.next = cur;
            }
        }

        return cur;
    }
}


package DoublyLinkedList;

/**
 *
 * @author cotto
 */
public class MainDelete {
    public static void main(final String[] args) {
        Random.args = args;
        final DoublyLinkedList list = DoublyLinkedList.createList();
        list.delete(Random.random());
    }
}


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

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


(1) JBC2FIG (SOUND transformation)

Constructed FIGraph.

(2) Obligation:

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

DoublyLinkedList.DoublyLinkedList.createList()LDoublyLinkedList/DoublyLinkedList;: Graph of 205 nodes with 1 SCC.

DoublyLinkedList.DoublyLinkedList.getFirst()LDoublyLinkedList/DoublyLinkedList;: Graph of 29 nodes with 0 SCCs.

DoublyLinkedList.DoublyLinkedList.findR(I)LDoublyLinkedList/DoublyLinkedList;: Graph of 159 nodes with 0 SCCs.


(3) FIGtoITRSProof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Logs:

Log for SCC 0:

Generated 68 rules for P and 123 rules for R.


Combined rules. Obtained 9 rules for P and 45 rules for R.


Filtered ground terms:


5116_0_findR_FieldAccess(x1, x2, x3, x4) → 5116_0_findR_FieldAccess(x2, x3, x4)
Cond_5116_0_findR_FieldAccess2(x1, x2, x3, x4, x5) → Cond_5116_0_findR_FieldAccess2(x1, x3, x4, x5)
DoublyLinkedList.DoublyLinkedList(x1, x2, x3) → DoublyLinkedList.DoublyLinkedList(x2, x3)
Cond_5499_0_findR_Load(x1, x2, x3, x4, x5) → Cond_5499_0_findR_Load(x1, x3, x4, x5)
5499_0_findR_Load(x1, x2, x3, x4) → 5499_0_findR_Load(x2, x3, x4)
Cond_5116_0_findR_FieldAccess1(x1, x2, x3, x4, x5) → Cond_5116_0_findR_FieldAccess1(x1, x3, x4, x5)
Cond_5654_0_findR_Load(x1, x2, x3, x4, x5) → Cond_5654_0_findR_Load(x1, x3, x4, x5)
5654_0_findR_Load(x1, x2, x3, x4) → 5654_0_findR_Load(x2, x3, x4)
Cond_5116_0_findR_FieldAccess(x1, x2, x3, x4, x5) → Cond_5116_0_findR_FieldAccess(x1, x3, x4, x5)
Cond_5575_0_findR_Load(x1, x2, x3, x4, x5) → Cond_5575_0_findR_Load(x1, x3, x4, x5)
5575_0_findR_Load(x1, x2, x3, x4) → 5575_0_findR_Load(x2, x3, x4)
10578_0_findR_Return(x1) → 10578_0_findR_Return
10785_0_findR_Return(x1) → 10785_0_findR_Return
10672_0_findR_Return(x1) → 10672_0_findR_Return
8707_0_findR_Return(x1, x2) → 8707_0_findR_Return
8682_0_findR_Return(x1, x2) → 8682_0_findR_Return(x2)
8600_0_findR_Return(x1, x2) → 8600_0_findR_Return
8586_0_findR_Return(x1, x2) → 8586_0_findR_Return(x2)
8521_0_findR_Return(x1, x2) → 8521_0_findR_Return
8518_0_findR_Return(x1, x2) → 8518_0_findR_Return(x2)
7257_0_findR_Return(x1, x2) → 7257_0_findR_Return
7158_0_findR_Return(x1, x2) → 7158_0_findR_Return
6195_0_findR_Return(x1, x2, x3, x4) → 6195_0_findR_Return(x2, x3, x4)
6103_0_findR_Return(x1, x2, x3, x4) → 6103_0_findR_Return(x2, x3, x4)
7103_0_findR_Return(x1, x2) → 7103_0_findR_Return
6034_0_findR_Return(x1, x2, x3, x4) → 6034_0_findR_Return(x2, x3, x4)

Filtered duplicate args:


5116_0_findR_FieldAccess(x1, x2, x3) → 5116_0_findR_FieldAccess(x2, x3)
Cond_5116_0_findR_FieldAccess2(x1, x2, x3, x4) → Cond_5116_0_findR_FieldAccess2(x1, x3, x4)
Cond_5116_0_findR_FieldAccess1(x1, x2, x3, x4) → Cond_5116_0_findR_FieldAccess1(x1, x3, x4)
Cond_5116_0_findR_FieldAccess(x1, x2, x3, x4) → Cond_5116_0_findR_FieldAccess(x1, x3, x4)
6195_0_findR_Return(x1, x2, x3) → 6195_0_findR_Return(x2, x3)
6103_0_findR_Return(x1, x2, x3) → 6103_0_findR_Return(x2, x3)
6034_0_findR_Return(x1, x2, x3) → 6034_0_findR_Return(x2, x3)

Combined rules. Obtained 6 rules for P and 45 rules for R.


Finished conversion. Obtained 6 rules for P and 45 rules for R. System has predefined symbols.



Log for SCC 1:

Generated 16 rules for P and 14 rules for R.


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


Filtered ground terms:


3340_0_getFirst_FieldAccess(x1, x2, x3) → 3340_0_getFirst_FieldAccess(x2, x3)
DoublyLinkedList.DoublyLinkedList(x1, x2) → DoublyLinkedList.DoublyLinkedList(x2)
3496_0_getFirst_NONNULL(x1, x2, x3) → 3496_0_getFirst_NONNULL(x2, x3)
4263_0_getFirst_Return(x1) → 4263_0_getFirst_Return
3743_0_getFirst_Return(x1, x2) → 3743_0_getFirst_Return
3581_0_getFirst_Return(x1, x2, x3) → 3581_0_getFirst_Return

Filtered duplicate args:


3340_0_getFirst_FieldAccess(x1, x2) → 3340_0_getFirst_FieldAccess(x2)

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



Log for SCC 2:

Generated 105 rules for P and 60 rules for R.


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


Filtered ground terms:


18348_0_createList_NULL(x1, x2, x3, x4, x5, x6) → 18348_0_createList_NULL(x2, x4, x5, x6)
DoublyLinkedList.DoublyLinkedList(x1) → DoublyLinkedList.DoublyLinkedList
Cond_8130_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → Cond_8130_1_createList_InvokeMethod(x1, x2, x3, x4, x5)
8130_0_random_GT(x1, x2, x3) → 8130_0_random_GT(x2, x3)
8130_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6) → 8130_1_createList_InvokeMethod(x1, x2, x3, x4)
5275_0_createList_Load(x1, x2, x3, x4, x5) → 5275_0_createList_Load(x2, x3, x4, x5)
28873_0_createList_Inc(x1, x2, x3, x4) → 28873_0_createList_Inc(x2, x4)
Cond_13236_1_createList_InvokeMethod3(x1, x2, x3, x4, x5, x6, x7) → Cond_13236_1_createList_InvokeMethod3(x1, x2, x3, x4, x5)
13236_0_random_IntArithmetic(x1, x2, x3, x4) → 13236_0_random_IntArithmetic(x2, x3)
13236_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6) → 13236_1_createList_InvokeMethod(x1, x2, x3, x4)
Cond_13236_1_createList_InvokeMethod2(x1, x2, x3, x4, x5, x6, x7) → Cond_13236_1_createList_InvokeMethod2(x1, x2, x3, x4)
Cond_13236_1_createList_InvokeMethod1(x1, x2, x3, x4, x5, x6, x7) → Cond_13236_1_createList_InvokeMethod1(x1, x2, x3, x4)
64383_0_createList_Inc(x1, x2, x3, x4) → 64383_0_createList_Inc(x2, x4)
Cond_13236_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → Cond_13236_1_createList_InvokeMethod(x1, x2, x3, x4)
Cond_12079_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → Cond_12079_1_createList_InvokeMethod(x1, x2, x3, x4, x5)
12079_0_random_ArrayAccess(x1, x2, x3) → 12079_0_random_ArrayAccess(x2, x3)
12079_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6) → 12079_1_createList_InvokeMethod(x1, x2, x3, x4)
Cond_8128_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → Cond_8128_1_createList_InvokeMethod(x1, x2, x3, x4, x5)
8128_0_random_GT(x1, x2, x3) → 8128_0_random_GT(x2, x3)
8128_1_createList_InvokeMethod(x1, x2, x3, x4, x5, x6) → 8128_1_createList_InvokeMethod(x1, x2, x3, x4)
Cond_5275_0_createList_Load1(x1, x2, x3, x4, x5, x6) → Cond_5275_0_createList_Load1(x1, x3, x4, x5, x6)
Cond_5275_0_createList_Load(x1, x2, x3, x4, x5, x6) → Cond_5275_0_createList_Load(x1, x3, x4, x5, x6)

Filtered duplicate args:


18348_0_createList_NULL(x1, x2, x3, x4) → 18348_0_createList_NULL(x1, x2, x4)
5275_0_createList_Load(x1, x2, x3, x4) → 5275_0_createList_Load(x1, x2, x4)
Cond_5275_0_createList_Load1(x1, x2, x3, x4, x5) → Cond_5275_0_createList_Load1(x1, x2, x3, x5)
Cond_5275_0_createList_Load(x1, x2, x3, x4, x5) → Cond_5275_0_createList_Load(x1, x2, x3, x5)

Filtered all non-integer terms:


13236_1_createList_InvokeMethod(x1, x2, x3, x4) → 13236_1_createList_InvokeMethod(x1, x2, x3)
13236_0_random_IntArithmetic(x1, x2) → 13236_0_random_IntArithmetic(x2)
5275_0_createList_Load(x1, x2, x3) → 5275_0_createList_Load(x1, x3)
18348_0_createList_NULL(x1, x2, x3) → 18348_0_createList_NULL(x1, x2)

Filtered all free variables:


8128_1_createList_InvokeMethod(x1, x2, x3, x4) → 8128_1_createList_InvokeMethod(x2, x3, x4)
8130_1_createList_InvokeMethod(x1, x2, x3, x4) → 8130_1_createList_InvokeMethod(x2, x3, x4)
Cond_8128_1_createList_InvokeMethod(x1, x2, x3, x4, x5) → Cond_8128_1_createList_InvokeMethod(x1, x3, x4, x5)
12079_1_createList_InvokeMethod(x1, x2, x3, x4) → 12079_1_createList_InvokeMethod(x2, x3, x4)
Cond_12079_1_createList_InvokeMethod(x1, x2, x3, x4, x5) → Cond_12079_1_createList_InvokeMethod(x1, x3, x4, x5)
13236_1_createList_InvokeMethod(x1, x2, x3) → 13236_1_createList_InvokeMethod(x2, x3)
Cond_13236_1_createList_InvokeMethod(x1, x2, x3, x4) → Cond_13236_1_createList_InvokeMethod(x1, x3, x4)
Cond_13236_1_createList_InvokeMethod1(x1, x2, x3, x4) → Cond_13236_1_createList_InvokeMethod1(x1, x3, x4)
Cond_13236_1_createList_InvokeMethod2(x1, x2, x3, x4) → Cond_13236_1_createList_InvokeMethod2(x1, x3, x4)
Cond_13236_1_createList_InvokeMethod3(x1, x2, x3, x4, x5) → Cond_13236_1_createList_InvokeMethod3(x1, x3, x4, x5)
Cond_8130_1_createList_InvokeMethod(x1, x2, x3, x4, x5) → Cond_8130_1_createList_InvokeMethod(x1, x3, x4, x5)

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


Finished conversion. Obtained 5 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:

Boolean, Integer


The ITRS R consists of the following rules:
8136_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8334_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
7944_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
8136_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8136_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8136_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8334_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
8334_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
8334_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
7944_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
7944_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
7944_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return

The integer pair graph contains the following rules and edges:
(0): 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(x0[0] = x2[0]), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))
(1): COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))) → 5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))

(0) -> (1), if ((!(x0[0] = x2[0]) →* TRUE)∧(x2[0] →* x2[1])∧(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))))


(1) -> (0), if ((x2[1] →* x2[0])∧(java.lang.Object(x1[1]) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))))



The set Q consists of the following terms:
8136_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8136_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8136_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)

(6) 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 5116_0_FINDR_FIELDACCESS(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1)))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0, x2)), x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1)))) the following chains were created:
  • We consider the chain 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))), COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))) → 5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1])) which results in the following constraint:

    (1)    (!(=(x0[0], x2[0]))=TRUE∧x2[0]=x2[1]∧java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))=java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1]))) ⇒ 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))≥NonInfC∧5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))≥COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))∧(UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥))



    We simplified constraint (1) using rules (I), (II), (IV) which results in the following new constraint:

    (2)    (!(=(x0[0], x2[0]))=TRUE ⇒ 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))≥NonInfC∧5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))≥COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))∧(UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥))



    We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (3)    (0 ≥ 0 ⇒ (UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥)∧[(6)bni_50 + (-1)Bound*bni_50] + [(8)bni_50]x1[0] + [(2)bni_50]x2[0] ≥ 0∧[2 + (-1)bso_51] ≥ 0)



    We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (4)    (0 ≥ 0 ⇒ (UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥)∧[(6)bni_50 + (-1)Bound*bni_50] + [(8)bni_50]x1[0] + [(2)bni_50]x2[0] ≥ 0∧[2 + (-1)bso_51] ≥ 0)



    We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (5)    (0 ≥ 0 ⇒ (UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥)∧[(6)bni_50 + (-1)Bound*bni_50] + [(8)bni_50]x1[0] + [(2)bni_50]x2[0] ≥ 0∧[2 + (-1)bso_51] ≥ 0)



    We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:

    (6)    (0 ≥ 0 ⇒ (UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥)∧[(8)bni_50] ≥ 0∧0 ≥ 0∧[(2)bni_50] ≥ 0∧[(6)bni_50 + (-1)Bound*bni_50] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_51] ≥ 0)







For Pair COND_5116_0_FINDR_FIELDACCESS(TRUE, x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1)))) → 5116_0_FINDR_FIELDACCESS(x2, java.lang.Object(x1)) the following chains were created:
  • We consider the chain 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))), COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))) → 5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1])), 5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) which results in the following constraint:

    (7)    (!(=(x0[0], x2[0]))=TRUE∧x2[0]=x2[1]∧java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))=java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))∧x2[1]=x2[0]1∧java.lang.Object(x1[1])=java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]1, java.lang.Object(x1[0]1))) ⇒ COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1]))))≥NonInfC∧COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1]))))≥5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))∧(UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥))



    We simplified constraint (7) using rules (I), (II), (III), (IV) which results in the following new constraint:

    (8)    (!(=(x0[0], x2[0]))=TRUE ⇒ COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]1, java.lang.Object(x1[0]1))))))≥NonInfC∧COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]1, java.lang.Object(x1[0]1))))))≥5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]1, java.lang.Object(x1[0]1))))∧(UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥))



    We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (9)    (0 ≥ 0 ⇒ (UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥)∧[(20)bni_52 + (-1)Bound*bni_52] + [(32)bni_52]x1[0]1 + [(2)bni_52]x2[0] ≥ 0∧[14 + (-1)bso_53] + [24]x1[0]1 ≥ 0)



    We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (10)    (0 ≥ 0 ⇒ (UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥)∧[(20)bni_52 + (-1)Bound*bni_52] + [(32)bni_52]x1[0]1 + [(2)bni_52]x2[0] ≥ 0∧[14 + (-1)bso_53] + [24]x1[0]1 ≥ 0)



    We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (11)    (0 ≥ 0 ⇒ (UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥)∧[(20)bni_52 + (-1)Bound*bni_52] + [(32)bni_52]x1[0]1 + [(2)bni_52]x2[0] ≥ 0∧[14 + (-1)bso_53] + [24]x1[0]1 ≥ 0)



    We simplified constraint (11) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:

    (12)    (0 ≥ 0 ⇒ (UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥)∧[(32)bni_52] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(2)bni_52] ≥ 0∧[(20)bni_52 + (-1)Bound*bni_52] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[14 + (-1)bso_53] ≥ 0∧[1] ≥ 0)







To summarize, we get the following constraints P≥ for the following pairs.
  • 5116_0_FINDR_FIELDACCESS(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1)))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0, x2)), x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1))))
    • (0 ≥ 0 ⇒ (UIncreasing(COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))), ≥)∧[(8)bni_50] ≥ 0∧0 ≥ 0∧[(2)bni_50] ≥ 0∧[(6)bni_50 + (-1)Bound*bni_50] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_51] ≥ 0)

  • COND_5116_0_FINDR_FIELDACCESS(TRUE, x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(x1)))) → 5116_0_FINDR_FIELDACCESS(x2, java.lang.Object(x1))
    • (0 ≥ 0 ⇒ (UIncreasing(5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))), ≥)∧[(32)bni_52] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(2)bni_52] ≥ 0∧[(20)bni_52 + (-1)Bound*bni_52] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[14 + (-1)bso_53] ≥ 0∧[1] ≥ 0)




The constraints for P> respective Pbound are constructed from P≥ where we just replace every occurence of "t ≥ s" in P≥ by "t > s" respective "t ≥ c". Here c stands for the fresh constant used for Pbound.
Using the following integer polynomial ordering the resulting constraints can be solved
Polynomial interpretation over integers with natural coefficients for non-tuple symbols [NONINF][POLO]:

POL(TRUE) = 0   
POL(FALSE) = 0   
POL(8136_1_findR_InvokeMethod(x1, x2, x3)) = 0   
POL(6034_0_findR_Return(x1, x2)) = 0   
POL(java.lang.Object(x1)) = [1] + [2]x1   
POL(DoublyLinkedList.DoublyLinkedList(x1, x2)) = [2]x2   
POL(8586_0_findR_Return(x1)) = 0   
POL(7103_0_findR_Return) = 0   
POL(NULL) = 0   
POL(8600_0_findR_Return) = 0   
POL(8334_1_findR_InvokeMethod(x1, x2, x3)) = 0   
POL(8682_0_findR_Return(x1)) = 0   
POL(8707_0_findR_Return) = 0   
POL(7944_1_findR_InvokeMethod(x1, x2, x3)) = 0   
POL(8518_0_findR_Return(x1)) = 0   
POL(8521_0_findR_Return) = 0   
POL(6103_0_findR_Return(x1, x2)) = 0   
POL(6195_0_findR_Return(x1, x2)) = 0   
POL(7158_0_findR_Return) = 0   
POL(7257_0_findR_Return) = 0   
POL(10672_0_findR_Return) = 0   
POL(10578_0_findR_Return) = 0   
POL(10785_0_findR_Return) = 0   
POL(5116_0_FINDR_FIELDACCESS(x1, x2)) = [1] + x2 + [2]x1   
POL(COND_5116_0_FINDR_FIELDACCESS(x1, x2, x3)) = [-1] + x3 + [2]x2 + [-1]x1   
POL(!(x1)) = 0   
POL(=(x1, x2)) = 0   

The following pairs are in P>:

5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))
COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))) → 5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))

The following pairs are in Pbound:

5116_0_FINDR_FIELDACCESS(x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0])))) → COND_5116_0_FINDR_FIELDACCESS(!(=(x0[0], x2[0])), x2[0], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0], java.lang.Object(x1[0]))))
COND_5116_0_FINDR_FIELDACCESS(TRUE, x2[1], java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[1], java.lang.Object(x1[1])))) → 5116_0_FINDR_FIELDACCESS(x2[1], java.lang.Object(x1[1]))

The following pairs are in P≥:
none

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

FALSE1 → !(TRUE)1
TRUE1 → !(FALSE)1

(7) 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:
8136_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8334_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
7944_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
8136_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8136_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8136_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8600_0_findR_Return
8136_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8136_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10672_0_findR_Return
8334_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
8334_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
8334_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8707_0_findR_Return
8334_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
8334_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10785_0_findR_Return
7944_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0) → 8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))
7944_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
7944_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1) → 8521_0_findR_Return
7944_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return
7944_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4) → 10578_0_findR_Return

The integer pair graph is empty.

The set Q consists of the following terms:
8136_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(6034_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(7103_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8136_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8136_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8136_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8136_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8136_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8136_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
8334_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
8334_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
8334_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
8334_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
8334_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(6103_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(6195_0_findR_Return(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)), x0)
7944_1_findR_InvokeMethod(7158_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(7257_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, NULL)), x1)
7944_1_findR_InvokeMethod(8518_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8521_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(8586_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8600_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(8682_0_findR_Return(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1))), java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, x1)))), x0)
7944_1_findR_InvokeMethod(8707_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, NULL)))), x2)
7944_1_findR_InvokeMethod(10578_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(10672_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)
7944_1_findR_InvokeMethod(10785_0_findR_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x1, java.lang.Object(DoublyLinkedList.DoublyLinkedList(x2, x3)))))), x4)

(8) IDependencyGraphProof (EQUIVALENT transformation)

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

(9) TRUE

(10) Obligation:

IDP problem:
The following function symbols are pre-defined:
!=~Neq: (Integer, Integer) -> Boolean
*~Mul: (Integer, Integer) -> Integer
>=~Ge: (Integer, Integer) -> Boolean
-1~UnaryMinus: (Integer) -> Integer
|~Bwor: (Integer, Integer) -> Integer
/~Div: (Integer, Integer) -> Integer
=~Eq: (Integer, Integer) -> Boolean
~Bwxor: (Integer, Integer) -> Integer
||~Lor: (Boolean, Boolean) -> Boolean
!~Lnot: (Boolean) -> Boolean
<~Lt: (Integer, Integer) -> Boolean
-~Sub: (Integer, Integer) -> Integer
<=~Le: (Integer, Integer) -> Boolean
>~Gt: (Integer, Integer) -> Boolean
~~Bwnot: (Integer) -> Integer
%~Mod: (Integer, Integer) -> Integer
&~Bwand: (Integer, Integer) -> Integer
+~Add: (Integer, Integer) -> Integer
&&~Land: (Boolean, Boolean) -> Boolean


The following domains are used:
none


The ITRS R consists of the following rules:
3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL))) → 3743_0_getFirst_Return
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL))))) → 4263_0_getFirst_Return
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0))))))) → 4263_0_getFirst_Return

The integer pair graph contains the following rules and edges:
(0): 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))) → 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])), x0[0])
(1): 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))), java.lang.Object(x0[1])) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[1]))
(2): 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[2]))

(0) -> (1), if ((java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))))∧(x0[0] →* java.lang.Object(x0[1])))


(1) -> (0), if ((java.lang.Object(x0[1]) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))))


(1) -> (2), if ((java.lang.Object(x0[1]) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))))


(2) -> (0), if ((java.lang.Object(x0[2]) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))))


(2) -> (2), if ((java.lang.Object(x0[2]) →* java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2]')))))



The set Q consists of the following terms:
3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))))
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0)))))))

(11) IDPtoQDPProof (SOUND transformation)

Represented integers and predefined function symbols by Terms

(12) Obligation:

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

3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))) → 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])), x0[0])
3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))), java.lang.Object(x0[1])) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[1]))
3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[2]))

The TRS R consists of the following rules:

3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL))) → 3743_0_getFirst_Return
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL))))) → 4263_0_getFirst_Return
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0))))))) → 4263_0_getFirst_Return

The set Q consists of the following terms:

3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))))
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0)))))))

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

(13) 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.

(14) Obligation:

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

3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))) → 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])), x0[0])
3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))), java.lang.Object(x0[1])) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[1]))
3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[2]))

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

3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))))
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0)))))))

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

(15) 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].

3672_1_getFirst_InvokeMethod(3581_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))
3672_1_getFirst_InvokeMethod(3743_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(NULL)))))
3672_1_getFirst_InvokeMethod(4263_0_getFirst_Return, java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0)))))))

(16) Obligation:

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

3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))) → 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])), x0[0])
3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))), java.lang.Object(x0[1])) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[1]))
3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[2]))

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

(17) 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:

  • 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[1]))), java.lang.Object(x0[1])) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[1]))
    The graph contains the following edges 1 > 1, 2 >= 1

  • 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(java.lang.Object(x0[2])))) → 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(x0[2]))
    The graph contains the following edges 1 > 1

  • 3340_0_GETFIRST_FIELDACCESS(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0]))) → 3496_0_GETFIRST_NONNULL(java.lang.Object(DoublyLinkedList.DoublyLinkedList(x0[0])), x0[0])
    The graph contains the following edges 1 >= 1, 1 > 2

(18) YES

(19) Obligation:

IDP problem:
The following function symbols are pre-defined:
!=~Neq: (Integer, Integer) -> Boolean
*~Mul: (Integer, Integer) -> Integer
>=~Ge: (Integer, Integer) -> Boolean
-1~UnaryMinus: (Integer) -> Integer
|~Bwor: (Integer, Integer) -> Integer
/~Div: (Integer, Integer) -> Integer
=~Eq: (Integer, Integer) -> Boolean
~Bwxor: (Integer, Integer) -> Integer
||~Lor: (Boolean, Boolean) -> Boolean
!~Lnot: (Boolean) -> Boolean
<~Lt: (Integer, Integer) -> Boolean
-~Sub: (Integer, Integer) -> Integer
<=~Le: (Integer, Integer) -> Boolean
>~Gt: (Integer, Integer) -> Boolean
~~Bwnot: (Integer) -> Integer
%~Mod: (Integer, Integer) -> Integer
&~Bwand: (Integer, Integer) -> Integer
+~Add: (Integer, Integer) -> Integer
&&~Land: (Boolean, Boolean) -> Boolean


The following domains are used:

Integer


R is empty.

The integer pair graph contains the following rules and edges:
(0): 64383_0_CREATELIST_INC(x0[0], x1[0]) → 5275_0_CREATELIST_LOAD(x0[0], x1[0] + 1)
(1): 5275_0_CREATELIST_LOAD(x0[1], x1[1]) → COND_5275_0_CREATELIST_LOAD(x1[1] < x0[1], x0[1], x1[1])
(2): COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2])
(3): 5275_0_CREATELIST_LOAD(x0[3], x1[3]) → COND_5275_0_CREATELIST_LOAD1(x1[3] < x0[3], x0[3], x1[3])
(4): COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4]) → 5275_0_CREATELIST_LOAD(x0[4], x1[4] + 1)

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


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


(1) -> (2), if ((x1[1] < x0[1] →* TRUE)∧(x0[1] →* x0[2])∧(x1[1] →* x1[2]))


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


(3) -> (4), if ((x1[3] < x0[3] →* TRUE)∧(x0[3] →* x0[4])∧(x1[3] →* x1[4]))


(4) -> (1), if ((x0[4] →* x0[1])∧(x1[4] + 1 →* x1[1]))


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



The set Q is empty.

(20) 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 64383_0_CREATELIST_INC(x0, x1) → 5275_0_CREATELIST_LOAD(x0, +(x1, 1)) the following chains were created:
  • We consider the chain 64383_0_CREATELIST_INC(x0[0], x1[0]) → 5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1)) which results in the following constraint:

    (1)    (64383_0_CREATELIST_INC(x0[0], x1[0])≥NonInfC∧64383_0_CREATELIST_INC(x0[0], x1[0])≥5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))∧(UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥))



    We simplified constraint (1) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (2)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥)∧[1 + (-1)bso_12] ≥ 0)



    We simplified constraint (2) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (3)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥)∧[1 + (-1)bso_12] ≥ 0)



    We simplified constraint (3) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (4)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥)∧[1 + (-1)bso_12] ≥ 0)



    We simplified constraint (4) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:

    (5)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_12] ≥ 0)







For Pair 5275_0_CREATELIST_LOAD(x0, x1) → COND_5275_0_CREATELIST_LOAD(<(x1, x0), x0, x1) the following chains were created:
  • We consider the chain 5275_0_CREATELIST_LOAD(x0[1], x1[1]) → COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1]), COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2]) which results in the following constraint:

    (6)    (<(x1[1], x0[1])=TRUE∧x0[1]=x0[2]∧x1[1]=x1[2] ⇒ 5275_0_CREATELIST_LOAD(x0[1], x1[1])≥NonInfC∧5275_0_CREATELIST_LOAD(x0[1], x1[1])≥COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])∧(UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥))



    We simplified constraint (6) using rule (IV) which results in the following new constraint:

    (7)    (<(x1[1], x0[1])=TRUE ⇒ 5275_0_CREATELIST_LOAD(x0[1], x1[1])≥NonInfC∧5275_0_CREATELIST_LOAD(x0[1], x1[1])≥COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])∧(UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥))



    We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (8)    (x0[1] + [-1] + [-1]x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x1[1] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)



    We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (9)    (x0[1] + [-1] + [-1]x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x1[1] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)



    We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (10)    (x0[1] + [-1] + [-1]x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x1[1] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)



    We simplified constraint (10) using rule (IDP_SMT_SPLIT) which results in the following new constraint:

    (11)    (x0[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)



    We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraints:

    (12)    (x0[1] ≥ 0∧x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)


    (13)    (x0[1] ≥ 0∧x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)







For Pair COND_5275_0_CREATELIST_LOAD(TRUE, x0, x1) → 64383_0_CREATELIST_INC(x0, x1) the following chains were created:
  • We consider the chain COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2]), 64383_0_CREATELIST_INC(x0[0], x1[0]) → 5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1)) which results in the following constraint:

    (14)    (x0[2]=x0[0]∧x1[2]=x1[0] ⇒ COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2])≥NonInfC∧COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2])≥64383_0_CREATELIST_INC(x0[2], x1[2])∧(UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥))



    We simplified constraint (14) using rule (IV) which results in the following new constraint:

    (15)    (COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2])≥NonInfC∧COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2])≥64383_0_CREATELIST_INC(x0[2], x1[2])∧(UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥))



    We simplified constraint (15) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (16)    ((UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥)∧[(-1)bso_16] ≥ 0)



    We simplified constraint (16) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (17)    ((UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥)∧[(-1)bso_16] ≥ 0)



    We simplified constraint (17) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (18)    ((UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥)∧[(-1)bso_16] ≥ 0)



    We simplified constraint (18) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:

    (19)    ((UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥)∧0 = 0∧0 = 0∧[(-1)bso_16] ≥ 0)







For Pair 5275_0_CREATELIST_LOAD(x0, x1) → COND_5275_0_CREATELIST_LOAD1(<(x1, x0), x0, x1) the following chains were created:
  • We consider the chain 5275_0_CREATELIST_LOAD(x0[3], x1[3]) → COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3]), COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4]) → 5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1)) which results in the following constraint:

    (20)    (<(x1[3], x0[3])=TRUE∧x0[3]=x0[4]∧x1[3]=x1[4] ⇒ 5275_0_CREATELIST_LOAD(x0[3], x1[3])≥NonInfC∧5275_0_CREATELIST_LOAD(x0[3], x1[3])≥COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])∧(UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥))



    We simplified constraint (20) using rule (IV) which results in the following new constraint:

    (21)    (<(x1[3], x0[3])=TRUE ⇒ 5275_0_CREATELIST_LOAD(x0[3], x1[3])≥NonInfC∧5275_0_CREATELIST_LOAD(x0[3], x1[3])≥COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])∧(UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥))



    We simplified constraint (21) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (22)    (x0[3] + [-1] + [-1]x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [(-1)bni_17]x1[3] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)



    We simplified constraint (22) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (23)    (x0[3] + [-1] + [-1]x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [(-1)bni_17]x1[3] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)



    We simplified constraint (23) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (24)    (x0[3] + [-1] + [-1]x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)bni_17 + (-1)Bound*bni_17] + [(-1)bni_17]x1[3] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)



    We simplified constraint (24) using rule (IDP_SMT_SPLIT) which results in the following new constraint:

    (25)    (x0[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)



    We simplified constraint (25) using rule (IDP_SMT_SPLIT) which results in the following new constraints:

    (26)    (x0[3] ≥ 0∧x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)


    (27)    (x0[3] ≥ 0∧x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)







For Pair COND_5275_0_CREATELIST_LOAD1(TRUE, x0, x1) → 5275_0_CREATELIST_LOAD(x0, +(x1, 1)) the following chains were created:
  • We consider the chain COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4]) → 5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1)) which results in the following constraint:

    (28)    (COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4])≥NonInfC∧COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4])≥5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))∧(UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥))



    We simplified constraint (28) using rule (POLY_CONSTRAINTS) which results in the following new constraint:

    (29)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥)∧[1 + (-1)bso_20] ≥ 0)



    We simplified constraint (29) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:

    (30)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥)∧[1 + (-1)bso_20] ≥ 0)



    We simplified constraint (30) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:

    (31)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥)∧[1 + (-1)bso_20] ≥ 0)



    We simplified constraint (31) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:

    (32)    ((UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_20] ≥ 0)







To summarize, we get the following constraints P≥ for the following pairs.
  • 64383_0_CREATELIST_INC(x0, x1) → 5275_0_CREATELIST_LOAD(x0, +(x1, 1))
    • ((UIncreasing(5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_12] ≥ 0)

  • 5275_0_CREATELIST_LOAD(x0, x1) → COND_5275_0_CREATELIST_LOAD(<(x1, x0), x0, x1)
    • (x0[1] ≥ 0∧x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)
    • (x0[1] ≥ 0∧x1[1] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])), ≥)∧[(-1)Bound*bni_13] + [bni_13]x0[1] ≥ 0∧[(-1)bso_14] ≥ 0)

  • COND_5275_0_CREATELIST_LOAD(TRUE, x0, x1) → 64383_0_CREATELIST_INC(x0, x1)
    • ((UIncreasing(64383_0_CREATELIST_INC(x0[2], x1[2])), ≥)∧0 = 0∧0 = 0∧[(-1)bso_16] ≥ 0)

  • 5275_0_CREATELIST_LOAD(x0, x1) → COND_5275_0_CREATELIST_LOAD1(<(x1, x0), x0, x1)
    • (x0[3] ≥ 0∧x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)
    • (x0[3] ≥ 0∧x1[3] ≥ 0 ⇒ (UIncreasing(COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])), ≥)∧[(-1)Bound*bni_17] + [bni_17]x0[3] ≥ 0∧[(-1)bso_18] ≥ 0)

  • COND_5275_0_CREATELIST_LOAD1(TRUE, x0, x1) → 5275_0_CREATELIST_LOAD(x0, +(x1, 1))
    • ((UIncreasing(5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))), ≥)∧0 = 0∧0 = 0∧[1 + (-1)bso_20] ≥ 0)




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

POL(TRUE) = 0   
POL(FALSE) = 0   
POL(64383_0_CREATELIST_INC(x1, x2)) = [-1] + x1 + [-1]x2   
POL(5275_0_CREATELIST_LOAD(x1, x2)) = [-1] + [-1]x2 + x1   
POL(+(x1, x2)) = x1 + x2   
POL(1) = [1]   
POL(COND_5275_0_CREATELIST_LOAD(x1, x2, x3)) = [-1] + [-1]x3 + x2   
POL(<(x1, x2)) = [-1]   
POL(COND_5275_0_CREATELIST_LOAD1(x1, x2, x3)) = [-1] + [-1]x3 + x2   

The following pairs are in P>:

64383_0_CREATELIST_INC(x0[0], x1[0]) → 5275_0_CREATELIST_LOAD(x0[0], +(x1[0], 1))
COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4]) → 5275_0_CREATELIST_LOAD(x0[4], +(x1[4], 1))

The following pairs are in Pbound:

5275_0_CREATELIST_LOAD(x0[1], x1[1]) → COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])
5275_0_CREATELIST_LOAD(x0[3], x1[3]) → COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])

The following pairs are in P≥:

5275_0_CREATELIST_LOAD(x0[1], x1[1]) → COND_5275_0_CREATELIST_LOAD(<(x1[1], x0[1]), x0[1], x1[1])
COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2])
5275_0_CREATELIST_LOAD(x0[3], x1[3]) → COND_5275_0_CREATELIST_LOAD1(<(x1[3], x0[3]), x0[3], x1[3])

There are no usable rules.

(21) Complex Obligation (AND)

(22) Obligation:

IDP problem:
The following function symbols are pre-defined:
!=~Neq: (Integer, Integer) -> Boolean
*~Mul: (Integer, Integer) -> Integer
>=~Ge: (Integer, Integer) -> Boolean
-1~UnaryMinus: (Integer) -> Integer
|~Bwor: (Integer, Integer) -> Integer
/~Div: (Integer, Integer) -> Integer
=~Eq: (Integer, Integer) -> Boolean
~Bwxor: (Integer, Integer) -> Integer
||~Lor: (Boolean, Boolean) -> Boolean
!~Lnot: (Boolean) -> Boolean
<~Lt: (Integer, Integer) -> Boolean
-~Sub: (Integer, Integer) -> Integer
<=~Le: (Integer, Integer) -> Boolean
>~Gt: (Integer, Integer) -> Boolean
~~Bwnot: (Integer) -> Integer
%~Mod: (Integer, Integer) -> Integer
&~Bwand: (Integer, Integer) -> Integer
+~Add: (Integer, Integer) -> Integer
&&~Land: (Boolean, Boolean) -> Boolean


The following domains are used:

Integer


R is empty.

The integer pair graph contains the following rules and edges:
(1): 5275_0_CREATELIST_LOAD(x0[1], x1[1]) → COND_5275_0_CREATELIST_LOAD(x1[1] < x0[1], x0[1], x1[1])
(2): COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2])
(3): 5275_0_CREATELIST_LOAD(x0[3], x1[3]) → COND_5275_0_CREATELIST_LOAD1(x1[3] < x0[3], x0[3], x1[3])

(1) -> (2), if ((x1[1] < x0[1] →* TRUE)∧(x0[1] →* x0[2])∧(x1[1] →* x1[2]))



The set Q is empty.

(23) IDependencyGraphProof (EQUIVALENT transformation)

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

(24) TRUE

(25) Obligation:

IDP problem:
The following function symbols are pre-defined:
!=~Neq: (Integer, Integer) -> Boolean
*~Mul: (Integer, Integer) -> Integer
>=~Ge: (Integer, Integer) -> Boolean
-1~UnaryMinus: (Integer) -> Integer
|~Bwor: (Integer, Integer) -> Integer
/~Div: (Integer, Integer) -> Integer
=~Eq: (Integer, Integer) -> Boolean
~Bwxor: (Integer, Integer) -> Integer
||~Lor: (Boolean, Boolean) -> Boolean
!~Lnot: (Boolean) -> Boolean
<~Lt: (Integer, Integer) -> Boolean
-~Sub: (Integer, Integer) -> Integer
<=~Le: (Integer, Integer) -> Boolean
>~Gt: (Integer, Integer) -> Boolean
~~Bwnot: (Integer) -> Integer
%~Mod: (Integer, Integer) -> Integer
&~Bwand: (Integer, Integer) -> Integer
+~Add: (Integer, Integer) -> Integer
&&~Land: (Boolean, Boolean) -> Boolean


The following domains are used:

Integer


R is empty.

The integer pair graph contains the following rules and edges:
(0): 64383_0_CREATELIST_INC(x0[0], x1[0]) → 5275_0_CREATELIST_LOAD(x0[0], x1[0] + 1)
(2): COND_5275_0_CREATELIST_LOAD(TRUE, x0[2], x1[2]) → 64383_0_CREATELIST_INC(x0[2], x1[2])
(4): COND_5275_0_CREATELIST_LOAD1(TRUE, x0[4], x1[4]) → 5275_0_CREATELIST_LOAD(x0[4], x1[4] + 1)

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



The set Q is empty.

(26) IDependencyGraphProof (EQUIVALENT transformation)

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

(27) TRUE