/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, l3, true>
<l1, l2, (undef1 > ~(1)), par{arg1 -> undef1}>
<l2, l2, (arg1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef2}>
<l3, l1, true, par{arg1 -> undef3}>

Fresh variables:
undef1, undef2, undef3, 

Undef variables:
undef1, undef2, undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef1) /\ (undef1 > ~(1))>
<l2, l2, (arg1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef2}>

Fresh variables:
undef1, undef2, undef3, 

Undef variables:
undef1, undef2, undef3, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= arg1 /\ 0 <= undef2, {arg1 -> undef2, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, 0 <= undef1 /\ arg1 = undef1, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000605s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001735s
[47770 : 47771]
[47770 : 47772]
Successful child: 47771
[ 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: 
<l2, l2, 1 <= arg1 /\ 0 <= undef2, {arg1 -> undef2, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= undef2, {arg1 -> undef2, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:arg1 <= 0 - Process 1
* Exit transition: <l0, l2, 0 <= undef1 /\ arg1 = undef1, {all remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000464s
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: arg1 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= arg1 /\ 0 <= undef2, {arg1 -> undef2, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000606s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001784s
[47770 : 47776]
[47770 : 47777]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004277s
Time used: 0.003999

[47770 : 47781]
[47770 : 47785]
Successful child: 47785

Program does NOT terminate