fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477000148
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldIIPs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.560 3600000.00 3991998.00 1258.00 ?F?T???TT??????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477000148.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477000148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 3.4K May 14 00:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 00:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 17:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 17:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 07:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 07:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 332K May 12 20:42 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 ShieldIIPs-PT-020B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591288333040

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:32:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 16:32:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:32:14] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2020-06-04 16:32:14] [INFO ] Transformed 1203 places.
[2020-06-04 16:32:14] [INFO ] Transformed 1183 transitions.
[2020-06-04 16:32:14] [INFO ] Found NUPN structural information;
[2020-06-04 16:32:14] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Incomplete random walk after 100000 steps, including 39 resets, run finished after 512 ms. (steps per millisecond=195 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 1183 rows 1203 cols
[2020-06-04 16:32:15] [INFO ] Computed 181 place invariants in 32 ms
[2020-06-04 16:32:15] [INFO ] [Real]Absence check using 181 positive place invariants in 143 ms returned sat
[2020-06-04 16:32:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:18] [INFO ] [Real]Absence check using state equation in 2976 ms returned sat
[2020-06-04 16:32:19] [INFO ] Deduced a trap composed of 27 places in 625 ms
[2020-06-04 16:32:20] [INFO ] Deduced a trap composed of 31 places in 587 ms
[2020-06-04 16:32:20] [INFO ] Deduced a trap composed of 18 places in 522 ms
[2020-06-04 16:32:21] [INFO ] Deduced a trap composed of 36 places in 486 ms
[2020-06-04 16:32:21] [INFO ] Deduced a trap composed of 36 places in 506 ms
[2020-06-04 16:32:22] [INFO ] Deduced a trap composed of 23 places in 454 ms
[2020-06-04 16:32:22] [INFO ] Deduced a trap composed of 40 places in 459 ms
[2020-06-04 16:32:23] [INFO ] Deduced a trap composed of 14 places in 459 ms
[2020-06-04 16:32:23] [INFO ] Deduced a trap composed of 30 places in 437 ms
[2020-06-04 16:32:24] [INFO ] Deduced a trap composed of 18 places in 435 ms
[2020-06-04 16:32:24] [INFO ] Deduced a trap composed of 13 places in 321 ms
[2020-06-04 16:32:25] [INFO ] Deduced a trap composed of 20 places in 321 ms
[2020-06-04 16:32:25] [INFO ] Deduced a trap composed of 21 places in 335 ms
[2020-06-04 16:32:25] [INFO ] Deduced a trap composed of 21 places in 400 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 15 places in 362 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 21 places in 402 ms
[2020-06-04 16:32:27] [INFO ] Deduced a trap composed of 23 places in 352 ms
[2020-06-04 16:32:27] [INFO ] Deduced a trap composed of 30 places in 395 ms
[2020-06-04 16:32:28] [INFO ] Deduced a trap composed of 43 places in 370 ms
[2020-06-04 16:32:28] [INFO ] Deduced a trap composed of 31 places in 371 ms
[2020-06-04 16:32:28] [INFO ] Deduced a trap composed of 18 places in 366 ms
[2020-06-04 16:32:29] [INFO ] Deduced a trap composed of 27 places in 348 ms
[2020-06-04 16:32:29] [INFO ] Deduced a trap composed of 18 places in 321 ms
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 17 places in 350 ms
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 26 places in 296 ms
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 25 places in 395 ms
[2020-06-04 16:32:31] [INFO ] Deduced a trap composed of 33 places in 363 ms
[2020-06-04 16:32:31] [INFO ] Deduced a trap composed of 28 places in 363 ms
[2020-06-04 16:32:32] [INFO ] Deduced a trap composed of 26 places in 335 ms
[2020-06-04 16:32:32] [INFO ] Deduced a trap composed of 35 places in 341 ms
[2020-06-04 16:32:32] [INFO ] Deduced a trap composed of 26 places in 314 ms
[2020-06-04 16:32:33] [INFO ] Deduced a trap composed of 33 places in 348 ms
[2020-06-04 16:32:33] [INFO ] Deduced a trap composed of 32 places in 309 ms
[2020-06-04 16:32:34] [INFO ] Deduced a trap composed of 31 places in 296 ms
[2020-06-04 16:32:34] [INFO ] Deduced a trap composed of 30 places in 303 ms
[2020-06-04 16:32:34] [INFO ] Deduced a trap composed of 30 places in 294 ms
[2020-06-04 16:32:35] [INFO ] Deduced a trap composed of 20 places in 282 ms
[2020-06-04 16:32:35] [INFO ] Deduced a trap composed of 21 places in 255 ms
[2020-06-04 16:32:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s967 s968 s985 s986 s987 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1015 s1023 s1024 s1025) 0)") while checking expression at index 0
[2020-06-04 16:32:35] [INFO ] [Real]Absence check using 181 positive place invariants in 128 ms returned sat
[2020-06-04 16:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:38] [INFO ] [Real]Absence check using state equation in 2575 ms returned sat
[2020-06-04 16:32:38] [INFO ] Deduced a trap composed of 29 places in 546 ms
[2020-06-04 16:32:39] [INFO ] Deduced a trap composed of 37 places in 464 ms
[2020-06-04 16:32:39] [INFO ] Deduced a trap composed of 11 places in 423 ms
[2020-06-04 16:32:40] [INFO ] Deduced a trap composed of 18 places in 460 ms
[2020-06-04 16:32:40] [INFO ] Deduced a trap composed of 25 places in 481 ms
[2020-06-04 16:32:41] [INFO ] Deduced a trap composed of 26 places in 389 ms
[2020-06-04 16:32:41] [INFO ] Deduced a trap composed of 22 places in 330 ms
[2020-06-04 16:32:42] [INFO ] Deduced a trap composed of 21 places in 327 ms
[2020-06-04 16:32:42] [INFO ] Deduced a trap composed of 36 places in 335 ms
[2020-06-04 16:32:42] [INFO ] Deduced a trap composed of 33 places in 385 ms
[2020-06-04 16:32:43] [INFO ] Deduced a trap composed of 22 places in 317 ms
[2020-06-04 16:32:43] [INFO ] Deduced a trap composed of 21 places in 310 ms
[2020-06-04 16:32:44] [INFO ] Deduced a trap composed of 33 places in 362 ms
[2020-06-04 16:32:44] [INFO ] Deduced a trap composed of 32 places in 391 ms
[2020-06-04 16:32:44] [INFO ] Deduced a trap composed of 37 places in 379 ms
[2020-06-04 16:32:45] [INFO ] Deduced a trap composed of 28 places in 352 ms
[2020-06-04 16:32:45] [INFO ] Deduced a trap composed of 21 places in 349 ms
[2020-06-04 16:32:46] [INFO ] Deduced a trap composed of 26 places in 358 ms
[2020-06-04 16:32:46] [INFO ] Deduced a trap composed of 32 places in 462 ms
[2020-06-04 16:32:47] [INFO ] Deduced a trap composed of 20 places in 373 ms
[2020-06-04 16:32:47] [INFO ] Deduced a trap composed of 45 places in 381 ms
[2020-06-04 16:32:48] [INFO ] Deduced a trap composed of 22 places in 367 ms
[2020-06-04 16:32:48] [INFO ] Deduced a trap composed of 55 places in 431 ms
[2020-06-04 16:32:48] [INFO ] Deduced a trap composed of 44 places in 343 ms
[2020-06-04 16:32:49] [INFO ] Deduced a trap composed of 55 places in 443 ms
[2020-06-04 16:32:49] [INFO ] Deduced a trap composed of 30 places in 404 ms
[2020-06-04 16:32:50] [INFO ] Deduced a trap composed of 28 places in 320 ms
[2020-06-04 16:32:50] [INFO ] Deduced a trap composed of 31 places in 360 ms
[2020-06-04 16:32:51] [INFO ] Deduced a trap composed of 26 places in 352 ms
[2020-06-04 16:32:51] [INFO ] Deduced a trap composed of 41 places in 365 ms
[2020-06-04 16:32:51] [INFO ] Deduced a trap composed of 38 places in 347 ms
[2020-06-04 16:32:52] [INFO ] Deduced a trap composed of 31 places in 356 ms
[2020-06-04 16:32:52] [INFO ] Deduced a trap composed of 52 places in 378 ms
[2020-06-04 16:32:53] [INFO ] Deduced a trap composed of 29 places in 409 ms
[2020-06-04 16:32:53] [INFO ] Deduced a trap composed of 32 places in 458 ms
[2020-06-04 16:32:54] [INFO ] Deduced a trap composed of 33 places in 446 ms
[2020-06-04 16:32:54] [INFO ] Deduced a trap composed of 26 places in 433 ms
[2020-06-04 16:32:55] [INFO ] Deduced a trap composed of 42 places in 379 ms
[2020-06-04 16:32:55] [INFO ] Deduced a trap composed of 29 places in 380 ms
[2020-06-04 16:32:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s554 s555 s556 s557 s558 s559 s560 s561 s562 s603 s604 s605 s606 s607 s608 s609 s610 s611) 0)") while checking expression at index 1
[2020-06-04 16:32:55] [INFO ] [Real]Absence check using 181 positive place invariants in 116 ms returned sat
[2020-06-04 16:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:58] [INFO ] [Real]Absence check using state equation in 2496 ms returned sat
[2020-06-04 16:32:59] [INFO ] Deduced a trap composed of 18 places in 586 ms
[2020-06-04 16:32:59] [INFO ] Deduced a trap composed of 25 places in 569 ms
[2020-06-04 16:33:00] [INFO ] Deduced a trap composed of 29 places in 527 ms
[2020-06-04 16:33:00] [INFO ] Deduced a trap composed of 23 places in 550 ms
[2020-06-04 16:33:01] [INFO ] Deduced a trap composed of 29 places in 564 ms
[2020-06-04 16:33:01] [INFO ] Deduced a trap composed of 23 places in 496 ms
[2020-06-04 16:33:02] [INFO ] Deduced a trap composed of 22 places in 537 ms
[2020-06-04 16:33:03] [INFO ] Deduced a trap composed of 21 places in 526 ms
[2020-06-04 16:33:03] [INFO ] Deduced a trap composed of 20 places in 545 ms
[2020-06-04 16:33:04] [INFO ] Deduced a trap composed of 24 places in 514 ms
[2020-06-04 16:33:04] [INFO ] Deduced a trap composed of 21 places in 463 ms
[2020-06-04 16:33:05] [INFO ] Deduced a trap composed of 21 places in 372 ms
[2020-06-04 16:33:05] [INFO ] Deduced a trap composed of 29 places in 525 ms
[2020-06-04 16:33:06] [INFO ] Deduced a trap composed of 26 places in 507 ms
[2020-06-04 16:33:06] [INFO ] Deduced a trap composed of 24 places in 515 ms
[2020-06-04 16:33:07] [INFO ] Deduced a trap composed of 24 places in 536 ms
[2020-06-04 16:33:08] [INFO ] Deduced a trap composed of 23 places in 502 ms
[2020-06-04 16:33:08] [INFO ] Deduced a trap composed of 30 places in 500 ms
[2020-06-04 16:33:09] [INFO ] Deduced a trap composed of 20 places in 538 ms
[2020-06-04 16:33:09] [INFO ] Deduced a trap composed of 29 places in 492 ms
[2020-06-04 16:33:10] [INFO ] Deduced a trap composed of 17 places in 463 ms
[2020-06-04 16:33:10] [INFO ] Deduced a trap composed of 25 places in 458 ms
[2020-06-04 16:33:11] [INFO ] Deduced a trap composed of 21 places in 480 ms
[2020-06-04 16:33:11] [INFO ] Deduced a trap composed of 34 places in 485 ms
[2020-06-04 16:33:12] [INFO ] Deduced a trap composed of 48 places in 414 ms
[2020-06-04 16:33:12] [INFO ] Deduced a trap composed of 32 places in 372 ms
[2020-06-04 16:33:13] [INFO ] Deduced a trap composed of 32 places in 375 ms
[2020-06-04 16:33:13] [INFO ] Deduced a trap composed of 25 places in 351 ms
[2020-06-04 16:33:14] [INFO ] Deduced a trap composed of 29 places in 381 ms
[2020-06-04 16:33:14] [INFO ] Deduced a trap composed of 36 places in 409 ms
[2020-06-04 16:33:15] [INFO ] Deduced a trap composed of 27 places in 373 ms
[2020-06-04 16:33:15] [INFO ] Deduced a trap composed of 44 places in 458 ms
[2020-06-04 16:33:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s977 s980 s981 s990 s993 s995 s996 s1003 s1017 s1018 s1019 s1020 s1021 s1022 s1046 s1049 s1066 s1067 s1069 s1070 s1075 s1076 s1077 s1079 s1080 s1082 s1083 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1092 s1096 s1098 s1101 s1125 s1126 s1127 s1128) 0)") while checking expression at index 2
[2020-06-04 16:33:15] [INFO ] [Real]Absence check using 181 positive place invariants in 129 ms returned sat
[2020-06-04 16:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:33:18] [INFO ] [Real]Absence check using state equation in 2533 ms returned sat
[2020-06-04 16:33:19] [INFO ] Deduced a trap composed of 30 places in 572 ms
[2020-06-04 16:33:19] [INFO ] Deduced a trap composed of 23 places in 569 ms
[2020-06-04 16:33:20] [INFO ] Deduced a trap composed of 18 places in 576 ms
[2020-06-04 16:33:20] [INFO ] Deduced a trap composed of 20 places in 539 ms
[2020-06-04 16:33:21] [INFO ] Deduced a trap composed of 57 places in 417 ms
[2020-06-04 16:33:21] [INFO ] Deduced a trap composed of 17 places in 543 ms
[2020-06-04 16:33:22] [INFO ] Deduced a trap composed of 25 places in 549 ms
[2020-06-04 16:33:23] [INFO ] Deduced a trap composed of 20 places in 537 ms
[2020-06-04 16:33:23] [INFO ] Deduced a trap composed of 20 places in 536 ms
[2020-06-04 16:33:24] [INFO ] Deduced a trap composed of 17 places in 540 ms
[2020-06-04 16:33:24] [INFO ] Deduced a trap composed of 27 places in 496 ms
[2020-06-04 16:33:25] [INFO ] Deduced a trap composed of 29 places in 413 ms
[2020-06-04 16:33:25] [INFO ] Deduced a trap composed of 19 places in 530 ms
[2020-06-04 16:33:26] [INFO ] Deduced a trap composed of 15 places in 576 ms
[2020-06-04 16:33:27] [INFO ] Deduced a trap composed of 28 places in 550 ms
[2020-06-04 16:33:27] [INFO ] Deduced a trap composed of 19 places in 524 ms
[2020-06-04 16:33:28] [INFO ] Deduced a trap composed of 19 places in 536 ms
[2020-06-04 16:33:28] [INFO ] Deduced a trap composed of 40 places in 508 ms
[2020-06-04 16:33:29] [INFO ] Deduced a trap composed of 41 places in 504 ms
[2020-06-04 16:33:29] [INFO ] Deduced a trap composed of 33 places in 508 ms
[2020-06-04 16:33:30] [INFO ] Deduced a trap composed of 23 places in 459 ms
[2020-06-04 16:33:30] [INFO ] Deduced a trap composed of 36 places in 399 ms
[2020-06-04 16:33:31] [INFO ] Deduced a trap composed of 39 places in 445 ms
[2020-06-04 16:33:31] [INFO ] Deduced a trap composed of 20 places in 433 ms
[2020-06-04 16:33:32] [INFO ] Deduced a trap composed of 31 places in 422 ms
[2020-06-04 16:33:32] [INFO ] Deduced a trap composed of 21 places in 367 ms
[2020-06-04 16:33:33] [INFO ] Deduced a trap composed of 28 places in 415 ms
[2020-06-04 16:33:33] [INFO ] Deduced a trap composed of 28 places in 392 ms
[2020-06-04 16:33:34] [INFO ] Deduced a trap composed of 27 places in 431 ms
[2020-06-04 16:33:34] [INFO ] Deduced a trap composed of 39 places in 467 ms
[2020-06-04 16:33:35] [INFO ] Deduced a trap composed of 34 places in 461 ms
[2020-06-04 16:33:35] [INFO ] Deduced a trap composed of 34 places in 461 ms
[2020-06-04 16:33:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s318 s319 s320 s321 s322 s329 s330 s331 s332 s333 s342 s344 s348 s349 s350 s351 s395 s396 s397) 0)") while checking expression at index 3
[2020-06-04 16:33:36] [INFO ] Flatten gal took : 135 ms
[2020-06-04 16:33:36] [INFO ] Flatten gal took : 58 ms
[2020-06-04 16:33:36] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-04 16:33:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 10 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ShieldIIPs-PT-020B @ 3570 seconds

FORMULA ShieldIIPs-PT-020B-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-020B-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 16017708 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16074324 kB

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

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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is ShieldIIPs-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477000148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;