Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095858
details
property
value
status
complete
benchmark
svcomp_b.12.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.3967 seconds
cpu usage
9.74952
user time
9.17987
system time
0.569651
max virtual memory
3.720398E7
max residence set size
881812.0
stage attributes
key
value
starexec-result
YES
output
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, 87 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) PolynomialOrderProcessor [EQUIVALENT, 14 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 9 ms] (12) IntTRS (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IntTRS (15) RankingReductionPairProof [EQUIVALENT, 6 ms] (16) 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, 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 f6(x8, x9, x10) -> f9(x8, arith, x10) :|: TRUE && arith = x9 - 1 f10(x50, x51, x52) -> f13(x50, x51, x53) :|: TRUE && x53 = x52 - 1 f7(x14, x15, x16) -> f10(x14, x15, x16) :|: x16 > 0 f7(x17, x18, x19) -> f11(x17, x18, x19) :|: x19 <= 0 f13(x20, x21, x22) -> f12(x20, x21, x22) :|: TRUE f11(x23, x24, x25) -> f12(x23, x24, x25) :|: TRUE f5(x26, x27, x28) -> f6(x26, x27, x28) :|: x27 > 0 f5(x29, x30, x31) -> f7(x29, x30, x31) :|: x30 <= 0 f9(x32, x33, x34) -> f8(x32, x33, x34) :|: TRUE f12(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f8(x54, x55, x56) -> f14(x57, x55, x56) :|: TRUE && x57 = x54 + 1 f4(x41, x42, x43) -> f5(x41, x42, x43) :|: x42 > 0 f4(x58, x59, x60) -> f5(x58, x59, x60) :|: x60 > 0 f14(x44, x45, x46) -> f4(x44, x45, x46) :|: TRUE f4(x47, x48, x49) -> f15(x47, x48, x49) :|: x48 <= 0 && x49 <= 0 Start term: f1(c, x, y) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x41, x42, x43) -> f5(x41, x42, x43) :|: x42 > 0 f14(x44, x45, x46) -> f4(x44, x45, x46) :|: TRUE f8(x54, x55, x56) -> f14(x57, x55, x56) :|: TRUE && x57 = x54 + 1 f9(x32, x33, x34) -> f8(x32, x33, x34) :|: TRUE f6(x8, x9, x10) -> f9(x8, arith, x10) :|: TRUE && arith = x9 - 1 f5(x26, x27, x28) -> f6(x26, x27, x28) :|: x27 > 0 f4(x58, x59, x60) -> f5(x58, x59, x60) :|: x60 > 0 f12(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f13(x20, x21, x22) -> f12(x20, x21, x22) :|: TRUE f10(x50, x51, x52) -> f13(x50, x51, x53) :|: TRUE && x53 = x52 - 1 f7(x14, x15, x16) -> f10(x14, x15, x16) :|: x16 > 0 f5(x29, x30, x31) -> f7(x29, x30, x31) :|: x30 <= 0 f11(x23, x24, x25) -> f12(x23, x24, x25) :|: TRUE f7(x17, x18, x19) -> f11(x17, x18, x19) :|: x19 <= 0 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f8(x54:0, x55:0, x56:0) -> f5(x54:0 + 1, x55:0, x56:0) :|: x56:0 > 0 f5(x29:0, x30:0, x31:0) -> f8(x29:0, x30:0, x31:0 - 1) :|: x30:0 < 1 && x31:0 > 0 f5(x, x1, x2) -> f8(x, x1, x2) :|: x1 < 1 && x2 < 1 f8(x3, x4, x5) -> f5(x3 + 1, x4, x5) :|: x4 > 0 f5(x26:0, x27:0, x28:0) -> f8(x26:0, x27:0 - 1, x28:0) :|: x27:0 > 0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer