Termination proof of /tmp/tmp

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 970 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 AND

    ↳5 JBCTerminationSCC

        ↳6 SCCToIDPv1Proof (⇒, 540 ms)

        ↳7 IDP

        ↳8 IDPNonInfProof (⇒, 5410 ms)

        ↳9 AND

            ↳10 IDP

                ↳11 IDependencyGraphProof (⇔, 0 ms)

                ↳12 IDP

                ↳13 IDPNonInfProof (⇒, 570 ms)

                ↳14 AND

                    ↳15 IDP

                        ↳16 IDependencyGraphProof (⇔, 0 ms)

                        ↳17 TRUE

                    ↳18 IDP

                        ↳19 IDependencyGraphProof (⇔, 0 ms)

                        ↳20 TRUE

            ↳21 IDP

                ↳22 IDependencyGraphProof (⇔, 0 ms)

                ↳23 TRUE

    ↳24 JBCTerminationSCC

        ↳25 SCCToIDPv1Proof (⇒, 200 ms)

        ↳26 IDP

        ↳27 IDPNonInfProof (⇒, 500 ms)

        ↳28 AND

            ↳29 IDP

                ↳30 IDependencyGraphProof (⇔, 0 ms)

                ↳31 IDP

                ↳32 IDPNonInfProof (⇒, 200 ms)

                ↳33 AND

                    ↳34 IDP

                        ↳35 IDependencyGraphProof (⇔, 0 ms)

                        ↳36 TRUE

                    ↳37 IDP

                        ↳38 IDependencyGraphProof (⇔, 0 ms)

                        ↳39 TRUE

            ↳40 IDP

                ↳41 IDependencyGraphProof (⇔, 0 ms)

                ↳42 TRUE

    ↳43 JBCTerminationSCC

        ↳44 SCCToIDPv1Proof (⇒, 2790 ms)

        ↳45 IDP

        ↳46 IDPNonInfProof (⇒, 6020 ms)

        ↳47 IDP

        ↳48 IDependencyGraphProof (⇔, 0 ms)

        ↳49 IDP

        ↳50 UsableRulesProof (⇔, 0 ms)

        ↳51 IDP

        ↳52 IDPNonInfProof (⇒, 15.9 s)

        ↳53 IDP

        ↳54 IDependencyGraphProof (⇔, 0 ms)

        ↳55 IDP

        ↳56 IDPNonInfProof (⇒, 1150 ms)

        ↳57 IDP

        ↳58 IDependencyGraphProof (⇔, 0 ms)

        ↳59 TRUE

(0) Obligation:

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

class Queen
{
    static int n;	
    static int [] queen; // position (i,queen[i])
    static int nbsol;

    static void displayChessboard()
    {
	int i,j;

	//System.out.println("");

	for(i=0;i<n;i++) {
	    for(j=0;j<n;j++) {
		if (queen[i]!=j) {} //System.out.print("0");
		else {} //System.out.print("1");
	    }	
	    //System.out.println("");
	}
    }

    static boolean wrongPos(int i1, int j1, int i2, int j2) {
	return (i1==i2 || j1==j2 || i1-i2 == j1-j2 || i1-i2 == j2-j1);
    }

    // Place safely queen i at column j?
    static boolean safeMove(int i, int j) {
	boolean result=true;

	for(int k=0;k<i;k++)
	    result=result&&!wrongPos(i,j,k,queen[k]);

	return result;	
    }

    static boolean search(int row)
    {
	boolean result=false;
	 
	if (row>=n) {
	    displayChessboard();
	    nbsol++; 
	}
	else {	
	    int j=0;
	    while(!result && j<n) {
		if (safeMove(row,j)) {
		    queen[row]=j;
		    result=search(row+1);
		} 
		// Backtracking here
		j++; // explore all columns
	    }	
	}

	return result;	
    }

    public static void main(String [] args)
    {
	n = args.length;
	queen = new int[n];
	nbsol=0;
	search(0);
	//System.out.println("Total number of solutions:"+nbsol);
    }
}

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

Termination Graph based on JBC Program:
Queen.main([Ljava/lang/String;)V: Graph of 60 nodes with 0 SCCs.

Queen.search(I)Z: Graph of 128 nodes with 1 SCC.

Queen.displayChessboard()V: Graph of 63 nodes with 1 SCC.

Queen.safeMove(II)Z: Graph of 74 nodes with 1 SCC.

Queen.wrongPos(IIII)Z: Graph of 38 nodes with 0 SCCs.

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 3 SCCss.

(4) Complex Obligation (AND)

(5) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: Queen.safeMove(II)Z
SCC calls the following helper methods: Queen.wrongPos(IIII)Z
Performed SCC analyses: UsedFieldsAnalysis

(6) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 39 rules for P and 40 rules for R.

P rules:
3343_0_safeMove_Load(EOS(STATIC_3343), i788, i789, i870, i871, i871) → 3349_0_safeMove_GE(EOS(STATIC_3349), i788, i789, i870, i871, i871, i788)
3349_0_safeMove_GE(EOS(STATIC_3349), i788, i789, i870, i871, i871, i788) → 3358_0_safeMove_GE(EOS(STATIC_3358), i788, i789, i870, i871, i871, i788)
3358_0_safeMove_GE(EOS(STATIC_3358), i788, i789, i870, i871, i871, i788) → 3365_0_safeMove_Load(EOS(STATIC_3365), i788, i789, i870, i871) | <(i871, i788)
3365_0_safeMove_Load(EOS(STATIC_3365), i788, i789, i870, i871) → 3374_0_safeMove_EQ(EOS(STATIC_3374), i788, i789, i871, i870)
3374_0_safeMove_EQ(EOS(STATIC_3374), i788, i789, i871, i885) → 3382_0_safeMove_EQ(EOS(STATIC_3382), i788, i789, i871, i885)
3374_0_safeMove_EQ(EOS(STATIC_3374), i788, i789, i871, matching1) → 3383_0_safeMove_EQ(EOS(STATIC_3383), i788, i789, i871, 0) | =(matching1, 0)
3382_0_safeMove_EQ(EOS(STATIC_3382), i788, i789, i871, i885) → 3389_0_safeMove_Load(EOS(STATIC_3389), i788, i789, i871) | >(i885, 0)
3389_0_safeMove_Load(EOS(STATIC_3389), i788, i789, i871) → 3398_0_safeMove_Load(EOS(STATIC_3398), i788, i789, i871, i788)
3398_0_safeMove_Load(EOS(STATIC_3398), i788, i789, i871, i788) → 3406_0_safeMove_Load(EOS(STATIC_3406), i788, i789, i871, i788, i789)
3406_0_safeMove_Load(EOS(STATIC_3406), i788, i789, i871, i788, i789) → 3412_0_safeMove_FieldAccess(EOS(STATIC_3412), i788, i789, i871, i788, i789, i871)
3412_0_safeMove_FieldAccess(EOS(STATIC_3412), i788, i789, i871, i788, i789, i871) → 3420_0_safeMove_Load(EOS(STATIC_3420), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)))
3420_0_safeMove_Load(EOS(STATIC_3420), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790))) → 3427_0_safeMove_ArrayAccess(EOS(STATIC_3427), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3427_0_safeMove_ArrayAccess(EOS(STATIC_3427), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3432_0_safeMove_ArrayAccess(EOS(STATIC_3432), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3432_0_safeMove_ArrayAccess(EOS(STATIC_3432), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3438_0_safeMove_InvokeMethod(EOS(STATIC_3438), i788, i789, i871, i788, i789, i871, i910) | <(i871, i790)
3438_0_safeMove_InvokeMethod(EOS(STATIC_3438), i788, i789, i871, i788, i789, i871, i910) → 3445_1_safeMove_InvokeMethod(3445_0_wrongPos_Load(EOS(STATIC_3445), i788, i789, i871, i910), i788, i789, i871, i788, i789, i871, i910)
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647), matching1), i1021, i1022, i1023, i1021, i1022, i1023, i1024) → 3665_0_wrongPos_Return(EOS(STATIC_3665), i1021, i1022, i1023, i1021, i1022, i1023, i1024, 0) | =(matching1, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654), matching1), i1046, i1047, i1048, i1046, i1047, i1048, i1049) → 3677_0_wrongPos_Return(EOS(STATIC_3677), i1046, i1047, i1048, i1046, i1047, i1048, i1049, 1) | =(matching1, 1)
3665_0_wrongPos_Return(EOS(STATIC_3665), i1021, i1022, i1023, i1021, i1022, i1023, i1024, matching1) → 3666_0_wrongPos_Return(EOS(STATIC_3666), i1021, i1022, i1023, i1021, i1022, i1023, i1024, 0) | =(matching1, 0)
3666_0_wrongPos_Return(EOS(STATIC_3666), i1028, i1029, i1033, i1028, i1029, i1033, i1034, i1032) → 3675_0_safeMove_NE(EOS(STATIC_3675), i1028, i1029, i1033, i1032)
3675_0_safeMove_NE(EOS(STATIC_3675), i1028, i1029, i1033, matching1) → 3680_0_safeMove_NE(EOS(STATIC_3680), i1028, i1029, i1033, 1) | =(matching1, 1)
3675_0_safeMove_NE(EOS(STATIC_3675), i1028, i1029, i1033, matching1) → 3681_0_safeMove_NE(EOS(STATIC_3681), i1028, i1029, i1033, 0) | =(matching1, 0)
3680_0_safeMove_NE(EOS(STATIC_3680), i1028, i1029, i1033, matching1) → 3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686), i1028, i1029, i1033) | &&(>(1, 0), =(matching1, 1))
3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686), i1028, i1029, i1033) → 3694_0_safeMove_Store(EOS(STATIC_3694), i1028, i1029, i1033, 0)
3694_0_safeMove_Store(EOS(STATIC_3694), i1028, i1029, i1033, matching1) → 3702_0_safeMove_Inc(EOS(STATIC_3702), i1028, i1029, 0, i1033) | =(matching1, 0)
3702_0_safeMove_Inc(EOS(STATIC_3702), i1028, i1029, matching1, i1033) → 3710_0_safeMove_JMP(EOS(STATIC_3710), i1028, i1029, 0, +(i1033, 1)) | &&(>=(i1033, 0), =(matching1, 0))
3710_0_safeMove_JMP(EOS(STATIC_3710), i1028, i1029, matching1, i1087) → 3725_0_safeMove_Load(EOS(STATIC_3725), i1028, i1029, 0, i1087) | =(matching1, 0)
3725_0_safeMove_Load(EOS(STATIC_3725), i1028, i1029, matching1, i1087) → 3337_0_safeMove_Load(EOS(STATIC_3337), i1028, i1029, 0, i1087) | =(matching1, 0)
3337_0_safeMove_Load(EOS(STATIC_3337), i788, i789, i870, i871) → 3343_0_safeMove_Load(EOS(STATIC_3343), i788, i789, i870, i871, i871)
3681_0_safeMove_NE(EOS(STATIC_3681), i1028, i1029, i1033, matching1) → 3689_0_safeMove_ConstantStackPush(EOS(STATIC_3689), i1028, i1029, i1033) | =(matching1, 0)
3689_0_safeMove_ConstantStackPush(EOS(STATIC_3689), i1028, i1029, i1033) → 3695_0_safeMove_JMP(EOS(STATIC_3695), i1028, i1029, i1033, 1)
3695_0_safeMove_JMP(EOS(STATIC_3695), i1028, i1029, i1033, matching1) → 3704_0_safeMove_Store(EOS(STATIC_3704), i1028, i1029, i1033, 1) | =(matching1, 1)
3704_0_safeMove_Store(EOS(STATIC_3704), i1028, i1029, i1033, matching1) → 3711_0_safeMove_Inc(EOS(STATIC_3711), i1028, i1029, 1, i1033) | =(matching1, 1)
3711_0_safeMove_Inc(EOS(STATIC_3711), i1028, i1029, matching1, i1033) → 3726_0_safeMove_JMP(EOS(STATIC_3726), i1028, i1029, 1, +(i1033, 1)) | &&(>=(i1033, 0), =(matching1, 1))
3726_0_safeMove_JMP(EOS(STATIC_3726), i1028, i1029, matching1, i1108) → 3731_0_safeMove_Load(EOS(STATIC_3731), i1028, i1029, 1, i1108) | =(matching1, 1)
3731_0_safeMove_Load(EOS(STATIC_3731), i1028, i1029, matching1, i1108) → 3337_0_safeMove_Load(EOS(STATIC_3337), i1028, i1029, 1, i1108) | =(matching1, 1)
3677_0_wrongPos_Return(EOS(STATIC_3677), i1046, i1047, i1048, i1046, i1047, i1048, i1049, matching1) → 3666_0_wrongPos_Return(EOS(STATIC_3666), i1046, i1047, i1048, i1046, i1047, i1048, i1049, 1) | =(matching1, 1)
3383_0_safeMove_EQ(EOS(STATIC_3383), i788, i789, i871, matching1) → 3391_0_safeMove_ConstantStackPush(EOS(STATIC_3391), i788, i789, i871) | =(matching1, 0)
3391_0_safeMove_ConstantStackPush(EOS(STATIC_3391), i788, i789, i871) → 3572_0_safeMove_ConstantStackPush(EOS(STATIC_3572), i788, i789, i871)
3572_0_safeMove_ConstantStackPush(EOS(STATIC_3572), i968, i969, i972) → 3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686), i968, i969, i972)
R rules:
3445_0_wrongPos_Load(EOS(STATIC_3445), i788, i789, i871, i910) → 3451_0_wrongPos_Load(EOS(STATIC_3451), i788, i789, i871, i910)
3451_0_wrongPos_Load(EOS(STATIC_3451), i788, i789, i871, i910) → 3468_0_wrongPos_Load(EOS(STATIC_3468), i788, i789, i871, i910)
3468_0_wrongPos_Load(EOS(STATIC_3468), i926, i927, i928, i929) → 3472_0_wrongPos_Load(EOS(STATIC_3472), i926, i927, i928, i929, i926)
3472_0_wrongPos_Load(EOS(STATIC_3472), i926, i927, i928, i929, i926) → 3478_0_wrongPos_EQ(EOS(STATIC_3478), i926, i927, i928, i929, i926, i928)
3478_0_wrongPos_EQ(EOS(STATIC_3478), i928, i927, i928, i929, i928, i928) → 3482_0_wrongPos_EQ(EOS(STATIC_3482), i928, i927, i928, i929, i928, i928)
3478_0_wrongPos_EQ(EOS(STATIC_3478), i926, i927, i928, i929, i926, i928) → 3483_0_wrongPos_EQ(EOS(STATIC_3483), i926, i927, i928, i929, i926, i928)
3482_0_wrongPos_EQ(EOS(STATIC_3482), i928, i927, i928, i929, i928, i928) → 3487_0_wrongPos_ConstantStackPush(EOS(STATIC_3487))
3483_0_wrongPos_EQ(EOS(STATIC_3483), i926, i927, i928, i929, i926, i928) → 3488_0_wrongPos_Load(EOS(STATIC_3488), i926, i927, i928, i929) | !(=(i926, i928))
3487_0_wrongPos_ConstantStackPush(EOS(STATIC_3487)) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583))
3488_0_wrongPos_Load(EOS(STATIC_3488), i926, i927, i928, i929) → 3495_0_wrongPos_Load(EOS(STATIC_3495), i926, i927, i928, i929, i927)
3495_0_wrongPos_Load(EOS(STATIC_3495), i926, i927, i928, i929, i927) → 3502_0_wrongPos_EQ(EOS(STATIC_3502), i926, i927, i928, i929, i927, i929)
3502_0_wrongPos_EQ(EOS(STATIC_3502), i926, i929, i928, i929, i929, i929) → 3507_0_wrongPos_EQ(EOS(STATIC_3507), i926, i929, i928, i929, i929, i929)
3502_0_wrongPos_EQ(EOS(STATIC_3502), i926, i927, i928, i929, i927, i929) → 3508_0_wrongPos_EQ(EOS(STATIC_3508), i926, i927, i928, i929, i927, i929)
3507_0_wrongPos_EQ(EOS(STATIC_3507), i926, i929, i928, i929, i929, i929) → 3517_0_wrongPos_ConstantStackPush(EOS(STATIC_3517))
3508_0_wrongPos_EQ(EOS(STATIC_3508), i926, i927, i928, i929, i927, i929) → 3519_0_wrongPos_Load(EOS(STATIC_3519), i926, i927, i928, i929) | !(=(i927, i929))
3517_0_wrongPos_ConstantStackPush(EOS(STATIC_3517)) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583))
3519_0_wrongPos_Load(EOS(STATIC_3519), i926, i927, i928, i929) → 3527_0_wrongPos_Load(EOS(STATIC_3527), i926, i927, i928, i929, i926)
3527_0_wrongPos_Load(EOS(STATIC_3527), i926, i927, i928, i929, i926) → 3532_0_wrongPos_IntArithmetic(EOS(STATIC_3532), i926, i927, i928, i929, i926, i928)
3532_0_wrongPos_IntArithmetic(EOS(STATIC_3532), i926, i927, i928, i929, i926, i928) → 3540_0_wrongPos_Load(EOS(STATIC_3540), i926, i927, i928, i929, -(i926, i928))
3540_0_wrongPos_Load(EOS(STATIC_3540), i926, i927, i928, i929, i959) → 3548_0_wrongPos_Load(EOS(STATIC_3548), i926, i927, i928, i929, i959, i927)
3548_0_wrongPos_Load(EOS(STATIC_3548), i926, i927, i928, i929, i959, i927) → 3557_0_wrongPos_IntArithmetic(EOS(STATIC_3557), i926, i927, i928, i929, i959, i927, i929)
3557_0_wrongPos_IntArithmetic(EOS(STATIC_3557), i926, i927, i928, i929, i959, i927, i929) → 3564_0_wrongPos_EQ(EOS(STATIC_3564), i926, i927, i928, i929, i959, -(i927, i929))
3564_0_wrongPos_EQ(EOS(STATIC_3564), i926, i927, i928, i929, i975, i975) → 3574_0_wrongPos_EQ(EOS(STATIC_3574), i926, i927, i928, i929, i975, i975)
3564_0_wrongPos_EQ(EOS(STATIC_3564), i926, i927, i928, i929, i959, i975) → 3575_0_wrongPos_EQ(EOS(STATIC_3575), i926, i927, i928, i929, i959, i975)
3574_0_wrongPos_EQ(EOS(STATIC_3574), i926, i927, i928, i929, i975, i975) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583))
3575_0_wrongPos_EQ(EOS(STATIC_3575), i926, i927, i928, i929, i959, i975) → 3584_0_wrongPos_Load(EOS(STATIC_3584), i926, i927, i928, i929) | !(=(i959, i975))
3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583)) → 3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643))
3584_0_wrongPos_Load(EOS(STATIC_3584), i926, i927, i928, i929) → 3596_0_wrongPos_Load(EOS(STATIC_3596), i927, i928, i929, i926)
3596_0_wrongPos_Load(EOS(STATIC_3596), i927, i928, i929, i926) → 3603_0_wrongPos_IntArithmetic(EOS(STATIC_3603), i927, i929, i926, i928)
3603_0_wrongPos_IntArithmetic(EOS(STATIC_3603), i927, i929, i926, i928) → 3611_0_wrongPos_Load(EOS(STATIC_3611), i927, i929, -(i926, i928))
3611_0_wrongPos_Load(EOS(STATIC_3611), i927, i929, i1002) → 3618_0_wrongPos_Load(EOS(STATIC_3618), i927, i1002, i929)
3618_0_wrongPos_Load(EOS(STATIC_3618), i927, i1002, i929) → 3623_0_wrongPos_IntArithmetic(EOS(STATIC_3623), i1002, i929, i927)
3623_0_wrongPos_IntArithmetic(EOS(STATIC_3623), i1002, i929, i927) → 3629_0_wrongPos_NE(EOS(STATIC_3629), i1002, -(i929, i927))
3629_0_wrongPos_NE(EOS(STATIC_3629), i1002, i1016) → 3635_0_wrongPos_NE(EOS(STATIC_3635), i1002, i1016)
3629_0_wrongPos_NE(EOS(STATIC_3629), i1016, i1016) → 3636_0_wrongPos_NE(EOS(STATIC_3636), i1016, i1016)
3635_0_wrongPos_NE(EOS(STATIC_3635), i1002, i1016) → 3641_0_wrongPos_ConstantStackPush(EOS(STATIC_3641)) | !(=(i1002, i1016))
3636_0_wrongPos_NE(EOS(STATIC_3636), i1016, i1016) → 3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643))
3641_0_wrongPos_ConstantStackPush(EOS(STATIC_3641)) → 3647_0_wrongPos_Return(EOS(STATIC_3647), 0)
3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643)) → 3648_0_wrongPos_JMP(EOS(STATIC_3648), 1)
3648_0_wrongPos_JMP(EOS(STATIC_3648), matching1) → 3654_0_wrongPos_Return(EOS(STATIC_3654), 1) | =(matching1, 1)

Combined rules. Obtained 6 conditional rules for P and 5 conditional rules for R.

P rules:
3343_0_safeMove_Load(EOS(STATIC_3343), x0, x1, x2, x3, x3) → 3445_1_safeMove_InvokeMethod(3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x1, x3, x4), x0, x1, x3, x0, x1, x3, x4) | &&(<(x3, x0), >(x2, 0))
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647), 0), x1, x2, x3, x1, x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675), x1, x2, x3, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654), 1), x1, x2, x3, x1, x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675), x1, x2, x3, 1)
3675_0_safeMove_NE(EOS(STATIC_3675), x0, x1, x2, 1) → 3343_0_safeMove_Load(EOS(STATIC_3343), x0, x1, 0, +(x2, 1), +(x2, 1)) | >(+(x2, 1), 0)
3675_0_safeMove_NE(EOS(STATIC_3675), x0, x1, x2, 0) → 3343_0_safeMove_Load(EOS(STATIC_3343), x0, x1, 1, +(x2, 1), +(x2, 1)) | >(+(x2, 1), 0)
3343_0_safeMove_Load(EOS(STATIC_3343), x0, x1, 0, x3, x3) → 3343_0_safeMove_Load(EOS(STATIC_3343), x0, x1, 0, +(x3, 1), +(x3, 1)) | &&(>(+(x3, 1), 0), <(x3, x0))
R rules:
3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x1, x2, x3) → 3647_0_wrongPos_Return(EOS(STATIC_3647), 0) | &&(&&(&&(!(=(x1, x3)), !(=(x0, x2))), !(=(-(x0, x2), -(x3, x1)))), !(=(-(x0, x2), -(x1, x3))))
3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x1, x0, x2) → 3654_0_wrongPos_Return(EOS(STATIC_3654), 1)
3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x1, x2, x1) → 3654_0_wrongPos_Return(EOS(STATIC_3654), 1) | !(=(x0, x2))
3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x0, x1, x1) → 3654_0_wrongPos_Return(EOS(STATIC_3654), 1) | !(=(x0, x1))
3445_0_wrongPos_Load(EOS(STATIC_3445), x0, x1, x1, x0) → 3654_0_wrongPos_Return(EOS(STATIC_3654), 1) | &&(&&(!(=(x1, x0)), !(=(x0, x1))), !(=(-(x0, x1), -(x1, x0))))

Filtered ground terms:

3343_0_safeMove_Load(x1, x2, x3, x4, x5, x6) → 3343_0_safeMove_Load(x2, x3, x4, x5, x6)
Cond_3343_0_safeMove_Load1(x1, x2, x3, x4, x5, x6, x7) → Cond_3343_0_safeMove_Load1(x1, x3, x4, x6, x7)
Cond_3675_0_safeMove_NE1(x1, x2, x3, x4, x5, x6) → Cond_3675_0_safeMove_NE1(x1, x3, x4, x5)
3675_0_safeMove_NE(x1, x2, x3, x4, x5) → 3675_0_safeMove_NE(x2, x3, x4, x5)
Cond_3675_0_safeMove_NE(x1, x2, x3, x4, x5, x6) → Cond_3675_0_safeMove_NE(x1, x3, x4, x5)
3654_0_wrongPos_Return(x1, x2) → 3654_0_wrongPos_Return
3647_0_wrongPos_Return(x1, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x1, x2, x3, x4, x5) → 3445_0_wrongPos_Load(x2, x3, x4, x5)
Cond_3343_0_safeMove_Load(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3343_0_safeMove_Load(x1, x3, x4, x5, x6, x7, x8)
Cond_3445_0_wrongPos_Load3(x1, x2, x3, x4, x5, x6) → Cond_3445_0_wrongPos_Load3(x1, x3, x4, x5, x6)
Cond_3445_0_wrongPos_Load2(x1, x2, x3, x4, x5, x6) → Cond_3445_0_wrongPos_Load2(x1, x3, x4, x5, x6)
Cond_3445_0_wrongPos_Load1(x1, x2, x3, x4, x5, x6) → Cond_3445_0_wrongPos_Load1(x1, x3, x4, x5, x6)
Cond_3445_0_wrongPos_Load(x1, x2, x3, x4, x5, x6) → Cond_3445_0_wrongPos_Load(x1, x3, x4, x5, x6)

Filtered duplicate args:

3343_0_safeMove_Load(x1, x2, x3, x4, x5) → 3343_0_safeMove_Load(x1, x2, x3, x5)
Cond_3343_0_safeMove_Load(x1, x2, x3, x4, x5, x6, x7) → Cond_3343_0_safeMove_Load(x1, x2, x3, x4, x6, x7)
3445_1_safeMove_InvokeMethod(x1, x2, x3, x4, x5, x6, x7, x8) → 3445_1_safeMove_InvokeMethod(x1, x5, x6, x7, x8)
Cond_3343_0_safeMove_Load1(x1, x2, x3, x4, x5) → Cond_3343_0_safeMove_Load1(x1, x2, x3, x5)
Cond_3445_0_wrongPos_Load1(x1, x2, x3, x4, x5) → Cond_3445_0_wrongPos_Load1(x1, x2, x4, x5)
Cond_3445_0_wrongPos_Load2(x1, x2, x3, x4, x5) → Cond_3445_0_wrongPos_Load2(x1, x3, x5)
Cond_3445_0_wrongPos_Load3(x1, x2, x3, x4, x5) → Cond_3445_0_wrongPos_Load3(x1, x4, x5)

Filtered unneeded arguments:

Cond_3343_0_safeMove_Load(x1, x2, x3, x4, x5, x6) → Cond_3343_0_safeMove_Load(x1, x2, x3, x5, x6)
3445_1_safeMove_InvokeMethod(x1, x2, x3, x4, x5) → 3445_1_safeMove_InvokeMethod(x1, x2, x3, x4)
Cond_3445_0_wrongPos_Load(x1, x2, x3, x4, x5) → Cond_3445_0_wrongPos_Load(x1)
Cond_3445_0_wrongPos_Load1(x1, x2, x3, x4) → Cond_3445_0_wrongPos_Load1(x1)
Cond_3445_0_wrongPos_Load2(x1, x2, x3) → Cond_3445_0_wrongPos_Load2(x1)
Cond_3445_0_wrongPos_Load3(x1, x2, x3) → Cond_3445_0_wrongPos_Load3(x1)

Combined rules. Obtained 6 conditional rules for P and 5 conditional rules for R.

P rules:
3343_0_safeMove_Load(x0, x1, x2, x3) → 3445_1_safeMove_InvokeMethod(3445_0_wrongPos_Load(x0, x1, x3, x4), x0, x1, x3) | &&(<(x3, x0), >(x2, 0))
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_safeMove_NE(x1, x2, x3, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return, x1, x2, x3) → 3675_0_safeMove_NE(x1, x2, x3, 1)
3675_0_safeMove_NE(x0, x1, x2, 1) → 3343_0_safeMove_Load(x0, x1, 0, +(x2, 1)) | >(x2, -1)
3675_0_safeMove_NE(x0, x1, x2, 0) → 3343_0_safeMove_Load(x0, x1, 1, +(x2, 1)) | >(x2, -1)
3343_0_safeMove_Load(x0, x1, 0, x3) → 3343_0_safeMove_Load(x0, x1, 0, +(x3, 1)) | &&(>(x3, -1), <(x3, x0))
R rules:
3445_0_wrongPos_Load(x0, x1, x2, x3) → 3647_0_wrongPos_Return | &&(&&(&&(!(=(x1, x3)), !(=(x0, x2))), !(=(-(x0, x2), -(x3, x1)))), !(=(-(x0, x2), -(x1, x3))))
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3654_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → 3654_0_wrongPos_Return | !(=(x0, x2))
3445_0_wrongPos_Load(x0, x0, x1, x1) → 3654_0_wrongPos_Return | !(=(x0, x1))
3445_0_wrongPos_Load(x0, x1, x1, x0) → 3654_0_wrongPos_Return | &&(&&(!(=(x1, x0)), !(=(x0, x1))), !(=(-(x0, x1), -(x1, x0))))

Performed bisimulation on rules. Used the following equivalence classes: {[Cond_3445_0_wrongPos_Load1_5, Cond_3445_0_wrongPos_Load2_5]=Cond_3445_0_wrongPos_Load1_5, [3647_0_wrongPos_Return, 3654_0_wrongPos_Return]=3647_0_wrongPos_Return}

Finished conversion. Obtained 10 rules for P and 9 rules for R. System has predefined symbols.

P rules:
3343_0_SAFEMOVE_LOAD(x0, x1, x2, x3) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3, x0), >(x2, 0)), x0, x1, x2, x3, x4)
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0, x1, x2, x3, x4) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0, x1, x3, x4), x0, x1, x3)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 0)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 1)
3675_0_SAFEMOVE_NE(x0, x1, x2, 1) → COND_3675_0_SAFEMOVE_NE(>(x2, -1), x0, x1, x2, 1)
COND_3675_0_SAFEMOVE_NE(TRUE, x0, x1, x2, 1) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x2, 1))
3675_0_SAFEMOVE_NE(x0, x1, x2, 0) → COND_3675_0_SAFEMOVE_NE1(>(x2, -1), x0, x1, x2, 0)
COND_3675_0_SAFEMOVE_NE1(TRUE, x0, x1, x2, 0) → 3343_0_SAFEMOVE_LOAD(x0, x1, 1, +(x2, 1))
3343_0_SAFEMOVE_LOAD(x0, x1, 0, x3) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3, -1), <(x3, x0)), x0, x1, 0, x3)
COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0, x1, 0, x3) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x3, 1))
R rules:
3445_0_wrongPos_Load(x0, x1, x2, x3) → Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x1, x3)), !(=(x0, x2))), !(=(-(x0, x2), -(x3, x1)))), !(=(-(x0, x2), -(x1, x3)))), x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → Cond_3445_0_wrongPos_Load1(!(=(x0, x2)), x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x0, x1, x1) → Cond_3445_0_wrongPos_Load1(!(=(x0, x1)), x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x1, x0) → Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x1, x0)), !(=(x0, x1))), !(=(-(x0, x1), -(x1, x0)))), x0, x1, x1, x0)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0) → 3647_0_wrongPos_Return

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

Boolean, Integer

