details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.32826 seconds
cpu usage	10.0251
user time	9.52664
system time	0.49848
max virtual memory	3.7206444E7
max residence set size	837896.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/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, 3 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1228 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(x, y, m) -> f2(x, 0, m) :|: TRUE f2(x1, x2, x3) -> f3(x1, x2, x4) :|: TRUE f3(x5, x6, x7) -> f4(x7, x6, x7) :|: TRUE f9(x8, x9, x10) -> f10(x8, arith, x10) :|: TRUE && arith = x9 + 1 f6(x11, x12, x13) -> f9(x11, x12, x13) :|: x12 <= x13 && x14 < 0 f6(x51, x52, x53) -> f9(x51, x52, x53) :|: x52 <= x53 && x54 > 0 f10(x15, x16, x17) -> f6(x15, x16, x17) :|: TRUE f6(x18, x19, x20) -> f11(x18, x19, x20) :|: x19 > x20 f6(x55, x56, x57) -> f11(x55, x56, x57) :|: x58 = 0 f11(x59, x60, x61) -> f12(x62, x60, x61) :|: TRUE && x62 = x59 - 1 f5(x25, x26, x27) -> f6(x25, x26, x27) :|: x28 < 0 f5(x63, x64, x65) -> f6(x63, x64, x65) :|: x66 > 0 f5(x29, x30, x31) -> f7(x29, x30, x31) :|: x32 = 0 f12(x33, x34, x35) -> f8(x33, x34, x35) :|: TRUE f7(x36, x37, x38) -> f8(x36, x37, x38) :|: TRUE f8(x67, x68, x69) -> f13(x67, x70, x69) :|: TRUE && x70 = x68 - 1 f4(x42, x43, x44) -> f5(x42, x43, x44) :|: x42 >= 0 && x43 >= 0 f13(x45, x46, x47) -> f4(x45, x46, x47) :|: TRUE f4(x48, x49, x50) -> f14(x48, x49, x50) :|: x48 < 0 f4(x71, x72, x73) -> f14(x71, x72, x73) :|: x72 < 0 Start term: f1(x, y, m) ---------------------------------------- (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) (f9_3,5) (f10_3,6) (f6_3,7) (f11_3,8) (f12_3,9) (f5_3,10) (f7_3,11) (f8_3,12) (f13_3,13) (f14_3,14) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := x2; assume(0 = 0); x0 := oldX0; x1 := 0; x2 := oldX2; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := x2; oldX3 := nondet(); assume(0 = 0); x0 := oldX0; x1 := oldX1; x2 := oldX3; TO: 3; FROM: 3; popout

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

job log

popout

actions

all output return to C_Integer