/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: 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, 3500 ms]
(4) LLVM Symbolic Execution Graph
(5) SymbolicExecutionGraphToSCCProof [SOUND, 0 ms]
(6) AND
    (7) LLVM Symbolic Execution SCC
        (8) SCC2IRS [SOUND, 111 ms]
        (9) IntTRS
        (10) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (11) IntTRS
        (12) RankingReductionPairProof [EQUIVALENT, 28 ms]
        (13) IntTRS
        (14) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (15) IntTRS
        (16) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
        (17) YES
    (18) LLVM Symbolic Execution SCC
        (19) SCC2IRS [SOUND, 59 ms]
        (20) IntTRS
        (21) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (22) IntTRS
        (23) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
        (24) YES
    (25) LLVM Symbolic Execution SCC
        (26) SCC2IRS [SOUND, 32 ms]
        (27) IntTRS
        (28) TerminationGraphProcessor [EQUIVALENT, 2 ms]
        (29) 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: "__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) variableLength: false visibilityType: DEFAULT callingConvention: ccc
	0:
		%1 = alloca i32, align 4
		%2 = alloca i32, align 4
		%c = alloca i32, align 4
		store %x, %1
		store %y, %2
		store 0, %c
		br %3
	3:
		%4 = load %1
		%5 = icmp sge %4 0
		br %5, %6, %19
	6:
		store 1, %2
		br %7
	7:
		%8 = load %1
		%9 = load %2
		%10 = icmp sgt %8 %9
		br %10, %11, %16
	11:
		%12 = load %2
		%13 = mul 2 %12
		store %13, %2
		%14 = load %c
		%15 = add %14 1
		store %15, %c
		br %7
	16:
		%17 = load %1
		%18 = sub %17 1
		store %18, %1
		br %3
	19:
		%20 = load %c
		ret %20

