details

property	value
status	complete
benchmark	data_structures_set_multi_proc_false-unreach-call_ground.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n139.star.cs.uiowa.edu
space	SV-COMP_Mixed_Categories

run statistics

property	value
solver	AProVE
configuration	c
runtime (wallclock)	76.5077 seconds
cpu usage	169.232
user time	165.866
system time	3.36633
max virtual memory	2.8685004E7
max residence set size	5206144.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) CToLLVMProof [EQUIVALENT, 176 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 59.6 s] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) AND (7) LLVM Symbolic Execution SCC (8) SCC2IRS [SOUND, 236 ms] (9) IntTRS (10) IRS2T2 [EQUIVALENT, 0 ms] (11) T2IntSys (12) T2 [EQUIVALENT, 1083 ms] (13) YES (14) LLVM Symbolic Execution SCC (15) SCC2IRS [SOUND, 218 ms] (16) IntTRS (17) IRS2T2 [EQUIVALENT, 0 ms] (18) T2IntSys (19) T2 [EQUIVALENT, 966 ms] (20) YES (21) LLVM Symbolic Execution SCC (22) SCC2IRS [SOUND, 412 ms] (23) IntTRS (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] (25) IntTRS (26) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (27) IntTRS (28) PolynomialOrderProcessor [EQUIVALENT, 30 ms] (29) AND (30) IntTRS (31) IntTRSCompressionProof [EQUIVALENT, 0 ms] (32) IntTRS (33) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (36) YES (37) IntTRS (38) TerminationGraphProcessor [EQUIVALENT, 2 ms] (39) IntTRS (40) IntTRSCompressionProof [EQUIVALENT, 0 ms] (41) IntTRS (42) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (43) IntTRS (44) RankingReductionPairProof [EQUIVALENT, 5 ms] (45) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox2/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. ---------------------------------------- (2) Obligation: LLVM Problem Aliases: Data layout: "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" Machine: "x86_64-pc-linux-gnu" Type definitions: Global variables: Function declarations and definitions: *BasicFunctionTypename: "__VERIFIER_error" returnParam: BasicVoidType parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc *BasicFunctionTypename: "__VERIFIER_assert" linkageType: EXTERNALLY_VISIBLE returnParam: BasicVoidType parameters: (cond i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 store %cond, %1 %2 = load %1 %3 = icmp ne %2 0 br %3, %6, %4 4: br %5 5: Unnamed Call-Instruction = call BasicVoidType (...)* @__VERIFIER_error() noreturn unreachable 6: popout

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

job log

popout

actions

all output return to C