C Integ Progr 58257 pair #381736849

details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	6.9977350235 seconds
cpu usage	24.467418123
max memory	2.697404416E9

stage attributes

key	value
output-size	4295
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files


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


YES
proof of /export/starexec/sandbox/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) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 4934 ms]
(6) 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, 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 + x10
f7(x44, x45, x46) -> f10(x47, x45, x46) :|: TRUE && x47 = x44 + x46
f5(x15, x16, x17) -> f6(x15, x16, x17) :|: x18 < 0
f5(x48, x49, x50) -> f6(x48, x49, x50) :|: x51 > 0
f5(x19, x20, x21) -> f7(x19, x20, x21) :|: x22 = 0
f9(x23, x24, x25) -> f8(x23, x24, x25) :|: TRUE
f10(x26, x27, x28) -> f8(x26, x27, x28) :|: TRUE
f8(x52, x53, x54) -> f11(x52, x55, x54) :|: TRUE && x55 = x53 + x54
f11(x56, x57, x58) -> f12(x56, x57, x59) :|: TRUE && x59 = x58 - 1
f4(x35, x36, x37) -> f5(x35, x36, x37) :|: x35 >= 0
f12(x38, x39, x40) -> f4(x38, x39, x40) :|: TRUE
f4(x41, x42, x43) -> f13(x41, x42, x43) :|: x41 < 0
Start term: f1(x, y, z)

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

(3) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f1_3,1)
   (f2_3,2)
   (f3_3,3)
   (f4_3,4)
   (f6_3,5)
   (f9_3,6)
   (f7_3,7)
   (f10_3,8)
   (f5_3,9)
   (f8_3,10)
   (f11_3,11)
   (f12_3,12)
   (f13_3,13)

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

(4)
Obligation:
START: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX3;
x1 := oldX1;
x2 := oldX2;
TO: 2;

FROM: 2;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := nondet();
assume(0 = 0);
x0 := oldX0;
x1 := oldX3;
x2 := oldX2;
TO: 3;

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to C Integ Progr 58257