Termination proof of /tmp/tmpeGlclU/Log.jar

Termination of the given JBC could be proven:

0 JBC

↳1 JBCToGraph (⇒, 650 ms)

↳2 JBCTerminationGraph

↳3 TerminationGraphToSCCProof (⇒, 0 ms)

↳4 JBCTerminationSCC

↳5 SCCToIDPv1Proof (⇒, 80 ms)

↳6 IDP

↳7 IDPNonInfProof (⇒, 1080 ms)

↳8 IDP

↳9 IDependencyGraphProof (⇔, 0 ms)

↳10 IDP

↳11 IDPNonInfProof (⇒, 140 ms)

↳12 IDP

↳13 IDependencyGraphProof (⇔, 0 ms)

↳14 TRUE

(0) Obligation:

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

public class Log{
  public static int half(int x) {

    int res = 0;

    while (x > 1) {

      x = x-2;
      res++;

    }

    return res;

  }


  public static int log(int x) {

    int res = 0;

    while (x > 1) {

      x = half(x);
      res++;

    }

    return res;

  }


  public static void main(String[] args) {
    Random.args = args;
    int x = Random.random();
    log(x);
  }
}


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

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

(1) JBCToGraph (SOUND transformation)

Constructed TerminationGraph.

(2) Obligation:

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

(3) TerminationGraphToSCCProof (SOUND transformation)

Splitted TerminationGraph to 1 SCCs.

(4) Obligation:

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

(5) SCCToIDPv1Proof (SOUND transformation)

Transformed FIGraph SCCs to IDPs. Log:

Generated 31 rules for P and 0 rules for R.

