details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.04108 seconds
cpu usage	4.9241
user time	4.64884
system time	0.275259
max virtual memory	1.8810244E7
max residence set size	396964.0

stage attributes

key	value
starexec-result	YES

output

4.47/2.00 YES 4.47/2.01 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 4.47/2.01 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.47/2.01 4.47/2.01 4.47/2.01 Termination of the given C Problem could be proven: 4.47/2.01 4.47/2.01 (0) C Problem 4.47/2.01 (1) CToIRSProof [EQUIVALENT, 0 ms] 4.47/2.01 (2) IntTRS 4.47/2.01 (3) TerminationGraphProcessor [SOUND, 47 ms] 4.47/2.01 (4) IntTRS 4.47/2.01 (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] 4.47/2.01 (6) IntTRS 4.47/2.01 (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] 4.47/2.01 (8) IntTRS 4.47/2.01 (9) PolynomialOrderProcessor [EQUIVALENT, 11 ms] 4.47/2.01 (10) YES 4.47/2.01 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (0) 4.47/2.01 Obligation: 4.47/2.01 c file /export/starexec/sandbox/benchmark/theBenchmark.c 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (1) CToIRSProof (EQUIVALENT) 4.47/2.01 Parsed C Integer Program as IRS. 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (2) 4.47/2.01 Obligation: 4.47/2.01 Rules: 4.47/2.01 f1(c, x, y, z) -> f2(c, x_1, y, z) :|: TRUE 4.47/2.01 f2(x1, x2, x3, x4) -> f3(x1, x2, x5, x4) :|: TRUE 4.47/2.01 f3(x6, x7, x8, x9) -> f4(x6, x7, x8, x10) :|: TRUE 4.47/2.01 f4(x11, x12, x13, x14) -> f5(0, x12, x13, x14) :|: TRUE 4.47/2.01 f6(x15, x16, x17, x18) -> f7(x15, arith, x17, x18) :|: TRUE && arith = x16 - 1 4.47/2.01 f7(x39, x40, x41, x42) -> f8(x39, x40, x43, x42) :|: TRUE && x43 = x41 - 1 4.47/2.01 f8(x44, x45, x46, x47) -> f9(x48, x45, x46, x47) :|: TRUE && x48 = x44 + 1 4.47/2.01 f5(x27, x28, x29, x30) -> f6(x27, x28, x29, x30) :|: x28 > x30 && x29 > x30 4.47/2.01 f9(x31, x32, x33, x34) -> f5(x31, x32, x33, x34) :|: TRUE 4.47/2.01 f5(x35, x36, x37, x38) -> f10(x35, x36, x37, x38) :|: x36 <= x38 4.47/2.01 f5(x49, x50, x51, x52) -> f10(x49, x50, x51, x52) :|: x51 <= x52 4.47/2.01 Start term: f1(c, x, y, z) 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (3) TerminationGraphProcessor (SOUND) 4.47/2.01 Constructed the termination graph and obtained one non-trivial SCC. 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (4) 4.47/2.01 Obligation: 4.47/2.01 Rules: 4.47/2.01 f5(x27, x28, x29, x30) -> f6(x27, x28, x29, x30) :|: x28 > x30 && x29 > x30 4.47/2.01 f9(x31, x32, x33, x34) -> f5(x31, x32, x33, x34) :|: TRUE 4.47/2.01 f8(x44, x45, x46, x47) -> f9(x48, x45, x46, x47) :|: TRUE && x48 = x44 + 1 4.47/2.01 f7(x39, x40, x41, x42) -> f8(x39, x40, x43, x42) :|: TRUE && x43 = x41 - 1 4.47/2.01 f6(x15, x16, x17, x18) -> f7(x15, arith, x17, x18) :|: TRUE && arith = x16 - 1 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (5) IntTRSCompressionProof (EQUIVALENT) 4.47/2.01 Compressed rules. 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (6) 4.47/2.01 Obligation: 4.47/2.01 Rules: 4.47/2.01 f7(x39:0, x40:0, x41:0, x42:0) -> f7(x39:0 + 1, x40:0 - 1, x41:0 - 1, x42:0) :|: x42:0 < x40:0 && x42:0 < x41:0 - 1 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) 4.47/2.01 Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: 4.47/2.01 4.47/2.01 f7(x1, x2, x3, x4) -> f7(x2, x3, x4) 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (8) 4.47/2.01 Obligation: 4.47/2.01 Rules: 4.47/2.01 f7(x40:0, x41:0, x42:0) -> f7(x40:0 - 1, x41:0 - 1, x42:0) :|: x42:0 < x40:0 && x42:0 < x41:0 - 1 4.47/2.01 4.47/2.01 ---------------------------------------- 4.47/2.01 4.47/2.01 (9) PolynomialOrderProcessor (EQUIVALENT) 4.47/2.01 Found the following polynomial interpretation: 4.47/2.01 [f7(x, x1, x2)] = x1 - x2 4.47/2.01 4.47/2.01 The following rules are decreasing: 4.47/2.01 f7(x40:0, x41:0, x42:0) -> f7(x40:0 - 1, x41:0 - 1, x42:0) :|: x42:0 < x40:0 && x42:0 < x41:0 - 1 4.47/2.01 The following rules are bounded: 4.47/2.01 f7(x40:0, x41:0, x42:0) -> f7(x40:0 - 1, x41:0 - 1, x42:0) :|: x42:0 < x40:0 && x42:0 < x41:0 - 1 4.47/2.01 4.47/2.01 ---------------------------------------- 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