Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381735917
details
property
value
status
complete
benchmark
Mysore_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n110.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.25636315346 seconds
cpu usage
9.71873569
max memory
9.89630464E8
stage attributes
key
value
output-size
4481
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: 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, 45 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 10 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 13 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) RankingReductionPairProof [EQUIVALENT, 0 ms] (13) YES (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(c, x) -> f2(c, x_1) :|: TRUE f2(x1, x2) -> f3(x3, x2) :|: TRUE f7(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 - x4 f8(x22, x23) -> f9(x24, x23) :|: TRUE && x24 = x22 + 1 f4(x8, x9) -> f7(x8, x9) :|: x9 + x8 >= 0 f9(x10, x11) -> f4(x10, x11) :|: TRUE f4(x12, x13) -> f10(x12, x13) :|: x13 + x12 < 0 f3(x14, x15) -> f4(x14, x15) :|: x14 >= 2 f3(x16, x17) -> f5(x16, x17) :|: x16 < 2 f10(x18, x19) -> f6(x18, x19) :|: TRUE f5(x20, x21) -> f6(x20, x21) :|: TRUE Start term: f1(c, x) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x8, x9) -> f7(x8, x9) :|: x9 + x8 >= 0 f9(x10, x11) -> f4(x10, x11) :|: TRUE f8(x22, x23) -> f9(x24, x23) :|: TRUE && x24 = x22 + 1 f7(x4, x5) -> f8(x4, arith) :|: TRUE && arith = x5 - x4 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f8(x22:0, x23:0) -> f8(x22:0 + 1, x23:0 - (x22:0 + 1)) :|: x23:0 + (x22:0 + 1) >= 0 ---------------------------------------- (7) CaseAnalysis (EQUIVALENT) Found the following inductive condition: f8(x0, x1): -1 + x0>=0 ---------------------------------------- (8) Complex Obligation (AND) ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257