/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.c
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Termination of the given C Problem could be proven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) TerminationGraphProcessor [SOUND, 45 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IntTRS
(7) TerminationGraphProcessor [EQUIVALENT, 0 ms]
(8) IntTRS
(9) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(10) IntTRS
(11) PolynomialOrderProcessor [EQUIVALENT, 5 ms]
(12) YES


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToIRSProof (EQUIVALENT)
Parsed C Integer Program as IRS.
----------------------------------------

(2)
Obligation:
Rules:
f1(x, y) -> f2(x_1, y) :|: TRUE
f2(x1, x2) -> f3(x1, 23) :|: TRUE
f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - x4
f5(x13, x14) -> f6(x13, x15) :|: TRUE && x15 = x14 + 1
f3(x7, x8) -> f4(x7, x8) :|: x7 >= 0
f6(x9, x10) -> f3(x9, x10) :|: TRUE
f3(x11, x12) -> f7(x11, x12) :|: x11 < 0
Start term: f1(x, y)

----------------------------------------

(3) TerminationGraphProcessor (SOUND)
Constructed the termination graph and obtained one non-trivial SCC.

----------------------------------------

(4)
Obligation:
Rules:
f3(x7, x8) -> f4(x7, x8) :|: x7 >= 0
f6(x9, x10) -> f3(x9, x10) :|: TRUE
f5(x13, x14) -> f6(x13, x15) :|: TRUE && x15 = x14 + 1
f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 - x4

----------------------------------------

(5) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(6)
Obligation:
Rules:
f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1

----------------------------------------

(7) TerminationGraphProcessor (EQUIVALENT)
Constructed the termination graph and obtained one non-trivial SCC.

f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1
has been transformed into
f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1.


f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1 and 
f5(x13:0, x14:0) -> f5(x13:0 - (x14:0 + 1), x14:0 + 1) :|: x13:0 > -1 && x4 > -1
have been merged into the new rule
f5(x12, x13) -> f5(x12 - (x13 + 1) - (x13 + 1 + 1), x13 + 1 + 1) :|: x12 > -1 && x14 > -1 && (x12 - (x13 + 1) > -1 && x15 > -1)


----------------------------------------

(8)
Obligation:
Rules:
f5(x16, x17) -> f5(x16 + -2 * x17 + -3, x17 + 2) :|: TRUE && x16 >= 0 && x18 >= 0 && x16 + -1 * x17 >= 1 && x19 >= 0

----------------------------------------

(9) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(10)
Obligation:
Rules:
f5(x16:0, x17:0) -> f5(x16:0 + -2 * x17:0 - 3, x17:0 + 2) :|: x16:0 + -1 * x17:0 >= 1 && x19:0 > -1 && x16:0 > -1 && x18:0 > -1

----------------------------------------

(11) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f5(x, x1)] = -1 + 2*x + x1^2

The following rules are decreasing:
f5(x16:0, x17:0) -> f5(x16:0 + -2 * x17:0 - 3, x17:0 + 2) :|: x16:0 + -1 * x17:0 >= 1 && x19:0 > -1 && x16:0 > -1 && x18:0 > -1
The following rules are bounded:
f5(x16:0, x17:0) -> f5(x16:0 + -2 * x17:0 - 3, x17:0 + 2) :|: x16:0 + -1 * x17:0 >= 1 && x19:0 > -1 && x16:0 > -1 && x18:0 > -1

----------------------------------------

(12)
YES