Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095375
details
property
value
status
complete
benchmark
svcomp_a.09_assume.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)
2.13841 seconds
cpu usage
5.3685
user time
5.06994
system time
0.298559
max virtual memory
1.8944652E7
max residence set size
394640.0
stage attributes
key
value
starexec-result
YES
output
YES proof of /export/starexec/sandbox/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, 39 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 14 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (8) 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, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f5(x9, x10, x11) -> f6(x9, x10, arith) :|: TRUE && arith = x11 + x10 f4(x12, x13, x14) -> f5(x12, x13, x14) :|: x13 > 0 && x12 >= x14 f6(x15, x16, x17) -> f4(x15, x16, x17) :|: TRUE f4(x18, x19, x20) -> f7(x18, x19, x20) :|: x19 <= 0 f4(x21, x22, x23) -> f7(x21, x22, x23) :|: x21 < x23 Start term: f1(x, y, z) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x12, x13, x14) -> f5(x12, x13, x14) :|: x13 > 0 && x12 >= x14 f6(x15, x16, x17) -> f4(x15, x16, x17) :|: TRUE f5(x9, x10, x11) -> f6(x9, x10, arith) :|: TRUE && arith = x11 + x10 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x15:0, x16:0, x17:0) -> f6(x15:0, x16:0, x17:0 + x16:0) :|: x16:0 > 0 && x17:0 <= x15:0 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f6(x, x1, x2)] = x - x2 The following rules are decreasing: f6(x15:0, x16:0, x17:0) -> f6(x15:0, x16:0, x17:0 + x16:0) :|: x16:0 > 0 && x17:0 <= x15:0 The following rules are bounded: f6(x15:0, x16:0, x17:0) -> f6(x15:0, x16:0, x17:0 + x16:0) :|: x16:0 > 0 && x17:0 <= x15:0 ---------------------------------------- (8) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer