details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.92885 seconds
cpu usage	4.48271
user time	4.25002
system time	0.232686
max virtual memory	1.9042516E7
max residence set size	365836.0

stage attributes

key	value
starexec-result	YES

output

4.29/1.89 YES 4.29/1.90 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 4.29/1.90 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.29/1.90 4.29/1.90 4.29/1.90 Termination of the given C Problem could be proven: 4.29/1.90 4.29/1.90 (0) C Problem 4.29/1.90 (1) CToIRSProof [EQUIVALENT, 0 ms] 4.29/1.90 (2) IntTRS 4.29/1.90 (3) TerminationGraphProcessor [SOUND, 30 ms] 4.29/1.90 (4) IntTRS 4.29/1.90 (5) IntTRSCompressionProof [EQUIVALENT, 14 ms] 4.29/1.90 (6) IntTRS 4.29/1.90 (7) PolynomialOrderProcessor [EQUIVALENT, 1 ms] 4.29/1.90 (8) YES 4.29/1.90 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (0) 4.29/1.90 Obligation: 4.29/1.90 c file /export/starexec/sandbox/benchmark/theBenchmark.c 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (1) CToIRSProof (EQUIVALENT) 4.29/1.90 Parsed C Integer Program as IRS. 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (2) 4.29/1.90 Obligation: 4.29/1.90 Rules: 4.29/1.90 f1(i) -> f2(x_1) :|: TRUE 4.29/1.90 f3(x) -> f4(arith) :|: TRUE && arith = x + 1 4.29/1.90 f2(x1) -> f3(x1) :|: x1 <= 2147483647 4.29/1.90 f4(x2) -> f2(x2) :|: TRUE 4.29/1.90 f2(x3) -> f5(x3) :|: x3 > 2147483647 4.29/1.90 Start term: f1(i) 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (3) TerminationGraphProcessor (SOUND) 4.29/1.90 Constructed the termination graph and obtained one non-trivial SCC. 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (4) 4.29/1.90 Obligation: 4.29/1.90 Rules: 4.29/1.90 f2(x1) -> f3(x1) :|: x1 <= 2147483647 4.29/1.90 f4(x2) -> f2(x2) :|: TRUE 4.29/1.90 f3(x) -> f4(arith) :|: TRUE && arith = x + 1 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (5) IntTRSCompressionProof (EQUIVALENT) 4.29/1.90 Compressed rules. 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (6) 4.29/1.90 Obligation: 4.29/1.90 Rules: 4.29/1.90 f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (7) PolynomialOrderProcessor (EQUIVALENT) 4.29/1.90 Found the following polynomial interpretation: 4.29/1.90 [f4(x)] = 2147483647 - x 4.29/1.90 4.29/1.90 The following rules are decreasing: 4.29/1.90 f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 4.29/1.90 The following rules are bounded: 4.29/1.90 f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 4.29/1.90 4.29/1.90 ---------------------------------------- 4.29/1.90 4.29/1.90 (8) 4.29/1.90 YES 4.29/1.92 EOF popout

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

job log

popout

actions

all output return to C_Integer 2019-03-28 22.15