Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095351
details
property
value
status
complete
benchmark
ChenFlurMukhopadhyay-SAS2012-Ex2.22_true-termination.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)
2.37906 seconds
cpu usage
6.20637
user time
5.8798
system time
0.326562
max virtual memory
1.9175904E7
max residence set size
463880.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, 43 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 0 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 0 ms] (10) IntTRS (11) TerminationGraphProcessor [EQUIVALENT, 2 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y, oldy) -> f2(x_1, y, oldy) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f4(x5, x6, x7) -> f5(x6, x6, x7) :|: TRUE f5(x8, x9, x10) -> f6(x8, x9, x9) :|: TRUE f6(x11, x12, x13) -> f7(x11, x14, x13) :|: TRUE f3(x15, x16, x17) -> f4(x15, x16, x17) :|: x15 > 0 && x16 <= 0 - x17 f7(x18, x19, x20) -> f3(x18, x19, x20) :|: TRUE f3(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= 0 f3(x24, x25, x26) -> f8(x24, x25, x26) :|: x25 > 0 - x26 Start term: f1(x, y, oldy) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f3(x15, x16, x17) -> f4(x15, x16, x17) :|: x15 > 0 && x16 <= 0 - x17 f7(x18, x19, x20) -> f3(x18, x19, x20) :|: TRUE f6(x11, x12, x13) -> f7(x11, x14, x13) :|: TRUE f5(x8, x9, x10) -> f6(x8, x9, x9) :|: TRUE f4(x5, x6, x7) -> f5(x6, x6, x7) :|: TRUE ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f5(x8:0, x9:0, x10:0) -> f5(x14:0, x14:0, x9:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f5(x1, x2, x3) -> f5(x1, x2) ---------------------------------------- (8) Obligation: Rules: f5(x8:0, x9:0) -> f5(x14:0, x14:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC. f5(x8:0, x9:0) -> f5(x14:0, x14:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0 has been transformed into f5(x8:0, x9:0) -> f5(x14:0, x14:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0. f5(x8:0, x9:0) -> f5(x14:0, x14:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0 and f5(x8:0, x9:0) -> f5(x14:0, x14:0) :|: x8:0 > 0 && x14:0 <= 0 - x9:0
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer