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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l7, true>
<l1, l2, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)), par{oldX0^0 -> undef1, oldX1^0 -> undef2, oldX2^0 -> undef3, x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> ((0 + (~(1) * undef2)) + undef3)}>
<l2, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef13, x0^0 -> (0 + undef10), x1^0 -> (0 + undef11), x2^0 -> (0 + undef13)}>
<l2, l3, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef22)}>
<l2, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l3, l4, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, oldX5^0 -> undef42, x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l5, l2, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)), par{oldX0^0 -> undef46, oldX1^0 -> undef47, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef46), x1^0 -> (0 + undef47), x2^0 -> (0 + undef46)}>
<l5, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0), par{oldX0^0 -> undef55, oldX1^0 -> undef56, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef55)}>
<l5, l3, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)), par{oldX0^0 -> undef64, oldX1^0 -> undef65, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef67, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef67)}>
<l6, l5, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76), par{oldX0^0 -> undef73, oldX1^0 -> undef74, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef76, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> (0 + undef76)}>
<l6, l4, true>
<l6, l1, true>
<l6, l2, true>
<l6, l3, true>
<l6, l5, true>
<l7, l6, true>

Fresh variables:
undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, 

Undef variables:
undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef46 = (0 + (0 + undef73))) /\ (undef47 = (0 + (0 + undef74))) /\ (1 <= (0 + undef46)) /\ (undef10 = (0 + (0 + undef46))) /\ (undef11 = (0 + (0 + undef47))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l1, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef46 = (0 + (0 + undef73))) /\ (undef47 = (0 + (0 + undef74))) /\ (1 <= (0 + undef46)) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef47))) /\ (undef30 = (0 + (0 + undef46))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef55 = (0 + (0 + undef73))) /\ (undef56 = (0 + (0 + undef74))) /\ ((1 + undef55) <= 0) /\ (undef10 = (0 + (0 + undef55))) /\ (undef11 = (0 + (0 + undef56))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef55 = (0 + (0 + undef73))) /\ (undef56 = (0 + (0 + undef74))) /\ ((1 + undef55) <= 0) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef21 = (0 + (0 + undef55))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ (undef64 = (0 + (0 + undef73))) /\ (undef65 = (0 + (0 + undef74))) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, true>
<l0, l1, true>
<l0, l4, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l0, l4, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)) /\ (undef10 = (0 + (0 + undef46))) /\ (undef11 = (0 + (0 + undef47))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l1, (undef46 = (0 + x0^0)) /\ (undef47 = (0 + x1^0)) /\ (1 <= (0 + undef46)) /\ (undef28 = (0 + (0 + undef46))) /\ (undef29 = (0 + (0 + undef47))) /\ (undef30 = (0 + (0 + undef46))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l0, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0) /\ (undef10 = (0 + (0 + undef55))) /\ (undef11 = (0 + (0 + undef56))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((1 + undef55) <= 0) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef21 = (0 + (0 + undef55))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l0, l4, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef67 = undef67) /\ ((0 + undef64) <= 0) /\ (0 <= (0 + undef64)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l1, l4, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef10 = (0 + (0 + undef1))) /\ (undef11 = (0 + (0 + undef2))) /\ (undef13 = undef13) /\ ((0 + undef11) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l1, l4, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef19 = (0 + (0 + undef1))) /\ (undef20 = (0 + (0 + undef2))) /\ (undef21 = (0 + ((0 + (~(1) * undef2)) + undef3))) /\ (undef22 = undef22) /\ ((0 + undef21) <= 0) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef42 = undef42), par{x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> (0 + undef42)}>
<l1, l1, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)) /\ (undef28 = (0 + (0 + undef1))) /\ (undef29 = (0 + (0 + undef2))) /\ (undef30 = (0 + ((0 + (~(1) * undef2)) + undef3))) /\ (1 <= (0 + undef30)) /\ (1 <= (0 + undef29)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>

Fresh variables:
undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, 

Undef variables:
undef1, undef2, undef3, undef10, undef11, undef13, undef19, undef20, undef21, undef22, undef28, undef29, undef30, undef40, undef41, undef42, undef46, undef47, undef55, undef56, undef64, undef65, undef67, undef73, undef74, undef76, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= undef29 /\ 1 <= undef30 /\ x0^0 = undef1 /\ x1^0 = undef2 /\ x2^0 = undef3 /\ undef1 = undef28 /\ undef2 + undef30 = undef3 /\ undef2 = undef29, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
Variables:
x0^0, x1^0, x2^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= undef29 /\ 1 <= undef30 /\ 1 <= undef46 /\ x0^0 = undef73 /\ x1^0 = undef74 /\ undef28 = undef46 /\ undef29 = undef47 /\ undef30 = undef46 /\ undef46 = undef73 /\ undef47 = undef74, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
<l0, l1, true, {all remain the same}>
<l0, l1, 1 <= undef29 /\ 1 <= undef30 /\ x0^0 = undef28 /\ x1^0 = undef29 /\ x2^0 = undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
<l0, l1, 1 <= undef29 /\ 1 <= undef30 /\ 1 <= undef46 /\ x0^0 = undef46 /\ x1^0 = undef47 /\ undef28 = undef46 /\ undef29 = undef47 /\ undef30 = undef46, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>

Graph 2
<l0, l4, undef11 <= 0 /\ 1 <= undef46 /\ x0^0 = undef73 /\ x1^0 = undef74 /\ undef10 = undef46 /\ undef11 = undef47 /\ undef46 = undef73 /\ undef47 = undef74, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef11 <= 0 /\ 1 + undef55 <= 0 /\ x0^0 = undef73 /\ x1^0 = undef74 /\ undef10 = undef55 /\ undef11 = undef56 /\ undef55 = undef73 /\ undef56 = undef74, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef21 <= 0 /\ 1 + undef55 <= 0 /\ x0^0 = undef73 /\ x1^0 = undef74 /\ undef19 = undef55 /\ undef20 = undef56 /\ undef21 = undef55 /\ undef55 = undef73 /\ undef56 = undef74, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, x0^0 = undef73 /\ x1^0 = undef74 /\ undef64 = 0 /\ undef64 = undef73 /\ undef65 = undef74, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, true, {all remain the same}>
<l0, l4, undef11 <= 0 /\ x0^0 = undef10 /\ x1^0 = undef11, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef21 <= 0 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ x2^0 = undef21, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, true, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef11 <= 0 /\ 1 <= undef46 /\ x0^0 = undef46 /\ x1^0 = undef47 /\ undef10 = undef46 /\ undef11 = undef47, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef11 <= 0 /\ 1 + undef55 <= 0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef10 = undef55 /\ undef11 = undef56, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, undef21 <= 0 /\ 1 + undef55 <= 0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef19 = undef55 /\ undef20 = undef56 /\ undef21 = undef55, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l0, l4, x0^0 = undef64 /\ x1^0 = undef65 /\ undef64 = 0, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l1, l4, undef11 <= 0 /\ x0^0 = undef1 /\ x1^0 = undef2 /\ x2^0 = undef3 /\ undef1 = undef10 /\ undef2 = undef11, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>
<l1, l4, undef21 <= 0 /\ x0^0 = undef1 /\ x1^0 = undef2 /\ x2^0 = undef3 /\ undef1 = undef19 /\ undef2 + undef21 = undef3 /\ undef2 = undef20, {x0^0 -> undef40, x1^0 -> undef41, x2^0 -> undef42, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001417s
Ranking function: -1 - x1^0 + x2^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l4}...
No cycles found.

Program Terminates