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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l11, 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 -> (1 + undef3)}>
<l3, l1, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)), par{oldX0^0 -> undef10, oldX1^0 -> undef11, oldX2^0 -> undef12, x0^0 -> (0 + undef10), x1^0 -> (0 + undef11), x2^0 -> (0 + undef12)}>
<l4, l5, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef22 = undef22), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> (0 + x2^0), oldX3^0 -> undef22, x0^0 -> (0 + undef19), x1^0 -> (1 + undef20), x2^0 -> (0 + undef22)}>
<l6, l1, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (undef31 = undef31) /\ (undef32 = undef32) /\ ((0 + undef31) <= (0 + undef32)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, oldX3^0 -> undef31, oldX4^0 -> undef32, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l6, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (undef39 = (0 + x2^0)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ ((1 + undef41) <= (0 + undef40)), par{oldX0^0 -> undef37, oldX1^0 -> undef38, oldX2^0 -> undef39, oldX3^0 -> undef40, oldX4^0 -> undef41, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38), x2^0 -> (0 + undef39)}>
<l7, l8, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef49, oldX4^0 -> undef50, oldX5^0 -> undef51, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l2, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef57 = (0 + x2^0)) /\ (((0 + undef55) + (~(1) * undef56)) <= (0 + undef57)), par{oldX0^0 -> undef55, oldX1^0 -> undef56, oldX2^0 -> undef57, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56), x2^0 -> (0 + undef57)}>
<l2, l6, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef66 = (0 + x2^0)) /\ ((1 + undef66) <= ((0 + undef64) + (~(1) * undef65))), par{oldX0^0 -> undef64, oldX1^0 -> undef65, oldX2^0 -> undef66, x0^0 -> (0 + undef64), x1^0 -> (0 + undef65), x2^0 -> (0 + undef66)}>
<l5, l7, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)), 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)}>
<l5, l2, (undef82 = (0 + x0^0)) /\ (undef83 = (0 + x1^0)) /\ ((1 + undef83) <= (0 + undef82)), par{oldX0^0 -> undef82, oldX1^0 -> undef83, oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l9, l5, (undef91 = (0 + x0^0)) /\ (undef94 = undef94), par{oldX0^0 -> undef91, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef94, x0^0 -> (0 + undef91), x1^0 -> 1, x2^0 -> (0 + undef94)}>
<l10, l9, (undef100 = (0 + x0^0)) /\ (undef103 = undef103) /\ (undef104 = undef104), par{oldX0^0 -> undef100, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef103, oldX4^0 -> undef104, x0^0 -> (0 + undef100), x1^0 -> (0 + undef103), x2^0 -> (0 + undef104)}>
<l10, l1, true>
<l10, l3, true>
<l10, l4, true>
<l10, l6, true>
<l10, l7, true>
<l10, l2, true>
<l10, l5, true>
<l10, l9, true>
<l10, l8, true>
<l11, l10, true>

Fresh variables:
undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, 

Undef variables:
undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l8, (undef100 = (0 + x0^0)) /\ (undef103 = undef103) /\ (undef104 = undef104) /\ (undef91 = (0 + (0 + undef100))) /\ (undef94 = undef94) /\ (undef73 = (0 + (0 + undef91))) /\ (undef74 = (0 + 1)) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)) /\ (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l0, l2, (undef100 = (0 + x0^0)) /\ (undef103 = undef103) /\ (undef104 = undef104) /\ (undef91 = (0 + (0 + undef100))) /\ (undef94 = undef94) /\ (undef82 = (0 + (0 + undef91))) /\ (undef83 = (0 + 1)) /\ ((1 + undef83) <= (0 + undef82)), par{x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l0, l2, (undef1 = (0 + x0^0)) /\ (undef2 = (0 + x1^0)) /\ (undef3 = (0 + x2^0)), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>
<l0, l2, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef1 = (0 + (0 + undef10))) /\ (undef2 = (0 + (0 + undef11))) /\ (undef3 = (0 + (0 + undef12))), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>
<l0, l8, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef22 = undef22) /\ (undef73 = (0 + (0 + undef19))) /\ (undef74 = (0 + (1 + undef20))) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)) /\ (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef22 = undef22) /\ (undef82 = (0 + (0 + undef19))) /\ (undef83 = (0 + (1 + undef20))) /\ ((1 + undef83) <= (0 + undef82)), par{x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l0, l2, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ (undef31 = undef31) /\ (undef32 = undef32) /\ ((0 + undef31) <= (0 + undef32)) /\ (undef1 = (0 + (0 + undef28))) /\ (undef2 = (0 + (0 + undef29))) /\ (undef3 = (0 + (0 + undef30))), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>
<l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ (undef39 = (0 + x2^0)) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ ((1 + undef41) <= (0 + undef40)) /\ (undef10 = (0 + (0 + undef37))) /\ (undef11 = (0 + (0 + undef38))) /\ (undef12 = (0 + (0 + undef39))) /\ (undef1 = (0 + (0 + undef10))) /\ (undef2 = (0 + (0 + undef11))) /\ (undef3 = (0 + (0 + undef12))), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>
<l0, l8, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l0, l2, true>
<l0, l8, (undef73 = (0 + x0^0)) /\ (undef74 = (0 + x1^0)) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)) /\ (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l0, l2, (undef82 = (0 + x0^0)) /\ (undef83 = (0 + x1^0)) /\ ((1 + undef83) <= (0 + undef82)), par{x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l0, l8, (undef91 = (0 + x0^0)) /\ (undef94 = undef94) /\ (undef73 = (0 + (0 + undef91))) /\ (undef74 = (0 + 1)) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)) /\ (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l0, l2, (undef91 = (0 + x0^0)) /\ (undef94 = undef94) /\ (undef82 = (0 + (0 + undef91))) /\ (undef83 = (0 + 1)) /\ ((1 + undef83) <= (0 + undef82)), par{x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l0, l8, true>
<l2, l8, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef57 = (0 + x2^0)) /\ (((0 + undef55) + (~(1) * undef56)) <= (0 + undef57)) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef22 = undef22) /\ (undef73 = (0 + (0 + undef19))) /\ (undef74 = (0 + (1 + undef20))) /\ (undef76 = undef76) /\ ((0 + undef73) <= (0 + undef74)) /\ (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51), par{x0^0 -> (0 + undef49), x1^0 -> (0 + undef50), x2^0 -> (0 + undef51)}>
<l2, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef57 = (0 + x2^0)) /\ (((0 + undef55) + (~(1) * undef56)) <= (0 + undef57)) /\ (undef19 = (0 + (0 + undef55))) /\ (undef20 = (0 + (0 + undef56))) /\ (undef22 = undef22) /\ (undef82 = (0 + (0 + undef19))) /\ (undef83 = (0 + (1 + undef20))) /\ ((1 + undef83) <= (0 + undef82)), par{x0^0 -> (0 + undef82), x1^0 -> (0 + undef83), x2^0 -> 0}>
<l2, l2, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef66 = (0 + x2^0)) /\ ((1 + undef66) <= ((0 + undef64) + (~(1) * undef65))) /\ (undef28 = (0 + (0 + undef64))) /\ (undef29 = (0 + (0 + undef65))) /\ (undef30 = (0 + (0 + undef66))) /\ (undef31 = undef31) /\ (undef32 = undef32) /\ ((0 + undef31) <= (0 + undef32)) /\ (undef1 = (0 + (0 + undef28))) /\ (undef2 = (0 + (0 + undef29))) /\ (undef3 = (0 + (0 + undef30))), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>
<l2, l2, (undef64 = (0 + x0^0)) /\ (undef65 = (0 + x1^0)) /\ (undef66 = (0 + x2^0)) /\ ((1 + undef66) <= ((0 + undef64) + (~(1) * undef65))) /\ (undef37 = (0 + (0 + undef64))) /\ (undef38 = (0 + (0 + undef65))) /\ (undef39 = (0 + (0 + undef66))) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ ((1 + undef41) <= (0 + undef40)) /\ (undef10 = (0 + (0 + undef37))) /\ (undef11 = (0 + (0 + undef38))) /\ (undef12 = (0 + (0 + undef39))) /\ (undef1 = (0 + (0 + undef10))) /\ (undef2 = (0 + (0 + undef11))) /\ (undef3 = (0 + (0 + undef12))), par{x0^0 -> (0 + undef1), x1^0 -> (0 + undef2), x2^0 -> (1 + undef3)}>

