details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	7.16117 seconds
cpu usage	18.2267
user time	17.156
system time	1.07074
max virtual memory	3.8439556E7
max residence set size	2662640.0

stage attributes

key	value
starexec-result	NO

output

17.90/5.49 NO 17.90/5.49 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 17.90/5.49 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 17.90/5.49 17.90/5.49 17.90/5.49 Termination of the given C Problem could be disproven: 17.90/5.49 17.90/5.49 (0) C Problem 17.90/5.49 (1) CToIRSProof [EQUIVALENT, 0 ms] 17.90/5.49 (2) IntTRS 17.90/5.49 (3) IRS2T2 [EQUIVALENT, 0 ms] 17.90/5.49 (4) T2IntSys 17.90/5.49 (5) T2 Underapproximation [COMPLETE, 1852 ms] 17.90/5.49 (6) T2IntSys 17.90/5.49 (7) T2 [COMPLETE, 1422 ms] 17.90/5.49 (8) NO 17.90/5.49 17.90/5.49 17.90/5.49 ---------------------------------------- 17.90/5.49 17.90/5.49 (0) 17.90/5.49 Obligation: 17.90/5.49 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 17.90/5.49 ---------------------------------------- 17.90/5.49 17.90/5.49 (1) CToIRSProof (EQUIVALENT) 17.90/5.49 Parsed C Integer Program as IRS. 17.90/5.49 ---------------------------------------- 17.90/5.49 17.90/5.49 (2) 17.90/5.49 Obligation: 17.90/5.49 Rules: 17.90/5.49 f1(x, y) -> f2(x_1, y) :|: TRUE 17.90/5.49 f2(x1, x2) -> f3(x1, x3) :|: TRUE 17.90/5.49 f7(x4, x5) -> f8(arith, x5) :|: TRUE && arith = x4 + x4 + x5 17.90/5.49 f8(x22, x23) -> f9(x22, x24) :|: TRUE && x24 = x23 + 1 17.90/5.49 f4(x8, x9) -> f7(x8, x9) :|: x8 > 0 17.90/5.49 f9(x10, x11) -> f4(x10, x11) :|: TRUE 17.90/5.49 f4(x12, x13) -> f10(x12, x13) :|: x12 <= 0 17.90/5.49 f3(x14, x15) -> f4(x14, x15) :|: x14 + x15 >= 0 17.90/5.49 f3(x16, x17) -> f5(x16, x17) :|: x16 + x17 < 0 17.90/5.49 f10(x18, x19) -> f6(x18, x19) :|: TRUE 17.90/5.49 f5(x20, x21) -> f6(x20, x21) :|: TRUE 17.90/5.49 Start term: f1(x, y) 17.90/5.49 17.90/5.49 ---------------------------------------- 17.90/5.49 17.90/5.49 (3) IRS2T2 (EQUIVALENT) 17.90/5.49 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 17.90/5.49 17.90/5.49 (f1_2,1) 17.90/5.49 (f2_2,2) 17.90/5.49 (f3_2,3) 17.90/5.49 (f7_2,4) 17.90/5.49 (f8_2,5) 17.90/5.49 (f9_2,6) 17.90/5.49 (f4_2,7) 17.90/5.49 (f10_2,8) 17.90/5.49 (f5_2,9) 17.90/5.49 (f6_2,10) 17.90/5.49 17.90/5.49 ---------------------------------------- 17.90/5.49 17.90/5.49 (4) 17.90/5.49 Obligation: 17.90/5.49 START: 1; 17.90/5.49 17.90/5.49 FROM: 1; 17.90/5.49 oldX0 := x0; 17.90/5.49 oldX1 := x1; 17.90/5.49 oldX2 := nondet(); 17.90/5.49 assume(0 = 0); 17.90/5.49 x0 := oldX2; 17.90/5.49 x1 := oldX1; 17.90/5.49 TO: 2; 17.90/5.49 17.90/5.49 FROM: 2; 17.90/5.49 oldX0 := x0; 17.90/5.49 oldX1 := x1; 17.90/5.49 oldX2 := nondet(); 17.90/5.49 assume(0 = 0); 17.90/5.49 x0 := oldX0; 17.90/5.49 x1 := oldX2; 17.90/5.49 TO: 3; 17.90/5.49 17.90/5.49 FROM: 4; 17.90/5.49 oldX0 := x0; 17.90/5.49 oldX1 := x1; 17.90/5.49 oldX2 := -(-(oldX0 + oldX0 + oldX1)); 17.90/5.49 assume(0 = 0 && oldX2 = oldX0 + oldX0 + oldX1); 17.90/5.49 x0 := -(-(oldX0 + oldX0 + oldX1)); 17.90/5.49 x1 := oldX1; 17.90/5.49 TO: 5; 17.90/5.49 17.90/5.49 FROM: 5; 17.90/5.49 oldX0 := x0; 17.90/5.49 oldX1 := x1; 17.90/5.49 oldX2 := -(-(oldX1 + 1)); 17.90/5.49 assume(0 = 0 && oldX2 = oldX1 + 1); 17.90/5.49 x0 := oldX0; 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