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


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


NO

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_j -> 0, main_i -> 0}>
<l1, l2, true>
<l2, l8, not((main_i <= main_j))>
<l2, l3, (main_i <= main_j)>
<l3, l4, ((main_j - main_i) < 1)>
<l3, l6, not(((main_j - main_i) < 1))>
<l4, l5, true, seq{main_j -> (main_j + 2)}>
<l5, l6, true>
<l6, l7, true, seq{main_i -> (main_i + 1)}>
<l7, l2, true>
<l8, l9, 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, l1, true, seq{main__func_return_ -> 0, main_j -> 0, main_i -> 0}>
<l1, l2, true>
<l2, l3, (main_i <= main_j)>
<l2, l8, not((main_i <= main_j))>
<l3, l4, ((main_j - main_i) < 1)>
<l3, l6, not(((main_j - main_i) < 1))>
<l4, l5, true, seq{main_j -> (main_j + 2)}>
<l5, l6, true>
<l6, l7, true, seq{main_i -> (main_i + 1)}>
<l7, l2, true>
<l8, l9, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
9, 
Accepting locations:

Asserts:

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


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


AST Ident Scanner Information [4 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1>
main | function | [integer, ()] | <line: 5, col: 1>
i | local variable | integer | <line: 6, col: 5> | <line: 9, col: 5> <line: 11, col: 12> <line: 12, col: 15> <line: 13, col: 9> <line: 13, col: 13>
j | local variable | integer | <line: 7, col: 5> | <line: 8, col: 5> <line: 11, col: 17> <line: 12, col: 13> <line: 12, col: 24> <line: 12, col: 28>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_i = 0) /\ (main_j = 0)>
<l2, l2, (main_i <= main_j) /\ ((main_j - main_i) < 1), par{main_i -> (main_i + 1), main_j -> (main_j + 2)}>
<l2, l2, (main_i <= main_j) /\ not(((main_j - main_i) < 1)), par{main_i -> (main_i + 1)}>
<l2, l9, not((main_i <= main_j))>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
9, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
<l2, l2, 1 + main_i <= main_j, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i, main_j

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>

Graph 2
<l2, l9, 1 + main_j <= main_i, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 9 , 2 )

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000840s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004760s
[55679 : 55680]
[55679 : 55681]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023306s
Time used: 0.022802
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000750s
Time used: 1.00072

LOG: SAT solveNonLinear - Elapsed time: 1.024057s
Cost: 1; Total time: 1.02352
Termination implied by a set of invariant(s):
Invariant at l2: main_j <= 1 + main_i
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, 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): 
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Quasi-ranking function: 50000 - 2*main_i + main_j
New Graphs: 
Transitions:
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
<l2, l2, 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000801s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006685s
[55679 : 55685]
[55679 : 55686]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025732s
Time used: 0.025096
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000429s
Time used: 1.0004

LOG: SAT solveNonLinear - Elapsed time: 1.026161s
Cost: 1; Total time: 1.0255
Termination implied by a set of invariant(s):
Invariant at l2: main_i <= 1 + main_j
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + main_i = main_j, {main_i -> 1 + main_i, 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): 
<l2, l2, main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Quasi-ranking function: 50000 - main_i
New Graphs: 
Transitions:
<l2, l2, 50001 <= main_i /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
<l2, l2, 50001 <= main_i /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000992s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011683s
[55679 : 55690]
[55679 : 55691]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028977s
Time used: 0.028225
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.004760s
Time used: 1.00473

LOG: SAT solveNonLinear - Elapsed time: 1.033737s
Cost: 1; Total time: 1.03295
Quasi-ranking function: 50000 - main_i - main_j
New Graphs: 
Transitions:
<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001177s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013835s
[55679 : 55695]
[55679 : 55696]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033047s
Time used: 0.032161
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000512s
Time used: 1.00048

LOG: SAT solveNonLinear - Elapsed time: 1.033559s
Cost: 1; Total time: 1.03264
Quasi-ranking function: 50000 - main_j
New Graphs: 
Transitions:
<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 <= main_j /\ main_i = main_j, {main_i -> 1 + main_i, main_j -> 2 + main_j, rest remain the same}>
<l2, l2, 50001 <= main_i /\ 50001 <= main_i + main_j /\ 50001 + main_j <= 2*main_i /\ 1 + main_i = main_j, {main_i -> 1 + main_i, rest remain the same}>
Variables:
main_i, main_j
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001330s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010680s
[55679 : 55700]
[55679 : 55701]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101832s
Time used: 4.10089
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, main_i = 0 /\ main_j = 0, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.010991s
Cannot prove unreachability

[55679 : 55813]
[55679 : 55817]
Successful child: 55813

Program does NOT terminate