The ITRS R consists of the following rules:
3445_0_wrongPos_Load(x0, x1, x2, x3) → Cond_3445_0_wrongPos_Load(!(x1 = x3) && !(x0 = x2) && !(x0 - x2 = x3 - x1) && !(x0 - x2 = x1 - x3), x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x2), x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x0, x1, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x1), x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x1, x0) → Cond_3445_0_wrongPos_Load3(!(x1 = x0) && !(x0 = x1) && !(x0 - x1 = x1 - x0), x0, x1, x1, x0)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0) → 3647_0_wrongPos_Return

The integer pair graph contains the following rules and edges:
(0): 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(x3[0] < x0[0] && x2[0] > 0, x0[0], x1[0], x2[0], x3[0], x4[0])
(1): COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
(2): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
(3): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)
(4): 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(x2[4] > -1, x0[4], x1[4], x2[4], 1)
(5): COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, x2[5] + 1)
(6): 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(x2[6] > -1, x0[6], x1[6], x2[6], 0)
(7): COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, x2[7] + 1)
(8): 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(x3[8] > -1 && x3[8] < x0[8], x0[8], x1[8], 0, x3[8])
(9): COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, x3[9] + 1)

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

(1) -> (2), if (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]) →^* 3647_0_wrongPos_Return∧x0[1] →^* x1[2]∧x1[1] →^* x2[2]∧x3[1] →^* x3[2])

(1) -> (3), if (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]) →^* 3647_0_wrongPos_Return∧x0[1] →^* x1[3]∧x1[1] →^* x2[3]∧x3[1] →^* x3[3])

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

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

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

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

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

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

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

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

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

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

(8) -> (9), if (x3[8] > -1 && x3[8] < x0[8] ∧x0[8] →^* x0[9]∧x1[8] →^* x1[9]∧x3[8] →^* x3[9])

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

(9) -> (8), if (x0[9] →^* x0[8]∧x1[9] →^* x1[8]∧x3[9] + 1 →^* x3[8])

The set Q consists of the following terms:
3445_0_wrongPos_Load(x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0)

(8) IDPNonInfProof (SOUND transformation)

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

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

For Pair 3343_0_SAFEMOVE_LOAD(x0, x1, x2, x3) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3, x0), >(x2, 0)), x0, x1, x2, x3, x4) the following chains were created:

We consider the chain COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]) which results in the following constraint:
(1) (x0[5]=x0[0]∧x1[5]=x1[0]∧0=x2[0]∧+(x2[5], 1)=x3[0]∧&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1] ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We solved constraint (1) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (IDP_BOOLEAN).
We consider the chain COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]) which results in the following constraint:
(2)    (x0[7]=x0[0]∧x1[7]=x1[0]∧1=x2[0]∧+(x2[7], 1)=x3[0]∧&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1] ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We simplified constraint (2) using rules (III), (IV), (IDP_CONSTANT_FOLD), (DELETE_TRIVIAL_REDUCESTO), (IDP_BOOLEAN) which results in the following new constraint:
(3)    (<(+(x2[7], 1), x0[0])=TRUE ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[7], 1, +(x2[7], 1))≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[7], 1, +(x2[7], 1))≥COND_3343_0_SAFEMOVE_LOAD(&&(<(+(x2[7], 1), x0[0]), >(1, 0)), x0[0], x1[7], 1, +(x2[7], 1), x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We simplified constraint (3) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(4)    (x0[0] + [-2] + [-1]x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[(-2)bni_72 + (-1)Bound*bni_72] + [(-1)bni_72]x2[7] + [bni_72]x0[0] ≥ 0∧[(-1)bso_73] ≥ 0)

We simplified constraint (4) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(5)    (x0[0] + [-2] + [-1]x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[(-2)bni_72 + (-1)Bound*bni_72] + [(-1)bni_72]x2[7] + [bni_72]x0[0] ≥ 0∧[(-1)bso_73] ≥ 0)

We simplified constraint (5) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(6)    (x0[0] + [-2] + [-1]x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[(-2)bni_72 + (-1)Bound*bni_72] + [(-1)bni_72]x2[7] + [bni_72]x0[0] ≥ 0∧[(-1)bso_73] ≥ 0)

We simplified constraint (6) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(7)    (x0[0] + [-2] + [-1]x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-2)bni_72 + (-1)Bound*bni_72] + [(-1)bni_72]x2[7] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)

We simplified constraint (7) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(8)    (x0[0] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-1)Bound*bni_72] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)

We simplified constraint (8) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(9)    (x0[0] ≥ 0∧x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-1)Bound*bni_72] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)

(10)    (x0[0] ≥ 0∧x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-1)Bound*bni_72] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)
We consider the chain COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]) which results in the following constraint:
(11) (x0[9]=x0[0]∧x1[9]=x1[0]∧0=x2[0]∧+(x3[9], 1)=x3[0]∧&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1] ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We solved constraint (11) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (IDP_BOOLEAN).

For Pair COND_3343_0_SAFEMOVE_LOAD(TRUE, x0, x1, x2, x3, x4) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0, x1, x3, x4), x0, x1, x3) the following chains were created:

We consider the chain 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0) which results in the following constraint:
(12)    (&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1]∧3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[2]∧x1[1]=x2[2]∧x3[1]=x3[2] ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (12) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(13)    (3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return∧<(x3[0], x0[0])=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1]), x0[0], x1[1], x3[0])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (13) using rule (V) (with possible (I) afterwards) using induction on 3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return which results in the following new constraints:
(14)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x2, x0)), !(=(x3, x1))), !(=(-(x3, x1), -(x0, x2)))), !(=(-(x3, x1), -(x2, x0)))), x3, x2, x1, x0)=3647_0_wrongPos_Return∧<(x1, x3)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x3, x2, x1, x0), x3, x2, x1)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(15)    (3647_0_wrongPos_Return=3647_0_wrongPos_Return∧<(x5, x5)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x5, x6, x5, x4), x5, x6, x5)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(16)    (Cond_3445_0_wrongPos_Load1(!(=(x9, x8)), x9, x7, x8, x7)=3647_0_wrongPos_Return∧<(x8, x9)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x7, x2[0], x8, x7)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x7, x2[0], x8, x7)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x9, x7, x8, x7), x9, x7, x8)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(17)    (Cond_3445_0_wrongPos_Load1(!(=(x11, x10)), x11, x11, x10, x10)=3647_0_wrongPos_Return∧<(x10, x11)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x11, x11, x2[0], x10, x10)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x11, x11, x2[0], x10, x10)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x11, x11, x10, x10), x11, x11, x10)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(18)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x13, x12)), !(=(x12, x13))), !(=(-(x12, x13), -(x13, x12)))), x12, x13, x13, x12)=3647_0_wrongPos_Return∧<(x13, x12)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x12, x13, x2[0], x13, x12)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x12, x13, x2[0], x13, x12)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x12, x13, x13, x12), x12, x13, x13)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (14) using rules (III), (VII) which results in the following new constraint:
(19)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x2, x0)), !(=(x3, x1))), !(=(-(x3, x1), -(x0, x2)))), !(=(-(x3, x1), -(x2, x0)))), x3, x2, x1, x0)=3647_0_wrongPos_Return∧<(x1, x3)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x3, x2, x1, x0), x3, x2, x1)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (15) using rules (I), (II) which results in the following new constraint:
(20)    (<(x5, x5)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x5, x6, x5, x4), x5, x6, x5)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (16) using rules (III), (VII) which results in the following new constraint:
(21)    (Cond_3445_0_wrongPos_Load1(!(=(x9, x8)), x9, x16, x8, x16)=3647_0_wrongPos_Return∧<(x8, x9)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x16, x2[0], x8, x16)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x16, x2[0], x8, x16)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x9, x16, x8, x16), x9, x16, x8)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (17) using rules (III), (VII) which results in the following new constraint:
(22)    (Cond_3445_0_wrongPos_Load1(!(=(x18, x19)), x18, x18, x19, x19)=3647_0_wrongPos_Return∧<(x19, x18)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x18, x18, x2[0], x19, x19)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x18, x18, x2[0], x19, x19)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x18, x18, x19, x19), x18, x18, x19)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (18) using rules (III), (VII) which results in the following new constraint:
(23)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x21, x22)), !(=(x22, x21))), !(=(-(x22, x21), -(x21, x22)))), x22, x21, x21, x22)=3647_0_wrongPos_Return∧<(x21, x22)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x22, x21, x2[0], x21, x22)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x22, x21, x2[0], x21, x22)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x22, x21, x21, x22), x22, x21, x21)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (20) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(24)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (19) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(25)    (x3 + [-1] + [-1]x1 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x1 + [bni_74]x3 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (21) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(26)    (x9 + [-1] + [-1]x8 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x8 + [bni_74]x9 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (22) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    (x18 + [-1] + [-1]x19 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x19 + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (23) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(28)    (x22 + [-1] + [-1]x21 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x22 + [(-1)bni_74]x21 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (24) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(29)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (25) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(30)    (x3 + [-1] + [-1]x1 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x1 + [bni_74]x3 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (26) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(31)    (x9 + [-1] + [-1]x8 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x8 + [bni_74]x9 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(32)    (x18 + [-1] + [-1]x19 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x19 + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (28) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(33)    (x22 + [-1] + [-1]x21 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x22 + [(-1)bni_74]x21 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (29) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(34)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (30) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(35)    (x3 + [-1] + [-1]x1 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x1 + [bni_74]x3 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (31) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(36)    (x9 + [-1] + [-1]x8 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x8 + [bni_74]x9 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (32) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(37)    (x18 + [-1] + [-1]x19 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x19 + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (33) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(38)    (x22 + [-1] + [-1]x21 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x22 + [(-1)bni_74]x21 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (34) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(39)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (35) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(40)    (x3 + [-1] + [-1]x1 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x1 + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (36) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(41)    (x9 + [-1] + [-1]x8 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x8 + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (37) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(42)    (x18 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (38) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(43)    (x22 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)

We solved constraint (39) using rule (IDP_SMT_SPLIT).We simplified constraint (40) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(44)    (x3 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (44) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(45)    (x3 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (45) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(46)    (x3 ≥ 0∧x2[0] ≥ 0∧x1 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

(47)    (x3 ≥ 0∧x2[0] ≥ 0∧x1 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (41) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(48)    (x9 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (48) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(49)    (x9 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (49) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(50)    (x9 ≥ 0∧x2[0] ≥ 0∧x8 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

(51)    (x9 ≥ 0∧x2[0] ≥ 0∧x8 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (42) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(52)    (x18 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (52) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(53)    (x18 ≥ 0∧x2[0] ≥ 0∧x19 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

(54)    (x18 ≥ 0∧x2[0] ≥ 0∧x19 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (43) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(55)    (x22 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (55) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(56)    (x22 ≥ 0∧x2[0] ≥ 0∧x21 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)

(57)    (x22 ≥ 0∧x2[0] ≥ 0∧x21 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)
We consider the chain 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1) which results in the following constraint:
(58)    (&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1]∧3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[3]∧x1[1]=x2[3]∧x3[1]=x3[3] ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (58) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(59)    (3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return∧<(x3[0], x0[0])=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1]), x0[0], x1[1], x3[0])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (59) using rule (V) (with possible (I) afterwards) using induction on 3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return which results in the following new constraints:
(60)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x25, x23)), !(=(x26, x24))), !(=(-(x26, x24), -(x23, x25)))), !(=(-(x26, x24), -(x25, x23)))), x26, x25, x24, x23)=3647_0_wrongPos_Return∧<(x24, x26)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x26, x25, x2[0], x24, x23)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x26, x25, x2[0], x24, x23)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x26, x25, x24, x23), x26, x25, x24)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(61)    (3647_0_wrongPos_Return=3647_0_wrongPos_Return∧<(x28, x28)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x28, x29, x2[0], x28, x27)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x28, x29, x2[0], x28, x27)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x28, x29, x28, x27), x28, x29, x28)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(62)    (Cond_3445_0_wrongPos_Load1(!(=(x32, x31)), x32, x30, x31, x30)=3647_0_wrongPos_Return∧<(x31, x32)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x32, x30, x2[0], x31, x30)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x32, x30, x2[0], x31, x30)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x32, x30, x31, x30), x32, x30, x31)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(63)    (Cond_3445_0_wrongPos_Load1(!(=(x34, x33)), x34, x34, x33, x33)=3647_0_wrongPos_Return∧<(x33, x34)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x34, x34, x2[0], x33, x33)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x34, x34, x2[0], x33, x33)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x34, x34, x33, x33), x34, x34, x33)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(64)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x36, x35)), !(=(x35, x36))), !(=(-(x35, x36), -(x36, x35)))), x35, x36, x36, x35)=3647_0_wrongPos_Return∧<(x36, x35)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x35, x36, x2[0], x36, x35)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x35, x36, x2[0], x36, x35)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x35, x36, x36, x35), x35, x36, x36)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (60) using rules (III), (VII) which results in the following new constraint:
(65)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x25, x23)), !(=(x26, x24))), !(=(-(x26, x24), -(x23, x25)))), !(=(-(x26, x24), -(x25, x23)))), x26, x25, x24, x23)=3647_0_wrongPos_Return∧<(x24, x26)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x26, x25, x2[0], x24, x23)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x26, x25, x2[0], x24, x23)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x26, x25, x24, x23), x26, x25, x24)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (61) using rules (I), (II) which results in the following new constraint:
(66)    (<(x28, x28)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x28, x29, x2[0], x28, x27)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x28, x29, x2[0], x28, x27)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x28, x29, x28, x27), x28, x29, x28)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (62) using rules (III), (VII) which results in the following new constraint:
(67)    (Cond_3445_0_wrongPos_Load1(!(=(x32, x31)), x32, x39, x31, x39)=3647_0_wrongPos_Return∧<(x31, x32)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x32, x39, x2[0], x31, x39)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x32, x39, x2[0], x31, x39)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x32, x39, x31, x39), x32, x39, x31)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (63) using rules (III), (VII) which results in the following new constraint:
(68)    (Cond_3445_0_wrongPos_Load1(!(=(x41, x42)), x41, x41, x42, x42)=3647_0_wrongPos_Return∧<(x42, x41)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x41, x41, x2[0], x42, x42)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x41, x41, x2[0], x42, x42)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x41, x41, x42, x42), x41, x41, x42)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (64) using rules (III), (VII) which results in the following new constraint:
(69)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x44, x45)), !(=(x45, x44))), !(=(-(x45, x44), -(x44, x45)))), x45, x44, x44, x45)=3647_0_wrongPos_Return∧<(x44, x45)=TRUE∧>(x2[0], 0)=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x45, x44, x2[0], x44, x45)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x45, x44, x2[0], x44, x45)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x45, x44, x44, x45), x45, x44, x44)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (66) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(70)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (65) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(71)    (x26 + [-1] + [-1]x24 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x24 + [bni_74]x26 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (67) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(72)    (x32 + [-1] + [-1]x31 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x31 + [bni_74]x32 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (68) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(73)    (x41 + [-1] + [-1]x42 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x42 + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (69) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(74)    (x45 + [-1] + [-1]x44 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x45 + [(-1)bni_74]x44 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (70) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(75)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (71) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(76)    (x26 + [-1] + [-1]x24 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x24 + [bni_74]x26 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (72) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(77)    (x32 + [-1] + [-1]x31 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x31 + [bni_74]x32 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (73) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(78)    (x41 + [-1] + [-1]x42 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x42 + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (74) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(79)    (x45 + [-1] + [-1]x44 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x45 + [(-1)bni_74]x44 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (75) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(80)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (76) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(81)    (x26 + [-1] + [-1]x24 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x24 + [bni_74]x26 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (77) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(82)    (x32 + [-1] + [-1]x31 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x31 + [bni_74]x32 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (78) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(83)    (x41 + [-1] + [-1]x42 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x42 + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (79) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(84)    (x45 + [-1] + [-1]x44 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_74 + (-1)Bound*bni_74] + [bni_74]x45 + [(-1)bni_74]x44 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (80) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(85)    ([-1] ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (81) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(86)    (x26 + [-1] + [-1]x24 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x24 + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (82) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(87)    (x32 + [-1] + [-1]x31 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)bni_74 + (-1)Bound*bni_74] + [(-1)bni_74]x31 + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (83) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(88)    (x41 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (84) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(89)    (x45 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)

We solved constraint (85) using rule (IDP_SMT_SPLIT).We simplified constraint (86) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(90)    (x26 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (90) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(91)    (x26 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (91) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(92)    (x26 ≥ 0∧x2[0] ≥ 0∧x24 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

(93)    (x26 ≥ 0∧x2[0] ≥ 0∧x24 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (87) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(94)    (x32 ≥ 0∧x2[0] + [-1] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (94) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(95)    (x32 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (95) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(96)    (x32 ≥ 0∧x2[0] ≥ 0∧x31 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

(97)    (x32 ≥ 0∧x2[0] ≥ 0∧x31 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (88) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(98)    (x41 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (98) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(99)    (x41 ≥ 0∧x2[0] ≥ 0∧x42 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

(100)    (x41 ≥ 0∧x2[0] ≥ 0∧x42 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (89) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(101)    (x45 ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)

We simplified constraint (101) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(102)    (x45 ≥ 0∧x2[0] ≥ 0∧x44 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)

(103)    (x45 ≥ 0∧x2[0] ≥ 0∧x44 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)

For Pair 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 0) the following chains were created:

We consider the chain COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0), 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1) which results in the following constraint:
(104) (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[2]∧x1[1]=x2[2]∧x3[1]=x3[2]∧x1[2]=x0[4]∧x2[2]=x1[4]∧x3[2]=x2[4]∧0=1 ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We solved constraint (104) using rules (I), (II).
We consider the chain COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0), 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0) which results in the following constraint:
(105)    (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[2]∧x1[1]=x2[2]∧x3[1]=x3[2]∧x1[2]=x0[6]∧x2[2]=x1[6]∧x3[2]=x2[6] ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (105) using rules (III), (IV) which results in the following new constraint:
(106)    (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x0[1], x1[1], x3[1])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x0[1], x1[1], x3[1])≥3675_0_SAFEMOVE_NE(x0[1], x1[1], x3[1], 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (106) using rule (V) (with possible (I) afterwards) using induction on 3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return which results in the following new constraints:
(107)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x48, x46)), !(=(x49, x47))), !(=(-(x49, x47), -(x46, x48)))), !(=(-(x49, x47), -(x48, x46)))), x49, x48, x47, x46)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x49, x48, x47)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x49, x48, x47)≥3675_0_SAFEMOVE_NE(x49, x48, x47, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

(108)    (3647_0_wrongPos_Return=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x51, x52, x51)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x51, x52, x51)≥3675_0_SAFEMOVE_NE(x51, x52, x51, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

(109)    (Cond_3445_0_wrongPos_Load1(!(=(x55, x54)), x55, x53, x54, x53)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x55, x53, x54)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x55, x53, x54)≥3675_0_SAFEMOVE_NE(x55, x53, x54, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

(110)    (Cond_3445_0_wrongPos_Load1(!(=(x57, x56)), x57, x57, x56, x56)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x57, x57, x56)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x57, x57, x56)≥3675_0_SAFEMOVE_NE(x57, x57, x56, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

(111)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x59, x58)), !(=(x58, x59))), !(=(-(x58, x59), -(x59, x58)))), x58, x59, x59, x58)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x58, x59, x59)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x58, x59, x59)≥3675_0_SAFEMOVE_NE(x58, x59, x59, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (107) using rules (III), (VII) which results in the following new constraint:
(112)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x48, x46)), !(=(x49, x47))), !(=(-(x49, x47), -(x46, x48)))), !(=(-(x49, x47), -(x48, x46)))), x49, x48, x47, x46)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x49, x48, x47)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x49, x48, x47)≥3675_0_SAFEMOVE_NE(x49, x48, x47, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (108) using rules (I), (II) which results in the following new constraint:
(113)    (3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x51, x52, x51)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x51, x52, x51)≥3675_0_SAFEMOVE_NE(x51, x52, x51, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (109) using rules (III), (VII) which results in the following new constraint:
(114)    (Cond_3445_0_wrongPos_Load1(!(=(x55, x54)), x55, x62, x54, x62)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x55, x62, x54)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x55, x62, x54)≥3675_0_SAFEMOVE_NE(x55, x62, x54, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (110) using rules (III), (VII) which results in the following new constraint:
(115)    (Cond_3445_0_wrongPos_Load1(!(=(x64, x65)), x64, x64, x65, x65)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x64, x64, x65)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x64, x64, x65)≥3675_0_SAFEMOVE_NE(x64, x64, x65, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (111) using rules (III), (VII) which results in the following new constraint:
(116)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x67, x68)), !(=(x68, x67))), !(=(-(x68, x67), -(x67, x68)))), x68, x67, x67, x68)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x68, x67, x67)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x68, x67, x67)≥3675_0_SAFEMOVE_NE(x68, x67, x67, 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We simplified constraint (113) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(117)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧[bni_76] = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (112) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(118)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (114) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(119)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (115) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(120)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (116) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(121)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (117) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(122)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧[bni_76] = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (118) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(123)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (119) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(124)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (120) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(125)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (121) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(126)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (122) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(127)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧[bni_76] = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (123) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(128)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (124) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(129)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (125) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(130)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (126) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(131)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 ≥ 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (127) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(132)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧[bni_76] = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (128) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(133)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (129) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(134)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (130) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(135)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)

We simplified constraint (131) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(136)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)

For Pair 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 1) the following chains were created:

We consider the chain COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1), 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1) which results in the following constraint:
(137)    (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[3]∧x1[1]=x2[3]∧x3[1]=x3[3]∧x1[3]=x0[4]∧x2[3]=x1[4]∧x3[3]=x2[4] ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3])≥3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (137) using rules (III), (IV) which results in the following new constraint:
(138)    (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x0[1], x1[1], x3[1])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x0[1], x1[1], x3[1])≥3675_0_SAFEMOVE_NE(x0[1], x1[1], x3[1], 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (138) using rule (V) (with possible (I) afterwards) using induction on 3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return which results in the following new constraints:
(139)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x71, x69)), !(=(x72, x70))), !(=(-(x72, x70), -(x69, x71)))), !(=(-(x72, x70), -(x71, x69)))), x72, x71, x70, x69)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x72, x71, x70)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x72, x71, x70)≥3675_0_SAFEMOVE_NE(x72, x71, x70, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

(140)    (3647_0_wrongPos_Return=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x74, x75, x74)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x74, x75, x74)≥3675_0_SAFEMOVE_NE(x74, x75, x74, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

(141)    (Cond_3445_0_wrongPos_Load1(!(=(x78, x77)), x78, x76, x77, x76)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x78, x76, x77)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x78, x76, x77)≥3675_0_SAFEMOVE_NE(x78, x76, x77, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

(142)    (Cond_3445_0_wrongPos_Load1(!(=(x80, x79)), x80, x80, x79, x79)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x80, x80, x79)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x80, x80, x79)≥3675_0_SAFEMOVE_NE(x80, x80, x79, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

(143)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x82, x81)), !(=(x81, x82))), !(=(-(x81, x82), -(x82, x81)))), x81, x82, x82, x81)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x81, x82, x82)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x81, x82, x82)≥3675_0_SAFEMOVE_NE(x81, x82, x82, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (139) using rules (III), (VII) which results in the following new constraint:
(144)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x71, x69)), !(=(x72, x70))), !(=(-(x72, x70), -(x69, x71)))), !(=(-(x72, x70), -(x71, x69)))), x72, x71, x70, x69)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x72, x71, x70)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x72, x71, x70)≥3675_0_SAFEMOVE_NE(x72, x71, x70, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (140) using rules (I), (II) which results in the following new constraint:
(145)    (3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x74, x75, x74)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x74, x75, x74)≥3675_0_SAFEMOVE_NE(x74, x75, x74, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (141) using rules (III), (VII) which results in the following new constraint:
(146)    (Cond_3445_0_wrongPos_Load1(!(=(x78, x77)), x78, x85, x77, x85)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x78, x85, x77)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x78, x85, x77)≥3675_0_SAFEMOVE_NE(x78, x85, x77, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (142) using rules (III), (VII) which results in the following new constraint:
(147)    (Cond_3445_0_wrongPos_Load1(!(=(x87, x88)), x87, x87, x88, x88)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x87, x87, x88)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x87, x87, x88)≥3675_0_SAFEMOVE_NE(x87, x87, x88, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (143) using rules (III), (VII) which results in the following new constraint:
(148)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x90, x91)), !(=(x91, x90))), !(=(-(x91, x90), -(x90, x91)))), x91, x90, x90, x91)=3647_0_wrongPos_Return ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x91, x90, x90)≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x91, x90, x90)≥3675_0_SAFEMOVE_NE(x91, x90, x90, 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We simplified constraint (145) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(149)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧[bni_78] = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (144) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(150)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (146) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(151)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (147) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(152)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (148) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(153)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (149) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(154)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧[bni_78] = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (150) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(155)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (151) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(156)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (152) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(157)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (153) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(158)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (154) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(159)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧[bni_78] = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (155) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(160)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (156) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(161)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (157) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(162)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (158) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(163)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 ≥ 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (159) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(164)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧[bni_78] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (160) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(165)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (161) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(166)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (162) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(167)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)

We simplified constraint (163) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(168)    ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
We consider the chain COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1), 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0) which results in the following constraint:
(169) (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[3]∧x1[1]=x2[3]∧x3[1]=x3[3]∧x1[3]=x0[6]∧x2[3]=x1[6]∧x3[3]=x2[6]∧1=0 ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3])≥3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥))

We solved constraint (169) using rules (I), (II).

For Pair 3675_0_SAFEMOVE_NE(x0, x1, x2, 1) → COND_3675_0_SAFEMOVE_NE(>(x2, -1), x0, x1, x2, 1) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1), COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)) which results in the following constraint:
(170)    (>(x2[4], -1)=TRUE∧x0[4]=x0[5]∧x1[4]=x1[5]∧x2[4]=x2[5] ⇒ 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥))

We simplified constraint (170) using rule (IV) which results in the following new constraint:
(171)    (>(x2[4], -1)=TRUE ⇒ 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥))

We simplified constraint (171) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(172)    (x2[4] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(-2)bni_80 + (-1)Bound*bni_80] + [(-1)bni_80]x2[4] + [bni_80]x0[4] ≥ 0∧[(-1)bso_81] ≥ 0)

We simplified constraint (172) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(173)    (x2[4] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(-2)bni_80 + (-1)Bound*bni_80] + [(-1)bni_80]x2[4] + [bni_80]x0[4] ≥ 0∧[(-1)bso_81] ≥ 0)

We simplified constraint (173) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(174)    (x2[4] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(-2)bni_80 + (-1)Bound*bni_80] + [(-1)bni_80]x2[4] + [bni_80]x0[4] ≥ 0∧[(-1)bso_81] ≥ 0)

We simplified constraint (174) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(175)    (x2[4] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧0 = 0∧[bni_80] = 0∧[(-2)bni_80 + (-1)Bound*bni_80] + [(-1)bni_80]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_81] ≥ 0)

For Pair COND_3675_0_SAFEMOVE_NE(TRUE, x0, x1, x2, 1) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x2, 1)) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1), COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]) which results in the following constraint:
(176)    (>(x2[4], -1)=TRUE∧x0[4]=x0[5]∧x1[4]=x1[5]∧x2[4]=x2[5]∧x0[5]=x0[0]∧x1[5]=x1[0]∧0=x2[0]∧+(x2[5], 1)=x3[0] ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (176) using rules (III), (IV) which results in the following new constraint:
(177)    (>(x2[4], -1)=TRUE ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥3343_0_SAFEMOVE_LOAD(x0[4], x1[4], 0, +(x2[4], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (177) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(178)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (178) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(179)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (179) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(180)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (180) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(181)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 = 0∧[bni_82] = 0∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_83] ≥ 0)
We consider the chain 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1), COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)), 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]) which results in the following constraint:
(182)    (>(x2[4], -1)=TRUE∧x0[4]=x0[5]∧x1[4]=x1[5]∧x2[4]=x2[5]∧x0[5]=x0[8]∧x1[5]=x1[8]∧+(x2[5], 1)=x3[8] ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (182) using rules (III), (IV) which results in the following new constraint:
(183)    (>(x2[4], -1)=TRUE ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥3343_0_SAFEMOVE_LOAD(x0[4], x1[4], 0, +(x2[4], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (183) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(184)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (184) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(185)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (185) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(186)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] + [bni_82]x0[4] ≥ 0∧[(-1)bso_83] ≥ 0)

We simplified constraint (186) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(187)    (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 = 0∧[bni_82] = 0∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_83] ≥ 0)

For Pair 3675_0_SAFEMOVE_NE(x0, x1, x2, 0) → COND_3675_0_SAFEMOVE_NE1(>(x2, -1), x0, x1, x2, 0) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0), COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1)) which results in the following constraint:
(188)    (>(x2[6], -1)=TRUE∧x0[6]=x0[7]∧x1[6]=x1[7]∧x2[6]=x2[7] ⇒ 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0)≥COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥))

We simplified constraint (188) using rule (IV) which results in the following new constraint:
(189)    (>(x2[6], -1)=TRUE ⇒ 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0)≥COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥))

We simplified constraint (189) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(190)    (x2[6] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥)∧[(-1)bni_84 + (-1)Bound*bni_84] + [(-1)bni_84]x2[6] + [bni_84]x0[6] ≥ 0∧[(-1)bso_85] ≥ 0)

We simplified constraint (190) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(191)    (x2[6] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥)∧[(-1)bni_84 + (-1)Bound*bni_84] + [(-1)bni_84]x2[6] + [bni_84]x0[6] ≥ 0∧[(-1)bso_85] ≥ 0)

We simplified constraint (191) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(192)    (x2[6] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥)∧[(-1)bni_84 + (-1)Bound*bni_84] + [(-1)bni_84]x2[6] + [bni_84]x0[6] ≥ 0∧[(-1)bso_85] ≥ 0)

We simplified constraint (192) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(193)    (x2[6] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥)∧0 = 0∧[bni_84] = 0∧[(-1)bni_84 + (-1)Bound*bni_84] + [(-1)bni_84]x2[6] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_85] ≥ 0)

For Pair COND_3675_0_SAFEMOVE_NE1(TRUE, x0, x1, x2, 0) → 3343_0_SAFEMOVE_LOAD(x0, x1, 1, +(x2, 1)) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0), COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]) which results in the following constraint:
(194)    (>(x2[6], -1)=TRUE∧x0[6]=x0[7]∧x1[6]=x1[7]∧x2[6]=x2[7]∧x0[7]=x0[0]∧x1[7]=x1[0]∧1=x2[0]∧+(x2[7], 1)=x3[0] ⇒ COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0)≥NonInfC∧COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0)≥3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥))

