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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l3, true>
<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1}>
<l2, l1, (undef3 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef3 > 0), par{arg1 -> undef3}>
<l3, l2, true, par{arg1 -> undef5, arg2 -> undef6}>

Fresh variables:
undef1, undef3, undef5, undef6, 

Undef variables:
undef1, undef3, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (arg1 = undef3) /\ (undef3 <= undef5) /\ (undef6 > ~(1)) /\ (undef5 > 0) /\ (undef3 > 0)>
<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1}>

Fresh variables:
undef1, undef3, undef5, undef6, 

Undef variables:
undef1, undef3, undef5, undef6, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000600s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001995s
[51605 : 51606]
[51605 : 51607]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004701s
Time used: 0.004382
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l1, undef3 <= undef5 /\ 0 <= undef6 /\ 1 <= undef3 /\ 1 <= undef5 /\ arg1 = undef3, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[51605 : 51611]
[51605 : 51615]
Successful child: 51615

Program does NOT terminate