details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	6.95358800888 seconds
cpu usage	24.547590672
max memory	2.704723968E9

stage attributes

key	value
output-size	9609
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, 54 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 28 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 20 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) TerminationGraphProcessor [EQUIVALENT, 16 ms] (13) IntTRS (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IntTRS (16) RankingReductionPairProof [EQUIVALENT, 0 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (19) IntTRS (20) RankingReductionPairProof [EQUIVALENT, 0 ms] (21) YES (22) IntTRS (23) TerminationGraphProcessor [EQUIVALENT, 16 ms] (24) IntTRS (25) IntTRSCompressionProof [EQUIVALENT, 0 ms] (26) IntTRS (27) RankingReductionPairProof [EQUIVALENT, 0 ms] (28) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y) -> f2(x_1, y) :|: TRUE f2(x1, x2) -> f3(x1, x3) :|: TRUE f5(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 + 1 f6(x22, x23) -> f9(x24, x23) :|: TRUE && x24 = x22 + 1 f4(x8, x9) -> f5(x8, x9) :|: x8 > x9 f4(x10, x11) -> f6(x10, x11) :|: x10 <= x11 f8(x12, x13) -> f7(x12, x13) :|: TRUE f9(x14, x15) -> f7(x14, x15) :|: TRUE f3(x16, x17) -> f4(x16, x17) :|: x16 < x17 f3(x25, x26) -> f4(x25, x26) :|: x25 > x26 f7(x18, x19) -> f3(x18, x19) :|: TRUE f3(x20, x21) -> f10(x20, x21) :|: x20 = x21 Start term: f1(x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x16, x17) -> f4(x16, x17) :|: x16 < x17 f7(x18, x19) -> f3(x18, x19) :|: TRUE f8(x12, x13) -> f7(x12, x13) :|: TRUE f5(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 + 1 f4(x8, x9) -> f5(x8, x9) :|: x8 > x9 f3(x25, x26) -> f4(x25, x26) :|: x25 > x26 f9(x14, x15) -> f7(x14, x15) :|: TRUE f6(x22, x23) -> f9(x24, x23) :|: TRUE && x24 = x22 + 1 f4(x10, x11) -> f6(x10, x11) :|: x10 <= x11 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: popout

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

job log

popout

actions

all output return to C Integ Progr 58257