/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/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_i -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l9, (main_i = 0)>
<l2, l3, not((main_i = 0))>
<l3, l4, (main_i < 0)>
<l3, l6, not((main_i < 0))>
<l4, l5, true, seq{main_i -> (main_i - 1), main_i -> (main_i * ~(1))}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i + 1), main_i -> (main_i * ~(1))}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, 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, l11, true, seq{main__func_return_ -> 0}>
<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l1, true, seq{main_i -> varCall_1}>
<l1, l2, true>
<l2, l9, (main_i = 0)>
<l2, l3, not((main_i = 0))>
<l3, l4, (main_i < 0)>
<l3, l6, not((main_i < 0))>
<l4, l5, true, seq{main_i -> (main_i - 1), main_i -> (main_i * ~(1))}>
<l5, l8, true>
<l6, l7, true, seq{main_i -> (main_i + 1), main_i -> (main_i * ~(1))}>
<l7, l8, true>
<l8, l2, true>
<l9, l10, true, seq{main__func_return_ -> 0}>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:
10, 
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 [3 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 3, col: 1> | <line: 7, col: 9>
main | function | [integer, ()] | <line: 5, col: 1>
i | local variable | integer | <line: 6, col: 5> | <line: 7, col: 5> <line: 9, col: 12> <line: 10, col: 13> <line: 11, col: 13> <line: 11, col: 17> <line: 12, col: 13> <line: 12, col: 17> <line: 14, col: 13> <line: 14, col: 17> <line: 15, col: 13> <line: 15, col: 17>

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

Fresh variables:
undef2, 

Undef variables:
undef2, 

Abstraction variables:

Exit nodes:
10, 
Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

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

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_i = undef2, {all remain the same}>

Graph 2
<l2, l10, main_i = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000760s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008792s
[10981 : 10982]
[10981 : 10983]
Successful child: 10982
[ 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: 
<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_i, {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
It's unfeasible. Removing transition: 
<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
New Graphs: 
[10981 : 10987]
[10981 : 10988]
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: main_i <= 0 , 0 <= main_i , 
Narrowing transition: 
<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + main_i <= 0, {main_i -> 1 - main_i, rest remain the same}>
<l2, l2, 1 <= main_i, {main_i -> -1 - main_i, rest remain the same}>
Variables:
main_i
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000731s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008887s
[10981 : 10989]
[10981 : 10990]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008683s
Time used: 0.008358

[10981 : 10996]
[10981 : 11000]
Successful child: 10996

Program does NOT terminate