Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095807
details
property
value
status
complete
benchmark
svcomp_c.02.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
2.23413 seconds
cpu usage
6.11687
user time
5.77938
system time
0.337491
max virtual memory
1.907698E7
max residence set size
473604.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, 66 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) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(c, x, y) -> f2(c, x_1, y) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 + 1 f6(x11, x12, x13) -> f7(x11, x12, 1) :|: TRUE f8(x41, x42, x43) -> f9(x41, x42, x44) :|: TRUE && x44 = x43 + 1 f9(x45, x46, x47) -> f10(x48, x46, x47) :|: TRUE && x48 = x45 + 1 f7(x20, x21, x22) -> f8(x20, x21, x22) :|: x21 > x22 f10(x23, x24, x25) -> f7(x23, x24, x25) :|: TRUE f7(x26, x27, x28) -> f11(x26, x27, x28) :|: x27 <= x28 f11(x49, x50, x51) -> f12(x49, x52, x51) :|: TRUE && x52 = x50 - 2 f4(x32, x33, x34) -> f5(x32, x33, x34) :|: x33 >= 0 f12(x35, x36, x37) -> f4(x35, x36, x37) :|: TRUE f4(x38, x39, x40) -> f13(x38, x39, x40) :|: x39 < 0 Start term: f1(c, x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x32, x33, x34) -> f5(x32, x33, x34) :|: x33 >= 0 f12(x35, x36, x37) -> f4(x35, x36, x37) :|: TRUE f11(x49, x50, x51) -> f12(x49, x52, x51) :|: TRUE && x52 = x50 - 2 f7(x26, x27, x28) -> f11(x26, x27, x28) :|: x27 <= x28 f6(x11, x12, x13) -> f7(x11, x12, 1) :|: TRUE f5(x8, x9, x10) -> f6(x8, arith, x10) :|: TRUE && arith = x9 + 1 f10(x23, x24, x25) -> f7(x23, x24, x25) :|: TRUE f9(x45, x46, x47) -> f10(x48, x46, x47) :|: TRUE && x48 = x45 + 1 f8(x41, x42, x43) -> f9(x41, x42, x44) :|: TRUE && x44 = x43 + 1 f7(x20, x21, x22) -> f8(x20, x21, x22) :|: x21 > x22 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f7(x20:0, x21:0, x22:0) -> f7(x20:0 + 1, x21:0, x22:0 + 1) :|: x22:0 < x21:0 f7(x26:0, x27:0, x28:0) -> f7(x26:0, x27:0 - 1, 1) :|: x28:0 >= x27:0 && x27:0 > 1 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f7(x1, x2, x3) -> f7(x2, x3) ---------------------------------------- (8) Obligation: Rules: f7(x21:0, x22:0) -> f7(x21:0, x22:0 + 1) :|: x22:0 < x21:0 f7(x27:0, x28:0) -> f7(x27:0 - 1, 1) :|: x28:0 >= x27:0 && x27:0 > 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer