/export/starexec/sandbox2/solver/bin/starexec_run_c /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox2/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, 177 ms]
(2) LLVM problem
(3) LLVMToTerminationGraphProof [EQUIVALENT, 3407 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 46 ms]
        (9) IntTRS
        (10) IRS2T2 [EQUIVALENT, 0 ms]
        (11) T2IntSys
        (12) T2 [EQUIVALENT, 994 ms]
        (13) YES
    (14) LLVM Symbolic Execution SCC
        (15) SCC2IRS [SOUND, 40 ms]
        (16) IntTRS
        (17) IRS2T2 [EQUIVALENT, 0 ms]
        (18) T2IntSys
        (19) T2 [EQUIVALENT, 983 ms]
        (20) YES
    (21) LLVM Symbolic Execution SCC
        (22) SCC2IRS [SOUND, 72 ms]
        (23) IntTRS
        (24) IRS2T2 [EQUIVALENT, 0 ms]
        (25) T2IntSys
        (26) T2 [EQUIVALENT, 912 ms]
        (27) 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_nondet_int" returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
*BasicFunctionTypename: "test_fun" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: (x i32, y i32, z i32) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%3 = alloca i32, align 4
		%c = alloca i32, align 4
		store %x, %1
		store %y, %2
		store %z, %3
		store 0, %c
		br %4
	4:
		%5 = load %1
		%6 = load %3
		%7 = icmp sgt %5 %6
		br %7, %8, %23
	8:
		br %9
	9:
		%10 = load %2
		%11 = load %3
		%12 = icmp sgt %10 %11
		br %12, %13, %18
	13:
		%14 = load %2
		%15 = sub %14 1
		store %15, %2
		%16 = load %c
		%17 = add %16 1
		store %17, %c
		br %9
	18:
		%19 = load %c
		%20 = add %19 1
		store %20, %c
		%21 = load %1
		%22 = sub %21 1
		store %22, %1
		br %4
	23:
		%24 = load %c
		ret %24

*BasicFunctionTypename: "main" linkageType: EXTERNALLY_VISIBLE returnParam: i32 parameters: () variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		store 0, %1
		%2 = call i32 @__VERIFIER_nondet_int()
		%3 = call i32 @__VERIFIER_nondet_int()
		%4 = call i32 @__VERIFIER_nondet_int()
		%5 = call i32 @test_fun(i32 %2, i32 %3, i32 %4)
		ret %5


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 3 SCCs.
----------------------------------------

(6)
Complex Obligation (AND)

----------------------------------------

(7)
Obligation:
SCC
----------------------------------------

(8) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 18 rulesP rules:
f_491(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_492(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_492(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_493(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: v681 < v694
f_493(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_495(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_495(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_497(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_497(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_499(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_499(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_501(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_501(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_503(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_503(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_504(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_504(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_505(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_505(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_506(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_506(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_507(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: v756 = 1 + v693 && 3 <= v756
f_507(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_508(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_508(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_509(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
f_509(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_510(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 1 + v758 = v694
f_510(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_511(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_511(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_512(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_512(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_490(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v693, v756, v758, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: TRUE
f_490(v679, v680, v681, v682, v683, v684, v685, v686, 1, 0, v689, v690, v691, v692, v693, v694, v695, v696, v697, v698, v699, v700, 3, 2, 4) -> f_491(v679, v680, v681, v682, v683, v684, v685, v694, 1, 0, v689, v690, v691, v692, v693, v686, v695, v696, v697, v698, v699, v700, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_491(v679:0, v680:0, v681:0, v682:0, v683:0, v684:0, v685:0, 1 + v758:0, 1, 0, v689:0, v690:0, v691:0, v692:0, v693:0, v686:0, v695:0, v696:0, v697:0, v698:0, v699:0, v700:0, 3, 2, 4) -> f_491(v679:0, v680:0, v681:0, v682:0, v683:0, v684:0, v685:0, v758:0, 1, 0, v689:0, v690:0, v691:0, v693:0, 1 + v693:0, 1 + v758:0, v695:0, v696:0, v697:0, v698:0, v699:0, v700:0, 3, 2, 4) :|: v693:0 > 1 && v681:0 < 1 + v758:0
Filtered unneeded arguments:
   f_491(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21, x22, x23, x24, x25) -> f_491(x3, x8, x15)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_491(v681:0, sum~cons_1~v758:0, v693:0) -> f_491(v681:0, v758:0, 1 + v693:0) :|: v693:0 > 1 && v681:0 < 1 + v758:0 && sum~cons_1~v758:0 = 1 + v758:0

----------------------------------------

(9)
Obligation:
Rules:
f_491(v681:0, sum~cons_1~v758:0, v693:0) -> f_491(v681:0, v758:0, 1 + v693:0) :|: v693:0 > 1 && v681:0 < 1 + v758:0 && sum~cons_1~v758:0 = 1 + v758:0

----------------------------------------

(10) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_491_3,1)

----------------------------------------

(11)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := oldX1 - 1;
assume(oldX2 > 1 && oldX0 < 1 + oldX3 && oldX1 = 1 + oldX3);
x0 := oldX0;
x1 := oldX1 - 1;
x2 := 1 + oldX2;
TO: 1;


----------------------------------------

(12) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 1, 3, 4 using the following rank functions:
    - Rank function 1:
      RF for loc. 5: -x0+x1
      RF for loc. 6: -x0+x1
      Bound for (chained) transitions 3: 1
    - Rank function 2:
      RF for loc. 5: 1-2*x0+2*x1
      RF for loc. 6: -2*x0+2*x1
      Bound for (chained) transitions 4: 2
    - Rank function 3:
      RF for loc. 5: 0
      RF for loc. 6: -1
      Bound for (chained) transitions 1: 0

----------------------------------------

(13)
YES

----------------------------------------

(14)
Obligation:
SCC
----------------------------------------

(15) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 18 rulesP rules:
f_442(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_444(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_444(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_446(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: v491 < v501
f_446(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_450(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_450(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_453(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: TRUE
f_453(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_456(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: TRUE
f_456(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_460(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_460(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_464(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_464(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_467(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_467(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_470(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: TRUE
f_470(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_473(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
f_473(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) -> f_475(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v496, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: v610 = 1 + v500 && 2 <= v610
f_475(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v496, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_477(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v496, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: TRUE
f_477(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v496, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_479(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: 0 = 0
f_479(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_481(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: 1 + v630 = v501
f_481(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_483(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: TRUE
f_483(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_485(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) :|: TRUE
f_485(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4, 2) -> f_440(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v500, v610, v630, v502, v503, v504, v505, v506, v507, 3, 4) :|: TRUE
f_440(v489, v490, v491, v492, v493, v494, v495, v496, 1, 0, v499, v500, v501, v502, v503, v504, v505, v506, v507, 3, 4) -> f_442(v489, v490, v491, v492, v493, v494, v495, v501, 1, 0, v499, v500, v496, v502, v503, v504, v505, v506, v507, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_442(v489:0, v490:0, v491:0, v492:0, v493:0, v494:0, v495:0, 1 + v630:0, 1, 0, v499:0, v500:0, v496:0, v502:0, v503:0, v504:0, v505:0, v506:0, v507:0, 3, 4) -> f_442(v489:0, v490:0, v491:0, v492:0, v493:0, v494:0, v495:0, v630:0, 1, 0, v500:0, 1 + v500:0, 1 + v630:0, v502:0, v503:0, v504:0, v505:0, v506:0, v507:0, 3, 4) :|: v500:0 > 0 && v491:0 < 1 + v630:0
Filtered unneeded arguments:
   f_442(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_442(x3, x8, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_442(v491:0, sum~cons_1~v630:0, v500:0) -> f_442(v491:0, v630:0, 1 + v500:0) :|: v500:0 > 0 && v491:0 < 1 + v630:0 && sum~cons_1~v630:0 = 1 + v630:0

----------------------------------------

(16)
Obligation:
Rules:
f_442(v491:0, sum~cons_1~v630:0, v500:0) -> f_442(v491:0, v630:0, 1 + v500:0) :|: v500:0 > 0 && v491:0 < 1 + v630:0 && sum~cons_1~v630:0 = 1 + v630:0

----------------------------------------

(17) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_442_3,1)

----------------------------------------

(18)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := oldX1 - 1;
assume(oldX2 > 0 && oldX0 < 1 + oldX3 && oldX1 = 1 + oldX3);
x0 := oldX0;
x1 := oldX1 - 1;
x2 := 1 + oldX2;
TO: 1;


----------------------------------------

(19) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 1, 3, 4 using the following rank functions:
    - Rank function 1:
      RF for loc. 5: -x0+x1
      RF for loc. 6: -x0+x1
      Bound for (chained) transitions 3: 1
    - Rank function 2:
      RF for loc. 5: 1-2*x0+2*x1
      RF for loc. 6: -2*x0+2*x1
      Bound for (chained) transitions 4: 2
    - Rank function 3:
      RF for loc. 5: 0
      RF for loc. 6: -1
      Bound for (chained) transitions 1: 0

----------------------------------------

(20)
YES

----------------------------------------

(21)
Obligation:
SCC
----------------------------------------

(22) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 13 rulesP rules:
f_369(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_371(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 0 = 0
f_371(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_373(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: v300 < v307
f_373(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_376(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 0 = 0
f_376(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_379(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: TRUE
f_379(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_382(v298, v299, v300, v301, v302, v303, v304, 1, v307, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 0 = 0
f_382(v298, v299, v300, v301, v302, v303, v304, 1, v307, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_385(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 1 + v340 = v307
f_385(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_388(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: TRUE
f_388(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_392(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 0 = 0
f_392(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_395(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) :|: v364 = 1 + v309 && 2 <= v364
f_395(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) -> f_398(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) :|: TRUE
f_398(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) -> f_402(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) :|: TRUE
f_402(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4, 2) -> f_367(v298, v299, v300, v301, v302, v303, v304, 1, v307, v340, v309, v364, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: TRUE
f_367(v298, v299, v300, v301, v302, v303, v304, 1, v306, v307, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) -> f_369(v298, v299, v300, v301, v302, v303, v304, 1, v307, v306, v308, v309, v310, v311, v312, v313, v314, v315, 0, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_369(v298:0, v299:0, v300:0, v301:0, v302:0, v303:0, v304:0, 1, 1 + v340:0, v306:0, v308:0, v309:0, v310:0, v311:0, v312:0, v313:0, v314:0, v315:0, 0, 3, 4) -> f_369(v298:0, v299:0, v300:0, v301:0, v302:0, v303:0, v304:0, 1, v340:0, 1 + v340:0, v309:0, 1 + v309:0, v310:0, v311:0, v312:0, v313:0, v314:0, v315:0, 0, 3, 4) :|: v309:0 > 0 && v300:0 < 1 + v340:0
Filtered unneeded arguments:
   f_369(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_369(x3, x9, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_369(v300:0, sum~cons_1~v340:0, v309:0) -> f_369(v300:0, v340:0, 1 + v309:0) :|: v309:0 > 0 && v300:0 < 1 + v340:0 && sum~cons_1~v340:0 = 1 + v340:0

----------------------------------------

(23)
Obligation:
Rules:
f_369(v300:0, sum~cons_1~v340:0, v309:0) -> f_369(v300:0, v340:0, 1 + v309:0) :|: v309:0 > 0 && v300:0 < 1 + v340:0 && sum~cons_1~v340:0 = 1 + v340:0

----------------------------------------

(24) IRS2T2 (EQUIVALENT)
Transformed input IRS into an integer transition system.Used the following mapping from defined symbols to location IDs:

   (f_369_3,1)

----------------------------------------

(25)
Obligation:
START: 0;

FROM: 0;
TO: 1;

FROM: 1;
oldX0 := x0;
oldX1 := x1;
oldX2 := x2;
oldX3 := oldX1 - 1;
assume(oldX2 > 0 && oldX0 < 1 + oldX3 && oldX1 = 1 + oldX3);
x0 := oldX0;
x1 := oldX1 - 1;
x2 := 1 + oldX2;
TO: 1;


----------------------------------------

(26) T2 (EQUIVALENT)
Initially, performed program simplifications using lexicographic rank functions:
 * Removed transitions 1, 3, 4 using the following rank functions:
    - Rank function 1:
      RF for loc. 5: -x0+x1
      RF for loc. 6: -x0+x1
      Bound for (chained) transitions 3: 1
    - Rank function 2:
      RF for loc. 5: 1-2*x0+2*x1
      RF for loc. 6: -2*x0+2*x1
      Bound for (chained) transitions 4: 2
    - Rank function 3:
      RF for loc. 5: 0
      RF for loc. 6: -1
      Bound for (chained) transitions 1: 0

----------------------------------------

(27)
YES