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


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


YES
proof of /export/starexec/sandbox2/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, 56 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IntTRS
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IntTRS
(9) PolynomialOrderProcessor [EQUIVALENT, 3 ms]
(10) YES


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

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

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

(2)
Obligation:
Rules:
f1(c, x, y) -> f2(c, x_1, y) :|: TRUE
f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE
f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE
f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 - 1
f6(x26, x27, x28) -> f7(x26, x27, x29) :|: TRUE && x29 = x28 - 1
f7(x30, x31, x32) -> f8(x33, x31, x32) :|: TRUE && x33 = x30 + 1
f4(x17, x18, x19) -> f5(x17, x18, x19) :|: x18 > 0 && x19 > 0
f8(x20, x21, x22) -> f4(x20, x21, x22) :|: TRUE
f4(x23, x24, x25) -> f9(x23, x24, x25) :|: x24 <= 0
f4(x34, x35, x36) -> f9(x34, x35, x36) :|: x36 <= 0
Start term: f1(c, x, y)

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

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

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

(4)
Obligation:
Rules:
f4(x17, x18, x19) -> f5(x17, x18, x19) :|: x18 > 0 && x19 > 0
f8(x20, x21, x22) -> f4(x20, x21, x22) :|: TRUE
f7(x30, x31, x32) -> f8(x33, x31, x32) :|: TRUE && x33 = x30 + 1
f6(x26, x27, x28) -> f7(x26, x27, x29) :|: TRUE && x29 = x28 - 1
f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 - 1

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

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

(6)
Obligation:
Rules:
f6(x26:0, x27:0, x28:0) -> f6(x26:0 + 1, x27:0 - 1, x28:0 - 1) :|: x27:0 > 0 && x28:0 > 1

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

(7) IntTRSUnneededArgumentFilterProof (EQUIVALENT)
Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements:

   f6(x1, x2, x3) -> f6(x2, x3)

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

(8)
Obligation:
Rules:
f6(x27:0, x28:0) -> f6(x27:0 - 1, x28:0 - 1) :|: x27:0 > 0 && x28:0 > 1

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

(9) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f6(x, x1)] = x1

The following rules are decreasing:
f6(x27:0, x28:0) -> f6(x27:0 - 1, x28:0 - 1) :|: x27:0 > 0 && x28:0 > 1
The following rules are bounded:
f6(x27:0, x28:0) -> f6(x27:0 - 1, x28:0 - 1) :|: x27:0 > 0 && x28:0 > 1

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

(10)
YES