C_Integer pair #487095480

details

property	value
status	complete
benchmark	ChenFlurMukhopadhyay-SAS2012-Ex3.02_false-termination.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n144.star.cs.uiowa.edu
space	Stroeder_15

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.29566 seconds
cpu usage	9.90207
user time	9.47593
system time	0.426137
max virtual memory	1.9217008E7
max residence set size	680276.0

stage attributes

key	value
starexec-result	NO

output

NO
proof of /export/starexec/sandbox2/benchmark/theBenchmark.c
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Termination of the given C Problem could be disproven:

(0) C Problem
(1) CToIRSProof [EQUIVALENT, 0 ms]
(2) IntTRS
(3) IRS2T2 [EQUIVALENT, 0 ms]
(4) T2IntSys
(5) T2 [COMPLETE, 1476 ms]
(6) NO


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

(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
f5(x9, x10, x11) -> f6(arith, x10, x11) :|: TRUE && arith = x9 + x10
f6(x24, x25, x26) -> f7(x24, x27, x26) :|: TRUE && x27 = x25 + x26
f4(x15, x16, x17) -> f5(x15, x16, x17) :|: x15 > 0
f7(x18, x19, x20) -> f4(x18, x19, x20) :|: TRUE
f4(x21, x22, x23) -> f8(x21, x22, x23) :|: x21 <= 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)
   (f5_3,5)
   (f6_3,6)
   (f7_3,7)
   (f8_3,8)

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

(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;

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

FROM: 5;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := -(-(oldX0 + oldX1));
assume(0 = 0 && oldX3 = oldX0 + oldX1);
x0 := -(-(oldX0 + oldX1));

popout

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

job log

popout

actions all output return to C_Integer