details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.92871 seconds
cpu usage	4.88193
user time	4.62976
system time	0.252171
max virtual memory	1.897512E7
max residence set size	380328.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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, 27 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 10 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 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(i, n) -> f2(i, x_1) :|: TRUE f2(x, x1) -> f3(arith, x1) :|: TRUE && arith = x1 - 1 f4(x10, x11) -> f5(x12, x11) :|: TRUE && x12 = x10 - 1 f3(x4, x5) -> f4(x4, x5) :|: x4 > 1 f5(x6, x7) -> f3(x6, x7) :|: TRUE f3(x8, x9) -> f6(x8, x9) :|: x8 <= 1 Start term: f1(i, n) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x4, x5) -> f4(x4, x5) :|: x4 > 1 f5(x6, x7) -> f3(x6, x7) :|: TRUE f4(x10, x11) -> f5(x12, x11) :|: TRUE && x12 = x10 - 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x6:0, x7:0) -> f5(x6:0 - 1, x7:0) :|: x6:0 > 1 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2) -> f5(x1) ---------------------------------------- (8) Obligation: Rules: f5(x6:0) -> f5(x6:0 - 1) :|: x6:0 > 1 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x)] = x The following rules are decreasing: f5(x6:0) -> f5(x6:0 - 1) :|: x6:0 > 1 The following rules are bounded: f5(x6:0) -> f5(x6:0 - 1) :|: x6:0 > 1 ---------------------------------------- (10) YES popout

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

job log

popout

actions

all output return to C_Integer