details

property	value
status	complete
benchmark	Masse-VMCAI2014-Fig1a_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n141.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.10954 seconds
cpu usage	5.60785
user time	5.29728
system time	0.310573
max virtual memory	3.7199884E7
max residence set size	448552.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, 52 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 38 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 0 ms] (11) YES (12) IntTRS (13) TerminationGraphProcessor [EQUIVALENT, 1 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(a, b) -> f2(x_1, b) :|: TRUE f2(x, x1) -> f3(x, x2) :|: TRUE f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 + x4 f6(x23, x24) -> f9(x23, x25) :|: TRUE && x25 = 0 - x24 - 1 f7(x26, x27) -> f10(x26, x28) :|: TRUE && x28 = 0 - x27 f5(x9, x10) -> f6(x9, x10) :|: x10 >= 0 f5(x11, x12) -> f7(x11, x12) :|: x12 < 0 f9(x13, x14) -> f8(x13, x14) :|: TRUE f10(x15, x16) -> f8(x15, x16) :|: TRUE f3(x17, x18) -> f4(x17, x18) :|: x17 >= 0 f8(x19, x20) -> f3(x19, x20) :|: TRUE f3(x21, x22) -> f11(x21, x22) :|: x21 < 0 Start term: f1(a, b) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x17, x18) -> f4(x17, x18) :|: x17 >= 0 f8(x19, x20) -> f3(x19, x20) :|: TRUE f9(x13, x14) -> f8(x13, x14) :|: TRUE f6(x23, x24) -> f9(x23, x25) :|: TRUE && x25 = 0 - x24 - 1 f5(x9, x10) -> f6(x9, x10) :|: x10 >= 0 f4(x3, x4) -> f5(arith, x4) :|: TRUE && arith = x3 + x4 f10(x15, x16) -> f8(x15, x16) :|: TRUE f7(x26, x27) -> f10(x26, x28) :|: TRUE && x28 = 0 - x27 f5(x11, x12) -> f7(x11, x12) :|: x12 < 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x9:0, x10:0) -> f5(x9:0 + (0 - x10:0 - 1), 0 - x10:0 - 1) :|: x10:0 > -1 && x9:0 > -1 f5(x11:0, x12:0) -> f5(x11:0 + (0 - x12:0), 0 - x12:0) :|: x12:0 < 0 && x11:0 > -1 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x, x1)] = -1 + 2*x - x1 The following rules are decreasing: f5(x9:0, x10:0) -> f5(x9:0 + (0 - x10:0 - 1), 0 - x10:0 - 1) :|: x10:0 > -1 && x9:0 > -1 The following rules are bounded: f5(x11:0, x12:0) -> f5(x11:0 + (0 - x12:0), 0 - x12:0) :|: x12:0 < 0 && x11:0 > -1 ---------------------------------------- (8) Complex Obligation (AND) popout

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

job log

popout

actions

all output return to C_Integer