fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477300321
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
15741.710 3600000.00 3652680.00 4012.50 FFF?TTFTFTFT?FFF 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-159033477300321.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477300321
=====================================================================

--------------------
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 1591298946850

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 19:29:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 19:29:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 19:29:08] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2020-06-04 19:29:08] [INFO ] Transformed 1403 places.
[2020-06-04 19:29:08] [INFO ] Transformed 1303 transitions.
[2020-06-04 19:29:08] [INFO ] Found NUPN structural information;
[2020-06-04 19:29:08] [INFO ] Parsed PT model containing 1403 places and 1303 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 461 ms. (steps per millisecond=216 ) properties seen :[0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 1303 rows 1403 cols
[2020-06-04 19:29:09] [INFO ] Computed 181 place invariants in 48 ms
[2020-06-04 19:29:09] [INFO ] [Real]Absence check using 181 positive place invariants in 227 ms returned sat
[2020-06-04 19:29:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:13] [INFO ] [Real]Absence check using state equation in 3343 ms returned sat
[2020-06-04 19:29:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:29:13] [INFO ] [Nat]Absence check using 181 positive place invariants in 242 ms returned sat
[2020-06-04 19:29:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:17] [INFO ] [Nat]Absence check using state equation in 3529 ms returned sat
[2020-06-04 19:29:18] [INFO ] Deduced a trap composed of 18 places in 782 ms
[2020-06-04 19:29:18] [INFO ] Deduced a trap composed of 18 places in 748 ms
[2020-06-04 19:29:19] [INFO ] Deduced a trap composed of 23 places in 871 ms
[2020-06-04 19:29:20] [INFO ] Deduced a trap composed of 25 places in 771 ms
[2020-06-04 19:29:21] [INFO ] Deduced a trap composed of 19 places in 669 ms
[2020-06-04 19:29:23] [INFO ] Deduced a trap composed of 31 places in 2359 ms
[2020-06-04 19:29:25] [INFO ] Deduced a trap composed of 19 places in 1512 ms
[2020-06-04 19:29:26] [INFO ] Deduced a trap composed of 23 places in 796 ms
[2020-06-04 19:29:26] [INFO ] Deduced a trap composed of 24 places in 639 ms
[2020-06-04 19:29:27] [INFO ] Deduced a trap composed of 26 places in 670 ms
[2020-06-04 19:29:28] [INFO ] Deduced a trap composed of 12 places in 616 ms
[2020-06-04 19:29:29] [INFO ] Deduced a trap composed of 32 places in 595 ms
[2020-06-04 19:29:29] [INFO ] Deduced a trap composed of 21 places in 592 ms
[2020-06-04 19:29:30] [INFO ] Deduced a trap composed of 30 places in 598 ms
[2020-06-04 19:29:31] [INFO ] Deduced a trap composed of 27 places in 565 ms
[2020-06-04 19:29:31] [INFO ] Deduced a trap composed of 33 places in 501 ms
[2020-06-04 19:29:32] [INFO ] Deduced a trap composed of 35 places in 489 ms
[2020-06-04 19:29:32] [INFO ] Deduced a trap composed of 20 places in 435 ms
[2020-06-04 19:29:33] [INFO ] Deduced a trap composed of 34 places in 518 ms
[2020-06-04 19:29:33] [INFO ] Deduced a trap composed of 30 places in 535 ms
[2020-06-04 19:29:33] [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 s437 s438 s439 s440 s441 s442 s458 s553 s554 s555 s556 s557 s558 s559 s560 s561) 0)") while checking expression at index 0
[2020-06-04 19:29:34] [INFO ] [Real]Absence check using 181 positive place invariants in 209 ms returned sat
[2020-06-04 19:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:37] [INFO ] [Real]Absence check using state equation in 3443 ms returned sat
[2020-06-04 19:29:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:29:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 318 ms returned sat
[2020-06-04 19:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:29:42] [INFO ] [Nat]Absence check using state equation in 3737 ms returned sat
[2020-06-04 19:29:42] [INFO ] Deduced a trap composed of 22 places in 522 ms
[2020-06-04 19:29:43] [INFO ] Deduced a trap composed of 23 places in 659 ms
[2020-06-04 19:29:43] [INFO ] Deduced a trap composed of 18 places in 588 ms
[2020-06-04 19:29:44] [INFO ] Deduced a trap composed of 12 places in 495 ms
[2020-06-04 19:29:44] [INFO ] Deduced a trap composed of 15 places in 464 ms
[2020-06-04 19:29:45] [INFO ] Deduced a trap composed of 22 places in 472 ms
[2020-06-04 19:29:47] [INFO ] Deduced a trap composed of 20 places in 1909 ms
[2020-06-04 19:29:48] [INFO ] Deduced a trap composed of 19 places in 520 ms
[2020-06-04 19:29:48] [INFO ] Deduced a trap composed of 21 places in 618 ms
[2020-06-04 19:29:49] [INFO ] Deduced a trap composed of 24 places in 627 ms
[2020-06-04 19:29:50] [INFO ] Deduced a trap composed of 28 places in 617 ms
[2020-06-04 19:29:50] [INFO ] Deduced a trap composed of 18 places in 612 ms
[2020-06-04 19:29:51] [INFO ] Deduced a trap composed of 20 places in 586 ms
[2020-06-04 19:29:51] [INFO ] Deduced a trap composed of 19 places in 435 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 25 places in 428 ms
[2020-06-04 19:29:52] [INFO ] Deduced a trap composed of 22 places in 462 ms
[2020-06-04 19:29:53] [INFO ] Deduced a trap composed of 22 places in 444 ms
[2020-06-04 19:29:53] [INFO ] Deduced a trap composed of 21 places in 513 ms
[2020-06-04 19:29:54] [INFO ] Deduced a trap composed of 25 places in 473 ms
[2020-06-04 19:29:54] [INFO ] Deduced a trap composed of 20 places in 462 ms
[2020-06-04 19:29:55] [INFO ] Deduced a trap composed of 32 places in 539 ms
[2020-06-04 19:29:56] [INFO ] Deduced a trap composed of 18 places in 549 ms
[2020-06-04 19:29:56] [INFO ] Deduced a trap composed of 31 places in 526 ms
[2020-06-04 19:29:57] [INFO ] Deduced a trap composed of 29 places in 429 ms
[2020-06-04 19:29:57] [INFO ] Deduced a trap composed of 34 places in 436 ms
[2020-06-04 19:29:57] [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 s230 s231 s232 s233 s234 s235 s236 s237 s238 s240 s267 s268 s269 s270 s271 s272 s273) 0)") while checking expression at index 1
[2020-06-04 19:29:58] [INFO ] [Real]Absence check using 181 positive place invariants in 193 ms returned sat
[2020-06-04 19:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:01] [INFO ] [Real]Absence check using state equation in 3461 ms returned sat
[2020-06-04 19:30:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:30:02] [INFO ] [Nat]Absence check using 181 positive place invariants in 284 ms returned sat
[2020-06-04 19:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:05] [INFO ] [Nat]Absence check using state equation in 3225 ms returned sat
[2020-06-04 19:30:06] [INFO ] Deduced a trap composed of 29 places in 722 ms
[2020-06-04 19:30:06] [INFO ] Deduced a trap composed of 22 places in 685 ms
[2020-06-04 19:30:07] [INFO ] Deduced a trap composed of 19 places in 642 ms
[2020-06-04 19:30:08] [INFO ] Deduced a trap composed of 24 places in 642 ms
[2020-06-04 19:30:09] [INFO ] Deduced a trap composed of 25 places in 645 ms
[2020-06-04 19:30:09] [INFO ] Deduced a trap composed of 21 places in 629 ms
[2020-06-04 19:30:10] [INFO ] Deduced a trap composed of 20 places in 631 ms
[2020-06-04 19:30:11] [INFO ] Deduced a trap composed of 24 places in 617 ms
[2020-06-04 19:30:11] [INFO ] Deduced a trap composed of 35 places in 598 ms
[2020-06-04 19:30:12] [INFO ] Deduced a trap composed of 32 places in 590 ms
[2020-06-04 19:30:12] [INFO ] Deduced a trap composed of 32 places in 533 ms
[2020-06-04 19:30:13] [INFO ] Deduced a trap composed of 20 places in 547 ms
[2020-06-04 19:30:14] [INFO ] Deduced a trap composed of 19 places in 511 ms
[2020-06-04 19:30:14] [INFO ] Deduced a trap composed of 18 places in 448 ms
[2020-06-04 19:30:15] [INFO ] Deduced a trap composed of 20 places in 388 ms
[2020-06-04 19:30:15] [INFO ] Deduced a trap composed of 30 places in 416 ms
[2020-06-04 19:30:16] [INFO ] Deduced a trap composed of 34 places in 416 ms
[2020-06-04 19:30:16] [INFO ] Deduced a trap composed of 30 places in 464 ms
[2020-06-04 19:30:17] [INFO ] Deduced a trap composed of 31 places in 455 ms
[2020-06-04 19:30:17] [INFO ] Deduced a trap composed of 21 places in 454 ms
[2020-06-04 19:30:18] [INFO ] Deduced a trap composed of 26 places in 439 ms
[2020-06-04 19:30:18] [INFO ] Deduced a trap composed of 38 places in 539 ms
[2020-06-04 19:30:19] [INFO ] Deduced a trap composed of 31 places in 453 ms
[2020-06-04 19:30:19] [INFO ] Deduced a trap composed of 37 places in 369 ms
[2020-06-04 19:30:20] [INFO ] Deduced a trap composed of 42 places in 396 ms
[2020-06-04 19:30:20] [INFO ] Deduced a trap composed of 18 places in 343 ms
[2020-06-04 19:30:20] [INFO ] Deduced a trap composed of 22 places in 351 ms
[2020-06-04 19:30:21] [INFO ] Deduced a trap composed of 24 places in 378 ms
[2020-06-04 19:30:21] [INFO ] Deduced a trap composed of 25 places in 389 ms
[2020-06-04 19:30:21] [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 s851 s852 s853 s854 s855 s862 s863 s864 s865 s866 s869 s870 s871 s875 s884 s885 s886) 0)") while checking expression at index 2
[2020-06-04 19:30:22] [INFO ] [Real]Absence check using 181 positive place invariants in 200 ms returned sat
[2020-06-04 19:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:25] [INFO ] [Real]Absence check using state equation in 3485 ms returned sat
[2020-06-04 19:30:26] [INFO ] Deduced a trap composed of 22 places in 708 ms
[2020-06-04 19:30:27] [INFO ] Deduced a trap composed of 27 places in 526 ms
[2020-06-04 19:30:27] [INFO ] Deduced a trap composed of 32 places in 586 ms
[2020-06-04 19:30:28] [INFO ] Deduced a trap composed of 24 places in 644 ms
[2020-06-04 19:30:29] [INFO ] Deduced a trap composed of 24 places in 634 ms
[2020-06-04 19:30:29] [INFO ] Deduced a trap composed of 24 places in 491 ms
[2020-06-04 19:30:30] [INFO ] Deduced a trap composed of 19 places in 521 ms
[2020-06-04 19:30:30] [INFO ] Deduced a trap composed of 23 places in 463 ms
[2020-06-04 19:30:31] [INFO ] Deduced a trap composed of 23 places in 496 ms
[2020-06-04 19:30:31] [INFO ] Deduced a trap composed of 35 places in 441 ms
[2020-06-04 19:30:32] [INFO ] Deduced a trap composed of 30 places in 482 ms
[2020-06-04 19:30:32] [INFO ] Deduced a trap composed of 32 places in 405 ms
[2020-06-04 19:30:33] [INFO ] Deduced a trap composed of 30 places in 439 ms
[2020-06-04 19:30:33] [INFO ] Deduced a trap composed of 22 places in 394 ms
[2020-06-04 19:30:34] [INFO ] Deduced a trap composed of 28 places in 418 ms
[2020-06-04 19:30:34] [INFO ] Deduced a trap composed of 33 places in 453 ms
[2020-06-04 19:30:35] [INFO ] Deduced a trap composed of 30 places in 520 ms
[2020-06-04 19:30:35] [INFO ] Deduced a trap composed of 39 places in 563 ms
[2020-06-04 19:30:36] [INFO ] Deduced a trap composed of 27 places in 537 ms
[2020-06-04 19:30:37] [INFO ] Deduced a trap composed of 31 places in 500 ms
[2020-06-04 19:30:37] [INFO ] Deduced a trap composed of 34 places in 480 ms
[2020-06-04 19:30:38] [INFO ] Deduced a trap composed of 24 places in 518 ms
[2020-06-04 19:30:38] [INFO ] Deduced a trap composed of 35 places in 525 ms
[2020-06-04 19:30:39] [INFO ] Deduced a trap composed of 35 places in 520 ms
[2020-06-04 19:30:39] [INFO ] Deduced a trap composed of 32 places in 467 ms
[2020-06-04 19:30:40] [INFO ] Deduced a trap composed of 30 places in 415 ms
[2020-06-04 19:30:40] [INFO ] Deduced a trap composed of 32 places in 438 ms
[2020-06-04 19:30:41] [INFO ] Deduced a trap composed of 34 places in 787 ms
[2020-06-04 19:30:41] [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 s299 s300 s301 s302 s303 s304 s305 s306 s307 s358 s359 s360 s361 s362 s363 s364 s365 s366) 0)") while checking expression at index 3
[2020-06-04 19:30:42] [INFO ] [Real]Absence check using 181 positive place invariants in 180 ms returned sat
[2020-06-04 19:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:46] [INFO ] [Real]Absence check using state equation in 3961 ms returned sat
[2020-06-04 19:30:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:30:46] [INFO ] [Nat]Absence check using 181 positive place invariants in 225 ms returned sat
[2020-06-04 19:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:30:49] [INFO ] [Nat]Absence check using state equation in 3375 ms returned sat
[2020-06-04 19:30:50] [INFO ] Deduced a trap composed of 34 places in 661 ms
[2020-06-04 19:30:51] [INFO ] Deduced a trap composed of 30 places in 687 ms
[2020-06-04 19:30:51] [INFO ] Deduced a trap composed of 21 places in 504 ms
[2020-06-04 19:30:52] [INFO ] Deduced a trap composed of 28 places in 621 ms
[2020-06-04 19:30:53] [INFO ] Deduced a trap composed of 32 places in 504 ms
[2020-06-04 19:30:53] [INFO ] Deduced a trap composed of 23 places in 478 ms
[2020-06-04 19:30:54] [INFO ] Deduced a trap composed of 24 places in 650 ms
[2020-06-04 19:30:54] [INFO ] Deduced a trap composed of 21 places in 604 ms
[2020-06-04 19:30:55] [INFO ] Deduced a trap composed of 28 places in 687 ms
[2020-06-04 19:30:56] [INFO ] Deduced a trap composed of 32 places in 651 ms
[2020-06-04 19:30:57] [INFO ] Deduced a trap composed of 25 places in 689 ms
[2020-06-04 19:30:57] [INFO ] Deduced a trap composed of 37 places in 619 ms
[2020-06-04 19:30:58] [INFO ] Deduced a trap composed of 26 places in 544 ms
[2020-06-04 19:30:58] [INFO ] Deduced a trap composed of 44 places in 434 ms
[2020-06-04 19:30:59] [INFO ] Deduced a trap composed of 43 places in 420 ms
[2020-06-04 19:30:59] [INFO ] Deduced a trap composed of 21 places in 468 ms
[2020-06-04 19:31:00] [INFO ] Deduced a trap composed of 37 places in 434 ms
[2020-06-04 19:31:00] [INFO ] Deduced a trap composed of 35 places in 401 ms
[2020-06-04 19:31:01] [INFO ] Deduced a trap composed of 32 places in 405 ms
[2020-06-04 19:31:01] [INFO ] Deduced a trap composed of 33 places in 396 ms
[2020-06-04 19:31:02] [INFO ] Deduced a trap composed of 32 places in 403 ms
[2020-06-04 19:31:02] [INFO ] Deduced a trap composed of 33 places in 400 ms
[2020-06-04 19:31:02] [INFO ] Deduced a trap composed of 30 places in 393 ms
[2020-06-04 19:31:03] [INFO ] Deduced a trap composed of 27 places in 381 ms
[2020-06-04 19:31:03] [INFO ] Deduced a trap composed of 31 places in 394 ms
[2020-06-04 19:31:04] [INFO ] Deduced a trap composed of 32 places in 538 ms
[2020-06-04 19:31:04] [INFO ] Deduced a trap composed of 19 places in 378 ms
[2020-06-04 19:31:05] [INFO ] Deduced a trap composed of 29 places in 443 ms
[2020-06-04 19:31:05] [INFO ] Deduced a trap composed of 29 places in 399 ms
[2020-06-04 19:31:06] [INFO ] Deduced a trap composed of 22 places in 415 ms
[2020-06-04 19:31:06] [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 s644 s645 s662 s663 s664 s665 s666 s667 s702 s711 s712) 0)") while checking expression at index 4
[2020-06-04 19:31:06] [INFO ] [Real]Absence check using 181 positive place invariants in 174 ms returned sat
[2020-06-04 19:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:10] [INFO ] [Real]Absence check using state equation in 3570 ms returned sat
[2020-06-04 19:31:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:10] [INFO ] [Nat]Absence check using 181 positive place invariants in 229 ms returned sat
[2020-06-04 19:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:13] [INFO ] [Nat]Absence check using state equation in 3407 ms returned sat
[2020-06-04 19:31:14] [INFO ] Deduced a trap composed of 23 places in 538 ms
[2020-06-04 19:31:15] [INFO ] Deduced a trap composed of 20 places in 676 ms
[2020-06-04 19:31:15] [INFO ] Deduced a trap composed of 24 places in 529 ms
[2020-06-04 19:31:16] [INFO ] Deduced a trap composed of 24 places in 525 ms
[2020-06-04 19:31:17] [INFO ] Deduced a trap composed of 31 places in 552 ms
[2020-06-04 19:31:17] [INFO ] Deduced a trap composed of 42 places in 573 ms
[2020-06-04 19:31:18] [INFO ] Deduced a trap composed of 21 places in 548 ms
[2020-06-04 19:31:18] [INFO ] Deduced a trap composed of 25 places in 513 ms
[2020-06-04 19:31:19] [INFO ] Deduced a trap composed of 32 places in 539 ms
[2020-06-04 19:31:19] [INFO ] Deduced a trap composed of 21 places in 422 ms
[2020-06-04 19:31:20] [INFO ] Deduced a trap composed of 18 places in 416 ms
[2020-06-04 19:31:20] [INFO ] Deduced a trap composed of 18 places in 402 ms
[2020-06-04 19:31:21] [INFO ] Deduced a trap composed of 18 places in 452 ms
[2020-06-04 19:31:21] [INFO ] Deduced a trap composed of 25 places in 457 ms
[2020-06-04 19:31:22] [INFO ] Deduced a trap composed of 27 places in 574 ms
[2020-06-04 19:31:22] [INFO ] Deduced a trap composed of 32 places in 497 ms
[2020-06-04 19:31:23] [INFO ] Deduced a trap composed of 31 places in 500 ms
[2020-06-04 19:31:23] [INFO ] Deduced a trap composed of 30 places in 508 ms
[2020-06-04 19:31:24] [INFO ] Deduced a trap composed of 22 places in 487 ms
[2020-06-04 19:31:24] [INFO ] Deduced a trap composed of 34 places in 431 ms
[2020-06-04 19:31:25] [INFO ] Deduced a trap composed of 24 places in 456 ms
[2020-06-04 19:31:25] [INFO ] Deduced a trap composed of 35 places in 439 ms
[2020-06-04 19:31:26] [INFO ] Deduced a trap composed of 27 places in 448 ms
[2020-06-04 19:31:26] [INFO ] Deduced a trap composed of 20 places in 444 ms
[2020-06-04 19:31:27] [INFO ] Deduced a trap composed of 19 places in 430 ms
[2020-06-04 19:31:27] [INFO ] Deduced a trap composed of 16 places in 414 ms
[2020-06-04 19:31:28] [INFO ] Deduced a trap composed of 18 places in 454 ms
[2020-06-04 19:31:28] [INFO ] Deduced a trap composed of 26 places in 482 ms
[2020-06-04 19:31:29] [INFO ] Deduced a trap composed of 33 places in 476 ms
[2020-06-04 19:31:29] [INFO ] Deduced a trap composed of 26 places in 479 ms
[2020-06-04 19:31:30] [INFO ] Deduced a trap composed of 43 places in 389 ms
[2020-06-04 19:31:30] [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 s92 s93 s94 s103 s104 s105 s106 s107 s109 s113 s114 s138 s147 s148 s149 s208 s209 s210 s211 s212 s213 s214 s215 s216) 0)") while checking expression at index 5
[2020-06-04 19:31:30] [INFO ] [Real]Absence check using 181 positive place invariants in 187 ms returned sat
[2020-06-04 19:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:34] [INFO ] [Real]Absence check using state equation in 3453 ms returned sat
[2020-06-04 19:31:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:34] [INFO ] [Nat]Absence check using 181 positive place invariants in 31 ms returned unsat
[2020-06-04 19:31:34] [INFO ] [Real]Absence check using 181 positive place invariants in 192 ms returned sat
[2020-06-04 19:31:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:38] [INFO ] [Real]Absence check using state equation in 3321 ms returned sat
[2020-06-04 19:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:38] [INFO ] [Nat]Absence check using 181 positive place invariants in 45 ms returned unsat
[2020-06-04 19:31:38] [INFO ] [Real]Absence check using 181 positive place invariants in 206 ms returned sat
[2020-06-04 19:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:42] [INFO ] [Real]Absence check using state equation in 3594 ms returned sat
[2020-06-04 19:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:31:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 285 ms returned sat
[2020-06-04 19:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:31:46] [INFO ] [Nat]Absence check using state equation in 3150 ms returned sat
[2020-06-04 19:31:47] [INFO ] Deduced a trap composed of 28 places in 740 ms
[2020-06-04 19:31:47] [INFO ] Deduced a trap composed of 19 places in 513 ms
[2020-06-04 19:31:48] [INFO ] Deduced a trap composed of 31 places in 510 ms
[2020-06-04 19:31:48] [INFO ] Deduced a trap composed of 33 places in 465 ms
[2020-06-04 19:31:49] [INFO ] Deduced a trap composed of 23 places in 648 ms
[2020-06-04 19:31:49] [INFO ] Deduced a trap composed of 26 places in 538 ms
[2020-06-04 19:31:50] [INFO ] Deduced a trap composed of 25 places in 641 ms
[2020-06-04 19:31:51] [INFO ] Deduced a trap composed of 39 places in 610 ms
[2020-06-04 19:31:51] [INFO ] Deduced a trap composed of 32 places in 571 ms
[2020-06-04 19:31:52] [INFO ] Deduced a trap composed of 21 places in 471 ms
[2020-06-04 19:31:52] [INFO ] Deduced a trap composed of 39 places in 423 ms
[2020-06-04 19:31:53] [INFO ] Deduced a trap composed of 29 places in 555 ms
[2020-06-04 19:31:54] [INFO ] Deduced a trap composed of 35 places in 525 ms
[2020-06-04 19:31:54] [INFO ] Deduced a trap composed of 12 places in 558 ms
[2020-06-04 19:31:55] [INFO ] Deduced a trap composed of 23 places in 479 ms
[2020-06-04 19:31:55] [INFO ] Deduced a trap composed of 14 places in 459 ms
[2020-06-04 19:31:56] [INFO ] Deduced a trap composed of 18 places in 429 ms
[2020-06-04 19:31:56] [INFO ] Deduced a trap composed of 32 places in 500 ms
[2020-06-04 19:31:57] [INFO ] Deduced a trap composed of 44 places in 481 ms
[2020-06-04 19:31:57] [INFO ] Deduced a trap composed of 18 places in 474 ms
[2020-06-04 19:31:58] [INFO ] Deduced a trap composed of 19 places in 560 ms
[2020-06-04 19:31:59] [INFO ] Deduced a trap composed of 41 places in 518 ms
[2020-06-04 19:31:59] [INFO ] Deduced a trap composed of 27 places in 535 ms
[2020-06-04 19:32:00] [INFO ] Deduced a trap composed of 32 places in 439 ms
[2020-06-04 19:32:00] [INFO ] Deduced a trap composed of 36 places in 518 ms
[2020-06-04 19:32:01] [INFO ] Deduced a trap composed of 24 places in 447 ms
[2020-06-04 19:32:01] [INFO ] Deduced a trap composed of 36 places in 470 ms
[2020-06-04 19:32:02] [INFO ] Deduced a trap composed of 30 places in 434 ms
[2020-06-04 19:32:02] [INFO ] Deduced a trap composed of 42 places in 329 ms
[2020-06-04 19:32:02] [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 s277 s278 s279 s280 s281 s282 s283 s285 s289 s290 s291 s292 s293 s294 s295 s296 s297) 0)") while checking expression at index 8
[2020-06-04 19:32:02] [INFO ] [Real]Absence check using 181 positive place invariants in 130 ms returned sat
[2020-06-04 19:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:07] [INFO ] [Real]Absence check using state equation in 4159 ms returned sat
[2020-06-04 19:32:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 19:32:07] [INFO ] [Nat]Absence check using 181 positive place invariants in 238 ms returned sat
[2020-06-04 19:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 19:32:11] [INFO ] [Nat]Absence check using state equation in 4139 ms returned sat
[2020-06-04 19:32:12] [INFO ] Deduced a trap composed of 34 places in 633 ms
[2020-06-04 19:32:12] [INFO ] Deduced a trap composed of 34 places in 523 ms
[2020-06-04 19:32:13] [INFO ] Deduced a trap composed of 18 places in 462 ms
[2020-06-04 19:32:13] [INFO ] Deduced a trap composed of 18 places in 456 ms
[2020-06-04 19:32:14] [INFO ] Deduced a trap composed of 18 places in 447 ms
[2020-06-04 19:32:15] [INFO ] Deduced a trap composed of 19 places in 493 ms
[2020-06-04 19:32:15] [INFO ] Deduced a trap composed of 19 places in 483 ms
[2020-06-04 19:32:16] [INFO ] Deduced a trap composed of 20 places in 487 ms
[2020-06-04 19:32:16] [INFO ] Deduced a trap composed of 26 places in 451 ms
[2020-06-04 19:32:17] [INFO ] Deduced a trap composed of 22 places in 411 ms
[2020-06-04 19:32:17] [INFO ] Deduced a trap composed of 21 places in 567 ms
[2020-06-04 19:32:18] [INFO ] Deduced a trap composed of 29 places in 436 ms
[2020-06-04 19:32:18] [INFO ] Deduced a trap composed of 24 places in 464 ms
[2020-06-04 19:32:19] [INFO ] Deduced a trap composed of 29 places in 416 ms
[2020-06-04 19:32:19] [INFO ] Deduced a trap composed of 52 places in 493 ms
[2020-06-04 19:32:20] [INFO ] Deduced a trap composed of 20 places in 390 ms
[2020-06-04 19:32:20] [INFO ] Deduced a trap composed of 30 places in 361 ms
[2020-06-04 19:32:20] [INFO ] Deduced a trap composed of 33 places in 474 ms
[2020-06-04 19:32:21] [INFO ] Deduced a trap composed of 24 places in 371 ms
[2020-06-04 19:32:21] [INFO ] Deduced a trap composed of 22 places in 429 ms
[2020-06-04 19:32:22] [INFO ] Deduced a trap composed of 22 places in 475 ms
[2020-06-04 19:32:22] [INFO ] Deduced a trap composed of 23 places in 361 ms
[2020-06-04 19:32:23] [INFO ] Deduced a trap composed of 27 places in 496 ms
[2020-06-04 19:32:23] [INFO ] Deduced a trap composed of 36 places in 413 ms
[2020-06-04 19:32:24] [INFO ] Deduced a trap composed of 33 places in 438 ms
[2020-06-04 19:32:24] [INFO ] Deduced a trap composed of 26 places in 361 ms
[2020-06-04 19:32:24] [INFO ] Deduced a trap composed of 30 places in 314 ms
[2020-06-04 19:32:25] [INFO ] Deduced a trap composed of 34 places in 317 ms
[2020-06-04 19:32:25] [INFO ] Deduced a trap composed of 22 places in 313 ms
[2020-06-04 19:32:26] [INFO ] Deduced a trap composed of 32 places in 313 ms
[2020-06-04 19:32:26] [INFO ] Deduced a trap composed of 35 places in 300 ms
[2020-06-04 19:32:26] [INFO ] Deduced a trap composed of 29 places in 292 ms
[2020-06-04 19:32:27] [INFO ] Deduced a trap composed of 26 places in 293 ms
[2020-06-04 19:32:27] [INFO ] Deduced a trap composed of 31 places in 300 ms
[2020-06-04 19:32:27] [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 s851 s852 s853 s859 s860 s862 s863 s868 s889 s894 s897 s906 s907 s908 s910 s911 s912 s913 s914 s915 s916 s917 s918) 0)") while checking expression at index 9
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 19:32:27] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-04 19:32:27] [INFO ] Flatten gal took : 124 ms
FORMULA ShieldIIPt-PT-020B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:32:27] [INFO ] Applying decomposition
[2020-06-04 19:32:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 19:32:27] [INFO ] Flatten gal took : 76 ms
[2020-06-04 19:32:27] [INFO ] Decomposing Gal with order
[2020-06-04 19:32:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 19:32:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 19:32:28] [INFO ] Flatten gal took : 214 ms
[2020-06-04 19:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 40 ms.
[2020-06-04 19:32:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldIIPt-PT-020B-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 19:32:28] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 13 ms.
[2020-06-04 19:32:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldIIPt-PT-020B @ 3570 seconds

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

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

FORMULA ShieldIIPt-PT-020B-07 TRUE 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

FORMULA ShieldIIPt-PT-020B-14 FALSE 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-06 FALSE 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
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 8303864 kB
After kill :
MemTotal: 16427456 kB
MemFree: 8333128 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="LTLCardinality"
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 LTLCardinality"
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-159033477300321"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;