C_Integer pair #487095411

details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.71948 seconds
cpu usage	10.7218
user time	10.2766
system time	0.445205
max virtual memory	3.7062444E7
max residence set size	790324.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) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [EQUIVALENT, 1543 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) -> f2(x_1, y) :|: TRUE
f2(x1, x2) -> f3(x1, x3) :|: TRUE
f4(x4, x5) -> f5(x4, 1) :|: TRUE
f6(x6, x7) -> f7(x6, arith) :|: TRUE && arith = 2 * x7
f5(x8, x9) -> f6(x8, x9) :|: x9 < x8
f7(x10, x11) -> f5(x10, x11) :|: TRUE
f5(x12, x13) -> f8(x12, x13) :|: x13 >= x12
f8(x22, x23) -> f9(x24, x23) :|: TRUE && x24 = x22 - 1
f3(x16, x17) -> f4(x16, x17) :|: x16 >= 0
f9(x18, x19) -> f3(x18, x19) :|: TRUE
f3(x20, x21) -> f10(x20, x21) :|: x20 < 0
Start term: f1(x, y)

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

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

   (f1_2,1)
   (f2_2,2)
   (f3_2,3)
   (f4_2,4)
   (f5_2,5)
   (f6_2,6)
   (f7_2,7)
   (f8_2,8)
   (f9_2,9)
   (f10_2,10)

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

(4)
Obligation:
START: 1;

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

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

FROM: 4;
oldX0 := x0;
oldX1 := x1;
assume(0 = 0);
x0 := oldX0;
x1 := 1;
TO: 5;

FROM: 6;
oldX0 := x0;
oldX1 := x1;
oldX2 := nondet();
assume(0 = 0 && oldX2 = 2 * oldX1);
x0 := oldX0;
x1 := oldX2;
TO: 7;

popout

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

job log

popout

actions all output return to C_Integer