Fresh variables:
undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, 

Undef variables:
undef1, undef2, undef3, undef10, undef11, undef12, undef19, undef20, undef22, undef28, undef29, undef30, undef31, undef32, undef37, undef38, undef39, undef40, undef41, undef49, undef50, undef51, undef55, undef56, undef57, undef64, undef65, undef66, undef73, undef74, undef76, undef82, undef83, undef91, undef94, undef100, undef103, undef104, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, undef55 <= undef56 + undef57 /\ 1 + undef83 <= undef82 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ x2^0 = undef57 /\ undef19 = undef55 /\ undef19 = undef82 /\ undef20 = undef56 /\ 1 + undef20 = undef83, {x0^0 -> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}>
<l2, l2, undef31 <= undef32 /\ 1 + undef65 + undef66 <= undef64 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ x2^0 = undef66 /\ undef1 = undef28 /\ undef2 = undef29 /\ undef3 = undef30 /\ undef28 = undef64 /\ undef29 = undef65 /\ undef30 = undef66, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l2, l2, 1 + undef41 <= undef40 /\ 1 + undef65 + undef66 <= undef64 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ x2^0 = undef66 /\ undef1 = undef10 /\ undef2 = undef11 /\ undef3 = undef12 /\ undef10 = undef37 /\ undef11 = undef38 /\ undef12 = undef39 /\ undef37 = undef64 /\ undef38 = undef65 /\ undef39 = undef66, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
Variables:
x0^0, x1^0, x2^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 + undef83 <= undef82 /\ x0^0 = undef100 /\ undef82 = undef91 /\ undef91 = undef100 /\ undef83 = 1, {x0^0 -> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}>
<l0, l2, x0^0 = undef1 /\ x1^0 = undef2 /\ x2^0 = undef3, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l0, l2, x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef1 = undef10 /\ undef2 = undef11 /\ undef3 = undef12, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l0, l2, 1 + undef83 <= undef82 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef19 = undef82 /\ 1 + undef20 = undef83, {x0^0 -> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}>
<l0, l2, undef31 <= undef32 /\ x0^0 = undef28 /\ x1^0 = undef29 /\ x2^0 = undef30 /\ undef1 = undef28 /\ undef2 = undef29 /\ undef3 = undef30, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l0, l2, 1 + undef41 <= undef40 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ x2^0 = undef39 /\ undef1 = undef10 /\ undef2 = undef11 /\ undef3 = undef12 /\ undef10 = undef37 /\ undef11 = undef38 /\ undef12 = undef39, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, 1 + undef83 <= undef82 /\ x0^0 = undef82 /\ x1^0 = undef83, {x0^0 -> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}>
<l0, l2, 1 + undef83 <= undef82 /\ x0^0 = undef91 /\ undef82 = undef91 /\ undef83 = 1, {x0^0 -> undef82, x1^0 -> undef83, x2^0 -> 0, rest remain the same}>

