Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736183
details
property
value
status
complete
benchmark
Overflow.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
1.83876109123 seconds
cpu usage
4.646859354
max memory
3.664896E8
stage attributes
key
value
output-size
2063
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) TerminationGraphProcessor [SOUND, 35 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 1 ms] (6) IntTRS (7) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (8) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i) -> f2(x_1) :|: TRUE f3(x) -> f4(arith) :|: TRUE && arith = x + 1 f2(x1) -> f3(x1) :|: x1 <= 2147483647 f4(x2) -> f2(x2) :|: TRUE f2(x3) -> f5(x3) :|: x3 > 2147483647 Start term: f1(i) ---------------------------------------- (3) TerminationGraphProcessor (SOUND) Constructed the termination graph and obtained one non-trivial SCC. ---------------------------------------- (4) Obligation: Rules: f2(x1) -> f3(x1) :|: x1 <= 2147483647 f4(x2) -> f2(x2) :|: TRUE f3(x) -> f4(arith) :|: TRUE && arith = x + 1 ---------------------------------------- (5) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (6) Obligation: Rules: f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 ---------------------------------------- (7) PolynomialOrderProcessor (EQUIVALENT) Found the following polynomial interpretation: [f4(x)] = 2147483647 - x The following rules are decreasing: f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 The following rules are bounded: f4(x2:0) -> f4(x2:0 + 1) :|: x2:0 < 2147483648 ---------------------------------------- (8) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257