We simplified constraint (194) using rules (III), (IV) which results in the following new constraint:
(195)    (>(x2[6], -1)=TRUE ⇒ COND_3675_0_SAFEMOVE_NE1(TRUE, x0[6], x1[6], x2[6], 0)≥NonInfC∧COND_3675_0_SAFEMOVE_NE1(TRUE, x0[6], x1[6], x2[6], 0)≥3343_0_SAFEMOVE_LOAD(x0[6], x1[6], 1, +(x2[6], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥))

We simplified constraint (195) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(196)    (x2[6] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥)∧[(-1)bni_86 + (-1)Bound*bni_86] + [(-1)bni_86]x2[6] + [bni_86]x0[6] ≥ 0∧[1 + (-1)bso_87] ≥ 0)

We simplified constraint (196) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(197)    (x2[6] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥)∧[(-1)bni_86 + (-1)Bound*bni_86] + [(-1)bni_86]x2[6] + [bni_86]x0[6] ≥ 0∧[1 + (-1)bso_87] ≥ 0)

We simplified constraint (197) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(198)    (x2[6] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥)∧[(-1)bni_86 + (-1)Bound*bni_86] + [(-1)bni_86]x2[6] + [bni_86]x0[6] ≥ 0∧[1 + (-1)bso_87] ≥ 0)

We simplified constraint (198) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(199)    (x2[6] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥)∧0 = 0∧[bni_86] = 0∧[(-1)bni_86 + (-1)Bound*bni_86] + [(-1)bni_86]x2[6] ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_87] ≥ 0)
We consider the chain 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0), COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1)), 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]) which results in the following constraint:
(200) (>(x2[6], -1)=TRUE∧x0[6]=x0[7]∧x1[6]=x1[7]∧x2[6]=x2[7]∧x0[7]=x0[8]∧x1[7]=x1[8]∧1=0∧+(x2[7], 1)=x3[8] ⇒ COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0)≥NonInfC∧COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0)≥3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥))

We solved constraint (200) using rules (I), (II).

For Pair 3343_0_SAFEMOVE_LOAD(x0, x1, 0, x3) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3, -1), <(x3, x0)), x0, x1, 0, x3) the following chains were created:

We consider the chain 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]), COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1)) which results in the following constraint:
(201)    (&&(>(x3[8], -1), <(x3[8], x0[8]))=TRUE∧x0[8]=x0[9]∧x1[8]=x1[9]∧x3[8]=x3[9] ⇒ 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8])≥COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥))

We simplified constraint (201) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(202)    (>(x3[8], -1)=TRUE∧<(x3[8], x0[8])=TRUE ⇒ 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8])≥COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥))

We simplified constraint (202) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(203)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧[(-1)bni_88 + (-1)Bound*bni_88] + [(-1)bni_88]x3[8] + [bni_88]x0[8] ≥ 0∧[(-1)bso_89] ≥ 0)

We simplified constraint (203) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(204)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧[(-1)bni_88 + (-1)Bound*bni_88] + [(-1)bni_88]x3[8] + [bni_88]x0[8] ≥ 0∧[(-1)bso_89] ≥ 0)

We simplified constraint (204) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(205)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧[(-1)bni_88 + (-1)Bound*bni_88] + [(-1)bni_88]x3[8] + [bni_88]x0[8] ≥ 0∧[(-1)bso_89] ≥ 0)

We simplified constraint (205) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(206)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧0 = 0∧[(-1)bni_88 + (-1)Bound*bni_88] + [(-1)bni_88]x3[8] + [bni_88]x0[8] ≥ 0∧0 = 0∧[(-1)bso_89] ≥ 0)

We simplified constraint (206) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(207)    (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧0 = 0∧[(-1)Bound*bni_88] + [bni_88]x0[8] ≥ 0∧0 = 0∧[(-1)bso_89] ≥ 0)

For Pair COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0, x1, 0, x3) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x3, 1)) the following chains were created:

We consider the chain 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]), COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]) which results in the following constraint:
(208)    (&&(>(x3[8], -1), <(x3[8], x0[8]))=TRUE∧x0[8]=x0[9]∧x1[8]=x1[9]∧x3[8]=x3[9]∧x0[9]=x0[0]∧x1[9]=x1[0]∧0=x2[0]∧+(x3[9], 1)=x3[0] ⇒ COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9])≥3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥))

We simplified constraint (208) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(209)    (>(x3[8], -1)=TRUE∧<(x3[8], x0[8])=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[8], x1[8], 0, x3[8])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[8], x1[8], 0, x3[8])≥3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, +(x3[8], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥))

We simplified constraint (209) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(210)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (210) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(211)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (211) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(212)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (212) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(213)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (213) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(214)    (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_90] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)
We consider the chain 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]), COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1)), 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8]) which results in the following constraint:
(215)    (&&(>(x3[8], -1), <(x3[8], x0[8]))=TRUE∧x0[8]=x0[9]∧x1[8]=x1[9]∧x3[8]=x3[9]∧x0[9]=x0[8]1∧x1[9]=x1[8]1∧+(x3[9], 1)=x3[8]1 ⇒ COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9])≥3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥))

We simplified constraint (215) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(216)    (>(x3[8], -1)=TRUE∧<(x3[8], x0[8])=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[8], x1[8], 0, x3[8])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[8], x1[8], 0, x3[8])≥3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, +(x3[8], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥))

We simplified constraint (216) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(217)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (217) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(218)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (218) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(219)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (219) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(220)    (x3[8] ≥ 0∧x0[8] + [-1] + [-1]x3[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)bni_90 + (-1)Bound*bni_90] + [(-1)bni_90]x3[8] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)

We simplified constraint (220) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(221)    (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_90] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)

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

3343_0_SAFEMOVE_LOAD(x0, x1, x2, x3) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3, x0), >(x2, 0)), x0, x1, x2, x3, x4)
- (x0[0] ≥ 0∧x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-1)Bound*bni_72] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)
- (x0[0] ≥ 0∧x2[7] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧0 = 0∧[(-1)Bound*bni_72] + [bni_72]x0[0] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_73] ≥ 0)
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0, x1, x2, x3, x4) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0, x1, x3, x4), x0, x1, x3)
- (x3 ≥ 0∧x2[0] ≥ 0∧x1 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x3 ≥ 0∧x2[0] ≥ 0∧x1 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x3 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x9 ≥ 0∧x2[0] ≥ 0∧x8 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x9 ≥ 0∧x2[0] ≥ 0∧x8 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x9 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x18 ≥ 0∧x2[0] ≥ 0∧x19 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x18 ≥ 0∧x2[0] ≥ 0∧x19 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x18 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x22 ≥ 0∧x2[0] ≥ 0∧x21 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x22 ≥ 0∧x2[0] ≥ 0∧x21 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x22 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x26 ≥ 0∧x2[0] ≥ 0∧x24 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x26 ≥ 0∧x2[0] ≥ 0∧x24 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x26 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x32 ≥ 0∧x2[0] ≥ 0∧x31 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x32 ≥ 0∧x2[0] ≥ 0∧x31 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 = 0∧[(-1)Bound*bni_74] + [bni_74]x32 ≥ 0∧0 = 0∧[(-1)bso_75] ≥ 0)
- (x41 ≥ 0∧x2[0] ≥ 0∧x42 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x41 ≥ 0∧x2[0] ≥ 0∧x42 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x41 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x45 ≥ 0∧x2[0] ≥ 0∧x44 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)
- (x45 ≥ 0∧x2[0] ≥ 0∧x44 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)Bound*bni_74] + [bni_74]x45 ≥ 0∧[(-1)bso_75] ≥ 0)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧[bni_76] = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_77] ≥ 0)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1, x2, x3) → 3675_0_SAFEMOVE_NE(x1, x2, x3, 1)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧[bni_78] = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
- ((U^Increasing(3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)), ≥)∧0 = 0∧0 = 0∧0 ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_79] ≥ 0)
3675_0_SAFEMOVE_NE(x0, x1, x2, 1) → COND_3675_0_SAFEMOVE_NE(>(x2, -1), x0, x1, x2, 1)
- (x2[4] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧0 = 0∧[bni_80] = 0∧[(-2)bni_80 + (-1)Bound*bni_80] + [(-1)bni_80]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_81] ≥ 0)
COND_3675_0_SAFEMOVE_NE(TRUE, x0, x1, x2, 1) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x2, 1))
- (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 = 0∧[bni_82] = 0∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_83] ≥ 0)
- (x2[4] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 = 0∧[bni_82] = 0∧[(-2)bni_82 + (-1)Bound*bni_82] + [(-1)bni_82]x2[4] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_83] ≥ 0)
3675_0_SAFEMOVE_NE(x0, x1, x2, 0) → COND_3675_0_SAFEMOVE_NE1(>(x2, -1), x0, x1, x2, 0)
- (x2[6] ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)), ≥)∧0 = 0∧[bni_84] = 0∧[(-1)bni_84 + (-1)Bound*bni_84] + [(-1)bni_84]x2[6] ≥ 0∧0 = 0∧0 = 0∧[(-1)bso_85] ≥ 0)
COND_3675_0_SAFEMOVE_NE1(TRUE, x0, x1, x2, 0) → 3343_0_SAFEMOVE_LOAD(x0, x1, 1, +(x2, 1))
- (x2[6] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))), ≥)∧0 = 0∧[bni_86] = 0∧[(-1)bni_86 + (-1)Bound*bni_86] + [(-1)bni_86]x2[6] ≥ 0∧0 = 0∧0 = 0∧[1 + (-1)bso_87] ≥ 0)
3343_0_SAFEMOVE_LOAD(x0, x1, 0, x3) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3, -1), <(x3, x0)), x0, x1, 0, x3)
- (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])), ≥)∧0 = 0∧[(-1)Bound*bni_88] + [bni_88]x0[8] ≥ 0∧0 = 0∧[(-1)bso_89] ≥ 0)
COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0, x1, 0, x3) → 3343_0_SAFEMOVE_LOAD(x0, x1, 0, +(x3, 1))
- (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_90] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)
- (x3[8] ≥ 0∧x0[8] ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_90] + [bni_90]x0[8] ≥ 0∧0 = 0∧[1 + (-1)bso_91] ≥ 0)

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

POL(TRUE) = 0
POL(FALSE) = 0
POL(3445_0_wrongPos_Load(x₁, x₂, x₃, x₄)) = [-1] + x₄ + [-1]x₃ + [-1]x₂ + [-1]x₁
POL(Cond_3445_0_wrongPos_Load(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₅ + [-1]x₄ + [-1]x₃ + [-1]x₂ + [-1]x₁
POL(&&(x₁, x₂)) = 0
POL(!(x₁)) = [2]
POL(=(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(3647_0_wrongPos_Return) = [-1]
POL(Cond_3445_0_wrongPos_Load1(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₅ + [-1]x₃ + [-1]x₂ + [-1]x₁
POL(Cond_3445_0_wrongPos_Load3(x₁, x₂, x₃, x₄, x₅)) = [-1] + x₅ + [-1]x₄ + [-1]x₃ + x₂ + [-1]x₁
POL(3343_0_SAFEMOVE_LOAD(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + x₁
POL(COND_3343_0_SAFEMOVE_LOAD(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₅ + x₂ + [-1]x₁
POL(<(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(0) = 0
POL(3445_1_SAFEMOVE_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + x₂
POL(3675_0_SAFEMOVE_NE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + [-1]x₃ + x₁
POL(1) = [1]
POL(COND_3675_0_SAFEMOVE_NE(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₅ + [-1]x₄ + x₂
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(COND_3675_0_SAFEMOVE_NE1(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₅ + [-1]x₄ + x₂
POL(COND_3343_0_SAFEMOVE_LOAD1(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₅ + [-1]x₄ + x₂ + [-1]x₁

The following pairs are in P_>:

3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)
COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, +(x2[7], 1))
COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))

The following pairs are in P_bound:

3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])
COND_3343_0_SAFEMOVE_LOAD1(TRUE, x0[9], x1[9], 0, x3[9]) → 3343_0_SAFEMOVE_LOAD(x0[9], x1[9], 0, +(x3[9], 1))

The following pairs are in P_≥:

3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)
COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))
3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(>(x2[6], -1), x0[6], x1[6], x2[6], 0)
3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(&&(>(x3[8], -1), <(x3[8], x0[8])), x0[8], x1[8], 0, x3[8])

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

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

(9) Complex Obligation (AND)

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

Boolean, Integer

The ITRS R consists of the following rules:
3445_0_wrongPos_Load(x0, x1, x2, x3) → Cond_3445_0_wrongPos_Load(!(x1 = x3) && !(x0 = x2) && !(x0 - x2 = x3 - x1) && !(x0 - x2 = x1 - x3), x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x2), x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x0, x1, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x1), x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x1, x0) → Cond_3445_0_wrongPos_Load3(!(x1 = x0) && !(x0 = x1) && !(x0 - x1 = x1 - x0), x0, x1, x1, x0)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0) → 3647_0_wrongPos_Return

The integer pair graph contains the following rules and edges:
(0): 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(x3[0] < x0[0] && x2[0] > 0, x0[0], x1[0], x2[0], x3[0], x4[0])
(1): COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
(2): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
(4): 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(x2[4] > -1, x0[4], x1[4], x2[4], 1)
(5): COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, x2[5] + 1)
(6): 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(x2[6] > -1, x0[6], x1[6], x2[6], 0)
(8): 3343_0_SAFEMOVE_LOAD(x0[8], x1[8], 0, x3[8]) → COND_3343_0_SAFEMOVE_LOAD1(x3[8] > -1 && x3[8] < x0[8], x0[8], x1[8], 0, x3[8])

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

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

(1) -> (2), if (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]) →^* 3647_0_wrongPos_Return∧x0[1] →^* x1[2]∧x1[1] →^* x2[2]∧x3[1] →^* x3[2])

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

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

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

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

(11) IDependencyGraphProof (EQUIVALENT transformation)

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

(12) Obligation:

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

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

The following domains are used:

Boolean, Integer

The ITRS R consists of the following rules:
3445_0_wrongPos_Load(x0, x1, x2, x3) → Cond_3445_0_wrongPos_Load(!(x1 = x3) && !(x0 = x2) && !(x0 - x2 = x3 - x1) && !(x0 - x2 = x1 - x3), x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x2), x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x0, x1, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x1), x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x1, x0) → Cond_3445_0_wrongPos_Load3(!(x1 = x0) && !(x0 = x1) && !(x0 - x1 = x1 - x0), x0, x1, x1, x0)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0) → 3647_0_wrongPos_Return

The integer pair graph contains the following rules and edges:
(5): COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, x2[5] + 1)
(4): 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(x2[4] > -1, x0[4], x1[4], x2[4], 1)
(2): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
(1): COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
(0): 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(x3[0] < x0[0] && x2[0] > 0, x0[0], x1[0], x2[0], x3[0], x4[0])

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

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

(1) -> (2), if (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]) →^* 3647_0_wrongPos_Return∧x0[1] →^* x1[2]∧x1[1] →^* x2[2]∧x3[1] →^* x3[2])

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

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

(13) IDPNonInfProof (SOUND transformation)

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

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

For Pair COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1), COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]) which results in the following constraint:
(1)    (>(x2[4], -1)=TRUE∧x0[4]=x0[5]∧x1[4]=x1[5]∧x2[4]=x2[5]∧x0[5]=x0[0]∧x1[5]=x1[0]∧0=x2[0]∧+(x2[5], 1)=x3[0] ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1)≥3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (1) using rules (III), (IV) which results in the following new constraint:
(2)    (>(x2[4], -1)=TRUE ⇒ COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥NonInfC∧COND_3675_0_SAFEMOVE_NE(TRUE, x0[4], x1[4], x2[4], 1)≥3343_0_SAFEMOVE_LOAD(x0[4], x1[4], 0, +(x2[4], 1))∧(U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (0 ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[bni_53 + (-1)Bound*bni_53] + [bni_53]x1[4] + [bni_53]x0[4] ≥ 0∧[(-1)bso_54] + [2]x1[4] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (0 ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧[bni_53 + (-1)Bound*bni_53] + [bni_53]x1[4] + [bni_53]x0[4] ≥ 0∧[(-1)bso_54] + [2]x1[4] ≥ 0)

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

We simplified constraint (5) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(6)    (0 ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 ≥ 0∧[bni_53] ≥ 0∧[bni_53] ≥ 0∧[bni_53 + (-1)Bound*bni_53] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_54] ≥ 0∧[1] ≥ 0)

For Pair 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1) the following chains were created:

We consider the chain 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1), COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)) which results in the following constraint:
(7)    (>(x2[4], -1)=TRUE∧x0[4]=x0[5]∧x1[4]=x1[5]∧x2[4]=x2[5] ⇒ 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥))

We simplified constraint (7) using rule (IV) which results in the following new constraint:
(8)    (>(x2[4], -1)=TRUE ⇒ 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥NonInfC∧3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1)≥COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)∧(U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    (0 ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(2)bni_55 + (-1)Bound*bni_55] + [bni_55]x2[4] + [(2)bni_55]x1[4] + [bni_55]x0[4] ≥ 0∧[1 + (-1)bso_56] + x2[4] + x1[4] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    (0 ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(2)bni_55 + (-1)Bound*bni_55] + [bni_55]x2[4] + [(2)bni_55]x1[4] + [bni_55]x0[4] ≥ 0∧[1 + (-1)bso_56] + x2[4] + x1[4] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    (0 ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[(2)bni_55 + (-1)Bound*bni_55] + [bni_55]x2[4] + [(2)bni_55]x1[4] + [bni_55]x0[4] ≥ 0∧[1 + (-1)bso_56] + x2[4] + x1[4] ≥ 0)

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    (0 ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[bni_55] ≥ 0∧[(2)bni_55] ≥ 0∧[bni_55] ≥ 0∧[(2)bni_55 + (-1)Bound*bni_55] ≥ 0∧[1] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[1 + (-1)bso_56] ≥ 0)

For Pair 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0) the following chains were created:

We consider the chain COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0), 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1) which results in the following constraint:
(13) (3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[2]∧x1[1]=x2[2]∧x3[1]=x3[2]∧x1[2]=x0[4]∧x2[2]=x1[4]∧x3[2]=x2[4]∧0=1 ⇒ 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥NonInfC∧3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2])≥3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)∧(U^Increasing(3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)), ≥))

We solved constraint (13) using rules (I), (II).

For Pair COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]) the following chains were created:

We consider the chain 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]), 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0) which results in the following constraint:
(14)    (&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1]∧3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1])=3647_0_wrongPos_Return∧x0[1]=x1[2]∧x1[1]=x2[2]∧x3[1]=x3[2] ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (14) using rules (III), (IV) which results in the following new constraint:
(15)    (&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[0], x1[1], x2[0], x3[0], x4[1])≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1]), x0[0], x1[1], x3[0])∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (15) using rule (V) (with possible (I) afterwards) using induction on 3445_0_wrongPos_Load(x0[0], x1[1], x3[0], x4[1])=3647_0_wrongPos_Return which results in the following new constraints:
(16)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x2, x0)), !(=(x3, x1))), !(=(-(x3, x1), -(x0, x2)))), !(=(-(x3, x1), -(x2, x0)))), x3, x2, x1, x0)=3647_0_wrongPos_Return∧&&(<(x1, x3), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x3, x2, x1, x0), x3, x2, x1)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(17)    (3647_0_wrongPos_Return=3647_0_wrongPos_Return∧&&(<(x5, x5), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x5, x6, x5, x4), x5, x6, x5)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(18)    (Cond_3445_0_wrongPos_Load1(!(=(x9, x8)), x9, x7, x8, x7)=3647_0_wrongPos_Return∧&&(<(x8, x9), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x7, x2[0], x8, x7)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x7, x2[0], x8, x7)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x9, x7, x8, x7), x9, x7, x8)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(19)    (Cond_3445_0_wrongPos_Load1(!(=(x11, x10)), x11, x11, x10, x10)=3647_0_wrongPos_Return∧&&(<(x10, x11), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x11, x11, x2[0], x10, x10)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x11, x11, x2[0], x10, x10)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x11, x11, x10, x10), x11, x11, x10)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

(20)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x13, x12)), !(=(x12, x13))), !(=(-(x12, x13), -(x13, x12)))), x12, x13, x13, x12)=3647_0_wrongPos_Return∧&&(<(x13, x12), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x12, x13, x2[0], x13, x12)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x12, x13, x2[0], x13, x12)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x12, x13, x13, x12), x12, x13, x13)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (16) using rules (III), (VII) which results in the following new constraint:
(21)    (Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x2, x0)), !(=(x3, x1))), !(=(-(x3, x1), -(x0, x2)))), !(=(-(x3, x1), -(x2, x0)))), x3, x2, x1, x0)=3647_0_wrongPos_Return∧&&(<(x1, x3), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x3, x2, x2[0], x1, x0)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x3, x2, x1, x0), x3, x2, x1)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (17) using rules (I), (II) which results in the following new constraint:
(22)    (&&(<(x5, x5), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x5, x6, x2[0], x5, x4)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x5, x6, x5, x4), x5, x6, x5)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (18) using rules (III), (VII) which results in the following new constraint:
(23)    (Cond_3445_0_wrongPos_Load1(!(=(x9, x8)), x9, x16, x8, x16)=3647_0_wrongPos_Return∧&&(<(x8, x9), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x16, x2[0], x8, x16)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x9, x16, x2[0], x8, x16)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x9, x16, x8, x16), x9, x16, x8)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (19) using rules (III), (VII) which results in the following new constraint:
(24)    (Cond_3445_0_wrongPos_Load1(!(=(x18, x19)), x18, x18, x19, x19)=3647_0_wrongPos_Return∧&&(<(x19, x18), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x18, x18, x2[0], x19, x19)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x18, x18, x2[0], x19, x19)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x18, x18, x19, x19), x18, x18, x19)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (20) using rules (III), (VII) which results in the following new constraint:
(25)    (Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x21, x22)), !(=(x22, x21))), !(=(-(x22, x21), -(x21, x22)))), x22, x21, x21, x22)=3647_0_wrongPos_Return∧&&(<(x21, x22), >(x2[0], 0))=TRUE ⇒ COND_3343_0_SAFEMOVE_LOAD(TRUE, x22, x21, x2[0], x21, x22)≥NonInfC∧COND_3343_0_SAFEMOVE_LOAD(TRUE, x22, x21, x2[0], x21, x22)≥3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x22, x21, x21, x22), x22, x21, x21)∧(U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥))

We simplified constraint (22) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(26)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-2)bni_57]x5 + [bni_57]x2[0] + [(-1)bni_57]x6 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (21) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x1 + [bni_57]x2[0] + [(-1)bni_57]x2 + [(-1)bni_57]x3 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (23) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(28)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x16 + [(-1)bni_57]x8 + [bni_57]x2[0] + [(-1)bni_57]x9 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (24) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(29)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x19 + [bni_57]x2[0] + [(-2)bni_57]x18 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (25) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(30)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x22 + [(-2)bni_57]x21 + [bni_57]x2[0] ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (26) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(31)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-2)bni_57]x5 + [bni_57]x2[0] + [(-1)bni_57]x6 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(32)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x1 + [bni_57]x2[0] + [(-1)bni_57]x2 + [(-1)bni_57]x3 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (28) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(33)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x16 + [(-1)bni_57]x8 + [bni_57]x2[0] + [(-1)bni_57]x9 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (29) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x19 + [bni_57]x2[0] + [(-2)bni_57]x18 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (30) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(35)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x22 + [(-2)bni_57]x21 + [bni_57]x2[0] ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (31) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(36)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-2)bni_57]x5 + [bni_57]x2[0] + [(-1)bni_57]x6 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (32) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(37)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x1 + [bni_57]x2[0] + [(-1)bni_57]x2 + [(-1)bni_57]x3 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (33) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(38)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x16 + [(-1)bni_57]x8 + [bni_57]x2[0] + [(-1)bni_57]x9 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(39)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x19 + [bni_57]x2[0] + [(-2)bni_57]x18 ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (35) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(40)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57 + (-1)Bound*bni_57] + [(-1)bni_57]x22 + [(-2)bni_57]x21 + [bni_57]x2[0] ≥ 0∧[(-1)bso_58] + x2[0] ≥ 0)

We simplified constraint (36) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(41)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 ≥ 0∧[(-2)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

We simplified constraint (37) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(42)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 ≥ 0∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

We simplified constraint (38) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(43)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

We simplified constraint (39) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(44)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-2)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)

We simplified constraint (40) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(45)    (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[(-2)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧[(-1)bso_58] ≥ 0)

For Pair 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]) the following chains were created:

We consider the chain COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1)), 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0]), COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1]) which results in the following constraint:
(46)    (x0[5]=x0[0]∧x1[5]=x1[0]∧0=x2[0]∧+(x2[5], 1)=x3[0]∧&&(<(x3[0], x0[0]), >(x2[0], 0))=TRUE∧x0[0]=x0[1]∧x1[0]=x1[1]∧x2[0]=x2[1]∧x3[0]=x3[1]∧x4[0]=x4[1] ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0])≥COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We simplified constraint (46) using rules (III), (IV), (IDP_CONSTANT_FOLD) which results in the following new constraint:
(47)    (&&(<(+(x2[5], 1), x0[0]), FALSE)=TRUE ⇒ 3343_0_SAFEMOVE_LOAD(x0[0], x1[5], 0, +(x2[5], 1))≥NonInfC∧3343_0_SAFEMOVE_LOAD(x0[0], x1[5], 0, +(x2[5], 1))≥COND_3343_0_SAFEMOVE_LOAD(&&(<(+(x2[5], 1), x0[0]), >(0, 0)), x0[0], x1[5], 0, +(x2[5], 1), x4[0])∧(U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥))

We simplified constraint (47) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(48)    (0 ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[bni_59 + (-1)Bound*bni_59] + [(-1)bni_59]x1[5] + [bni_59]x0[0] ≥ 0∧[2 + (-1)bso_60] + [2]x0[0] ≥ 0)

We simplified constraint (48) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(49)    (0 ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[bni_59 + (-1)Bound*bni_59] + [(-1)bni_59]x1[5] + [bni_59]x0[0] ≥ 0∧[2 + (-1)bso_60] + [2]x0[0] ≥ 0)

We simplified constraint (49) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(50)    (0 ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[bni_59 + (-1)Bound*bni_59] + [(-1)bni_59]x1[5] + [bni_59]x0[0] ≥ 0∧[2 + (-1)bso_60] + [2]x0[0] ≥ 0)

We simplified constraint (50) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(51)    (0 ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[(-1)bni_59] ≥ 0∧[bni_59] ≥ 0∧[bni_59 + (-1)Bound*bni_59] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_60] ≥ 0∧[1] ≥ 0)

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

COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))
- (0 ≥ 0 ⇒ (U^Increasing(3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))), ≥)∧0 ≥ 0∧[bni_53] ≥ 0∧[bni_53] ≥ 0∧[bni_53 + (-1)Bound*bni_53] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_54] ≥ 0∧[1] ≥ 0)
3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)
- (0 ≥ 0 ⇒ (U^Increasing(COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)), ≥)∧[bni_55] ≥ 0∧[(2)bni_55] ≥ 0∧[bni_55] ≥ 0∧[(2)bni_55 + (-1)Bound*bni_55] ≥ 0∧[1] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[1 + (-1)bso_56] ≥ 0)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])
- (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 ≥ 0∧[(-2)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧0 ≥ 0∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-2)bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧[1] ≥ 0∧0 ≥ 0∧[(-1)bso_58] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])), ≥)∧[(-1)bni_57] ≥ 0∧[(-2)bni_57] ≥ 0∧[bni_57] ≥ 0∧[(-1)bni_57 + (-1)Bound*bni_57] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1] ≥ 0∧[(-1)bso_58] ≥ 0)
3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])
- (0 ≥ 0 ⇒ (U^Increasing(COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])), ≥)∧[(-1)bni_59] ≥ 0∧[bni_59] ≥ 0∧[bni_59 + (-1)Bound*bni_59] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[2 + (-1)bso_60] ≥ 0∧[1] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(3445_0_wrongPos_Load(x₁, x₂, x₃, x₄)) = 0
POL(Cond_3445_0_wrongPos_Load(x₁, x₂, x₃, x₄, x₅)) = [3] + [3]x₁
POL(&&(x₁, x₂)) = 0
POL(!(x₁)) = 0
POL(=(x₁, x₂)) = 0
POL(-(x₁, x₂)) = 0
POL(3647_0_wrongPos_Return) = [3]
POL(Cond_3445_0_wrongPos_Load1(x₁, x₂, x₃, x₄, x₅)) = [3]
POL(Cond_3445_0_wrongPos_Load3(x₁, x₂, x₃, x₄, x₅)) = [3]
POL(COND_3675_0_SAFEMOVE_NE(x₁, x₂, x₃, x₄, x₅)) = [1] + [-1]x₅ + x₃ + x₂
POL(1) = 0
POL(3343_0_SAFEMOVE_LOAD(x₁, x₂, x₃, x₄)) = [1] + [-1]x₄ + [-1]x₃ + [-1]x₂ + x₁
POL(0) = 0
POL(+(x₁, x₂)) = 0
POL(3675_0_SAFEMOVE_NE(x₁, x₂, x₃, x₄)) = [2] + [-1]x₄ + x₃ + [2]x₂ + x₁
POL(>(x₁, x₂)) = 0
POL(-1) = 0
POL(3445_1_SAFEMOVE_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + [-1]x₃ + [-1]x₂ + [-1]x₁
POL(COND_3343_0_SAFEMOVE_LOAD(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₅ + x₄ + [-1]x₃ + [-1]x₂ + [-1]x₁
POL(<(x₁, x₂)) = 0

The following pairs are in P_>:

3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
3343_0_SAFEMOVE_LOAD(x0[0], x1[0], x2[0], x3[0]) → COND_3343_0_SAFEMOVE_LOAD(&&(<(x3[0], x0[0]), >(x2[0], 0)), x0[0], x1[0], x2[0], x3[0], x4[0])

The following pairs are in P_bound:

COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))
3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(>(x2[4], -1), x0[4], x1[4], x2[4], 1)
3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)

The following pairs are in P_≥:

COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, +(x2[5], 1))
COND_3343_0_SAFEMOVE_LOAD(TRUE, x0[1], x1[1], x2[1], x3[1], x4[1]) → 3445_1_SAFEMOVE_INVOKEMETHOD(3445_0_wrongPos_Load(x0[1], x1[1], x3[1], x4[1]), x0[1], x1[1], x3[1])

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

