details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.97665095329 seconds
cpu usage	4.765985593
max memory	2.62516736E8

stage attributes

key	value
output-size	2341
starexec-result	YES

output

/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, 41 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 2 ms] (8) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, j) -> f2(i, 1) :|: TRUE f2(x, x1) -> f3(10000, x1) :|: TRUE f4(x2, x3) -> f5(x2, arith) :|: TRUE && arith = x3 + 1 f5(x12, x13) -> f6(x14, x13) :|: TRUE && x14 = x12 - 1 f3(x6, x7) -> f4(x6, x7) :|: x6 - x7 >= 1 f6(x8, x9) -> f3(x8, x9) :|: TRUE f3(x10, x11) -> f7(x10, x11) :|: x10 - x11 < 1 Start term: f1(i, j) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x6, x7) -> f4(x6, x7) :|: x6 - x7 >= 1 f6(x8, x9) -> f3(x8, x9) :|: TRUE f5(x12, x13) -> f6(x14, x13) :|: TRUE && x14 = x12 - 1 f4(x2, x3) -> f5(x2, arith) :|: TRUE && arith = x3 + 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 + 1) :|: x12:0 - 1 - x13:0 >= 1 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x, x1)] = -1 + x - x1 The following rules are decreasing: f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 + 1) :|: x12:0 - 1 - x13:0 >= 1 The following rules are bounded: f5(x12:0, x13:0) -> f5(x12:0 - 1, x13:0 + 1) :|: x12:0 - 1 - x13:0 >= 1 ---------------------------------------- (8) YES popout

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

job log

popout

actions

all output return to C Integ Progr 58257