/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, l13, true>
<l1, l2, ((0 + got_SIGHUP^0) <= 0)>
<l1, l3, (1 <= (0 + got_SIGHUP^0)) /\ (undef18 = undef18) /\ (undef25 = (0 + undef18)) /\ (undef28 = (0 + undef25)), par{__rho_1_^0 -> undef18, 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)) <= (0 + __const_1000^0))>
<l9, l8, ((0 + __const_1000^0) <= ((0 + curtime^0) + (~(1) * last_copy_time^0))), par{wakend^0 -> 1}>
<l10, l8, (1 <= (0 + wakend^0))>
<l10, l9, ((0 + wakend^0) <= 0) /\ (undef142 = undef142) /\ (undef138 = (0 + undef142)), par{a88^0 -> 0, curtime^0 -> (0 + undef138), ret_time1010^0 -> undef138, tmp99^0 -> undef142}>
<l2, l10, ((0 + wakend^0) <= 0)>
<l2, l10, (1 <= (0 + wakend^0)) /\ (undef173 = undef173) /\ (undef171 = (0 + undef173)), par{a55^0 -> 0, last_copy_time^0 -> (0 + undef171), ret_time77^0 -> undef171, tmp66^0 -> undef173, wakend^0 -> 0}>
<l7, l11, true, par{wakend^0 -> 1}>
<l11, l7, true>
<l3, l2, (1 <= (0 + tt1^0))>
<l3, l6, ((0 + tt1^0) <= 0)>
<l12, l1, (undef257 = 1) /\ (undef247 = undef247), par{got_SIGHUP^0 -> undef247, wakend^0 -> 1}>
<l13, l12, true>

Fresh variables:
undef18, undef25, undef28, undef138, undef142, undef171, undef173, undef247, undef257, 

Undef variables:
undef18, undef25, undef28, undef138, undef142, undef171, undef173, undef247, undef257, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l7, (undef257 = 1) /\ (undef247 = undef247) /\ ((0 + undef247) <= 0) /\ (1 <= (0 + 1)) /\ (undef173 = undef173) /\ (undef171 = (0 + undef173)) /\ ((0 + 0) <= 0) /\ (undef142 = undef142) /\ (undef138 = (0 + undef142)) /\ (((1 + (0 + undef138)) + (~(1) * (0 + undef171))) <= (0 + __const_1000^0)), par{last_copy_time^0 -> (0 + undef171)}>
<l0, l7, (undef257 = 1) /\ (undef247 = undef247) /\ ((0 + undef247) <= 0) /\ (1 <= (0 + 1)) /\ (undef173 = undef173) /\ (undef171 = (0 + undef173)) /\ ((0 + 0) <= 0) /\ (undef142 = undef142) /\ (undef138 = (0 + undef142)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef138)) + (~(1) * (0 + undef171)))), par{last_copy_time^0 -> (0 + undef171)}>
<l0, l7, (undef257 = 1) /\ (undef247 = undef247) /\ (1 <= (0 + undef247)) /\ (undef18 = undef18) /\ (undef25 = (0 + undef18)) /\ (undef28 = (0 + undef25)) /\ (1 <= (0 + (0 + undef28))) /\ (1 <= (0 + 1)) /\ (undef173 = undef173) /\ (undef171 = (0 + undef173)) /\ ((0 + 0) <= 0) /\ (undef142 = undef142) /\ (undef138 = (0 + undef142)) /\ (((1 + (0 + undef138)) + (~(1) * (0 + undef171))) <= (0 + __const_1000^0)), par{last_copy_time^0 -> (0 + undef171)}>
<l0, l7, (undef257 = 1) /\ (undef247 = undef247) /\ (1 <= (0 + undef247)) /\ (undef18 = undef18) /\ (undef25 = (0 + undef18)) /\ (undef28 = (0 + undef25)) /\ (1 <= (0 + (0 + undef28))) /\ (1 <= (0 + 1)) /\ (undef173 = undef173) /\ (undef171 = (0 + undef173)) /\ ((0 + 0) <= 0) /\ (undef142 = undef142) /\ (undef138 = (0 + undef142)) /\ ((0 + __const_1000^0) <= ((0 + (0 + undef138)) + (~(1) * (0 + undef171)))), par{last_copy_time^0 -> (0 + undef171)}>
<l0, l7, (undef257 = 1) /\ (undef247 = undef247) /\ (1 <= (0 + undef247)) /\ (undef18 = undef18) /\ (undef25 = (0 + undef18)) /\ (undef28 = (0 + undef25)) /\ ((0 + (0 + undef28)) <= 0)>
<l7, l7, true>

Fresh variables:
undef18, undef25, undef28, undef138, undef142, undef171, undef173, undef247, undef257, 

Undef variables:
undef18, undef25, undef28, undef138, undef142, undef171, undef173, undef247, undef257, 

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, undef247 <= 0 /\ 1 + undef138 <= __const_1000^0 + undef171 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>
<l0, l7, __const_1000^0 + undef171 <= undef138 /\ undef247 <= 0 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>
<l0, l7, 1 + undef138 <= __const_1000^0 + undef171 /\ 1 <= undef28 /\ 1 <= undef247 /\ undef18 = undef25 /\ undef25 = undef28 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>
<l0, l7, __const_1000^0 + undef171 <= undef138 /\ 1 <= undef28 /\ 1 <= undef247 /\ undef18 = undef25 /\ undef25 = undef28 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>
<l0, l7, undef28 <= 0 /\ 1 <= undef247 /\ undef18 = undef25 /\ undef25 = undef28 /\ undef257 = 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.002648

> No variable changes in termination graph.
Checking conditional unfeasibility...
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l7, undef247 <= 0 /\ 1 + undef138 <= __const_1000^0 + undef171 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l7, undef247 <= 0 /\ 1 + undef138 <= __const_1000^0 + undef171 /\ undef138 = undef142 /\ undef171 = undef173 /\ undef257 = 1, {last_copy_time^0 -> undef171, rest remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

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

[56694 : 56695]
[56694 : 56696]
Successful child: 56695

Program does NOT terminate