Cond_3445_0_wrongPos_Load(&&(&&(&&(!(=(x1, x3)), !(=(x0, x2))), !(=(-(x0, x2), -(x3, x1)))), !(=(-(x0, x2), -(x1, x3)))), x0, x1, x2, x3)¹ → 3445_0_wrongPos_Load(x0, x1, x2, x3)¹
3647_0_wrongPos_Return¹ → 3445_0_wrongPos_Load(x0, x1, x0, x2)¹
Cond_3445_0_wrongPos_Load1(!(=(x0, x2)), x0, x1, x2, x1)¹ → 3445_0_wrongPos_Load(x0, x1, x2, x1)¹
Cond_3445_0_wrongPos_Load1(!(=(x0, x1)), x0, x0, x1, x1)¹ → 3445_0_wrongPos_Load(x0, x0, x1, x1)¹
Cond_3445_0_wrongPos_Load3(&&(&&(!(=(x1, x0)), !(=(x0, x1))), !(=(-(x0, x1), -(x1, x0)))), x0, x1, x1, x0)¹ → 3445_0_wrongPos_Load(x0, x1, x1, x0)¹
3647_0_wrongPos_Return¹ → Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3)¹
TRUE¹ → &&(TRUE, TRUE)¹
FALSE¹ → &&(TRUE, FALSE)¹
FALSE¹ → &&(FALSE, TRUE)¹
FALSE¹ → &&(FALSE, FALSE)¹
!(TRUE)¹ → FALSE¹
!(FALSE)¹ → TRUE¹
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1)¹ ↔ 3647_0_wrongPos_Return¹
3647_0_wrongPos_Return¹ → Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1)¹
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0)¹ ↔ 3647_0_wrongPos_Return¹

(14) Complex Obligation (AND)

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

(16) IDependencyGraphProof (EQUIVALENT transformation)

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

(17) TRUE

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

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

(19) IDependencyGraphProof (EQUIVALENT transformation)

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

(20) TRUE

(21) 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:
3445_0_wrongPos_Load(x0, x1, x2, x3) → Cond_3445_0_wrongPos_Load(!(x1 = x3) && !(x0 = x2) && !(x0 - x2 = x3 - x1) && !(x0 - x2 = x1 - x3), x0, x1, x2, x3)
Cond_3445_0_wrongPos_Load(TRUE, x0, x1, x2, x3) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x0, x2) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x2, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x2), x0, x1, x2, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x1, x2, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x0, x1, x1) → Cond_3445_0_wrongPos_Load1(!(x0 = x1), x0, x0, x1, x1)
Cond_3445_0_wrongPos_Load1(TRUE, x0, x0, x1, x1) → 3647_0_wrongPos_Return
3445_0_wrongPos_Load(x0, x1, x1, x0) → Cond_3445_0_wrongPos_Load3(!(x1 = x0) && !(x0 = x1) && !(x0 - x1 = x1 - x0), x0, x1, x1, x0)
Cond_3445_0_wrongPos_Load3(TRUE, x0, x1, x1, x0) → 3647_0_wrongPos_Return

The integer pair graph contains the following rules and edges:
(2): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[2], x2[2], x3[2]) → 3675_0_SAFEMOVE_NE(x1[2], x2[2], x3[2], 0)
(3): 3445_1_SAFEMOVE_INVOKEMETHOD(3647_0_wrongPos_Return, x1[3], x2[3], x3[3]) → 3675_0_SAFEMOVE_NE(x1[3], x2[3], x3[3], 1)
(4): 3675_0_SAFEMOVE_NE(x0[4], x1[4], x2[4], 1) → COND_3675_0_SAFEMOVE_NE(x2[4] > -1, x0[4], x1[4], x2[4], 1)
(5): COND_3675_0_SAFEMOVE_NE(TRUE, x0[5], x1[5], x2[5], 1) → 3343_0_SAFEMOVE_LOAD(x0[5], x1[5], 0, x2[5] + 1)
(6): 3675_0_SAFEMOVE_NE(x0[6], x1[6], x2[6], 0) → COND_3675_0_SAFEMOVE_NE1(x2[6] > -1, x0[6], x1[6], x2[6], 0)
(7): COND_3675_0_SAFEMOVE_NE1(TRUE, x0[7], x1[7], x2[7], 0) → 3343_0_SAFEMOVE_LOAD(x0[7], x1[7], 1, x2[7] + 1)

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

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

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

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

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

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

(22) IDependencyGraphProof (EQUIVALENT transformation)

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

(23) TRUE

(24) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: Queen.displayChessboard()V
SCC calls the following helper methods:
Performed SCC analyses: UsedFieldsAnalysis

(25) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 32 rules for P and 0 rules for R.

P rules:
2643_0_displayChessboard_FieldAccess(EOS(STATIC_2643(i662)), i663, i663) → 2654_0_displayChessboard_GE(EOS(STATIC_2654(i662)), i663, i663, i662)
2654_0_displayChessboard_GE(EOS(STATIC_2654(i662)), i663, i663, i662) → 2665_0_displayChessboard_GE(EOS(STATIC_2665(i662)), i663, i663, i662)
2665_0_displayChessboard_GE(EOS(STATIC_2665(i662)), i663, i663, i662) → 2678_0_displayChessboard_ConstantStackPush(EOS(STATIC_2678(i662)), i663) | <(i663, i662)
2678_0_displayChessboard_ConstantStackPush(EOS(STATIC_2678(i662)), i663) → 2689_0_displayChessboard_Store(EOS(STATIC_2689(i662)), i663, 0)
2689_0_displayChessboard_Store(EOS(STATIC_2689(i662)), i663, matching1) → 2706_0_displayChessboard_Load(EOS(STATIC_2706(i662)), i663, 0) | =(matching1, 0)
2706_0_displayChessboard_Load(EOS(STATIC_2706(i662)), i663, matching1) → 2793_0_displayChessboard_Load(EOS(STATIC_2793(i662)), i663, 0) | =(matching1, 0)
2793_0_displayChessboard_Load(EOS(STATIC_2793(i731)), i663, i732) → 2884_0_displayChessboard_Load(EOS(STATIC_2884(i731)), i663, i732)
2884_0_displayChessboard_Load(EOS(STATIC_2884(i731)), i663, i761) → 3007_0_displayChessboard_Load(EOS(STATIC_3007(i731)), i663, i761)
3007_0_displayChessboard_Load(EOS(STATIC_3007(i731)), i663, i784) → 3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i784)
3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i825) → 3165_0_displayChessboard_FieldAccess(EOS(STATIC_3165(i731)), i663, i825, i825)
3165_0_displayChessboard_FieldAccess(EOS(STATIC_3165(i731)), i663, i825, i825) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731)
3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731) → 3181_0_displayChessboard_GE(EOS(STATIC_3181(i731)), i663, i825, i825, i731)
3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731) → 3182_0_displayChessboard_GE(EOS(STATIC_3182(i731)), i663, i825, i825, i731)
3181_0_displayChessboard_GE(EOS(STATIC_3181(i731)), i663, i825, i825, i731) → 3188_0_displayChessboard_Inc(EOS(STATIC_3188(i731)), i663) | >=(i825, i731)
3188_0_displayChessboard_Inc(EOS(STATIC_3188(i731)), i663) → 3195_0_displayChessboard_JMP(EOS(STATIC_3195(i731)), +(i663, 1)) | >=(i663, 0)
3195_0_displayChessboard_JMP(EOS(STATIC_3195(i731)), i840) → 3203_0_displayChessboard_Load(EOS(STATIC_3203(i731)), i840)
3203_0_displayChessboard_Load(EOS(STATIC_3203(i731)), i840) → 2636_0_displayChessboard_Load(EOS(STATIC_2636(i731)), i840)
2636_0_displayChessboard_Load(EOS(STATIC_2636(i662)), i663) → 2643_0_displayChessboard_FieldAccess(EOS(STATIC_2643(i662)), i663, i663)
3182_0_displayChessboard_GE(EOS(STATIC_3182(i731)), i663, i825, i825, i731) → 3189_0_displayChessboard_FieldAccess(EOS(STATIC_3189(i731)), i663, i825) | <(i825, i731)
3189_0_displayChessboard_FieldAccess(EOS(STATIC_3189(i731)), i663, i825) → 3196_0_displayChessboard_Load(EOS(STATIC_3196(i731)), i663, i825, java.lang.Object(ARRAY(i731)))
3196_0_displayChessboard_Load(EOS(STATIC_3196(i731)), i663, i825, java.lang.Object(ARRAY(i731))) → 3204_0_displayChessboard_ArrayAccess(EOS(STATIC_3204(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3204_0_displayChessboard_ArrayAccess(EOS(STATIC_3204(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3212_0_displayChessboard_ArrayAccess(EOS(STATIC_3212(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3212_0_displayChessboard_ArrayAccess(EOS(STATIC_3212(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3221_0_displayChessboard_Load(EOS(STATIC_3221(i731)), i663, i825, i845) | <(i663, i731)
3221_0_displayChessboard_Load(EOS(STATIC_3221(i731)), i663, i825, i845) → 3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i845, i825)
3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i825, i825) → 3240_0_displayChessboard_EQ(EOS(STATIC_3240(i731)), i663, i825, i825, i825)
3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i845, i825) → 3241_0_displayChessboard_EQ(EOS(STATIC_3241(i731)), i663, i825, i845, i825)
3240_0_displayChessboard_EQ(EOS(STATIC_3240(i731)), i663, i825, i825, i825) → 3249_0_displayChessboard_Inc(EOS(STATIC_3249(i731)), i663, i825)
3249_0_displayChessboard_Inc(EOS(STATIC_3249(i731)), i663, i825) → 3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825)
3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825) → 3259_0_displayChessboard_JMP(EOS(STATIC_3259(i731)), i663, +(i825, 1)) | >=(i825, 0)
3259_0_displayChessboard_JMP(EOS(STATIC_3259(i731)), i663, i859) → 3271_0_displayChessboard_Load(EOS(STATIC_3271(i731)), i663, i859)
3271_0_displayChessboard_Load(EOS(STATIC_3271(i731)), i663, i859) → 3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i859)
3241_0_displayChessboard_EQ(EOS(STATIC_3241(i731)), i663, i825, i845, i825) → 3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825) | !(=(i845, i825))
R rules:

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

P rules:
3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, x2, x2, x0) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), +(x1, 1), 0, 0, x0) | &&(&&(>=(x2, x0), >(+(x1, 1), 0)), >(x0, +(x1, 1)))
3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, x2, x2, x0) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, +(x2, 1), +(x2, 1), x0) | &&(&&(>(+(x2, 1), 0), <(x2, x0)), <(x1, x0))
R rules:

Filtered duplicate args:

3176_0_displayChessboard_GE(x1, x2, x3, x4, x5) → 3176_0_displayChessboard_GE(x1, x2, x4)
Cond_3176_0_displayChessboard_GE(x1, x2, x3, x4, x5, x6) → Cond_3176_0_displayChessboard_GE(x1, x2, x3, x5)
Cond_3176_0_displayChessboard_GE1(x1, x2, x3, x4, x5, x6) → Cond_3176_0_displayChessboard_GE1(x1, x2, x3, x5)

Filtered unneeded arguments:

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

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

P rules:
3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, x2) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), +(x1, 1), 0) | &&(&&(>=(x2, x0), >(x1, -1)), >(x0, +(x1, 1)))
3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, x2) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(x0)), x1, +(x2, 1)) | &&(&&(>(x2, -1), <(x2, x0)), <(x1, x0))
R rules:

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

P rules:
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2, x0), >(x1, -1)), >(x0, +(x1, 1))), EOS(STATIC_3176(x0)), x1, x2)
COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), +(x1, 1), 0)
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2, -1), <(x2, x0)), <(x1, x0)), EOS(STATIC_3176(x0)), x1, x2)
COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, +(x2, 1))
R rules:

(26) Obligation:

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

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

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0]) → COND_3176_0_DISPLAYCHESSBOARD_GE(x2[0] >= x0[0] && x1[0] > -1 && x0[0] > x1[0] + 1, EOS(STATIC_3176(x0[0])), x1[0], x2[0])
(1): COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), x1[1] + 1, 0)
(2): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2], EOS(STATIC_3176(x0[2])), x1[2], x2[2])
(3): COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], x2[3] + 1)

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

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

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

(2) -> (3), if (x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2] ∧EOS(STATIC_3176(x0[2])) →^* EOS(STATIC_3176(x0[3]))∧x1[2] →^* x1[3]∧x2[2] →^* x2[3])

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

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

The set Q is empty.

(27) IDPNonInfProof (SOUND transformation)

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

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 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2, x0), >(x1, -1)), >(x0, +(x1, 1))), EOS(STATIC_3176(x0)), x1, x2) the following chains were created:

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

We simplified constraint (1) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x0[0], +(x1[0], 1))=TRUE∧>=(x2[0], x0[0])=TRUE∧>(x1[0], -1)=TRUE ⇒ 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0])≥NonInfC∧3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0])≥COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])∧(U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])), ≥))

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

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

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

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x0[0] ≥ 0∧x2[0] + [-2] + [-1]x1[0] + [-1]x0[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])), ≥)∧[(3)bni_13 + (-1)Bound*bni_13] + [bni_13]x1[0] + [(2)bni_13]x0[0] ≥ 0∧[(-1)bso_14] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])), ≥)∧[(3)bni_13 + (-1)Bound*bni_13] + [bni_13]x1[0] + [(2)bni_13]x0[0] ≥ 0∧[(-1)bso_14] ≥ 0)

For Pair COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), +(x1, 1), 0) the following chains were created:

We consider the chain COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0) which results in the following constraint:
(8)    (COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1])≥NonInfC∧COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1])≥3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)∧(U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥)∧[bni_15] = 0∧[1 + (-1)bso_16] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥)∧[bni_15] = 0∧[1 + (-1)bso_16] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥)∧[bni_15] = 0∧[1 + (-1)bso_16] ≥ 0)

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥)∧[bni_15] = 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_16] ≥ 0)

For Pair 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2, -1), <(x2, x0)), <(x1, x0)), EOS(STATIC_3176(x0)), x1, x2) the following chains were created:

We consider the chain 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2]), COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1)) which results in the following constraint:
(13)    (&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2]))=TRUE∧EOS(STATIC_3176(x0[2]))=EOS(STATIC_3176(x0[3]))∧x1[2]=x1[3]∧x2[2]=x2[3] ⇒ 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥NonInfC∧3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])∧(U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥))

We simplified constraint (13) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(14)    (<(x1[2], x0[2])=TRUE∧>(x2[2], -1)=TRUE∧<(x2[2], x0[2])=TRUE ⇒ 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥NonInfC∧3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])∧(U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥))

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

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

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

We simplified constraint (17) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(18)    (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (18) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(19)    (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)

(20)    (x0[2] ≥ 0∧x2[2] ≥ 0∧[-1]x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [(-1)bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)

We simplified constraint (20) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(21)    (x1[2] + x2[2] + x0[2] ≥ 0∧x2[2] ≥ 0∧x0[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [(2)bni_17]x2[2] + [bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)

For Pair COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, +(x2, 1)) the following chains were created:

We consider the chain COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1)) which results in the following constraint:
(22)    (COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3])≥NonInfC∧COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3])≥3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))∧(U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥))

We simplified constraint (22) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(23)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_19] = 0∧[(-1)bso_20] ≥ 0)

We simplified constraint (23) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(24)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_19] = 0∧[(-1)bso_20] ≥ 0)

We simplified constraint (24) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(25)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_19] = 0∧[(-1)bso_20] ≥ 0)

We simplified constraint (25) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(26)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_19] = 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_20] ≥ 0)

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

3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2, x0), >(x1, -1)), >(x0, +(x1, 1))), EOS(STATIC_3176(x0)), x1, x2)
- (x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])), ≥)∧[(3)bni_13 + (-1)Bound*bni_13] + [bni_13]x1[0] + [(2)bni_13]x0[0] ≥ 0∧[(-1)bso_14] ≥ 0)
COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), +(x1, 1), 0)
- ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)), ≥)∧[bni_15] = 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_16] ≥ 0)
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, x2) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2, -1), <(x2, x0)), <(x1, x0)), EOS(STATIC_3176(x0)), x1, x2)
- (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)
- (x1[2] + x2[2] + x0[2] ≥ 0∧x2[2] ≥ 0∧x0[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [(2)bni_17]x2[2] + [bni_17]x1[2] + [(2)bni_17]x0[2] ≥ 0∧[(-1)bso_18] ≥ 0)
COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0)), x1, x2) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0)), x1, +(x2, 1))
- ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_19] = 0∧0 = 0∧0 = 0∧0 = 0∧[(-1)bso_20] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(3176_0_DISPLAYCHESSBOARD_GE(x₁, x₂, x₃)) = [-1] + [-1]x₂ + [2]x₁
POL(EOS(x₁)) = x₁
POL(STATIC_3176(x₁)) = x₁
POL(COND_3176_0_DISPLAYCHESSBOARD_GE(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₃ + [2]x₂
POL(&&(x₁, x₂)) = [-1]
POL(>=(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(1) = [1]
POL(0) = 0
POL(COND_3176_0_DISPLAYCHESSBOARD_GE1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₃ + [2]x₂
POL(<(x₁, x₂)) = [-1]

The following pairs are in P_>:

COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), +(x1[1], 1), 0)

The following pairs are in P_bound:

3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0]) → COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])

The following pairs are in P_≥:

3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0]) → COND_3176_0_DISPLAYCHESSBOARD_GE(&&(&&(>=(x2[0], x0[0]), >(x1[0], -1)), >(x0[0], +(x1[0], 1))), EOS(STATIC_3176(x0[0])), x1[0], x2[0])
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])
COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))

There are no usable rules.

(28) Complex Obligation (AND)

(29) Obligation:

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

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

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[0])), x1[0], x2[0]) → COND_3176_0_DISPLAYCHESSBOARD_GE(x2[0] >= x0[0] && x1[0] > -1 && x0[0] > x1[0] + 1, EOS(STATIC_3176(x0[0])), x1[0], x2[0])
(2): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2], EOS(STATIC_3176(x0[2])), x1[2], x2[2])
(3): COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], x2[3] + 1)

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

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

(2) -> (3), if (x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2] ∧EOS(STATIC_3176(x0[2])) →^* EOS(STATIC_3176(x0[3]))∧x1[2] →^* x1[3]∧x2[2] →^* x2[3])

The set Q is empty.

(30) IDependencyGraphProof (EQUIVALENT transformation)

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

(31) Obligation:

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

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

The following domains are used:

Integer, Boolean

R is empty.

The integer pair graph contains the following rules and edges:
(3): COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], x2[3] + 1)
(2): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2], EOS(STATIC_3176(x0[2])), x1[2], x2[2])

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

(2) -> (3), if (x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2] ∧EOS(STATIC_3176(x0[2])) →^* EOS(STATIC_3176(x0[3]))∧x1[2] →^* x1[3]∧x2[2] →^* x2[3])

The set Q is empty.

(32) IDPNonInfProof (SOUND transformation)

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

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

For Pair COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1)) the following chains were created:

We consider the chain COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1)) which results in the following constraint:
(1)    (COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3])≥NonInfC∧COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3])≥3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))∧(U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥))

We simplified constraint (1) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(2)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_10] = 0∧[1 + (-1)bso_11] ≥ 0)

We simplified constraint (2) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(3)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_10] = 0∧[1 + (-1)bso_11] ≥ 0)

We simplified constraint (3) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(4)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_10] = 0∧[1 + (-1)bso_11] ≥ 0)

We simplified constraint (4) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(5)    ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_10] = 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_11] ≥ 0)

For Pair 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2]) the following chains were created:

We consider the chain 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2]), COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1)) which results in the following constraint:
(6)    (&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2]))=TRUE∧EOS(STATIC_3176(x0[2]))=EOS(STATIC_3176(x0[3]))∧x1[2]=x1[3]∧x2[2]=x2[3] ⇒ 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥NonInfC∧3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])∧(U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥))

We simplified constraint (6) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(7)    (<(x1[2], x0[2])=TRUE∧>(x2[2], -1)=TRUE∧<(x2[2], x0[2])=TRUE ⇒ 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥NonInfC∧3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2])≥COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])∧(U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥))

We simplified constraint (7) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(8)    (x0[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] ≥ 0∧x0[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [(-1)bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (8) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(9)    (x0[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] ≥ 0∧x0[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [(-1)bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (9) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(10)    (x0[2] + [-1] + [-1]x1[2] ≥ 0∧x2[2] ≥ 0∧x0[2] + [-1] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[(-1)bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [(-1)bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (10) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(11)    (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (11) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(12)    (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

(13)    (x0[2] ≥ 0∧x2[2] ≥ 0∧[-1]x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [(-1)bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(14)    (x1[2] + x2[2] + x0[2] ≥ 0∧x2[2] ≥ 0∧x0[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [bni_12]x2[2] + [bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

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

COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))
- ((U^Increasing(3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))), ≥)∧[bni_10] = 0∧0 = 0∧0 = 0∧0 = 0∧[1 + (-1)bso_11] ≥ 0)
3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])
- (x0[2] ≥ 0∧x2[2] ≥ 0∧x1[2] + x0[2] + [-1]x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [(-1)bni_12]x2[2] + [bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)
- (x1[2] + x2[2] + x0[2] ≥ 0∧x2[2] ≥ 0∧x0[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])), ≥)∧[bni_12 + (-1)Bound*bni_12] + [bni_12]x2[2] + [bni_12]x1[2] + [(2)bni_12]x0[2] ≥ 0∧[(-1)bso_13] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(COND_3176_0_DISPLAYCHESSBOARD_GE1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₃ + [2]x₂ + [-1]x₄
POL(EOS(x₁)) = x₁
POL(STATIC_3176(x₁)) = x₁
POL(3176_0_DISPLAYCHESSBOARD_GE(x₁, x₂, x₃)) = [-1] + [-1]x₃ + [-1]x₂ + [2]x₁
POL(+(x₁, x₂)) = x₁ + x₂
POL(1) = [1]
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(-1) = [-1]
POL(<(x₁, x₂)) = [-1]

The following pairs are in P_>:

COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], +(x2[3], 1))

The following pairs are in P_bound:

3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])

The following pairs are in P_≥:

3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(&&(&&(>(x2[2], -1), <(x2[2], x0[2])), <(x1[2], x0[2])), EOS(STATIC_3176(x0[2])), x1[2], x2[2])

There are no usable rules.

(33) Complex Obligation (AND)

(34) Obligation:

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

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

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(2): 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[2])), x1[2], x2[2]) → COND_3176_0_DISPLAYCHESSBOARD_GE1(x2[2] > -1 && x2[2] < x0[2] && x1[2] < x0[2], EOS(STATIC_3176(x0[2])), x1[2], x2[2])

The set Q is empty.

(35) IDependencyGraphProof (EQUIVALENT transformation)

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

(36) TRUE

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

(38) IDependencyGraphProof (EQUIVALENT transformation)

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

(39) TRUE

(40) 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): COND_3176_0_DISPLAYCHESSBOARD_GE(TRUE, EOS(STATIC_3176(x0[1])), x1[1], x2[1]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[1])), x1[1] + 1, 0)
(3): COND_3176_0_DISPLAYCHESSBOARD_GE1(TRUE, EOS(STATIC_3176(x0[3])), x1[3], x2[3]) → 3176_0_DISPLAYCHESSBOARD_GE(EOS(STATIC_3176(x0[3])), x1[3], x2[3] + 1)

The set Q is empty.

(41) IDependencyGraphProof (EQUIVALENT transformation)

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

(42) TRUE

(43) Obligation:

SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: Queen.search(I)Z
SCC calls the following helper methods: Queen.safeMove(II)Z, Queen.search(I)Z, Queen.wrongPos(IIII)Z, Queen.displayChessboard()V
Performed SCC analyses: UsedFieldsAnalysis

(44) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 49 rules for P and 260 rules for R.

