details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.98870897293 seconds
cpu usage	8.726998164
max memory	4.65158144E8

stage attributes

key	value
output-size	3520
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/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, 1234 ms] (6) NO ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(i) -> f2(x_1) :|: TRUE f7(x) -> f10(arith) :|: TRUE && arith = x + 1 f4(x1) -> f7(x1) :|: x1 < 0 f4(x2) -> f8(x2) :|: x2 >= 0 f10(x3) -> f9(x3) :|: TRUE f8(x4) -> f9(x4) :|: TRUE f11(x17) -> f14(x18) :|: TRUE && x18 = x17 - 1 f9(x6) -> f11(x6) :|: x6 > 0 f9(x7) -> f12(x7) :|: x7 <= 0 f14(x8) -> f13(x8) :|: TRUE f12(x9) -> f13(x9) :|: TRUE f3(x10) -> f4(x10) :|: x10 > 0 - 5 && x10 < 5 f3(x11) -> f5(x11) :|: x11 <= 0 - 5 f3(x19) -> f5(x19) :|: x19 >= 5 f13(x12) -> f6(x12) :|: TRUE f5(x13) -> f6(x13) :|: TRUE f2(x14) -> f3(x14) :|: x14 < 0 f2(x20) -> f3(x20) :|: x20 > 0 f6(x15) -> f2(x15) :|: TRUE f2(x16) -> f15(x16) :|: x16 = 0 Start term: f1(i) ---------------------------------------- (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) (f7_1,3) (f10_1,4) (f4_1,5) (f8_1,6) (f9_1,7) (f11_1,8) (f14_1,9) (f12_1,10) (f13_1,11) (f3_1,12) (f5_1,13) (f6_1,14) (f15_1,15) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := nondet(); assume(0 = 0); x0 := oldX1; TO: 2; FROM: 3; oldX0 := x0; oldX1 := -(-(oldX0 + 1)); assume(0 = 0 && oldX1 = oldX0 + 1); x0 := -(-(oldX0 + 1)); TO: 4; FROM: 5; popout

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

job log

popout

actions

all output return to C Integ Progr 58257