details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.30951 seconds
cpu usage	6.1458
user time	5.76997
system time	0.375825
max virtual memory	3.7326356E7
max residence set size	518600.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, 67 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (10) IntTRS (11) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/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 f6(x8, x9, x10) -> f7(x8, arith, x10) :|: TRUE && arith = x9 - 1 f7(x35, x36, x37) -> f8(x35, x36, x38) :|: TRUE && x38 = x37 - 1 f8(x39, x40, x41) -> f9(x42, x40, x41) :|: TRUE && x42 = x39 + 1 f5(x17, x18, x19) -> f6(x17, x18, x19) :|: x19 > 0 f9(x20, x21, x22) -> f5(x20, x21, x22) :|: TRUE f5(x23, x24, x25) -> f10(x23, x24, x25) :|: x25 <= 0 f4(x26, x27, x28) -> f5(x26, x27, x28) :|: x27 = x28 && x27 > 0 f10(x29, x30, x31) -> f4(x29, x30, x31) :|: TRUE f4(x32, x33, x34) -> f11(x32, x33, x34) :|: x33 <= 0 f4(x43, x44, x45) -> f11(x43, x44, x45) :|: x44 < x45 f4(x46, x47, x48) -> f11(x46, x47, x48) :|: x47 > x48 Start term: f1(c, x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x26, x27, x28) -> f5(x26, x27, x28) :|: x27 = x28 && x27 > 0 f10(x29, x30, x31) -> f4(x29, x30, x31) :|: TRUE f5(x23, x24, x25) -> f10(x23, x24, x25) :|: x25 <= 0 f9(x20, x21, x22) -> f5(x20, x21, x22) :|: TRUE f8(x39, x40, x41) -> f9(x42, x40, x41) :|: TRUE && x42 = x39 + 1 f7(x35, x36, x37) -> f8(x35, x36, x38) :|: TRUE && x38 = x37 - 1 f6(x8, x9, x10) -> f7(x8, arith, x10) :|: TRUE && arith = x9 - 1 f5(x17, x18, x19) -> f6(x17, x18, x19) :|: x19 > 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x17:0, x18:0, x19:0) -> f5(x17:0 + 1, x18:0 - 1, x19:0 - 1) :|: x19:0 > 0 f5(x23:0, x24:0, x24:01) -> f5(x23:0, x24:0, x24:0) :|: x24:0 < 1 && x24:0 > 0 && x24:0 = x24:01 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2, x3) -> f5(x2, x3) ---------------------------------------- (8) Obligation: Rules: f5(x18:0, x19:0) -> f5(x18:0 - 1, x19:0 - 1) :|: x19:0 > 0 f5(x24:0, x24:01) -> f5(x24:0, x24:0) :|: x24:0 < 1 && x24:0 > 0 && x24:0 = x24:01 popout

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

job log

popout

actions

all output return to C_Integer