P rules:
616_0_log_ConstantStackPush(EOS(STATIC_616), i118, i118) → 618_0_log_LE(EOS(STATIC_618), i118, i118, 1)
618_0_log_LE(EOS(STATIC_618), i126, i126, matching1) → 622_0_log_LE(EOS(STATIC_622), i126, i126, 1) | =(matching1, 1)
622_0_log_LE(EOS(STATIC_622), i126, i126, matching1) → 626_0_log_Load(EOS(STATIC_626), i126) | &&(>(i126, 1), =(matching1, 1))
626_0_log_Load(EOS(STATIC_626), i126) → 630_0_log_InvokeMethod(EOS(STATIC_630), i126)
630_0_log_InvokeMethod(EOS(STATIC_630), i126) → 634_0_half_ConstantStackPush(EOS(STATIC_634), i126, i126)
634_0_half_ConstantStackPush(EOS(STATIC_634), i126, i126) → 639_0_half_Store(EOS(STATIC_639), i126, i126, 0)
639_0_half_Store(EOS(STATIC_639), i126, i126, matching1) → 641_0_half_Load(EOS(STATIC_641), i126, i126, 0) | =(matching1, 0)
641_0_half_Load(EOS(STATIC_641), i126, i126, matching1) → 667_0_half_Load(EOS(STATIC_667), i126, i126, 0) | =(matching1, 0)
667_0_half_Load(EOS(STATIC_667), i126, i129, i130) → 971_0_half_Load(EOS(STATIC_971), i126, i129, i130)
971_0_half_Load(EOS(STATIC_971), i126, i228, i229) → 1128_0_half_Load(EOS(STATIC_1128), i126, i228, i229)
1128_0_half_Load(EOS(STATIC_1128), i126, i322, i323) → 1274_0_half_Load(EOS(STATIC_1274), i126, i322, i323)
1274_0_half_Load(EOS(STATIC_1274), i126, i413, i414) → 1275_0_half_ConstantStackPush(EOS(STATIC_1275), i126, i413, i414, i413)
1275_0_half_ConstantStackPush(EOS(STATIC_1275), i126, i413, i414, i413) → 1277_0_half_LE(EOS(STATIC_1277), i126, i413, i414, i413, 1)
1277_0_half_LE(EOS(STATIC_1277), i126, i420, i414, i420, matching1) → 1279_0_half_LE(EOS(STATIC_1279), i126, i420, i414, i420, 1) | =(matching1, 1)
1277_0_half_LE(EOS(STATIC_1277), i126, i421, i414, i421, matching1) → 1280_0_half_LE(EOS(STATIC_1280), i126, i421, i414, i421, 1) | =(matching1, 1)
1279_0_half_LE(EOS(STATIC_1279), i126, i420, i414, i420, matching1) → 1281_0_half_Load(EOS(STATIC_1281), i126, i414) | &&(<=(i420, 1), =(matching1, 1))
1281_0_half_Load(EOS(STATIC_1281), i126, i414) → 1284_0_half_Return(EOS(STATIC_1284), i126, i414)
1284_0_half_Return(EOS(STATIC_1284), i126, i414) → 1287_0_log_Store(EOS(STATIC_1287), i414)
1287_0_log_Store(EOS(STATIC_1287), i414) → 1290_0_log_Inc(EOS(STATIC_1290), i414)
1290_0_log_Inc(EOS(STATIC_1290), i414) → 1294_0_log_JMP(EOS(STATIC_1294), i414)
1294_0_log_JMP(EOS(STATIC_1294), i414) → 1297_0_log_Load(EOS(STATIC_1297), i414)
1297_0_log_Load(EOS(STATIC_1297), i414) → 612_0_log_Load(EOS(STATIC_612), i414)
612_0_log_Load(EOS(STATIC_612), i118) → 616_0_log_ConstantStackPush(EOS(STATIC_616), i118, i118)
1280_0_half_LE(EOS(STATIC_1280), i126, i421, i414, i421, matching1) → 1282_0_half_Load(EOS(STATIC_1282), i126, i421, i414) | &&(>(i421, 1), =(matching1, 1))
1282_0_half_Load(EOS(STATIC_1282), i126, i421, i414) → 1285_0_half_ConstantStackPush(EOS(STATIC_1285), i126, i414, i421)
1285_0_half_ConstantStackPush(EOS(STATIC_1285), i126, i414, i421) → 1288_0_half_IntArithmetic(EOS(STATIC_1288), i126, i414, i421, 2)
1288_0_half_IntArithmetic(EOS(STATIC_1288), i126, i414, i421, matching1) → 1292_0_half_Store(EOS(STATIC_1292), i126, i414, -(i421, 2)) | &&(>(i421, 0), =(matching1, 2))
1292_0_half_Store(EOS(STATIC_1292), i126, i414, i424) → 1295_0_half_Inc(EOS(STATIC_1295), i126, i424, i414)
1295_0_half_Inc(EOS(STATIC_1295), i126, i424, i414) → 1299_0_half_JMP(EOS(STATIC_1299), i126, i424, +(i414, 1)) | >=(i414, 0)
1299_0_half_JMP(EOS(STATIC_1299), i126, i424, i428) → 1486_0_half_Load(EOS(STATIC_1486), i126, i424, i428)
1486_0_half_Load(EOS(STATIC_1486), i126, i424, i428) → 1274_0_half_Load(EOS(STATIC_1274), i126, i424, i428)
R rules:

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

P rules:
1277_0_half_LE(EOS(STATIC_1277), x0, x1, x2, x1, 1) → 1277_0_half_LE(EOS(STATIC_1277), x2, x2, 0, x2, 1) | &&(>(x2, 1), <=(x1, 1))
1277_0_half_LE(EOS(STATIC_1277), x0, x1, x2, x1, 1) → 1277_0_half_LE(EOS(STATIC_1277), x0, -(x1, 2), +(x2, 1), -(x1, 2), 1) | &&(>(+(x2, 1), 0), >(x1, 1))
R rules:

Filtered ground terms:

1277_0_half_LE(x1, x2, x3, x4, x5, x6) → 1277_0_half_LE(x2, x3, x4, x5)
EOS(x1) → EOS
Cond_1277_0_half_LE1(x1, x2, x3, x4, x5, x6, x7) → Cond_1277_0_half_LE1(x1, x3, x4, x5, x6)
Cond_1277_0_half_LE(x1, x2, x3, x4, x5, x6, x7) → Cond_1277_0_half_LE(x1, x3, x4, x5, x6)

Filtered duplicate args:

1277_0_half_LE(x1, x2, x3, x4) → 1277_0_half_LE(x1, x3, x4)
Cond_1277_0_half_LE(x1, x2, x3, x4, x5) → Cond_1277_0_half_LE(x1, x2, x4, x5)
Cond_1277_0_half_LE1(x1, x2, x3, x4, x5) → Cond_1277_0_half_LE1(x1, x2, x4, x5)

Filtered unneeded arguments:

Cond_1277_0_half_LE(x1, x2, x3, x4) → Cond_1277_0_half_LE(x1, x3)
Cond_1277_0_half_LE1(x1, x2, x3, x4) → Cond_1277_0_half_LE1(x1, x3, x4)
1277_0_half_LE(x1, x2, x3) → 1277_0_half_LE(x2, x3)

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

P rules:
1277_0_half_LE(x2, x1) → 1277_0_half_LE(0, x2) | &&(>(x2, 1), <=(x1, 1))
1277_0_half_LE(x2, x1) → 1277_0_half_LE(+(x2, 1), -(x1, 2)) | &&(>(x2, -1), >(x1, 1))
R rules:

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

P rules:
1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE(&&(>(x2, 1), <=(x1, 1)), x2, x1)
COND_1277_0_HALF_LE(TRUE, x2, x1) → 1277_0_HALF_LE(0, x2)
1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE1(&&(>(x2, -1), >(x1, 1)), x2, x1)
COND_1277_0_HALF_LE1(TRUE, x2, x1) → 1277_0_HALF_LE(+(x2, 1), -(x1, 2))
R rules:

(6) Obligation:

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

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

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(0): 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(x2[0] > 1 && x1[0] <= 1, x2[0], x1[0])
(1): COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])
(2): 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(x2[2] > -1 && x1[2] > 1, x2[2], x1[2])
(3): COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(x2[3] + 1, x1[3] - 2)

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

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

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

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

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

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

The set Q is empty.

(7) IDPNonInfProof (SOUND transformation)

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

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 1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE(&&(>(x2, 1), <=(x1, 1)), x2, x1) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(1)    (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1] ⇒ 1277_0_HALF_LE(x2[0], x1[0])≥NonInfC∧1277_0_HALF_LE(x2[0], x1[0])≥COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])∧(U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥))

We simplified constraint (1) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x2[0], 1)=TRUE∧<=(x1[0], 1)=TRUE ⇒ 1277_0_HALF_LE(x2[0], x1[0])≥NonInfC∧1277_0_HALF_LE(x2[0], x1[0])≥COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])∧(U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥))

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

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

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

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

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

(8)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x1[0] + [bni_17]x2[0] ≥ 0∧[(-1)bso_18] ≥ 0)

For Pair COND_1277_0_HALF_LE(TRUE, x2, x1) → 1277_0_HALF_LE(0, x2) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(9) (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[0]1∧x2[1]=x1[0]1∧&&(>(x2[0]1, 1), <=(x1[0]1, 1))=TRUE∧x2[0]1=x2[1]1∧x1[0]1=x1[1]1∧0=x2[0]2∧x2[1]1=x1[0]2∧&&(>(x2[0]2, 1), <=(x1[0]2, 1))=TRUE∧x2[0]2=x2[1]2∧x1[0]2=x1[1]2 ⇒ COND_1277_0_HALF_LE(TRUE, x2[1]1, x1[1]1)≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[1]1, x1[1]1)≥1277_0_HALF_LE(0, x2[1]1)∧(U^Increasing(1277_0_HALF_LE(0, x2[1]1)), ≥))

