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

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Fresh variables:
undef3, 

Undef variables:
undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, true, {x^0 -> -1 + x^0, rest remain the same}>
<l1, l1, 1 <= undef3 /\ x^0 = 1 + undef3, {x^0 -> undef3, 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.002247

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000924s
Ranking function: -1 + x^0
New Graphs: 
Transitions:
<l1, l1, true, {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.000417s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000845s
[7352 : 7353]
[7352 : 7354]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011202s
Time used: 0.011198

LOG: SAT solveNonLinear - Elapsed time: 0.016786s
Cost: 1; Total time: 0.016522
Quasi-ranking function: 50000 + x^0
New Graphs: 
Transitions:
<l1, l1, 50001 + x^0 <= 0, {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.000388s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001163s
[7352 : 7358]
[7352 : 7359]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004470s
Time used: 0.004218
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l1, true, {all remain the same}>

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

LOG: CALL solveLinear

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

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

[7352 : 7363]
[7352 : 7364]
Successful child: 7364

Program does NOT terminate