details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.17417907715 seconds
cpu usage	9.729559552
max memory	7.84461824E8

stage attributes

key	value
output-size	3431
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 0 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1403 ms] (6) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToIRSProof (EQUIVALENT) Parsed C Integer Program as IRS. ---------------------------------------- (2) Obligation: Rules: f1(x, y) -> f2(x_1, y) :|: TRUE f3(x1, x2) -> f4(x1, 1) :|: TRUE f5(x3, x4) -> f6(x3, arith) :|: TRUE && arith = 2 * x4 f4(x5, x6) -> f5(x5, x6) :|: x5 > x6 f6(x7, x8) -> f4(x7, x8) :|: TRUE f4(x9, x10) -> f7(x9, x10) :|: x9 <= x10 f7(x19, x20) -> f8(x21, x20) :|: TRUE && x21 = x19 - 1 f2(x13, x14) -> f3(x13, x14) :|: x13 >= 0 f8(x15, x16) -> f2(x15, x16) :|: TRUE f2(x17, x18) -> f9(x17, x18) :|: x17 < 0 Start term: f1(x, y) ---------------------------------------- (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) (f4_2,4) (f5_2,5) (f6_2,6) (f7_2,7) (f8_2,8) (f9_2,9) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 3; oldX0 := x0; oldX1 := x1; assume(0 = 0); x0 := oldX0; x1 := 1; TO: 4; FROM: 5; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0 && oldX2 = 2 * oldX1); x0 := oldX0; x1 := oldX2; TO: 6; FROM: 4; oldX0 := x0; oldX1 := x1; assume(oldX0 > oldX1); x0 := oldX0; popout

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

job log

popout

actions

all output return to C Integ Progr 58257