*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 @test_fun(i32 %2, i32 %3)
		ret %4


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 38 rulesP rules:
f_454(v553, v554, v555, v556, v557, v558, 1, v560, v562, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_455(v553, v554, v555, v556, v557, v558, 1, v560, v572, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: v572 = 2 * v560 && 2 <= v572
f_455(v553, v554, v555, v556, v557, v558, 1, v560, v572, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_456(v553, v554, v555, v556, v557, v558, 1, v560, v572, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: TRUE
f_456(v553, v554, v555, v556, v557, v558, 1, v560, v572, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_457(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: 0 = 0
f_457(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_458(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: v574 = 1 + v564 && 2 <= v574
f_458(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_459(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: TRUE
f_459(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_460(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: TRUE
f_460(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_461(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: 0 = 0
f_461(v553, v554, v555, v556, v557, v558, 1, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_462(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: 0 = 0
f_462(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_463(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: v572 < v558 && 3 <= v558 && 4 <= v565 && 4 <= v553
f_462(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_464(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: v558 <= v572
f_463(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_465(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: 0 = 0
f_465(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_467(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: TRUE
f_467(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_453(v553, v554, v555, v556, v557, v558, 1, v572, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: TRUE
f_453(v553, v554, v555, v556, v557, v558, 1, v560, v561, v562, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_454(v553, v554, v555, v556, v557, v558, 1, v560, v562, v563, v564, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) :|: 0 = 0
f_464(v553, v554, v555, v556, v557, v558, 1, v572, v560, v564, v574, v565, v566, v567, v568, v569, v570, 0, 3, 2, 4) -> f_466(v553, v554, v555, v556, v557, v558, 1, v572, 0, v560, v564, v574, v565, v566, v567, v568, v569, v570, 3, 2, 4) :|: 0 = 0
f_466(v553, v554, v555, v556, v557, v558, 1, v572, 0, v560, v564, v574, v565, v566, v567, v568, v569, v570, 3, 2, 4) -> f_468(v553, v554, v555, v556, v557, v558, 1, v572, 0, v560, v564, v574, v565, v566, v567, v568, v569, v570, 3, 2, 4) :|: TRUE
f_468(v553, v554, v555, v556, v557, v558, 1, v572, 0, v560, v564, v574, v565, v566, v567, v568, v569, v570, 3, 2, 4) -> f_487(v553, v554, v555, v556, v557, v558, 1, v572, 0, v560, v572, v564, v574, v565, v566, v567, v568, v569, v570, 3, 2, 4) :|: TRUE
f_487(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v784, v785, v786, v787, v788, v789, 3, 2, 4) -> f_488(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: 0 = 0
f_488(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_489(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) :|: 1 + v790 = v776 && 0 <= 1 + v790
f_489(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) -> f_490(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_490(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) -> f_491(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_491(v771, v772, v773, v774, v775, v776, 1, v778, 0, v780, v781, v782, v783, v790, v785, v786, v787, v788, v789, 3, 2, 4) -> f_492(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: 0 = 0
f_492(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_493(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: 0 <= v790 && 1 <= v776
f_493(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_495(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: 0 = 0
f_495(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_497(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_497(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_499(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_499(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_501(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_501(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) -> f_478(v771, v772, v773, v774, v775, v790, 1, v776, v778, 0, v780, v781, v782, v783, v785, v786, v787, v788, v789, 3, 2, 4) :|: TRUE
f_478(v691, v692, v693, v694, v695, v696, 1, v698, v699, 0, v701, v702, v703, v704, v705, v706, v707, v708, v709, 3, 2, 4) -> f_479(v691, v692, v693, v694, v695, v696, 1, v699, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: 0 = 0
f_479(v691, v692, v693, v694, v695, v696, 1, v699, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_480(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: 0 = 0
f_480(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_481(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: 1 < v696 && 3 <= v698 && 3 <= v691 && 4 <= v702 && 2 <= v701
f_480(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_482(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: v696 <= 1 && v698 <= 2
f_481(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_483(v691, v692, v693, v694, v695, v696, 1, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 0, 3, 2, 4) :|: 0 = 0
f_483(v691, v692, v693, v694, v695, v696, 1, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 0, 3, 2, 4) -> f_485(v691, v692, v693, v694, v695, v696, 1, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 0, 3, 2, 4) :|: TRUE
f_485(v691, v692, v693, v694, v695, v696, 1, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 0, 3, 2, 4) -> f_453(v691, v692, v693, v694, v695, v696, 1, 1, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 0, 3, 2, 4) :|: TRUE
f_482(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_484(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: 0 = 0
f_484(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_486(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: TRUE
f_486(v691, v692, v693, v694, v695, v696, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) -> f_487(v691, v692, v693, v694, v695, v696, 1, 1, 0, v701, v702, v703, v704, v698, v705, v706, v707, v708, v709, 3, 2, 4) :|: TRUE
Combined rules. Obtained 4 rulesP rules:
f_480(v691:0, v692:0, v693:0, v694:0, v695:0, 1 + v790:0, 1, 0, v701:0, v702:0, v703:0, v704:0, v698:0, v705:0, v706:0, v707:0, v708:0, v709:0, 3, 2, 4) -> f_480(v691:0, v692:0, v693:0, v694:0, v695:0, v790:0, 1, 0, v701:0, v702:0, v703:0, v704:0, 1 + v790:0, v705:0, v706:0, v707:0, v708:0, v709:0, 3, 2, 4) :|: v790:0 > -1 && v790:0 < 1 && v698:0 < 3
f_480(v691:0, v692:0, v693:0, v694:0, v695:0, v696:0, 1, 0, v701:0, v702:0, v703:0, v704:0, v698:0, v705:0, v706:0, v707:0, v708:0, v709:0, 3, 2, 4) -> f_454(v691:0, v692:0, v693:0, v694:0, v695:0, v696:0, 1, 1, v702:0, v703:0, v704:0, v698:0, v705:0, v706:0, v707:0, v708:0, v709:0, 0, 3, 2, 4) :|: v698:0 > 2 && v696:0 > 1 && v691:0 > 2 && v701:0 > 1 && v702:0 > 3
f_454(v553:0, v554:0, v555:0, v556:0, v557:0, 1 + v790:0, 1, v560:0, v562:0, v563:0, v564:0, v565:0, v566:0, v567:0, v568:0, v569:0, v570:0, 0, 3, 2, 4) -> f_480(v553:0, v554:0, v555:0, v556:0, v557:0, v790:0, 1, 0, v560:0, 2 * v560:0, v564:0, 1 + v564:0, 1 + v790:0, v566:0, v567:0, v568:0, v569:0, v570:0, 3, 2, 4) :|: v790:0 > -1 && 2 * v560:0 > 1 && v564:0 > 0 && 2 * v560:0 >= 1 + v790:0
f_454(v553:0, v554:0, v555:0, v556:0, v557:0, v558:0, 1, v560:0, v562:0, v563:0, v564:0, v565:0, v566:0, v567:0, v568:0, v569:0, v570:0, 0, 3, 2, 4) -> f_454(v553:0, v554:0, v555:0, v556:0, v557:0, v558:0, 1, 2 * v560:0, 2 * v560:0, v564:0, 1 + v564:0, v565:0, v566:0, v567:0, v568:0, v569:0, v570:0, 0, 3, 2, 4) :|: 2 * v560:0 > 1 && v564:0 > 0 && v558:0 > 2 && v558:0 > 2 * v560:0 && v553:0 > 3 && v565:0 > 3
Filtered unneeded arguments:
   f_480(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_480(x1, x6, x9, x10, x12, x13)
   f_454(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19, x20, x21) -> f_454(x1, x6, x8, x11, x12)
Removed division, modulo operations, cleaned up constraints. Obtained 4 rules.P rules:
f_480(v691:0, sum~cons_1~v790:0, v701:0, v702:0, v704:0, v698:0) -> f_480(v691:0, v790:0, v701:0, v702:0, v704:0, 1 + v790:0) :|: v790:0 < 1 && v698:0 < 3 && v790:0 > -1 && sum~cons_1~v790:0 = 1 + v790:0
f_480(v691:0, v696:0, v701:0, v702:0, v704:0, v698:0) -> f_454(v691:0, v696:0, 1, v704:0, v698:0) :|: v696:0 > 1 && v698:0 > 2 && v691:0 > 2 && v702:0 > 3 && v701:0 > 1
f_454(v553:0, sum~cons_1~v790:0, v560:0, v564:0, v565:0) -> f_480(v553:0, v790:0, v560:0, 2 * v560:0, 1 + v564:0, 1 + v790:0) :|: 2 * v560:0 > 1 && v790:0 > -1 && 2 * v560:0 >= 1 + v790:0 && v564:0 > 0 && sum~cons_1~v790:0 = 1 + v790:0
f_454(v553:0, v558:0, v560:0, v564:0, v565:0) -> f_454(v553:0, v558:0, 2 * v560:0, 1 + v564:0, v565:0) :|: v564:0 > 0 && 2 * v560:0 > 1 && v558:0 > 2 && v558:0 > 2 * v560:0 && v565:0 > 3 && v553:0 > 3

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

(9)
Obligation:
Rules:
f_480(v691:0, sum~cons_1~v790:0, v701:0, v702:0, v704:0, v698:0) -> f_480(v691:0, v790:0, v701:0, v702:0, v704:0, 1 + v790:0) :|: v790:0 < 1 && v698:0 < 3 && v790:0 > -1 && sum~cons_1~v790:0 = 1 + v790:0
f_480(x, x1, x2, x3, x4, x5) -> f_454(x, x1, 1, x4, x5) :|: x1 > 1 && x5 > 2 && x > 2 && x3 > 3 && x2 > 1
f_454(x6, x7, x8, x9, x10) -> f_480(x6, x11, x8, 2 * x8, 1 + x9, 1 + x11) :|: 2 * x8 > 1 && x11 > -1 && 2 * x8 >= 1 + x11 && x9 > 0 && x7 = 1 + x11
f_454(v553:0, v558:0, v560:0, v564:0, v565:0) -> f_454(v553:0, v558:0, 2 * v560:0, 1 + v564:0, v565:0) :|: v564:0 > 0 && 2 * v560:0 > 1 && v558:0 > 2 && v558:0 > 2 * v560:0 && v565:0 > 3 && v553:0 > 3

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

(10) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(11)
Obligation:
Rules:
f_454(v553:0:0, v558:0:0, v560:0:0, v564:0:0, v565:0:0) -> f_454(v553:0:0, v558:0:0, 2 * v560:0:0, 1 + v564:0:0, v565:0:0) :|: v565:0:0 > 3 && v553:0:0 > 3 && v558:0:0 > 2 * v560:0:0 && v558:0:0 > 2 && 2 * v560:0:0 > 1 && v564:0:0 > 0
f_480(x:0, x1:0, x2:0, x3:0, x4:0, x5:0) -> f_454(x:0, x1:0, 1, x4:0, x5:0) :|: x3:0 > 3 && x2:0 > 1 && x:0 > 2 && x5:0 > 2 && x1:0 > 1
f_480(v691:0:0, sum~cons_1~v790:0:0, v701:0:0, v702:0:0, v704:0:0, v698:0:0) -> f_480(v691:0:0, v790:0:0, v701:0:0, v702:0:0, v704:0:0, 1 + v790:0:0) :|: v790:0:0 < 1 && v698:0:0 < 3 && v790:0:0 > -1 && sum~cons_1~v790:0:0 = 1 + v790:0:0
f_454(x6:0, sum~cons_1~x11:0, x8:0, x9:0, x10:0) -> f_480(x6:0, x11:0, x8:0, 2 * x8:0, 1 + x9:0, 1 + x11:0) :|: 2 * x8:0 >= 1 + x11:0 && x9:0 > 0 && x11:0 > -1 && 2 * x8:0 > 1 && sum~cons_1~x11:0 = 1 + x11:0

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

(12) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f_454 ] = 2*f_454_2
[ f_480 ] = 2*f_480_2 + 1

The following rules are decreasing:
f_480(x:0, x1:0, x2:0, x3:0, x4:0, x5:0) -> f_454(x:0, x1:0, 1, x4:0, x5:0) :|: x3:0 > 3 && x2:0 > 1 && x:0 > 2 && x5:0 > 2 && x1:0 > 1
f_480(v691:0:0, sum~cons_1~v790:0:0, v701:0:0, v702:0:0, v704:0:0, v698:0:0) -> f_480(v691:0:0, v790:0:0, v701:0:0, v702:0:0, v704:0:0, 1 + v790:0:0) :|: v790:0:0 < 1 && v698:0:0 < 3 && v790:0:0 > -1 && sum~cons_1~v790:0:0 = 1 + v790:0:0
f_454(x6:0, sum~cons_1~x11:0, x8:0, x9:0, x10:0) -> f_480(x6:0, x11:0, x8:0, 2 * x8:0, 1 + x9:0, 1 + x11:0) :|: 2 * x8:0 >= 1 + x11:0 && x9:0 > 0 && x11:0 > -1 && 2 * x8:0 > 1 && sum~cons_1~x11:0 = 1 + x11:0

The following rules are bounded:
f_454(v553:0:0, v558:0:0, v560:0:0, v564:0:0, v565:0:0) -> f_454(v553:0:0, v558:0:0, 2 * v560:0:0, 1 + v564:0:0, v565:0:0) :|: v565:0:0 > 3 && v553:0:0 > 3 && v558:0:0 > 2 * v560:0:0 && v558:0:0 > 2 && 2 * v560:0:0 > 1 && v564:0:0 > 0
f_480(x:0, x1:0, x2:0, x3:0, x4:0, x5:0) -> f_454(x:0, x1:0, 1, x4:0, x5:0) :|: x3:0 > 3 && x2:0 > 1 && x:0 > 2 && x5:0 > 2 && x1:0 > 1
f_480(v691:0:0, sum~cons_1~v790:0:0, v701:0:0, v702:0:0, v704:0:0, v698:0:0) -> f_480(v691:0:0, v790:0:0, v701:0:0, v702:0:0, v704:0:0, 1 + v790:0:0) :|: v790:0:0 < 1 && v698:0:0 < 3 && v790:0:0 > -1 && sum~cons_1~v790:0:0 = 1 + v790:0:0
f_454(x6:0, sum~cons_1~x11:0, x8:0, x9:0, x10:0) -> f_480(x6:0, x11:0, x8:0, 2 * x8:0, 1 + x9:0, 1 + x11:0) :|: 2 * x8:0 >= 1 + x11:0 && x9:0 > 0 && x11:0 > -1 && 2 * x8:0 > 1 && sum~cons_1~x11:0 = 1 + x11:0


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

(13)
Obligation:
Rules:
f_454(v553:0:0, v558:0:0, v560:0:0, v564:0:0, v565:0:0) -> f_454(v553:0:0, v558:0:0, 2 * v560:0:0, 1 + v564:0:0, v565:0:0) :|: v565:0:0 > 3 && v553:0:0 > 3 && v558:0:0 > 2 * v560:0:0 && v558:0:0 > 2 && 2 * v560:0:0 > 1 && v564:0:0 > 0

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

(14) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(15)
Obligation:
Rules:
f_454(v553:0:0:0, v558:0:0:0, v560:0:0:0, v564:0:0:0, v565:0:0:0) -> f_454(v553:0:0:0, v558:0:0:0, 2 * v560:0:0:0, 1 + v564:0:0:0, v565:0:0:0) :|: 2 * v560:0:0:0 > 1 && v564:0:0:0 > 0 && v558:0:0:0 > 2 && v558:0:0:0 > 2 * v560:0:0:0 && v553:0:0:0 > 3 && v565:0:0:0 > 3

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

(16) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_454(x, x1, x2, x3, x4)] = -2 + x1 - x2

The following rules are decreasing:
f_454(v553:0:0:0, v558:0:0:0, v560:0:0:0, v564:0:0:0, v565:0:0:0) -> f_454(v553:0:0:0, v558:0:0:0, 2 * v560:0:0:0, 1 + v564:0:0:0, v565:0:0:0) :|: 2 * v560:0:0:0 > 1 && v564:0:0:0 > 0 && v558:0:0:0 > 2 && v558:0:0:0 > 2 * v560:0:0:0 && v553:0:0:0 > 3 && v565:0:0:0 > 3
The following rules are bounded:
f_454(v553:0:0:0, v558:0:0:0, v560:0:0:0, v564:0:0:0, v565:0:0:0) -> f_454(v553:0:0:0, v558:0:0:0, 2 * v560:0:0:0, 1 + v564:0:0:0, v565:0:0:0) :|: 2 * v560:0:0:0 > 1 && v564:0:0:0 > 0 && v558:0:0:0 > 2 && v558:0:0:0 > 2 * v560:0:0:0 && v553:0:0:0 > 3 && v565:0:0:0 > 3

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

(17)
YES

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

(18)
Obligation:
SCC
----------------------------------------

(19) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 13 rulesP rules:
f_323(v200, v201, v202, v203, v204, 1, v206, v207, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_324(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: 0 = 0
f_324(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_325(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: v207 < v200 && 3 <= v200
f_325(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_327(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: 0 = 0
f_327(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_329(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: TRUE
f_329(v200, v201, v202, v203, v204, 1, v207, v206, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_331(v200, v201, v202, v203, v204, 1, v207, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: 0 = 0
f_331(v200, v201, v202, v203, v204, 1, v207, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_333(v200, v201, v202, v203, v204, 1, v207, v216, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: v216 = 2 * v207 && 4 <= v216
f_333(v200, v201, v202, v203, v204, 1, v207, v216, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_335(v200, v201, v202, v203, v204, 1, v207, v216, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: TRUE
f_335(v200, v201, v202, v203, v204, 1, v207, v216, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_337(v200, v201, v202, v203, v204, 1, v207, v216, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: 0 = 0
f_337(v200, v201, v202, v203, v204, 1, v207, v216, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_339(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: v220 = 1 + v209 && 2 <= v220
f_339(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_341(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: TRUE
f_341(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_343(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: TRUE
f_343(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_322(v200, v201, v202, v203, v204, 1, v207, v216, v209, v220, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: TRUE
f_322(v200, v201, v202, v203, v204, 1, v206, v207, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) -> f_323(v200, v201, v202, v203, v204, 1, v206, v207, v208, v209, v210, v211, v212, v213, v214, 0, 3, 2, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_323(v200:0, v201:0, v202:0, v203:0, v204:0, 1, v206:0, v207:0, v208:0, v209:0, v210:0, v211:0, v212:0, v213:0, v214:0, 0, 3, 2, 4) -> f_323(v200:0, v201:0, v202:0, v203:0, v204:0, 1, v207:0, 2 * v207:0, v209:0, 1 + v209:0, v210:0, v211:0, v212:0, v213:0, v214:0, 0, 3, 2, 4) :|: v200:0 > 2 && v207:0 < v200:0 && v209:0 > 0 && 3 < 2 * v207:0
Filtered unneeded arguments:
   f_323(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16, x17, x18, x19) -> f_323(x1, x8, x10)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_323(v200:0, v207:0, v209:0) -> f_323(v200:0, 2 * v207:0, 1 + v209:0) :|: v207:0 < v200:0 && v200:0 > 2 && 3 < 2 * v207:0 && v209:0 > 0

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

(20)
Obligation:
Rules:
f_323(v200:0, v207:0, v209:0) -> f_323(v200:0, 2 * v207:0, 1 + v209:0) :|: v207:0 < v200:0 && v200:0 > 2 && 3 < 2 * v207:0 && v209:0 > 0

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

(21) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(22)
Obligation:
Rules:
f_323(v200:0:0, v207:0:0, v209:0:0) -> f_323(v200:0:0, 2 * v207:0:0, 1 + v209:0:0) :|: 3 < 2 * v207:0:0 && v209:0:0 > 0 && v200:0:0 > 2 && v207:0:0 < v200:0:0

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

(23) PolynomialOrderProcessor (EQUIVALENT)
Found the following polynomial interpretation:
[f_323(x, x1, x2)] = -2 + x - x1 + x2

The following rules are decreasing:
f_323(v200:0:0, v207:0:0, v209:0:0) -> f_323(v200:0:0, 2 * v207:0:0, 1 + v209:0:0) :|: 3 < 2 * v207:0:0 && v209:0:0 > 0 && v200:0:0 > 2 && v207:0:0 < v200:0:0
The following rules are bounded:
f_323(v200:0:0, v207:0:0, v209:0:0) -> f_323(v200:0:0, 2 * v207:0:0, 1 + v209:0:0) :|: 3 < 2 * v207:0:0 && v209:0:0 > 0 && v200:0:0 > 2 && v207:0:0 < v200:0:0

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

(24)
YES

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

(25)
Obligation:
SCC
----------------------------------------

(26) SCC2IRS (SOUND)
Transformed LLVM symbolic execution graph SCC into a rewrite problem. Log: 
Generated rules. Obtained 15 rulesP rules:
f_194(v15, v16, v17, v18, v19, v23, 1, v20, 0, v24, v25, v26, v27, v28, 3, 4) -> f_196(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 <= v23 && v20 = 1 && v23 = 0 && 0 = 0
f_196(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_199(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_199(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_203(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_203(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_207(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_207(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_211(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_211(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_215(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_215(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_218(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_218(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_221(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_221(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_224(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_224(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_227(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_227(1, v16, v17, v18, v19, 0, v24, v25, v26, v27, v28, 3, 4) -> f_230(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
f_230(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) -> f_233(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_233(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) -> f_235(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_235(1, v16, v17, v18, v19, 0, -1, v24, v25, v26, v27, v28, 3, 4) -> f_191(1, v16, v17, v18, v19, 0, 1, 0, -1, v24, v25, v26, v27, v28, 3, 4) :|: TRUE
f_191(v15, v16, v17, v18, v19, v20, 1, 0, v23, v24, v25, v26, v27, v28, 3, 4) -> f_194(v15, v16, v17, v18, v19, v23, 1, v20, 0, v24, v25, v26, v27, v28, 3, 4) :|: 0 = 0
Combined rules. Obtained 1 rulesP rules:
f_194(v15:0, v16:0, v17:0, v18:0, v19:0, 0, 1, 1, 0, v24:0, v25:0, v26:0, v27:0, v28:0, 3, 4) -> f_194(1, v16:0, v17:0, v18:0, v19:0, -1, 1, 0, 0, v24:0, v25:0, v26:0, v27:0, v28:0, 3, 4) :|: TRUE
Filtered unneeded arguments:
   f_194(x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15, x16) -> f_194(x6, x8)
Removed division, modulo operations, cleaned up constraints. Obtained 1 rules.P rules:
f_194(cons_0, cons_1) -> f_194(-1, 0) :|: TRUE && cons_0 = 0 && cons_1 = 1

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

(27)
Obligation:
Rules:
f_194(cons_0, cons_1) -> f_194(-1, 0) :|: TRUE && cons_0 = 0 && cons_1 = 1

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

(28) TerminationGraphProcessor (EQUIVALENT)
Constructed the termination graph and obtained no non-trivial SCC(s).

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

(29)
YES