Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C_Integer pair #487095357
details
property
value
status
complete
benchmark
4NestedWith3Variables_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n145.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
3.41587 seconds
cpu usage
10.6004
user time
10.0695
system time
0.530964
max virtual memory
2.0437404E7
max residence set size
887872.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, 50 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 2 ms] (6) IntTRS (7) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (8) IntTRS (9) TerminationGraphProcessor [EQUIVALENT, 0 ms] (10) IntTRS (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IntTRS (13) TerminationGraphProcessor [EQUIVALENT, 0 ms] (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 10 ms] (18) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(a, b, q, olda) -> f2(a, b, x_1, olda) :|: TRUE f2(x, x1, x2, x3) -> f3(x4, x1, x2, x3) :|: TRUE f3(x5, x6, x7, x8) -> f4(x5, x9, x7, x8) :|: TRUE f5(x10, x11, x12, x13) -> f6(x10, x11, arith, x13) :|: TRUE && arith = x12 + x10 - 1 f6(x14, x15, x16, x17) -> f7(x14, x15, x16, x14) :|: TRUE f7(x38, x39, x40, x41) -> f8(x42, x39, x40, x41) :|: TRUE && x42 = 3 * x41 - 4 * x39 f8(x43, x44, x45, x46) -> f9(x43, x47, x45, x46) :|: TRUE && x47 = 4 * x46 + 3 * x44 f4(x26, x27, x28, x29) -> f5(x26, x27, x28, x29) :|: x28 > 0 f9(x30, x31, x32, x33) -> f4(x30, x31, x32, x33) :|: TRUE f4(x34, x35, x36, x37) -> f10(x34, x35, x36, x37) :|: x36 <= 0 Start term: f1(a, b, q, olda) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f4(x26, x27, x28, x29) -> f5(x26, x27, x28, x29) :|: x28 > 0 f9(x30, x31, x32, x33) -> f4(x30, x31, x32, x33) :|: TRUE f8(x43, x44, x45, x46) -> f9(x43, x47, x45, x46) :|: TRUE && x47 = 4 * x46 + 3 * x44 f7(x38, x39, x40, x41) -> f8(x42, x39, x40, x41) :|: TRUE && x42 = 3 * x41 - 4 * x39 f6(x14, x15, x16, x17) -> f7(x14, x15, x16, x14) :|: TRUE f5(x10, x11, x12, x13) -> f6(x10, x11, arith, x13) :|: TRUE && arith = x12 + x10 - 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f6(x14:0, x15:0, x16:0, x17:0) -> f6(3 * x14:0 - 4 * x15:0, 4 * x14:0 + 3 * x15:0, x16:0 + (3 * x14:0 - 4 * x15:0) - 1, x14:0) :|: x16:0 > 0 ---------------------------------------- (7) IntTRSUnneededArgumentFilterProof (EQUIVALENT) Some arguments are removed because they cannot influence termination. We removed arguments according to the following replacements: f6(x1, x2, x3, x4) -> f6(x1, x2, x3) ---------------------------------------- (8) Obligation: Rules: f6(x14:0, x15:0, x16:0) -> f6(3 * x14:0 - 4 * x15:0, 4 * x14:0 + 3 * x15:0, x16:0 + (3 * x14:0 - 4 * x15:0) - 1) :|: x16:0 > 0 ---------------------------------------- (9) TerminationGraphProcessor (EQUIVALENT) Constructed the termination graph and obtained one non-trivial SCC.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C_Integer