/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, 40 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IntTRS
(7) TerminationGraphProcessor [EQUIVALENT, 6 ms]
(8) IntTRS
(9) TerminationGraphProcessor [EQUIVALENT, 6 ms]
(10) 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) -> f2(x_1) :|: TRUE
f3(x1) -> f4(arith) :|: TRUE && arith = 0 - 2 * x1 + 10
f2(x2) -> f3(x2) :|: x2 >= 0
f4(x3) -> f2(x3) :|: TRUE
f2(x4) -> f5(x4) :|: x4 < 0
Start term: f1(x)

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

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

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

(4)
Obligation:
Rules:
f2(x2) -> f3(x2) :|: x2 >= 0
f4(x3) -> f2(x3) :|: TRUE
f3(x1) -> f4(arith) :|: TRUE && arith = 0 - 2 * x1 + 10

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

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

(6)
Obligation:
Rules:
f4(x3:0) -> f4(0 - 2 * x3:0 + 10) :|: x3:0 > -1

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

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

f4(x3:0) -> f4(0 - 2 * x3:0 + 10) :|: x3:0 > -1
has been transformed into
f4(x3:0) -> f4(0 - 2 * x3:0 + 10) :|: x3:0 = 0 - 2 * x2 + 10 && x3:0 > -1 && x2 > -1.


f4(x3:0) -> f4(0 - 2 * x3:0 + 10) :|: x3:0 = 0 - 2 * x2 + 10 && x3:0 > -1 && x2 > -1 and 
f4(x3:0) -> f4(0 - 2 * x3:0 + 10) :|: x3:0 = 0 - 2 * x2 + 10 && x3:0 > -1 && x2 > -1
have been merged into the new rule
f4(x7) -> f4(0 - 2 * (0 - 2 * x7 + 10) + 10) :|: x7 = 0 - 2 * x8 + 10 && x7 > -1 && x8 > -1 && (0 - 2 * x7 + 10 = 0 - 2 * x9 + 10 && 0 - 2 * x7 + 10 > -1 && x9 > -1)


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

(8)
Obligation:
Rules:
f4(x10) -> f4(4 * x10 + -10) :|: TRUE && x10 + 2 * x11 = 10 && x10 >= 0 && x11 >= 0 && -1 * x10 + x12 = 0 && -1 * x10 >= -5 && x12 >= 0

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

(9) TerminationGraphProcessor (EQUIVALENT)
Constructed the termination graph and obtained no non-trivial SCC(s).

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

(10)
YES