Graph 2
<l0, l8, undef73 <= undef74 /\ x0^0 = undef100 /\ undef73 = undef91 /\ undef91 = undef100 /\ undef74 = 1, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>
<l0, l8, undef73 <= undef74 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ undef19 = undef73 /\ 1 + undef20 = undef74, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>
<l0, l8, true, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>
<l0, l8, undef73 <= undef74 /\ x0^0 = undef73 /\ x1^0 = undef74, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>
<l0, l8, undef73 <= undef74 /\ x0^0 = undef91 /\ undef73 = undef91 /\ undef74 = 1, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>
<l0, l8, true, {all remain the same}>
<l2, l8, undef55 <= undef56 + undef57 /\ undef73 <= undef74 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ x2^0 = undef57 /\ undef19 = undef55 /\ undef19 = undef73 /\ undef20 = undef56 /\ 1 + undef20 = undef74, {x0^0 -> undef49, x1^0 -> undef50, x2^0 -> undef51, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006335s
Ranking function: -2 + x0^0 - x1^0
New Graphs: 
Transitions:
<l2, l2, undef31 <= undef32 /\ 1 + undef65 + undef66 <= undef64 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ x2^0 = undef66 /\ undef1 = undef28 /\ undef2 = undef29 /\ undef3 = undef30 /\ undef28 = undef64 /\ undef29 = undef65 /\ undef30 = undef66, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
<l2, l2, 1 + undef41 <= undef40 /\ 1 + undef65 + undef66 <= undef64 /\ x0^0 = undef64 /\ x1^0 = undef65 /\ x2^0 = undef66 /\ undef1 = undef10 /\ undef2 = undef11 /\ undef3 = undef12 /\ undef10 = undef37 /\ undef11 = undef38 /\ undef12 = undef39 /\ undef37 = undef64 /\ undef38 = undef65 /\ undef39 = undef66, {x0^0 -> undef1, x1^0 -> undef2, x2^0 -> 1 + undef3, rest remain the same}>
Variables:
x0^0, x1^0, x2^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

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

Program Terminates