We solved constraint (9) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (IDP_BOOLEAN).
We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)) which results in the following constraint:
(10) (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[0]1∧x2[1]=x1[0]1∧&&(>(x2[0]1, 1), <=(x1[0]1, 1))=TRUE∧x2[0]1=x2[1]1∧x1[0]1=x1[1]1∧0=x2[2]∧x2[1]1=x1[2]∧&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3] ⇒ COND_1277_0_HALF_LE(TRUE, x2[1]1, x1[1]1)≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[1]1, x1[1]1)≥1277_0_HALF_LE(0, x2[1]1)∧(U^Increasing(1277_0_HALF_LE(0, x2[1]1)), ≥))

We solved constraint (10) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (IDP_BOOLEAN).
We consider the chain 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(11) (&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[0]∧-(x1[3], 2)=x1[0]∧&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[0]1∧x2[1]=x1[0]1∧&&(>(x2[0]1, 1), <=(x1[0]1, 1))=TRUE∧x2[0]1=x2[1]1∧x1[0]1=x1[1]1 ⇒ COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥1277_0_HALF_LE(0, x2[1])∧(U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥))

We solved constraint (11) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (IDP_BOOLEAN).
We consider the chain 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)) which results in the following constraint:
(12)    (&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[0]∧-(x1[3], 2)=x1[0]∧&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[2]1∧x2[1]=x1[2]1∧&&(>(x2[2]1, -1), >(x1[2]1, 1))=TRUE∧x2[2]1=x2[3]1∧x1[2]1=x1[3]1 ⇒ COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥1277_0_HALF_LE(0, x2[1])∧(U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥))

We simplified constraint (12) using rules (III), (IV), (IDP_CONSTANT_FOLD), (DELETE_TRIVIAL_REDUCESTO), (IDP_BOOLEAN) which results in the following new constraint:
(13)    (>(x2[2], -1)=TRUE∧>(x1[2], 1)=TRUE∧>(+(x2[2], 1), 1)=TRUE∧<=(-(x1[2], 2), 1)=TRUE ⇒ COND_1277_0_HALF_LE(TRUE, +(x2[2], 1), -(x1[2], 2))≥NonInfC∧COND_1277_0_HALF_LE(TRUE, +(x2[2], 1), -(x1[2], 2))≥1277_0_HALF_LE(0, +(x2[2], 1))∧(U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥))

We simplified constraint (13) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(14)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [-1] ≥ 0∧[3] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-2)bni_19 + (-1)Bound*bni_19] + [bni_19]x1[2] + [bni_19]x2[2] ≥ 0∧[-2 + (-1)bso_20] + x1[2] ≥ 0)

We simplified constraint (14) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(15)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [-1] ≥ 0∧[3] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-2)bni_19 + (-1)Bound*bni_19] + [bni_19]x1[2] + [bni_19]x2[2] ≥ 0∧[-2 + (-1)bso_20] + x1[2] ≥ 0)

We simplified constraint (15) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(16)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [-1] ≥ 0∧[3] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-2)bni_19 + (-1)Bound*bni_19] + [bni_19]x1[2] + [bni_19]x2[2] ≥ 0∧[-2 + (-1)bso_20] + x1[2] ≥ 0)

We simplified constraint (16) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(17)    ([1] + x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] ≥ 0∧[3] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-1)bni_19 + (-1)Bound*bni_19] + [bni_19]x1[2] + [bni_19]x2[2] ≥ 0∧[-2 + (-1)bso_20] + x1[2] ≥ 0)

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

For Pair 1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE1(&&(>(x2, -1), >(x1, 1)), x2, x1) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)) which results in the following constraint:
(19)    (&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3] ⇒ 1277_0_HALF_LE(x2[2], x1[2])≥NonInfC∧1277_0_HALF_LE(x2[2], x1[2])≥COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])∧(U^Increasing(COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])), ≥))

