Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961257800538.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r111-csrt-158961257800538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 3.7K Apr 11 23:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 11 23:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 10 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 192K Mar 24 05:37 model.pnml

--------------------
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-00
FORMULA_NAME Parking-PT-432-01
FORMULA_NAME Parking-PT-432-02
FORMULA_NAME Parking-PT-432-03
FORMULA_NAME Parking-PT-432-04
FORMULA_NAME Parking-PT-432-05
FORMULA_NAME Parking-PT-432-06
FORMULA_NAME Parking-PT-432-07
FORMULA_NAME Parking-PT-432-08
FORMULA_NAME Parking-PT-432-09
FORMULA_NAME Parking-PT-432-10
FORMULA_NAME Parking-PT-432-11
FORMULA_NAME Parking-PT-432-12
FORMULA_NAME Parking-PT-432-13
FORMULA_NAME Parking-PT-432-14
FORMULA_NAME Parking-PT-432-15

=== Now, execution of the tool begins

BK_START 1590000705793

[2020-05-20 18:51:47] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 18:51:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 18:51:48] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2020-05-20 18:51:48] [INFO ] Transformed 529 places.
[2020-05-20 18:51:48] [INFO ] Transformed 785 transitions.
[2020-05-20 18:51:48] [INFO ] Found NUPN structural information;
[2020-05-20 18:51:48] [INFO ] Parsed PT model containing 529 places and 785 transitions in 215 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 911 resets, run finished after 793 ms. (steps per millisecond=126 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 457 rows 529 cols
[2020-05-20 18:51:49] [INFO ] Computed 124 place invariants in 40 ms
[2020-05-20 18:51:49] [INFO ] [Real]Absence check using 120 positive place invariants in 80 ms returned sat
[2020-05-20 18:51:49] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 5 ms returned sat
[2020-05-20 18:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:50] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2020-05-20 18:51:50] [INFO ] State equation strengthened by 108 read => feed constraints.
[2020-05-20 18:51:50] [INFO ] [Real]Added 108 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:50] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 57 ms.
[2020-05-20 18:51:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:50] [INFO ] [Nat]Absence check using 120 positive place invariants in 69 ms returned sat
[2020-05-20 18:51:50] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-20 18:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:51] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2020-05-20 18:51:51] [INFO ] [Nat]Added 108 Read/Feed constraints in 17 ms returned sat
[2020-05-20 18:51:51] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 41 ms.
[2020-05-20 18:51:56] [INFO ] Added : 439 causal constraints over 88 iterations in 4837 ms. Result :sat
[2020-05-20 18:51:56] [INFO ] Deduced a trap composed of 52 places in 82 ms
[2020-05-20 18:51:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2020-05-20 18:51:56] [INFO ] [Real]Absence check using 120 positive place invariants in 67 ms returned sat
[2020-05-20 18:51:56] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 6 ms returned sat
[2020-05-20 18:51:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:57] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-05-20 18:51:57] [INFO ] [Real]Added 108 Read/Feed constraints in 18 ms returned sat
[2020-05-20 18:51:57] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 29 ms.
[2020-05-20 18:51:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:51:58] [INFO ] [Nat]Absence check using 120 positive place invariants in 67 ms returned sat
[2020-05-20 18:51:58] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-20 18:51:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:51:58] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2020-05-20 18:51:58] [INFO ] [Nat]Added 108 Read/Feed constraints in 32 ms returned sat
[2020-05-20 18:51:58] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 116 ms.
[2020-05-20 18:52:02] [INFO ] Added : 439 causal constraints over 88 iterations in 4122 ms. Result :sat
[2020-05-20 18:52:03] [INFO ] Deduced a trap composed of 52 places in 79 ms
[2020-05-20 18:52:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2020-05-20 18:52:03] [INFO ] [Real]Absence check using 120 positive place invariants in 65 ms returned sat
[2020-05-20 18:52:03] [INFO ] [Real]Absence check using 120 positive and 4 generalized place invariants in 8 ms returned sat
[2020-05-20 18:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:04] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2020-05-20 18:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 18:52:04] [INFO ] [Nat]Absence check using 120 positive place invariants in 64 ms returned sat
[2020-05-20 18:52:04] [INFO ] [Nat]Absence check using 120 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-20 18:52:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 18:52:04] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2020-05-20 18:52:04] [INFO ] [Nat]Added 108 Read/Feed constraints in 22 ms returned sat
[2020-05-20 18:52:05] [INFO ] Deduced a trap composed of 52 places in 68 ms
[2020-05-20 18:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2020-05-20 18:52:05] [INFO ] Computed and/alt/rep : 456/1928/456 causal constraints in 22 ms.
[2020-05-20 18:52:08] [INFO ] Added : 437 causal constraints over 88 iterations in 3782 ms. Result :sat
[2020-05-20 18:52:08] [INFO ] Deduced a trap composed of 60 places in 66 ms
[2020-05-20 18:52:09] [INFO ] Deduced a trap composed of 52 places in 54 ms
[2020-05-20 18:52:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2020-05-20 18:52:09] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-05-20 18:52:09] [INFO ] Flatten gal took : 93 ms
FORMULA Parking-PT-432-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-432-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-20 18:52:09] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-20 18:52:09] [INFO ] Applying decomposition
[2020-05-20 18:52:09] [INFO ] Flatten gal took : 51 ms
[2020-05-20 18:52:09] [INFO ] Input system was already deterministic with 457 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph14843929118605925425.txt, -o, /tmp/graph14843929118605925425.bin, -w, /tmp/graph14843929118605925425.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph14843929118605925425.bin, -l, -1, -v, -w, /tmp/graph14843929118605925425.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-20 18:52:09] [INFO ] Decomposing Gal with order
[2020-05-20 18:52:09] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 457 rows 529 cols
[2020-05-20 18:52:10] [INFO ] Computed 124 place invariants in 11 ms
inv : p0 + p35 + p36 = 1
inv : p0 + p25 + p26 = 1
inv : p0 + p45 + p46 = 1
inv : p0 + p5 + p6 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p15 + p16 = 1
inv : p0 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 = 1
inv : 9*p0 + p64 + p72 + p80 + p88 + p96 + p104 + p112 + p120 + p144 + p146 = 9
inv : p0 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 = 1
inv : p0 + p155 + p156 = 1
inv : p0 + p145 + p146 = 1
inv : p0 + p399 + p400 + p401 + p402 = 1
inv : p0 + p417 + p418 = 1
inv : p0 + p97 + p98 + p99 + p100 + p101 + p102 + p103 + p104 = 1
inv : p0 + p175 + p176 = 1
inv : p0 + p285 + p286 = 1
inv : p0 + p297 + p298 = 1
inv : p0 + p415 + p416 = 1
inv : p0 + p287 + p288 = 1
inv : p0 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 = 1
inv : p0 + p305 + p306 = 1
inv : p0 + p177 + p178 = 1
inv : p0 + p427 + p428 = 1
inv : p0 + p13 + p14 = 1
inv : p0 + p165 + p166 = 1
inv : p0 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 = 1
inv : p0 + p37 + p38 = 1
inv : p0 + p397 + p398 = 1
inv : p0 + p7 + p8 = 1
inv : p0 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 = 1
inv : p0 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 = 1
inv : p0 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 = 1
inv : p0 + p153 + p154 = 1
inv : p0 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 = 1
inv : p0 + p283 + p284 = 1
inv : p0 + p27 + p28 = 1
inv : p0 + p17 + p18 = 1
inv : p0 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 = 1
inv : p0 + p3 + p4 = 1
inv : p0 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 = 1
inv : p0 + p413 + p414 = 1
inv : p0 + p53 + p54 = 1
inv : p0 + p147 + p148 + p149 + p150 = 1
inv : p0 + p157 + p158 = 1
inv : p0 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 = 1
inv : p0 + p169 + p170 = 1
inv : p0 + p425 + p426 = 1
inv : p0 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 = 1
inv : -8*p0 + p57 + p58 + p59 + p60 + p61 + p62 + p63 - p72 - p80 - p88 - p96 - p104 - p112 - p120 - p144 - p146 = -8
inv : -8*p0 + p183 + p184 + p185 + p186 + p187 + p188 + p189 - p198 - p206 - p214 - p222 - p230 - p238 - p246 - p270 - p272 = -8
inv : p0 + p307 + p308 = 1
inv : -8*p0 + p435 + p436 + p437 + p438 + p439 + p440 + p441 - p450 - p458 - p466 - p474 - p482 - p490 - p498 - p522 - p524 = -8
inv : p0 + p39 + p40 = 1
inv : p0 + p167 + p168 = 1
inv : p0 + p295 + p296 = 1
inv : -8*p0 + p309 + p310 + p311 + p312 + p313 + p314 + p315 - p324 - p332 - p340 - p348 - p356 - p364 - p372 - p396 - p398 = -8
inv : p0 + p423 + p424 = 1
inv : p0 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 = 1
inv : p0 + p273 + p274 + p275 + p276 = 1
inv : p0 + p51 + p52 = 1
inv : p0 + p179 + p180 = 1
inv : p0 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 = 1
inv : p0 + p291 + p292 = 1
inv : p0 + p301 + p302 = 1
inv : p0 + p411 + p412 = 1
inv : p0 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 = 1
inv : p0 + p161 + p162 = 1
inv : p0 + p151 + p152 = 1
inv : p0 + p181 + p182 = 1
inv : p0 + p9 + p10 = 1
inv : p0 + p431 + p432 = 1
inv : p0 + p41 + p42 = 1
inv : p0 + p29 + p30 = 1
inv : p0 + p271 + p272 = 1
inv : 9*p0 + p442 + p450 + p458 + p466 + p474 + p482 + p490 + p498 + p522 + p524 = 9
inv : p0 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 = 1
inv : p0 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 = 1
inv : p0 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 = 1
inv : p0 + p159 + p160 = 1
inv : p0 + p31 + p32 = 1
inv : p0 + p433 + p434 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p49 + p50 = 1
inv : p0 + p525 + p526 + p527 + p528 = 1
inv : p0 + p299 + p300 = 1
inv : p0 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 = 1
inv : p0 + p171 + p172 = 1
inv : p0 + p403 + p404 = 1
inv : p0 + p293 + p294 = 1
inv : p0 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 = 1
inv : p0 + p421 + p422 = 1
inv : p0 + p19 + p20 = 1
inv : p0 + p409 + p410 = 1
inv : p0 + p281 + p282 = 1
inv : p0 + p173 + p174 = 1
inv : p0 + p163 + p164 = 1
inv : p0 + p429 + p430 = 1
inv : p0 + p419 + p420 = 1
inv : p0 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 = 1
inv : p0 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 = 1
inv : p0 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 = 1
inv : p0 + p43 + p44 = 1
inv : p0 + p33 + p34 = 1
inv : p0 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 = 1
inv : p0 + p289 + p290 = 1
inv : 9*p0 + p190 + p198 + p206 + p214 + p222 + p230 + p238 + p246 + p270 + p272 = 9
inv : p0 + p279 + p280 = 1
inv : p0 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 = 1
inv : p0 + p47 + p48 = 1
inv : p0 + p23 + p24 = 1
inv : p0 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 = 1
inv : p0 + p303 + p304 = 1
inv : 9*p0 + p316 + p324 + p332 + p340 + p348 + p356 + p364 + p372 + p396 + p398 = 9
inv : p0 + p405 + p406 = 1
inv : p0 + p277 + p278 = 1
inv : p0 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 = 1
inv : p0 + p523 + p524 = 1
inv : p0 + p21 + p22 = 1
inv : p0 + p11 + p12 = 1
inv : p0 + p407 + p408 = 1
inv : p0 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p0 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 = 1
inv : p0 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 = 1
Total of 124 invariants.
[2020-05-20 18:52:10] [INFO ] Computed 124 place invariants in 36 ms
[2020-05-20 18:52:10] [INFO ] Removed a total of 24 redundant transitions.
[2020-05-20 18:52:10] [INFO ] Flatten gal took : 134 ms
[2020-05-20 18:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 30 ms.
[2020-05-20 18:52:10] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 20 ms
[2020-05-20 18:52:10] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 13 LTL properties
Checking formula 0 : !((G("(i3.u23.p48!=1)")))
Formula 0 simplified : !G"(i3.u23.p48!=1)"
built 41 ordering constraints for composite.
built 22 ordering constraints for composite.
built 39 ordering constraints for composite.
built 17 ordering constraints for composite.
built 21 ordering constraints for composite.
built 17 ordering constraints for composite.
built 12 ordering constraints for composite.
built 18 ordering constraints for composite.
built 26 ordering constraints for composite.
built 28 ordering constraints for composite.
built 26 ordering constraints for composite.
built 13 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 25 ordering constraints for composite.
built 23 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 5 ordering constraints for composite.
built 50 ordering constraints for composite.
built 17 ordering constraints for composite.
built 14 ordering constraints for composite.
built 5 ordering constraints for composite.
built 22 ordering constraints for composite.
built 26 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 25 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
built 23 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
[2020-05-20 18:52:11] [INFO ] Proved 529 variables to be positive in 1071 ms
[2020-05-20 18:52:11] [INFO ] Computing symmetric may disable matrix : 457 transitions.
[2020-05-20 18:52:11] [INFO ] Computation of disable matrix completed :0/457 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:52:11] [INFO ] Computation of Complete disable matrix. took 42 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-20 18:52:11] [INFO ] Computing symmetric may enable matrix : 457 transitions.
[2020-05-20 18:52:11] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions t617, t618, t669, t671, t672, t673, t674, t725, t726, t779, t780, t781, i0.u51.t334, i0.u51.t336, i1.t783, i1.t782, i1.t778, i1.t777, i1.t776, i9.t728, i9.t727, i9.t724, i9.i1.t723, i9.i1.t729, i9.i1.i0.t722, i10.u90.t224, i10.u90.t226, i13.t675, i13.t670, i13.t668, i13.u129.t114, i13.u129.t116, i17.u169.t4, i17.u169.t6, i18.t620, i18.t619, i18.t616, i18.i1.t615, i18.i1.t621, i18.i1.i2.t614, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/417/40/457
Computing Next relation with stutter on 1.50062e+06 deadlock states
[2020-05-20 18:52:13] [INFO ] Computing symmetric co enabling matrix : 457 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
362 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,3.70292,95768,1,0,141610,105644,6656,224090,1442,222058,242151
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Parking-PT-432-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X((F(G(!(F(G("(i11.u108.p320==1)"))))))U(((G("((i11.u99.p294==1)&&(i11.u113.p342==1))"))||("(i5.u52.p151!=1)"))||("(i5.u86.p262!=1)"))))))
Formula 1 simplified : !XX(FG!FG"(i11.u108.p320==1)" U ("(i5.u52.p151!=1)" | "(i5.u86.p262!=1)" | G"((i11.u99.p294==1)&&(i11.u113.p342==1))"))
Computing Next relation with stutter on 1.50062e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,3.71623,97944,1,0,141610,105644,6710,224090,1446,222058,242272
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA Parking-PT-432-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(G(!(G(!((G(("((i0.u37.p108==1)&&(i19.u143.p430!=1))")U(F("(i0.u37.p108==1)"))))U("(i0.u37.p108==1)"))))))))
Formula 2 simplified : !XG!G!(G("((i0.u37.p108==1)&&(i19.u143.p430!=1))" U F"(i0.u37.p108==1)") U "(i0.u37.p108==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
7 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,3.79016,100040,1,0,148594,105651,6771,234656,1446,222116,250115
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Parking-PT-432-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((("((i11.u93.p281==1)&&(i11.u125.p389==1))")U(G((!(F(G(((F("((i10.u90.p227==1)&&(i10.u90.p276==1))"))||("(i11.u93.p281!=1)"))||("(i11.u125.p389!=1)")))))||("((i9.i1.i0.u66.p179==1)&&(i9.i1.i0.u89.p269==1))"))))U("((i15.u104.p303==1)&&(i13.u128.p363==1))")))
Formula 3 simplified : !(("((i11.u93.p281==1)&&(i11.u125.p389==1))" U G("((i9.i1.i0.u66.p179==1)&&(i9.i1.i0.u89.p269==1))" | !FG("(i11.u93.p281!=1)" | "(i11.u125.p389!=1)" | F"((i10.u90.p227==1)&&(i10.u90.p276==1))"))) U "((i15.u104.p303==1)&&(i13.u128.p363==1))")
Computing Next relation with stutter on 1.50062e+06 deadlock states
[2020-05-20 18:52:14] [INFO ] Computation of co-enabling matrix(6/457) took 710 ms. Total solver calls (SAT/UNSAT): 527(12/515)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
74 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,4.55683,126860,1,0,201185,107797,6876,313197,1455,230499,336380
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Parking-PT-432-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(F(G(F(X(G("(i10.u71.p202==1)")))))))))
Formula 4 simplified : !XXFGFXG"(i10.u71.p202==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
7 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,4.62565,128444,1,0,205463,107811,6918,318355,1455,230560,341261
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Parking-PT-432-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G("(i4.u29.p68==1)"))||("((i1.u24.p49==1)&&(i1.u49.p142==1))"))))
Formula 5 simplified : !F("((i1.u24.p49==1)&&(i1.u49.p142==1))" | G"(i4.u29.p68==1)")
Computing Next relation with stutter on 1.50062e+06 deadlock states
[2020-05-20 18:52:17] [INFO ] Computation of co-enabling matrix(102/457) took 3711 ms. Total solver calls (SAT/UNSAT): 1135(235/900)
[2020-05-20 18:52:20] [INFO ] Computation of co-enabling matrix(186/457) took 6837 ms. Total solver calls (SAT/UNSAT): 1894(589/1305)
[2020-05-20 18:52:23] [INFO ] Computation of co-enabling matrix(215/457) took 9840 ms. Total solver calls (SAT/UNSAT): 2279(764/1515)
[2020-05-20 18:52:26] [INFO ] Computation of co-enabling matrix(297/457) took 12857 ms. Total solver calls (SAT/UNSAT): 3226(890/2336)
[2020-05-20 18:52:29] [INFO ] Computation of co-enabling matrix(386/457) took 15874 ms. Total solver calls (SAT/UNSAT): 3946(1085/2861)
[2020-05-20 18:52:32] [INFO ] Computation of co-enabling matrix(431/457) took 19096 ms. Total solver calls (SAT/UNSAT): 4304(1196/3108)
[2020-05-20 18:52:35] [INFO ] Computation of co-enabling matrix(450/457) took 22140 ms. Total solver calls (SAT/UNSAT): 4477(1253/3224)
[2020-05-20 18:52:35] [INFO ] Computation of Finished co-enabling matrix. took 22540 ms. Total solver calls (SAT/UNSAT): 4492(1268/3224)
[2020-05-20 18:52:36] [INFO ] Computing Do-Not-Accords matrix : 457 transitions.
[2020-05-20 18:52:36] [INFO ] Computation of Completed DNA matrix. took 533 ms. Total solver calls (SAT/UNSAT): 36(0/36)
[2020-05-20 18:52:36] [INFO ] Built C files in 27187ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 6414 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 87 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( []((LTLAP14==true))) || ( (LTLAP15==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( []((LTLAP14==true))) || ( (LTLAP15==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( []((LTLAP14==true))) || ( (LTLAP15==true)) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7596 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,80.5887,1036604,1,0,2.78704e+06,110194,6961,2.01976e+06,1455,245844,1402700
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Parking-PT-432-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(X(("((i13.u103.p302==1)&&(i13.u115.p358==1))")||(((!(F("((i1.u50.p88==1)&&(i1.u50.p145==1))")))&&(!(G("((i15.u102.p299==1)&&(i13.u128.p355==1))"))))&&("((i13.u103.p302!=1)||(i13.u115.p358!=1))")))))))
Formula 6 simplified : !XXX("((i13.u103.p302==1)&&(i13.u115.p358==1))" | ("((i13.u103.p302!=1)||(i13.u115.p358!=1))" & !F"((i1.u50.p88==1)&&(i1.u50.p145==1))" & !G"((i15.u102.p299==1)&&(i13.u128.p355==1))"))
Computing Next relation with stutter on 1.50062e+06 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
74 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,81.3289,1060100,1,0,2.83619e+06,110213,7090,2.06937e+06,1461,246008,1479785
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Parking-PT-432-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(G("(i9.i0.i2.u60.p168==1)"))))
Formula 7 simplified : !XG"(i9.i0.i2.u60.p168==1)"
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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,81.6506,1069604,1,0,2.86055e+06,111043,7130,2.09583e+06,1461,250921,1520124
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Parking-PT-432-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F((F(((G("(i10.u71.p202==1)"))||(G("(i14.u94.p284==1)")))||("(i14.u94.p284==1)")))U("(i4.u16.p34==1)"))))
Formula 8 simplified : !F(F("(i14.u94.p284==1)" | G"(i10.u71.p202==1)" | G"(i14.u94.p284==1)") U "(i4.u16.p34==1)")
Computing Next relation with stutter on 1.50062e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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,81.6538,1069604,1,0,2.86055e+06,111043,7179,2.09583e+06,1461,250921,1520227
no accepting run found
Formula 8 is TRUE no accepting run found.
FORMULA Parking-PT-432-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F(X((G(!(F("((i1.u26.p53==1)&&(i1.u50.p143==1))"))))||("((i13.u97.p289==1)&&(i11.u126.p391==1))"))))||(F(G("((i13.u97.p289==1)&&(i11.u126.p391==1))")))))
Formula 9 simplified : !(FX("((i13.u97.p289==1)&&(i11.u126.p391==1))" | G!F"((i1.u26.p53==1)&&(i1.u50.p143==1))") | FG"((i13.u97.p289==1)&&(i11.u126.p391==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
2861 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,110.273,1646588,1,0,3.85493e+06,113831,7241,4.16829e+06,1461,258758,2663401
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Parking-PT-432-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((((X("(i13.u110.p328==1)"))&&(F((X(G(F("(i0.u31.p76==1)"))))||("(i6.u4.p10==1)"))))U("(i13.u110.p328==1)")))
Formula 10 simplified : !((X"(i13.u110.p328==1)" & F("(i6.u4.p10==1)" | XGF"(i0.u31.p76==1)")) U "(i13.u110.p328==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
476 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,115.024,1811060,1,0,4.19368e+06,115076,7266,4.55208e+06,1461,262562,3247238
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Parking-PT-432-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((!(G((!(F("((i17.u157.p493==1)&&(i17.u169.p528==1))")))&&("(i13.u110.p328!=1)"))))||(!(F(X(X("(i0.u33.p84==1)")))))))
Formula 11 simplified : !(!G("(i13.u110.p328!=1)" & !F"((i17.u157.p493==1)&&(i17.u169.p528==1))") | !FXX"(i0.u33.p84==1)")
Computing Next relation with stutter on 1.50062e+06 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6922 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,184.251,2661668,1,0,5.81803e+06,118890,3206,6.66455e+06,558,272680,54304
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Parking-PT-432-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((("(i17.u151.p462==1)")U(X("(i13.u116.p360==1)"))))
Formula 12 simplified : !("(i17.u151.p462==1)" U X"(i13.u116.p360==1)")
Computing Next relation with stutter on 1.50062e+06 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
59 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,184.843,2661668,1,0,5.81803e+06,118890,3930,6.66455e+06,689,272680,122921
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Parking-PT-432-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1590000916032

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -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/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
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 r111-csrt-158961257800538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;