/export/starexec/sandbox/solver/bin/starexec_run_c /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.c # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Termination of the given C Problem could be proven: (0) C Problem (1) CToLLVMProof [EQUIVALENT, 179 ms] (2) LLVM problem (3) LLVMToTerminationGraphProof [EQUIVALENT, 395 ms] (4) LLVM Symbolic Execution Graph (5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms] (6) LLVM Symbolic Execution SCC (7) SCC2IRS [SOUND, 56 ms] (8) IntTRS (9) IntTRSCompressionProof [EQUIVALENT, 0 ms] (10) IntTRS (11) RankingReductionPairProof [EQUIVALENT, 25 ms] (12) YES ---------------------------------------- (0) Obligation: c file /export/starexec/sandbox/benchmark/theBenchmark.c ---------------------------------------- (1) CToLLVMProof (EQUIVALENT) Compiled c-file /export/starexec/sandbox/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: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 0: %1 = alloca i32, align 4 %a = alloca [1048 x i32], align 16 store 0, %1 br %2 2: %3 = getelementptr %a, 0, 3 %4 = load %3 %5 = icmp sge %4 0 br %5, %6, %11 6: %7 = getelementptr %a, 0, 3 %8 = load %7 %9 = sub %8 1 %10 = getelementptr %a, 0, 3 store %9, %10 br %2 11: ret 0 Analyze Termination of all function calls matching the pattern: main() ---------------------------------------- (3) LLVMToTerminationGraphProof (EQUIVALENT) Constructed symbolic execution graph for LLVM program and proved memory safety. ---------------------------------------- (4) Obligation: SE Graph ---------------------------------------- (5) SymbolicExecutionGraphToSCCProof (SOUND) Splitted symbolic execution graph to 1 SCC. ---------------------------------------- (6) Obligation: SCC ---------------------------------------- (7) SCC2IRS (SOUND) Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: Generated rules. Obtained 12 rulesP rules: f_66(v1, v3, v5, v6, 1, v8, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_67(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: 0 = 0 f_67(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_68(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: 0 <= v8 && 1 <= v6 f_68(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_70(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: 0 = 0 f_70(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_72(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: TRUE f_72(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_74(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: v5 = 12 + v3 f_74(v1, v3, v5, v8, 1, v6, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_75(v1, v3, v5, v8, 1, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: 0 = 0 f_75(v1, v3, v5, v8, 1, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_76(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: 1 + v10 = v8 && 0 <= 1 + v10 f_76(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_77(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: v5 = 12 + v3 f_77(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_78(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: TRUE f_78(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_79(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: TRUE f_79(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_65(v1, v3, v5, v8, 1, v10, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: TRUE f_65(v1, v3, v5, v6, 1, v8, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) -> f_66(v1, v3, v5, v6, 1, v8, v2, v4, 0, 3, 4191, 12, 4, 4192, 13) :|: v5 = 12 + v3 Combined rules. Obtained 1 rulesP rules: f_66(v1:0, v3:0, 12 + v3:0, v6:0, 1, 1 + v10:0, v2:0, v4:0, 0, 3, 4191, 12, 4, 4192, 13) -> f_66(v1:0, v3:0, 12 + v3:0, 1 + v10:0, 1, v10:0, v2:0, v4:0, 0, 3, 4191, 12, 4, 4192, 13) :|: v6:0 > 0 && v10:0 > -2 Filtered unneeded arguments: f_66(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15) -> f_66(x2, x3, x4, x6) Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules: f_66(v3:0, sum~cons_12~v3:0, v6:0, sum~cons_1~v10:0) -> f_66(v3:0, 12 + v3:0, 1 + v10:0, v10:0) :|: v6:0 > 0 && v10:0 > -2 && sum~cons_12~v3:0 = 12 + v3:0 && sum~cons_1~v10:0 = 1 + v10:0 ---------------------------------------- (8) Obligation: Rules: f_66(v3:0, sum~cons_12~v3:0, v6:0, sum~cons_1~v10:0) -> f_66(v3:0, 12 + v3:0, 1 + v10:0, v10:0) :|: v6:0 > 0 && v10:0 > -2 && sum~cons_12~v3:0 = 12 + v3:0 && sum~cons_1~v10:0 = 1 + v10:0 ---------------------------------------- (9) IntTRSCompressionProof (EQUIVALENT) Compressed rules. ---------------------------------------- (10) Obligation: Rules: f_66(v3:0:0, sum~cons_12~v3:0:0, v6:0:0, sum~cons_1~v10:0:0) -> f_66(v3:0:0, 12 + v3:0:0, 1 + v10:0:0, v10:0:0) :|: v6:0:0 > 0 && v10:0:0 > -2 && sum~cons_12~v3:0:0 = 12 + v3:0:0 && sum~cons_1~v10:0:0 = 1 + v10:0:0 ---------------------------------------- (11) RankingReductionPairProof (EQUIVALENT) Interpretation: [ f_66 ] = f_66_4 The following rules are decreasing: f_66(v3:0:0, sum~cons_12~v3:0:0, v6:0:0, sum~cons_1~v10:0:0) -> f_66(v3:0:0, 12 + v3:0:0, 1 + v10:0:0, v10:0:0) :|: v6:0:0 > 0 && v10:0:0 > -2 && sum~cons_12~v3:0:0 = 12 + v3:0:0 && sum~cons_1~v10:0:0 = 1 + v10:0:0 The following rules are bounded: f_66(v3:0:0, sum~cons_12~v3:0:0, v6:0:0, sum~cons_1~v10:0:0) -> f_66(v3:0:0, 12 + v3:0:0, 1 + v10:0:0, v10:0:0) :|: v6:0:0 > 0 && v10:0:0 > -2 && sum~cons_12~v3:0:0 = 12 + v3:0:0 && sum~cons_1~v10:0:0 = 1 + v10:0:0 ---------------------------------------- (12) YES