details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.41692090034 seconds
cpu usage	6.590098491
max memory	3.01072384E8

stage attributes

key	value
output-size	4597
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 61 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (10) IntTRS (11) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (12) IntTRS (13) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (14) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, j, c) -> f2(i, j, 0) :|: TRUE f2(x, x1, x2) -> f3(0, x1, x2) :|: TRUE f4(x3, x4, x5) -> f5(x3, 3, x5) :|: TRUE f6(x6, x7, x8) -> f7(x6, arith, x8) :|: TRUE && arith = x7 - 1 f7(x36, x37, x38) -> f8(x36, x37, x39) :|: TRUE && x39 = x38 + 1 f8(x40, x41, x42) -> f9(x40, x43, x42) :|: TRUE && x43 = x41 + 2 f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 < 12 f9(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE f5(x21, x22, x23) -> f10(x21, x22, x23) :|: x22 >= 12 f10(x44, x45, x46) -> f11(x47, x45, x46) :|: TRUE && x47 = x44 + 1 f3(x27, x28, x29) -> f4(x27, x28, x29) :|: x27 < 10 f11(x30, x31, x32) -> f3(x30, x31, x32) :|: TRUE f3(x33, x34, x35) -> f12(x33, x34, x35) :|: x33 >= 10 Start term: f1(i, j, c) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x27, x28, x29) -> f4(x27, x28, x29) :|: x27 < 10 f11(x30, x31, x32) -> f3(x30, x31, x32) :|: TRUE f10(x44, x45, x46) -> f11(x47, x45, x46) :|: TRUE && x47 = x44 + 1 f5(x21, x22, x23) -> f10(x21, x22, x23) :|: x22 >= 12 f9(x18, x19, x20) -> f5(x18, x19, x20) :|: TRUE f8(x40, x41, x42) -> f9(x40, x43, x42) :|: TRUE && x43 = x41 + 2 f7(x36, x37, x38) -> f8(x36, x37, x39) :|: TRUE && x39 = x38 + 1 f6(x6, x7, x8) -> f7(x6, arith, x8) :|: TRUE && arith = x7 - 1 f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x16 < 12 f4(x3, x4, x5) -> f5(x3, 3, x5) :|: TRUE ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x21:0, x22:0, x23:0) -> f5(x21:0 + 1, 3, x23:0) :|: x22:0 > 11 && x21:0 < 9 f5(x15:0, x16:0, x17:0) -> f5(x15:0, x16:0 + 1, x17:0 + 1) :|: x16:0 < 12 ---------------------------------------- (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(x1, x2) ---------------------------------------- popout

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

job log

popout

actions

all output return to C Integ Progr 58257