details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	2.9592 seconds
cpu usage	8.85477
user time	8.49365
system time	0.361116
max virtual memory	1.8881284E7
max residence set size	607676.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.c # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 1207 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, z) -> f2(0, y, z) :|: TRUE f2(x1, x2, x3) -> f3(x1, 100, x3) :|: TRUE f3(x4, x5, x6) -> f4(x4, x5, x7) :|: TRUE f6(x8, x9, x10) -> f9(arith, x9, x10) :|: TRUE && arith = x8 + 1 f7(x35, x36, x37) -> f10(x38, x36, x37) :|: TRUE && x38 = x35 + 2 f5(x14, x15, x16) -> f6(x14, x15, x16) :|: x16 = 0 f5(x17, x18, x19) -> f7(x17, x18, x19) :|: x19 < 0 f5(x39, x40, x41) -> f7(x39, x40, x41) :|: x41 > 0 f9(x20, x21, x22) -> f8(x20, x21, x22) :|: TRUE f10(x23, x24, x25) -> f8(x23, x24, x25) :|: TRUE f4(x26, x27, x28) -> f5(x26, x27, x28) :|: x26 < 40 f8(x29, x30, x31) -> f4(x29, x30, x31) :|: TRUE f4(x32, x33, x34) -> f11(x32, x33, x34) :|: x32 >= 40 Start term: f1(x, y, z) ---------------------------------------- (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) (f7_3,7) (f10_3,8) (f5_3,9) (f8_3,10) (f11_3,11) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; assume(0 = 0); x0 := 0; x1 := oldX1; x2 := oldX2; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; assume(0 = 0); x0 := oldX0; x1 := 100; x2 := oldX2; TO: 3; FROM: 3; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX1; x2 := oldX3; TO: 4; FROM: 5; popout

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

job log

popout

actions

all output return to C_Integer