C_Integer pair #487095192

details

property	value
status	complete
benchmark	AliasDarteFeautrierGonnord-SAS2010-counterex1a_true-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n140.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	13.7814 seconds
cpu usage	30.2457
user time	28.8483
system time	1.39741
max virtual memory	3.8604568E7
max residence set size	2849104.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, 68 ms]
(2) IntTRS
(3) TerminationGraphProcessor [SOUND, 116 ms]
(4) IntTRS
(5) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(6) IntTRS
(7) PolynomialOrderProcessor [EQUIVALENT, 25 ms]
(8) AND
    (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 21 ms]
        (13) AND
            (14) IntTRS
                (15) TerminationGraphProcessor [EQUIVALENT, 13 ms]
                (16) AND
                    (17) IntTRS
                        (18) IntTRSCompressionProof [EQUIVALENT, 2 ms]
                        (19) IntTRS
                        (20) PolynomialOrderProcessor [EQUIVALENT, 2 ms]
                        (21) YES
                    (22) IntTRS
                        (23) IntTRSCompressionProof [EQUIVALENT, 1 ms]
                        (24) IntTRS
                        (25) RankingReductionPairProof [EQUIVALENT, 0 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) TerminationGraphProcessor [EQUIVALENT, 0 ms]
        (38) YES


----------------------------------------

(0)
Obligation:
c file /export/starexec/sandbox/benchmark/theBenchmark.c
----------------------------------------

(1) CToIRSProof (EQUIVALENT)
Parsed C Integer Program as IRS.
----------------------------------------

(2)
Obligation:
Rules:
f1(x, y, n, b) -> f2(x, y, x_1, b) :|: TRUE
f2(x1, x2, x3, x4) -> f3(x1, x2, x3, x5) :|: TRUE
f3(x6, x7, x8, x9) -> f4(x10, x7, x8, x9) :|: TRUE
f4(x11, x12, x13, x14) -> f5(x11, x15, x13, x14) :|: TRUE
f7(x16, x17, x18, x19) -> f10(x16, arith, x18, x19) :|: TRUE && arith = x17 + 1
f11(x20, x21, x22, x23) -> f14(x20, x21, x22, 1) :|: TRUE
f10(x24, x25, x26, x27) -> f11(x24, x25, x26, x27) :|: x28 < 0
f10(x100, x101, x102, x103) -> f11(x100, x101, x102, x103) :|: x104 > 0
f10(x29, x30, x31, x32) -> f12(x29, x30, x31, x32) :|: x33 = 0
f14(x34, x35, x36, x37) -> f13(x34, x35, x36, x37) :|: TRUE
f12(x38, x39, x40, x41) -> f13(x38, x39, x40, x41) :|: TRUE
f8(x105, x106, x107, x108) -> f15(x105, x109, x107, x108) :|: TRUE && x109 = x106 - 1
f16(x110, x111, x112, x113) -> f19(x114, x111, x112, x113) :|: TRUE && x114 = x110 - 1
f19(x50, x51, x52, x53) -> f20(x50, x51, x52, 0) :|: TRUE
f15(x54, x55, x56, x57) -> f16(x54, x55, x56, x57) :|: x58 < 0
f15(x115, x116, x117, x118) -> f16(x115, x116, x117, x118) :|: x119 > 0
f15(x59, x60, x61, x62) -> f17(x59, x60, x61, x62) :|: x63 = 0
f20(x64, x65, x66, x67) -> f18(x64, x65, x66, x67) :|: TRUE
f17(x68, x69, x70, x71) -> f18(x68, x69, x70, x71) :|: TRUE
f6(x72, x73, x74, x75) -> f7(x72, x73, x74, x75) :|: x75 = 0
f6(x76, x77, x78, x79) -> f8(x76, x77, x78, x79) :|: x79 < 0
f6(x120, x121, x122, x123) -> f8(x120, x121, x122, x123) :|: x123 > 0
f13(x80, x81, x82, x83) -> f9(x80, x81, x82, x83) :|: TRUE
f18(x84, x85, x86, x87) -> f9(x84, x85, x86, x87) :|: TRUE
f5(x88, x89, x90, x91) -> f6(x88, x89, x90, x91) :|: x88 >= 0 && 0 <= x89 && x89 <= x90
f9(x92, x93, x94, x95) -> f5(x92, x93, x94, x95) :|: TRUE
f5(x96, x97, x98, x99) -> f21(x96, x97, x98, x99) :|: x97 > x98
f5(x124, x125, x126, x127) -> f21(x124, x125, x126, x127) :|: x124 < 0
f5(x128, x129, x130, x131) -> f21(x128, x129, x130, x131) :|: 0 > x129
Start term: f1(x, y, n, b)

----------------------------------------

(3) TerminationGraphProcessor (SOUND)
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