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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l6, true>
<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + x_5^0) + (~(1) * y_6^0)) <= 0) /\ (undef1 = undef1), par{Result_4^0 -> undef1}>
<l1, l3, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (0 <= ((~(1) + x_5^0) + (~(1) * y_6^0))), par{x_5^0 -> (1 + x_5^0)}>
<l3, l1, true>
<l1, l4, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)), par{x_5^0 -> (1 + x_5^0)}>
<l4, l1, true>
<l5, l1, true>
<l6, l5, true>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, true>
<l1, l2, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (((0 + x_5^0) + (~(1) * y_6^0)) <= 0) /\ (undef1 = undef1)>
<l1, l1, (((0 + (~(1) * x_5^0)) + y_6^0) <= 0) /\ (0 <= ((~(1) + x_5^0) + (~(1) * y_6^0))), par{x_5^0 -> (1 + x_5^0)}>
<l1, l1, (0 <= ((~(1) + (~(1) * x_5^0)) + y_6^0)), par{x_5^0 -> (1 + x_5^0)}>

Fresh variables:
undef1, 

Undef variables:
undef1, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l1, true, {all remain the same}>

Graph 2
<l1, l2, x_5^0 = y_6^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001331s
Ranking function: 1 - x_5^0 + y_6^0
New Graphs: 
Transitions:
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000617s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001718s
[12456 : 12457]
[12456 : 12458]
Successful child: 12457
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:x_5^0 <= y_6^0 - Process 1
* Exit transition: <l0, l1, true, {all remain the same}>
* Postcondition  : x_5^0 <= y_6^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000322s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000395s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: x_5^0 <= y_6^0 , 
Narrowing transition: 
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l1, l1, 1 + x_5^0 <= y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000660s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001794s
[12456 : 12462]
[12456 : 12463]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006364s
Time used: 0.006046
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012330s
Time used: 0.01232

LOG: SAT solveNonLinear - Elapsed time: 0.018695s
Cost: 1; Total time: 0.018366
Quasi-ranking function: 50000 - x_5^0 + y_6^0
New Graphs: 
Transitions:
<l1, l1, 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000432s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001612s
[12456 : 12467]
[12456 : 12468]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006674s
Time used: 0.006284
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012727s
Time used: 0.012723

LOG: SAT solveNonLinear - Elapsed time: 0.019401s
Cost: 1; Total time: 0.019007
Termination implied by a set of invariant(s):
Invariant at l1: 1 + y_6^0 <= x_5^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, 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): 
<l1, l1, 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Quasi-ranking function: 50000 - x_5^0
New Graphs: 
Transitions:
<l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000534s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001922s
[12456 : 12472]
[12456 : 12473]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006953s
Time used: 0.006541
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009619s
Time used: 0.009616

LOG: SAT solveNonLinear - Elapsed time: 0.016572s
Cost: 1; Total time: 0.016157
Quasi-ranking function: 50000 - x_5^0 - y_6^0
New Graphs: 
Transitions:
<l1, l1, 50001 <= x_5^0 /\ 50001 + y_6^0 <= x_5^0 /\ 50001 <= x_5^0 + y_6^0, {x_5^0 -> 1 + x_5^0, rest remain the same}>
Variables:
x_5^0, y_6^0
Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000616s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002218s
[12456 : 12477]
[12456 : 12478]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007854s
Time used: 0.007484

[12456 : 12590]
[12456 : 12594]
Successful child: 12590

Program does NOT terminate