details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.47987508774 seconds
cpu usage	10.211477128
max memory	7.19077376E8

stage attributes

key	value
output-size	2699
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be disproven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 0 ms] (4) T2IntSys (5) T2 [COMPLETE, 966 ms] (6) NO ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i, b) -> f2(x_1, b) :|: TRUE f3(x, x1) -> f4(arith, x1) :|: TRUE && arith = x - 2 f2(x2, x3) -> f3(x2, x3) :|: x2 < 1 && x2 < 0 f2(x8, x9) -> f3(x8, x9) :|: x8 < 1 && x8 > 0 f2(x10, x11) -> f3(x10, x11) :|: x10 > 1 && x10 < 0 f2(x12, x13) -> f3(x12, x13) :|: x12 > 1 && x12 > 0 f4(x4, x5) -> f2(x4, x5) :|: TRUE f2(x6, x7) -> f5(x6, x7) :|: x6 = 1 f2(x14, x15) -> f5(x14, x15) :|: x14 = 0 Start term: f1(i, b) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_2,1) (f2_2,2) (f3_2,3) (f4_2,4) (f5_2,5) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 3; oldX0 := x0; oldX1 := x1; oldX2 := -(2 - oldX0); assume(0 = 0 && oldX2 = oldX0 - 2); x0 := -(2 - oldX0); x1 := oldX1; TO: 4; FROM: 2; oldX0 := x0; oldX1 := x1; assume(oldX0 < 1 && oldX0 < 0); x0 := oldX0; x1 := oldX1; TO: 3; FROM: 2; oldX0 := x0; oldX1 := x1; assume(oldX0 < 1 && oldX0 > 0); x0 := oldX0; x1 := oldX1; TO: 3; FROM: 2; oldX0 := x0; popout

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

job log

popout

actions

all output return to C Integ Progr 58257