details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.37770700455 seconds
cpu usage	10.14582484
max memory	6.33544704E8

stage attributes

key	value
output-size	6229
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, 1543 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(x, y, tmp, xtmp) -> f2(x_1, y, tmp, xtmp) :|: TRUE f2(x1, x2, x3, x4) -> f3(x1, x5, x3, x4) :|: TRUE f4(x6, x7, x8, x9) -> f5(x6, x7, x7, x9) :|: TRUE f5(x10, x11, x12, x13) -> f6(x10, x11, x12, x10) :|: TRUE f7(x14, x15, x16, x17) -> f10(x14, 0, x16, x17) :|: TRUE f11(x18, x19, x20, x21) -> f12(x18, x19, x20, arith) :|: TRUE && arith = x21 - x19 f8(x22, x23, x24, x25) -> f11(x22, x23, x24, x25) :|: x25 > x23 f12(x26, x27, x28, x29) -> f8(x26, x27, x28, x29) :|: TRUE f8(x30, x31, x32, x33) -> f13(x30, x31, x32, x33) :|: x33 <= x31 f6(x34, x35, x36, x37) -> f7(x34, x35, x36, x37) :|: x34 = x35 f6(x38, x39, x40, x41) -> f8(x38, x39, x40, x41) :|: x38 < x39 f6(x70, x71, x72, x73) -> f8(x70, x71, x72, x73) :|: x70 > x71 f10(x42, x43, x44, x45) -> f9(x42, x43, x44, x45) :|: TRUE f13(x46, x47, x48, x49) -> f9(x46, x47, x48, x49) :|: TRUE f9(x50, x51, x52, x53) -> f14(x50, x53, x52, x53) :|: TRUE f14(x54, x55, x56, x57) -> f15(x56, x55, x56, x57) :|: TRUE f3(x58, x59, x60, x61) -> f4(x58, x59, x60, x61) :|: x59 < 0 && x58 >= 0 && x59 >= 0 f3(x74, x75, x76, x77) -> f4(x74, x75, x76, x77) :|: x75 > 0 && x74 >= 0 && x75 >= 0 f15(x62, x63, x64, x65) -> f3(x62, x63, x64, x65) :|: TRUE f3(x66, x67, x68, x69) -> f16(x66, x67, x68, x69) :|: x67 < 0 f3(x78, x79, x80, x81) -> f16(x78, x79, x80, x81) :|: x79 = 0 f3(x82, x83, x84, x85) -> f16(x82, x83, x84, x85) :|: x82 < 0 Start term: f1(x, y, tmp, xtmp) ---------------------------------------- (3) IRS2T2 (EQUIVALENT) Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: (f1_4,1) (f2_4,2) (f3_4,3) (f4_4,4) (f5_4,5) (f6_4,6) (f7_4,7) (f10_4,8) (f11_4,9) (f12_4,10) (f8_4,11) (f13_4,12) (f9_4,13) (f14_4,14) (f15_4,15) (f16_4,16) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := x3; oldX4 := nondet(); assume(0 = 0); x0 := oldX4; x1 := oldX1; x2 := oldX2; x3 := oldX3; TO: 2; popout

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

job log

popout

actions

all output return to C Integ Progr 58257