details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	4.31169819832 seconds
cpu usage	13.899430588
max memory	1.522266112E9

stage attributes

key	value
output-size	4665
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, 2463 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, range) -> f2(x_1, range) :|: TRUE f2(x, x1) -> f3(x, 20) :|: TRUE f5(x2, x3) -> f8(arith, x3) :|: TRUE && arith = x2 * (0 - 1) f6(x32, x33) -> f9(x32, x34) :|: TRUE && x34 = x33 + 1 f9(x35, x36) -> f10(x37, x36) :|: TRUE && x37 = x35 - 1 f11(x38, x39) -> f14(x38, x40) :|: TRUE && x40 = 0 - 1 f10(x10, x11) -> f11(x10, x11) :|: x10 = 0 f10(x12, x13) -> f12(x12, x13) :|: x12 < 0 f10(x41, x42) -> f12(x41, x42) :|: x41 > 0 f14(x14, x15) -> f13(x14, x15) :|: TRUE f12(x16, x17) -> f13(x16, x17) :|: TRUE f4(x18, x19) -> f5(x18, x19) :|: x19 - x18 < 5 f4(x43, x44) -> f5(x43, x44) :|: x44 + x43 < 5 f4(x20, x21) -> f6(x20, x21) :|: x21 - x20 >= 5 && x21 + x20 >= 5 f8(x22, x23) -> f7(x22, x23) :|: TRUE f13(x24, x25) -> f7(x24, x25) :|: TRUE f3(x26, x27) -> f4(x26, x27) :|: 0 - x27 <= x26 && x26 <= x27 f7(x28, x29) -> f3(x28, x29) :|: TRUE f3(x30, x31) -> f15(x30, x31) :|: 0 - x31 > x30 f3(x45, x46) -> f15(x45, x46) :|: x45 > x46 Start term: f1(i, range) ---------------------------------------- (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) (f5_2,4) (f8_2,5) (f6_2,6) (f9_2,7) (f10_2,8) (f11_2,9) (f14_2,10) (f12_2,11) (f13_2,12) (f4_2,13) (f7_2,14) (f15_2,15) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; assume(0 = 0); x0 := oldX0; x1 := 20; popout

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

job log

popout

actions

all output return to C Integ Progr 58257