details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.20903 seconds
cpu usage	5.95083
user time	5.63493
system time	0.315902
max virtual memory	1.920828E7
max residence set size	474352.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, 43 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 31 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (8) IntTRS (9) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f6(x9, x10, x11) -> f7(x9, arith, x11) :|: TRUE && arith = x10 - 1 f5(x12, x13, x14) -> f6(x12, x13, x14) :|: x13 > x14 f7(x15, x16, x17) -> f5(x15, x16, x17) :|: TRUE f5(x18, x19, x20) -> f8(x18, x19, x20) :|: x19 <= x20 f8(x33, x34, x35) -> f9(x36, x34, x35) :|: TRUE && x36 = x33 - 1 f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 > x26 f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE f4(x30, x31, x32) -> f10(x30, x31, x32) :|: x30 <= x32 Start term: f1(x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x24, x25, x26) -> f5(x24, x25, x26) :|: x24 > x26 f9(x27, x28, x29) -> f4(x27, x28, x29) :|: TRUE f8(x33, x34, x35) -> f9(x36, x34, x35) :|: TRUE && x36 = x33 - 1 f5(x18, x19, x20) -> f8(x18, x19, x20) :|: x19 <= x20 f7(x15, x16, x17) -> f5(x15, x16, x17) :|: TRUE f6(x9, x10, x11) -> f7(x9, arith, x11) :|: TRUE && arith = x10 - 1 f5(x12, x13, x14) -> f6(x12, x13, x14) :|: x13 > x14 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x12:0, x13:0, x14:0) -> f5(x12:0, x13:0 - 1, x14:0) :|: x14:0 < x13:0 f5(x18:0, x19:0, x20:0) -> f5(x18:0 - 1, x19:0, x20:0) :|: x20:0 >= x19:0 && x20:0 < x18:0 - 1 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x, x1, x2)] = -2 + x - x2 The following rules are decreasing: f5(x18:0, x19:0, x20:0) -> f5(x18:0 - 1, x19:0, x20:0) :|: x20:0 >= x19:0 && x20:0 < x18:0 - 1 The following rules are bounded: f5(x18:0, x19:0, x20:0) -> f5(x18:0 - 1, x19:0, x20:0) :|: x20:0 >= x19:0 && x20:0 < x18:0 - 1 ---------------------------------------- (8) Obligation: Rules: f5(x12:0, x13:0, x14:0) -> f5(x12:0, x13:0 - 1, x14:0) :|: x14:0 < x13:0 ---------------------------------------- (9) IntTRSUnneededArgumentFilterProof (EQUIVALENT) popout

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

job log

popout

actions

all output return to C_Integer