details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.66129 seconds
cpu usage	11.2074
user time	10.7232
system time	0.4842
max virtual memory	2.0370008E7
max residence set size	623748.0

stage attributes

key	value
starexec-result	YES

output

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