/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, l3, true>
<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2}>
<l2, l2, (undef7 > ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}>
<l3, l1, true, par{arg1 -> undef8, arg2 -> undef9, arg3 -> undef10}>

Fresh variables:
undef1, undef4, undef7, undef8, undef9, undef10, 

Undef variables:
undef1, undef4, undef7, undef8, undef9, undef10, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = undef9) /\ (undef1 <= undef8) /\ (undef9 > ~(1)) /\ (undef8 > 0) /\ (undef1 > 0)>
<l2, l2, (undef7 > ~(1)) /\ (arg3 > arg2) /\ (arg2 > ~(1)) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + undef7)}>

Fresh variables:
undef1, undef4, undef7, undef8, undef9, undef10, 

Undef variables:
undef1, undef4, undef7, undef8, undef9, undef10, 

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 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg2 /\ 0 <= undef7, {arg1 -> undef4, arg2 -> arg2 + undef7, rest remain the same}>
Variables:
arg1, arg2, arg3

Precedence: 
Graph 0

Graph 1
<l0, l2, 1 <= undef1 /\ 1 <= undef8 /\ undef1 <= undef8 /\ 0 <= undef9 /\ arg1 = undef1 /\ arg2 = 0 /\ arg3 = undef9, {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.003516

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000947s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003603s
[60047 : 60048]
[60047 : 60049]
Successful child: 60048
[ 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 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg2 /\ 0 <= undef7, {arg1 -> undef4, arg2 -> arg2 + undef7, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg2 /\ 0 <= undef7, {arg1 -> undef4, arg2 -> arg2 + undef7, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001007s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003821s
[60047 : 60053]
[60047 : 60054]
Successful child: 60053
[ 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 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg2 /\ 0 <= undef7 /\ 2 <= arg1 + arg3, {arg1 -> undef4, arg2 -> arg2 + undef7, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef4 /\ undef4 <= arg1 /\ 0 <= arg2 /\ 0 <= undef7 /\ 2 <= arg1 + arg3, {arg1 -> undef4, arg2 -> arg2 + undef7, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

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

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001074s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004224s
[60047 : 60058]
[60047 : 60059]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010744s
Time used: 0.010139

[60047 : 60063]
[60047 : 60064]
Successful child: 60063

Program does NOT terminate