We simplified constraint (19) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(20)    (>(x2[2], -1)=TRUE∧>(x1[2], 1)=TRUE ⇒ 1277_0_HALF_LE(x2[2], x1[2])≥NonInfC∧1277_0_HALF_LE(x2[2], x1[2])≥COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])∧(U^Increasing(COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])), ≥))

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

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

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

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

For Pair COND_1277_0_HALF_LE1(TRUE, x2, x1) → 1277_0_HALF_LE(+(x2, 1), -(x1, 2)) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(25) (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[2]∧x2[1]=x1[2]∧&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[0]1∧-(x1[3], 2)=x1[0]1∧&&(>(x2[0]1, 1), <=(x1[0]1, 1))=TRUE∧x2[0]1=x2[1]1∧x1[0]1=x1[1]1 ⇒ COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3])≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3])≥1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥))

We solved constraint (25) using rules (I), (II), (III), (IV), (IDP_CONSTANT_FOLD), (DELETE_TRIVIAL_REDUCESTO), (IDP_BOOLEAN).
We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)) which results in the following constraint:
(26)    (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[2]∧x2[1]=x1[2]∧&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[2]1∧-(x1[3], 2)=x1[2]1∧&&(>(x2[2]1, -1), >(x1[2]1, 1))=TRUE∧x2[2]1=x2[3]1∧x1[2]1=x1[3]1 ⇒ COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3])≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3])≥1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥))

We simplified constraint (26) using rules (III), (IV), (IDP_CONSTANT_FOLD), (DELETE_TRIVIAL_REDUCESTO), (IDP_BOOLEAN) which results in the following new constraint:
(27)    (>(x2[0], 1)=TRUE∧<=(x1[0], 1)=TRUE∧>(-(x2[0], 2), 1)=TRUE ⇒ COND_1277_0_HALF_LE1(TRUE, 0, x2[0])≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, 0, x2[0])≥1277_0_HALF_LE(+(0, 1), -(x2[0], 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥))

We simplified constraint (27) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(28)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x2[0] + [-4] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (28) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(29)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x2[0] + [-4] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (29) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(30)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x2[0] + [-4] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(-1)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (30) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(31)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧[-2] + x2[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (31) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(32)    ([2] + x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(3)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (32) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(33)    ([2] + x2[0] ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(3)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)
We consider the chain 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(34)    (&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[2]1∧-(x1[3], 2)=x1[2]1∧&&(>(x2[2]1, -1), >(x1[2]1, 1))=TRUE∧x2[2]1=x2[3]1∧x1[2]1=x1[3]1∧+(x2[3]1, 1)=x2[0]∧-(x1[3]1, 2)=x1[0]∧&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1] ⇒ COND_1277_0_HALF_LE1(TRUE, x2[3]1, x1[3]1)≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, x2[3]1, x1[3]1)≥1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥))

We simplified constraint (34) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(35)    (>(x2[2], -1)=TRUE∧>(x1[2], 1)=TRUE∧>(+(x2[2], 1), -1)=TRUE∧>(-(x1[2], 2), 1)=TRUE∧>(+(+(x2[2], 1), 1), 1)=TRUE∧<=(-(-(x1[2], 2), 2), 1)=TRUE ⇒ COND_1277_0_HALF_LE1(TRUE, +(x2[2], 1), -(x1[2], 2))≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, +(x2[2], 1), -(x1[2], 2))≥1277_0_HALF_LE(+(+(x2[2], 1), 1), -(-(x1[2], 2), 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥))

We simplified constraint (35) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(36)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] ≥ 0∧[5] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (36) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(37)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] ≥ 0∧[5] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (37) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(38)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] ≥ 0∧[5] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

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

