details

property	value
status	complete
benchmark	GCD4.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n113.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.84671521187 seconds
cpu usage	7.660055114
max memory	6.544384E8

stage attributes

key	value
output-size	7349
starexec-result	YES

output

/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 72 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 5 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (10) AND (11) IntTRS (12) TerminationGraphProcessor [EQUIVALENT, 10 ms] (13) IntTRS (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IntTRS (16) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (17) YES (18) IntTRS (19) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (20) IntTRS (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (22) 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, y, tmp, xtmp) -> f2(x_1, y, tmp, xtmp) :|: TRUE f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE f4(x6, x7, x8, x9) -> f5(x6, x7, x7, x9) :|: TRUE f5(x10, x11, x12, x13) -> f6(x10, x11, x12, x10) :|: TRUE f7(x14, x15, x16, x17) -> f8(x14, x15, x16, arith) :|: TRUE && arith = x17 - x15 f6(x18, x19, x20, x21) -> f7(x18, x19, x20, x21) :|: x21 >= x19 && x19 > 0 f8(x22, x23, x24, x25) -> f6(x22, x23, x24, x25) :|: TRUE f6(x26, x27, x28, x29) -> f9(x26, x27, x28, x29) :|: x29 < x27 f6(x50, x51, x52, x53) -> f9(x50, x51, x52, x53) :|: x51 <= 0 f9(x30, x31, x32, x33) -> f10(x30, x33, x32, x33) :|: TRUE f10(x34, x35, x36, x37) -> f11(x36, x35, x36, x37) :|: TRUE f3(x38, x39, x40, x41) -> f4(x38, x39, x40, x41) :|: x39 > 0 && x38 > 0 f11(x42, x43, x44, x45) -> f3(x42, x43, x44, x45) :|: TRUE f3(x46, x47, x48, x49) -> f12(x46, x47, x48, x49) :|: x47 <= 0 f3(x54, x55, x56, x57) -> f12(x54, x55, x56, x57) :|: x54 <= 0 Start term: f1(x, y, tmp, xtmp) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x38, x39, x40, x41) -> f4(x38, x39, x40, x41) :|: x39 > 0 && x38 > 0 f11(x42, x43, x44, x45) -> f3(x42, x43, x44, x45) :|: TRUE f10(x34, x35, x36, x37) -> f11(x36, x35, x36, x37) :|: TRUE f9(x30, x31, x32, x33) -> f10(x30, x33, x32, x33) :|: TRUE f6(x26, x27, x28, x29) -> f9(x26, x27, x28, x29) :|: x29 < x27 f5(x10, x11, x12, x13) -> f6(x10, x11, x12, x10) :|: TRUE f4(x6, x7, x8, x9) -> f5(x6, x7, x7, x9) :|: TRUE f8(x22, x23, x24, x25) -> f6(x22, x23, x24, x25) :|: TRUE f7(x14, x15, x16, x17) -> f8(x14, x15, x16, arith) :|: TRUE && arith = x17 - x15 f6(x18, x19, x20, x21) -> f7(x18, x19, x20, x21) :|: x21 >= x19 && x19 > 0 f6(x50, x51, x52, x53) -> f9(x50, x51, x52, x53) :|: x51 <= 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to C Integer