/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, l9, 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, l2, (undef9 = undef9) /\ (undef10 = undef10), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef9, oldX3^0 -> undef10, x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l3, l4, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l5, l1, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 2), par{oldX0^0 -> undef19, oldX1^0 -> undef20, x0^0 -> (0 + undef19), x1^0 -> (0 + undef20)}>
<l5, l3, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)), par{oldX0^0 -> undef25, oldX1^0 -> undef26, x0^0 -> (0 + undef25), x1^0 -> (0 + undef26)}>
<l6, l2, (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, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)), par{oldX0^0 -> undef37, oldX1^0 -> undef38, x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l7, l5, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0), par{oldX0^0 -> undef43, oldX1^0 -> undef44, x0^0 -> (0 + undef43), x1^0 -> (0 + undef44)}>
<l7, l6, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)), par{oldX0^0 -> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}>
<l4, l7, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)), par{oldX0^0 -> undef55, oldX1^0 -> undef56, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56)}>
<l8, l1, true>
<l8, l3, true>
<l8, l2, true>
<l8, l5, true>
<l8, l6, true>
<l8, l7, true>
<l8, l4, true>
<l9, l8, true>

Fresh variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Undef variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, true>
<l0, l2, (undef19 = (0 + x0^0)) /\ (undef20 = (0 + x1^0)) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef25 = (0 + x0^0)) /\ (undef26 = (0 + x1^0)) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l0, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + undef44))) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l0, l2, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l0, l4, (undef43 = (0 + x0^0)) /\ (undef44 = (0 + x1^0)) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l0, l4, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>
<l0, l4, true>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef19 = (0 + (0 + undef43))) /\ (undef20 = (0 + (0 + undef44))) /\ ((0 + undef20) <= 2) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef9 = undef9) /\ (undef10 = undef10), par{x0^0 -> (0 + undef9), x1^0 -> (0 + undef10)}>
<l4, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef43 = (0 + (0 + undef55))) /\ (undef44 = (0 + (0 + undef56))) /\ ((0 + undef43) <= 0) /\ (undef25 = (0 + (0 + undef43))) /\ (undef26 = (0 + (0 + undef44))) /\ (3 <= (0 + undef26)) /\ (undef13 = (0 + (0 + undef25))) /\ (undef14 = (0 + (0 + undef26))), par{x0^0 -> (1 + undef13), x1^0 -> (~(2) + undef14)}>
<l4, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef55))) /\ (undef50 = (0 + (0 + undef56))) /\ (1 <= (0 + undef49)) /\ (undef33 = undef33) /\ (undef34 = undef34), par{x0^0 -> (0 + undef33), x1^0 -> (0 + undef34)}>
<l4, l4, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef55))) /\ (undef50 = (0 + (0 + undef56))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))), par{x0^0 -> (~(1) + undef37), x1^0 -> (1 + undef38)}>

Fresh variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Undef variables:
undef3, undef4, undef9, undef10, undef13, undef14, undef19, undef20, undef25, undef26, undef33, undef34, undef37, undef38, undef43, undef44, undef49, undef50, undef55, undef56, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l4, l4, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Variables:
x0^0, x1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, 3 <= undef26 /\ x0^0 = undef25 /\ x1^0 = undef26 /\ undef13 = undef25 /\ undef14 = undef26, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
<l0, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
<l0, l4, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
<l0, l4, true, {all remain the same}>

Graph 2
<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, true, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, true, {all remain the same}>
<l0, l2, undef20 <= 2 /\ x0^0 = undef19 /\ x1^0 = undef20, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, 3 <= undef26 /\ x0^0 = undef25 /\ x1^0 = undef26, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, true, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>
<l0, l2, undef43 <= 0 /\ undef20 <= 2 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef19 = undef43 /\ undef20 = undef44, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l0, l2, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef43 /\ x1^0 = undef44 /\ undef25 = undef43 /\ undef26 = undef44, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l0, l2, 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>
<l4, l2, undef43 <= 0 /\ undef20 <= 2 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef19 = undef43 /\ undef20 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
<l4, l2, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> undef9, x1^0 -> undef10, rest remain the same}>
<l4, l2, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> undef33, x1^0 -> undef34, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002119s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.021076s
[55279 : 55280]
[55279 : 55281]
Successful child: 55280
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 128 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= undef49 /\ 0 <= 128 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 128 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 <= undef49 /\ 0 <= 128 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Ranking function: 252 + 4*x0^0 + 2*x1^0
New Graphs: 
Transitions:
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ 0 <= 128 + x1^0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001796s
Ranking function: -x0^0
New Graphs: 
[55279 : 55285]
[55279 : 55286]
[55279 : 55287]
[55279 : 55288]
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: 0 <= 128 + x1^0 , 
It's unfeasible. Removing transition: 
<l4, l4, undef43 <= 0 /\ 3 <= undef26 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef13 = undef25 /\ undef14 = undef26 /\ undef25 = undef43 /\ undef26 = undef44 /\ undef43 = undef55 /\ undef44 = undef56, {x0^0 -> 1 + undef13, x1^0 -> -2 + undef14, rest remain the same}>
Narrowing transition: 
<l4, l4, 1 <= undef49 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l4, l4, 1 <= undef49 /\ 129 + x1^0 <= 0 /\ x0^0 = undef55 /\ x1^0 = undef56 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef55 /\ undef50 = undef56, {x0^0 -> -1 + undef37, x1^0 -> 1 + undef38, rest remain the same}>
Variables:
x0^0, x1^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

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

Program Terminates