8.28/3.04 YES 8.28/3.05 proof of /export/starexec/sandbox2/benchmark/theBenchmark.c 8.28/3.05 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.28/3.05 8.28/3.05 8.28/3.05 Termination of the given C Problem could be proven: 8.28/3.05 8.28/3.05 (0) C Problem 8.28/3.05 (1) CToLLVMProof [EQUIVALENT, 168 ms] 8.28/3.05 (2) LLVM problem 8.28/3.05 (3) LLVMToTerminationGraphProof [EQUIVALENT, 580 ms] 8.28/3.05 (4) LLVM Symbolic Execution Graph 8.28/3.05 (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] 8.28/3.05 (6) LLVM Symbolic Execution SCC 8.28/3.05 (7) SCC2IRS [SOUND, 40 ms] 8.28/3.05 (8) IntTRS 8.28/3.05 (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] 8.28/3.05 (10) IntTRS 8.28/3.05 (11) RankingReductionPairProof [EQUIVALENT, 0 ms] 8.28/3.05 (12) YES 8.28/3.05 8.28/3.05 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (0) 8.28/3.05 Obligation: 8.28/3.05 c file /export/starexec/sandbox2/benchmark/theBenchmark.c 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (1) CToLLVMProof (EQUIVALENT) 8.28/3.05 Compiled c-file /export/starexec/sandbox2/benchmark/theBenchmark.c to LLVM. 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (2) 8.28/3.05 Obligation: 8.28/3.05 LLVM Problem 8.28/3.05 8.28/3.05 Aliases: 8.28/3.05 8.28/3.05 Data layout: 8.28/3.05 8.28/3.05 "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" 8.28/3.05 8.28/3.05 Machine: 8.28/3.05 8.28/3.05 "x86_64-pc-linux-gnu" 8.28/3.05 8.28/3.05 Type definitions: 8.28/3.05 8.28/3.05 Global variables: 8.28/3.05 8.28/3.05 Function declarations and definitions: 8.28/3.05 8.28/3.05 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.28/3.05 *BasicFunctionTypename: "malloc" returnParam: *i8 parameters: (i64) variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.28/3.05 *BasicFunctionTypename: "__VERIFIER_nondet_String" linkageType: EXTERNALLY_VISIBLE returnParam: *i8 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.28/3.05 0: 8.28/3.05 %length = alloca i32, align 4 8.28/3.05 %nondetString = alloca *i8, align 8 8.28/3.05 %1 = call i32 @__VERIFIER_nondet_int() 8.28/3.05 store %1, %length 8.28/3.05 %2 = load %length 8.28/3.05 %3 = icmp slt %2 1 8.28/3.05 br %3, %4, %5 8.28/3.05 4: 8.28/3.05 store 1, %length 8.28/3.05 br %5 8.28/3.05 5: 8.28/3.05 %6 = load %length 8.28/3.05 %7 = sext i32 %6 to i64 8.28/3.05 %8 = mul %7 1 8.28/3.05 %9 = call *i8 @malloc(i64 %8) 8.28/3.05 store %9, %nondetString 8.28/3.05 %10 = load %length 8.28/3.05 %11 = sub %10 1 8.28/3.05 %12 = sext i32 %11 to i64 8.28/3.05 %13 = load %nondetString 8.28/3.05 %14 = getelementptr %13, %12 8.28/3.05 store 0, %14 8.28/3.05 %15 = load %nondetString 8.28/3.05 ret %15 8.28/3.05 8.28/3.05 *BasicFunctionTypename: "cstrlen" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (s *i8) variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.28/3.05 0: 8.28/3.05 %1 = alloca *i8, align 8 8.28/3.05 %p = alloca *i8, align 8 8.28/3.05 store %s, %1 8.28/3.05 %2 = load %1 8.28/3.05 store %2, %p 8.28/3.05 br %3 8.28/3.05 3: 8.28/3.05 %4 = load %p 8.28/3.05 %5 = load %4 8.28/3.05 %6 = sext i8 %5 to i32 8.28/3.05 %7 = icmp ne %6 0 8.28/3.05 br %7, %8, %11 8.28/3.05 8: 8.28/3.05 %9 = load %p 8.28/3.05 %10 = getelementptr %9, 1 8.28/3.05 store %10, %p 8.28/3.05 br %3 8.28/3.05 11: 8.28/3.05 %12 = load %p 8.28/3.05 %13 = load %1 8.28/3.05 %14 = ptrtoint *i8 %12 to i64 8.28/3.05 %15 = ptrtoint *i8 %13 to i64 8.28/3.05 %16 = sub %14 %15 8.28/3.05 %17 = trunc i64 %16 to i32 8.28/3.05 ret %17 8.28/3.05 8.28/3.05 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 8.28/3.05 0: 8.28/3.05 %1 = alloca i32, align 4 8.28/3.05 store 0, %1 8.28/3.05 %2 = call *i8 @__VERIFIER_nondet_String() 8.28/3.05 %3 = call i32 @cstrlen(*i8 %2) 8.28/3.05 ret %3 8.28/3.05 8.28/3.05 8.28/3.05 Analyze Termination of all function calls matching the pattern: 8.28/3.05 main() 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (3) LLVMToTerminationGraphProof (EQUIVALENT) 8.28/3.05 Constructed symbolic execution graph for LLVM program and proved memory safety. 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (4) 8.28/3.05 Obligation: 8.28/3.05 SE Graph 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (5) SymbolicExecutionGraphToSCCProof (SOUND) 8.28/3.05 Splitted symbolic execution graph to 1 SCC. 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (6) 8.28/3.05 Obligation: 8.28/3.05 SCC 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (7) SCC2IRS (SOUND) 8.28/3.05 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 8.28/3.05 Generated rules. Obtained 11 rulesP rules: 8.28/3.05 f_218(v38, v39, v40, v44, v42, 1, v41, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) -> f_219(v38, v39, v40, v44, v52, v42, 1, v41, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) :|: TRUE 8.28/3.05 f_219(v38, v39, v40, v44, v52, v42, 1, v41, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) -> f_220(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) :|: 0 = 0 8.28/3.05 f_220(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) -> f_221(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) :|: v52 != 0 && v44 < v47 && 3 <= v47 8.28/3.05 f_221(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) -> f_223(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) :|: 0 = 0 8.28/3.05 f_223(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) -> f_225(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) :|: TRUE 8.28/3.05 f_225(v38, v39, v40, v44, v52, 1, v41, v45, v46, v47, v48, v49, v50, v42, 0, 3, 7, 2, 4, 8) -> f_227(v38, v39, v40, v44, v52, 1, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) :|: 0 = 0 8.28/3.05 f_227(v38, v39, v40, v44, v52, 1, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) -> f_229(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) :|: v54 = 1 + v44 && 3 <= v54 8.28/3.05 f_229(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) -> f_231(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) :|: TRUE 8.28/3.05 f_231(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) -> f_233(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) :|: TRUE 8.28/3.05 f_233(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, v41, v42, 0, 3, 7, 2, 4, 8) -> f_217(v38, v39, v40, v44, v52, 1, v54, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) :|: TRUE 8.28/3.05 f_217(v38, v39, v40, v41, v42, 1, v44, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) -> f_218(v38, v39, v40, v44, v42, 1, v41, v45, v46, v47, v48, v49, v50, 0, 3, 7, 2, 4, 8) :|: 0 = 0 8.28/3.05 Combined rules. Obtained 2 rulesP rules: 8.28/3.05 f_218(v38:0, v39:0, v40:0, v44:0, v42:0, 1, v41:0, v45:0, v46:0, v47:0, v48:0, v49:0, v50:0, 0, 3, 7, 2, 4, 8) -> f_218(v38:0, v39:0, v40:0, 1 + v44:0, v52:0, 1, v44:0, v45:0, v46:0, v47:0, v48:0, v49:0, v50:0, 0, 3, 7, 2, 4, 8) :|: v47:0 > v44:0 && v52:0 < 0 && v44:0 > 1 && v47:0 > 2 8.28/3.05 f_218(v38:0, v39:0, v40:0, v44:0, v42:0, 1, v41:0, v45:0, v46:0, v47:0, v48:0, v49:0, v50:0, 0, 3, 7, 2, 4, 8) -> f_218(v38:0, v39:0, v40:0, 1 + v44:0, v52:0, 1, v44:0, v45:0, v46:0, v47:0, v48:0, v49:0, v50:0, 0, 3, 7, 2, 4, 8) :|: v47:0 > v44:0 && v52:0 > 0 && v44:0 > 1 && v47:0 > 2 8.28/3.05 Filtered unneeded arguments: 8.28/3.05 f_218(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_218(x4, x10) 8.28/3.05 Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: 8.28/3.05 f_218(v44:0, v47:0) -> f_218(1 + v44:0, v47:0) :|: v44:0 > 1 && v47:0 > 2 && v47:0 > v44:0 8.28/3.05 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (8) 8.28/3.05 Obligation: 8.28/3.05 Rules: 8.28/3.05 f_218(v44:0, v47:0) -> f_218(1 + v44:0, v47:0) :|: v44:0 > 1 && v47:0 > 2 && v47:0 > v44:0 8.28/3.05 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (9) IntTRSCompressionProof (EQUIVALENT) 8.28/3.05 Compressed rules. 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (10) 8.28/3.05 Obligation: 8.28/3.05 Rules: 8.28/3.05 f_218(v44:0:0, v47:0:0) -> f_218(1 + v44:0:0, v47:0:0) :|: v44:0:0 > 1 && v47:0:0 > 2 && v47:0:0 > v44:0:0 8.28/3.05 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (11) RankingReductionPairProof (EQUIVALENT) 8.28/3.05 Interpretation: 8.28/3.05 [ f_218 ] = -1*f_218_1 + f_218_2 8.28/3.05 8.28/3.05 The following rules are decreasing: 8.28/3.05 f_218(v44:0:0, v47:0:0) -> f_218(1 + v44:0:0, v47:0:0) :|: v44:0:0 > 1 && v47:0:0 > 2 && v47:0:0 > v44:0:0 8.28/3.05 8.28/3.05 The following rules are bounded: 8.28/3.05 f_218(v44:0:0, v47:0:0) -> f_218(1 + v44:0:0, v47:0:0) :|: v44:0:0 > 1 && v47:0:0 > 2 && v47:0:0 > v44:0:0 8.28/3.05 8.28/3.05 8.28/3.05 ---------------------------------------- 8.28/3.05 8.28/3.05 (12) 8.28/3.05 YES 8.28/3.08 EOF