We simplified constraint (39) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(40)    (x2[2] ≥ 0∧[2] + x1[2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)
We consider the chain 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)), 1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2]), COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2)) which results in the following constraint:
(41)    (&&(>(x2[2], -1), >(x1[2], 1))=TRUE∧x2[2]=x2[3]∧x1[2]=x1[3]∧+(x2[3], 1)=x2[2]1∧-(x1[3], 2)=x1[2]1∧&&(>(x2[2]1, -1), >(x1[2]1, 1))=TRUE∧x2[2]1=x2[3]1∧x1[2]1=x1[3]1∧+(x2[3]1, 1)=x2[2]2∧-(x1[3]1, 2)=x1[2]2∧&&(>(x2[2]2, -1), >(x1[2]2, 1))=TRUE∧x2[2]2=x2[3]2∧x1[2]2=x1[3]2 ⇒ COND_1277_0_HALF_LE1(TRUE, x2[3]1, x1[3]1)≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, x2[3]1, x1[3]1)≥1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥))

We simplified constraint (41) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(42)    (>(x2[2], -1)=TRUE∧>(x1[2], 1)=TRUE∧>(+(x2[2], 1), -1)=TRUE∧>(-(x1[2], 2), 1)=TRUE∧>(+(+(x2[2], 1), 1), -1)=TRUE∧>(-(-(x1[2], 2), 2), 1)=TRUE ⇒ COND_1277_0_HALF_LE1(TRUE, +(x2[2], 1), -(x1[2], 2))≥NonInfC∧COND_1277_0_HALF_LE1(TRUE, +(x2[2], 1), -(x1[2], 2))≥1277_0_HALF_LE(+(+(x2[2], 1), 1), -(-(x1[2], 2), 2))∧(U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥))

We simplified constraint (42) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(43)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] + [2] ≥ 0∧x1[2] + [-6] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (43) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(44)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] + [2] ≥ 0∧x1[2] + [-6] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

We simplified constraint (44) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(45)    (x2[2] ≥ 0∧x1[2] + [-2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] + [-4] ≥ 0∧x2[2] + [2] ≥ 0∧x1[2] + [-6] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(-2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

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

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

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

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

1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE(&&(>(x2, 1), <=(x1, 1)), x2, x1)
- (x2[0] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [(-1)bni_17]x1[0] + [bni_17]x2[0] ≥ 0∧[(-1)bso_18] ≥ 0)
- (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_17 + (-1)Bound*bni_17] + [bni_17]x1[0] + [bni_17]x2[0] ≥ 0∧[(-1)bso_18] ≥ 0)
COND_1277_0_HALF_LE(TRUE, x2, x1) → 1277_0_HALF_LE(0, x2)
- ([1] + x2[2] ≥ 0∧x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-1)Bound*bni_19 + bni_19] + [bni_19]x1[2] + [bni_19]x2[2] ≥ 0∧[(-1)bso_20] + x1[2] ≥ 0)
1277_0_HALF_LE(x2, x1) → COND_1277_0_HALF_LE1(&&(>(x2, -1), >(x1, 1)), x2, x1)
- (x2[2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])), ≥)∧[bni_21 + (-1)Bound*bni_21] + [bni_21]x1[2] + [bni_21]x2[2] ≥ 0∧[(-1)bso_22] ≥ 0)
COND_1277_0_HALF_LE1(TRUE, x2, x1) → 1277_0_HALF_LE(+(x2, 1), -(x1, 2))
- ([2] + x2[0] ≥ 0∧x2[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))), ≥)∧[(3)bni_23 + (-1)Bound*bni_23] + [bni_23]x2[0] ≥ 0∧[1 + (-1)bso_24] ≥ 0)
- (x2[2] ≥ 0∧[2] + x1[2] ≥ 0∧x2[2] + [1] ≥ 0∧x1[2] ≥ 0∧x2[2] ≥ 0∧[1] + [-1]x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(2)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)
- (x2[2] ≥ 0∧[4] + x1[2] ≥ 0∧x2[2] + [1] ≥ 0∧[2] + x1[2] ≥ 0∧x2[2] + [2] ≥ 0∧x1[2] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(+(x2[3]1, 1), -(x1[3]1, 2))), ≥)∧[(4)bni_23 + (-1)Bound*bni_23] + [bni_23]x1[2] + [bni_23]x2[2] ≥ 0∧[1 + (-1)bso_24] ≥ 0)

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

