fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r260-csrt-152732585300118
Last Updated
June 26, 2018

About the Execution of ITS-Tools for Parking-PT-432

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15754.710 24240.00 63572.00 139.90 FFFFFFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................................
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 192K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Parking-PT-432, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r260-csrt-152732585300118
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-432-LTLFireability-00
FORMULA_NAME Parking-PT-432-LTLFireability-01
FORMULA_NAME Parking-PT-432-LTLFireability-02
FORMULA_NAME Parking-PT-432-LTLFireability-03
FORMULA_NAME Parking-PT-432-LTLFireability-04
FORMULA_NAME Parking-PT-432-LTLFireability-05
FORMULA_NAME Parking-PT-432-LTLFireability-06
FORMULA_NAME Parking-PT-432-LTLFireability-07
FORMULA_NAME Parking-PT-432-LTLFireability-08
FORMULA_NAME Parking-PT-432-LTLFireability-09
FORMULA_NAME Parking-PT-432-LTLFireability-10
FORMULA_NAME Parking-PT-432-LTLFireability-11
FORMULA_NAME Parking-PT-432-LTLFireability-12
FORMULA_NAME Parking-PT-432-LTLFireability-13
FORMULA_NAME Parking-PT-432-LTLFireability-14
FORMULA_NAME Parking-PT-432-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527487503183

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G("(u42.p156>=1)")))
Formula 0 simplified : !G"(u42.p156>=1)"
built 221 ordering constraints for composite.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 457 rows 529 cols
invariant :u68:p279 + u68:p280 + u121:p0 = 1
invariant :u88:p349 + u88:p350 + u88:p351 + u88:p352 + u88:p353 + u88:p354 + u88:p355 + u88:p356 + u121:p0 = 1
invariant :u9:p17 + u9:p18 + u121:p0 = 1
invariant :u61:p223 + u61:p224 + u61:p225 + u61:p226 + u61:p227 + u61:p228 + u61:p229 + u61:p230 + u121:p0 = 1
invariant :u76:p295 + u76:p296 + u121:p0 = 1
invariant :u33:p89 + u33:p90 + u33:p91 + u33:p92 + u33:p93 + u33:p94 + u33:p95 + u33:p96 + u121:p0 = 1
invariant :u56:p183 + u56:p184 + u56:p185 + u56:p186 + u56:p187 + u56:p188 + u56:p189 + -1'u57:p198 + -1'u58:p206 + -1'u59:p214 + -1'u60:p222 + -1'u61:p230 + -1'u62:p238 + -1'u63:p246 + -1'u64:p270 + -1'u65:p272 + -8'u121:p0 = -8
invariant :u56:p190 + u57:p198 + u58:p206 + u59:p214 + u60:p222 + u61:p230 + u62:p238 + u63:p246 + u64:p270 + u65:p272 + 9'u121:p0 = 9
invariant :u101:p417 + u101:p418 + u121:p0 = 1
invariant :u14:p27 + u14:p28 + u121:p0 = 1
invariant :u86:p333 + u86:p334 + u86:p335 + u86:p336 + u86:p337 + u86:p338 + u86:p339 + u86:p340 + u121:p0 = 1
invariant :u8:p15 + u8:p16 + u121:p0 = 1
invariant :u43:p157 + u43:p158 + u121:p0 = 1
invariant :u50:p171 + u50:p172 + u121:p0 = 1
invariant :u67:p277 + u67:p278 + u121:p0 = 1
invariant :u24:p47 + u24:p48 + u121:p0 = 1
invariant :u93:p399 + u93:p400 + u93:p401 + u93:p402 + u121:p0 = 1
invariant :u96:p407 + u96:p408 + u121:p0 = 1
invariant :u7:p13 + u7:p14 + u121:p0 = 1
invariant :u55:p181 + u55:p182 + u121:p0 = 1
invariant :u110:p435 + u110:p436 + u110:p437 + u110:p438 + u110:p439 + u110:p440 + u110:p441 + -1'u111:p450 + -1'u112:p458 + -1'u113:p466 + -1'u114:p474 + -1'u115:p482 + -1'u116:p490 + -1'u117:p498 + -1'u118:p522 + -1'u119:p524 + -8'u121:p0 = -8
invariant :u104:p423 + u104:p424 + u121:p0 = 1
invariant :u107:p429 + u107:p430 + u121:p0 = 1
invariant :u81:p305 + u81:p306 + u121:p0 = 1
invariant :u119:p523 + u119:p524 + u121:p0 = 1
invariant :u29:p64 + u30:p72 + u31:p80 + u32:p88 + u33:p96 + u34:p104 + u35:p112 + u36:p120 + u37:p144 + u38:p146 + 9'u121:p0 = 9
invariant :u60:p215 + u60:p216 + u60:p217 + u60:p218 + u60:p219 + u60:p220 + u60:p221 + u60:p222 + u121:p0 = 1
invariant :u75:p293 + u75:p294 + u121:p0 = 1
invariant :u42:p155 + u42:p156 + u121:p0 = 1
invariant :u90:p365 + u90:p366 + u90:p367 + u90:p368 + u90:p369 + u90:p370 + u90:p371 + u90:p372 + u121:p0 = 1
invariant :u78:p299 + u78:p300 + u121:p0 = 1
invariant :u17:p33 + u17:p34 + u121:p0 = 1
invariant :u26:p51 + u26:p52 + u121:p0 = 1
invariant :u115:p475 + u115:p476 + u115:p477 + u115:p478 + u115:p479 + u115:p480 + u115:p481 + u115:p482 + u121:p0 = 1
invariant :u5:p9 + u5:p10 + u121:p0 = 1
invariant :u52:p175 + u52:p176 + u121:p0 = 1
invariant :u34:p97 + u34:p98 + u34:p99 + u34:p100 + u34:p101 + u34:p102 + u34:p103 + u34:p104 + u121:p0 = 1
invariant :u49:p169 + u49:p170 + u121:p0 = 1
invariant :u4:p7 + u4:p8 + u121:p0 = 1
invariant :u3:p5 + u3:p6 + u121:p0 = 1
invariant :u91:p373 + u91:p374 + u91:p375 + u91:p376 + u91:p377 + u91:p378 + u91:p379 + u91:p380 + u91:p381 + u91:p382 + u91:p383 + u91:p384 + u91:p385 + u91:p386 + u91:p387 + u91:p388 + u91:p389 + u91:p390 + u91:p391 + u91:p392 + u91:p393 + u91:p394 + u91:p395 + u91:p396 + u121:p0 = 1
invariant :u23:p45 + u23:p46 + u121:p0 = 1
invariant :u41:p153 + u41:p154 + u121:p0 = 1
invariant :u28:p55 + u28:p56 + u121:p0 = 1
invariant :u70:p283 + u70:p284 + u121:p0 = 1
invariant :u1:p1 + u1:p2 + u121:p0 = 1
invariant :u65:p271 + u65:p272 + u121:p0 = 1
invariant :u99:p413 + u99:p414 + u121:p0 = 1
invariant :u106:p427 + u106:p428 + u121:p0 = 1
invariant :u59:p207 + u59:p208 + u59:p209 + u59:p210 + u59:p211 + u59:p212 + u59:p213 + u59:p214 + u121:p0 = 1
invariant :u54:p179 + u54:p180 + u121:p0 = 1
invariant :u16:p31 + u16:p32 + u121:p0 = 1
invariant :u80:p303 + u80:p304 + u121:p0 = 1
invariant :u30:p65 + u30:p66 + u30:p67 + u30:p68 + u30:p69 + u30:p70 + u30:p71 + u30:p72 + u121:p0 = 1
invariant :u84:p317 + u84:p318 + u84:p319 + u84:p320 + u84:p321 + u84:p322 + u84:p323 + u84:p324 + u121:p0 = 1
invariant :u117:p491 + u117:p492 + u117:p493 + u117:p494 + u117:p495 + u117:p496 + u117:p497 + u117:p498 + u121:p0 = 1
invariant :u98:p411 + u98:p412 + u121:p0 = 1
invariant :u10:p19 + u10:p20 + u121:p0 = 1
invariant :u73:p289 + u73:p290 + u121:p0 = 1
invariant :u82:p307 + u82:p308 + u121:p0 = 1
invariant :u44:p159 + u44:p160 + u121:p0 = 1
invariant :u108:p431 + u108:p432 + u121:p0 = 1
invariant :u15:p29 + u15:p30 + u121:p0 = 1
invariant :u120:p525 + u120:p526 + u120:p527 + u120:p528 + u121:p0 = 1
invariant :u37:p121 + u37:p122 + u37:p123 + u37:p124 + u37:p125 + u37:p126 + u37:p127 + u37:p128 + u37:p129 + u37:p130 + u37:p131 + u37:p132 + u37:p133 + u37:p134 + u37:p135 + u37:p136 + u37:p137 + u37:p138 + u37:p139 + u37:p140 + u37:p141 + u37:p142 + u37:p143 + u37:p144 + u121:p0 = 1
invariant :u105:p425 + u105:p426 + u121:p0 = 1
invariant :u58:p199 + u58:p200 + u58:p201 + u58:p202 + u58:p203 + u58:p204 + u58:p205 + u58:p206 + u121:p0 = 1
invariant :u66:p273 + u66:p274 + u66:p275 + u66:p276 + u121:p0 = 1
invariant :u29:p57 + u29:p58 + u29:p59 + u29:p60 + u29:p61 + u29:p62 + u29:p63 + -1'u30:p72 + -1'u31:p80 + -1'u32:p88 + -1'u33:p96 + -1'u34:p104 + -1'u35:p112 + -1'u36:p120 + -1'u37:p144 + -1'u38:p146 + -8'u121:p0 = -8
invariant :u27:p53 + u27:p54 + u121:p0 = 1
invariant :u79:p301 + u79:p302 + u121:p0 = 1
invariant :u97:p409 + u97:p410 + u121:p0 = 1
invariant :u53:p177 + u53:p178 + u121:p0 = 1
invariant :u32:p81 + u32:p82 + u32:p83 + u32:p84 + u32:p85 + u32:p86 + u32:p87 + u32:p88 + u121:p0 = 1
invariant :u47:p165 + u47:p166 + u121:p0 = 1
invariant :u72:p287 + u72:p288 + u121:p0 = 1
invariant :u18:p35 + u18:p36 + u121:p0 = 1
invariant :u31:p73 + u31:p74 + u31:p75 + u31:p76 + u31:p77 + u31:p78 + u31:p79 + u31:p80 + u121:p0 = 1
invariant :u111:p443 + u111:p444 + u111:p445 + u111:p446 + u111:p447 + u111:p448 + u111:p449 + u111:p450 + u121:p0 = 1
invariant :u62:p231 + u62:p232 + u62:p233 + u62:p234 + u62:p235 + u62:p236 + u62:p237 + u62:p238 + u121:p0 = 1
invariant :u39:p147 + u39:p148 + u39:p149 + u39:p150 + u121:p0 = 1
invariant :u21:p41 + u21:p42 + u121:p0 = 1
invariant :u38:p145 + u38:p146 + u121:p0 = 1
invariant :u36:p113 + u36:p114 + u36:p115 + u36:p116 + u36:p117 + u36:p118 + u36:p119 + u36:p120 + u121:p0 = 1
invariant :u13:p25 + u13:p26 + u121:p0 = 1
invariant :u6:p11 + u6:p12 + u121:p0 = 1
invariant :u100:p415 + u100:p416 + u121:p0 = 1
invariant :u112:p451 + u112:p452 + u112:p453 + u112:p454 + u112:p455 + u112:p456 + u112:p457 + u112:p458 + u121:p0 = 1
invariant :u46:p163 + u46:p164 + u121:p0 = 1
invariant :u71:p285 + u71:p286 + u121:p0 = 1
invariant :u35:p105 + u35:p106 + u35:p107 + u35:p108 + u35:p109 + u35:p110 + u35:p111 + u35:p112 + u121:p0 = 1
invariant :u95:p405 + u95:p406 + u121:p0 = 1
invariant :u109:p433 + u109:p434 + u121:p0 = 1
invariant :u12:p23 + u12:p24 + u121:p0 = 1
invariant :u20:p39 + u20:p40 + u121:p0 = 1
invariant :u113:p459 + u113:p460 + u113:p461 + u113:p462 + u113:p463 + u113:p464 + u113:p465 + u113:p466 + u121:p0 = 1
invariant :u87:p341 + u87:p342 + u87:p343 + u87:p344 + u87:p345 + u87:p346 + u87:p347 + u87:p348 + u121:p0 = 1
invariant :u103:p421 + u103:p422 + u121:p0 = 1
invariant :u94:p403 + u94:p404 + u121:p0 = 1
invariant :u2:p3 + u2:p4 + u121:p0 = 1
invariant :u64:p247 + u64:p248 + u64:p249 + u64:p250 + u64:p251 + u64:p252 + u64:p253 + u64:p254 + u64:p255 + u64:p256 + u64:p257 + u64:p258 + u64:p259 + u64:p260 + u64:p261 + u64:p262 + u64:p263 + u64:p264 + u64:p265 + u64:p266 + u64:p267 + u64:p268 + u64:p269 + u64:p270 + u121:p0 = 1
invariant :u116:p483 + u116:p484 + u116:p485 + u116:p486 + u116:p487 + u116:p488 + u116:p489 + u116:p490 + u121:p0 = 1
invariant :u74:p291 + u74:p292 + u121:p0 = 1
invariant :u45:p161 + u45:p162 + u121:p0 = 1
invariant :u85:p325 + u85:p326 + u85:p327 + u85:p328 + u85:p329 + u85:p330 + u85:p331 + u85:p332 + u121:p0 = 1
invariant :u11:p21 + u11:p22 + u121:p0 = 1
invariant :u77:p297 + u77:p298 + u121:p0 = 1
invariant :u83:p316 + u84:p324 + u85:p332 + u86:p340 + u87:p348 + u88:p356 + u89:p364 + u90:p372 + u91:p396 + u92:p398 + 9'u121:p0 = 9
invariant :u114:p467 + u114:p468 + u114:p469 + u114:p470 + u114:p471 + u114:p472 + u114:p473 + u114:p474 + u121:p0 = 1
invariant :u40:p151 + u40:p152 + u121:p0 = 1
invariant :u57:p191 + u57:p192 + u57:p193 + u57:p194 + u57:p195 + u57:p196 + u57:p197 + u57:p198 + u121:p0 = 1
invariant :u48:p167 + u48:p168 + u121:p0 = 1
invariant :u51:p173 + u51:p174 + u121:p0 = 1
invariant :u69:p281 + u69:p282 + u121:p0 = 1
invariant :u118:p499 + u118:p500 + u118:p501 + u118:p502 + u118:p503 + u118:p504 + u118:p505 + u118:p506 + u118:p507 + u118:p508 + u118:p509 + u118:p510 + u118:p511 + u118:p512 + u118:p513 + u118:p514 + u118:p515 + u118:p516 + u118:p517 + u118:p518 + u118:p519 + u118:p520 + u118:p521 + u118:p522 + u121:p0 = 1
invariant :u25:p49 + u25:p50 + u121:p0 = 1
invariant :u102:p419 + u102:p420 + u121:p0 = 1
invariant :u19:p37 + u19:p38 + u121:p0 = 1
invariant :u110:p442 + u111:p450 + u112:p458 + u113:p466 + u114:p474 + u115:p482 + u116:p490 + u117:p498 + u118:p522 + u119:p524 + 9'u121:p0 = 9
invariant :u63:p239 + u63:p240 + u63:p241 + u63:p242 + u63:p243 + u63:p244 + u63:p245 + u63:p246 + u121:p0 = 1
invariant :u22:p43 + u22:p44 + u121:p0 = 1
invariant :u83:p309 + u83:p310 + u83:p311 + u83:p312 + u83:p313 + u83:p314 + u83:p315 + -1'u84:p324 + -1'u85:p332 + -1'u86:p340 + -1'u87:p348 + -1'u88:p356 + -1'u89:p364 + -1'u90:p372 + -1'u91:p396 + -1'u92:p398 + -8'u121:p0 = -8
invariant :u89:p357 + u89:p358 + u89:p359 + u89:p360 + u89:p361 + u89:p362 + u89:p363 + u89:p364 + u121:p0 = 1
invariant :u92:p397 + u92:p398 + u121:p0 = 1
Reverse transition relation is NOT exact ! Due to transitions t614, t615, t616, t617, t618, t619, t620, t621, t668, t669, t670, t671, t672, t673, t674, t675, t722, t723, t724, t725, t726, t727, t728, t729, t776, t777, t778, t779, t780, t781, t782, t783, u39.t333, u39.t334, u39.t335, u39.t336, u66.t223, u66.t224, u66.t225, u66.t226, u93.t113, u93.t114, u93.t115, u93.t116, u120.t3, u120.t4, u120.t5, u120.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :328/417/40/785
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
155 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.64928,62680,1,0,116742,5915,5883,91531,522,23376,260060
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(G(F(F("((u9.p17>=1)&&(u118.p513>=1))")))))))
Formula 1 simplified : !XFGF"((u9.p17>=1)&&(u118.p513>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.70345,64700,1,0,118170,6605,6009,94129,522,25111,262807
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((("(u86.p336>=1)")U(G(X(F("((u79.p301>=1)&&(u91.p394>=1))"))))))
Formula 2 simplified : !("(u86.p336>=1)" U GXF"((u79.p301>=1)&&(u91.p394>=1))")
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1049 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.1966,453620,1,0,559860,1.25169e+06,6169,741564,522,2.88977e+06,266973
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(F("((u19.p38>=1)&&(u32.p82>=1))"))))
Formula 3 simplified : !XF"((u19.p38>=1)&&(u32.p82>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
35 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.5404,463916,1,0,578747,1.25192e+06,6413,773486,522,2.89058e+06,325061
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X("(u56.p186>=1)"))))
Formula 4 simplified : !FX"(u56.p186>=1)"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
19 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.7405,469460,1,0,588575,1.25214e+06,6613,787232,523,2.89139e+06,352785
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(G(F(X(X("((u104.p423>=1)&&(u118.p519>=1))")))))))
Formula 5 simplified : !XGFXX"((u104.p423>=1)&&(u118.p519>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.765,470160,1,0,588889,1.25217e+06,6664,787887,523,2.89151e+06,353720
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(("(u112.p455>=1)"))
Formula 6 simplified : !"(u112.p455>=1)"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.7657,470160,1,0,588889,1.25217e+06,6669,787887,524,2.89151e+06,353730
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(F("((u86.p335>=1)&&(u93.p402>=1))")))))
Formula 7 simplified : !GXF"((u86.p335>=1)&&(u93.p402>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8103,470944,1,0,589831,1.25219e+06,6765,789288,524,2.89166e+06,355787
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(G((X("((u100.p415>=1)&&(u118.p517>=1))"))U(G("(u88.p352>=1)"))))))
Formula 8 simplified : !G(X"((u100.p415>=1)&&(u118.p517>=1))" U G"(u88.p352>=1)")
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8634,472784,1,0,591516,1.25221e+06,6857,791257,524,2.89199e+06,359514
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G("((u93.p402>=1)&&(u86.p338>=1))")))
Formula 9 simplified : !G"((u93.p402>=1)&&(u86.p338>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8669,473312,1,0,591516,1.25221e+06,6874,791257,524,2.89199e+06,359576
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(("((u114.p471>=1)&&(u120.p528>=1))"))
Formula 10 simplified : !"((u114.p471>=1)&&(u120.p528>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8674,473312,1,0,591516,1.25221e+06,6879,791257,524,2.89199e+06,359580
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(("(u86.p336>=1)"))
Formula 11 simplified : !"(u86.p336>=1)"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8679,473312,1,0,591516,1.25221e+06,6882,791257,524,2.89199e+06,359615
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F(G(("(u116.p486>=1)")U("((u120.p528>=1)&&(u112.p456>=1))")))))
Formula 12 simplified : !FG("(u116.p486>=1)" U "((u120.p528>=1)&&(u112.p456>=1))")
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.8845,473532,1,0,591626,1.25221e+06,6937,791379,524,2.89204e+06,360178
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(X("((u33.p93>=1)&&(u39.p150>=1))"))))
Formula 13 simplified : !FX"((u33.p93>=1)&&(u39.p150>=1))"
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
100 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.8864,490956,1,0,625968,1.25262e+06,7196,847973,524,2.89327e+06,460323
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(("((u102.p420>=1)&&(u114.p469>=1))")U(F(X("((u51.p174>=1)&&(u64.p256>=1))"))))))
Formula 14 simplified : !F("((u102.p420>=1)&&(u114.p469>=1))" U FX"((u51.p174>=1)&&(u64.p256>=1))")
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
96 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.8489,525540,1,0,685163,1.27867e+06,7425,969887,524,3.0412e+06,504081
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F("(u83.p312>=1)"))U((F("(u101.p418>=1)"))U(G("((u52.p176>=1)&&(u62.p232>=1))")))))
Formula 15 simplified : !(F"(u83.p312>=1)" U (F"(u101.p418>=1)" U G"((u52.p176>=1)&&(u62.p232>=1))"))
Computing Next relation with stutter on 1.50062e+06 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.9439,528888,1,0,689554,1.27898e+06,7589,975347,524,3.04228e+06,512910
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Parking-PT-432-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527487527423

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 28, 2018 6:05:05 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
May 28, 2018 6:05:05 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 28, 2018 6:05:05 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 138 ms
May 28, 2018 6:05:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 529 places.
May 28, 2018 6:05:05 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 785 transitions.
May 28, 2018 6:05:05 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
May 28, 2018 6:05:05 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 28 ms
May 28, 2018 6:05:05 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 28, 2018 6:05:05 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 28, 2018 6:05:06 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 152 ms
May 28, 2018 6:05:06 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 28, 2018 6:05:06 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 160 redundant transitions.
May 28, 2018 6:05:06 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 11 ms
May 28, 2018 6:05:06 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
May 28, 2018 6:05:06 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 328 identical transitions.
May 28, 2018 6:05:06 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 457 transitions.
May 28, 2018 6:05:07 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 124 place invariants in 221 ms
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 529 variables to be positive in 1296 ms
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 457 transitions.
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/457 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 457 transitions.
May 28, 2018 6:05:08 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
May 28, 2018 6:05:10 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 457 transitions.
May 28, 2018 6:05:11 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(26/457) took 973 ms. Total solver calls (SAT/UNSAT): 989(237/752)
May 28, 2018 6:05:14 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(140/457) took 4233 ms. Total solver calls (SAT/UNSAT): 2749(687/2062)
May 28, 2018 6:05:17 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(188/457) took 7586 ms. Total solver calls (SAT/UNSAT): 3264(834/2430)
May 28, 2018 6:05:20 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(298/457) took 10603 ms. Total solver calls (SAT/UNSAT): 4413(1219/3194)
May 28, 2018 6:05:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 13423 ms. Total solver calls (SAT/UNSAT): 4492(1260/3232)
May 28, 2018 6:05:23 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 457 transitions.
May 28, 2018 6:05:24 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 353 ms. Total solver calls (SAT/UNSAT): 36(0/36)
May 28, 2018 6:05:24 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 17798ms conformant to PINS in folder :/home/mcc/execution

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-432"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is Parking-PT-432, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r260-csrt-152732585300118"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;