details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	1.94687 seconds
cpu usage	5.03835
user time	4.77196
system time	0.266391
max virtual memory	1.9032464E7
max residence set size	407740.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, 46 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 44 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, tmp) -> f2(x_1, tmp) :|: TRUE f2(x1, x2) -> f3(x1, x3) :|: TRUE f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x4 - 1 f5(x6, x7) -> f6(x6, x8) :|: TRUE f3(x9, x10) -> f4(x9, x10) :|: x9 > 0 && x9 = 2 * x10 f6(x11, x12) -> f3(x11, x12) :|: TRUE f3(x13, x14) -> f7(x13, x14) :|: x13 <= 0 f3(x15, x16) -> f7(x15, x16) :|: x15 < 2 * x16 f3(x17, x18) -> f7(x17, x18) :|: x17 > 2 * x18 Start term: f1(x, tmp) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x9, x10) -> f4(x9, x10) :|: x9 > 0 && x9 = 2 * x10 f6(x11, x12) -> f3(x11, x12) :|: TRUE f5(x6, x7) -> f6(x6, x8) :|: TRUE f4(x4, x5) -> f5(arith, x5) :|: TRUE && arith = x4 - 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(times~cons_2~x8:0, x7:0) -> f5(2 * x8:0 - 1, x8:0) :|: 2 * x8:0 > 0 && times~cons_2~x8:0 = 2 * x8:0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2) -> f5(x1) ---------------------------------------- (8) Obligation: Rules: f5(times~cons_2~x8:0) -> f5(2 * x8:0 - 1) :|: 2 * x8:0 > 0 && times~cons_2~x8:0 = 2 * x8:0 ---------------------------------------- (9) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f5(x)] = x The following rules are decreasing: f5(times~cons_2~x8:0) -> f5(2 * x8:0 - 1) :|: 2 * x8:0 > 0 && times~cons_2~x8:0 = 2 * x8:0 The following rules are bounded: f5(times~cons_2~x8:0) -> f5(2 * x8:0 - 1) :|: 2 * x8:0 > 0 && times~cons_2~x8:0 = 2 * x8:0 ---------------------------------------- (10) YES popout

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

job log

popout

actions

all output return to C_Integer