/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, (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, l2, (undef13 = (0 + x2^0)) /\ (undef14 = undef14) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef17 = undef17) /\ (2 <= ((0 + undef13) + (~(2) * undef17))), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef13, oldX3^0 -> undef14, oldX4^0 -> undef15, oldX5^0 -> undef16, oldX6^0 -> undef17, x0^0 -> (0 + undef14), x1^0 -> (0 + undef15), x2^0 -> (0 + undef16)}>
<l3, l2, (undef23 = (0 + x2^0)) /\ (undef24 = undef24) /\ (undef25 = undef25) /\ (undef26 = undef26) /\ (undef27 = undef27) /\ (((1 + undef23) + (~(2) * undef27)) <= 0), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef23, oldX3^0 -> undef24, oldX4^0 -> undef25, oldX5^0 -> undef26, oldX6^0 -> undef27, x0^0 -> (0 + undef24), x1^0 -> (0 + undef25), x2^0 -> (0 + undef26)}>
<l3, l4, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (undef33 = (0 + x2^0)) /\ (undef34 = undef34) /\ (0 <= ((0 + undef33) + (~(2) * undef34))) /\ (((1 + undef33) + (~(2) * undef34)) <= 2), par{oldX0^0 -> undef31, oldX1^0 -> undef32, oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef31), x1^0 -> (1 + undef32), x2^0 -> (0 + undef34)}>
<l4, l1, (undef41 = (0 + x0^0)) /\ (undef42 = (0 + x1^0)) /\ (undef43 = (0 + x2^0)) /\ ((0 + undef43) <= 1), par{oldX0^0 -> undef41, oldX1^0 -> undef42, oldX2^0 -> undef43, x0^0 -> (0 + undef41), x1^0 -> (0 + undef42), x2^0 -> (0 + undef43)}>
<l4, l3, (undef51 = (0 + x0^0)) /\ (undef52 = (0 + x1^0)) /\ (undef53 = (0 + x2^0)) /\ (2 <= (0 + undef53)), par{oldX0^0 -> undef51, oldX1^0 -> undef52, oldX2^0 -> undef53, x0^0 -> (0 + undef51), x1^0 -> (0 + undef52), x2^0 -> (0 + undef53)}>
<l5, l4, (undef61 = (0 + x0^0)), par{oldX0^0 -> undef61, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), x0^0 -> (0 + undef61), x1^0 -> 0, x2^0 -> (0 + undef61)}>
<l6, l5, (undef71 = (0 + x0^0)) /\ (undef74 = undef74) /\ (undef75 = undef75), par{oldX0^0 -> undef71, oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> undef74, oldX4^0 -> undef75, x0^0 -> (0 + undef71), x1^0 -> (0 + undef74), x2^0 -> (0 + undef75)}>
<l6, l2, true>
<l6, l1, true>
<l6, l3, true>
<l6, l4, true>
<l6, l5, true>
<l7, l6, true>

Fresh variables:
undef4, undef5, undef6, undef13, undef14, undef15, undef16, undef17, undef23, undef24, undef25, undef26, undef27, undef31, undef32, undef33, undef34, undef41, undef42, undef43, undef51, undef52, undef53, undef61, undef71, undef74, undef75, 

Undef variables:
undef4, undef5, undef6, undef13, undef14, undef15, undef16, undef17, undef23, undef24, undef25, undef26, undef27, undef31, undef32, undef33, undef34, undef41, undef42, undef43, undef51, undef52, undef53, undef61, undef71, undef74, undef75, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef71 = (0 + x0^0)) /\ (undef74 = undef74) /\ (undef75 = undef75) /\ (undef61 = (0 + (0 + undef71))) /\ (undef41 = (0 + (0 + undef61))) /\ (undef42 = (0 + 0)) /\ (undef43 = (0 + (0 + undef61))) /\ ((0 + undef43) <= 1) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef71 = (0 + x0^0)) /\ (undef74 = undef74) /\ (undef75 = undef75) /\ (undef61 = (0 + (0 + undef71))) /\ (undef51 = (0 + (0 + undef61))) /\ (undef52 = (0 + 0)) /\ (undef53 = (0 + (0 + undef61))) /\ (2 <= (0 + undef53)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52), x2^0 -> (0 + undef53)}>
<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, (undef41 = (0 + x0^0)) /\ (undef42 = (0 + x1^0)) /\ (undef43 = (0 + x2^0)) /\ ((0 + undef43) <= 1) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef51 = (0 + x0^0)) /\ (undef52 = (0 + x1^0)) /\ (undef53 = (0 + x2^0)) /\ (2 <= (0 + undef53)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52), x2^0 -> (0 + undef53)}>
<l0, l2, (undef61 = (0 + x0^0)) /\ (undef41 = (0 + (0 + undef61))) /\ (undef42 = (0 + 0)) /\ (undef43 = (0 + (0 + undef61))) /\ ((0 + undef43) <= 1) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l0, l3, (undef61 = (0 + x0^0)) /\ (undef51 = (0 + (0 + undef61))) /\ (undef52 = (0 + 0)) /\ (undef53 = (0 + (0 + undef61))) /\ (2 <= (0 + undef53)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52), x2^0 -> (0 + undef53)}>
<l3, l2, (undef13 = (0 + x2^0)) /\ (undef14 = undef14) /\ (undef15 = undef15) /\ (undef16 = undef16) /\ (undef17 = undef17) /\ (2 <= ((0 + undef13) + (~(2) * undef17))), par{x0^0 -> (0 + undef14), x1^0 -> (0 + undef15), x2^0 -> (0 + undef16)}>
<l3, l2, (undef23 = (0 + x2^0)) /\ (undef24 = undef24) /\ (undef25 = undef25) /\ (undef26 = undef26) /\ (undef27 = undef27) /\ (((1 + undef23) + (~(2) * undef27)) <= 0), par{x0^0 -> (0 + undef24), x1^0 -> (0 + undef25), x2^0 -> (0 + undef26)}>
<l3, l2, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (undef33 = (0 + x2^0)) /\ (undef34 = undef34) /\ (0 <= ((0 + undef33) + (~(2) * undef34))) /\ (((1 + undef33) + (~(2) * undef34)) <= 2) /\ (undef41 = (0 + (0 + undef31))) /\ (undef42 = (0 + (1 + undef32))) /\ (undef43 = (0 + (0 + undef34))) /\ ((0 + undef43) <= 1) /\ (undef4 = undef4) /\ (undef5 = undef5) /\ (undef6 = undef6), par{x0^0 -> (0 + undef4), x1^0 -> (0 + undef5), x2^0 -> (0 + undef6)}>
<l3, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (undef33 = (0 + x2^0)) /\ (undef34 = undef34) /\ (0 <= ((0 + undef33) + (~(2) * undef34))) /\ (((1 + undef33) + (~(2) * undef34)) <= 2) /\ (undef51 = (0 + (0 + undef31))) /\ (undef52 = (0 + (1 + undef32))) /\ (undef53 = (0 + (0 + undef34))) /\ (2 <= (0 + undef53)), par{x0^0 -> (0 + undef51), x1^0 -> (0 + undef52), x2^0 -> (0 + undef53)}>

