details

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

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	3.78904 seconds
cpu usage	10.9124
user time	10.3423
system time	0.570137
max virtual memory	3.7903728E7
max residence set size	934368.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, 0 ms] (4) T2IntSys (5) T2 [EQUIVALENT, 1667 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(a, b) -> f2(x_1, b) :|: TRUE f2(x, x1) -> f3(x, x2) :|: TRUE f6(x3, x4) -> f9(x3, arith) :|: TRUE && arith = x4 + 7 f7(x43, x44) -> f10(x43, x45) :|: TRUE && x45 = x44 + 2 f5(x7, x8) -> f6(x7, x8) :|: x8 > 5 f5(x9, x10) -> f7(x9, x10) :|: x10 <= 5 f9(x11, x12) -> f8(x11, x12) :|: TRUE f10(x13, x14) -> f8(x13, x14) :|: TRUE f11(x46, x47) -> f14(x48, x47) :|: TRUE && x48 = x46 + 10 f12(x49, x50) -> f15(x51, x50) :|: TRUE && x51 = x49 + 1 f8(x19, x20) -> f11(x19, x20) :|: x20 >= 10 && x20 <= 12 f8(x21, x22) -> f12(x21, x22) :|: x22 < 10 f8(x52, x53) -> f12(x52, x53) :|: x53 > 12 f14(x23, x24) -> f13(x23, x24) :|: TRUE f15(x25, x26) -> f13(x25, x26) :|: TRUE f4(x27, x28) -> f5(x27, x28) :|: x28 < x27 f13(x29, x30) -> f4(x29, x30) :|: TRUE f4(x31, x32) -> f16(x31, x32) :|: x32 >= x31 f16(x54, x55) -> f17(x56, x55) :|: TRUE && x56 = x54 + 2 f17(x57, x58) -> f18(x57, x59) :|: TRUE && x59 = x58 - 10 f3(x37, x38) -> f4(x37, x38) :|: x37 < 30 f18(x39, x40) -> f3(x39, x40) :|: TRUE f3(x41, x42) -> f19(x41, x42) :|: x41 >= 30 Start term: f1(a, b) ---------------------------------------- (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) (f6_2,4) (f9_2,5) (f7_2,6) (f10_2,7) (f5_2,8) (f8_2,9) (f11_2,10) (f14_2,11) (f12_2,12) (f15_2,13) (f13_2,14) (f4_2,15) (f16_2,16) (f17_2,17) (f18_2,18) (f19_2,19) ---------------------------------------- (4) Obligation: START: 1; FROM: 1; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); x0 := oldX2; x1 := oldX1; TO: 2; FROM: 2; oldX0 := x0; oldX1 := x1; oldX2 := nondet(); assume(0 = 0); popout

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

job log

popout

actions

all output return to C_Integer