P rules:
3284_0_search_Store(EOS(STATIC_3284(i867)), i866, matching1) → 3289_0_search_Load(EOS(STATIC_3289(i867)), i866, 0) | =(matching1, 0)
3289_0_search_Load(EOS(STATIC_3289(i867)), i866, matching1) → 3294_0_search_FieldAccess(EOS(STATIC_3294(i867)), i866, 0, i866) | =(matching1, 0)
3294_0_search_FieldAccess(EOS(STATIC_3294(i867)), i866, matching1, i866) → 3299_0_search_LT(EOS(STATIC_3299(i867)), i866, 0, i866, i867) | =(matching1, 0)
3299_0_search_LT(EOS(STATIC_3299(i867)), i866, matching1, i866, i867) → 3305_0_search_LT(EOS(STATIC_3305(i867)), i866, 0, i866, i867) | =(matching1, 0)
3305_0_search_LT(EOS(STATIC_3305(i867)), i866, matching1, i866, i867) → 3312_0_search_ConstantStackPush(EOS(STATIC_3312(i867)), i866, 0) | &&(<(i866, i867), =(matching1, 0))
3312_0_search_ConstantStackPush(EOS(STATIC_3312(i867)), i866, matching1) → 3317_0_search_Store(EOS(STATIC_3317(i867)), i866, 0, 0) | =(matching1, 0)
3317_0_search_Store(EOS(STATIC_3317(i867)), i866, matching1, matching2) → 3324_0_search_Load(EOS(STATIC_3324(i867)), i866, 0, 0) | &&(=(matching1, 0), =(matching2, 0))
3324_0_search_Load(EOS(STATIC_3324(i867)), i866, matching1, matching2) → 3461_0_search_Load(EOS(STATIC_3461(i867)), i866, 0, 0) | &&(=(matching1, 0), =(matching2, 0))
3461_0_search_Load(EOS(STATIC_3461(i916)), i915, matching1, i918) → 3592_0_search_Load(EOS(STATIC_3592(i916)), i915, 0, i918) | =(matching1, 0)
3592_0_search_Load(EOS(STATIC_3592(i985)), i984, matching1, i987) → 3717_0_search_Load(EOS(STATIC_3717(i985)), i984, 0, i987) | =(matching1, 0)
3717_0_search_Load(EOS(STATIC_3717(i1089)), i1088, matching1, i1091) → 3782_0_search_Load(EOS(STATIC_3782(i1089)), i1088, 0, i1091) | =(matching1, 0)
3782_0_search_Load(EOS(STATIC_3782(i1148)), i1147, matching1, i1150) → 3897_0_search_Load(EOS(STATIC_3897(i1148)), i1147, 0, i1150) | =(matching1, 0)
3897_0_search_Load(EOS(STATIC_3897(i1239)), i1238, matching1, i1241) → 3901_0_search_NE(EOS(STATIC_3901(i1239)), i1238, 0, i1241, 0) | =(matching1, 0)
3901_0_search_NE(EOS(STATIC_3901(i1239)), i1238, matching1, i1241, matching2) → 3905_0_search_Load(EOS(STATIC_3905(i1239)), i1238, 0, i1241) | &&(=(matching1, 0), =(matching2, 0))
3905_0_search_Load(EOS(STATIC_3905(i1239)), i1238, matching1, i1241) → 3908_0_search_FieldAccess(EOS(STATIC_3908(i1239)), i1238, 0, i1241, i1241) | =(matching1, 0)
3908_0_search_FieldAccess(EOS(STATIC_3908(i1239)), i1238, matching1, i1241, i1241) → 3909_0_search_GE(EOS(STATIC_3909(i1239)), i1238, 0, i1241, i1241, i1239) | =(matching1, 0)
3909_0_search_GE(EOS(STATIC_3909(i1239)), i1238, matching1, i1241, i1241, i1239) → 3912_0_search_GE(EOS(STATIC_3912(i1239)), i1238, 0, i1241, i1241, i1239) | =(matching1, 0)
3912_0_search_GE(EOS(STATIC_3912(i1239)), i1238, matching1, i1241, i1241, i1239) → 3915_0_search_Load(EOS(STATIC_3915(i1239)), i1238, 0, i1241) | &&(<(i1241, i1239), =(matching1, 0))
3915_0_search_Load(EOS(STATIC_3915(i1239)), i1238, matching1, i1241) → 3917_0_search_Load(EOS(STATIC_3917(i1239)), i1238, 0, i1241, i1238) | =(matching1, 0)
3917_0_search_Load(EOS(STATIC_3917(i1239)), i1238, matching1, i1241, i1238) → 3919_0_search_InvokeMethod(EOS(STATIC_3919(i1239)), i1238, 0, i1241, i1238, i1241) | =(matching1, 0)
3919_0_search_InvokeMethod(EOS(STATIC_3919(i1239)), i1238, matching1, i1241, i1238, i1241) → 3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(i1239)), i1238, i1241), i1238, 0, i1241, i1238, i1241) | =(matching1, 0)
3922_1_search_InvokeMethod(3372_0_safeMove_Return(EOS(STATIC_3372(i1261)), i870), i1258, matching1, i1259, i1258, i1259) → 3930_0_safeMove_Return(EOS(STATIC_3930(i1261)), i1258, 0, i1259, i1258, i1259, i870) | =(matching1, 0)
3930_0_safeMove_Return(EOS(STATIC_3930(i1261)), i1258, matching1, i1259, i1258, i1259, i870) → 3933_0_search_EQ(EOS(STATIC_3933(i1261)), i1258, 0, i1259, i870) | =(matching1, 0)
3933_0_search_EQ(EOS(STATIC_3933(i1261)), i1258, matching1, i1259, i1274) → 3936_0_search_EQ(EOS(STATIC_3936(i1261)), i1258, 0, i1259, i1274) | =(matching1, 0)
3933_0_search_EQ(EOS(STATIC_3933(i1261)), i1258, matching1, i1259, matching2) → 3937_0_search_EQ(EOS(STATIC_3937(i1261)), i1258, 0, i1259, 0) | &&(=(matching1, 0), =(matching2, 0))
3936_0_search_EQ(EOS(STATIC_3936(i1261)), i1258, matching1, i1259, i1274) → 3940_0_search_FieldAccess(EOS(STATIC_3940(i1261)), i1258, i1259) | &&(>(i1274, 0), =(matching1, 0))
3940_0_search_FieldAccess(EOS(STATIC_3940(i1261)), i1258, i1259) → 3944_0_search_Load(EOS(STATIC_3944(i1261)), i1258, i1259, java.lang.Object(ARRAY(i1261)))
3944_0_search_Load(EOS(STATIC_3944(i1261)), i1258, i1259, java.lang.Object(ARRAY(i1261))) → 3953_0_search_Load(EOS(STATIC_3953(i1261)), i1258, i1259, java.lang.Object(ARRAY(i1261)), i1258)
3953_0_search_Load(EOS(STATIC_3953(i1261)), i1258, i1259, java.lang.Object(ARRAY(i1261)), i1258) → 3958_0_search_ArrayAccess(EOS(STATIC_3958(i1261)), i1258, i1259, java.lang.Object(ARRAY(i1261)), i1258, i1259)
3958_0_search_ArrayAccess(EOS(STATIC_3958(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3962_0_search_ArrayAccess(EOS(STATIC_3962(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3962_0_search_ArrayAccess(EOS(STATIC_3962(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3964_0_search_ArrayAccess(EOS(STATIC_3964(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3964_0_search_ArrayAccess(EOS(STATIC_3964(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3967_0_search_Load(EOS(STATIC_3967(i1261)), i1295, i1259) | <(i1295, i1261)
3967_0_search_Load(EOS(STATIC_3967(i1261)), i1295, i1259) → 3970_0_search_ConstantStackPush(EOS(STATIC_3970(i1261)), i1295, i1259, i1295)
3970_0_search_ConstantStackPush(EOS(STATIC_3970(i1261)), i1295, i1259, i1295) → 3973_0_search_IntArithmetic(EOS(STATIC_3973(i1261)), i1295, i1259, i1295, 1)
3973_0_search_IntArithmetic(EOS(STATIC_3973(i1261)), i1295, i1259, i1295, matching1) → 3975_0_search_InvokeMethod(EOS(STATIC_3975(i1261)), i1295, i1259, +(i1295, 1)) | &&(>=(i1295, 0), =(matching1, 1))
3975_0_search_InvokeMethod(EOS(STATIC_3975(i1261)), i1295, i1259, i1296) → 3979_1_search_InvokeMethod(3979_0_search_ConstantStackPush(EOS(STATIC_3979(i1261)), i1296), i1295, i1259, i1296)
3979_0_search_ConstantStackPush(EOS(STATIC_3979(i1261)), i1296) → 3982_0_search_ConstantStackPush(EOS(STATIC_3982(i1261)), i1296)
3979_1_search_InvokeMethod(3916_0_search_Return(EOS(STATIC_3916(i1307)), matching1), i1295, i1259, i1306) → 3997_0_search_Return(EOS(STATIC_3997(i1307)), i1295, i1259, i1306, 0) | =(matching1, 0)
3982_0_search_ConstantStackPush(EOS(STATIC_3982(i1261)), i1296) → 3281_0_search_ConstantStackPush(EOS(STATIC_3281(i1261)), i1296)
3281_0_search_ConstantStackPush(EOS(STATIC_3281(i867)), i866) → 3284_0_search_Store(EOS(STATIC_3284(i867)), i866, 0)
3997_0_search_Return(EOS(STATIC_3997(i1307)), i1295, i1259, i1306, matching1) → 4002_0_search_Store(EOS(STATIC_4002(i1307)), i1295, i1259, 0) | =(matching1, 0)
4002_0_search_Store(EOS(STATIC_4002(i1307)), i1295, i1259, matching1) → 4008_0_search_Inc(EOS(STATIC_4008(i1307)), i1295, 0, i1259) | =(matching1, 0)
4008_0_search_Inc(EOS(STATIC_4008(i1307)), i1295, matching1, i1259) → 4012_0_search_JMP(EOS(STATIC_4012(i1307)), i1295, 0, +(i1259, 1)) | =(matching1, 0)
4012_0_search_JMP(EOS(STATIC_4012(i1307)), i1295, matching1, i1317) → 4020_0_search_Load(EOS(STATIC_4020(i1307)), i1295, 0, i1317) | =(matching1, 0)
4020_0_search_Load(EOS(STATIC_4020(i1307)), i1295, matching1, i1317) → 3897_0_search_Load(EOS(STATIC_3897(i1307)), i1295, 0, i1317) | =(matching1, 0)
3937_0_search_EQ(EOS(STATIC_3937(i1261)), i1258, matching1, i1259, matching2) → 3941_0_search_Inc(EOS(STATIC_3941(i1261)), i1258, 0, i1259) | &&(=(matching1, 0), =(matching2, 0))
3941_0_search_Inc(EOS(STATIC_3941(i1261)), i1258, matching1, i1259) → 3946_0_search_JMP(EOS(STATIC_3946(i1261)), i1258, 0, +(i1259, 1)) | =(matching1, 0)
3946_0_search_JMP(EOS(STATIC_3946(i1261)), i1258, matching1, i1276) → 3955_0_search_Load(EOS(STATIC_3955(i1261)), i1258, 0, i1276) | =(matching1, 0)
3955_0_search_Load(EOS(STATIC_3955(i1261)), i1258, matching1, i1276) → 3897_0_search_Load(EOS(STATIC_3897(i1261)), i1258, 0, i1276) | =(matching1, 0)
R rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(i1239)), i1238, i1241) → 3925_0_safeMove_ConstantStackPush(EOS(STATIC_3925(i1239)), i1238, i1241)
3925_0_safeMove_ConstantStackPush(EOS(STATIC_3925(i1239)), i1238, i1241) → 2731_0_safeMove_ConstantStackPush(EOS(STATIC_2731(i1239)), i1238, i1241)
3451_0_wrongPos_Load(EOS(STATIC_3451(i790)), i788, i789, i871) → 3468_0_wrongPos_Load(EOS(STATIC_3468(i790)), i788, i789, i871, i910)
3326_0_displayChessboard_ConstantStackPush(EOS(STATIC_3326(i867))) → 2129_0_displayChessboard_ConstantStackPush(EOS(STATIC_2129(i867)))
2731_0_safeMove_ConstantStackPush(EOS(STATIC_2731(i710)), i708, i709) → 2738_0_safeMove_Store(EOS(STATIC_2738(i710)), i708, i709, 1)
2738_0_safeMove_Store(EOS(STATIC_2738(i710)), i708, i709, matching1) → 2746_0_safeMove_ConstantStackPush(EOS(STATIC_2746(i710)), i708, i709, 1) | =(matching1, 1)
2746_0_safeMove_ConstantStackPush(EOS(STATIC_2746(i710)), i708, i709, matching1) → 2755_0_safeMove_Store(EOS(STATIC_2755(i710)), i708, i709, 1, 0) | =(matching1, 1)
2755_0_safeMove_Store(EOS(STATIC_2755(i710)), i708, i709, matching1, matching2) → 2761_0_safeMove_Load(EOS(STATIC_2761(i710)), i708, i709, 1, 0) | &&(=(matching1, 1), =(matching2, 0))
2761_0_safeMove_Load(EOS(STATIC_2761(i710)), i708, i709, matching1, matching2) → 3052_0_safeMove_Load(EOS(STATIC_3052(i710)), i708, i709, 1, 0) | &&(=(matching1, 1), =(matching2, 0))
3052_0_safeMove_Load(EOS(STATIC_3052(i790)), i788, i789, i792, i793) → 3174_0_safeMove_Load(EOS(STATIC_3174(i790)), i788, i789, i792, i793)
3174_0_safeMove_Load(EOS(STATIC_3174(i790)), i788, i789, i828, i829) → 3268_0_safeMove_Load(EOS(STATIC_3268(i790)), i788, i789, i828, i829)
3268_0_safeMove_Load(EOS(STATIC_3268(i790)), i788, i789, i860, i861) → 3337_0_safeMove_Load(EOS(STATIC_3337(i790)), i788, i789, i860, i861)
3337_0_safeMove_Load(EOS(STATIC_3337(i790)), i788, i789, i870, i871) → 3343_0_safeMove_Load(EOS(STATIC_3343(i790)), i788, i789, i870, i871, i871)
3343_0_safeMove_Load(EOS(STATIC_3343(i790)), i788, i789, i870, i871, i871) → 3349_0_safeMove_GE(EOS(STATIC_3349(i790)), i788, i789, i870, i871, i871, i788)
3349_0_safeMove_GE(EOS(STATIC_3349(i790)), i788, i789, i870, i871, i871, i788) → 3357_0_safeMove_GE(EOS(STATIC_3357(i790)), i788, i789, i870, i871, i871, i788)
3349_0_safeMove_GE(EOS(STATIC_3349(i790)), i788, i789, i870, i871, i871, i788) → 3358_0_safeMove_GE(EOS(STATIC_3358(i790)), i788, i789, i870, i871, i871, i788)
3357_0_safeMove_GE(EOS(STATIC_3357(i790)), i788, i789, i870, i871, i871, i788) → 3364_0_safeMove_Load(EOS(STATIC_3364(i790)), i870) | >=(i871, i788)
3358_0_safeMove_GE(EOS(STATIC_3358(i790)), i788, i789, i870, i871, i871, i788) → 3365_0_safeMove_Load(EOS(STATIC_3365(i790)), i788, i789, i870, i871) | <(i871, i788)
3364_0_safeMove_Load(EOS(STATIC_3364(i790)), i870) → 3372_0_safeMove_Return(EOS(STATIC_3372(i790)), i870)
3365_0_safeMove_Load(EOS(STATIC_3365(i790)), i788, i789, i870, i871) → 3374_0_safeMove_EQ(EOS(STATIC_3374(i790)), i788, i789, i871, i870)
3374_0_safeMove_EQ(EOS(STATIC_3374(i790)), i788, i789, i871, i885) → 3382_0_safeMove_EQ(EOS(STATIC_3382(i790)), i788, i789, i871, i885)
3374_0_safeMove_EQ(EOS(STATIC_3374(i790)), i788, i789, i871, matching1) → 3383_0_safeMove_EQ(EOS(STATIC_3383(i790)), i788, i789, i871, 0) | =(matching1, 0)
3382_0_safeMove_EQ(EOS(STATIC_3382(i790)), i788, i789, i871, i885) → 3389_0_safeMove_Load(EOS(STATIC_3389(i790)), i788, i789, i871) | >(i885, 0)
3383_0_safeMove_EQ(EOS(STATIC_3383(i790)), i788, i789, i871, matching1) → 3391_0_safeMove_ConstantStackPush(EOS(STATIC_3391(i790)), i788, i789, i871) | =(matching1, 0)
3389_0_safeMove_Load(EOS(STATIC_3389(i790)), i788, i789, i871) → 3398_0_safeMove_Load(EOS(STATIC_3398(i790)), i788, i789, i871, i788)
3391_0_safeMove_ConstantStackPush(EOS(STATIC_3391(i790)), i788, i789, i871) → 3572_0_safeMove_ConstantStackPush(EOS(STATIC_3572(i790)), i788, i789, i871)
3398_0_safeMove_Load(EOS(STATIC_3398(i790)), i788, i789, i871, i788) → 3406_0_safeMove_Load(EOS(STATIC_3406(i790)), i788, i789, i871, i788, i789)
3406_0_safeMove_Load(EOS(STATIC_3406(i790)), i788, i789, i871, i788, i789) → 3412_0_safeMove_FieldAccess(EOS(STATIC_3412(i790)), i788, i789, i871, i788, i789, i871)
3412_0_safeMove_FieldAccess(EOS(STATIC_3412(i790)), i788, i789, i871, i788, i789, i871) → 3420_0_safeMove_Load(EOS(STATIC_3420(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)))
3420_0_safeMove_Load(EOS(STATIC_3420(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790))) → 3427_0_safeMove_ArrayAccess(EOS(STATIC_3427(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3427_0_safeMove_ArrayAccess(EOS(STATIC_3427(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3432_0_safeMove_ArrayAccess(EOS(STATIC_3432(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3427_0_safeMove_ArrayAccess(EOS(STATIC_3427(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3433_0_safeMove_ArrayAccess(EOS(STATIC_3433(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3432_0_safeMove_ArrayAccess(EOS(STATIC_3432(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3438_0_safeMove_InvokeMethod(EOS(STATIC_3438(i790)), i788, i789, i871, i788, i789, i871) | <(i871, i790)
3433_0_safeMove_ArrayAccess(EOS(STATIC_3433(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3439_0_<init>_Load(EOS(STATIC_3439(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) | >=(i871, i790)
3438_0_safeMove_InvokeMethod(EOS(STATIC_3438(i790)), i788, i789, i871, i788, i789, i871) → 3445_1_safeMove_InvokeMethod(3445_0_wrongPos_Load(EOS(STATIC_3445(i790)), i788, i789, i871), i788, i789, i871, i788, i789, i871)
3439_0_<init>_Load(EOS(STATIC_3439(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3452_0_<init>_InvokeMethod(EOS(STATIC_3452(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3445_0_wrongPos_Load(EOS(STATIC_3445(i790)), i788, i789, i871) → 3451_0_wrongPos_Load(EOS(STATIC_3451(i790)), i788, i789, i871)
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647(i1026)), matching1), i1021, i1022, i1023, i1021, i1022, i1023) → 3665_0_wrongPos_Return(EOS(STATIC_3665(i1026)), i1021, i1022, i1023, i1021, i1022, i1023, 0) | =(matching1, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(i1051)), matching1), i1046, i1047, i1048, i1046, i1047, i1048) → 3677_0_wrongPos_Return(EOS(STATIC_3677(i1051)), i1046, i1047, i1048, i1046, i1047, i1048, 1) | =(matching1, 1)
3452_0_<init>_InvokeMethod(EOS(STATIC_3452(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3463_0_<init>_Load(EOS(STATIC_3463(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3463_0_<init>_Load(EOS(STATIC_3463(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3474_0_<init>_InvokeMethod(EOS(STATIC_3474(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3474_0_<init>_InvokeMethod(EOS(STATIC_3474(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3479_0_<init>_Load(EOS(STATIC_3479(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3479_0_<init>_Load(EOS(STATIC_3479(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3490_0_<init>_InvokeMethod(EOS(STATIC_3490(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3490_0_<init>_InvokeMethod(EOS(STATIC_3490(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3496_0_<init>_Load(EOS(STATIC_3496(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3496_0_<init>_Load(EOS(STATIC_3496(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3510_0_<init>_InvokeMethod(EOS(STATIC_3510(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3510_0_<init>_InvokeMethod(EOS(STATIC_3510(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3520_0_<init>_Load(EOS(STATIC_3520(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3520_0_<init>_Load(EOS(STATIC_3520(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3533_0_<init>_InvokeMethod(EOS(STATIC_3533(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3533_0_<init>_InvokeMethod(EOS(STATIC_3533(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3542_0_<init>_Load(EOS(STATIC_3542(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3542_0_<init>_Load(EOS(STATIC_3542(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3549_0_<init>_Load(EOS(STATIC_3549(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3549_0_<init>_Load(EOS(STATIC_3549(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3559_0_<init>_FieldAccess(EOS(STATIC_3559(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3556_0_wrongPos_Return(EOS(STATIC_3556(i970)), i968, i969, i972, i968, i969, i972, matching1) → 3666_0_wrongPos_Return(EOS(STATIC_3666(i970)), i968, i969, i972, i968, i969, i972, 1) | =(matching1, 1)
3559_0_<init>_FieldAccess(EOS(STATIC_3559(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3568_0_<init>_Load(EOS(STATIC_3568(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3568_0_<init>_Load(EOS(STATIC_3568(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3576_0_<init>_InvokeMethod(EOS(STATIC_3576(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3572_0_safeMove_ConstantStackPush(EOS(STATIC_3572(i970)), i968, i969, i972) → 3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686(i970)), i968, i969, i972)
3576_0_<init>_InvokeMethod(EOS(STATIC_3576(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3586_0_<init>_StackPop(EOS(STATIC_3586(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3586_0_<init>_StackPop(EOS(STATIC_3586(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3598_0_<init>_Return(EOS(STATIC_3598(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3598_0_<init>_Return(EOS(STATIC_3598(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3605_0_<init>_Return(EOS(STATIC_3605(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3605_0_<init>_Return(EOS(STATIC_3605(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3612_0_<init>_Return(EOS(STATIC_3612(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3612_0_<init>_Return(EOS(STATIC_3612(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3619_0_<init>_Return(EOS(STATIC_3619(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3619_0_<init>_Return(EOS(STATIC_3619(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3625_0_<init>_Return(EOS(STATIC_3625(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3625_0_<init>_Return(EOS(STATIC_3625(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(i790)), i788, i789, i871, i788, i789, i871, java.lang.Object(ARRAY(i790)), i871)
3665_0_wrongPos_Return(EOS(STATIC_3665(i1026)), i1021, i1022, i1023, i1021, i1022, i1023, matching1) → 3666_0_wrongPos_Return(EOS(STATIC_3666(i1026)), i1021, i1022, i1023, i1021, i1022, i1023, 0) | =(matching1, 0)
3666_0_wrongPos_Return(EOS(STATIC_3666(i1030)), i1028, i1029, i1033, i1028, i1029, i1033, i1032) → 3675_0_safeMove_NE(EOS(STATIC_3675(i1030)), i1028, i1029, i1033, i1032)
3675_0_safeMove_NE(EOS(STATIC_3675(i1030)), i1028, i1029, i1033, matching1) → 3680_0_safeMove_NE(EOS(STATIC_3680(i1030)), i1028, i1029, i1033, 1) | =(matching1, 1)
3675_0_safeMove_NE(EOS(STATIC_3675(i1030)), i1028, i1029, i1033, matching1) → 3681_0_safeMove_NE(EOS(STATIC_3681(i1030)), i1028, i1029, i1033, 0) | =(matching1, 0)
3677_0_wrongPos_Return(EOS(STATIC_3677(i1051)), i1046, i1047, i1048, i1046, i1047, i1048, matching1) → 3666_0_wrongPos_Return(EOS(STATIC_3666(i1051)), i1046, i1047, i1048, i1046, i1047, i1048, 1) | =(matching1, 1)
3680_0_safeMove_NE(EOS(STATIC_3680(i1030)), i1028, i1029, i1033, matching1) → 3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686(i1030)), i1028, i1029, i1033) | &&(>(1, 0), =(matching1, 1))
3681_0_safeMove_NE(EOS(STATIC_3681(i1030)), i1028, i1029, i1033, matching1) → 3689_0_safeMove_ConstantStackPush(EOS(STATIC_3689(i1030)), i1028, i1029, i1033) | =(matching1, 0)
3686_0_safeMove_ConstantStackPush(EOS(STATIC_3686(i1030)), i1028, i1029, i1033) → 3694_0_safeMove_Store(EOS(STATIC_3694(i1030)), i1028, i1029, i1033, 0)
3689_0_safeMove_ConstantStackPush(EOS(STATIC_3689(i1030)), i1028, i1029, i1033) → 3695_0_safeMove_JMP(EOS(STATIC_3695(i1030)), i1028, i1029, i1033, 1)
3694_0_safeMove_Store(EOS(STATIC_3694(i1030)), i1028, i1029, i1033, matching1) → 3702_0_safeMove_Inc(EOS(STATIC_3702(i1030)), i1028, i1029, 0, i1033) | =(matching1, 0)
3695_0_safeMove_JMP(EOS(STATIC_3695(i1030)), i1028, i1029, i1033, matching1) → 3704_0_safeMove_Store(EOS(STATIC_3704(i1030)), i1028, i1029, i1033, 1) | =(matching1, 1)
3702_0_safeMove_Inc(EOS(STATIC_3702(i1030)), i1028, i1029, matching1, i1033) → 3710_0_safeMove_JMP(EOS(STATIC_3710(i1030)), i1028, i1029, 0, +(i1033, 1)) | &&(>=(i1033, 0), =(matching1, 0))
3704_0_safeMove_Store(EOS(STATIC_3704(i1030)), i1028, i1029, i1033, matching1) → 3711_0_safeMove_Inc(EOS(STATIC_3711(i1030)), i1028, i1029, 1, i1033) | =(matching1, 1)
3710_0_safeMove_JMP(EOS(STATIC_3710(i1030)), i1028, i1029, matching1, i1087) → 3725_0_safeMove_Load(EOS(STATIC_3725(i1030)), i1028, i1029, 0, i1087) | =(matching1, 0)
3711_0_safeMove_Inc(EOS(STATIC_3711(i1030)), i1028, i1029, matching1, i1033) → 3726_0_safeMove_JMP(EOS(STATIC_3726(i1030)), i1028, i1029, 1, +(i1033, 1)) | &&(>=(i1033, 0), =(matching1, 1))
3725_0_safeMove_Load(EOS(STATIC_3725(i1030)), i1028, i1029, matching1, i1087) → 3337_0_safeMove_Load(EOS(STATIC_3337(i1030)), i1028, i1029, 0, i1087) | =(matching1, 0)
3726_0_safeMove_JMP(EOS(STATIC_3726(i1030)), i1028, i1029, matching1, i1108) → 3731_0_safeMove_Load(EOS(STATIC_3731(i1030)), i1028, i1029, 1, i1108) | =(matching1, 1)
3731_0_safeMove_Load(EOS(STATIC_3731(i1030)), i1028, i1029, matching1, i1108) → 3337_0_safeMove_Load(EOS(STATIC_3337(i1030)), i1028, i1029, 1, i1108) | =(matching1, 1)
3299_0_search_LT(EOS(STATIC_3299(i867)), i866, matching1, i866, i867) → 3306_0_search_LT(EOS(STATIC_3306(i867)), i866, 0, i866, i867) | =(matching1, 0)
3306_0_search_LT(EOS(STATIC_3306(i867)), i866, matching1, i866, i867) → 3313_0_search_InvokeMethod(EOS(STATIC_3313(i867)), 0) | &&(>=(i866, i867), =(matching1, 0))
3313_0_search_InvokeMethod(EOS(STATIC_3313(i867)), matching1) → 3319_1_search_InvokeMethod(3319_0_displayChessboard_ConstantStackPush(EOS(STATIC_3319(i867))), 0) | =(matching1, 0)
3319_0_displayChessboard_ConstantStackPush(EOS(STATIC_3319(i867))) → 3326_0_displayChessboard_ConstantStackPush(EOS(STATIC_3326(i867)))
3319_1_search_InvokeMethod(2676_0_displayChessboard_Return(EOS(STATIC_2676(i877))), matching1) → 3347_0_displayChessboard_Return(EOS(STATIC_3347(i877)), 0) | =(matching1, 0)
3319_1_search_InvokeMethod(3415_0_displayChessboard_ArrayAccess(EOS(STATIC_3415(i906)), i663, i825, java.lang.Object(ARRAY(i906)), i663), matching1) → 3434_0_displayChessboard_ArrayAccess(EOS(STATIC_3434(i906)), 0, i663, i825, java.lang.Object(ARRAY(i906)), i663) | =(matching1, 0)
3347_0_displayChessboard_Return(EOS(STATIC_3347(i877)), matching1) → 3355_0_search_FieldAccess(EOS(STATIC_3355(i877)), 0) | =(matching1, 0)
3355_0_search_FieldAccess(EOS(STATIC_3355(i877)), matching1) → 3363_0_search_ConstantStackPush(EOS(STATIC_3363(i877)), 0) | =(matching1, 0)
3363_0_search_ConstantStackPush(EOS(STATIC_3363(i877)), matching1) → 3371_0_search_IntArithmetic(EOS(STATIC_3371(i877)), 0) | =(matching1, 0)
3371_0_search_IntArithmetic(EOS(STATIC_3371(i877)), matching1) → 3379_0_search_FieldAccess(EOS(STATIC_3379(i877)), 0) | =(matching1, 0)
3379_0_search_FieldAccess(EOS(STATIC_3379(i877)), matching1) → 3388_0_search_JMP(EOS(STATIC_3388(i877)), 0) | =(matching1, 0)
3388_0_search_JMP(EOS(STATIC_3388(i877)), matching1) → 3396_0_search_Load(EOS(STATIC_3396(i877)), 0) | =(matching1, 0)
3396_0_search_Load(EOS(STATIC_3396(i877)), matching1) → 3913_0_search_Load(EOS(STATIC_3913(i877)), 0) | =(matching1, 0)
3434_0_displayChessboard_ArrayAccess(EOS(STATIC_3434(i906)), matching1, i663, i825, java.lang.Object(ARRAY(i906)), i663) → 3441_0_search_InvokeMethod(EOS(STATIC_3441(i906)), 0) | =(matching1, 0)
3909_0_search_GE(EOS(STATIC_3909(i1239)), i1238, matching1, i1241, i1241, i1239) → 3911_0_search_GE(EOS(STATIC_3911(i1239)), i1238, 0, i1241, i1241, i1239) | =(matching1, 0)
3911_0_search_GE(EOS(STATIC_3911(i1239)), i1238, matching1, i1241, i1241, i1239) → 3913_0_search_Load(EOS(STATIC_3913(i1239)), 0) | &&(>=(i1241, i1239), =(matching1, 0))
3913_0_search_Load(EOS(STATIC_3913(i1239)), matching1) → 3916_0_search_Return(EOS(STATIC_3916(i1239)), 0) | =(matching1, 0)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(i1267)), i1263, i1264, i871, i1263, i1264, i871, java.lang.Object(ARRAY(i1267)), i871), i1263, matching1, i1264, i1263, i1264) → 3931_0_safeMove_ArrayAccess(EOS(STATIC_3931(i1267)), i1263, 0, i1264, i1263, i1264, i1263, i1264, i871, i1263, i1264, i871, java.lang.Object(ARRAY(i1267)), i871) | =(matching1, 0)
3931_0_safeMove_ArrayAccess(EOS(STATIC_3931(i1267)), i1263, matching1, i1264, i1263, i1264, i1263, i1264, i871, i1263, i1264, i871, java.lang.Object(ARRAY(i1267)), i871) → 3935_0_search_InvokeMethod(EOS(STATIC_3935(i1267)), i1263, 0, i1264, i1263, i1264) | =(matching1, 0)
3958_0_search_ArrayAccess(EOS(STATIC_3958(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3961_0_search_ArrayAccess(EOS(STATIC_3961(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3961_0_search_ArrayAccess(EOS(STATIC_3961(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3963_0_<init>_Load(EOS(STATIC_3963(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) | <=(i1294, -1)
3962_0_search_ArrayAccess(EOS(STATIC_3962(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3965_0_search_ArrayAccess(EOS(STATIC_3965(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3963_0_<init>_Load(EOS(STATIC_3963(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3969_0_<init>_InvokeMethod(EOS(STATIC_3969(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3965_0_search_ArrayAccess(EOS(STATIC_3965(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3968_0_<init>_Load(EOS(STATIC_3968(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) | >=(i1295, i1261)
3968_0_<init>_Load(EOS(STATIC_3968(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3974_0_<init>_InvokeMethod(EOS(STATIC_3974(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3969_0_<init>_InvokeMethod(EOS(STATIC_3969(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3972_0_<init>_Load(EOS(STATIC_3972(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3972_0_<init>_Load(EOS(STATIC_3972(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3978_0_<init>_InvokeMethod(EOS(STATIC_3978(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3974_0_<init>_InvokeMethod(EOS(STATIC_3974(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3977_0_<init>_Load(EOS(STATIC_3977(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3977_0_<init>_Load(EOS(STATIC_3977(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3984_0_<init>_InvokeMethod(EOS(STATIC_3984(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3978_0_<init>_InvokeMethod(EOS(STATIC_3978(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3981_0_<init>_Load(EOS(STATIC_3981(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3441(i1304)), matching1), i1295, i1259, i1302) → 3996_0_search_InvokeMethod(EOS(STATIC_3996(i1304)), i1295, i1259, i1302, 0) | =(matching1, 0)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3935(i1309)), i1308, matching1, i1264, i1308, i1264), i1295, i1259, i1308) → 3998_0_search_InvokeMethod(EOS(STATIC_3998(i1309)), i1295, i1259, i1308, i1308, 0, i1264, i1308, i1264) | =(matching1, 0)
3979_1_search_InvokeMethod(4004_0_search_InvokeMethod(EOS(STATIC_4004(i1324)), i1322, i1320, i1308), i1295, i1259, i1322) → 4025_0_search_InvokeMethod(EOS(STATIC_4025(i1324)), i1295, i1259, i1322, i1322, i1320, i1308)
3979_1_search_InvokeMethod(4034_0_search_InvokeMethod(EOS(STATIC_4034(i1345)), i1344, i1343, i1322), i1295, i1259, i1344) → 4052_0_search_InvokeMethod(EOS(STATIC_4052(i1345)), i1295, i1259, i1344, i1344, i1343, i1322)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_4087(i1364)), i1363, i1360, java.lang.Object(ARRAY(i1364)), i1363, i1360), i1295, i1259, i1363) → 4100_0_search_ArrayAccess(EOS(STATIC_4100(i1364)), i1295, i1259, i1363, i1363, i1360, java.lang.Object(ARRAY(i1364)), i1363, i1360)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_4106(i1380)), i1379, i1378, i1363), i1295, i1259, i1379) → 4118_0_search_InvokeMethod(EOS(STATIC_4118(i1380)), i1295, i1259, i1379, i1379, i1378, i1363)
3981_0_<init>_Load(EOS(STATIC_3981(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3987_0_<init>_InvokeMethod(EOS(STATIC_3987(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3984_0_<init>_InvokeMethod(EOS(STATIC_3984(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3986_0_<init>_Load(EOS(STATIC_3986(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3986_0_<init>_Load(EOS(STATIC_3986(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 3999_0_<init>_InvokeMethod(EOS(STATIC_3999(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
3987_0_<init>_InvokeMethod(EOS(STATIC_3987(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 3995_0_<init>_Load(EOS(STATIC_3995(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3995_0_<init>_Load(EOS(STATIC_3995(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4007_0_<init>_InvokeMethod(EOS(STATIC_4007(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
3996_0_search_InvokeMethod(EOS(STATIC_3996(i1304)), i1295, i1259, i1302, matching1) → 4001_0_search_InvokeMethod(EOS(STATIC_4001(i1304)), i1295, i1259, i1302) | =(matching1, 0)
3998_0_search_InvokeMethod(EOS(STATIC_3998(i1309)), i1295, i1259, i1308, i1308, matching1, i1264, i1308, i1264) → 4004_0_search_InvokeMethod(EOS(STATIC_4004(i1309)), i1295, i1259, i1308) | =(matching1, 0)
3999_0_<init>_InvokeMethod(EOS(STATIC_3999(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4006_0_<init>_Load(EOS(STATIC_4006(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4001_0_search_InvokeMethod(EOS(STATIC_4001(i1304)), i1295, i1259, i1302) → 4004_0_search_InvokeMethod(EOS(STATIC_4004(i1304)), i1295, i1259, i1302)
4004_0_search_InvokeMethod(EOS(STATIC_4004(i1309)), i1295, i1259, i1308) → 4034_0_search_InvokeMethod(EOS(STATIC_4034(i1309)), i1295, i1259, i1308)
4006_0_<init>_Load(EOS(STATIC_4006(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4018_0_<init>_InvokeMethod(EOS(STATIC_4018(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4007_0_<init>_InvokeMethod(EOS(STATIC_4007(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4011_0_<init>_Load(EOS(STATIC_4011(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4011_0_<init>_Load(EOS(STATIC_4011(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4028_0_<init>_InvokeMethod(EOS(STATIC_4028(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4018_0_<init>_InvokeMethod(EOS(STATIC_4018(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4027_0_<init>_Load(EOS(STATIC_4027(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4025_0_search_InvokeMethod(EOS(STATIC_4025(i1324)), i1295, i1259, i1322, i1322, i1320, i1308) → 4034_0_search_InvokeMethod(EOS(STATIC_4034(i1324)), i1295, i1259, i1322)
4027_0_<init>_Load(EOS(STATIC_4027(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4039_0_<init>_InvokeMethod(EOS(STATIC_4039(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4028_0_<init>_InvokeMethod(EOS(STATIC_4028(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4035_0_<init>_Load(EOS(STATIC_4035(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4034_0_search_InvokeMethod(EOS(STATIC_4034(i1324)), i1295, i1259, i1322) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(i1324)), i1295, i1259, i1322)
4035_0_<init>_Load(EOS(STATIC_4035(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4040_0_<init>_Load(EOS(STATIC_4040(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4039_0_<init>_InvokeMethod(EOS(STATIC_4039(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4046_0_<init>_Load(EOS(STATIC_4046(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4040_0_<init>_Load(EOS(STATIC_4040(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4047_0_<init>_FieldAccess(EOS(STATIC_4047(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4046_0_<init>_Load(EOS(STATIC_4046(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4054_0_<init>_Load(EOS(STATIC_4054(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4047_0_<init>_FieldAccess(EOS(STATIC_4047(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4058_0_<init>_Load(EOS(STATIC_4058(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4052_0_search_InvokeMethod(EOS(STATIC_4052(i1345)), i1295, i1259, i1344, i1344, i1343, i1322) → 4025_0_search_InvokeMethod(EOS(STATIC_4025(i1345)), i1295, i1259, i1344, i1344, i1343, i1322)
4054_0_<init>_Load(EOS(STATIC_4054(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4060_0_<init>_FieldAccess(EOS(STATIC_4060(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4058_0_<init>_Load(EOS(STATIC_4058(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4061_0_<init>_InvokeMethod(EOS(STATIC_4061(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4060_0_<init>_FieldAccess(EOS(STATIC_4060(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4065_0_<init>_Load(EOS(STATIC_4065(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4061_0_<init>_InvokeMethod(EOS(STATIC_4061(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4066_0_<init>_StackPop(EOS(STATIC_4066(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4065_0_<init>_Load(EOS(STATIC_4065(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4068_0_<init>_InvokeMethod(EOS(STATIC_4068(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4066_0_<init>_StackPop(EOS(STATIC_4066(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4069_0_<init>_Return(EOS(STATIC_4069(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4068_0_<init>_InvokeMethod(EOS(STATIC_4068(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4070_0_<init>_StackPop(EOS(STATIC_4070(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4069_0_<init>_Return(EOS(STATIC_4069(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4072_0_<init>_Return(EOS(STATIC_4072(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4070_0_<init>_StackPop(EOS(STATIC_4070(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4073_0_<init>_Return(EOS(STATIC_4073(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4072_0_<init>_Return(EOS(STATIC_4072(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4074_0_<init>_Return(EOS(STATIC_4074(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4073_0_<init>_Return(EOS(STATIC_4073(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4076_0_<init>_Return(EOS(STATIC_4076(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4074_0_<init>_Return(EOS(STATIC_4074(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4077_0_<init>_Return(EOS(STATIC_4077(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4076_0_<init>_Return(EOS(STATIC_4076(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4078_0_<init>_Return(EOS(STATIC_4078(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4077_0_<init>_Return(EOS(STATIC_4077(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4079_0_<init>_Return(EOS(STATIC_4079(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4078_0_<init>_Return(EOS(STATIC_4078(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4081_0_<init>_Return(EOS(STATIC_4081(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4079_0_<init>_Return(EOS(STATIC_4079(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259) → 4082_0_search_ArrayAccess(EOS(STATIC_4082(i1261)), i1294, i1259, java.lang.Object(ARRAY(i1261)), i1294, i1259)
4081_0_<init>_Return(EOS(STATIC_4081(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4084_0_<init>_Return(EOS(STATIC_4084(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4084_0_<init>_Return(EOS(STATIC_4084(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259) → 4087_0_search_ArrayAccess(EOS(STATIC_4087(i1261)), i1295, i1259, java.lang.Object(ARRAY(i1261)), i1295, i1259)
4100_0_search_ArrayAccess(EOS(STATIC_4100(i1364)), i1295, i1259, i1363, i1363, i1360, java.lang.Object(ARRAY(i1364)), i1363, i1360) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(i1364)), i1295, i1259, i1363)
4118_0_search_InvokeMethod(EOS(STATIC_4118(i1380)), i1295, i1259, i1379, i1379, i1378, i1363) → 4025_0_search_InvokeMethod(EOS(STATIC_4025(i1380)), i1295, i1259, i1379, i1379, i1378, i1363)
3468_0_wrongPos_Load(EOS(STATIC_3468(i930)), i926, i927, i928, i929) → 3472_0_wrongPos_Load(EOS(STATIC_3472(i930)), i926, i927, i928, i929, i926)
3472_0_wrongPos_Load(EOS(STATIC_3472(i930)), i926, i927, i928, i929, i926) → 3478_0_wrongPos_EQ(EOS(STATIC_3478(i930)), i926, i927, i928, i929, i926, i928)
3478_0_wrongPos_EQ(EOS(STATIC_3478(i930)), i928, i927, i928, i929, i928, i928) → 3482_0_wrongPos_EQ(EOS(STATIC_3482(i930)), i928, i927, i928, i929, i928, i928)
3478_0_wrongPos_EQ(EOS(STATIC_3478(i930)), i926, i927, i928, i929, i926, i928) → 3483_0_wrongPos_EQ(EOS(STATIC_3483(i930)), i926, i927, i928, i929, i926, i928)
3482_0_wrongPos_EQ(EOS(STATIC_3482(i930)), i928, i927, i928, i929, i928, i928) → 3487_0_wrongPos_ConstantStackPush(EOS(STATIC_3487(i930)))
3483_0_wrongPos_EQ(EOS(STATIC_3483(i930)), i926, i927, i928, i929, i926, i928) → 3488_0_wrongPos_Load(EOS(STATIC_3488(i930)), i926, i927, i928, i929) | !(=(i926, i928))
3487_0_wrongPos_ConstantStackPush(EOS(STATIC_3487(i930))) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583(i930)))
3488_0_wrongPos_Load(EOS(STATIC_3488(i930)), i926, i927, i928, i929) → 3495_0_wrongPos_Load(EOS(STATIC_3495(i930)), i926, i927, i928, i929, i927)
3495_0_wrongPos_Load(EOS(STATIC_3495(i930)), i926, i927, i928, i929, i927) → 3502_0_wrongPos_EQ(EOS(STATIC_3502(i930)), i926, i927, i928, i929, i927, i929)
3502_0_wrongPos_EQ(EOS(STATIC_3502(i930)), i926, i929, i928, i929, i929, i929) → 3507_0_wrongPos_EQ(EOS(STATIC_3507(i930)), i926, i929, i928, i929, i929, i929)
3502_0_wrongPos_EQ(EOS(STATIC_3502(i930)), i926, i927, i928, i929, i927, i929) → 3508_0_wrongPos_EQ(EOS(STATIC_3508(i930)), i926, i927, i928, i929, i927, i929)
3507_0_wrongPos_EQ(EOS(STATIC_3507(i930)), i926, i929, i928, i929, i929, i929) → 3517_0_wrongPos_ConstantStackPush(EOS(STATIC_3517(i930)))
3508_0_wrongPos_EQ(EOS(STATIC_3508(i930)), i926, i927, i928, i929, i927, i929) → 3519_0_wrongPos_Load(EOS(STATIC_3519(i930)), i926, i927, i928, i929) | !(=(i927, i929))
3517_0_wrongPos_ConstantStackPush(EOS(STATIC_3517(i930))) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583(i930)))
3519_0_wrongPos_Load(EOS(STATIC_3519(i930)), i926, i927, i928, i929) → 3527_0_wrongPos_Load(EOS(STATIC_3527(i930)), i926, i927, i928, i929, i926)
3527_0_wrongPos_Load(EOS(STATIC_3527(i930)), i926, i927, i928, i929, i926) → 3532_0_wrongPos_IntArithmetic(EOS(STATIC_3532(i930)), i926, i927, i928, i929, i926, i928)
3532_0_wrongPos_IntArithmetic(EOS(STATIC_3532(i930)), i926, i927, i928, i929, i926, i928) → 3540_0_wrongPos_Load(EOS(STATIC_3540(i930)), i926, i927, i928, i929, -(i926, i928))
3540_0_wrongPos_Load(EOS(STATIC_3540(i930)), i926, i927, i928, i929, i959) → 3548_0_wrongPos_Load(EOS(STATIC_3548(i930)), i926, i927, i928, i929, i959, i927)
3548_0_wrongPos_Load(EOS(STATIC_3548(i930)), i926, i927, i928, i929, i959, i927) → 3557_0_wrongPos_IntArithmetic(EOS(STATIC_3557(i930)), i926, i927, i928, i929, i959, i927, i929)
3557_0_wrongPos_IntArithmetic(EOS(STATIC_3557(i930)), i926, i927, i928, i929, i959, i927, i929) → 3564_0_wrongPos_EQ(EOS(STATIC_3564(i930)), i926, i927, i928, i929, i959, -(i927, i929))
3564_0_wrongPos_EQ(EOS(STATIC_3564(i930)), i926, i927, i928, i929, i975, i975) → 3574_0_wrongPos_EQ(EOS(STATIC_3574(i930)), i926, i927, i928, i929, i975, i975)
3564_0_wrongPos_EQ(EOS(STATIC_3564(i930)), i926, i927, i928, i929, i959, i975) → 3575_0_wrongPos_EQ(EOS(STATIC_3575(i930)), i926, i927, i928, i929, i959, i975)
3574_0_wrongPos_EQ(EOS(STATIC_3574(i930)), i926, i927, i928, i929, i975, i975) → 3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583(i930)))
3575_0_wrongPos_EQ(EOS(STATIC_3575(i930)), i926, i927, i928, i929, i959, i975) → 3584_0_wrongPos_Load(EOS(STATIC_3584(i930)), i926, i927, i928, i929) | !(=(i959, i975))
3583_0_wrongPos_ConstantStackPush(EOS(STATIC_3583(i930))) → 3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643(i930)))
3584_0_wrongPos_Load(EOS(STATIC_3584(i930)), i926, i927, i928, i929) → 3596_0_wrongPos_Load(EOS(STATIC_3596(i930)), i927, i928, i929, i926)
3596_0_wrongPos_Load(EOS(STATIC_3596(i930)), i927, i928, i929, i926) → 3603_0_wrongPos_IntArithmetic(EOS(STATIC_3603(i930)), i927, i929, i926, i928)
3603_0_wrongPos_IntArithmetic(EOS(STATIC_3603(i930)), i927, i929, i926, i928) → 3611_0_wrongPos_Load(EOS(STATIC_3611(i930)), i927, i929, -(i926, i928))
3611_0_wrongPos_Load(EOS(STATIC_3611(i930)), i927, i929, i1002) → 3618_0_wrongPos_Load(EOS(STATIC_3618(i930)), i927, i1002, i929)
3618_0_wrongPos_Load(EOS(STATIC_3618(i930)), i927, i1002, i929) → 3623_0_wrongPos_IntArithmetic(EOS(STATIC_3623(i930)), i1002, i929, i927)
3623_0_wrongPos_IntArithmetic(EOS(STATIC_3623(i930)), i1002, i929, i927) → 3629_0_wrongPos_NE(EOS(STATIC_3629(i930)), i1002, -(i929, i927))
3629_0_wrongPos_NE(EOS(STATIC_3629(i930)), i1002, i1016) → 3635_0_wrongPos_NE(EOS(STATIC_3635(i930)), i1002, i1016)
3629_0_wrongPos_NE(EOS(STATIC_3629(i930)), i1016, i1016) → 3636_0_wrongPos_NE(EOS(STATIC_3636(i930)), i1016, i1016)
3635_0_wrongPos_NE(EOS(STATIC_3635(i930)), i1002, i1016) → 3641_0_wrongPos_ConstantStackPush(EOS(STATIC_3641(i930))) | !(=(i1002, i1016))
3636_0_wrongPos_NE(EOS(STATIC_3636(i930)), i1016, i1016) → 3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643(i930)))
3641_0_wrongPos_ConstantStackPush(EOS(STATIC_3641(i930))) → 3647_0_wrongPos_Return(EOS(STATIC_3647(i930)), 0)
3643_0_wrongPos_ConstantStackPush(EOS(STATIC_3643(i930))) → 3648_0_wrongPos_JMP(EOS(STATIC_3648(i930)), 1)
3648_0_wrongPos_JMP(EOS(STATIC_3648(i930)), matching1) → 3654_0_wrongPos_Return(EOS(STATIC_3654(i930)), 1) | =(matching1, 1)
2129_0_displayChessboard_ConstantStackPush(EOS(STATIC_2129(i481))) → 2141_0_displayChessboard_Store(EOS(STATIC_2141(i481)), 0)
2141_0_displayChessboard_Store(EOS(STATIC_2141(i481)), matching1) → 2151_0_displayChessboard_Load(EOS(STATIC_2151(i481)), 0) | =(matching1, 0)
2151_0_displayChessboard_Load(EOS(STATIC_2151(i481)), matching1) → 2381_0_displayChessboard_Load(EOS(STATIC_2381(i481)), 0) | =(matching1, 0)
2381_0_displayChessboard_Load(EOS(STATIC_2381(i551)), i552) → 2452_0_displayChessboard_Load(EOS(STATIC_2452(i551)), i552)
2452_0_displayChessboard_Load(EOS(STATIC_2452(i582)), i583) → 2532_0_displayChessboard_Load(EOS(STATIC_2532(i582)), i583)
2532_0_displayChessboard_Load(EOS(STATIC_2532(i619)), i620) → 2636_0_displayChessboard_Load(EOS(STATIC_2636(i619)), i620)
2636_0_displayChessboard_Load(EOS(STATIC_2636(i662)), i663) → 2643_0_displayChessboard_FieldAccess(EOS(STATIC_2643(i662)), i663, i663)
2643_0_displayChessboard_FieldAccess(EOS(STATIC_2643(i662)), i663, i663) → 2654_0_displayChessboard_GE(EOS(STATIC_2654(i662)), i663, i663, i662)
2654_0_displayChessboard_GE(EOS(STATIC_2654(i662)), i663, i663, i662) → 2664_0_displayChessboard_GE(EOS(STATIC_2664(i662)), i663, i663, i662)
2654_0_displayChessboard_GE(EOS(STATIC_2654(i662)), i663, i663, i662) → 2665_0_displayChessboard_GE(EOS(STATIC_2665(i662)), i663, i663, i662)
2664_0_displayChessboard_GE(EOS(STATIC_2664(i662)), i663, i663, i662) → 2676_0_displayChessboard_Return(EOS(STATIC_2676(i662))) | >=(i663, i662)
2665_0_displayChessboard_GE(EOS(STATIC_2665(i662)), i663, i663, i662) → 2678_0_displayChessboard_ConstantStackPush(EOS(STATIC_2678(i662)), i663) | <(i663, i662)
2678_0_displayChessboard_ConstantStackPush(EOS(STATIC_2678(i662)), i663) → 2689_0_displayChessboard_Store(EOS(STATIC_2689(i662)), i663, 0)
2689_0_displayChessboard_Store(EOS(STATIC_2689(i662)), i663, matching1) → 2706_0_displayChessboard_Load(EOS(STATIC_2706(i662)), i663, 0) | =(matching1, 0)
2706_0_displayChessboard_Load(EOS(STATIC_2706(i662)), i663, matching1) → 2793_0_displayChessboard_Load(EOS(STATIC_2793(i662)), i663, 0) | =(matching1, 0)
2793_0_displayChessboard_Load(EOS(STATIC_2793(i731)), i663, i732) → 2884_0_displayChessboard_Load(EOS(STATIC_2884(i731)), i663, i732)
2884_0_displayChessboard_Load(EOS(STATIC_2884(i731)), i663, i761) → 3007_0_displayChessboard_Load(EOS(STATIC_3007(i731)), i663, i761)
3007_0_displayChessboard_Load(EOS(STATIC_3007(i731)), i663, i784) → 3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i784)
3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i825) → 3165_0_displayChessboard_FieldAccess(EOS(STATIC_3165(i731)), i663, i825, i825)
3165_0_displayChessboard_FieldAccess(EOS(STATIC_3165(i731)), i663, i825, i825) → 3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731)
3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731) → 3181_0_displayChessboard_GE(EOS(STATIC_3181(i731)), i663, i825, i825, i731)
3176_0_displayChessboard_GE(EOS(STATIC_3176(i731)), i663, i825, i825, i731) → 3182_0_displayChessboard_GE(EOS(STATIC_3182(i731)), i663, i825, i825, i731)
3181_0_displayChessboard_GE(EOS(STATIC_3181(i731)), i663, i825, i825, i731) → 3188_0_displayChessboard_Inc(EOS(STATIC_3188(i731)), i663) | >=(i825, i731)
3182_0_displayChessboard_GE(EOS(STATIC_3182(i731)), i663, i825, i825, i731) → 3189_0_displayChessboard_FieldAccess(EOS(STATIC_3189(i731)), i663, i825) | <(i825, i731)
3188_0_displayChessboard_Inc(EOS(STATIC_3188(i731)), i663) → 3195_0_displayChessboard_JMP(EOS(STATIC_3195(i731)), +(i663, 1)) | >=(i663, 0)
3189_0_displayChessboard_FieldAccess(EOS(STATIC_3189(i731)), i663, i825) → 3196_0_displayChessboard_Load(EOS(STATIC_3196(i731)), i663, i825, java.lang.Object(ARRAY(i731)))
3195_0_displayChessboard_JMP(EOS(STATIC_3195(i731)), i840) → 3203_0_displayChessboard_Load(EOS(STATIC_3203(i731)), i840)
3196_0_displayChessboard_Load(EOS(STATIC_3196(i731)), i663, i825, java.lang.Object(ARRAY(i731))) → 3204_0_displayChessboard_ArrayAccess(EOS(STATIC_3204(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3203_0_displayChessboard_Load(EOS(STATIC_3203(i731)), i840) → 2636_0_displayChessboard_Load(EOS(STATIC_2636(i731)), i840)
3204_0_displayChessboard_ArrayAccess(EOS(STATIC_3204(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3212_0_displayChessboard_ArrayAccess(EOS(STATIC_3212(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3204_0_displayChessboard_ArrayAccess(EOS(STATIC_3204(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3213_0_displayChessboard_ArrayAccess(EOS(STATIC_3213(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3212_0_displayChessboard_ArrayAccess(EOS(STATIC_3212(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3221_0_displayChessboard_Load(EOS(STATIC_3221(i731)), i663, i825, i845) | <(i663, i731)
3213_0_displayChessboard_ArrayAccess(EOS(STATIC_3213(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3222_0_<init>_Load(EOS(STATIC_3222(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) | >=(i663, i731)
3221_0_displayChessboard_Load(EOS(STATIC_3221(i731)), i663, i825, i845) → 3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i845, i825)
3222_0_<init>_Load(EOS(STATIC_3222(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3243_0_<init>_InvokeMethod(EOS(STATIC_3243(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i825, i825) → 3240_0_displayChessboard_EQ(EOS(STATIC_3240(i731)), i663, i825, i825, i825)
3231_0_displayChessboard_EQ(EOS(STATIC_3231(i731)), i663, i825, i845, i825) → 3241_0_displayChessboard_EQ(EOS(STATIC_3241(i731)), i663, i825, i845, i825)
3240_0_displayChessboard_EQ(EOS(STATIC_3240(i731)), i663, i825, i825, i825) → 3249_0_displayChessboard_Inc(EOS(STATIC_3249(i731)), i663, i825)
3241_0_displayChessboard_EQ(EOS(STATIC_3241(i731)), i663, i825, i845, i825) → 3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825) | !(=(i845, i825))
3243_0_<init>_InvokeMethod(EOS(STATIC_3243(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3252_0_<init>_Load(EOS(STATIC_3252(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3249_0_displayChessboard_Inc(EOS(STATIC_3249(i731)), i663, i825) → 3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825)
3251_0_displayChessboard_Inc(EOS(STATIC_3251(i731)), i663, i825) → 3259_0_displayChessboard_JMP(EOS(STATIC_3259(i731)), i663, +(i825, 1)) | >=(i825, 0)
3252_0_<init>_Load(EOS(STATIC_3252(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3272_0_<init>_InvokeMethod(EOS(STATIC_3272(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3259_0_displayChessboard_JMP(EOS(STATIC_3259(i731)), i663, i859) → 3271_0_displayChessboard_Load(EOS(STATIC_3271(i731)), i663, i859)
3271_0_displayChessboard_Load(EOS(STATIC_3271(i731)), i663, i859) → 3158_0_displayChessboard_Load(EOS(STATIC_3158(i731)), i663, i859)
3272_0_<init>_InvokeMethod(EOS(STATIC_3272(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3276_0_<init>_Load(EOS(STATIC_3276(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3276_0_<init>_Load(EOS(STATIC_3276(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3288_0_<init>_InvokeMethod(EOS(STATIC_3288(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3288_0_<init>_InvokeMethod(EOS(STATIC_3288(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3293_0_<init>_Load(EOS(STATIC_3293(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3293_0_<init>_Load(EOS(STATIC_3293(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3304_0_<init>_InvokeMethod(EOS(STATIC_3304(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3304_0_<init>_InvokeMethod(EOS(STATIC_3304(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3311_0_<init>_Load(EOS(STATIC_3311(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3311_0_<init>_Load(EOS(STATIC_3311(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3323_0_<init>_InvokeMethod(EOS(STATIC_3323(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3323_0_<init>_InvokeMethod(EOS(STATIC_3323(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3329_0_<init>_Load(EOS(STATIC_3329(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3329_0_<init>_Load(EOS(STATIC_3329(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3339_0_<init>_Load(EOS(STATIC_3339(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3339_0_<init>_Load(EOS(STATIC_3339(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3345_0_<init>_FieldAccess(EOS(STATIC_3345(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3345_0_<init>_FieldAccess(EOS(STATIC_3345(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3353_0_<init>_Load(EOS(STATIC_3353(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3353_0_<init>_Load(EOS(STATIC_3353(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3359_0_<init>_InvokeMethod(EOS(STATIC_3359(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3359_0_<init>_InvokeMethod(EOS(STATIC_3359(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3367_0_<init>_StackPop(EOS(STATIC_3367(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3367_0_<init>_StackPop(EOS(STATIC_3367(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3375_0_<init>_Return(EOS(STATIC_3375(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3375_0_<init>_Return(EOS(STATIC_3375(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3384_0_<init>_Return(EOS(STATIC_3384(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3384_0_<init>_Return(EOS(STATIC_3384(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3392_0_<init>_Return(EOS(STATIC_3392(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3392_0_<init>_Return(EOS(STATIC_3392(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3401_0_<init>_Return(EOS(STATIC_3401(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3401_0_<init>_Return(EOS(STATIC_3401(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3409_0_<init>_Return(EOS(STATIC_3409(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)
3409_0_<init>_Return(EOS(STATIC_3409(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663) → 3415_0_displayChessboard_ArrayAccess(EOS(STATIC_3415(i731)), i663, i825, java.lang.Object(ARRAY(i731)), i663)

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

P rules:
3922_1_search_InvokeMethod(3372_0_safeMove_Return(EOS(STATIC_3372(x0)), x1), x2, 0, x4, x2, x4) → 3979_1_search_InvokeMethod(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0, 0, +(x2, 1), 0), x2, x4, +(x2, 1)) | &&(&&(&&(>(+(x2, 1), 0), >(x1, 0)), >(x0, 0)), >(x0, +(x2, 1)))
3979_1_search_InvokeMethod(3916_0_search_Return(EOS(STATIC_3916(x0)), 0), x2, x3, x4) → 3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x3, 1)), x2, 0, +(x3, 1), x2, +(x3, 1)) | >(x0, +(x3, 1))
3922_1_search_InvokeMethod(3372_0_safeMove_Return(EOS(STATIC_3372(x0)), 0), x2, 0, x4, x2, x4) → 3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x4, 1)), x2, 0, +(x4, 1), x2, +(x4, 1)) | >(x0, +(x4, 1))
R rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, 1, 0, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x4, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3372(x0)), x3) | >=(x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x4, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(x0)), x1, x2, x4, x1, x2, x4, java.lang.Object(ARRAY(x0)), x4) | &&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, 0, x4, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, 0, +(x4, 1), +(x4, 1), x1) | &&(>(+(x4, 1), 0), <(x4, x1))
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(x0)), x1, x2, x3, x1, x2, x3, java.lang.Object(ARRAY(x0)), x3), x1, 0, x2, x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3935(x0)), x1, 0, x2, x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_4087(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x1, x2), x3, x4, x1) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4004_0_search_InvokeMethod(EOS(STATIC_4004(x0)), x1, x2, x3), x4, x5, x1) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(4034_0_search_InvokeMethod(EOS(STATIC_4034(x0)), x1, x2, x3), x4, x5, x1) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x1, x2, x3), x4, x5, x1) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3935(x0)), x1, 0, x3, x1, x3), x4, x5, x1) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3441(x0)), 0), x2, x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x4, x4, x1) → 3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647(x0)), 0), x1, x2, x4, x1, x2, x4) | &&(&&(<(x4, x1), <(x4, x0)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x1, x1, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0)), 1), x1, x2, x1, x1, x2, x1) | &&(&&(>(x3, 0), <(x1, x1)), <(x1, x0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x4, x4, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0)), 1), x1, x2, x4, x1, x2, x4) | &&(&&(<(x4, x1), <(x4, x0)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x1, x2, x3, x3, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0)), 1), x1, x1, x3, x1, x1, x3) | &&(&&(<(x3, x1), <(x3, x0)), >(x2, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x2, x2, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0)), 1), x1, x2, x2, x1, x2, x2) | &&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1))))
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647(x0)), 0), x2, x3, x4, x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0)), 1), x2, x3, x4, x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, 0, +(x3, 1), +(x3, 1), x1) | >(+(x3, 1), 0)
3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, 1, +(x3, 1), +(x3, 1), x1) | >(+(x3, 1), 0)

Filtered ground terms:

3922_1_search_InvokeMethod(x1, x2, x3, x4, x5, x6) → 3922_1_search_InvokeMethod(x1, x2, x4, x5, x6)
Cond_3922_1_search_InvokeMethod1(x1, x2, x3, x4, x5, x6, x7) → Cond_3922_1_search_InvokeMethod1(x1, x2, x3, x5, x6, x7)
3916_0_search_Return(x1, x2) → 3916_0_search_Return(x1)
Cond_3922_1_search_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → Cond_3922_1_search_InvokeMethod(x1, x2, x3, x5, x6, x7)
Cond_3675_0_safeMove_NE1(x1, x2, x3, x4, x5, x6) → Cond_3675_0_safeMove_NE1(x1, x2, x3, x4, x5)
Cond_3675_0_safeMove_NE(x1, x2, x3, x4, x5, x6) → Cond_3675_0_safeMove_NE(x1, x2, x3, x4, x5)
3654_0_wrongPos_Return(x1, x2) → 3654_0_wrongPos_Return(x1)
3647_0_wrongPos_Return(x1, x2) → 3647_0_wrongPos_Return(x1)
3441_0_search_InvokeMethod(x1, x2) → 3441_0_search_InvokeMethod(x1)
3935_0_search_InvokeMethod(x1, x2, x3, x4, x5, x6) → 3935_0_search_InvokeMethod(x1, x2, x4, x5, x6)
Cond_3349_0_safeMove_GE2(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE2(x1, x2, x3, x4, x6, x7, x8)

Filtered duplicate args:

3922_1_search_InvokeMethod(x1, x2, x3, x4, x5) → 3922_1_search_InvokeMethod(x1, x4, x5)
Cond_3922_1_search_InvokeMethod(x1, x2, x3, x4, x5, x6) → Cond_3922_1_search_InvokeMethod(x1, x2, x5, x6)
Cond_3922_1_search_InvokeMethod1(x1, x2, x3, x4, x5, x6) → Cond_3922_1_search_InvokeMethod1(x1, x2, x5, x6)
3349_0_safeMove_GE(x1, x2, x3, x4, x5, x6, x7) → 3349_0_safeMove_GE(x1, x3, x4, x6, x7)
Cond_3349_0_safeMove_GE(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE(x1, x2, x4, x5, x7, x8)
Cond_3349_0_safeMove_GE1(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE1(x1, x2, x4, x5, x7, x8)
3631_0_safeMove_ArrayAccess(x1, x2, x3, x4, x5, x6, x7, x8, x9) → 3631_0_safeMove_ArrayAccess(x1, x5, x6, x8, x9)
Cond_3349_0_safeMove_GE2(x1, x2, x3, x4, x5, x6, x7) → Cond_3349_0_safeMove_GE2(x1, x2, x4, x6, x7)
3935_0_search_InvokeMethod(x1, x2, x3, x4, x5) → 3935_0_search_InvokeMethod(x1, x4, x5)
4087_0_search_ArrayAccess(x1, x2, x3, x4, x5, x6) → 4087_0_search_ArrayAccess(x1, x4, x5, x6)
Cond_3349_0_safeMove_GE3(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE3(x1, x2, x4, x5, x7, x8)
3445_1_safeMove_InvokeMethod(x1, x2, x3, x4, x5, x6, x7) → 3445_1_safeMove_InvokeMethod(x1, x5, x6, x7)
Cond_3349_0_safeMove_GE4(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE4(x1, x2, x4, x5, x8)
Cond_3349_0_safeMove_GE5(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE5(x1, x2, x4, x5, x7, x8)
Cond_3349_0_safeMove_GE6(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE6(x1, x2, x5, x7, x8)
Cond_3349_0_safeMove_GE7(x1, x2, x3, x4, x5, x6, x7, x8) → Cond_3349_0_safeMove_GE7(x1, x2, x5, x7, x8)

Filtered unneeded arguments:

3979_1_search_InvokeMethod(x1, x2, x3, x4) → 3979_1_search_InvokeMethod(x1, x2, x3)
Cond_3979_1_search_InvokeMethod(x1, x2, x3, x4, x5) → Cond_3979_1_search_InvokeMethod(x1, x2, x3, x4)
Cond_3349_0_safeMove_GE(x1, x2, x3, x4, x5, x6) → Cond_3349_0_safeMove_GE(x1, x2, x4)
Cond_3349_0_safeMove_GE1(x1, x2, x3, x4, x5, x6) → Cond_3349_0_safeMove_GE1(x1)
Cond_3349_0_safeMove_GE3(x1, x2, x3, x4, x5, x6) → Cond_3349_0_safeMove_GE3(x1, x2, x3, x5, x6)
Cond_3349_0_safeMove_GE4(x1, x2, x3, x4, x5) → Cond_3349_0_safeMove_GE4(x1, x2, x3, x5)
Cond_3349_0_safeMove_GE5(x1, x2, x3, x4, x5, x6) → Cond_3349_0_safeMove_GE5(x1, x2, x3, x5, x6)
Cond_3349_0_safeMove_GE6(x1, x2, x3, x4, x5) → Cond_3349_0_safeMove_GE6(x1, x2, x4, x5)
Cond_3349_0_safeMove_GE7(x1, x2, x3, x4, x5) → Cond_3349_0_safeMove_GE7(x1, x2, x4, x5)

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

P rules:
3922_1_search_InvokeMethod(3372_0_safeMove_Return(EOS(STATIC_3372(x0)), x1), x2, x4) → 3979_1_search_InvokeMethod(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0), x2, x4) | &&(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), >(x0, +(x2, 1)))
3979_1_search_InvokeMethod(3916_0_search_Return(EOS(STATIC_3916(x0))), x2, x3) → 3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x3, 1)), x2, +(x3, 1)) | >(x0, +(x3, 1))
3922_1_search_InvokeMethod(3372_0_safeMove_Return(EOS(STATIC_3372(x0)), 0), x2, x4) → 3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x4, 1)), x2, +(x4, 1)) | >(x0, +(x4, 1))
R rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3372(x0)), x3) | >=(x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4) | &&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, 0, +(x4, 1), x1) | &&(>(x4, -1), <(x4, x1))
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3631(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3935(x0)), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_4087(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4004_0_search_InvokeMethod(EOS(STATIC_4004(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(4034_0_search_InvokeMethod(EOS(STATIC_4034(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3935(x0)), x1, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3441(x0))), x2, x3) → 4106_0_search_InvokeMethod(EOS(STATIC_4106(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647(x0))), x1, x2, x4) | &&(&&(<(x4, x1), <(x4, x0)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0))), x1, x2, x1) | &&(&&(>(x3, 0), <(x1, x1)), <(x1, x0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0))), x1, x2, x4) | &&(&&(<(x4, x1), <(x4, x0)), >(x3, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0))), x1, x1, x3) | &&(&&(<(x3, x1), <(x3, x0)), >(x2, 0))
3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0))), x1, x2, x2) | &&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1))))
3445_1_safeMove_InvokeMethod(3647_0_wrongPos_Return(EOS(STATIC_3647(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3654_0_wrongPos_Return(EOS(STATIC_3654(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, 0, +(x3, 1), x1) | >(x3, -1)
3675_0_safeMove_NE(EOS(STATIC_3675(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3349(x0)), x2, 1, +(x3, 1), x1) | >(x3, -1)

Performed bisimulation on rules. Used the following equivalence classes: {[3441_0_search_InvokeMethod_1, 3647_0_wrongPos_Return_1, 3654_0_wrongPos_Return_1, 3916_0_search_Return_1]=3441_0_search_InvokeMethod_1, [STATIC_3922_1, STATIC_3349_1, STATIC_3372_1, STATIC_3631_1, STATIC_3935_1, STATIC_4087_1, STATIC_4106_1, STATIC_4004_1, STATIC_4034_1, STATIC_3441_1, STATIC_3647_1, STATIC_3654_1, STATIC_3675_1, STATIC_3916_1]=STATIC_3922_1, [Cond_3349_0_safeMove_GE3_6, Cond_3349_0_safeMove_GE5_6, Cond_3349_0_safeMove_GE6_6]=Cond_3349_0_safeMove_GE3_6, [4106_0_search_InvokeMethod_4, 4004_0_search_InvokeMethod_4, 4034_0_search_InvokeMethod_4]=4106_0_search_InvokeMethod_4}

Finished conversion. Obtained 7 rules for P and 26 rules for R. System has predefined symbols.

P rules:
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), >(x0, +(x2, 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4)
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0), x2, x4)
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0)
3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0, +(x3, 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3)
COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x3, 1)), x2, +(x3, 1))
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0, +(x4, 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4)
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x4, 1)), x2, +(x4, 1))
R rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(>=(x4, x1), EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(&&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(&&(>(x4, -1), <(x4, x1)), EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x4, 1), x1)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(&&(&&(<(x4, x1), <(x4, x0)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(&&(&&(>(x3, 0), <(x1, x1)), <(x1, x0)), EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(&&(&&(<(x3, x1), <(x3, x0)), >(x2, 0)), EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(&&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1)))), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x3, 1), x1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, +(x3, 1), x1)

(45) Obligation:

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

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

The following domains are used:

Integer, Boolean

The ITRS R consists of the following rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(x4 >= x1, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(x4 >= x0 && x4 < x1 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(x4 > -1 && x4 < x1, EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4 + 1, x1)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(x4 < x1 && x4 < x0 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(x3 > 0 && x1 < x1 && x1 < x0, EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(x3 < x1 && x3 < x0 && x2 > 0, EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(x3 > 0 && x2 < x1 && x2 < x0 && !(x1 - x2 = x2 - x1), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x3 + 1, x1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, x3 + 1, x1)

The integer pair graph contains the following rules and edges:
(0): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])
(1): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), x2[1] + 1, 0), x2[1] + 1, 0), x2[1], x4[1])
(2): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0), x2[2] + 1, 0)
(3): 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(x0[3] > x3[3] + 1, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])
(4): COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1), x2[4], x3[4] + 1)
(5): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(x0[5] > x4[5] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
(6): COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1), x2[6], x4[6] + 1)

(0) -> (1), if (x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1])∧x2[0] →^* x2[1]∧x4[0] →^* x4[1])

(0) -> (2), if (x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0] →^* x2[2]∧x4[0] →^* x4[2])

(1) -> (3), if (3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), x2[1] + 1, 0), x2[1] + 1, 0) →^* 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3])))∧x2[1] →^* x2[3]∧x4[1] →^* x3[3])

(2) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[2] + 1 →^* x2[0]∧0 →^* x4[0])

(2) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[2] + 1 →^* x2[5]∧0 →^* x4[5])

(3) -> (4), if (x0[3] > x3[3] + 1 ∧3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))) →^* 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4])))∧x2[3] →^* x2[4]∧x3[3] →^* x3[4])

(4) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[4] →^* x2[0]∧x3[4] + 1 →^* x4[0])

(4) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[4] →^* x2[5]∧x3[4] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

(6) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6] →^* x2[0]∧x4[6] + 1 →^* x4[0])

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

The set Q consists of the following terms:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x1, 0, x2, x3)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2), x3, x4)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x3)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x1, x2, x1, x3)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x3)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0)

(46) IDPNonInfProof (SOUND transformation)

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

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

For Pair 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), >(x0, +(x2, 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1]) which results in the following constraint:
(1)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1])∧x2[0]=x2[1]∧x4[0]=x4[1] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (1) using rules (I), (II), (IV) which results in the following new constraint:
(2)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(6)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(2)bni_142] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_142 + (-1)Bound*bni_142] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_143] ≥ 0)
We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0) which results in the following constraint:
(7)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0]=x2[2]∧x4[0]=x4[2] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (7) using rules (I), (II), (IV) which results in the following new constraint:
(8)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (8) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(9)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (9) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(10)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (10) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(11)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)bni_142 + (-1)Bound*bni_142] + [(2)bni_142]x4[0] ≥ 0∧[(-1)bso_143] + x4[0] ≥ 0)

We simplified constraint (11) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(12)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(2)bni_142] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_142 + (-1)Bound*bni_142] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_143] ≥ 0)

For Pair COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0), x2, x4) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1]), 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) which results in the following constraint:
(13)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1])∧x2[0]=x2[1]∧x4[0]=x4[1]∧3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0)=3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3])))∧x2[1]=x2[3]∧x4[1]=x3[3] ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1])≥3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])∧(U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥))

We simplified constraint (13) using rules (I), (II), (III), (IV) which results in the following new constraint:
(14)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0), +(x2[0], 1), 0)=3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0), +(x2[0], 1), 0), x2[0], x4[0])∧(U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥))

We simplified constraint (14) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(15)    (0 ≥ 0 ⇒ (U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥)∧[(-1)bni_144 + (-1)Bound*bni_144] + [bni_144]x4[0] ≥ 0∧[(-1)bso_145] ≥ 0)

We simplified constraint (15) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(16)    (0 ≥ 0 ⇒ (U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥)∧[(-1)bni_144 + (-1)Bound*bni_144] + [bni_144]x4[0] ≥ 0∧[(-1)bso_145] ≥ 0)

We simplified constraint (16) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(17)    (0 ≥ 0 ⇒ (U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥)∧[(-1)bni_144 + (-1)Bound*bni_144] + [bni_144]x4[0] ≥ 0∧[(-1)bso_145] ≥ 0)

We simplified constraint (17) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(18)    (0 ≥ 0 ⇒ (U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥)∧[bni_144] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_144 + (-1)Bound*bni_144] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_145] ≥ 0)

For Pair COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) which results in the following constraint:
(19)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0]=x2[2]∧x4[0]=x4[2]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0]1)), x1[0]1)∧+(x2[2], 1)=x2[0]1∧0=x4[0]1 ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (19) using rules (I), (II), (III), (IV) which results in the following new constraint:
(20)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0]1)), x1[0]1) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0), +(x2[0], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (20) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(21)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (21) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(22)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (22) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(23)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (23) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(24)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[bni_146] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_146 + (-1)Bound*bni_146] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_147] ≥ 0)
We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) which results in the following constraint:
(25)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0]=x2[2]∧x4[0]=x4[2]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧+(x2[2], 1)=x2[5]∧0=x4[5] ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (25) using rules (I), (II), (III), (IV) which results in the following new constraint:
(26)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[0], 1), 0), +(x2[0], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (26) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(27)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (27) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(28)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (28) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(29)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)bni_146 + (-1)Bound*bni_146] + [bni_146]x4[0] ≥ 0∧[(-1)bso_147] + x4[0] ≥ 0)

We simplified constraint (29) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(30)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[bni_146] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_146 + (-1)Bound*bni_146] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_147] ≥ 0)

For Pair 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0, +(x3, 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) the following chains were created:

We consider the chain 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]), COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1)) which results in the following constraint:
(31)    (>(x0[3], +(x3[3], 1))=TRUE∧3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3])))=3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4])))∧x2[3]=x2[4]∧x3[3]=x3[4] ⇒ 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])≥NonInfC∧3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])≥COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])∧(U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥))

We simplified constraint (31) using rules (I), (II), (IV) which results in the following new constraint:
(32)    (>(x0[3], +(x3[3], 1))=TRUE ⇒ 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])≥NonInfC∧3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])≥COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])∧(U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥))

We simplified constraint (32) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(33)    (0 ≥ 0 ⇒ (U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥)∧[(-1)Bound*bni_148] + [bni_148]x3[3] ≥ 0∧[1 + (-1)bso_149] + x3[3] ≥ 0)

We simplified constraint (33) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(34)    (0 ≥ 0 ⇒ (U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥)∧[(-1)Bound*bni_148] + [bni_148]x3[3] ≥ 0∧[1 + (-1)bso_149] + x3[3] ≥ 0)

We simplified constraint (34) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(35)    (0 ≥ 0 ⇒ (U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥)∧[(-1)Bound*bni_148] + [bni_148]x3[3] ≥ 0∧[1 + (-1)bso_149] + x3[3] ≥ 0)

We simplified constraint (35) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(36)    (0 ≥ 0 ⇒ (U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥)∧[bni_148] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)Bound*bni_148] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1 + (-1)bso_149] ≥ 0)

For Pair COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x3, 1)), x2, +(x3, 1)) the following chains were created:

We consider the chain 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]), COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) which results in the following constraint:
(37)    (>(x0[3], +(x3[3], 1))=TRUE∧3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3])))=3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4])))∧x2[3]=x2[4]∧x3[3]=x3[4]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[4]=x2[0]∧+(x3[4], 1)=x4[0] ⇒ COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4])≥NonInfC∧COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥))

We simplified constraint (37) using rules (I), (II), (III), (IV) which results in the following new constraint:
(38)    (>(x0[3], +(x3[3], 1))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[3])), x2[4], +(x3[3], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) ⇒ COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[4], x3[3])≥NonInfC∧COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[4], x3[3])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[3])), x2[4], +(x3[3], 1)), x2[4], +(x3[3], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥))

We simplified constraint (38) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(39)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (39) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(40)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (40) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(41)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (41) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(42)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_151] ≥ 0)
We consider the chain 3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]), COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) which results in the following constraint:
(43)    (>(x0[3], +(x3[3], 1))=TRUE∧3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3])))=3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4])))∧x2[3]=x2[4]∧x3[3]=x3[4]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[4]=x2[5]∧+(x3[4], 1)=x4[5] ⇒ COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4])≥NonInfC∧COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥))

We simplified constraint (43) using rules (I), (II), (III), (IV) which results in the following new constraint:
(44)    (>(x0[3], +(x3[3], 1))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[3])), x2[4], +(x3[3], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) ⇒ COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[4], x3[3])≥NonInfC∧COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[4], x3[3])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[3])), x2[4], +(x3[3], 1)), x2[4], +(x3[3], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥))

We simplified constraint (44) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(45)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (45) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(46)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (46) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(47)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧[(-1)bso_151] ≥ 0)

We simplified constraint (47) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(48)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_151] ≥ 0)

For Pair 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0, +(x4, 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) which results in the following constraint:
(49)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (49) using rules (I), (II), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(50)    (>(x0[5], +(x4[5], 1))=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (50) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(51)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)bni_152 + (-1)Bound*bni_152] + [(2)bni_152]x4[5] ≥ 0∧[(-1)bso_153] + [2]x4[5] ≥ 0)

We simplified constraint (51) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(52)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)bni_152 + (-1)Bound*bni_152] + [(2)bni_152]x4[5] ≥ 0∧[(-1)bso_153] + [2]x4[5] ≥ 0)

We simplified constraint (52) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(53)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)bni_152 + (-1)Bound*bni_152] + [(2)bni_152]x4[5] ≥ 0∧[(-1)bso_153] + [2]x4[5] ≥ 0)

We simplified constraint (53) using rules (IDP_UNRESTRICTED_VARS), (IDP_POLY_GCD) which results in the following new constraint:
(54)    (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(2)bni_152] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_152 + (-1)Bound*bni_152] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_153] ≥ 0∧[1] ≥ 0)

For Pair COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x4, 1)), x2, +(x4, 1)) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) which results in the following constraint:
(55)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6]=x2[0]∧+(x4[6], 1)=x4[0] ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (55) using rules (I), (II), (III), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(56)    (>(x0[5], +(x4[5], 1))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1)), x2[6], +(x4[5], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (56) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(57)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (57) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(58)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (58) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(59)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (59) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(60)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_155] ≥ 0)
We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) which results in the following constraint:
(61)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5]1)), 0)∧x2[6]=x2[5]1∧+(x4[6], 1)=x4[5]1 ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (61) using rules (I), (II), (III), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(62)    (>(x0[5], +(x4[5], 1))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5]1)), 0) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1)), x2[6], +(x4[5], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (62) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(63)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (63) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(64)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (64) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(65)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧[(-1)bso_155] ≥ 0)

We simplified constraint (65) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(66)    (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_155] ≥ 0)

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

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2, -1), >(x1, 0)), >(x0, 0)), >(x0, +(x2, 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4)
- (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(2)bni_142] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_142 + (-1)Bound*bni_142] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_143] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(2)bni_142] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_142 + (-1)Bound*bni_142] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_143] ≥ 0)
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0), x2, x4)
- (0 ≥ 0 ⇒ (U^Increasing(3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])), ≥)∧[bni_144] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_144 + (-1)Bound*bni_144] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_145] ≥ 0)
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x1), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), +(x2, 1), 0), +(x2, 1), 0)
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[bni_146] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_146 + (-1)Bound*bni_146] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_147] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[bni_146] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_146 + (-1)Bound*bni_146] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_147] ≥ 0)
3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0, +(x3, 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3)
- (0 ≥ 0 ⇒ (U^Increasing(COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])), ≥)∧[bni_148] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)Bound*bni_148] ≥ 0∧[1] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[1 + (-1)bso_149] ≥ 0)
COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x3, 1)), x2, +(x3, 1))
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_151] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_150 + (-1)Bound*bni_150] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_151] ≥ 0)
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0, +(x4, 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4)
- (0 ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(2)bni_152] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_152 + (-1)Bound*bni_152] ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_153] ≥ 0∧[1] ≥ 0)
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), 0), x2, x4) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x2, +(x4, 1)), x2, +(x4, 1))
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_155] ≥ 0)
- (0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bni_154 + (-1)Bound*bni_154] ≥ 0∧0 ≥ 0∧0 ≥ 0∧0 ≥ 0∧[(-1)bso_155] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(3922_0_safeMove_ConstantStackPush(x₁, x₂, x₃)) = 0
POL(EOS(x₁)) = 0
POL(STATIC_3922(x₁)) = 0
POL(3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅)) = 0
POL(1) = 0
POL(0) = 0
POL(Cond_3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(>=(x₁, x₂)) = 0
POL(3372_0_safeMove_Return(x₁, x₂)) = 0
POL(Cond_3349_0_safeMove_GE1(x₁, x₂, x₃, x₄, x₅, x₆)) = [3]x₁
POL(&&(x₁, x₂)) = 0
POL(<(x₁, x₂)) = 0
POL(>(x₁, x₂)) = 0
POL(3631_0_safeMove_ArrayAccess(x₁, x₂, x₃, x₄, x₅)) = 0
POL(java.lang.Object(x₁)) = 0
POL(ARRAY(x₁)) = 0
POL(Cond_3349_0_safeMove_GE2(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(-1) = 0
POL(+(x₁, x₂)) = 0
POL(3922_1_search_InvokeMethod(x₁, x₂, x₃)) = [3]x₃ + x₂
POL(3935_0_search_InvokeMethod(x₁, x₂, x₃)) = x₂
POL(3979_1_search_InvokeMethod(x₁, x₂, x₃)) = 0
POL(4087_0_search_ArrayAccess(x₁, x₂, x₃, x₄)) = 0
POL(4106_0_search_InvokeMethod(x₁, x₂, x₃, x₄)) = 0
POL(3441_0_search_InvokeMethod(x₁)) = [1]
POL(Cond_3349_0_safeMove_GE3(x₁, x₂, x₃, x₄, x₅, x₆)) = x₁
POL(3445_1_safeMove_InvokeMethod(x₁, x₂, x₃, x₄)) = 0
POL(Cond_3349_0_safeMove_GE4(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(Cond_3349_0_safeMove_GE7(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(!(x₁)) = 0
POL(=(x₁, x₂)) = 0
POL(-(x₁, x₂)) = 0
POL(3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅)) = 0
POL(Cond_3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(Cond_3675_0_safeMove_NE1(x₁, x₂, x₃, x₄, x₅, x₆)) = 0
POL(3922_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃)) = [-1] + [2]x₃ + [-1]x₁
POL(COND_3922_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = [-1] + x₄ + [-1]x₂ + [-1]x₁
POL(3979_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃)) = [-1] + x₃ + x₁
POL(COND_3979_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = [-1]x₂
POL(COND_3922_1_SEARCH_INVOKEMETHOD1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₂

The following pairs are in P_>:

3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])

The following pairs are in P_bound:

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)
3979_1_SEARCH_INVOKEMETHOD(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3]) → COND_3979_1_SEARCH_INVOKEMETHOD(>(x0[3], +(x3[3], 1)), 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[3]))), x2[3], x3[3])
COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))

The following pairs are in P_≥:

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), +(x2[1], 1), 0), +(x2[1], 1), 0), x2[1], x4[1])
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)
COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], +(x3[4], 1)), x2[4], +(x3[4], 1))
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))

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

&&(TRUE, TRUE)¹ ↔ TRUE¹
&&(TRUE, FALSE)¹ ↔ FALSE¹
&&(FALSE, TRUE)¹ ↔ FALSE¹
&&(FALSE, FALSE)¹ ↔ FALSE¹
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2)¹ → 3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2)¹
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE(>=(x4, x1), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE1(&&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE2(&&(>(x4, -1), <(x4, x1)), EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x4, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE3(&&(&&(<(x4, x1), <(x4, x0)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹ ↔ 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)¹
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ ↔ Cond_3675_0_safeMove_NE1(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, +(x3, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ ↔ Cond_3349_0_safeMove_GE4(&&(&&(>(x3, 0), <(x1, x1)), <(x1, x0)), EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹ ↔ 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)¹
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ ↔ Cond_3675_0_safeMove_NE(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x3, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹ ↔ Cond_3349_0_safeMove_GE3(&&(&&(<(x3, x1), <(x3, x0)), >(x2, 0)), EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ Cond_3349_0_safeMove_GE7(&&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1)))), EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)¹
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)¹
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)¹

(47) Obligation:

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

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

The following domains are used:

Integer, Boolean

The ITRS R consists of the following rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(x4 >= x1, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(x4 >= x0 && x4 < x1 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(x4 > -1 && x4 < x1, EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4 + 1, x1)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(x4 < x1 && x4 < x0 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(x3 > 0 && x1 < x1 && x1 < x0, EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(x3 < x1 && x3 < x0 && x2 > 0, EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(x3 > 0 && x2 < x1 && x2 < x0 && !(x1 - x2 = x2 - x1), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x3 + 1, x1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, x3 + 1, x1)

The integer pair graph contains the following rules and edges:
(0): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])
(1): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[1])), x1[1]), x2[1], x4[1]) → 3979_1_SEARCH_INVOKEMETHOD(3922_1_search_InvokeMethod(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[1])), x2[1] + 1, 0), x2[1] + 1, 0), x2[1], x4[1])
(2): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0), x2[2] + 1, 0)
(4): COND_3979_1_SEARCH_INVOKEMETHOD(TRUE, 3441_0_search_InvokeMethod(EOS(STATIC_3922(x0[4]))), x2[4], x3[4]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1), x2[4], x3[4] + 1)
(5): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(x0[5] > x4[5] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
(6): COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1), x2[6], x4[6] + 1)

(2) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[2] + 1 →^* x2[0]∧0 →^* x4[0])

(4) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[4] →^* x2[0]∧x3[4] + 1 →^* x4[0])

(6) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6] →^* x2[0]∧x4[6] + 1 →^* x4[0])

(2) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[2] + 1 →^* x2[5]∧0 →^* x4[5])

(4) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[4])), x2[4], x3[4] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[4] →^* x2[5]∧x3[4] + 1 →^* x4[5])

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

(48) IDependencyGraphProof (EQUIVALENT transformation)

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

(49) Obligation:

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

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

The following domains are used:

Integer, Boolean

The ITRS R consists of the following rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(x4 >= x1, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(x4 >= x0 && x4 < x1 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(x4 > -1 && x4 < x1, EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4 + 1, x1)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2) → 3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x3, x4, x1)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x3), x4, x5) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x4, x5, x1)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3) → 4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x2, x3, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(x4 < x1 && x4 < x0 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(x3 > 0 && x1 < x1 && x1 < x0, EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(x3 < x1 && x3 < x0 && x2 > 0, EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(x3 > 0 && x2 < x1 && x2 < x0 && !(x1 - x2 = x2 - x1), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x3 + 1, x1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, x3 + 1, x1)

The integer pair graph contains the following rules and edges:
(6): COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1), x2[6], x4[6] + 1)
(5): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(x0[5] > x4[5] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
(2): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0), x2[2] + 1, 0)
(0): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])

(2) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[2] + 1 →^* x2[0]∧0 →^* x4[0])

(6) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6] →^* x2[0]∧x4[6] + 1 →^* x4[0])

(2) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[2] + 1 →^* x2[5]∧0 →^* x4[5])

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

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

(51) Obligation:

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

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

The following domains are used:

Integer, Boolean

The ITRS R consists of the following rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(x4 >= x1, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(x4 >= x0 && x4 < x1 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(x4 > -1 && x4 < x1, EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(x4 < x1 && x4 < x0 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, x3 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(x3 > 0 && x1 < x1 && x1 < x0, EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x3 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(x3 < x1 && x3 < x0 && x2 > 0, EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(x3 > 0 && x2 < x1 && x2 < x0 && !(x1 - x2 = x2 - x1), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)

The integer pair graph contains the following rules and edges:
(6): COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1), x2[6], x4[6] + 1)
(5): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(x0[5] > x4[5] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
(2): COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0), x2[2] + 1, 0)
(0): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(x2[0] > -1 && x1[0] > 0 && x0[0] > 0 && x0[0] > x2[0] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])

(2) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[2] + 1 →^* x2[0]∧0 →^* x4[0])

(6) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6] →^* x2[0]∧x4[6] + 1 →^* x4[0])

(2) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), x2[2] + 1, 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[2] + 1 →^* x2[5]∧0 →^* x4[5])

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

(52) IDPNonInfProof (SOUND transformation)

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

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

For Pair COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) the following chains were created:

We consider the chain COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) which results in the following constraint:
(1)    (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧+(x2[2], 1)=x2[5]∧0=x4[5]∧>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6] ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (1) using rules (I), (II), (III), (VII), (IDP_CONSTANT_FOLD), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(2)    (EOS(STATIC_3922(x0[2]))=x0∧+(x2[2], 1)=x1∧0=x2∧3922_0_safeMove_ConstantStackPush(x0, x1, x2)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧>(x0[5], 1)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), +(x2[2], 1), +(0, 1)), +(x2[2], 1), +(0, 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (2) using rule (V) (with possible (I) afterwards) using induction on 3922_0_safeMove_ConstantStackPush(x0, x1, x2)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) which results in the following new constraint:
(3)    (3349_0_safeMove_GE(EOS(STATIC_3922(x5)), x3, 1, 0, x4)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧EOS(STATIC_3922(x0[2]))=EOS(STATIC_3922(x5))∧+(x2[2], 1)=x4∧0=x3∧>(x0[5], 1)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), +(x2[2], 1), +(0, 1)), +(x2[2], 1), +(0, 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (3) using rules (I), (II), (III), (VII) which results in the following new constraint:
(4)    (3349_0_safeMove_GE(EOS(STATIC_3922(x5)), 0, 1, 0, +(x2[2], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧>(x0[5], 1)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), +(x2[2], 1), +(0, 1)), +(x2[2], 1), +(0, 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (4) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(5)    (x0[5] + [-2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52] + [bni_52]x0[5] + [bni_52]max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0∧[(-1)bso_53] + max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} + [-1]max{[-2] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0)

We simplified constraint (5) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(6)    (x0[5] + [-2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52] + [bni_52]x0[5] + [bni_52]max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0∧[(-1)bso_53] + max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} + [-1]max{[-2] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0)

We simplified constraint (6) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(7)    (x0[5] + [-2] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + (-1)bni_52] + [bni_52]x0[5] + [(-1)bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (7) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(8)    (x0[5] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + bni_52] + [bni_52]x0[5] + [(-1)bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (8) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(9)    (x0[5] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + bni_52] + [bni_52]x0[5] + [(-1)bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)

(10)    (x0[5] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + bni_52] + [bni_52]x0[5] + [bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)
We consider the chain COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) which results in the following constraint:
(11)    (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6]=x2[5]∧+(x4[6], 1)=x4[5]∧>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6]1)), 0)∧x2[5]=x2[6]1∧x4[5]=x4[6]1 ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6]1)), 0), x2[6]1, x4[6]1)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6]1)), 0), x2[6]1, x4[6]1)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥))

We simplified constraint (11) using rules (I), (II), (III), (VII), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(12)    (EOS(STATIC_3922(x0[6]))=x9∧+(x4[6], 1)=x10∧3922_0_safeMove_ConstantStackPush(x9, x2[6], x10)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧>(x0[5], +(+(x4[6], 1), 1))=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(+(x4[6], 1), 1)), x2[6], +(+(x4[6], 1), 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥))

We simplified constraint (12) using rule (V) (with possible (I) afterwards) using induction on 3922_0_safeMove_ConstantStackPush(x9, x2[6], x10)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) which results in the following new constraint:
(13)    (3349_0_safeMove_GE(EOS(STATIC_3922(x13)), x11, 1, 0, x12)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧EOS(STATIC_3922(x0[6]))=EOS(STATIC_3922(x13))∧+(x4[6], 1)=x11∧>(x0[5], +(+(x4[6], 1), 1))=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x12, +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x12, +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x12, +(+(x4[6], 1), 1)), x12, +(+(x4[6], 1), 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥))

We simplified constraint (13) using rules (I), (II), (III), (VII) which results in the following new constraint:
(14)    (3349_0_safeMove_GE(EOS(STATIC_3922(x13)), +(x4[6], 1), 1, 0, x12)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧>(x0[5], +(+(x4[6], 1), 1))=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x12, +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x12, +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x12, +(+(x4[6], 1), 1)), x12, +(+(x4[6], 1), 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥))

We simplified constraint (14) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(15)    (x0[5] + [-3] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52] + [bni_52]x0[5] + [bni_52]max{[-1] + [-1]x4[6] + [-1]x12, [-1]x12} ≥ 0∧[(-1)bso_53] + max{[-1] + [-1]x4[6] + [-1]x12, [-1]x12} + [-1]max{[-2] + [-1]x4[6] + [-1]x12, [-1]x12} ≥ 0)

We simplified constraint (15) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(16)    (x0[5] + [-3] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52] + [bni_52]x0[5] + [bni_52]max{[-1] + [-1]x4[6] + [-1]x12, [-1]x12} ≥ 0∧[(-1)bso_53] + max{[-1] + [-1]x4[6] + [-1]x12, [-1]x12} + [-1]max{[-2] + [-1]x4[6] + [-1]x12, [-1]x12} ≥ 0)

We simplified constraint (16) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(17)    (x0[5] + [-3] + [-1]x4[6] ≥ 0∧[-1] + [-1]x4[6] ≥ 0∧[-2] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (-1)bni_52] + [bni_52]x0[5] + [(-1)bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

(18)    (x0[5] + [-3] + [-1]x4[6] ≥ 0∧[-1] + [-1]x4[6] ≥ 0∧[1] + x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (-1)bni_52] + [bni_52]x0[5] + [(-1)bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[-1 + (-1)bso_53] + [-1]x4[6] ≥ 0)

(19)    (x0[5] + [-3] + [-1]x4[6] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52] + [bni_52]x0[5] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (17) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(20)    (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

We simplified constraint (18) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(21)    (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[-2] + x0[5] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[2 + (-1)bso_53] + [-1]x0[5] + x4[6] ≥ 0)

We simplified constraint (19) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(22)    (x0[5] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (3)bni_52] + [bni_52]x4[6] + [bni_52]x0[5] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (20) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(23)    (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

(24)    (x4[6] ≥ 0∧[2] + x0[5] + x4[6] ≥ 0∧[1] + x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

We simplified constraint (23) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(25)    (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

(26)    (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

We simplified constraint (24) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(27)    (x4[6] ≥ 0∧[2] + x0[5] + x4[6] ≥ 0∧[1] + x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

(28)    (x4[6] ≥ 0∧[2] + x0[5] + x4[6] ≥ 0∧[1] + x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)

We simplified constraint (21) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(29)    (x4[6] ≥ 0∧[-1]x0[5] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] + [-1]x0[5] ≥ 0)

We simplified constraint (29) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(30)    (x4[6] ≥ 0∧0 ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (30) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(31)    (x4[6] ≥ 0∧0 ≥ 0∧0 ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

(32)    (x4[6] ≥ 0∧0 ≥ 0∧0 ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

We simplified constraint (22) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(33)    (x0[5] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (3)bni_52] + [bni_52]x4[6] + [bni_52]x0[5] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

(34)    (x0[5] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (3)bni_52] + [bni_52]x4[6] + [bni_52]x0[5] + [bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)

For Pair 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) which results in the following constraint:
(35)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (35) using rules (I), (II), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(36)    (>(x0[5], +(x4[5], 1))=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (36) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(37)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} ≥ 0∧[(-1)bso_55] + max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} + [-1]max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} ≥ 0)

We simplified constraint (37) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(38)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} ≥ 0∧[(-1)bso_55] + max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} + [-1]max{[-1]x4[5] + [-1]x2[5], [-1]x2[5]} ≥ 0)

We simplified constraint (38) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(39)    (x0[5] + [-2] + [-1]x4[5] ≥ 0∧[-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [(-1)bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

(40)    (x0[5] + [-2] + [-1]x4[5] ≥ 0∧[-1] + x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (39) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(41)    (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (40) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(42)    (x0[5] ≥ 0∧[-1] + x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (41) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(43)    (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

(44)    ([-1]x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [(-1)bni_54]x0[5] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (43) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(45)    (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

(46)    (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (44) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(47)    (x4[5] ≥ 0∧[2] + x0[5] + x4[5] ≥ 0∧x0[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (47) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(48)    (x4[5] ≥ 0∧[2] + x0[5] + x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

(49)    (x4[5] ≥ 0∧[2] + x0[5] + x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (42) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(50)    (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (3)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

We simplified constraint (50) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(51)    (x0[5] ≥ 0∧x4[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (3)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

(52)    (x0[5] ≥ 0∧x4[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (3)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)

For Pair COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0) the following chains were created:

We consider the chain COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0) which results in the following constraint:
(53)    (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧+(x2[2], 1)=x2[0]∧0=x4[0]∧&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2]1)), x1[2]1)∧x2[0]=x2[2]1∧x4[0]=x4[2]1 ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2]1)), x1[2]1), x2[2]1, x4[2]1)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2]1)), x1[2]1), x2[2]1, x4[2]1)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥))

We simplified constraint (53) using rules (I), (II), (III), (VII), (IDP_BOOLEAN) which results in the following new constraint:
(54)    (EOS(STATIC_3922(x0[2]))=x17∧+(x2[2], 1)=x18∧0=x19∧3922_0_safeMove_ConstantStackPush(x17, x18, x19)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧>(x0[0], +(+(x2[2], 1), 1))=TRUE∧>(x0[0], 0)=TRUE∧>(+(x2[2], 1), -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(+(x2[2], 1), 1), 0), +(+(x2[2], 1), 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥))

We simplified constraint (54) using rule (V) (with possible (I) afterwards) using induction on 3922_0_safeMove_ConstantStackPush(x17, x18, x19)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) which results in the following new constraint:
(55)    (3349_0_safeMove_GE(EOS(STATIC_3922(x22)), x20, 1, 0, x21)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧EOS(STATIC_3922(x0[2]))=EOS(STATIC_3922(x22))∧+(x2[2], 1)=x21∧0=x20∧>(x0[0], +(+(x2[2], 1), 1))=TRUE∧>(x0[0], 0)=TRUE∧>(+(x2[2], 1), -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(+(x2[2], 1), 1), 0), +(+(x2[2], 1), 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥))

We simplified constraint (55) using rules (I), (II), (III), (VII) which results in the following new constraint:
(56)    (3349_0_safeMove_GE(EOS(STATIC_3922(x22)), 0, 1, 0, +(x2[2], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧>(x0[0], +(+(x2[2], 1), 1))=TRUE∧>(x0[0], 0)=TRUE∧>(+(x2[2], 1), -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), +(x2[2], 1), 0)≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(+(x2[2], 1), 1), 0), +(+(x2[2], 1), 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥))

We simplified constraint (56) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(57)    (x0[0] + [-3] + [-1]x2[2] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56] + [bni_56]x0[0] + [bni_56]max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0∧[(-1)bso_57] + max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} + [-1]max{[-2] + [-1]x2[2], [-2] + [-1]x2[2]} ≥ 0)

We simplified constraint (57) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(58)    (x0[0] + [-3] + [-1]x2[2] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56] + [bni_56]x0[0] + [bni_56]max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} ≥ 0∧[(-1)bso_57] + max{[-1] + [-1]x2[2], [-1] + [-1]x2[2]} + [-1]max{[-2] + [-1]x2[2], [-2] + [-1]x2[2]} ≥ 0)

We simplified constraint (58) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(59)    (x0[0] + [-3] + [-1]x2[2] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] + [-1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (-1)bni_56] + [bni_56]x0[0] + [(-1)bni_56]x2[2] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

We simplified constraint (59) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(60)    (x0[0] ≥ 0∧[2] + x2[2] + x0[0] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] + [-1] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

We simplified constraint (60) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(61)    (x0[0] ≥ 0∧[2] + x2[2] + x0[0] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

We simplified constraint (61) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(62)    (x0[0] ≥ 0∧[2] + [-1]x2[2] + x0[0] ≥ 0∧[-1]x2[2] + [1] ≥ 0∧x1[0] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

(63)    (x0[0] ≥ 0∧[2] + x2[2] + x0[0] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)
We consider the chain COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0) which results in the following constraint:
(64)    (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6]=x2[0]∧+(x4[6], 1)=x4[0]∧&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0]=x2[2]∧x4[0]=x4[2] ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (64) using rules (I), (II), (III), (VII), (IDP_BOOLEAN) which results in the following new constraint:
(65)    (EOS(STATIC_3922(x0[6]))=x26∧+(x4[6], 1)=x27∧3922_0_safeMove_ConstantStackPush(x26, x2[6], x27)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧>(x0[0], +(x2[6], 1))=TRUE∧>(x0[0], 0)=TRUE∧>(x2[6], -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[6], +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[6], +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x2[6], 1), 0), +(x2[6], 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (65) using rule (V) (with possible (I) afterwards) using induction on 3922_0_safeMove_ConstantStackPush(x26, x2[6], x27)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]) which results in the following new constraint:
(66)    (3349_0_safeMove_GE(EOS(STATIC_3922(x30)), x28, 1, 0, x29)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧EOS(STATIC_3922(x0[6]))=EOS(STATIC_3922(x30))∧+(x4[6], 1)=x28∧>(x0[0], +(x29, 1))=TRUE∧>(x0[0], 0)=TRUE∧>(x29, -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x29, +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x29, +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x29, 1), 0), +(x29, 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (66) using rules (I), (II), (III), (VII) which results in the following new constraint:
(67)    (3349_0_safeMove_GE(EOS(STATIC_3922(x30)), +(x4[6], 1), 1, 0, x29)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧>(x0[0], +(x29, 1))=TRUE∧>(x0[0], 0)=TRUE∧>(x29, -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x29, +(x4[6], 1))≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x29, +(x4[6], 1))≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[0])), +(x29, 1), 0), +(x29, 1), 0)∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥))

We simplified constraint (67) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(68)    (x0[0] + [-2] + [-1]x29 ≥ 0∧x0[0] + [-1] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56] + [bni_56]x0[0] + [bni_56]max{[-1] + [-1]x4[6] + [-1]x29, [-1]x29} ≥ 0∧[(-1)bso_57] + max{[-1] + [-1]x4[6] + [-1]x29, [-1]x29} + [-1]max{[-1] + [-1]x29, [-1] + [-1]x29} ≥ 0)

We simplified constraint (68) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(69)    (x0[0] + [-2] + [-1]x29 ≥ 0∧x0[0] + [-1] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56] + [bni_56]x0[0] + [bni_56]max{[-1] + [-1]x4[6] + [-1]x29, [-1]x29} ≥ 0∧[(-1)bso_57] + max{[-1] + [-1]x4[6] + [-1]x29, [-1]x29} + [-1]max{[-1] + [-1]x29, [-1] + [-1]x29} ≥ 0)

We simplified constraint (69) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(70)    (x0[0] + [-2] + [-1]x29 ≥ 0∧x0[0] + [-1] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + [-1]x4[6] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (-1)bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] + [(-1)bni_56]x29 ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

(71)    (x0[0] + [-2] + [-1]x29 ≥ 0∧x0[0] + [-1] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (-1)bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] + [(-1)bni_56]x29 ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

(72)    (x0[0] + [-2] + [-1]x29 ≥ 0∧x0[0] + [-1] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56] + [bni_56]x0[0] + [(-1)bni_56]x29 ≥ 0∧[1 + (-1)bso_57] ≥ 0)

We simplified constraint (70) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(73)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + [-1]x4[6] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

We simplified constraint (71) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(74)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

We simplified constraint (72) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(75)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] + [-1] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

We simplified constraint (73) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(76)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧[-1] + [-1]x4[6] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

We simplified constraint (76) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(77)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] + [bni_56]x4[6] ≥ 0∧[1 + (-1)bso_57] + x4[6] ≥ 0)

We simplified constraint (74) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(78)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧[-1] + [-1]x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + bni_56] + [bni_56]x0[0] + [(-1)bni_56]x4[6] ≥ 0∧[(-1)bso_57] + [-1]x4[6] ≥ 0)

We simplified constraint (78) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(79)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] + [bni_56]x4[6] ≥ 0∧[1 + (-1)bso_57] + x4[6] ≥ 0)

We simplified constraint (75) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(80)    (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)

For Pair 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]), COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0) which results in the following constraint:
(81)    (&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1)))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])=3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2])∧x2[0]=x2[2]∧x4[0]=x4[2] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (81) using rules (I), (II), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(82)    (>(x0[0], +(x2[0], 1))=TRUE∧>(x0[0], 0)=TRUE∧>(x2[0], -1)=TRUE∧>(x1[0], 0)=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])≥COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥))

We simplified constraint (82) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(83)    (x0[0] + [-2] + [-1]x2[0] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58] + [bni_58]x0[0] + [bni_58]max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} ≥ 0∧[(-1)bso_59] + max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} + [-1]max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} ≥ 0)

We simplified constraint (83) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(84)    (x0[0] + [-2] + [-1]x2[0] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58] + [bni_58]x0[0] + [bni_58]max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} ≥ 0∧[(-1)bso_59] + max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} + [-1]max{[-1]x4[0] + [-1]x2[0], [-1]x2[0]} ≥ 0)

We simplified constraint (84) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraints:
(85)    (x0[0] + [-2] + [-1]x2[0] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0∧[-1]x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58] + [bni_58]x0[0] + [(-1)bni_58]x4[0] + [(-1)bni_58]x2[0] ≥ 0∧[(-1)bso_59] ≥ 0)

(86)    (x0[0] + [-2] + [-1]x2[0] ≥ 0∧x0[0] + [-1] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58] + [bni_58]x0[0] + [(-1)bni_58]x2[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (85) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(87)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0∧[-1]x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] + [(-1)bni_58]x4[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (86) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(88)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] + [-1] ≥ 0∧[-1] + x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (87) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(89)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧[-1]x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] + [(-1)bni_58]x4[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (89) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(90)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] + [bni_58]x4[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (88) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(91)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧[-1] + x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] ≥ 0∧[(-1)bso_59] ≥ 0)

We simplified constraint (91) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(92)    (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] ≥ 0∧[(-1)bso_59] ≥ 0)

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

COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))
- (x0[5] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + bni_52] + [bni_52]x0[5] + [(-1)bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)
- (x0[5] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_52 + bni_52] + [bni_52]x0[5] + [bni_52]x2[2] ≥ 0∧[(-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧[2] + [-1]x0[5] + x4[6] ≥ 0∧[1] + [-1]x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧[2] + x0[5] + x4[6] ≥ 0∧[1] + x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧[2] + x0[5] + x4[6] ≥ 0∧[1] + x0[5] + x4[6] ≥ 0∧x0[5] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[1 + (-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧0 ≥ 0∧0 ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)
- (x4[6] ≥ 0∧0 ≥ 0∧0 ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (2)bni_52] + [bni_52]x4[6] + [bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)
- (x0[5] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (3)bni_52] + [bni_52]x4[6] + [bni_52]x0[5] + [(-1)bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)
- (x0[5] ≥ 0∧x4[6] ≥ 0∧[1] + x4[6] ≥ 0∧x12 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6]1)), x2[6]1, +(x4[6]1, 1)), x2[6]1, +(x4[6]1, 1))), ≥)∧[(-1)Bound*bni_52 + (3)bni_52] + [bni_52]x4[6] + [bni_52]x0[5] + [bni_52]x12 ≥ 0∧[(-1)bso_53] ≥ 0)
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
- (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
- (x0[5] + [-2] + x4[5] ≥ 0∧x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54] + [bni_54]x0[5] + [bni_54]x4[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
- (x4[5] ≥ 0∧[2] + x0[5] + x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
- (x4[5] ≥ 0∧[2] + x0[5] + x4[5] ≥ 0∧x0[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (2)bni_54] + [bni_54]x4[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
- (x0[5] ≥ 0∧x4[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (3)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [(-1)bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
- (x0[5] ≥ 0∧x4[5] ≥ 0∧x2[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_54 + (3)bni_54] + [bni_54]x4[5] + [bni_54]x0[5] + [bni_54]x2[5] ≥ 0∧[(-1)bso_55] ≥ 0)
COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)
- (x0[0] ≥ 0∧[2] + [-1]x2[2] + x0[0] ≥ 0∧[-1]x2[2] + [1] ≥ 0∧x1[0] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)
- (x0[0] ≥ 0∧[2] + x2[2] + x0[0] ≥ 0∧x2[2] + [1] ≥ 0∧x1[0] ≥ 0∧0 ≥ 0∧x2[2] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2]1)), +(x2[2]1, 1), 0), +(x2[2]1, 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)
- (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0∧0 ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] + [bni_56]x4[6] ≥ 0∧[1 + (-1)bso_57] + x4[6] ≥ 0)
- (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] + [bni_56]x4[6] ≥ 0∧[1 + (-1)bso_57] + x4[6] ≥ 0)
- (x0[0] ≥ 0∧[1] + x29 + x0[0] ≥ 0∧x29 ≥ 0∧x1[0] ≥ 0∧x4[6] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)), ≥)∧[(-1)Bound*bni_56 + (2)bni_56] + [bni_56]x0[0] ≥ 0∧[1 + (-1)bso_57] ≥ 0)
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])
- (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] + [bni_58]x4[0] ≥ 0∧[(-1)bso_59] ≥ 0)
- (x0[0] ≥ 0∧[1] + x2[0] + x0[0] ≥ 0∧x2[0] ≥ 0∧x1[0] ≥ 0∧x4[0] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])), ≥)∧[(-1)Bound*bni_58 + (2)bni_58] + [bni_58]x0[0] ≥ 0∧[(-1)bso_59] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(3922_0_safeMove_ConstantStackPush(x₁, x₂, x₃)) = [-1]x₁
POL(EOS(x₁)) = x₁
POL(STATIC_3922(x₁)) = x₁
POL(3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅)) = [-1]x₁
POL(1) = [1]
POL(0) = 0
POL(Cond_3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(>=(x₁, x₂)) = [-1]
POL(Cond_3349_0_safeMove_GE1(x₁, x₂, x₃, x₄, x₅, x₆)) = [1] + [-1]x₂
POL(&&(x₁, x₂)) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(Cond_3349_0_safeMove_GE2(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(Cond_3349_0_safeMove_GE3(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(3445_1_safeMove_InvokeMethod(x₁, x₂, x₃, x₄)) = [-1]x₁
POL(3441_0_search_InvokeMethod(x₁)) = x₁
POL(3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅)) = [-1]x₁
POL(Cond_3675_0_safeMove_NE1(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(Cond_3349_0_safeMove_GE4(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(Cond_3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(Cond_3349_0_safeMove_GE7(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1]x₂
POL(!(x₁)) = [-1]
POL(=(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(3372_0_safeMove_Return(x₁, x₂)) = [-1]x₁
POL(3631_0_safeMove_ArrayAccess(x₁, x₂, x₃, x₄, x₅)) = [1] + [-1]x₁
POL(java.lang.Object(x₁)) = x₁
POL(ARRAY(x₁)) = x₁
POL(COND_3922_1_SEARCH_INVOKEMETHOD1(x₁, x₂, x₃, x₄)) = [-1]x₂ + max{[-1]x₄ + [-1]x₃, [-1]x₃}
POL(3922_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃)) = [-1]x₁ + max{[-1]x₃ + [-1]x₂, [-1]x₂}
POL(COND_3922_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃, x₄)) = [-1]x₂ + max{[-1]x₄ + [-1]x₃, [-1]x₃}

The following pairs are in P_>:

COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)

The following pairs are in P_bound:

COND_3922_1_SEARCH_INVOKEMETHOD(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[2])), x1[2]), x2[2], x4[2]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[2])), +(x2[2], 1), 0), +(x2[2], 1), 0)
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])

The following pairs are in P_≥:

COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0]) → COND_3922_1_SEARCH_INVOKEMETHOD(&&(&&(&&(>(x2[0], -1), >(x1[0], 0)), >(x0[0], 0)), >(x0[0], +(x2[0], 1))), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0]), x2[0], x4[0])

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

3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)¹
Cond_3349_0_safeMove_GE(>=(x4, x1), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
Cond_3349_0_safeMove_GE1(&&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
Cond_3349_0_safeMove_GE2(&&(>(x4, -1), <(x4, x1)), EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x4, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE3(&&(&&(<(x4, x1), <(x4, x0)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)¹ → Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹ ↔ 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)¹
Cond_3675_0_safeMove_NE1(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, +(x3, 1), x1)¹
Cond_3349_0_safeMove_GE4(&&(&&(>(x3, 0), <(x1, x1)), <(x1, x0)), EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)¹
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)¹ → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹
Cond_3675_0_safeMove_NE(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x3, 1), x1)¹
Cond_3349_0_safeMove_GE3(&&(&&(<(x3, x1), <(x3, x0)), >(x2, 0)), EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹ → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)¹ → Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ Cond_3349_0_safeMove_GE7(&&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1)))), EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)¹
3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)¹ → Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)¹ → Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹

(53) Obligation:

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

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

The following domains are used:

Integer, Boolean

(6) -> (0), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[0])), x1[0])∧x2[6] →^* x2[0]∧x4[6] + 1 →^* x4[0])

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

(54) IDependencyGraphProof (EQUIVALENT transformation)

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

(55) Obligation:

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

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

The following domains are used:

Integer, Boolean

(6) -> (5), if (3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], x4[6] + 1) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)∧x2[6] →^* x2[5]∧x4[6] + 1 →^* x4[5])

(5) -> (6), if (x0[5] > x4[5] + 1 ∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0) →^* 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5] →^* x2[6]∧x4[5] →^* x4[6])

(56) IDPNonInfProof (SOUND transformation)

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

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

For Pair 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) which results in the following constraint:
(1)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6] ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (1) using rules (I), (II), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(2)    (>(x0[5], +(x4[5], 1))=TRUE ⇒ 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥NonInfC∧3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])≥COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])∧(U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥))

We simplified constraint (2) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(3)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_114] + [(-1)bni_114]x4[5] + [bni_114]x0[5] ≥ 0∧[(-1)bso_115] ≥ 0)

We simplified constraint (3) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(4)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_114] + [(-1)bni_114]x4[5] + [bni_114]x0[5] ≥ 0∧[(-1)bso_115] ≥ 0)

We simplified constraint (4) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(5)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧[(-1)Bound*bni_114] + [(-1)bni_114]x4[5] + [bni_114]x0[5] ≥ 0∧[(-1)bso_115] ≥ 0)

We simplified constraint (5) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(6)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114] + [(-1)bni_114]x4[5] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(7)    (x0[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114 + (2)bni_114] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)

We simplified constraint (7) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(8)    (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114 + (2)bni_114] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)

(9)    (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114 + (2)bni_114] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)

For Pair COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)) the following chains were created:

We consider the chain 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]), COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1)), 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) which results in the following constraint:
(10)    (>(x0[5], +(x4[5], 1))=TRUE∧3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0)=3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0)∧x2[5]=x2[6]∧x4[5]=x4[6]∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5]1)), 0)∧x2[6]=x2[5]1∧+(x4[6], 1)=x4[5]1 ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (10) using rules (I), (II), (III), (IV), (DELETE_TRIVIAL_REDUCESTO) which results in the following new constraint:
(11)    (>(x0[5], +(x4[5], 1))=TRUE∧3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1))=3372_0_safeMove_Return(EOS(STATIC_3922(x0[5]1)), 0) ⇒ COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥NonInfC∧COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[6], x4[5])≥3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[5])), x2[6], +(x4[5], 1)), x2[6], +(x4[5], 1))∧(U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥))

We simplified constraint (11) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(12)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_116] + [(-1)bni_116]x4[5] + [bni_116]x0[5] ≥ 0∧[1 + (-1)bso_117] ≥ 0)

We simplified constraint (12) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(13)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_116] + [(-1)bni_116]x4[5] + [bni_116]x0[5] ≥ 0∧[1 + (-1)bso_117] ≥ 0)

We simplified constraint (13) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(14)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧[(-1)Bound*bni_116] + [(-1)bni_116]x4[5] + [bni_116]x0[5] ≥ 0∧[1 + (-1)bso_117] ≥ 0)

We simplified constraint (14) using rule (IDP_UNRESTRICTED_VARS) which results in the following new constraint:
(15)    (x0[5] + [-2] + [-1]x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116] + [(-1)bni_116]x4[5] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)

We simplified constraint (15) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(16)    (x0[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116 + (2)bni_116] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)

We simplified constraint (16) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(17)    (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116 + (2)bni_116] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)

(18)    (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116 + (2)bni_116] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)

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

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
- (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114 + (2)bni_114] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)
- (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])), ≥)∧0 = 0∧[(-1)Bound*bni_114 + (2)bni_114] + [bni_114]x0[5] ≥ 0∧0 = 0∧[(-1)bso_115] ≥ 0)
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))
- (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116 + (2)bni_116] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)
- (x0[5] ≥ 0∧x4[5] ≥ 0 ⇒ (U^Increasing(3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))), ≥)∧0 = 0∧[(-1)Bound*bni_116 + (2)bni_116] + [bni_116]x0[5] ≥ 0∧0 = 0∧[1 + (-1)bso_117] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = [3]
POL(3922_0_safeMove_ConstantStackPush(x₁, x₂, x₃)) = [-1] + [-1]x₁
POL(EOS(x₁)) = [-1] + [-1]x₁
POL(STATIC_3922(x₁)) = [-1] + [-1]x₁
POL(3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₁
POL(1) = [1]
POL(0) = 0
POL(Cond_3349_0_safeMove_GE(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₂
POL(>=(x₁, x₂)) = [-1]
POL(Cond_3349_0_safeMove_GE1(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₂
POL(&&(x₁, x₂)) = [-1]
POL(<(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(Cond_3349_0_safeMove_GE2(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₄ + [-1]x₂
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(Cond_3349_0_safeMove_GE3(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₂
POL(3445_1_safeMove_InvokeMethod(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₁
POL(3441_0_search_InvokeMethod(x₁)) = x₁
POL(3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₁
POL(Cond_3675_0_safeMove_NE1(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₆ + [-1]x₂
POL(Cond_3349_0_safeMove_GE4(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₂
POL(Cond_3675_0_safeMove_NE(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₂
POL(Cond_3349_0_safeMove_GE7(x₁, x₂, x₃, x₄, x₅, x₆)) = [-1] + [-1]x₅ + x₃ + [-1]x₂
POL(!(x₁)) = [-1]
POL(=(x₁, x₂)) = [-1]
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(3372_0_safeMove_Return(x₁, x₂)) = [-1] + [-1]x₁
POL(3631_0_safeMove_ArrayAccess(x₁, x₂, x₃, x₄, x₅)) = [-1] + [-1]x₄ + [-1]x₁
POL(java.lang.Object(x₁)) = 0
POL(ARRAY(x₁)) = [-1]
POL(3922_1_SEARCH_INVOKEMETHOD(x₁, x₂, x₃)) = [-1] + [-1]x₃ + [-1]x₁
POL(COND_3922_1_SEARCH_INVOKEMETHOD1(x₁, x₂, x₃, x₄)) = [-1] + [-1]x₄ + [-1]x₂

The following pairs are in P_>:

COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))

The following pairs are in P_bound:

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])
COND_3922_1_SEARCH_INVOKEMETHOD1(TRUE, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[6])), 0), x2[6], x4[6]) → 3922_1_SEARCH_INVOKEMETHOD(3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0[6])), x2[6], +(x4[6], 1)), x2[6], +(x4[6], 1))

The following pairs are in P_≥:

3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(>(x0[5], +(x4[5], 1)), 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])

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

3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE(>=(x4, x1), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE1(&&(&&(>=(x4, x0), <(x4, x1)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE2(&&(>(x4, -1), <(x4, x1)), EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x4, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ Cond_3349_0_safeMove_GE3(&&(&&(<(x4, x1), <(x4, x0)), >(x3, 0)), EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹ ↔ 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)¹
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ ↔ Cond_3675_0_safeMove_NE1(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, +(x3, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ ↔ Cond_3349_0_safeMove_GE4(&&(&&(>(x3, 0), <(x1, x1)), <(x1, x0)), EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)¹
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4)¹ ↔ 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)¹
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ ↔ Cond_3675_0_safeMove_NE(>(x3, -1), EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1)¹ ↔ 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, +(x3, 1), x1)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹ ↔ Cond_3349_0_safeMove_GE3(&&(&&(<(x3, x1), <(x3, x0)), >(x2, 0)), EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)¹
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ Cond_3349_0_safeMove_GE7(&&(&&(&&(>(x3, 0), <(x2, x1)), <(x2, x0)), !(=(-(x1, x2), -(x2, x1)))), EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1)¹ ↔ 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)¹
FALSE¹ → &&(TRUE, FALSE)¹
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)¹
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1)¹ ↔ 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)¹

(57) Obligation:

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

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

The following domains are used:

Integer, Boolean

The ITRS R consists of the following rules:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, 0, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE(x4 >= x1, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE1(x4 >= x0 && x4 < x1 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4, x1) → Cond_3349_0_safeMove_GE2(x4 > -1 && x4 < x1, EOS(STATIC_3922(x0)), x2, 0, x4, x1)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x2, 0, x4, x1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x4 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x4, x1) → Cond_3349_0_safeMove_GE3(x4 < x1 && x4 < x0 && x3 > 0, EOS(STATIC_3922(x0)), x2, x3, x4, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x4)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 0)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0) → Cond_3675_0_safeMove_NE1(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 1, x3 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x1, x1) → Cond_3349_0_safeMove_GE4(x3 > 0 && x1 < x1 && x1 < x0, EOS(STATIC_3922(x0)), x2, x3, x1, x1)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x2, x3, x1, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x1)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x2, x3, x4) → 3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x2, x3, x4, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1) → Cond_3675_0_safeMove_NE(x3 > -1, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1) → 3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, 0, x3 + 1, x1)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x1) → Cond_3349_0_safeMove_GE3(x3 < x1 && x3 < x0 && x2 > 0, EOS(STATIC_3922(x0)), x1, x2, x3, x1)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x1, x3)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x2, x3, x2, x1) → Cond_3349_0_safeMove_GE7(x3 > 0 && x2 < x1 && x2 < x0 && !(x1 - x2 = x2 - x1), EOS(STATIC_3922(x0)), x2, x3, x2, x1)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x2, x3, x2, x1) → 3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x2)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3372_0_safeMove_Return(EOS(STATIC_3922(x0)), x3)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x2, x3, x4, x1) → 3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x4)

The integer pair graph contains the following rules and edges:
(5): 3922_1_SEARCH_INVOKEMETHOD(3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5]) → COND_3922_1_SEARCH_INVOKEMETHOD1(x0[5] > x4[5] + 1, 3372_0_safeMove_Return(EOS(STATIC_3922(x0[5])), 0), x2[5], x4[5])

The set Q consists of the following terms:
3922_0_safeMove_ConstantStackPush(EOS(STATIC_3922(x0)), x1, x2)
3349_0_safeMove_GE(EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE2(TRUE, EOS(STATIC_3922(x0)), x1, 0, x2, x3)
3922_1_search_InvokeMethod(3631_0_safeMove_ArrayAccess(EOS(STATIC_3922(x0)), x1, x2, java.lang.Object(ARRAY(x0)), x3), x1, x2)
3979_1_search_InvokeMethod(4087_0_search_ArrayAccess(EOS(STATIC_3922(x0)), java.lang.Object(ARRAY(x0)), x1, x2), x3, x4)
3979_1_search_InvokeMethod(4106_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2, x3), x4, x5)
3979_1_search_InvokeMethod(3935_0_search_InvokeMethod(EOS(STATIC_3922(x0)), x1, x2), x3, x4)
3979_1_search_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2)
Cond_3349_0_safeMove_GE3(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x4)
Cond_3349_0_safeMove_GE4(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, x3)
Cond_3349_0_safeMove_GE7(TRUE, EOS(STATIC_3922(x0)), x1, x2, x1, x3)
3445_1_safeMove_InvokeMethod(3441_0_search_InvokeMethod(EOS(STATIC_3922(x0))), x1, x2, x3)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 1)
Cond_3675_0_safeMove_NE(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 1)
3675_0_safeMove_NE(EOS(STATIC_3922(x0)), x1, x2, x3, 0)
Cond_3675_0_safeMove_NE1(TRUE, EOS(STATIC_3922(x0)), x1, x2, x3, 0)

(58) IDependencyGraphProof (EQUIVALENT transformation)

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

(0) Obligation:

(1) JBCToGraph (SOUND transformation)

(2) Obligation:

(3) TerminationGraphToSCCProof (SOUND transformation)

(4) Complex Obligation (AND)

(5) Obligation:

(6) SCCToIDPv1Proof (SOUND transformation)

(7) Obligation:

(8) IDPNonInfProof (SOUND transformation)

(9) Complex Obligation (AND)

(10) Obligation:

(11) IDependencyGraphProof (EQUIVALENT transformation)

(12) Obligation:

(13) IDPNonInfProof (SOUND transformation)

(14) Complex Obligation (AND)

(15) Obligation:

(16) IDependencyGraphProof (EQUIVALENT transformation)

(17) TRUE

(18) Obligation:

(19) IDependencyGraphProof (EQUIVALENT transformation)

(20) TRUE

(21) Obligation:

(22) IDependencyGraphProof (EQUIVALENT transformation)

(23) TRUE

(24) Obligation:

(25) SCCToIDPv1Proof (SOUND transformation)

(26) Obligation:

(27) IDPNonInfProof (SOUND transformation)

(28) Complex Obligation (AND)

(29) Obligation:

(30) IDependencyGraphProof (EQUIVALENT transformation)

(31) Obligation:

(32) IDPNonInfProof (SOUND transformation)

(33) Complex Obligation (AND)

(34) Obligation:

(35) IDependencyGraphProof (EQUIVALENT transformation)

(36) TRUE

(37) Obligation:

(38) IDependencyGraphProof (EQUIVALENT transformation)

(39) TRUE

(40) Obligation:

(41) IDependencyGraphProof (EQUIVALENT transformation)

(42) TRUE

(43) Obligation:

(44) SCCToIDPv1Proof (SOUND transformation)

(45) Obligation:

(46) IDPNonInfProof (SOUND transformation)

(47) Obligation:

(48) IDependencyGraphProof (EQUIVALENT transformation)

(49) Obligation:

(50) UsableRulesProof (EQUIVALENT transformation)

(51) Obligation:

(52) IDPNonInfProof (SOUND transformation)

(53) Obligation:

(54) IDependencyGraphProof (EQUIVALENT transformation)

(55) Obligation:

(56) IDPNonInfProof (SOUND transformation)

(57) Obligation:

(58) IDependencyGraphProof (EQUIVALENT transformation)

(59) TRUE