details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.98821592331 seconds
cpu usage	9.972174441
max memory	6.64829952E8

stage attributes

key	value
output-size	2406
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, 1283 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(x) -> f2(x_1) :|: TRUE f6(x1) -> f7(arith) :|: TRUE && arith = x1 - 2 f3(x2) -> f6(x2) :|: x2 < 0 f3(x9) -> f6(x9) :|: x9 > 0 f7(x3) -> f3(x3) :|: TRUE f3(x4) -> f8(x4) :|: x4 = 0 f2(x5) -> f3(x5) :|: x5 > 0 f2(x6) -> f4(x6) :|: x6 <= 0 f8(x7) -> f5(x7) :|: TRUE f4(x8) -> f5(x8) :|: TRUE Start term: f1(x) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_1,1) (f2_1,2) (f6_1,3) (f7_1,4) (f3_1,5) (f8_1,6) (f4_1,7) (f5_1,8) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := nondet(); assume(0 = 0); x0 := oldX1; TO: 2; FROM: 3; oldX0 := x0; oldX1 := -(2 - oldX0); assume(0 = 0 && oldX1 = oldX0 - 2); x0 := -(2 - oldX0); TO: 4; FROM: 5; oldX0 := x0; assume(oldX0 < 0); x0 := oldX0; TO: 3; FROM: 5; oldX0 := x0; assume(oldX0 > 0); x0 := oldX0; TO: 3; FROM: 4; oldX0 := x0; assume(0 = 0); x0 := oldX0; TO: 5; popout

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

job log

popout

actions

all output return to C Integ Progr 58257