C_Integer 2019-03-28 22.15 pair #432271492

details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.65341 seconds
cpu usage	11.152
user time	10.4437
system time	0.708281
max virtual memory	2.0486524E7
max residence set size	1229476.0

stage attributes

key	value
starexec-result	YES

output

10.82/3.59	YES
10.82/3.62	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
10.82/3.62	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
10.82/3.62	
10.82/3.62	
10.82/3.62	Termination of the given C Problem could be proven:
10.82/3.62	
10.82/3.62	(0) C Problem
10.82/3.62	(1) CToIRSProof [EQUIVALENT, 0 ms]
10.82/3.62	(2) IntTRS
10.82/3.62	(3) IRS2T2 [EQUIVALENT, 0 ms]
10.82/3.62	(4) T2IntSys
10.82/3.62	(5) T2 [EQUIVALENT, 1717 ms]
10.82/3.62	(6) YES
10.82/3.62	
10.82/3.62	
10.82/3.62	----------------------------------------
10.82/3.62	
10.82/3.62	(0)
10.82/3.62	Obligation:
10.82/3.62	c file /export/starexec/sandbox/benchmark/theBenchmark.c
10.82/3.62	----------------------------------------
10.82/3.62	
10.82/3.62	(1) CToIRSProof (EQUIVALENT)
10.82/3.62	Parsed C Integer Program as IRS.
10.82/3.62	----------------------------------------
10.82/3.62	
10.82/3.62	(2)
10.82/3.62	Obligation:
10.82/3.62	Rules:
10.82/3.62	f1(x, d1, d2, d1old) -> f2(x_1, d1, d2, d1old) :|: TRUE
10.82/3.62	f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE
10.82/3.62	f3(x6, x7, x8, x9) -> f4(x6, x7, x10, x9) :|: TRUE
10.82/3.62	f5(x11, x12, x13, x14) -> f6(arith, x12, x13, x14) :|: TRUE && arith = x11 - x12
10.82/3.62	f6(x15, x16, x17, x18) -> f7(x15, x16, x17, x16) :|: TRUE
10.82/3.62	f7(x39, x40, x41, x42) -> f8(x39, x43, x41, x42) :|: TRUE && x43 = x41 + 1
10.82/3.62	f8(x44, x45, x46, x47) -> f9(x44, x45, x48, x47) :|: TRUE && x48 = x47 + 1
10.82/3.62	f4(x27, x28, x29, x30) -> f5(x27, x28, x29, x30) :|: x27 >= 0
10.82/3.62	f9(x31, x32, x33, x34) -> f4(x31, x32, x33, x34) :|: TRUE
10.82/3.62	f4(x35, x36, x37, x38) -> f10(x35, x36, x37, x38) :|: x35 < 0
10.82/3.62	Start term: f1(x, d1, d2, d1old)
10.82/3.62	
10.82/3.62	----------------------------------------
10.82/3.62	
10.82/3.62	(3) IRS2T2 (EQUIVALENT)
10.82/3.62	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
10.82/3.62	
10.82/3.62	   (f1_4,1)
10.82/3.62	   (f2_4,2)
10.82/3.62	   (f3_4,3)
10.82/3.62	   (f4_4,4)
10.82/3.62	   (f5_4,5)
10.82/3.62	   (f6_4,6)
10.82/3.62	   (f7_4,7)
10.82/3.62	   (f8_4,8)
10.82/3.62	   (f9_4,9)
10.82/3.62	   (f10_4,10)
10.82/3.62	
10.82/3.62	----------------------------------------
10.82/3.62	
10.82/3.62	(4)
10.82/3.62	Obligation:
10.82/3.62	START: 1;
10.82/3.62	
10.82/3.62	FROM: 1;
10.82/3.62	oldX0 := x0;
10.82/3.62	oldX1 := x1;
10.82/3.62	oldX2 := x2;
10.82/3.62	oldX3 := x3;
10.82/3.62	oldX4 := nondet();
10.82/3.62	assume(0 = 0);
10.82/3.62	x0 := oldX4;
10.82/3.62	x1 := oldX1;
10.82/3.62	x2 := oldX2;
10.82/3.62	x3 := oldX3;
10.82/3.62	TO: 2;
10.82/3.62	
10.82/3.62	FROM: 2;
10.82/3.62	oldX0 := x0;
10.82/3.62	oldX1 := x1;
10.82/3.62	oldX2 := x2;
10.82/3.62	oldX3 := x3;
10.82/3.62	oldX4 := nondet();
10.82/3.62	assume(0 = 0);
10.82/3.62	x0 := oldX0;
10.82/3.62	x1 := oldX4;
10.82/3.62	x2 := oldX2;
10.82/3.62	x3 := oldX3;
10.82/3.62	TO: 3;
10.82/3.62	
10.82/3.62	FROM: 3;
10.82/3.62	oldX0 := x0;
10.82/3.62	oldX1 := x1;
10.82/3.62	oldX2 := x2;
10.82/3.62	oldX3 := x3;
10.82/3.62	oldX4 := nondet();
10.82/3.62	assume(0 = 0);
10.82/3.62	x0 := oldX0;
10.82/3.62	x1 := oldX1;
10.82/3.62	x2 := oldX4;

popout

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

job log

popout

actions all output return to C_Integer 2019-03-28 22.15