16.19/5.14 NO 16.19/5.15 proof of /export/starexec/sandbox/benchmark/theBenchmark.c 16.19/5.15 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 16.19/5.15 16.19/5.15 16.19/5.15 Termination of the given C Problem could be disproven: 16.19/5.15 16.19/5.15 (0) C Problem 16.19/5.15 (1) CToLLVMProof [EQUIVALENT, 164 ms] 16.19/5.15 (2) LLVM problem 16.19/5.15 (3) LLVMToTerminationGraphProof [EQUIVALENT, 760 ms] 16.19/5.15 (4) LLVM Symbolic Execution Graph 16.19/5.15 (5) SymbolicExecutionGraphToLassoProof [EQUIVALENT, 0 ms] 16.19/5.15 (6) LLVM Symbolic Execution Lasso 16.19/5.15 (7) Lasso2IRS [EQUIVALENT, 56 ms] 16.19/5.15 (8) IntTRS 16.19/5.15 (9) IRS2T2 [EQUIVALENT, 0 ms] 16.19/5.15 (10) T2IntSys 16.19/5.15 (11) T2 [COMPLETE, 1373 ms] 16.19/5.15 (12) NO 16.19/5.15 16.19/5.15 16.19/5.15 ---------------------------------------- 16.19/5.15 16.19/5.15 (0) 16.19/5.15 Obligation: 16.19/5.15 c file /export/starexec/sandbox/benchmark/theBenchmark.c 16.19/5.15 ---------------------------------------- 16.19/5.15 16.19/5.15 (1) CToLLVMProof (EQUIVALENT) 16.19/5.15 Compiled c-file /export/starexec/sandbox/benchmark/theBenchmark.c to LLVM. 16.19/5.15 ---------------------------------------- 16.19/5.15 16.19/5.15 (2) 16.19/5.15 Obligation: 16.19/5.15 LLVM Problem 16.19/5.15 16.19/5.15 Aliases: 16.19/5.15 16.19/5.15 Data layout: 16.19/5.15 16.19/5.15 "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" 16.19/5.16 16.19/5.16 Machine: 16.19/5.16 16.19/5.16 "x86_64-pc-linux-gnu" 16.19/5.16 16.19/5.16 Type definitions: 16.19/5.16 16.19/5.16 Global variables: 16.19/5.16 16.19/5.16 Function declarations and definitions: 16.19/5.16 16.19/5.16 *BasicFunctionTypename: "__VERIFIER_nondet_int" returnParam: i32 parameters: () variableLength: true visibilityType: DEFAULT callingConvention: ccc 16.19/5.16 *BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc 16.19/5.16 0: 16.19/5.16 %1 = alloca i32, align 4 16.19/5.16 %x = alloca i32, align 4 16.19/5.16 %y = alloca i32, align 4 16.19/5.16 store 0, %1 16.19/5.16 %2 = call i32 (...)* @__VERIFIER_nondet_int() 16.19/5.16 store %2, %x 16.19/5.16 %3 = call i32 (...)* @__VERIFIER_nondet_int() 16.19/5.16 store %3, %y 16.19/5.16 br %4 16.19/5.16 4: 16.19/5.16 %5 = load %x 16.19/5.16 %6 = icmp slt %5 10 16.19/5.16 br %6, %7, %12 16.19/5.16 7: 16.19/5.16 %8 = load %y 16.19/5.16 %9 = sub 0 %8 16.19/5.16 store %9, %x 16.19/5.16 %10 = load %y 16.19/5.16 %11 = add %10 1 16.19/5.16 store %11, %y 16.19/5.16 br %4 16.19/5.16 12: 16.19/5.16 ret 0 16.19/5.16 16.19/5.16 16.19/5.16 Analyze Termination of all function calls matching the pattern: 16.19/5.16 main() 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (3) LLVMToTerminationGraphProof (EQUIVALENT) 16.19/5.16 Constructed symbolic execution graph for LLVM program and proved memory safety. 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (4) 16.19/5.16 Obligation: 16.19/5.16 SE Graph 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (5) SymbolicExecutionGraphToLassoProof (EQUIVALENT) 16.19/5.16 Converted SEGraph to 1 independent lasso. 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (6) 16.19/5.16 Obligation: 16.19/5.16 Lasso 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (7) Lasso2IRS (EQUIVALENT) 16.19/5.16 Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 16.19/5.16 Generated rules. Obtained 34 rulesP rules: 16.19/5.16 f_117(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 4) -> f_118(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: v45 < 10 && 0 <= 9 + v44 && 0 <= 8 + v46 16.19/5.16 f_118(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_120(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0 16.19/5.16 f_120(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_122(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) :|: TRUE 16.19/5.16 f_122(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 8, 4) -> f_124(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0 16.19/5.16 f_124(v37, v38, v39, v40, v41, v45, 1, v46, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_125(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: v51 + v46 = 0 && v51 <= 8 16.19/5.16 f_125(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_126(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) :|: TRUE 16.19/5.16 f_126(v37, v38, v39, v40, v41, v45, 1, v46, v51, v44, v47, v48, v49, 0, 3, 9, 8, 4) -> f_127(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 9, 8, 4) :|: 0 = 0 16.19/5.16 f_127(v37, v38, v39, v40, v41, v45, 1, v46, v51, v47, v48, v49, 0, 3, 9, 8, 4) -> f_128(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: v53 = 1 + v46 && 0 <= 7 + v53 16.19/5.16 f_128(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_129(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: TRUE 16.19/5.16 f_129(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_130(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) :|: TRUE 16.19/5.16 f_130(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 8, 4, 7) -> f_116(v37, v38, v39, v40, v41, v45, 1, v46, v51, v53, v47, v48, v49, 0, 3, 9, 4) :|: TRUE 16.19/5.16 f_116(v37, v38, v39, v40, v41, v42, 1, v44, v45, v46, v47, v48, v49, 0, 3, 9, 4) -> f_117(v37, v38, v39, v40, v41, v45, 1, v44, v46, v47, v48, v49, 0, 3, 9, 4) :|: 0 = 0 16.19/5.16 f_63 -> f_64(v1, v2, 3, 1, 4) :|: 1 <= v1 && v2 = 3 + v1 && 4 <= v2 16.19/5.16 f_64(v1, v2, 3, 1, 4) -> f_65(v1, v3, v2, v4, 3, 1, 4) :|: 1 <= v3 && v4 = 3 + v3 && 4 <= v4 16.19/5.16 f_65(v1, v3, v2, v4, 3, 1, 4) -> f_66(v1, v3, v5, v2, v4, v6, 3, 1, 4) :|: 1 <= v5 && v6 = 3 + v5 && 4 <= v6 16.19/5.16 f_66(v1, v3, v5, v2, v4, v6, 3, 1, 4) -> f_67(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_67(v1, v3, v5, v2, v4, v6, 0, 3, 1, 4) -> f_68(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_68(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_69(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_69(v1, v3, v5, v7, v2, v4, v6, 0, 3, 1, 4) -> f_70(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_70(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_71(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_71(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_72(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: TRUE 16.19/5.16 f_72(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) :|: 0 = 0 16.19/5.16 f_73(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4) -> f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4, 9) :|: v7 < 10 16.19/5.16 f_74(v1, v3, v5, v7, v9, v2, v4, v6, 0, 3, 1, 4, 9) -> f_76(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0 16.19/5.16 f_76(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_78(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: TRUE 16.19/5.16 f_78(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_80(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0 16.19/5.16 f_80(v1, v3, v5, v7, v9, 1, v2, v4, v6, 0, 3, 4, 9) -> f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: v11 + v9 = 0 16.19/5.16 f_81(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: TRUE 16.19/5.16 f_82(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_83(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) :|: 0 = 0 16.19/5.16 f_83(v1, v3, v5, v7, v9, 1, v11, v2, v4, v6, 0, 3, 4, 9) -> f_84(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: v13 = 1 + v9 16.19/5.16 f_84(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_85(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: TRUE 16.19/5.16 f_85(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_86(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) :|: TRUE 16.19/5.16 f_86(v1, v3, v5, v7, v9, 1, v11, v13, v2, v4, v6, 0, 3, 4, 9) -> f_101(v1, v3, v5, v7, v9, v7, 1, v9, v11, v13, v2, v4, v6, 0, 3, 9, 4) :|: TRUE 16.19/5.16 f_101(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 9, 4) -> f_116(v19, v20, v21, v22, v23, v24, 1, v26, v27, v28, v29, v30, v31, 0, 3, 9, 4) :|: TRUE 16.19/5.16 Combined rules. Obtained 2 rulesP rules: 16.19/5.16 f_63 -> f_117(v1:0, v3:0, v5:0, v7:0, v9:0, v11:0, 1, v9:0, 1 + v9:0, 3 + v1:0, 3 + v3:0, 3 + v5:0, 0, 3, 9, 4) :|: v3:0 > 0 && v1:0 > 0 && v5:0 > 0 && v11:0 + v9:0 = 0 && v7:0 < 10 16.19/5.16 f_117(v37:0, v38:0, v39:0, v40:0, v41:0, v45:0, 1, v44:0, v46:0, v47:0, v48:0, v49:0, 0, 3, 9, 4) -> f_117(v37:0, v38:0, v39:0, v40:0, v41:0, v51:0, 1, v46:0, 1 + v46:0, v47:0, v48:0, v49:0, 0, 3, 9, 4) :|: v44:0 > -10 && v45:0 < 10 && v46:0 > -9 && v51:0 < 9 && v51:0 + v46:0 = 0 16.19/5.16 Filtered unneeded arguments: 16.19/5.16 f_117(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_117(x6, x8, x9) 16.19/5.16 Removed division, modulo operations, cleaned up constraints. Obtained 2 rules.P rules: 16.19/5.16 f_63 -> f_117(v11:0, v9:0, 1 + v9:0) :|: v11:0 + v9:0 = 0 16.19/5.16 f_117(v45:0, v44:0, v46:0) -> f_117(v51:0, v46:0, 1 + v46:0) :|: v45:0 < 10 && v44:0 > -10 && v46:0 > -9 && v51:0 + v46:0 = 0 && v51:0 < 9 16.19/5.16 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (8) 16.19/5.16 Obligation: 16.19/5.16 Rules: 16.19/5.16 f_63 -> f_117(v11:0, v9:0, 1 + v9:0) :|: v11:0 + v9:0 = 0 16.19/5.16 f_117(v45:0, v44:0, v46:0) -> f_117(v51:0, v46:0, 1 + v46:0) :|: v45:0 < 10 && v44:0 > -10 && v46:0 > -9 && v51:0 + v46:0 = 0 && v51:0 < 9 16.19/5.16 Start term: f_63 16.19/5.16 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (9) IRS2T2 (EQUIVALENT) 16.19/5.16 Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs: 16.19/5.16 16.19/5.16 (f_63_3,1) 16.19/5.16 (f_117_3,2) 16.19/5.16 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (10) 16.19/5.16 Obligation: 16.19/5.16 START: 1; 16.19/5.16 16.19/5.16 FROM: 1; 16.19/5.16 oldX0 := x0; 16.19/5.16 oldX1 := x1; 16.19/5.16 oldX2 := x2; 16.19/5.16 oldX3 := nondet(); 16.19/5.16 oldX4 := nondet(); 16.19/5.16 assume(oldX3 + oldX4 = 0); 16.19/5.16 x0 := oldX3; 16.19/5.16 x1 := oldX4; 16.19/5.16 x2 := 1 + oldX4; 16.19/5.16 TO: 2; 16.19/5.16 16.19/5.16 FROM: 2; 16.19/5.16 oldX0 := x0; 16.19/5.16 oldX1 := x1; 16.19/5.16 oldX2 := x2; 16.19/5.16 oldX3 := -(oldX2 - 0); 16.19/5.16 assume(oldX0 < 10 && oldX1 > -10 && oldX2 > -9 && oldX3 + oldX2 = 0 && oldX3 < 9); 16.19/5.16 x0 := -(oldX2 - 0); 16.19/5.16 x1 := oldX2; 16.19/5.16 x2 := 1 + oldX2; 16.19/5.16 TO: 2; 16.19/5.16 16.19/5.16 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (11) T2 (COMPLETE) 16.19/5.16 Found this recurrent set for cutpoint 5: oldX3+oldX4 <= 0 and 0 <= oldX3+oldX4 and x0-oldX3 <= 0 and 0 <= oldX3+x1 and 1 <= oldX3+x2 and oldX4+x0 <= 0 and oldX4-x1 <= 0 and oldX4-x2 <= -1 and x0+x1 <= 0 and 0 <= x0+x1 and x0+x2 <= 1 and 1 <= x0+x2 and x1-x2 <= -1 and x2-x1 <= 1 and x0+-9 <= 0 and -x1+-9 <= 0 and -x2+-8 <= 0 16.19/5.16 16.19/5.16 ---------------------------------------- 16.19/5.16 16.19/5.16 (12) 16.19/5.16 NO 16.40/5.22 EOF