/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, l7, true>
<l1, l2, true>
<l3, l1, ((1 + sx^0) <= 1)>
<l3, l1, ((0 + ox^0) <= (0 + x^0))>
<l4, l5, true, par{x^0 -> (0 + z^0), y^0 -> (~(1) + y^0)}>
<l4, l5, true, par{x^0 -> (~(1) + x^0)}>
<l5, l4, true, par{c^0 -> 1, ox^0 -> (0 + x^0), oy^0 -> (0 + y^0), oz^0 -> (0 + z^0), sx^0 -> (0 + x^0), sy^0 -> (0 + y^0), sz^0 -> (0 + z^0)}>
<l5, l3, (1 <= (0 + c^0))>
<l5, l4, (1 <= (0 + x^0))>
<l5, l4, (1 <= (0 + x^0)), par{sx^0 -> (0 + x^0), sy^0 -> (0 + y^0), sz^0 -> (0 + z^0)}>
<l6, l5, true, par{c^0 -> 0}>
<l7, l6, true>

Fresh variables:

Undef variables:

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (c^0 = 0)>
<l5, l5, true, par{c^0 -> 1, ox^0 -> (0 + x^0), sx^0 -> (0 + x^0), x^0 -> (0 + z^0), y^0 -> (~(1) + y^0)}>
<l5, l5, true, par{c^0 -> 1, ox^0 -> (0 + x^0), sx^0 -> (0 + x^0), x^0 -> (~(1) + x^0)}>
<l5, l2, (1 <= (0 + c^0)) /\ ((1 + sx^0) <= 1)>
<l5, l2, (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + x^0))>
<l5, l5, (1 <= (0 + x^0)), par{x^0 -> (0 + z^0), y^0 -> (~(1) + y^0)}>
<l5, l5, (1 <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}>
<l5, l5, (1 <= (0 + x^0)), par{sx^0 -> (0 + x^0), x^0 -> (0 + z^0), y^0 -> (~(1) + y^0)}>
<l5, l5, (1 <= (0 + x^0)), par{sx^0 -> (0 + x^0), x^0 -> (~(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:
<l5, l5, true, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, true, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
<l5, l5, 1 <= x^0, {x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, 1 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
<l5, l5, 1 <= x^0, {sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, 1 <= x^0, {sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
Variables:
ox^0, sx^0, x^0, y^0, z^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l5, c^0 = 0, {all remain the same}>

Graph 2
<l5, l2, 1 <= c^0 /\ sx^0 <= 0, {all remain the same}>
<l5, l2, 1 <= c^0 /\ ox^0 <= x^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003299s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011281s
[44028 : 44029]
[44028 : 44030]
Successful child: 44029
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= x^0, {sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= x^0, {sx^0 -> x^0, 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
Strengthening transition (result): 
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= x^0, {sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= x^0, {sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
New Graphs: 
Transitions:
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
Variables:
ox^0, sx^0, x^0, y^0, z^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001188s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003816s
[44028 : 44034]
[44028 : 44035]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035548s
Time used: 0.035542

LOG: SAT solveNonLinear - Elapsed time: 0.058649s
Cost: 1; Total time: 0.057963
Quasi-ranking function: 50000 + y^0
New Graphs: 
Transitions:
<l5, l5, x^0 <= 0 /\ z^0 <= 0 /\ 50001 + y^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
Variables:
ox^0, sx^0, x^0, y^0, z^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001219s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004425s
[44028 : 44039]
[44028 : 44040]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.035016s
Time used: 0.035011

LOG: SAT solveNonLinear - Elapsed time: 0.058208s
Cost: 1; Total time: 0.057109
Quasi-ranking function: 50000 + y^0 - z^0
New Graphs: 
Transitions:
<l5, l5, x^0 <= 0 /\ z^0 <= 0 /\ 50001 + y^0 <= 0 /\ 50001 + y^0 <= z^0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
Variables:
ox^0, sx^0, x^0, y^0, z^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001372s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005142s
[44028 : 44044]
[44028 : 44045]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030327s
Time used: 0.030322

LOG: SAT solveNonLinear - Elapsed time: 0.052917s
Cost: 1; Total time: 0.052026
Quasi-ranking function: 50000 + y^0 + z^0
New Graphs: 
Transitions:
<l5, l5, x^0 <= 0 /\ z^0 <= 0 /\ 50001 + y^0 <= 0 /\ 50001 + y^0 + z^0 <= 0 /\ 50001 + y^0 <= z^0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> z^0, y^0 -> -1 + y^0, rest remain the same}>
<l5, l5, x^0 <= 0 /\ z^0 <= 0, {c^0 -> 1, ox^0 -> x^0, sx^0 -> x^0, x^0 -> -1 + x^0, rest remain the same}>
Variables:
ox^0, sx^0, x^0, y^0, z^0
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001470s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005575s
[44028 : 44049]
[44028 : 44050]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021759s
Time used: 0.021048
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l5, c^0 = 0, {all remain the same}>

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.002761s
Cannot prove unreachability

[44028 : 44054]
[44028 : 44055]
Successful child: 44054

Program does NOT terminate