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


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


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l13, true>
<l1, l2, (undef3 = undef3), par{i6^0 -> undef3}>
<l1, l3, true, par{ret_f19^0 -> 1}>
<l3, l4, true, par{tmp^0 -> (0 + ret_f19^0)}>
<l5, l3, true, par{ret_f19^0 -> (0 + ret28^0)}>
<l6, l3, ((0 + ret28^0) <= 0) /\ (0 <= (0 + ret28^0)), par{ret_f19^0 -> 0}>
<l6, l5, (1 <= (0 + ret28^0))>
<l6, l5, ((1 + ret28^0) <= 0)>
<l7, l1, true>
<l7, l4, true>
<l8, l3, true, par{ret_f19^0 -> (0 + ret17^0)}>
<l9, l2, ((0 + ret17^0) <= 0) /\ (0 <= (0 + ret17^0)), par{i6^0 -> (~(1) + i6^0)}>
<l9, l8, (1 <= (0 + ret17^0))>
<l9, l8, ((1 + ret17^0) <= 0)>
<l2, l10, true>
<l11, l9, (undef164 = undef164) /\ (undef161 = 0), par{data16^0 -> (0 + undef164), ret17^0 -> (0 + undef161), ret_f212^0 -> undef161, val10^0 -> undef164}>
<l10, l6, ((0 + i6^0) <= 0) /\ (0 <= (0 + i6^0)) /\ (undef176 = undef176) /\ (undef173 = 0), par{data18^0 -> (0 + undef176), ret28^0 -> (0 + undef173), ret_f215^0 -> undef173, val13^0 -> undef176}>
<l10, l11, (1 <= (0 + i6^0))>
<l10, l11, ((1 + i6^0) <= 0)>
<l12, l7, true>
<l13, l12, true>

Fresh variables:
undef3, undef161, undef164, undef173, undef176, 

Undef variables:
undef3, undef161, undef164, undef173, undef176, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (undef3 = undef3), par{i6^0 -> undef3}>
<l0, l4, true>
<l0, l4, true>
<l2, l4, ((0 + i6^0) <= 0) /\ (0 <= (0 + i6^0)) /\ (undef176 = undef176) /\ (undef173 = 0) /\ ((0 + (0 + undef173)) <= 0) /\ (0 <= (0 + (0 + undef173)))>
<l2, l2, (1 <= (0 + i6^0)) /\ (undef164 = undef164) /\ (undef161 = 0) /\ ((0 + (0 + undef161)) <= 0) /\ (0 <= (0 + (0 + undef161))), par{i6^0 -> (~(1) + i6^0)}>
<l2, l2, ((1 + i6^0) <= 0) /\ (undef164 = undef164) /\ (undef161 = 0) /\ ((0 + (0 + undef161)) <= 0) /\ (0 <= (0 + (0 + undef161))), par{i6^0 -> (~(1) + i6^0)}>

Fresh variables:
undef3, undef161, undef164, undef173, undef176, 

Undef variables:
undef3, undef161, undef164, undef173, undef176, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= i6^0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
Variables:
i6^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {i6^0 -> undef3, rest remain the same}>

Graph 2
<l0, l4, true, {all remain the same}>
<l0, l4, true, {all remain the same}>
<l2, l4, i6^0 = 0 /\ undef173 = 0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001003s
Ranking function: 1 + i6^0
New Graphs: 
Transitions:
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
Variables:
i6^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000431s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001484s
[22335 : 22336]
[22335 : 22337]
Successful child: 22336
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= i6^0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:0 <= i6^0 - Process 1
* Exit transition: <l0, l2, true, {i6^0 -> undef3, rest remain the same}>
* Postcondition  : 0 <= i6^0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000392s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: 0 <= i6^0 , 
It's unfeasible. Removing transition: 
<l2, l2, 1 <= i6^0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
Narrowing transition: 
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l2, l2, 1 + i6^0 <= 0 /\ undef161 = 0, {i6^0 -> -1 + i6^0, rest remain the same}>
Variables:
i6^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000464s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001568s
[22335 : 22341]
[22335 : 22342]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014274s
Time used: 0.014269

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000448s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001531s
[22335 : 22346]
[22335 : 22347]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004610s
Time used: 0.004337

[22335 : 22351]
[22335 : 22355]
Successful child: 22351

Program does NOT terminate