/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, l4, true>
<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)>
<l2, l3, (undef8 > ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}>
<l3, l3, (arg1 < 0), par{arg1 -> (arg1 - 1), arg2 -> undef12}>
<l4, l1, true, par{arg1 -> undef13, arg2 -> undef14}>

Fresh variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 

Undef variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (arg1 = (0 - undef8)) /\ (undef3 > ~(1)) /\ (undef14 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef13 > 0) /\ (undef8 > ~(1)) /\ (undef14 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef13 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0)>
<l3, l3, (arg1 < 0), par{arg1 -> (arg1 - 1)}>

Fresh variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 

Undef variables:
undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef12, undef13, undef14, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l3, 1 <= undef13 /\ 2 <= undef14 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ arg1 + undef8 = 0 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000427s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001100s
[25974 : 25975]
[25974 : 25976]
Successful child: 25975
[ 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: 
<l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:0 <= arg1 - Process 1
* Exit transition: <l0, l3, 1 <= undef13 /\ 2 <= undef14 /\ 0 <= undef3 /\ 0 <= undef4 /\ 0 <= undef8 /\ 0 <= undef9 /\ arg1 + undef8 = 0 /\ undef4 = 2*undef5 /\ undef9 = 2*undef10, {all remain the same}>
* Postcondition  : 0 <= arg1

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000776s
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: 0 <= arg1 , 
Narrowing transition: 
<l3, l3, 1 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000398s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001181s
[25974 : 25980]
[25974 : 25981]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010182s
Time used: 0.010178

LOG: SAT solveNonLinear - Elapsed time: 0.015476s
Cost: 1; Total time: 0.015179
Quasi-ranking function: 50000 + arg1
New Graphs: 
Transitions:
<l3, l3, 50001 + arg1 <= 0, {arg1 -> -1 + arg1, rest remain the same}>
Variables:
arg1
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000394s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001143s
[25974 : 25985]
[25974 : 25986]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004756s
Time used: 0.004501

[25974 : 26094]
[25974 : 26098]
Successful child: 26094

Program does NOT terminate