details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.9654 seconds
cpu usage	4.98129
user time	4.69589
system time	0.2854
max virtual memory	1.8975184E7
max residence set size	401336.0

stage attributes

key	value
starexec-result	YES

output

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, 44 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 30 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 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, i, n) -> f2(x_1, i, n) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 f6(x24, x25, x26) -> f7(x27, x25, x26) :|: TRUE && x27 = x24 + 1 f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 < x17 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 >= x23 Start term: f1(x, i, n) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 < x17 f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE f6(x24, x25, x26) -> f7(x27, x25, x26) :|: TRUE && x27 = x24 + 1 f5(x9, x10, x11) -> f6(x9, arith, x11) :|: TRUE && arith = x10 + 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x24:0, x25:0, x26:0) -> f6(x24:0 + 1, x25:0 + 1, x26:0) :|: x26:0 > x24: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(x1, x3) ---------------------------------------- (8) Obligation: Rules: f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f6(x, x1)] = -x + x1 The following rules are decreasing: f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 The following rules are bounded: f6(x24:0, x26:0) -> f6(x24:0 + 1, x26:0) :|: x26:0 > x24:0 + 1 ---------------------------------------- (10) YES popout

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

job log

popout

actions

all output return to C_Integer