You lose, fella. The EMTP logic has detected an error condition, and is now going to terminate program execution. The following * O1 U) X8 v; V/ G- Z$ m$ x& xmessage summarizes the circumstances leading to this situation. Where an otherwise-unidentified data card is referred to, or where 9 w* L ]# G" |the "last" card is mentioned, it is the most recently read card of the input data that is meant. The 80-column image of this card / }! M5 m& E0 B+ G Gis generally the last one printed out prior to this termination message. But possibly this last-read card has not yet been ; ~. Y- r8 }% V; g8 ?7 Ddisplayed, so a copy follows:5 T$ X1 r# z% q6 N+ m8 K3 \. }& y- k
" " 9 Q; J3 p$ \! r6 |% J; H' G, I KILL code number Overlay number Nearby statement number : ~6 [4 Z7 `: b5 M' G 1 13 81090 O0 G8 S! F1 Q$ E3 |+ l9 r
KILL = 1. Storage exceeded for EMTP List Number 8. See the dimensioned limit in the case-summary statistics below. The problem7 L% n" R+ `0 H- N
is simply too big for the program as currently dimensioned. Yet, do not forget dynamic dimensioning as described in the Oct., 1993,% w5 U) I f% J z, O
newsletter. In this case, edit LISTSIZE.DAT to increase table sizes, and then try again. Of course, such dynamic expansion is2 s6 t* f7 t! e: Y, E5 v+ p6 ~
possible only within limits fixed by LISTSIZE.BPA (used by variable-dimensioning program "VARDIM" as ATP is to be linked). $ e" y7 S) L( s8 bSometimes the reason for EMTP table overflow is unclear, and Program Maintenance might wish to inspect the contents of the error : |. T1 z' g/ d4 pinterface vectors LSTAT and FLSTAT. These now follow. First comes LSTAT, using (12I10) encoding; then comes FLSTAT,& ^: y( ?/ h# L$ d' Q8 W& h
using (8E15.6) encoding: 3 u" C# c O T% r$ ALSTAT = -9999 -9999 -9999 -9999 -9999 -9999 -9999 -9999 -9999 -9999 10 804 z, Z& P) a% e& }
LSTAT = 323 0 -9999 8 324 0 8109 -9999 116 155 323 7* i5 V7 I z7 K$ ~& ?
FLSTAT = 1.562500E-02 1.562500E-02 7.812500E-02 7.812500E-02 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+00: x/ S( P6 e& t# i4 g; Q
FLSTAT = 0.000000E+00 0.000000E+00 0.000000E+00 5.000000E+01 6.000000E+01 0.000000E+00 0.000000E+00 0.000000E+001 J* K2 {, }8 w+ _
FLSTAT = 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+00 0.000000E+008 ]8 I& U( d& M, m: J& x) N
Yet maybe the user would like some suggestions as to why the table in question (List Number 8 ) has overflowed. If such further ' v2 M( m3 k5 b1 ainformation is available, it will now follow immediately .... 7 p9 Y. s; c2 A& z5 {3 I) m5 p' XList 8 stores past history points for distributed-parameter transmission circuits (lines or cables) in modal form. Each ( O! w8 W7 o, x' Ypropagation mode requires storage, and there are as many modes as there are coupled conductors or phases (e.g., a double-circuit5 S5 @+ W) S6 l9 F6 G0 _, q. M1 O; e
line will normally have 6 modes). Each mode requires TAU / DELTAT entries, where TAU is the modal travel time of the line,# Q3 W' [% ^; e3 N8 Y6 P* [* C
DELTAT is the time-step size, and the division involves integer truncation followed by the addition of unity.# T% J+ {# Z" W! B: Y
In order to effectively trade memory space among the different EMTP tables (EMTP List Sizes), the user must know how many arrays 6 \" r2 ?/ n ]& Q7 R7 V3 F6 ~(columns) there are in each table. The following tabulation shows the effective multiplicities that are associated with each # r( L+ |% Z! y: Hindependent EMTP List Size (those lists whose lengths are under user control by means of the EMTP variable-dimensioning program 6 h2 L9 L/ v9 ~( W, n$ u( j8 U"VARDIM").2 l" p$ X" d, ^) L
-------------1------------------------------------------------------------------------------------------------------------ , E7 S* v5 P' E4 p 5 M4 e w; Y' [List Number 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 E- ]2 [" @. \# U& [1 h3 O
0 w! d; ~7 m; I# E9 o
-------------1------------------------------------------------------------------------------------------------------------% h5 O* o) d; a; p% ^8 ], {/ E+ X
) {3 _: K8 v, E& O/ E+ SFloating Pt. 1 6 5 3 6 1 12 2 2 8 3 1 4 8 1 2 2 0 6 1 1 24 2 1 # * 1" o! W, s1 D# J0 s& N( I0 n* d" e
Integer 1 4 7 0 2 1 10 0 0 11 0 3 0 4 0 0 2 1 10 2 0 0 0 0 0 0 0 5 g3 @3 t, z1 k% j2 A. iTotal 1 10 12 3 8 2 22 2 2 19 3 4 4 12 1 2 1 16 3 1 24 2 1 # * 1 1 C' i1 V) N# S, J+ a7 r( J + C) b! g2 V+ y+ u% W" K7 u-------------1------------------------------------------------------------------------------------------------------------# }. v# N- _! x
% \/ O: W) F7 s8 r7 J
# --- Used only for virtual computers (Burroughs, PRIME, VAX, Apollo, etc.). Others can ignore this List. - A9 B4 z9 r% e' p1 M* --- Rather than count List 24 itself, add the value to the floating-point and total counts for Lists 1 and 6.