/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, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l4, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)), par{oldX0^0 -> undef7, oldX1^0 -> undef8, x0^0 -> (0 + (2 * undef7)), x1^0 -> (1 + undef8)}>
<l4, l1, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((0 + undef13) <= 2), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (0 + undef14)}>
<l4, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= (0 + undef19)), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l4, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l5, l4, (undef33 = undef33) /\ (undef34 = undef34), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef33, oldX3^0 -> undef34, x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l6, l5, (undef39 = undef39) /\ (undef40 = undef40), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef39, oldX3^0 -> undef40, x0^0 -> (0 + undef39), x1^0 -> (0 + undef40)}>
<l6, l2, true>
<l6, l1, true>
<l6, l3, true>
<l6, l4, true>
<l6, l5, true>
<l7, l6, true>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef13 = (0 + (0 + undef33))) /\ (undef14 = (0 + (0 + undef34))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef19 = (0 + (0 + undef33))) /\ (undef20 = (0 + (0 + undef34))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef39 = undef39) /\ (undef40 = undef40) /\ (undef33 = undef33) /\ (undef34 = undef34) /\ (undef25 = (0 + (0 + undef33))) /\ (undef26 = (0 + (0 + undef34))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l0, l2, true>
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, true>
<l0, l2, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l0, l2, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef13 = (0 + (0 + undef33))) /\ (undef14 = (0 + (0 + undef34))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef19 = (0 + (0 + undef33))) /\ (undef20 = (0 + (0 + undef34))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l3, (undef33 = undef33) /\ (undef34 = undef34) /\ (undef25 = (0 + (0 + undef33))) /\ (undef26 = (0 + (0 + undef34))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef13 = (0 + (0 + (2 * undef7)))) /\ (undef14 = (0 + (1 + undef8))) /\ ((0 + undef13) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l2, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef19 = (0 + (0 + (2 * undef7)))) /\ (undef20 = (0 + (1 + undef8))) /\ ((0 + undef20) <= (0 + undef19)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l3, l3, (undef7 = (0 + x0^0)) /\ (undef8 = (0 + x1^0)) /\ (undef25 = (0 + (0 + (2 * undef7)))) /\ (undef26 = (0 + (1 + undef8))) /\ ((1 + undef25) <= (0 + undef26)) /\ (3 <= (0 + undef25)), par{x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>

Fresh variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 

Undef variables:
undef3, undef4, undef7, undef8, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef39, undef40, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef25 /\ 1 + undef8 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ undef25 = undef33 /\ undef26 = undef34, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
<l0, l3, true, {all remain the same}>
<l0, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>
<l0, l3, 1 + undef25 <= undef26 /\ 3 <= undef25 /\ undef25 = undef33 /\ undef26 = undef34, {x0^0 -> undef25, x1^0 -> undef26, rest remain the same}>

Graph 2
<l0, l2, undef13 <= 2 /\ undef13 = undef33 /\ undef14 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef20 <= undef19 /\ undef19 = undef33 /\ undef20 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef13 <= 2 /\ x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef20 <= undef19 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef13 <= 2 /\ undef13 = undef33 /\ undef14 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef20 <= undef19 /\ undef19 = undef33 /\ undef20 = undef34, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, undef13 <= 2 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef13 /\ 1 + undef8 = undef14, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l3, l2, undef20 <= undef19 /\ x0^0 = undef7 /\ x1^0 = undef8 /\ 2*undef7 = undef19 /\ 1 + undef8 = undef20, {x0^0 -> undef3, x1^0 -> undef4, 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.002721

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

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

Program Terminates