C_Integer 2019-03-28 22.15 pair #432272329

details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.6578 seconds
cpu usage	11.5022
user time	10.9955
system time	0.506704
max virtual memory	3.7238664E7
max residence set size	944632.0

stage attributes

key	value
starexec-result	NO

output

11.37/3.60	NO
11.37/3.61	proof of /export/starexec/sandbox/benchmark/theBenchmark.c
11.37/3.61	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
11.37/3.61	
11.37/3.61	
11.37/3.61	Termination of the given C Problem could be disproven:
11.37/3.61	
11.37/3.61	(0) C Problem
11.37/3.61	(1) CToIRSProof [EQUIVALENT, 0 ms]
11.37/3.61	(2) IntTRS
11.37/3.61	(3) IRS2T2 [EQUIVALENT, 4 ms]
11.37/3.61	(4) T2IntSys
11.37/3.61	(5) T2 [COMPLETE, 1718 ms]
11.37/3.61	(6) NO
11.37/3.61	
11.37/3.61	
11.37/3.61	----------------------------------------
11.37/3.61	
11.37/3.61	(0)
11.37/3.61	Obligation:
11.37/3.61	c file /export/starexec/sandbox/benchmark/theBenchmark.c
11.37/3.61	----------------------------------------
11.37/3.61	
11.37/3.61	(1) CToIRSProof (EQUIVALENT)
11.37/3.61	Parsed C Integer Program as IRS.
11.37/3.61	----------------------------------------
11.37/3.61	
11.37/3.61	(2)
11.37/3.61	Obligation:
11.37/3.61	Rules:
11.37/3.61	f1(x, y, tmp, xtmp) -> f2(x_1, y, tmp, xtmp) :|: TRUE
11.37/3.61	f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE
11.37/3.61	f4(x6, x7, x8, x9) -> f5(x6, x7, x7, x9) :|: TRUE
11.37/3.61	f5(x10, x11, x12, x13) -> f6(x10, x11, x12, x10) :|: TRUE
11.37/3.61	f7(x14, x15, x16, x17) -> f10(x14, 0, x16, x17) :|: TRUE
11.37/3.61	f11(x18, x19, x20, x21) -> f12(x18, x19, x20, arith) :|: TRUE && arith = x21 - x19
11.37/3.61	f8(x22, x23, x24, x25) -> f11(x22, x23, x24, x25) :|: x25 > x23
11.37/3.61	f12(x26, x27, x28, x29) -> f8(x26, x27, x28, x29) :|: TRUE
11.37/3.61	f8(x30, x31, x32, x33) -> f13(x30, x31, x32, x33) :|: x33 <= x31
11.37/3.61	f6(x34, x35, x36, x37) -> f7(x34, x35, x36, x37) :|: x34 = x35
11.37/3.61	f6(x38, x39, x40, x41) -> f8(x38, x39, x40, x41) :|: x38 < x39
11.37/3.61	f6(x70, x71, x72, x73) -> f8(x70, x71, x72, x73) :|: x70 > x71
11.37/3.61	f10(x42, x43, x44, x45) -> f9(x42, x43, x44, x45) :|: TRUE
11.37/3.61	f13(x46, x47, x48, x49) -> f9(x46, x47, x48, x49) :|: TRUE
11.37/3.61	f9(x50, x51, x52, x53) -> f14(x50, x53, x52, x53) :|: TRUE
11.37/3.61	f14(x54, x55, x56, x57) -> f15(x56, x55, x56, x57) :|: TRUE
11.37/3.61	f3(x58, x59, x60, x61) -> f4(x58, x59, x60, x61) :|: x59 < 0 && x58 >= 0 && x59 >= 0
11.37/3.61	f3(x74, x75, x76, x77) -> f4(x74, x75, x76, x77) :|: x75 > 0 && x74 >= 0 && x75 >= 0
11.37/3.61	f15(x62, x63, x64, x65) -> f3(x62, x63, x64, x65) :|: TRUE
11.37/3.61	f3(x66, x67, x68, x69) -> f16(x66, x67, x68, x69) :|: x67 < 0
11.37/3.61	f3(x78, x79, x80, x81) -> f16(x78, x79, x80, x81) :|: x79 = 0
11.37/3.61	f3(x82, x83, x84, x85) -> f16(x82, x83, x84, x85) :|: x82 < 0
11.37/3.61	Start term: f1(x, y, tmp, xtmp)
11.37/3.61	
11.37/3.61	----------------------------------------
11.37/3.61	
11.37/3.61	(3) IRS2T2 (EQUIVALENT)
11.37/3.61	Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:
11.37/3.61	
11.37/3.61	   (f1_4,1)
11.37/3.61	   (f2_4,2)
11.37/3.61	   (f3_4,3)
11.37/3.61	   (f4_4,4)
11.37/3.61	   (f5_4,5)
11.37/3.61	   (f6_4,6)
11.37/3.61	   (f7_4,7)
11.37/3.61	   (f10_4,8)
11.37/3.61	   (f11_4,9)
11.37/3.61	   (f12_4,10)
11.37/3.61	   (f8_4,11)
11.37/3.61	   (f13_4,12)
11.37/3.61	   (f9_4,13)
11.37/3.61	   (f14_4,14)
11.37/3.61	   (f15_4,15)
11.37/3.61	   (f16_4,16)
11.37/3.61	
11.37/3.61	----------------------------------------
11.37/3.61	
11.37/3.61	(4)
11.37/3.61	Obligation:
11.37/3.61	START: 1;
11.37/3.61	
11.37/3.61	FROM: 1;
11.37/3.61	oldX0 := x0;
11.37/3.61	oldX1 := x1;
11.37/3.61	oldX2 := x2;
11.37/3.61	oldX3 := x3;
11.37/3.61	oldX4 := nondet();
11.37/3.61	assume(0 = 0);
11.37/3.61	x0 := oldX4;
11.37/3.61	x1 := oldX1;
11.37/3.61	x2 := oldX2;
11.37/3.61	x3 := oldX3;
11.37/3.61	TO: 2;
11.37/3.61	
11.37/3.61	FROM: 2;
11.37/3.61	oldX0 := x0;
11.37/3.61	oldX1 := x1;
11.37/3.61	oldX2 := x2;
11.37/3.61	oldX3 := x3;

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