Fresh variables:
undef4, undef5, undef6, undef13, undef14, undef15, undef16, undef17, undef23, undef24, undef25, undef26, undef27, undef31, undef32, undef33, undef34, undef41, undef42, undef43, undef51, undef52, undef53, undef61, undef71, undef74, undef75, 

Undef variables:
undef4, undef5, undef6, undef13, undef14, undef15, undef16, undef17, undef23, undef24, undef25, undef26, undef27, undef31, undef32, undef33, undef34, undef41, undef42, undef43, undef51, undef52, undef53, undef61, undef71, undef74, undef75, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 2*undef34 <= undef33 /\ 2 <= undef53 /\ undef33 <= 1 + 2*undef34 /\ x0^0 = undef31 /\ x1^0 = undef32 /\ x2^0 = undef33 /\ undef31 = undef51 /\ undef34 = undef53 /\ 1 + undef32 = undef52, {x0^0 -> undef51, x1^0 -> undef52, x2^0 -> undef53, rest remain the same}>
Variables:
x0^0, x1^0, x2^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 2 <= undef53 /\ x0^0 = undef71 /\ undef51 = undef61 /\ undef52 = 0 /\ undef53 = undef61 /\ undef61 = undef71, {x0^0 -> undef51, x1^0 -> undef52, x2^0 -> undef53, rest remain the same}>
<l0, l3, true, {all remain the same}>
<l0, l3, 2 <= undef53 /\ x0^0 = undef51 /\ x1^0 = undef52 /\ x2^0 = undef53, {x0^0 -> undef51, x1^0 -> undef52, x2^0 -> undef53, rest remain the same}>
<l0, l3, 2 <= undef53 /\ x0^0 = undef61 /\ undef51 = undef61 /\ undef52 = 0 /\ undef53 = undef61, {x0^0 -> undef51, x1^0 -> undef52, x2^0 -> undef53, rest remain the same}>

Graph 2
<l0, l2, undef43 <= 1 /\ x0^0 = undef71 /\ undef41 = undef61 /\ undef42 = 0 /\ undef43 = undef61 /\ undef61 = undef71, {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, undef43 <= 1 /\ x0^0 = undef41 /\ x1^0 = undef42 /\ x2^0 = undef43, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l0, l2, undef43 <= 1 /\ x0^0 = undef61 /\ undef41 = undef61 /\ undef42 = 0 /\ undef43 = undef61, {x0^0 -> undef4, x1^0 -> undef5, x2^0 -> undef6, rest remain the same}>
<l3, l2, 2 + 2*undef17 <= undef13 /\ x2^0 = undef13, {x0^0 -> undef14, x1^0 -> undef15, x2^0 -> undef16, rest remain the same}>
<l3, l2, 1 + undef23 <= 2*undef27 /\ x2^0 = undef23, {x0^0 -> undef24, x1^0 -> undef25, x2^0 -> undef26, rest remain the same}>
<l3, l2, 2*undef34 <= undef33 /\ undef33 <= 1 + 2*undef34 /\ undef43 <= 1 /\ x0^0 = undef31 /\ x1^0 = undef32 /\ x2^0 = undef33 /\ undef31 = undef41 /\ undef34 = undef43 /\ 1 + undef32 = undef42, {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.003611

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001588s
Ranking function: -2 + (1 / 2)*x2^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l2}...
No cycles found.

Program Terminates