/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, l13, true>
<l1, l2, ((0 + got_SIGHUP^0) <= 0)>
<l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef16 = undef16) /\ (undef25 = (0 + undef16)) /\ (undef28 = (0 + undef25)), par{___rho_1_^0 -> undef16, a33^0 -> 1, got_SIGHUP^0 -> 0, ret_XLogArchivingActive44^0 -> undef25, tmp2^0 -> undef28, tt1^0 -> (0 + undef28)}>
<l4, l5, true>
<l6, l7, true>
<l8, l6, true>
<l9, l8, (((1 + curtime^0) + (~(1) * last_copy_time^0)) <= 1000)>
<l9, l8, (1000 <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}>
<l10, l8, (1 <= (0 + wakend^0))>
<l10, l9, ((0 + wakend^0) <= 0) /\ (undef123 = undef123) /\ (undef132 = (0 + undef123)), par{___rho_3_^0 -> undef123, a77^0 -> 0, curtime^0 -> (0 + undef132), ret_time88^0 -> undef132}>
<l2, l10, ((0 + wakend^0) <= 0)>
<l2, l10, (1 <= (0 + wakend^0)) /\ (undef153 = undef153) /\ (undef161 = (0 + undef153)), par{___rho_3_^0 -> undef153, a55^0 -> 0, last_copy_time^0 -> (0 + undef161), ret_time66^0 -> undef161, wakend^0 -> 0}>
<l7, l11, true>
<l11, l7, true>
<l3, l2, (1 <= (0 + tt1^0))>
<l3, l6, ((0 + tt1^0) <= 0)>
<l12, l1, (undef227 = undef227) /\ (undef241 = 1), par{___rho_2_^0 -> undef227, got_SIGHUP^0 -> (0 + undef227), wakend^0 -> 1}>
<l13, l12, true>

Fresh variables:
undef16, undef25, undef28, undef123, undef132, undef153, undef161, undef227, undef241, 

Undef variables:
undef16, undef25, undef28, undef123, undef132, undef153, undef161, undef227, undef241, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (undef227 = undef227) /\ (undef241 = 1) /\ ((0 + (0 + undef227)) <= 0) /\ (1 <= (0 + 1)) /\ (undef153 = undef153) /\ (undef161 = (0 + undef153)) /\ ((0 + 0) <= 0) /\ (undef123 = undef123) /\ (undef132 = (0 + undef123)) /\ (((1 + (0 + undef132)) + (~(1) * (0 + undef161))) <= 1000), par{last_copy_time^0 -> (0 + undef161)}>
<l0, l7, (undef227 = undef227) /\ (undef241 = 1) /\ ((0 + (0 + undef227)) <= 0) /\ (1 <= (0 + 1)) /\ (undef153 = undef153) /\ (undef161 = (0 + undef153)) /\ ((0 + 0) <= 0) /\ (undef123 = undef123) /\ (undef132 = (0 + undef123)) /\ (1000 <= ((0 + (0 + undef132)) + (~(1) * (0 + undef161)))), par{last_copy_time^0 -> (0 + undef161)}>
<l0, l7, (undef227 = undef227) /\ (undef241 = 1) /\ (1 <= (0 + (0 + undef227))) /\ (undef16 = undef16) /\ (undef25 = (0 + undef16)) /\ (undef28 = (0 + undef25)) /\ (1 <= (0 + (0 + undef28))) /\ (1 <= (0 + 1)) /\ (undef153 = undef153) /\ (undef161 = (0 + undef153)) /\ ((0 + 0) <= 0) /\ (undef123 = undef123) /\ (undef132 = (0 + undef123)) /\ (((1 + (0 + undef132)) + (~(1) * (0 + undef161))) <= 1000), par{last_copy_time^0 -> (0 + undef161)}>
<l0, l7, (undef227 = undef227) /\ (undef241 = 1) /\ (1 <= (0 + (0 + undef227))) /\ (undef16 = undef16) /\ (undef25 = (0 + undef16)) /\ (undef28 = (0 + undef25)) /\ (1 <= (0 + (0 + undef28))) /\ (1 <= (0 + 1)) /\ (undef153 = undef153) /\ (undef161 = (0 + undef153)) /\ ((0 + 0) <= 0) /\ (undef123 = undef123) /\ (undef132 = (0 + undef123)) /\ (1000 <= ((0 + (0 + undef132)) + (~(1) * (0 + undef161)))), par{last_copy_time^0 -> (0 + undef161)}>
<l0, l7, (undef227 = undef227) /\ (undef241 = 1) /\ (1 <= (0 + (0 + undef227))) /\ (undef16 = undef16) /\ (undef25 = (0 + undef16)) /\ (undef28 = (0 + undef25)) /\ ((0 + (0 + undef28)) <= 0)>
<l7, l7, true>

Fresh variables:
undef16, undef25, undef28, undef123, undef132, undef153, undef161, undef227, undef241, 

Undef variables:
undef16, undef25, undef28, undef123, undef132, undef153, undef161, undef227, undef241, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l7, l7, true, {all remain the same}>
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l7, undef227 <= 0 /\ undef132 <= 999 + undef161 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>
<l0, l7, undef227 <= 0 /\ 1000 + undef161 <= undef132 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>
<l0, l7, 1 <= undef28 /\ 1 <= undef227 /\ undef132 <= 999 + undef161 /\ undef16 = undef25 /\ undef25 = undef28 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>
<l0, l7, 1 <= undef28 /\ 1 <= undef227 /\ 1000 + undef161 <= undef132 /\ undef16 = undef25 /\ undef25 = undef28 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>
<l0, l7, undef28 <= 0 /\ 1 <= undef227 /\ undef16 = undef25 /\ undef25 = undef28 /\ undef241 = 1, {all remain the same}>

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

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

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

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l7, undef227 <= 0 /\ undef132 <= 999 + undef161 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, undef227 <= 0 /\ undef132 <= 999 + undef161 /\ undef123 = undef132 /\ undef153 = undef161 /\ undef241 = 1, {last_copy_time^0 -> undef161, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000804s
Cannot prove unreachability

[16940 : 16941]
[16940 : 16942]
Successful child: 16941

Program does NOT terminate