POL(TRUE) = 0
POL(FALSE) = [2]
POL(1277_0_HALF_LE(x₁, x₂)) = [-1] + x₂ + x₁
POL(COND_1277_0_HALF_LE(x₁, x₂, x₃)) = [-1] + x₃ + x₂
POL(&&(x₁, x₂)) = [-1]
POL(>(x₁, x₂)) = [-1]
POL(1) = [1]
POL(<=(x₁, x₂)) = [-1]
POL(0) = 0
POL(COND_1277_0_HALF_LE1(x₁, x₂, x₃)) = [-1] + x₃ + x₂
POL(-1) = [-1]
POL(+(x₁, x₂)) = x₁ + x₂
POL(-(x₁, x₂)) = x₁ + [-1]x₂
POL(2) = [2]

The following pairs are in P_>:

COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))

The following pairs are in P_bound:

COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])
1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])
COND_1277_0_HALF_LE1(TRUE, x2[3], x1[3]) → 1277_0_HALF_LE(+(x2[3], 1), -(x1[3], 2))

The following pairs are in P_≥:

1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])
COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])
1277_0_HALF_LE(x2[2], x1[2]) → COND_1277_0_HALF_LE1(&&(>(x2[2], -1), >(x1[2], 1)), x2[2], x1[2])

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

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

(8) Obligation:

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

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

The following domains are used:

Boolean, Integer

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

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

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

The set Q is empty.

(9) IDependencyGraphProof (EQUIVALENT transformation)

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

(10) Obligation:

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

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

The following domains are used:

Boolean, Integer

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])
(0): 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(x2[0] > 1 && x1[0] <= 1, x2[0], x1[0])

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

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

The set Q is empty.

(11) IDPNonInfProof (SOUND transformation)

Used the following options for this NonInfProof:
IDPGPoloSolver: Range: [(-1,2)] IsNat: false Interpretation Shape Heuristic: aprove.DPFramework.IDPProblem.Processors.nonInf.poly.IdpDefaultShapeHeuristic@635321ab 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_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]), 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]) which results in the following constraint:
(1)    (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1]∧0=x2[0]1∧x2[1]=x1[0]1 ⇒ COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[1], x1[1])≥1277_0_HALF_LE(0, x2[1])∧(U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥))

We simplified constraint (1) using rules (III), (IV), (IDP_BOOLEAN) which results in the following new constraint:
(2)    (>(x2[0], 1)=TRUE∧<=(x1[0], 1)=TRUE ⇒ COND_1277_0_HALF_LE(TRUE, x2[0], x1[0])≥NonInfC∧COND_1277_0_HALF_LE(TRUE, x2[0], x1[0])≥1277_0_HALF_LE(0, x2[0])∧(U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥))

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

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

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

We simplified constraint (5) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(6)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-3)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x2[0] ≥ 0∧[(-1)bso_14] ≥ 0)

We simplified constraint (6) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(7)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-3)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x2[0] ≥ 0∧[(-1)bso_14] ≥ 0)

(8)    (x2[0] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-3)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x2[0] ≥ 0∧[(-1)bso_14] ≥ 0)

For Pair 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]) the following chains were created:

We consider the chain 1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0]), COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1]) which results in the following constraint:
(9)    (&&(>(x2[0], 1), <=(x1[0], 1))=TRUE∧x2[0]=x2[1]∧x1[0]=x1[1] ⇒ 1277_0_HALF_LE(x2[0], x1[0])≥NonInfC∧1277_0_HALF_LE(x2[0], x1[0])≥COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])∧(U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥))

