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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.480 3600000.00 3640523.00 4020.10 FTFT?F?FF??TFFTF 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-159033477300322.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 ShieldIIPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 3.3K May 14 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 13:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:05 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 338K 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 ShieldIIPt-PT-020B-00
FORMULA_NAME ShieldIIPt-PT-020B-01
FORMULA_NAME ShieldIIPt-PT-020B-02
FORMULA_NAME ShieldIIPt-PT-020B-03
FORMULA_NAME ShieldIIPt-PT-020B-04
FORMULA_NAME ShieldIIPt-PT-020B-05
FORMULA_NAME ShieldIIPt-PT-020B-06
FORMULA_NAME ShieldIIPt-PT-020B-07
FORMULA_NAME ShieldIIPt-PT-020B-08
FORMULA_NAME ShieldIIPt-PT-020B-09
FORMULA_NAME ShieldIIPt-PT-020B-10
FORMULA_NAME ShieldIIPt-PT-020B-11
FORMULA_NAME ShieldIIPt-PT-020B-12
FORMULA_NAME ShieldIIPt-PT-020B-13
FORMULA_NAME ShieldIIPt-PT-020B-14
FORMULA_NAME ShieldIIPt-PT-020B-15

=== Now, execution of the tool begins

BK_START 1591298952791

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:29:14] [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, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:29:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:29:14] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2020-06-04 19:29:14] [INFO ] Transformed 1403 places.
[2020-06-04 19:29:14] [INFO ] Transformed 1303 transitions.
[2020-06-04 19:29:14] [INFO ] Found NUPN structural information;
[2020-06-04 19:29:14] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 425 ms. (steps per millisecond=235 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 1303 rows 1403 cols
[2020-06-04 19:29:15] [INFO ] Computed 181 place invariants in 53 ms
[2020-06-04 19:29:15] [INFO ] [Real]Absence check using 181 positive place invariants in 198 ms returned sat
[2020-06-04 19:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:18] [INFO ] [Real]Absence check using state equation in 3406 ms returned sat
[2020-06-04 19:29:19] [INFO ] Deduced a trap composed of 15 places in 749 ms
[2020-06-04 19:29:20] [INFO ] Deduced a trap composed of 12 places in 530 ms
[2020-06-04 19:29:21] [INFO ] Deduced a trap composed of 18 places in 521 ms
[2020-06-04 19:29:21] [INFO ] Deduced a trap composed of 24 places in 570 ms
[2020-06-04 19:29:22] [INFO ] Deduced a trap composed of 20 places in 536 ms
[2020-06-04 19:29:22] [INFO ] Deduced a trap composed of 21 places in 521 ms
[2020-06-04 19:29:23] [INFO ] Deduced a trap composed of 24 places in 519 ms
[2020-06-04 19:29:23] [INFO ] Deduced a trap composed of 21 places in 481 ms
[2020-06-04 19:29:24] [INFO ] Deduced a trap composed of 30 places in 749 ms
[2020-06-04 19:29:25] [INFO ] Deduced a trap composed of 20 places in 398 ms
[2020-06-04 19:29:25] [INFO ] Deduced a trap composed of 24 places in 391 ms
[2020-06-04 19:29:26] [INFO ] Deduced a trap composed of 25 places in 446 ms
[2020-06-04 19:29:26] [INFO ] Deduced a trap composed of 19 places in 465 ms
[2020-06-04 19:29:27] [INFO ] Deduced a trap composed of 22 places in 445 ms
[2020-06-04 19:29:27] [INFO ] Deduced a trap composed of 28 places in 532 ms
[2020-06-04 19:29:28] [INFO ] Deduced a trap composed of 29 places in 497 ms
[2020-06-04 19:29:28] [INFO ] Deduced a trap composed of 22 places in 487 ms
[2020-06-04 19:29:29] [INFO ] Deduced a trap composed of 42 places in 445 ms
[2020-06-04 19:29:29] [INFO ] Deduced a trap composed of 28 places in 399 ms
[2020-06-04 19:29:30] [INFO ] Deduced a trap composed of 35 places in 403 ms
[2020-06-04 19:29:30] [INFO ] Deduced a trap composed of 24 places in 412 ms
[2020-06-04 19:29:31] [INFO ] Deduced a trap composed of 23 places in 404 ms
[2020-06-04 19:29:31] [INFO ] Deduced a trap composed of 22 places in 435 ms
[2020-06-04 19:29:32] [INFO ] Deduced a trap composed of 65 places in 441 ms
[2020-06-04 19:29:32] [INFO ] Deduced a trap composed of 31 places in 411 ms
[2020-06-04 19:29:33] [INFO ] Deduced a trap composed of 32 places in 473 ms
[2020-06-04 19:29:33] [INFO ] Deduced a trap composed of 22 places in 454 ms
[2020-06-04 19:29:34] [INFO ] Deduced a trap composed of 33 places in 438 ms
[2020-06-04 19:29:34] [INFO ] Deduced a trap composed of 35 places in 427 ms
[2020-06-04 19:29:35] [INFO ] Deduced a trap composed of 32 places in 420 ms
[2020-06-04 19:29: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 s989 s990 s991 s992 s993 s1013 s1014 s1015 s1017 s1018 s1019 s1020 s1021 s1022 s1023 s1024 s1078 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125) 0)") while checking expression at index 0
[2020-06-04 19:29:35] [INFO ] [Real]Absence check using 181 positive place invariants in 186 ms returned sat
[2020-06-04 19:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:38] [INFO ] [Real]Absence check using state equation in 3261 ms returned sat
[2020-06-04 19:29:39] [INFO ] Deduced a trap composed of 31 places in 534 ms
[2020-06-04 19:29:39] [INFO ] Deduced a trap composed of 25 places in 470 ms
[2020-06-04 19:29:40] [INFO ] Deduced a trap composed of 34 places in 478 ms
[2020-06-04 19:29:40] [INFO ] Deduced a trap composed of 23 places in 497 ms
[2020-06-04 19:29:41] [INFO ] Deduced a trap composed of 25 places in 544 ms
[2020-06-04 19:29:42] [INFO ] Deduced a trap composed of 25 places in 515 ms
[2020-06-04 19:29:42] [INFO ] Deduced a trap composed of 21 places in 388 ms
[2020-06-04 19:29:42] [INFO ] Deduced a trap composed of 22 places in 419 ms
[2020-06-04 19:29:43] [INFO ] Deduced a trap composed of 18 places in 376 ms
[2020-06-04 19:29:43] [INFO ] Deduced a trap composed of 17 places in 381 ms
[2020-06-04 19:29:44] [INFO ] Deduced a trap composed of 21 places in 461 ms
[2020-06-04 19:29:44] [INFO ] Deduced a trap composed of 25 places in 357 ms
[2020-06-04 19:29:45] [INFO ] Deduced a trap composed of 31 places in 329 ms
[2020-06-04 19:29:45] [INFO ] Deduced a trap composed of 28 places in 338 ms
[2020-06-04 19:29:45] [INFO ] Deduced a trap composed of 30 places in 410 ms
[2020-06-04 19:29:46] [INFO ] Deduced a trap composed of 35 places in 459 ms
[2020-06-04 19:29:46] [INFO ] Deduced a trap composed of 31 places in 477 ms
[2020-06-04 19:29:47] [INFO ] Deduced a trap composed of 29 places in 452 ms
[2020-06-04 19:29:47] [INFO ] Deduced a trap composed of 28 places in 399 ms
[2020-06-04 19:29:48] [INFO ] Deduced a trap composed of 35 places in 321 ms
[2020-06-04 19:29:48] [INFO ] Deduced a trap composed of 31 places in 326 ms
[2020-06-04 19:29:48] [INFO ] Deduced a trap composed of 25 places in 374 ms
[2020-06-04 19:29:49] [INFO ] Deduced a trap composed of 37 places in 317 ms
[2020-06-04 19:29:49] [INFO ] Deduced a trap composed of 35 places in 304 ms
[2020-06-04 19:29:50] [INFO ] Deduced a trap composed of 31 places in 344 ms
[2020-06-04 19:29:50] [INFO ] Deduced a trap composed of 33 places in 386 ms
[2020-06-04 19:29:50] [INFO ] Deduced a trap composed of 24 places in 354 ms
[2020-06-04 19:29:51] [INFO ] Deduced a trap composed of 39 places in 333 ms
[2020-06-04 19:29:51] [INFO ] Deduced a trap composed of 32 places in 359 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 32 places in 277 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 33 places in 235 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 34 places in 251 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 34 places in 294 ms
[2020-06-04 19:29:53] [INFO ] Deduced a trap composed of 44 places in 300 ms
[2020-06-04 19:29:53] [INFO ] Deduced a trap composed of 35 places in 313 ms
[2020-06-04 19:29:53] [INFO ] Deduced a trap composed of 35 places in 283 ms
[2020-06-04 19:29:54] [INFO ] Deduced a trap composed of 31 places in 291 ms
[2020-06-04 19:29:54] [INFO ] Deduced a trap composed of 43 places in 299 ms
[2020-06-04 19:29:54] [INFO ] Deduced a trap composed of 35 places in 298 ms
[2020-06-04 19:29:55] [INFO ] Deduced a trap composed of 42 places in 321 ms
[2020-06-04 19:29: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 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s33 s34 s35 s40 s60 s61 s62 s63 s64 s65 s66 s72 s78 s82 s83 s85 s86 s87 s88 s89 s90) 0)") while checking expression at index 1
[2020-06-04 19:29:55] [INFO ] [Real]Absence check using 181 positive place invariants in 143 ms returned sat
[2020-06-04 19:29:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:58] [INFO ] [Real]Absence check using state equation in 3296 ms returned sat
[2020-06-04 19:29:59] [INFO ] Deduced a trap composed of 39 places in 676 ms
[2020-06-04 19:30:00] [INFO ] Deduced a trap composed of 23 places in 540 ms
[2020-06-04 19:30:00] [INFO ] Deduced a trap composed of 38 places in 494 ms
[2020-06-04 19:30:01] [INFO ] Deduced a trap composed of 18 places in 587 ms
[2020-06-04 19:30:02] [INFO ] Deduced a trap composed of 22 places in 669 ms
[2020-06-04 19:30:02] [INFO ] Deduced a trap composed of 25 places in 517 ms
[2020-06-04 19:30:03] [INFO ] Deduced a trap composed of 19 places in 585 ms
[2020-06-04 19:30:04] [INFO ] Deduced a trap composed of 26 places in 601 ms
[2020-06-04 19:30:04] [INFO ] Deduced a trap composed of 26 places in 608 ms
[2020-06-04 19:30:05] [INFO ] Deduced a trap composed of 31 places in 463 ms
[2020-06-04 19:30:05] [INFO ] Deduced a trap composed of 20 places in 449 ms
[2020-06-04 19:30:06] [INFO ] Deduced a trap composed of 24 places in 500 ms
[2020-06-04 19:30:06] [INFO ] Deduced a trap composed of 33 places in 413 ms
[2020-06-04 19:30:07] [INFO ] Deduced a trap composed of 25 places in 396 ms
[2020-06-04 19:30:07] [INFO ] Deduced a trap composed of 25 places in 425 ms
[2020-06-04 19:30:08] [INFO ] Deduced a trap composed of 29 places in 525 ms
[2020-06-04 19:30:08] [INFO ] Deduced a trap composed of 30 places in 401 ms
[2020-06-04 19:30:09] [INFO ] Deduced a trap composed of 37 places in 400 ms
[2020-06-04 19:30:09] [INFO ] Deduced a trap composed of 31 places in 530 ms
[2020-06-04 19:30:10] [INFO ] Deduced a trap composed of 24 places in 429 ms
[2020-06-04 19:30:10] [INFO ] Deduced a trap composed of 34 places in 401 ms
[2020-06-04 19:30:10] [INFO ] Deduced a trap composed of 34 places in 334 ms
[2020-06-04 19:30:11] [INFO ] Deduced a trap composed of 32 places in 357 ms
[2020-06-04 19:30:11] [INFO ] Deduced a trap composed of 20 places in 355 ms
[2020-06-04 19:30:12] [INFO ] Deduced a trap composed of 39 places in 434 ms
[2020-06-04 19:30:12] [INFO ] Deduced a trap composed of 28 places in 406 ms
[2020-06-04 19:30:13] [INFO ] Deduced a trap composed of 26 places in 458 ms
[2020-06-04 19:30:13] [INFO ] Deduced a trap composed of 35 places in 443 ms
[2020-06-04 19:30:14] [INFO ] Deduced a trap composed of 27 places in 355 ms
[2020-06-04 19:30:14] [INFO ] Deduced a trap composed of 30 places in 410 ms
[2020-06-04 19:30:15] [INFO ] Deduced a trap composed of 30 places in 429 ms
[2020-06-04 19:30:15] [INFO ] Deduced a trap composed of 35 places in 382 ms
[2020-06-04 19:30: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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s161 s162 s163 s164 s165 s166 s182 s184 s220 s221 s222 s223 s224 s225 s226 s227 s228) 0)") while checking expression at index 2
[2020-06-04 19:30:15] [INFO ] [Real]Absence check using 181 positive place invariants in 142 ms returned sat
[2020-06-04 19:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:19] [INFO ] [Real]Absence check using state equation in 3315 ms returned sat
[2020-06-04 19:30:19] [INFO ] Deduced a trap composed of 37 places in 634 ms
[2020-06-04 19:30:20] [INFO ] Deduced a trap composed of 25 places in 616 ms
[2020-06-04 19:30:20] [INFO ] Deduced a trap composed of 22 places in 513 ms
[2020-06-04 19:30:21] [INFO ] Deduced a trap composed of 43 places in 508 ms
[2020-06-04 19:30:22] [INFO ] Deduced a trap composed of 30 places in 496 ms
[2020-06-04 19:30:22] [INFO ] Deduced a trap composed of 24 places in 426 ms
[2020-06-04 19:30:23] [INFO ] Deduced a trap composed of 20 places in 548 ms
[2020-06-04 19:30:23] [INFO ] Deduced a trap composed of 37 places in 447 ms
[2020-06-04 19:30:24] [INFO ] Deduced a trap composed of 31 places in 392 ms
[2020-06-04 19:30:24] [INFO ] Deduced a trap composed of 34 places in 490 ms
[2020-06-04 19:30:25] [INFO ] Deduced a trap composed of 38 places in 565 ms
[2020-06-04 19:30:25] [INFO ] Deduced a trap composed of 26 places in 510 ms
[2020-06-04 19:30:26] [INFO ] Deduced a trap composed of 28 places in 512 ms
[2020-06-04 19:30:26] [INFO ] Deduced a trap composed of 39 places in 388 ms
[2020-06-04 19:30:27] [INFO ] Deduced a trap composed of 32 places in 471 ms
[2020-06-04 19:30:27] [INFO ] Deduced a trap composed of 40 places in 337 ms
[2020-06-04 19:30:28] [INFO ] Deduced a trap composed of 34 places in 414 ms
[2020-06-04 19:30:28] [INFO ] Deduced a trap composed of 38 places in 358 ms
[2020-06-04 19:30:29] [INFO ] Deduced a trap composed of 42 places in 470 ms
[2020-06-04 19:30:29] [INFO ] Deduced a trap composed of 43 places in 371 ms
[2020-06-04 19:30:29] [INFO ] Deduced a trap composed of 31 places in 461 ms
[2020-06-04 19:30:30] [INFO ] Deduced a trap composed of 35 places in 374 ms
[2020-06-04 19:30:30] [INFO ] Deduced a trap composed of 48 places in 421 ms
[2020-06-04 19:30:31] [INFO ] Deduced a trap composed of 33 places in 366 ms
[2020-06-04 19:30:31] [INFO ] Deduced a trap composed of 43 places in 393 ms
[2020-06-04 19:30:32] [INFO ] Deduced a trap composed of 33 places in 415 ms
[2020-06-04 19:30:32] [INFO ] Deduced a trap composed of 35 places in 407 ms
[2020-06-04 19:30:33] [INFO ] Deduced a trap composed of 35 places in 376 ms
[2020-06-04 19:30:33] [INFO ] Deduced a trap composed of 30 places in 384 ms
[2020-06-04 19:30:33] [INFO ] Deduced a trap composed of 34 places in 360 ms
[2020-06-04 19:30:34] [INFO ] Deduced a trap composed of 36 places in 334 ms
[2020-06-04 19:30:34] [INFO ] Deduced a trap composed of 38 places in 305 ms
[2020-06-04 19:30:34] [INFO ] Deduced a trap composed of 34 places in 262 ms
[2020-06-04 19:30:34] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 15862 ms
[2020-06-04 19:30:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:30:35] [INFO ] [Nat]Absence check using 181 positive place invariants in 373 ms returned sat
[2020-06-04 19:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:38] [INFO ] [Nat]Absence check using state equation in 3131 ms returned sat
[2020-06-04 19:30:39] [INFO ] Deduced a trap composed of 27 places in 499 ms
[2020-06-04 19:30:39] [INFO ] Deduced a trap composed of 22 places in 607 ms
[2020-06-04 19:30:40] [INFO ] Deduced a trap composed of 20 places in 662 ms
[2020-06-04 19:30:41] [INFO ] Deduced a trap composed of 25 places in 659 ms
[2020-06-04 19:30:42] [INFO ] Deduced a trap composed of 28 places in 664 ms
[2020-06-04 19:30:42] [INFO ] Deduced a trap composed of 27 places in 536 ms
[2020-06-04 19:30:43] [INFO ] Deduced a trap composed of 32 places in 621 ms
[2020-06-04 19:30:43] [INFO ] Deduced a trap composed of 25 places in 504 ms
[2020-06-04 19:30:44] [INFO ] Deduced a trap composed of 29 places in 470 ms
[2020-06-04 19:30:44] [INFO ] Deduced a trap composed of 33 places in 470 ms
[2020-06-04 19:30:45] [INFO ] Deduced a trap composed of 29 places in 439 ms
[2020-06-04 19:30:45] [INFO ] Deduced a trap composed of 31 places in 494 ms
[2020-06-04 19:30:46] [INFO ] Deduced a trap composed of 25 places in 507 ms
[2020-06-04 19:30:47] [INFO ] Deduced a trap composed of 35 places in 568 ms
[2020-06-04 19:30:47] [INFO ] Deduced a trap composed of 32 places in 466 ms
[2020-06-04 19:30:48] [INFO ] Deduced a trap composed of 34 places in 527 ms
[2020-06-04 19:30:48] [INFO ] Deduced a trap composed of 32 places in 443 ms
[2020-06-04 19:30:49] [INFO ] Deduced a trap composed of 34 places in 485 ms
[2020-06-04 19:30:49] [INFO ] Deduced a trap composed of 29 places in 527 ms
[2020-06-04 19:30:50] [INFO ] Deduced a trap composed of 25 places in 479 ms
[2020-06-04 19:30:50] [INFO ] Deduced a trap composed of 41 places in 379 ms
[2020-06-04 19:30:51] [INFO ] Deduced a trap composed of 37 places in 374 ms
[2020-06-04 19:30:51] [INFO ] Deduced a trap composed of 33 places in 379 ms
[2020-06-04 19:30:51] [INFO ] Deduced a trap composed of 35 places in 387 ms
[2020-06-04 19:30:52] [INFO ] Deduced a trap composed of 33 places in 356 ms
[2020-06-04 19:30:52] [INFO ] Deduced a trap composed of 28 places in 425 ms
[2020-06-04 19:30:53] [INFO ] Deduced a trap composed of 30 places in 320 ms
[2020-06-04 19:30:53] [INFO ] Deduced a trap composed of 36 places in 321 ms
[2020-06-04 19:30:53] [INFO ] Deduced a trap composed of 41 places in 393 ms
[2020-06-04 19:30:54] [INFO ] Deduced a trap composed of 31 places in 296 ms
[2020-06-04 19:30:54] [INFO ] Deduced a trap composed of 35 places in 310 ms
[2020-06-04 19:30:54] [INFO ] Deduced a trap composed of 32 places in 302 ms
[2020-06-04 19:30:55] [INFO ] Deduced a trap composed of 35 places in 278 ms
[2020-06-04 19:30: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 s11 s12 s13 s14 s15 s16 s17 s161 s162 s163 s164 s165 s166 s182 s184 s220 s221 s222 s223 s224 s225 s226 s227 s228) 0)") while checking expression at index 3
[2020-06-04 19:30:55] [INFO ] [Real]Absence check using 181 positive place invariants in 133 ms returned sat
[2020-06-04 19:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:58] [INFO ] [Real]Absence check using state equation in 3163 ms returned sat
[2020-06-04 19:30:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:30:59] [INFO ] [Nat]Absence check using 181 positive place invariants in 202 ms returned sat
[2020-06-04 19:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:02] [INFO ] [Nat]Absence check using state equation in 3193 ms returned sat
[2020-06-04 19:31:03] [INFO ] Deduced a trap composed of 19 places in 695 ms
[2020-06-04 19:31:03] [INFO ] Deduced a trap composed of 24 places in 654 ms
[2020-06-04 19:31:04] [INFO ] Deduced a trap composed of 24 places in 637 ms
[2020-06-04 19:31:05] [INFO ] Deduced a trap composed of 18 places in 567 ms
[2020-06-04 19:31:05] [INFO ] Deduced a trap composed of 24 places in 654 ms
[2020-06-04 19:31:06] [INFO ] Deduced a trap composed of 25 places in 506 ms
[2020-06-04 19:31:06] [INFO ] Deduced a trap composed of 31 places in 482 ms
[2020-06-04 19:31:07] [INFO ] Deduced a trap composed of 20 places in 539 ms
[2020-06-04 19:31:07] [INFO ] Deduced a trap composed of 22 places in 554 ms
[2020-06-04 19:31:08] [INFO ] Deduced a trap composed of 40 places in 509 ms
[2020-06-04 19:31:09] [INFO ] Deduced a trap composed of 31 places in 508 ms
[2020-06-04 19:31:09] [INFO ] Deduced a trap composed of 32 places in 611 ms
[2020-06-04 19:31:10] [INFO ] Deduced a trap composed of 32 places in 577 ms
[2020-06-04 19:31:10] [INFO ] Deduced a trap composed of 23 places in 541 ms
[2020-06-04 19:31:11] [INFO ] Deduced a trap composed of 20 places in 507 ms
[2020-06-04 19:31:12] [INFO ] Deduced a trap composed of 32 places in 512 ms
[2020-06-04 19:31:12] [INFO ] Deduced a trap composed of 23 places in 468 ms
[2020-06-04 19:31:13] [INFO ] Deduced a trap composed of 24 places in 466 ms
[2020-06-04 19:31:13] [INFO ] Deduced a trap composed of 23 places in 472 ms
[2020-06-04 19:31:14] [INFO ] Deduced a trap composed of 26 places in 522 ms
[2020-06-04 19:31:14] [INFO ] Deduced a trap composed of 22 places in 399 ms
[2020-06-04 19:31:15] [INFO ] Deduced a trap composed of 25 places in 443 ms
[2020-06-04 19:31:15] [INFO ] Deduced a trap composed of 32 places in 393 ms
[2020-06-04 19:31:15] [INFO ] Deduced a trap composed of 32 places in 420 ms
[2020-06-04 19:31:16] [INFO ] Deduced a trap composed of 42 places in 471 ms
[2020-06-04 19:31:16] [INFO ] Deduced a trap composed of 30 places in 396 ms
[2020-06-04 19:31:17] [INFO ] Deduced a trap composed of 30 places in 363 ms
[2020-06-04 19:31:17] [INFO ] Deduced a trap composed of 23 places in 433 ms
[2020-06-04 19:31:18] [INFO ] Deduced a trap composed of 36 places in 462 ms
[2020-06-04 19:31:18] [INFO ] Deduced a trap composed of 24 places in 327 ms
[2020-06-04 19:31:19] [INFO ] Deduced a trap composed of 30 places in 405 ms
[2020-06-04 19:31:19] [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 s931 s932 s933 s934 s935 s947 s953 s979 s980 s981 s982 s983 s984 s985 s986 s987 s989 s990 s991 s992 s993 s994 s995 s1007) 0)") while checking expression at index 4
[2020-06-04 19:31:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 19:31:19] [INFO ] Flatten gal took : 118 ms
FORMULA ShieldIIPt-PT-020B-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:31:19] [INFO ] Applying decomposition
[2020-06-04 19:31:19] [INFO ] Flatten gal took : 51 ms
[2020-06-04 19:31:19] [INFO ] Decomposing Gal with order
[2020-06-04 19:31:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:31:19] [INFO ] Flatten gal took : 123 ms
[2020-06-04 19:31:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2020-06-04 19:31:19] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-04 19:31:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldIIPt-PT-020B @ 3570 seconds

FORMULA ShieldIIPt-PT-020B-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPt-PT-020B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-020B-08 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: 9140740 kB
After kill :
MemTotal: 16427456 kB
MemFree: 9144788 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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="LTLFireability"
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 ShieldIIPt-PT-020B, 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 r211-tajo-159033477300322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B 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 ;