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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.200 3600000.00 6619960.00 1904.40 TTTFF?FTTFTFTFTF 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-159033477800675.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 ShieldPPPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800675
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 3.4K May 14 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:52 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 376K 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 ShieldPPPt-PT-020B-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591320547930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 01:29:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 01:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 01:29:09] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-05 01:29:09] [INFO ] Transformed 1563 places.
[2020-06-05 01:29:09] [INFO ] Transformed 1423 transitions.
[2020-06-05 01:29:09] [INFO ] Found NUPN structural information;
[2020-06-05 01:29:09] [INFO ] Parsed PT model containing 1563 places and 1423 transitions in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 49 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 419 ms. (steps per millisecond=238 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0]
// Phase 1: matrix 1423 rows 1563 cols
[2020-06-05 01:29:10] [INFO ] Computed 221 place invariants in 34 ms
[2020-06-05 01:29:10] [INFO ] [Real]Absence check using 221 positive place invariants in 187 ms returned sat
[2020-06-05 01:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:29:14] [INFO ] [Real]Absence check using state equation in 3917 ms returned sat
[2020-06-05 01:29:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:29:15] [INFO ] [Nat]Absence check using 221 positive place invariants in 210 ms returned sat
[2020-06-05 01:29:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:29:19] [INFO ] [Nat]Absence check using state equation in 3892 ms returned sat
[2020-06-05 01:29:19] [INFO ] Deduced a trap composed of 25 places in 710 ms
[2020-06-05 01:29:20] [INFO ] Deduced a trap composed of 18 places in 565 ms
[2020-06-05 01:29:21] [INFO ] Deduced a trap composed of 26 places in 616 ms
[2020-06-05 01:29:21] [INFO ] Deduced a trap composed of 28 places in 712 ms
[2020-06-05 01:29:22] [INFO ] Deduced a trap composed of 25 places in 593 ms
[2020-06-05 01:29:23] [INFO ] Deduced a trap composed of 23 places in 529 ms
[2020-06-05 01:29:23] [INFO ] Deduced a trap composed of 35 places in 547 ms
[2020-06-05 01:29:24] [INFO ] Deduced a trap composed of 26 places in 485 ms
[2020-06-05 01:29:24] [INFO ] Deduced a trap composed of 26 places in 516 ms
[2020-06-05 01:29:25] [INFO ] Deduced a trap composed of 20 places in 499 ms
[2020-06-05 01:29:26] [INFO ] Deduced a trap composed of 27 places in 523 ms
[2020-06-05 01:29:26] [INFO ] Deduced a trap composed of 31 places in 522 ms
[2020-06-05 01:29:27] [INFO ] Deduced a trap composed of 34 places in 569 ms
[2020-06-05 01:29:27] [INFO ] Deduced a trap composed of 25 places in 536 ms
[2020-06-05 01:29:28] [INFO ] Deduced a trap composed of 29 places in 537 ms
[2020-06-05 01:29:29] [INFO ] Deduced a trap composed of 28 places in 531 ms
[2020-06-05 01:29:29] [INFO ] Deduced a trap composed of 29 places in 562 ms
[2020-06-05 01:29:30] [INFO ] Deduced a trap composed of 34 places in 529 ms
[2020-06-05 01:29:30] [INFO ] Deduced a trap composed of 31 places in 541 ms
[2020-06-05 01:29:31] [INFO ] Deduced a trap composed of 27 places in 515 ms
[2020-06-05 01:29:32] [INFO ] Deduced a trap composed of 30 places in 504 ms
[2020-06-05 01:29:32] [INFO ] Deduced a trap composed of 44 places in 583 ms
[2020-06-05 01:29:33] [INFO ] Deduced a trap composed of 27 places in 492 ms
[2020-06-05 01:29:33] [INFO ] Deduced a trap composed of 33 places in 490 ms
[2020-06-05 01:29:34] [INFO ] Deduced a trap composed of 34 places in 469 ms
[2020-06-05 01:29:35] [INFO ] Deduced a trap composed of 29 places in 476 ms
[2020-06-05 01: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 s6 s7 s8 s804 s805 s806 s807 s808 s811 s812 s813 s814 s815 s828 s834 s870 s871 s872 s873 s874 s875 s876 s888) 0)") while checking expression at index 0
[2020-06-05 01:29:35] [INFO ] [Real]Absence check using 221 positive place invariants in 257 ms returned sat
[2020-06-05 01:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:29:39] [INFO ] [Real]Absence check using state equation in 4220 ms returned sat
[2020-06-05 01:29:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:29:40] [INFO ] [Nat]Absence check using 221 positive place invariants in 279 ms returned sat
[2020-06-05 01:29:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:29:43] [INFO ] [Nat]Absence check using state equation in 3670 ms returned sat
[2020-06-05 01:29:44] [INFO ] Deduced a trap composed of 18 places in 637 ms
[2020-06-05 01:29:45] [INFO ] Deduced a trap composed of 27 places in 659 ms
[2020-06-05 01:29:45] [INFO ] Deduced a trap composed of 23 places in 550 ms
[2020-06-05 01:29:46] [INFO ] Deduced a trap composed of 26 places in 619 ms
[2020-06-05 01:29:47] [INFO ] Deduced a trap composed of 26 places in 508 ms
[2020-06-05 01:29:47] [INFO ] Deduced a trap composed of 25 places in 601 ms
[2020-06-05 01:29:48] [INFO ] Deduced a trap composed of 29 places in 585 ms
[2020-06-05 01:29:49] [INFO ] Deduced a trap composed of 29 places in 495 ms
[2020-06-05 01:29:49] [INFO ] Deduced a trap composed of 28 places in 566 ms
[2020-06-05 01:29:50] [INFO ] Deduced a trap composed of 39 places in 560 ms
[2020-06-05 01:29:50] [INFO ] Deduced a trap composed of 33 places in 576 ms
[2020-06-05 01:29:51] [INFO ] Deduced a trap composed of 41 places in 536 ms
[2020-06-05 01:29:52] [INFO ] Deduced a trap composed of 24 places in 559 ms
[2020-06-05 01:29:52] [INFO ] Deduced a trap composed of 29 places in 546 ms
[2020-06-05 01:29:53] [INFO ] Deduced a trap composed of 21 places in 517 ms
[2020-06-05 01:29:53] [INFO ] Deduced a trap composed of 27 places in 516 ms
[2020-06-05 01:29:54] [INFO ] Deduced a trap composed of 36 places in 460 ms
[2020-06-05 01:29:54] [INFO ] Deduced a trap composed of 25 places in 390 ms
[2020-06-05 01:29:55] [INFO ] Deduced a trap composed of 24 places in 401 ms
[2020-06-05 01:29:55] [INFO ] Deduced a trap composed of 29 places in 355 ms
[2020-06-05 01:29:56] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2020-06-05 01:29:56] [INFO ] Deduced a trap composed of 20 places in 414 ms
[2020-06-05 01:29:57] [INFO ] Deduced a trap composed of 20 places in 441 ms
[2020-06-05 01:29:57] [INFO ] Deduced a trap composed of 32 places in 423 ms
[2020-06-05 01:29:58] [INFO ] Deduced a trap composed of 39 places in 414 ms
[2020-06-05 01:29:58] [INFO ] Deduced a trap composed of 32 places in 416 ms
[2020-06-05 01:29:59] [INFO ] Deduced a trap composed of 31 places in 510 ms
[2020-06-05 01:29:59] [INFO ] Deduced a trap composed of 29 places in 452 ms
[2020-06-05 01:29:59] [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 s881 s882 s883 s884 s885 s904 s905 s906 s907 s908 s909 s910 s911 s947 s948 s949 s950 s951 s952 s953 s965) 0)") while checking expression at index 1
[2020-06-05 01:30:00] [INFO ] [Real]Absence check using 221 positive place invariants in 320 ms returned sat
[2020-06-05 01:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:30:04] [INFO ] [Real]Absence check using state equation in 4393 ms returned sat
[2020-06-05 01:30:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:30:05] [INFO ] [Nat]Absence check using 221 positive place invariants in 295 ms returned sat
[2020-06-05 01:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:30:09] [INFO ] [Nat]Absence check using state equation in 3854 ms returned sat
[2020-06-05 01:30:10] [INFO ] Deduced a trap composed of 24 places in 661 ms
[2020-06-05 01:30:10] [INFO ] Deduced a trap composed of 23 places in 620 ms
[2020-06-05 01:30:11] [INFO ] Deduced a trap composed of 17 places in 730 ms
[2020-06-05 01:30:12] [INFO ] Deduced a trap composed of 27 places in 625 ms
[2020-06-05 01:30:12] [INFO ] Deduced a trap composed of 24 places in 642 ms
[2020-06-05 01:30:13] [INFO ] Deduced a trap composed of 27 places in 626 ms
[2020-06-05 01:30:14] [INFO ] Deduced a trap composed of 19 places in 603 ms
[2020-06-05 01:30:14] [INFO ] Deduced a trap composed of 21 places in 602 ms
[2020-06-05 01:30:15] [INFO ] Deduced a trap composed of 25 places in 596 ms
[2020-06-05 01:30:16] [INFO ] Deduced a trap composed of 18 places in 532 ms
[2020-06-05 01:30:16] [INFO ] Deduced a trap composed of 31 places in 504 ms
[2020-06-05 01:30:17] [INFO ] Deduced a trap composed of 21 places in 516 ms
[2020-06-05 01:30:17] [INFO ] Deduced a trap composed of 23 places in 506 ms
[2020-06-05 01:30:18] [INFO ] Deduced a trap composed of 26 places in 475 ms
[2020-06-05 01:30:18] [INFO ] Deduced a trap composed of 36 places in 484 ms
[2020-06-05 01:30:19] [INFO ] Deduced a trap composed of 37 places in 456 ms
[2020-06-05 01:30:19] [INFO ] Deduced a trap composed of 35 places in 446 ms
[2020-06-05 01:30:20] [INFO ] Deduced a trap composed of 34 places in 423 ms
[2020-06-05 01:30:20] [INFO ] Deduced a trap composed of 29 places in 418 ms
[2020-06-05 01:30:21] [INFO ] Deduced a trap composed of 29 places in 428 ms
[2020-06-05 01:30:21] [INFO ] Deduced a trap composed of 24 places in 411 ms
[2020-06-05 01:30:22] [INFO ] Deduced a trap composed of 33 places in 412 ms
[2020-06-05 01:30:22] [INFO ] Deduced a trap composed of 29 places in 395 ms
[2020-06-05 01:30:23] [INFO ] Deduced a trap composed of 32 places in 384 ms
[2020-06-05 01:30:23] [INFO ] Deduced a trap composed of 36 places in 358 ms
[2020-06-05 01:30:24] [INFO ] Deduced a trap composed of 36 places in 370 ms
[2020-06-05 01:30:24] [INFO ] Deduced a trap composed of 36 places in 356 ms
[2020-06-05 01:30:24] [INFO ] Deduced a trap composed of 34 places in 272 ms
[2020-06-05 01:30:25] [INFO ] Deduced a trap composed of 32 places in 279 ms
[2020-06-05 01:30:25] [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 s331 s332 s333 s334 s335 s336 s337 s338 s342 s376 s377 s378 s379 s380 s381 s382) 0)") while checking expression at index 2
[2020-06-05 01:30:25] [INFO ] [Real]Absence check using 221 positive place invariants in 165 ms returned sat
[2020-06-05 01:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 01:30:29] [INFO ] [Real]Absence check using state equation in 4116 ms returned sat
[2020-06-05 01:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 01:30:30] [INFO ] [Nat]Absence check using 221 positive place invariants in 301 ms returned sat
[2020-06-05 01:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 01:30:33] [INFO ] [Nat]Absence check using state equation in 3816 ms returned sat
[2020-06-05 01:30:34] [INFO ] Deduced a trap composed of 24 places in 680 ms
[2020-06-05 01:30:35] [INFO ] Deduced a trap composed of 24 places in 698 ms
[2020-06-05 01:30:36] [INFO ] Deduced a trap composed of 22 places in 720 ms
[2020-06-05 01:30:37] [INFO ] Deduced a trap composed of 25 places in 715 ms
[2020-06-05 01:30:37] [INFO ] Deduced a trap composed of 25 places in 680 ms
[2020-06-05 01:30:38] [INFO ] Deduced a trap composed of 21 places in 666 ms
[2020-06-05 01:30:39] [INFO ] Deduced a trap composed of 23 places in 659 ms
[2020-06-05 01:30:39] [INFO ] Deduced a trap composed of 18 places in 485 ms
[2020-06-05 01:30:40] [INFO ] Deduced a trap composed of 21 places in 688 ms
[2020-06-05 01:30:41] [INFO ] Deduced a trap composed of 34 places in 637 ms
[2020-06-05 01:30:41] [INFO ] Deduced a trap composed of 36 places in 604 ms
[2020-06-05 01:30:42] [INFO ] Deduced a trap composed of 27 places in 579 ms
[2020-06-05 01:30:43] [INFO ] Deduced a trap composed of 31 places in 572 ms
[2020-06-05 01:30:43] [INFO ] Deduced a trap composed of 28 places in 612 ms
[2020-06-05 01:30:44] [INFO ] Deduced a trap composed of 31 places in 618 ms
[2020-06-05 01:30:45] [INFO ] Deduced a trap composed of 15 places in 530 ms
[2020-06-05 01:30:45] [INFO ] Deduced a trap composed of 26 places in 531 ms
[2020-06-05 01:30:46] [INFO ] Deduced a trap composed of 27 places in 530 ms
[2020-06-05 01:30:46] [INFO ] Deduced a trap composed of 25 places in 563 ms
[2020-06-05 01:30:47] [INFO ] Deduced a trap composed of 25 places in 465 ms
[2020-06-05 01:30:47] [INFO ] Deduced a trap composed of 33 places in 542 ms
[2020-06-05 01:30:48] [INFO ] Deduced a trap composed of 30 places in 410 ms
[2020-06-05 01:30:49] [INFO ] Deduced a trap composed of 29 places in 525 ms
[2020-06-05 01:30:49] [INFO ] Deduced a trap composed of 29 places in 501 ms
[2020-06-05 01:30:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 01:30:50] [INFO ] Deduced a trap composed of 15 places in 904 ms
[2020-06-05 01:30:50] [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 s1255 s1256 s1257 s1258 s1259 s1260 s1280 s1281 s1282 s1283 s1284) 0)") while checking expression at index 3
[2020-06-05 01:30:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-05 01:30:50] [INFO ] Flatten gal took : 118 ms
[2020-06-05 01:30:50] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-05 01:30:50] [INFO ] Flatten gal took : 53 ms
FORMULA ShieldPPPt-PT-020B-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 01:30:50] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-05 01:30:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 12 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ ShieldPPPt-PT-020B @ 3570 seconds

FORMULA ShieldPPPt-PT-020B-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPt-PT-020B-CTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ShieldPPPt-PT-020B-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-020B-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPt-PT-020B-CTLCardinality-04 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: 6491944 kB
After kill :
MemTotal: 16427456 kB
MemFree: 9048892 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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLCardinality"
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 ShieldPPPt-PT-020B, examination is CTLCardinality"
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-159033477800675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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