details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.0517950058 seconds
cpu usage	9.131430732
max memory	4.75746304E8

stage attributes

key	value
output-size	5173
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToIRSProof [EQUIVALENT, 0 ms] (2) IntTRS (3) IRS2T2 [EQUIVALENT, 7 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1178 ms] (6) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(c, x, y) -> f2(c, x_1, y) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f3(x5, x6, x7) -> f4(0, x6, x7) :|: TRUE f6(x8, x9, x10) -> f9(x8, arith, x10) :|: TRUE && arith = x9 - 1 f10(x50, x51, x52) -> f13(x50, x51, x53) :|: TRUE && x53 = x52 - 1 f7(x14, x15, x16) -> f10(x14, x15, x16) :|: x16 > 0 f7(x17, x18, x19) -> f11(x17, x18, x19) :|: x19 <= 0 f13(x20, x21, x22) -> f12(x20, x21, x22) :|: TRUE f11(x23, x24, x25) -> f12(x23, x24, x25) :|: TRUE f5(x26, x27, x28) -> f6(x26, x27, x28) :|: x27 > 0 f5(x29, x30, x31) -> f7(x29, x30, x31) :|: x30 <= 0 f9(x32, x33, x34) -> f8(x32, x33, x34) :|: TRUE f12(x35, x36, x37) -> f8(x35, x36, x37) :|: TRUE f8(x54, x55, x56) -> f14(x57, x55, x56) :|: TRUE && x57 = x54 + 1 f4(x41, x42, x43) -> f5(x41, x42, x43) :|: x42 > 0 f4(x58, x59, x60) -> f5(x58, x59, x60) :|: x60 > 0 f14(x44, x45, x46) -> f4(x44, x45, x46) :|: TRUE f4(x47, x48, x49) -> f15(x47, x48, x49) :|: x48 <= 0 && x49 <= 0 Start term: f1(c, x, y) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_3,1) (f2_3,2) (f3_3,3) (f4_3,4) (f6_3,5) (f9_3,6) (f10_3,7) (f13_3,8) (f7_3,9) (f11_3,10) (f12_3,11) (f5_3,12) (f8_3,13) (f14_3,14) (f15_3,15) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX3; x2 := oldX2; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); popout

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

job log

popout

actions

all output return to C Integ Progr 58257