details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.46381 seconds
cpu usage	10.5402
user time	9.97632
system time	0.563864
max virtual memory	3.8580004E7
max residence set size	1030316.0

stage attributes

key	value
starexec-result	YES

output

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