details

property	value
status	complete
benchmark	CookSeeZuleger-TACAS2013-Fig8a_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n144.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.49567484856 seconds
cpu usage	10.136165282
max memory	9.37406464E8

stage attributes

key	value
output-size	5509
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- 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, 49 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 29 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 17 ms] (8) AND (9) IntTRS (10) TerminationGraphProcessor [EQUIVALENT, 18 ms] (11) IntTRS (12) IntTRSCompressionProof [EQUIVALENT, 0 ms] (13) IntTRS (14) RankingReductionPairProof [EQUIVALENT, 0 ms] (15) YES (16) IntTRS (17) TerminationGraphProcessor [EQUIVALENT, 17 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) RankingReductionPairProof [EQUIVALENT, 0 ms] (22) 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) -> f2(x_1) :|: TRUE f4(x1) -> f7(arith) :|: TRUE && arith = x1 - 1 f5(x10) -> f8(x11) :|: TRUE && x11 = x10 + 1 f3(x3) -> f4(x3) :|: x3 > 0 f3(x4) -> f5(x4) :|: x4 <= 0 f7(x5) -> f6(x5) :|: TRUE f8(x6) -> f6(x6) :|: TRUE f2(x7) -> f3(x7) :|: x7 < 0 f2(x12) -> f3(x12) :|: x12 > 0 f6(x8) -> f2(x8) :|: TRUE f2(x9) -> f9(x9) :|: x9 = 0 Start term: f1(x) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f2(x7) -> f3(x7) :|: x7 < 0 f6(x8) -> f2(x8) :|: TRUE f7(x5) -> f6(x5) :|: TRUE f4(x1) -> f7(arith) :|: TRUE && arith = x1 - 1 f3(x3) -> f4(x3) :|: x3 > 0 f2(x12) -> f3(x12) :|: x12 > 0 f8(x6) -> f6(x6) :|: TRUE f5(x10) -> f8(x11) :|: TRUE && x11 = x10 + 1 f3(x4) -> f5(x4) :|: x4 <= 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x8:0) -> f3(x8:0) :|: x8:0 < 0 f6(x) -> f3(x) :|: x > 0 f3(x4:0) -> f6(x4:0 + 1) :|: x4:0 < 1 f3(x3:0) -> f6(x3:0 - 1) :|: x3:0 > 0 ---------------------------------------- popout

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

job log

popout

actions

all output return to C Integer