/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, 54 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 14 ms]
(6) IntTRS
(7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
(8) IntTRS
(9) RankingReductionPairProof [EQUIVALENT, 23 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(x, xtmp, res, restmp) -> f2(x_1, xtmp, res, restmp) :|: TRUE
f2(x1, x2, x3, x4) -> f3(x1, x2, 0, x4) :|: TRUE
f4(x5, x6, x7, x8) -> f5(x5, arith, x7, x8) :|: TRUE && arith = x5 - 2
f5(x9, x10, x11, x12) -> f6(x9, x10, x11, 0) :|: TRUE
f7(x53, x54, x55, x56) -> f8(x53, x57, x55, x56) :|: TRUE && x57 = x54 - 2
f8(x58, x59, x60, x61) -> f9(x58, x59, x60, x62) :|: TRUE && x62 = x61 + 1
f6(x21, x22, x23, x24) -> f7(x21, x22, x23, x24) :|: x22 > 1
f9(x25, x26, x27, x28) -> f6(x25, x26, x27, x28) :|: TRUE
f6(x29, x30, x31, x32) -> f10(x29, x30, x31, x32) :|: x30 <= 1
f10(x63, x64, x65, x66) -> f11(x67, x64, x65, x66) :|: TRUE && x67 = x64 + 1
f11(x68, x69, x70, x71) -> f12(x68, x69, x72, x71) :|: TRUE && x72 = x70 + 1
f3(x41, x42, x43, x44) -> f4(x41, x42, x43, x44) :|: x41 > 1
f12(x45, x46, x47, x48) -> f3(x45, x46, x47, x48) :|: TRUE
f3(x49, x50, x51, x52) -> f13(x49, x50, x51, x52) :|: x49 <= 1
Start term: f1(x, xtmp, res, restmp)

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

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

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

(4)
Obligation:
Rules:
f3(x41, x42, x43, x44) -> f4(x41, x42, x43, x44) :|: x41 > 1
f12(x45, x46, x47, x48) -> f3(x45, x46, x47, x48) :|: TRUE
f11(x68, x69, x70, x71) -> f12(x68, x69, x72, x71) :|: TRUE && x72 = x70 + 1
f10(x63, x64, x65, x66) -> f11(x67, x64, x65, x66) :|: TRUE && x67 = x64 + 1
f6(x29, x30, x31, x32) -> f10(x29, x30, x31, x32) :|: x30 <= 1
f5(x9, x10, x11, x12) -> f6(x9, x10, x11, 0) :|: TRUE
f4(x5, x6, x7, x8) -> f5(x5, arith, x7, x8) :|: TRUE && arith = x5 - 2
f9(x25, x26, x27, x28) -> f6(x25, x26, x27, x28) :|: TRUE
f8(x58, x59, x60, x61) -> f9(x58, x59, x60, x62) :|: TRUE && x62 = x61 + 1
f7(x53, x54, x55, x56) -> f8(x53, x57, x55, x56) :|: TRUE && x57 = x54 - 2
f6(x21, x22, x23, x24) -> f7(x21, x22, x23, x24) :|: x22 > 1

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

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

(6)
Obligation:
Rules:
f6(x29:0, x30:0, x31:0, x32:0) -> f6(x30:0 + 1, x30:0 - 1, x31:0 + 1, 0) :|: x30:0 < 2 && x30:0 > 0
f6(x21:0, x22:0, x23:0, x24:0) -> f6(x21:0, x22:0 - 2, x23:0, x24:0 + 1) :|: x22: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, x4) -> f6(x2)

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

(8)
Obligation:
Rules:
f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1

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

(9) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f6 ] = f6_1

The following rules are decreasing:
f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1

The following rules are bounded:
f6(x30:0) -> f6(x30:0 - 1) :|: x30:0 < 2 && x30:0 > 0
f6(x22:0) -> f6(x22:0 - 2) :|: x22:0 > 1


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

(10)
YES