We simplified constraint (9) using rules (IV), (IDP_BOOLEAN) which results in the following new constraint:
(10)    (>(x2[0], 1)=TRUE∧<=(x1[0], 1)=TRUE ⇒ 1277_0_HALF_LE(x2[0], x1[0])≥NonInfC∧1277_0_HALF_LE(x2[0], x1[0])≥COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])∧(U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥))

We simplified constraint (10) using rule (POLY_CONSTRAINTS) which results in the following new constraint:
(11)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[(-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

We simplified constraint (11) using rule (IDP_POLY_SIMPLIFY) which results in the following new constraint:
(12)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[(-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

We simplified constraint (12) using rule (POLY_REMOVE_MIN_MAX) which results in the following new constraint:
(13)    (x2[0] + [-2] ≥ 0∧[1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[(-1)bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[(-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

We simplified constraint (13) using rule (IDP_SMT_SPLIT) which results in the following new constraint:
(14)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[4 + (-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

We simplified constraint (14) using rule (IDP_SMT_SPLIT) which results in the following new constraints:
(15)    (x2[0] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_15 + (-1)Bound*bni_15] + [bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[4 + (-1)bso_16] + x1[0] + [2]x2[0] ≥ 0)

(16)    (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[4 + (-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

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

COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])
- (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-3)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x2[0] ≥ 0∧[(-1)bso_14] ≥ 0)
- (x2[0] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(1277_0_HALF_LE(0, x2[1])), ≥)∧[(-3)bni_13 + (-1)Bound*bni_13] + [(-1)bni_13]x2[0] ≥ 0∧[(-1)bso_14] ≥ 0)
1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])
- (x2[0] ≥ 0∧[1] + x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_15 + (-1)Bound*bni_15] + [bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[4 + (-1)bso_16] + x1[0] + [2]x2[0] ≥ 0)
- (x2[0] ≥ 0∧[1] + [-1]x1[0] ≥ 0∧x1[0] ≥ 0 ⇒ (U^Increasing(COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])), ≥)∧[bni_15 + (-1)Bound*bni_15] + [(-1)bni_15]x1[0] + [bni_15]x2[0] ≥ 0∧[4 + (-1)bso_16] + [-1]x1[0] + [2]x2[0] ≥ 0)

POL(TRUE) = 0
POL(FALSE) = 0
POL(COND_1277_0_HALF_LE(x₁, x₂, x₃)) = [-1] + [-1]x₂ + [-1]x₁
POL(1277_0_HALF_LE(x₁, x₂)) = [-1] + [-1]x₂ + x₁
POL(0) = 0
POL(&&(x₁, x₂)) = 0
POL(>(x₁, x₂)) = [-1]
POL(1) = [1]
POL(<=(x₁, x₂)) = [-1]

The following pairs are in P_>:

1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])

The following pairs are in P_bound:

1277_0_HALF_LE(x2[0], x1[0]) → COND_1277_0_HALF_LE(&&(>(x2[0], 1), <=(x1[0], 1)), x2[0], x1[0])

The following pairs are in P_≥:

COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[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¹

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

R is empty.

The integer pair graph contains the following rules and edges:
(1): COND_1277_0_HALF_LE(TRUE, x2[1], x1[1]) → 1277_0_HALF_LE(0, x2[1])

The set Q is empty.

(13) IDependencyGraphProof (EQUIVALENT transformation)

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

(0) Obligation:

(1) JBCToGraph (SOUND transformation)

(2) Obligation:

(3) TerminationGraphToSCCProof (SOUND transformation)

(4) Obligation:

(5) SCCToIDPv1Proof (SOUND transformation)

(6) Obligation:

(7) IDPNonInfProof (SOUND transformation)

(8) Obligation:

(9) IDependencyGraphProof (EQUIVALENT transformation)

(10) Obligation:

(11) IDPNonInfProof (SOUND transformation)

(12) Obligation:

(13) IDependencyGraphProof (EQUIVALENT transformation)

(14) TRUE