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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l14, true>
<l1, l2, true>
<l2, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0)>
<l3, l4, ((1 + x_5^0) <= (0 + y_6^0))>
<l3, l4, ((1 + y_6^0) <= (0 + x_5^0))>
<l4, l5, (undef17 = undef17), par{Result_4^0 -> undef17}>
<l2, l6, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 0) /\ (0 <= (0 + undef22)), par{tmp_7^0 -> undef22}>
<l6, l2, true>
<l2, l7, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30), par{tmp_7^0 -> undef30}>
<l7, l8, ((1 + tmp_7^0) <= 0)>
<l7, l8, (1 <= (0 + tmp_7^0))>
<l8, l9, true, par{x_5^0 -> (1 + x_5^0)}>
<l9, l2, true>
<l2, l10, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef50 = undef50) /\ ((0 + undef50) <= 0) /\ (0 <= (0 + undef50)), par{tmp_7^0 -> undef50}>
<l10, l2, true>
<l2, l11, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58), par{tmp_7^0 -> undef58}>
<l11, l12, ((1 + tmp_7^0) <= 0)>
<l11, l12, (1 <= (0 + tmp_7^0))>
<l12, l13, true, par{x_5^0 -> (1 + x_5^0)}>
<l13, l2, true>
<l14, l1, true>

Fresh variables:
undef17, undef22, undef30, undef50, undef58, 

Undef variables:
undef17, undef22, undef30, undef50, undef58, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l5, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((1 + y_6^0) <= (0 + x_5^0)) /\ (undef17 = undef17)>
<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef22 = undef22) /\ ((0 + undef22) <= 0) /\ (0 <= (0 + undef22))>
<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30) /\ ((1 + undef30) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l2, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ ((0 + x_5^0) <= (0 + y_6^0)) /\ ((0 + y_6^0) <= (0 + x_5^0)) /\ (undef30 = undef30) /\ (1 <= (0 + undef30)), par{x_5^0 -> (1 + x_5^0)}>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef50 = undef50) /\ ((0 + undef50) <= 0) /\ (0 <= (0 + undef50))>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58) /\ ((1 + undef58) <= 0), par{x_5^0 -> (1 + x_5^0)}>
<l2, l2, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)) /\ (undef58 = undef58) /\ (1 <= (0 + undef58)), par{x_5^0 -> (1 + x_5^0)}>

Fresh variables:
undef17, undef22, undef30, undef50, undef58, 

Undef variables:
undef17, undef22, undef30, undef50, undef58, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
<l2, l2, 1 + undef30 <= 0 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 <= undef30 /\ x_5^0 = y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 + undef58 <= 0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ 1 <= undef58, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l5, 1 + y_6^0 <= x_5^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002703s
Ranking function: -x_5^0 + y_6^0
New Graphs: 
Transitions:
<l2, l2, x_5^0 = y_6^0 /\ undef22 = 0, {all remain the same}>
<l2, l2, 1 + x_5^0 <= y_6^0 /\ undef50 = 0, {all remain the same}>
Variables:
x_5^0, y_6^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[38128 : 38129]
[38128 : 38133]
Successful child: 38133

Program does NOT terminate