Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
C Integ Progr 58257 pair #381736015
details
property
value
status
complete
benchmark
ChawdharyCookGulwaniSagivYang-ESOP2008-aaron12_true-termination.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
Stroeder_15
run statistics
property
value
solver
AProVE
configuration
c
runtime (wallclock)
12.3776249886 seconds
cpu usage
46.05442972
max memory
4.051902464E9
stage attributes
key
value
output-size
23209
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, 72 ms] (4) IntTRS (5) IntTRSCompressionProof [EQUIVALENT, 31 ms] (6) IntTRS (7) CaseAnalysis [EQUIVALENT, 21 ms] (8) AND (9) IntTRS (10) IntTRSCompressionProof [EQUIVALENT, 0 ms] (11) IntTRS (12) CaseAnalysis [EQUIVALENT, 14 ms] (13) AND (14) IntTRS (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 3 ms] (18) IntTRS (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IntTRS (21) TerminationGraphProcessor [EQUIVALENT, 0 ms] (22) IntTRS (23) IntTRSCompressionProof [EQUIVALENT, 0 ms] (24) IntTRS (25) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (26) YES (27) IntTRS (28) IntTRSCompressionProof [EQUIVALENT, 0 ms] (29) IntTRS (30) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (31) IntTRS (32) IntTRSCompressionProof [EQUIVALENT, 0 ms] (33) IntTRS (34) RankingReductionPairProof [EQUIVALENT, 0 ms] (35) YES (36) IntTRS (37) IntTRSCompressionProof [EQUIVALENT, 0 ms] (38) IntTRS (39) RankingReductionPairProof [EQUIVALENT, 9 ms] (40) IntTRS (41) IntTRSCompressionProof [EQUIVALENT, 0 ms] (42) IntTRS (43) CaseAnalysis [EQUIVALENT, 11 ms] (44) AND (45) IntTRS (46) IntTRSCompressionProof [EQUIVALENT, 0 ms] (47) IntTRS (48) RankingReductionPairProof [EQUIVALENT, 0 ms] (49) YES (50) IntTRS (51) IntTRSCompressionProof [EQUIVALENT, 0 ms] (52) IntTRS (53) PolynomialOrderProcessor [EQUIVALENT, 4 ms] (54) 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, z) -> f2(x_1, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, x4, x3) :|: TRUE f3(x5, x6, x7) -> f4(x5, x6, x8) :|: TRUE f6(x9, x10, x11) -> f9(arith, x10, x11) :|: TRUE && arith = x9 + 1 f9(x47, x48, x49) -> f10(x47, x50, x49) :|: TRUE && x50 = x48 + x47 f7(x51, x52, x53) -> f11(x54, x52, x53) :|: TRUE && x54 = x51 - x53 f11(x55, x56, x57) -> f12(x55, x58, x57) :|: TRUE && x58 = x56 + x57 * x57 f12(x59, x60, x61) -> f13(x59, x60, x62) :|: TRUE && x62 = x61 - 1 f5(x24, x25, x26) -> f6(x24, x25, x26) :|: x27 < 0 f5(x63, x64, x65) -> f6(x63, x64, x65) :|: x66 > 0 f5(x28, x29, x30) -> f7(x28, x29, x30) :|: x31 = 0 f10(x32, x33, x34) -> f8(x32, x33, x34) :|: TRUE f13(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f4(x38, x39, x40) -> f5(x38, x39, x40) :|: x38 >= x39 f8(x41, x42, x43) -> f4(x41, x42, x43) :|: TRUE f4(x44, x45, x46) -> f14(x44, x45, x46) :|: x44 < x45
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to C Integ Progr 58257