/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, l10, true>
<l1, l2, true>
<l2, l3, (undef9 = undef9) /\ ((0 + undef9) <= 0) /\ (0 <= (0 + undef9)) /\ ((0 + x_5^0) <= 0) /\ (undef6 = undef6), par{Result_4^0 -> undef6, tmp_6^0 -> undef9}>
<l2, l4, (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (0 <= (~(1) + x_5^0)), par{tmp_6^0 -> undef14}>
<l4, l2, true>
<l2, l5, (undef24 = undef24), par{tmp_6^0 -> undef24}>
<l5, l6, (undef27 = __disjvr_0^0) /\ (__disjvr_0^0 = undef27), par{__disjvr_0^0 -> undef27}>
<l6, l3, (undef35 = (~(1) + x_5^0)) /\ ((0 + undef35) <= 0) /\ (undef31 = undef31), par{Result_4^0 -> undef31, x_5^0 -> undef35}>
<l2, l7, (undef39 = undef39), par{tmp_6^0 -> undef39}>
<l7, l8, (undef43 = __disjvr_1^0) /\ (__disjvr_1^0 = undef43), par{__disjvr_1^0 -> undef43}>
<l8, l9, (undef50 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef50)), par{x_5^0 -> undef50}>
<l9, l2, true>
<l10, l1, true>

Fresh variables:
undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 

Undef variables:
undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, true>
<l2, l3, (undef9 = undef9) /\ ((0 + undef9) <= 0) /\ (0 <= (0 + undef9)) /\ ((0 + x_5^0) <= 0) /\ (undef6 = undef6)>
<l2, l2, (undef14 = undef14) /\ ((0 + undef14) <= 0) /\ (0 <= (0 + undef14)) /\ (0 <= (~(1) + x_5^0))>
<l2, l3, (undef24 = undef24) /\ (undef27 = __disjvr_0^0) /\ (__disjvr_0^0 = undef27) /\ (undef35 = (~(1) + x_5^0)) /\ ((0 + undef35) <= 0) /\ (undef31 = undef31), par{__disjvr_0^0 -> undef27, x_5^0 -> undef35}>
<l2, l2, (undef39 = undef39) /\ (undef43 = __disjvr_1^0) /\ (__disjvr_1^0 = undef43) /\ (undef50 = (~(1) + x_5^0)) /\ (0 <= (~(1) + undef50)), par{__disjvr_1^0 -> undef43, x_5^0 -> undef50}>

Fresh variables:
undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 

Undef variables:
undef6, undef9, undef14, undef24, undef27, undef31, undef35, undef39, undef43, undef50, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
<l2, l2, 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
Variables:
x_5^0, __disjvr_1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, true, {all remain the same}>

Graph 2
<l2, l3, x_5^0 <= 0 /\ undef9 = 0, {all remain the same}>
<l2, l3, undef35 <= 0 /\ __disjvr_0^0 = undef27 /\ x_5^0 = 1 + undef35, {__disjvr_0^0 -> undef27, x_5^0 -> undef35, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000893s
Ranking function: -2 + x_5^0
New Graphs: 
Transitions:
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
Variables:
x_5^0
> No variable changes in termination graph.
Checking conditional unfeasibility...
Calling Safety with literal x_5^0 <= 0 and entry <l2, l2, true, {all remain the same}>

LOG: CALL check - Post:x_5^0 <= 0 - Process 1
* Exit transition: <l2, l2, true, {all remain the same}>
* Postcondition  : x_5^0 <= 0
Quasi-invariants: 
Location 2: x_5^0 <= 0 ; undef50 <= 0 ; 
[13444 : 13445]
[13444 : 13446]

LOG: NarrowEntry size 2
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l2, l2, 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 2
ENTRIES:
<l0, l2, x_5^0 <= 0 /\ 1 <= undef50, {all remain the same}>
<l0, l2, 1 <= x_5^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: x_5^0 <= 0


LOG: Try proving POST
[13444 : 13447]
[13444 : 13448]
[13444 : 13449]
Successful child: 13447

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000471s

LOG: NarrowEntry size 1
INVARIANTS: 
2: 
Quasi-INVARIANTS to narrow Graph: 
2: x_5^0 <= 0 , 
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>

LOG: Narrow transition size 1
ENTRIES:
<l0, l2, 1 <= x_5^0, {all remain the same}>
END ENTRIES:
GRAPH:
<l2, l2, 1 <= x_5^0 /\ undef14 = 0, {all remain the same}>
<l2, l2, 1 <= x_5^0 /\ 1 <= undef50 /\ __disjvr_1^0 = undef43 /\ x_5^0 = 1 + undef50, {__disjvr_1^0 -> undef43, x_5^0 -> undef50, rest remain the same}>
END GRAPH:
EXIT: <l2, l2, true, {all remain the same}>
POST: x_5^0 <= 0


LOG: Try proving POST
[13444 : 13450]
[13444 : 13451]
[13444 : 13452]

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

LOG: RETURN check - Elapsed time: 4.140031s

[13444 : 13453]
[13444 : 13454]
Successful child: 13454

Program does NOT terminate