/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, l4, true>
<l1, l2, (0 <= (0 + x^0)) /\ ((0 + x^0) <= 1), par{x^0 -> (1 + (~(1) * x^0))}>
<l2, l1, true>
<l3, l1, true>
<l4, l3, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^0, rest remain the same}>
Variables:
x^0

Precedence: 
Graph 0

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

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

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000492s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001455s
[15165 : 15166]
[15165 : 15167]
Successful child: 15166
[ 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, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^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
It's unfeasible. Removing transition: 
<l1, l1, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000485s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001502s
[15165 : 15171]
[15165 : 15172]
Successful child: 15171
[ 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, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l1, l1, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^0, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000391s
INVARIANTS: 
1: 
Quasi-INVARIANTS to narrow Graph: 
1: 2 <= x^0 , 
Narrowing transition: 
<l1, l1, 0 <= x^0 /\ x^0 <= 1, {x^0 -> 1 - x^0, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000488s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001486s
[15165 : 15176]
[15165 : 15177]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004079s
Time used: 0.003845

[15165 : 15181]
[15165 : 15185]
Successful child: 15181

Program does NOT terminate