/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_c -> 1, main_n -> ¿functionCall(__VERIFIER_nondet_int)}>
<l1, l2, true>
<l2, l9, not((main_c > 0))>
<l2, l3, (main_c > 0)>
<l3, l4, (main_n > 100)>
<l3, l6, not((main_n > 100))>
<l4, l5, true, seq{main_n -> (main_n - 10), main_c -> (main_c - 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_n -> (main_n + 11), main_c -> (main_c + 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, main_c -> 1}>
<l11, l12, true, seq{varCall_1 -> ¿functionCall(__VERIFIER_nondet_int)}>
<l12, l1, true, seq{main_n -> varCall_1}>
<l1, l2, true>
<l2, l3, (main_c > 0)>
<l2, l9, not((main_c > 0))>
<l3, l4, (main_n > 100)>
<l3, l6, not((main_n > 100))>
<l4, l5, true, seq{main_n -> (main_n - 10), main_c -> (main_c - 1)}>
<l5, l8, true>
<l6, l7, true, seq{main_n -> (main_n + 11), main_c -> (main_c + 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 [4 idents]:
__VERIFIER_nondet_int | function | [integer, ()] | <line: 8, col: 1> | <line: 13, col: 7>
main | function | [integer, ()] | <line: 10, col: 1>
c | local variable | integer | <line: 11, col: 3> | <line: 12, col: 3> <line: 14, col: 10> <line: 17, col: 7> <line: 17, col: 11> <line: 20, col: 7> <line: 20, col: 11>
n | local variable | integer | <line: 11, col: 3> | <line: 13, col: 3> <line: 15, col: 9> <line: 16, col: 7> <line: 16, col: 11> <line: 19, col: 7> <line: 19, col: 11>

Main function: main
Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (main_c = 1) /\ (main_n = undef2)>
<l2, l2, (main_c > 0) /\ (main_n > 100), par{main_c -> (main_c - 1), main_n -> (main_n - 10)}>
<l2, l2, (main_c > 0) /\ not((main_n > 100)), par{main_c -> (main_c + 1), main_n -> (main_n + 11)}>
<l2, l10, not((main_c > 0))>

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_c /\ 101 <= main_n, {main_c -> -1 + main_c, main_n -> -10 + main_n, rest remain the same}>
<l2, l2, 1 <= main_c /\ main_n <= 100, {main_c -> 1 + main_c, main_n -> 11 + main_n, rest remain the same}>
Variables:
main_c, main_n

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, main_n = undef2 /\ main_c = 1, {all remain the same}>

Graph 2
<l2, l10, main_c <= 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.187854

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001503s
Ranking function: 9270 + 1030*main_c - 103*main_n
New Graphs: 
Transitions:
<l2, l2, 1 <= main_c /\ 101 <= main_n, {main_c -> -1 + main_c, main_n -> -10 + main_n, rest remain the same}>
Variables:
main_c, main_n
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000621s
Ranking function: -1 + main_c
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l10}...
No cycles found.

Program Terminates