/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, l7, true>
<l1, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef4, oldX4^0 -> undef5, oldX5^0 -> undef6, x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l4, (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 -> (1 + undef11), x2^0 -> (1 + undef12)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef19) <= (0 + undef20)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, oldX2^0 -> undef21, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20), x2^0 -> (0 + undef21)}>
<l4, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ ((1 + undef29) <= (0 + undef28)), par{oldX0^0 -> undef28, oldX1^0 -> undef29, oldX2^0 -> undef30, x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l5, l4, (undef40 = undef40) /\ (undef41 = undef41), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef40, oldX4^0 -> undef41, x0^0 -> (0 + undef40), x1^0 -> (0 + undef41), x2^0 -> 0}>
<l6, l5, (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)}>
<l6, l2, true>
<l6, l1, true>
<l6, l3, true>
<l6, l4, true>
<l6, l5, true>
<l7, l6, true>

Fresh variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 

Undef variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + (0 + undef40))) /\ (undef20 = (0 + (0 + undef41))) /\ (undef21 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef49 = undef49) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + (0 + undef40))) /\ (undef29 = (0 + (0 + undef41))) /\ (undef30 = (0 + 0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l0, l2, true>
<l0, l2, (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, true>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ (undef21 = (0 + x2^0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef28 = (0 + x0^0)) /\ (undef29 = (0 + x1^0)) /\ (undef30 = (0 + x2^0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l0, l2, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef19 = (0 + (0 + undef40))) /\ (undef20 = (0 + (0 + undef41))) /\ (undef21 = (0 + 0)) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef40 = undef40) /\ (undef41 = undef41) /\ (undef28 = (0 + (0 + undef40))) /\ (undef29 = (0 + (0 + undef41))) /\ (undef30 = (0 + 0)) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>
<l3, l2, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef19 = (0 + (0 + undef10))) /\ (undef20 = (0 + (1 + undef11))) /\ (undef21 = (0 + (1 + undef12))) /\ ((0 + undef19) <= (0 + undef20)) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l3, (undef10 = (0 + x0^0)) /\ (undef11 = (0 + x1^0)) /\ (undef12 = (0 + x2^0)) /\ (undef28 = (0 + (0 + undef10))) /\ (undef29 = (0 + (1 + undef11))) /\ (undef30 = (0 + (1 + undef12))) /\ ((1 + undef29) <= (0 + undef28)), par{x0^0 -> (0 + undef28), x1^0 -> (0 + undef29), x2^0 -> (0 + undef30)}>

Fresh variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 

Undef variables:
undef4, undef5, undef6, undef10, undef11, undef12, undef19, undef20, undef21, undef28, undef29, undef30, undef40, undef41, undef49, undef50, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + undef29 <= undef28 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef28 /\ 1 + undef11 = undef29 /\ 1 + undef12 = undef30, {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, l3, 1 + undef29 <= undef28 /\ undef28 = undef40 /\ undef29 = undef41 /\ undef30 = 0, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
<l0, l3, true, {all remain the same}>
<l0, l3, 1 + undef29 <= undef28 /\ x0^0 = undef28 /\ x1^0 = undef29 /\ x2^0 = undef30, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>
<l0, l3, 1 + undef29 <= undef28 /\ undef28 = undef40 /\ undef29 = undef41 /\ undef30 = 0, {x0^0 -> undef28, x1^0 -> undef29, x2^0 -> undef30, rest remain the same}>

Graph 2
<l0, l2, undef19 <= undef20 /\ undef19 = undef40 /\ undef20 = undef41 /\ undef21 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef19 <= undef20 /\ x0^0 = undef19 /\ x1^0 = undef20 /\ x2^0 = undef21, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef19 <= undef20 /\ undef19 = undef40 /\ undef20 = undef41 /\ undef21 = 0, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l3, l2, undef19 <= undef20 /\ x0^0 = undef10 /\ x1^0 = undef11 /\ x2^0 = undef12 /\ undef10 = undef19 /\ 1 + undef11 = undef20 /\ 1 + undef12 = undef21, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates