details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.16997 seconds
cpu usage	8.68419
user time	8.32
system time	0.364194
max virtual memory	1.9073452E7
max residence set size	686620.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, 50 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 6 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(c, x, y) -> f2(c, x_1, y) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 + 1 f6(x26, x27, x28) -> f7(x26, x27, x29) :|: TRUE && x29 = x28 + 2 f7(x30, x31, x32) -> f8(x33, x31, x32) :|: TRUE && x33 = x30 + 1 f4(x17, x18, x19) -> f5(x17, x18, x19) :|: x18 > x19 f8(x20, x21, x22) -> f4(x20, x21, x22) :|: TRUE f4(x23, x24, x25) -> f9(x23, x24, x25) :|: x24 <= x25 Start term: f1(c, x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x17, x18, x19) -> f5(x17, x18, x19) :|: x18 > x19 f8(x20, x21, x22) -> f4(x20, x21, x22) :|: TRUE f7(x30, x31, x32) -> f8(x33, x31, x32) :|: TRUE && x33 = x30 + 1 f6(x26, x27, x28) -> f7(x26, x27, x29) :|: TRUE && x29 = x28 + 2 f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 + 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x26:0, x27:0, x28:0) -> f6(x26:0 + 1, x27:0 + 1, x28:0 + 2) :|: x28:0 + 2 < x27:0 ---------------------------------------- (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(x2, x3) ---------------------------------------- (8) Obligation: Rules: f6(x27:0, x28:0) -> f6(x27:0 + 1, x28:0 + 2) :|: x28:0 + 2 < x27:0 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f6(x, x1)] = x - x1 The following rules are decreasing: f6(x27:0, x28:0) -> f6(x27:0 + 1, x28:0 + 2) :|: x28:0 + 2 < x27:0 The following rules are bounded: f6(x27:0, x28:0) -> f6(x27:0 + 1, x28:0 + 2) :|: x28:0 + 2 < x27:0 ---------------------------------------- (10) popout

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

job log

popout

actions

all output return to C_Integer