details

property	value
status	complete
benchmark	LeikeHeizmann-TACAS2014-Ex9_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n145.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.08224 seconds
cpu usage	9.17874
user time	8.65035
system time	0.528385
max virtual memory	3.8170408E7
max residence set size	880012.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, 88 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 19 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 14 ms] (11) IntTRS (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] (13) IntTRS (14) RankingReductionPairProof [EQUIVALENT, 0 ms] (15) YES (16) IntTRS (17) TerminationGraphProcessor [EQUIVALENT, 12 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (22) IntTRS (23) IntTRSCompressionProof [EQUIVALENT, 0 ms] (24) IntTRS (25) RankingReductionPairProof [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(p, q) -> f2(p, x_1) :|: TRUE f2(x, x1) -> f3(x2, x1) :|: TRUE f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 1 f9(x29, x30) -> f12(x31, x30) :|: TRUE && x31 = x29 - 1 f6(x7, x8) -> f9(x7, x8) :|: x7 < x8 f6(x9, x10) -> f10(x9, x10) :|: x9 >= x10 f12(x11, x12) -> f11(x11, x12) :|: TRUE f10(x13, x14) -> f11(x13, x14) :|: TRUE f4(x15, x16) -> f5(x15, x16) :|: x16 < x15 f4(x17, x18) -> f6(x17, x18) :|: x18 >= x17 f8(x19, x20) -> f7(x19, x20) :|: TRUE f11(x21, x22) -> f7(x21, x22) :|: TRUE f3(x23, x24) -> f4(x23, x24) :|: x24 > 0 && x23 > 0 && x23 < x24 f3(x32, x33) -> f4(x32, x33) :|: x33 > 0 && x32 > 0 && x32 > x33 f7(x25, x26) -> f3(x25, x26) :|: TRUE f3(x27, x28) -> f13(x27, x28) :|: x27 = x28 f3(x34, x35) -> f13(x34, x35) :|: x35 <= 0 f3(x36, x37) -> f13(x36, x37) :|: x36 <= 0 Start term: f1(p, q) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x23, x24) -> f4(x23, x24) :|: x24 > 0 && x23 > 0 && x23 < x24 f7(x25, x26) -> f3(x25, x26) :|: TRUE f8(x19, x20) -> f7(x19, x20) :|: TRUE f5(x3, x4) -> f8(x3, arith) :|: TRUE && arith = x4 - 1 f4(x15, x16) -> f5(x15, x16) :|: x16 < x15 f3(x32, x33) -> f4(x32, x33) :|: x33 > 0 && x32 > 0 && x32 > x33 f11(x21, x22) -> f7(x21, x22) :|: TRUE f12(x11, x12) -> f11(x11, x12) :|: TRUE f9(x29, x30) -> f12(x31, x30) :|: TRUE && x31 = x29 - 1 f6(x7, x8) -> f9(x7, x8) :|: x7 < x8 f4(x17, x18) -> f6(x17, x18) :|: x18 >= x17 f10(x13, x14) -> f11(x13, x14) :|: TRUE f6(x9, x10) -> f10(x9, x10) :|: x9 >= x10 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- popout

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

job log

popout

actions

all output return to C_Integer