/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, true, par{arg1 -> 0}>
<l2, l2, (arg1 < 12) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 11) /\ (arg1 < 20)>
<l3, l1, true, par{arg1 -> undef4}>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (arg1 = 0)>
<l2, l2, (arg1 < 12) /\ (arg1 < 20), par{arg1 -> (arg1 + 1)}>
<l2, l2, (arg1 > 11) /\ (arg1 < 20)>

Fresh variables:
undef4, 

Undef variables:
undef4, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, arg1 <= 11, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 12 <= arg1 /\ arg1 <= 19, {all remain the same}>
Variables:
arg1

Precedence: 
Graph 0

Graph 1
<l0, l2, arg1 = 0, {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.009779

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000646s
Ranking function: 11 - arg1
New Graphs: 
Transitions:
<l2, l2, 12 <= arg1 /\ arg1 <= 19, {all remain the same}>
Variables:
arg1
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal 20 <= arg1 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:20 <= arg1 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : 20 <= arg1
Quasi-invariants: 
Location 2: 20 <= arg1 ; 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000314s

LOG: NarrowEntry size 1
Narrowing transition: 
<l2, l2, arg1 <= 11, {arg1 -> 1 + arg1, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 12 <= arg1 /\ arg1 <= 19, {all remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, arg1 = 0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, arg1 <= 11, {arg1 -> 1 + arg1, rest remain the same}>
<l2, l2, 12 <= arg1 /\ arg1 <= 19, {all remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: 20 <= arg1


LOG: Try proving POST
[14937 : 14938]
[14937 : 14939]
[14937 : 14940]

LOG: Postcondition is not implied - no solution
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.711338s

[14937 : 14941]
[14937 : 14945]
Successful child: 14941

Program does NOT terminate