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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
*******************************************************************************************
*********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION ***********************
*******************************************************************************************


List of LLVMGraphs + assumeNodes + staticAssertNodes [1] :

+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++
+                                                                  +
Init Location: 0
Transitions:
<l0, l1, true, seq{main__func_return_ -> 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_N -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l16, not((main_N < 536870912))>
<l1, l2, (main_N < 536870912)>
<l2, l16, not((main_x < 536870912))>
<l2, l3, (main_x < 536870912)>
<l3, l16, not((main_y < 536870912))>
<l3, l4, (main_y < 536870912)>
<l4, l5, (main_x >= ~(1073741824))>
<l4, l16, not((main_x >= ~(1073741824)))>
<l5, l6, ((main_x + main_y) >= 0)>
<l5, l15, not(((main_x + main_y) >= 0))>
<l6, l7, true>
<l7, l14, not((main_x <= main_N))>
<l7, l8, (main_x <= main_N)>
<l8, l9, not((¿functionCall(__VERIFIER_nondet_int) = 0))>
<l8, l11, (¿functionCall(__VERIFIER_nondet_int) = 0)>
<l9, l10, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
<l10, l13, true>
<l11, l12, true, seq{main_x -> (main_x + 1)}>
<l12, l13, true>
<l13, l7, true>
<l14, l15, true>
<l15, l16, true>
<l16, l17, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

+ Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++
       
+ Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++
       
+ After preprocess (paralelization): ++++++++++++++++++++++++++++++

Init Location: 0
Transitions:
<l0, l18, true, seq{main__func_return_ -> 0}>
<l18, l19, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l19, l20, true, seq{main_x -> varCall_1}>
<l20, l21, true, seq{varCall_2 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l21, l22, true, seq{main_y -> varCall_2}>
<l22, l23, true, seq{varCall_3 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l23, l1, true, seq{main_N -> varCall_3}>
<l1, l2, (main_N < 536870912)>
<l1, l16, not((main_N < 536870912))>
<l2, l3, (main_x < 536870912)>
<l2, l16, not((main_x < 536870912))>
<l3, l4, (main_y < 536870912)>
<l3, l16, not((main_y < 536870912))>
<l4, l5, (main_x >= ~(1073741824))>
<l4, l16, not((main_x >= ~(1073741824)))>
<l5, l6, ((main_x + main_y) >= 0)>
<l5, l15, not(((main_x + main_y) >= 0))>
<l6, l7, true>
<l7, l8, (main_x <= main_N)>
<l7, l14, not((main_x <= main_N))>
<l8, l24, true, seq{varCall_4 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l24, l11, (varCall_4 = 0)>
<l24, l9, (varCall_4 = 1)>
<l9, l10, true, seq{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
<l10, l13, true>
<l11, l12, true, seq{main_x -> (main_x + 1)}>
<l12, l13, true>
<l13, l7, true>
<l14, l15, true>
<l15, l16, true>
<l16, l17, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
17, 
Accepting locations:

Asserts:

+                                                                  +
+++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++


Function Return and Parameters Information [2 functions]:
    function name: __VERIFIER_nondet_int [1 return + 0 parameters]        demangled: __VERIFIER_nondet_int
        __VERIFIER_nondet_int__func_return_      [function result] : int
    function name: main [1 return + 0 parameters]        demangled: main
        main__func_return_      [function result] : int


AST Ident Scanner Information [5 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 12, col: 1> | <line: 16, col: 6> <line: 17, col: 6> <line: 18, col: 6> <line: 24, col: 12>
main | function | [integer, ()] | <line: 14, col: 1>
x | local variable | integer | <line: 15, col: 5> | <line: 16, col: 2> <line: 21, col: 23> <line: 21, col: 57> <line: 22, col: 10> <line: 23, col: 14> <line: 25, col: 9> <line: 25, col: 15> <line: 28, col: 9> <line: 28, col: 13>
y | local variable | integer | <line: 15, col: 5> | <line: 17, col: 2> <line: 21, col: 40> <line: 22, col: 14> <line: 25, col: 19> <line: 26, col: 9> <line: 26, col: 13>
N | local variable | integer | <line: 15, col: 5> | <line: 18, col: 2> <line: 21, col: 6> <line: 23, col: 19>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ (undef7 < 536870912) /\ (undef5 < 536870912) /\ (undef6 < 536870912) /\ (undef5 >= ~(1073741824)) /\ ((undef5 + undef6) >= 0)>
<l0, l17, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ (undef7 < 536870912) /\ (undef5 < 536870912) /\ (undef6 < 536870912) /\ (undef5 >= ~(1073741824)) /\ not(((undef5 + undef6) >= 0))>
<l0, l17, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ (undef7 < 536870912) /\ (undef5 < 536870912) /\ (undef6 < 536870912) /\ not((undef5 >= ~(1073741824)))>
<l0, l17, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ (undef7 < 536870912) /\ (undef5 < 536870912) /\ not((undef6 < 536870912))>
<l0, l17, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ (undef7 < 536870912) /\ not((undef5 < 536870912))>
<l0, l17, (main_x = undef5) /\ (main_y = undef6) /\ (main_N = undef7) /\ not((undef7 < 536870912))>
<l7, l7, (main_x <= main_N) /\ (undef8 = 0), par{main_x -> (main_x + 1)}>
<l7, l7, (main_x <= main_N) /\ (undef8 = 1), par{main_x -> ((2 * main_x) + main_y), main_y -> (main_y + 1)}>
<l7, l17, not((main_x <= main_N))>

Fresh variables:
undef5, undef6, undef7, undef8, 

Undef variables:
undef5, undef6, undef7, undef8, 

Abstraction variables:

Exit nodes:
17, 
Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, main_x <= main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>
<l7, l7, main_x <= main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_N, main_y

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, 0 <= undef5 + undef6 /\ 0 <= 1073741824 + undef5 /\ undef5 <= 536870911 /\ undef6 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>

Graph 2
<l0, l17, 0 <= 1073741824 + undef5 /\ 1 + undef5 + undef6 <= 0 /\ undef5 <= 536870911 /\ undef6 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
<l0, l17, undef6 <= 536870911 /\ undef7 <= 536870911 /\ 1073741825 + undef5 <= 0 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
<l0, l17, 536870912 <= undef6 /\ undef5 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
<l0, l17, 536870912 <= undef5 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
<l0, l17, 536870912 <= undef7 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
<l7, l17, 1 + main_N <= main_x, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 7 , 1 )
( 17 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.005606

Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001400s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004234s
[27145 : 27146]
[27145 : 27147]
Successful child: 27146
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Ranking function: -main_x + main_N
New Graphs: 
Transitions:
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y, main_N
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000675s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002430s
[27145 : 27151]
[27145 : 27152]
Successful child: 27151
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 
INVARIANTS: 
7: 0 <= main_x + main_y , 
Quasi-INVARIANTS to narrow Graph: 
7: 

LOG: CALL check - Post:1 + main_y + main_N <= 0 - Process 1
* Exit transition: <l0, l7, 0 <= undef5 + undef6 /\ 0 <= 1073741824 + undef5 /\ undef5 <= 536870911 /\ undef6 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
* Postcondition  : 1 + main_y + main_N <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000681s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000843s
INVARIANTS: 
7: 0 <= main_x + main_y , 
Quasi-INVARIANTS to narrow Graph: 
7: 1 + main_y + main_N <= 0 , 
Narrowing transition: 
<l7, l7, main_x <= main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l7, l7, main_x <= main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_N, main_y
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001891s
Ranking function: -main_x + main_N
New Graphs: 
Transitions:
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y, main_N
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000717s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002778s
[27145 : 27156]
[27145 : 27157]
Successful child: 27156
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:1 + main_N <= main_x - Process 2
* Exit transition: <l0, l7, 0 <= main_y + main_N /\ 0 <= undef5 + undef6 /\ 0 <= 1073741824 + undef5 /\ undef5 <= 536870911 /\ undef6 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
* Postcondition  : 1 + main_N <= main_x

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000645s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000808s
INVARIANTS: 
7: 
Quasi-INVARIANTS to narrow Graph: 
7: 1 + main_N <= main_x , 0 <= 1 + main_x + main_y , 
Narrowing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_N, main_y
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001905s
Ranking function: -main_x + main_N
New Graphs: 
Transitions:
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Variables:
main_x, main_y, main_N
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000722s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002772s
[27145 : 27161]
[27145 : 27162]
Successful child: 27161
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_y + main_N /\ 1 <= main_x + main_y /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_y + main_N /\ 1 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l7, l7, main_x <= main_N /\ 0 <= main_y + main_N /\ 1 <= main_x + main_y /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
Ranking function: -main_x + main_N
New Graphs: 

LOG: CALL check - Post:1 <= main_x + main_y - Process 3
* Exit transition: <l0, l7, main_x <= main_N /\ 0 <= main_y + main_N /\ 0 <= undef5 + undef6 /\ 0 <= 1073741824 + undef5 /\ undef5 <= 536870911 /\ undef6 <= 536870911 /\ undef7 <= 536870911 /\ main_x = undef5 /\ main_y = undef6 /\ main_N = undef7, {all remain the same}>
* Postcondition  : 1 <= main_x + main_y

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000594s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000770s
INVARIANTS: 
7: 0 <= main_x + main_y , 
Quasi-INVARIANTS to narrow Graph: 
7: 1 <= main_x + main_y , 
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 0, {main_x -> 1 + main_x, rest remain the same}>
It's unfeasible. Removing transition: 
<l7, l7, main_x <= main_N /\ 0 <= main_x + main_y /\ 0 <= main_y + main_N /\ undef8 = 1, {main_x -> 2*main_x + main_y, main_y -> 1 + main_y, rest remain the same}>
invGraph after Narrowing: 
Transitions:
Variables:
main_x, main_N, main_y
Analyzing SCC {l7}...
No cycles found.

Proving termination of subgraph 2
Analyzing SCC {l17}...
No cycles found.

Program Terminates