Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r513-tall-167987240900334.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is Murphy-PT-D1N010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240900334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 13K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 9.3K Mar 26 22: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 Murphy-PT-D1N010-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D1N010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679894031754

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D1N010
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Murphy_COL_D1_N10
(NrP: 12 NrTr: 14 NrArc: 54)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 2.752sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 237 (2.4e+02) #states 39,780 (4)



starting MCC model checker
--------------------------

checking: EF [7<=p5_2]
normalized: E [true U 7<=p5_2]

abstracting: (7<=p5_2)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [~ [9<=p3_2]]
normalized: ~ [E [true U 9<=p3_2]]

abstracting: (9<=p3_2)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p5_1<=9]]
normalized: E [true U ~ [p5_1<=9]]

abstracting: (p5_1<=9)
states: 39,780 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p5_1<=4]
normalized: ~ [E [true U ~ [p5_1<=4]]]

abstracting: (p5_1<=4)
states: 39,780 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p2_2<=p2_2]
normalized: ~ [E [true U ~ [p2_2<=p2_2]]]

abstracting: (p2_2<=p2_2)
states: 39,780 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[p4_1<=p1_1 & ~ [[[[p4_1<=9 | p3_1<=10] & p5_2<=p1_2] & ~ [[3<=p2_1 | 4<=p1_1]]]]] | p0_1<=8]]]
normalized: E [true U ~ [[[~ [[~ [[3<=p2_1 | 4<=p1_1]] & [[p4_1<=9 | p3_1<=10] & p5_2<=p1_2]]] & p4_1<=p1_1] | p0_1<=8]]]

abstracting: (p0_1<=8)
states: 29,700 (4)
abstracting: (p4_1<=p1_1)
states: 35,136 (4)
abstracting: (p5_2<=p1_2)
states: 32,934 (4)
abstracting: (p3_1<=10)
states: 39,780 (4)
abstracting: (p4_1<=9)
states: 39,780 (4)
abstracting: (4<=p1_1)
states: 22,680 (4)
abstracting: (3<=p2_1)
states: 27,684 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[2<=p5_1 & [[p4_2<=5 | [[~ [[[6<=p3_2 & p5_1<=3] | p4_2<=p5_1]] | [~ [p4_1<=8] & 6<=p2_1]] | p4_1<=8]] | 6<=p3_1]] & ~ [p3_1<=1]]]
normalized: E [true U [~ [p3_1<=1] & [[[[[[~ [p4_1<=8] & 6<=p2_1] | ~ [[[6<=p3_2 & p5_1<=3] | p4_2<=p5_1]]] | p4_1<=8] | p4_2<=5] | 6<=p3_1] & 2<=p5_1]]]

abstracting: (2<=p5_1)
states: 19,890 (4)
abstracting: (6<=p3_1)
states: 0
abstracting: (p4_2<=5)
states: 39,780 (4)
abstracting: (p4_1<=8)
states: 39,780 (4)
abstracting: (p4_2<=p5_1)
states: 30,940 (4)
abstracting: (p5_1<=3)
states: 39,780 (4)
abstracting: (6<=p3_2)
states: 0
abstracting: (6<=p2_1)
states: 17,280 (4)
abstracting: (p4_1<=8)
states: 39,780 (4)
abstracting: (p3_1<=1)
states: 39,780 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p2_1<=p4_2 | p5_1<=p1_1] & 7<=p5_2] & ~ [[~ [[~ [p0_2<=10] & [~ [[p0_1<=2 | p3_2<=p5_2]] & [~ [10<=p5_2] | [[8<=p4_1 | p0_2<=p5_2] & ~ [8<=p1_2]]]]]] & [~ [[3<=p1_2 | ~ [1<=p5_1]]] | ~ [5<=p0_1]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[[~ [[p0_1<=2 | p3_2<=p5_2]] & [[~ [8<=p1_2] & [8<=p4_1 | p0_2<=p5_2]] | ~ [10<=p5_2]]] & ~ [p0_2<=10]]] & [~ [5<=p0_1] | ~ [[~ [1<=p5_1] | 3<=p1_2]]]]] & [[p2_1<=p4_2 | p5_1<=p1_1] & 7<=p5_2]]]]]

abstracting: (7<=p5_2)
states: 0
abstracting: (p5_1<=p1_1)
states: 32,934 (4)
abstracting: (p2_1<=p4_2)
states: 8,052 (3)
abstracting: (3<=p1_2)
states: 26,568 (4)
abstracting: (1<=p5_1)
states: 33,150 (4)
abstracting: (5<=p0_1)
states: 20,520 (4)
abstracting: (p0_2<=10)
states: 33,228 (4)
abstracting: (10<=p5_2)
states: 0
abstracting: (p0_2<=p5_2)
states: 10,074 (4)
abstracting: (8<=p4_1)
states: 0
abstracting: (8<=p1_2)
states: 11,232 (4)
abstracting: (p3_2<=p5_2)
states: 33,150 (4)
abstracting: (p0_1<=2)
states: 12,096 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [6<=p0_1] | [[[[[p1_1<=2 | 7<=p3_1] | ~ [p4_1<=p4_1]] | p3_2<=10] | [~ [[[~ [[p1_2<=p1_2 & p5_2<=3]] | ~ [p5_1<=2]] | 6<=p1_1]] | p5_2<=9]] | [[[~ [p5_2<=p4_2] & [p5_1<=p2_1 | ~ [[[p5_1<=1 & p0_2<=p0_1] & [p3_2<=4 | p4_1<=p4_1]]]]] | [~ [p4_1<=p2_2] & 2<=p0_2]] | ~ [10<=p4_1]]]]]
normalized: ~ [E [true U ~ [[[[~ [10<=p4_1] | [[~ [p4_1<=p2_2] & 2<=p0_2] | [[~ [[[p3_2<=4 | p4_1<=p4_1] & [p5_1<=1 & p0_2<=p0_1]]] | p5_1<=p2_1] & ~ [p5_2<=p4_2]]]] | [[~ [[[~ [p5_1<=2] | ~ [[p1_2<=p1_2 & p5_2<=3]]] | 6<=p1_1]] | p5_2<=9] | [[~ [p4_1<=p4_1] | [p1_1<=2 | 7<=p3_1]] | p3_2<=10]]] | ~ [6<=p0_1]]]]]

abstracting: (6<=p0_1)
states: 17,280 (4)
abstracting: (p3_2<=10)
states: 39,780 (4)
abstracting: (7<=p3_1)
states: 0
abstracting: (p1_1<=2)
states: 13,212 (4)
abstracting: (p4_1<=p4_1)
states: 39,780 (4)
abstracting: (p5_2<=9)
states: 39,780 (4)
abstracting: (6<=p1_1)
states: 16,308 (4)
abstracting: (p5_2<=3)
states: 39,780 (4)
abstracting: (p1_2<=p1_2)
states: 39,780 (4)
abstracting: (p5_1<=2)
states: 33,150 (4)
abstracting: (p5_2<=p4_2)
states: 19,890 (4)
abstracting: (p5_1<=p2_1)
states: 33,744 (4)
abstracting: (p0_2<=p0_1)
states: 20,952 (4)
abstracting: (p5_1<=1)
states: 19,890 (4)
abstracting: (p4_1<=p4_1)
states: 39,780 (4)
abstracting: (p3_2<=4)
states: 39,780 (4)
abstracting: (2<=p0_2)
states: 31,608 (4)
abstracting: (p4_1<=p2_2)
states: 35,760 (4)
abstracting: (10<=p4_1)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[p5_1<=7 & [~ [[[[[[~ [p5_1<=2] & [7<=p2_2 & p3_1<=0]] | [~ [p0_1<=p4_1] | p0_2<=8]] | [~ [p3_2<=p2_1] & [[3<=p5_1 & p5_1<=p5_2] | ~ [p3_1<=3]]]] | 7<=p3_2] & p3_2<=p1_1]] & ~ [[~ [[[~ [[8<=p4_2 | p1_2<=p1_1]] & [~ [p0_2<=p5_1] | ~ [p1_1<=p1_2]]] & [p2_2<=2 & ~ [[4<=p5_2 & p4_2<=0]]]]] | ~ [p0_1<=4]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [p0_1<=4] | ~ [[[~ [[4<=p5_2 & p4_2<=0]] & p2_2<=2] & [[~ [p1_1<=p1_2] | ~ [p0_2<=p5_1]] & ~ [[8<=p4_2 | p1_2<=p1_1]]]]]]] & ~ [[[[[[~ [p3_1<=3] | [3<=p5_1 & p5_1<=p5_2]] & ~ [p3_2<=p2_1]] | [[~ [p0_1<=p4_1] | p0_2<=8] | [[7<=p2_2 & p3_1<=0] & ~ [p5_1<=2]]]] | 7<=p3_2] & p3_2<=p1_1]]] & p5_1<=7]]]]

abstracting: (p5_1<=7)
states: 39,780 (4)
abstracting: (p3_2<=p1_1)
states: 37,458 (4)
abstracting: (7<=p3_2)
states: 0
abstracting: (p5_1<=2)
states: 33,150 (4)
abstracting: (p3_1<=0)
states: 19,890 (4)
abstracting: (7<=p2_2)
states: 14,688 (4)
abstracting: (p0_2<=8)
states: 29,700 (4)
abstracting: (p0_1<=p4_1)
states: 8,052 (3)
abstracting: (p3_2<=p2_1)
states: 37,836 (4)
abstracting: (p5_1<=p5_2)
states: 25,415 (4)
abstracting: (3<=p5_1)
states: 6,630 (3)
abstracting: (p3_1<=3)
states: 39,780 (4)
abstracting: (p1_2<=p1_1)
states: 21,168 (4)
abstracting: (8<=p4_2)
states: 0
abstracting: (p0_2<=p5_1)
states: 10,074 (4)
abstracting: (p1_1<=p1_2)
states: 21,168 (4)
abstracting: (p2_2<=2)
states: 12,096 (4)
abstracting: (p4_2<=0)
states: 13,260 (4)
abstracting: (4<=p5_2)
states: 0
abstracting: (p0_1<=4)
states: 19,260 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[10<=p4_2 & [~ [[[~ [[~ [[p4_1<=p2_2 | 3<=p0_2]] & ~ [[p2_2<=8 | p1_1<=3]]]] | p0_2<=6] | ~ [[[[[p0_2<=p1_1 & p1_1<=5] & p0_2<=p0_1] | p1_1<=p0_1] | p2_1<=2]]]] & [[[p0_1<=p3_1 & p0_2<=p2_1] & [[[[~ [5<=p1_1] & [p3_1<=p3_1 | p3_1<=p0_1]] | p5_2<=p5_2] | [[[p3_1<=9 & p2_1<=2] | ~ [1<=p1_2]] & [p4_2<=p1_1 & 3<=p5_1]]] | p1_1<=3]] | p4_1<=4]]]]
normalized: E [true U [[[[[[[[p4_2<=p1_1 & 3<=p5_1] & [~ [1<=p1_2] | [p3_1<=9 & p2_1<=2]]] | [[[p3_1<=p3_1 | p3_1<=p0_1] & ~ [5<=p1_1]] | p5_2<=p5_2]] | p1_1<=3] & [p0_1<=p3_1 & p0_2<=p2_1]] | p4_1<=4] & ~ [[~ [[[[[p0_2<=p1_1 & p1_1<=5] & p0_2<=p0_1] | p1_1<=p0_1] | p2_1<=2]] | [~ [[~ [[p2_2<=8 | p1_1<=3]] & ~ [[p4_1<=p2_2 | 3<=p0_2]]]] | p0_2<=6]]]] & 10<=p4_2]]

abstracting: (10<=p4_2)
states: 0
abstracting: (p0_2<=6)
states: 25,092 (4)
abstracting: (3<=p0_2)
states: 27,684 (4)
abstracting: (p4_1<=p2_2)
states: 35,760 (4)
abstracting: (p1_1<=3)
states: 17,100 (4)
abstracting: (p2_2<=8)
states: 29,700 (4)
abstracting: (p2_1<=2)
states: 12,096 (4)
abstracting: (p1_1<=p0_1)
states: 20,448 (4)
abstracting: (p0_2<=p0_1)
states: 20,952 (4)
abstracting: (p1_1<=5)
states: 23,472 (4)
abstracting: (p0_2<=p1_1)
states: 20,520 (4)
abstracting: (p4_1<=4)
states: 39,780 (4)
abstracting: (p0_2<=p2_1)
states: 20,952 (4)
abstracting: (p0_1<=p3_1)
states: 6,030 (3)
abstracting: (p1_1<=3)
states: 17,100 (4)
abstracting: (p5_2<=p5_2)
states: 39,780 (4)
abstracting: (5<=p1_1)
states: 19,476 (4)
abstracting: (p3_1<=p0_1)
states: 37,836 (4)
abstracting: (p3_1<=p3_1)
states: 39,780 (4)
abstracting: (p2_1<=2)
states: 12,096 (4)
abstracting: (p3_1<=9)
states: 39,780 (4)
abstracting: (1<=p1_2)
states: 35,136 (4)
abstracting: (3<=p5_1)
states: 6,630 (3)
abstracting: (p4_2<=p1_1)
states: 35,136 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[~ [10<=p3_2] | ~ [[~ [[[~ [[8<=p2_1 | p2_2<=8]] | p5_1<=3] & ~ [[~ [8<=p2_2] | ~ [6<=p4_2]]]]] & 9<=p0_1]]] & [~ [[[5<=p1_2 & ~ [[[[p0_1<=p4_1 | p1_2<=7] | p0_2<=6] & ~ [p0_1<=3]]]] & [~ [p3_1<=p1_2] & 5<=p0_1]]] | [[p2_2<=8 | [10<=p0_1 & [[3<=p3_1 | ~ [8<=p2_1]] | p0_1<=3]]] | ~ [[[~ [[10<=p3_1 & p3_2<=p5_2]] & p4_2<=p4_2] & [[~ [p5_2<=p4_1] & ~ [2<=p2_1]] | [[[3<=p5_2 & p0_1<=p0_2] | [p3_2<=p5_2 & p5_1<=p4_2]] | ~ [p1_1<=10]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[[~ [p1_1<=10] | [[p3_2<=p5_2 & p5_1<=p4_2] | [3<=p5_2 & p0_1<=p0_2]]] | [~ [2<=p2_1] & ~ [p5_2<=p4_1]]] & [~ [[10<=p3_1 & p3_2<=p5_2]] & p4_2<=p4_2]]] | [[[[~ [8<=p2_1] | 3<=p3_1] | p0_1<=3] & 10<=p0_1] | p2_2<=8]] | ~ [[[~ [p3_1<=p1_2] & 5<=p0_1] & [~ [[~ [p0_1<=3] & [[p0_1<=p4_1 | p1_2<=7] | p0_2<=6]]] & 5<=p1_2]]]] & [~ [[~ [[~ [[~ [6<=p4_2] | ~ [8<=p2_2]]] & [p5_1<=3 | ~ [[8<=p2_1 | p2_2<=8]]]]] & 9<=p0_1]] | ~ [10<=p3_2]]]]]]

abstracting: (10<=p3_2)
states: 0
abstracting: (9<=p0_1)
states: 10,080 (4)
abstracting: (p2_2<=8)
states: 29,700 (4)
abstracting: (8<=p2_1)
states: 12,096 (4)
abstracting: (p5_1<=3)
states: 39,780 (4)
abstracting: (8<=p2_2)
states: 12,096 (4)
abstracting: (6<=p4_2)
states: 0
abstracting: (5<=p1_2)
states: 19,476 (4)
abstracting: (p0_2<=6)
states: 25,092 (4)
abstracting: (p1_2<=7)
states: 28,548 (4)
abstracting: (p0_1<=p4_1)
states: 8,052 (3)
abstracting: (p0_1<=3)
states: 16,020 (4)
abstracting: (5<=p0_1)
states: 20,520 (4)
abstracting: (p3_1<=p1_2)
states: 37,458 (4)
abstracting: (p2_2<=8)
states: 29,700 (4)
abstracting: (10<=p0_1)
states: 8,064 (3)
abstracting: (p0_1<=3)
states: 16,020 (4)
abstracting: (3<=p3_1)
states: 0
abstracting: (8<=p2_1)
states: 12,096 (4)
abstracting: (p4_2<=p4_2)
states: 39,780 (4)
abstracting: (p3_2<=p5_2)
states: 33,150 (4)
abstracting: (10<=p3_1)
states: 0
abstracting: (p5_2<=p4_1)
states: 19,890 (4)
abstracting: (2<=p2_1)
states: 31,608 (4)
abstracting: (p0_1<=p0_2)
states: 20,952 (4)
abstracting: (3<=p5_2)
states: 6,630 (3)
abstracting: (p5_1<=p4_2)
states: 19,890 (4)
abstracting: (p3_2<=p5_2)
states: 33,150 (4)
abstracting: (p1_1<=10)
states: 33,948 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[[p3_1<=p0_2 | [p1_1<=4 & [[[8<=p1_1 | [p2_1<=0 | p2_1<=p2_2]] & [[5<=p5_1 & p1_1<=p3_1] | [p5_2<=3 | 10<=p3_1]]] & [[[p5_1<=3 | 1<=p0_2] & [p2_2<=2 & p0_2<=6]] | ~ [p2_2<=p0_2]]]]] & ~ [[[[[p3_2<=2 & ~ [p0_2<=10]] | [~ [p2_2<=p3_1] | [p3_2<=4 & 9<=p0_2]]] & [[[p4_1<=p3_1 & 10<=p4_2] & [4<=p0_1 & p4_2<=p5_1]] | ~ [p0_1<=9]]] & [[~ [[p4_2<=p1_1 | 1<=p4_1]] | 2<=p0_2] & p5_2<=p1_1]]]] | p2_2<=4] & p3_1<=p3_1]]
normalized: ~ [E [true U ~ [[[[~ [[[[~ [[p4_2<=p1_1 | 1<=p4_1]] | 2<=p0_2] & p5_2<=p1_1] & [[~ [p0_1<=9] | [[4<=p0_1 & p4_2<=p5_1] & [p4_1<=p3_1 & 10<=p4_2]]] & [[[p3_2<=4 & 9<=p0_2] | ~ [p2_2<=p3_1]] | [~ [p0_2<=10] & p3_2<=2]]]]] & [[[[~ [p2_2<=p0_2] | [[p2_2<=2 & p0_2<=6] & [p5_1<=3 | 1<=p0_2]]] & [[[p5_2<=3 | 10<=p3_1] | [5<=p5_1 & p1_1<=p3_1]] & [[p2_1<=0 | p2_1<=p2_2] | 8<=p1_1]]] & p1_1<=4] | p3_1<=p0_2]] | p2_2<=4] & p3_1<=p3_1]]]]

abstracting: (p3_1<=p3_1)
states: 39,780 (4)
abstracting: (p2_2<=4)
states: 19,260 (4)
abstracting: (p3_1<=p0_2)
states: 37,836 (4)
abstracting: (p1_1<=4)
states: 20,304 (4)
abstracting: (8<=p1_1)
states: 11,232 (4)
abstracting: (p2_1<=p2_2)
states: 20,952 (4)
abstracting: (p2_1<=0)
states: 3,888 (3)
abstracting: (p1_1<=p3_1)
states: 6,966 (3)
abstracting: (5<=p5_1)
states: 0
abstracting: (10<=p3_1)
states: 0
abstracting: (p5_2<=3)
states: 39,780 (4)
abstracting: (1<=p0_2)
states: 35,892 (4)
abstracting: (p5_1<=3)
states: 39,780 (4)
abstracting: (p0_2<=6)
states: 25,092 (4)
abstracting: (p2_2<=2)
states: 12,096 (4)
abstracting: (p2_2<=p0_2)
states: 39,780 (4)
abstracting: (p3_2<=2)
states: 39,780 (4)
abstracting: (p0_2<=10)
states: 33,228 (4)
abstracting: (p2_2<=p3_1)
states: 6,030 (3)
abstracting: (9<=p0_2)
states: 10,080 (4)
abstracting: (p3_2<=4)
states: 39,780 (4)
abstracting: (10<=p4_2)
states: 0
abstracting: (p4_1<=p3_1)
states: 19,890 (4)
abstracting: (p4_2<=p5_1)
states: 30,940 (4)
abstracting: (4<=p0_1)
states: 23,760 (4)
abstracting: (p0_1<=9)
states: 31,716 (4)
abstracting: (p5_2<=p1_1)
states: 32,934 (4)
abstracting: (2<=p0_2)
states: 31,608 (4)
abstracting: (1<=p4_1)
states: 26,520 (4)
abstracting: (p4_2<=p1_1)
states: 35,136 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[[~ [[~ [[[p3_1<=p5_2 & p0_2<=9] & 3<=p1_1]] | [p3_2<=7 | [[[~ [p0_1<=p3_2] & p3_1<=p4_1] & [[7<=p5_2 | p2_1<=p0_1] | ~ [9<=p4_1]]] & p3_2<=p1_1]]]] | ~ [[[[[[[p0_2<=p2_2 & p1_1<=0] & ~ [5<=p0_2]] & [[6<=p4_2 & 6<=p0_2] | [6<=p3_1 | p1_2<=p4_1]]] | ~ [[[p4_1<=p1_1 | 6<=p3_2] | p3_2<=p4_1]]] & [[[10<=p4_2 & [p0_2<=7 & p3_1<=0]] | [[p0_1<=6 | 3<=p3_1] & p2_2<=p5_2]] & [[p1_1<=4 & p4_1<=p3_1] & [2<=p0_1 & [10<=p1_2 | p4_2<=p2_1]]]]] & ~ [p3_2<=10]]]] | ~ [p2_1<=4]]]
normalized: ~ [E [true U ~ [[~ [p2_1<=4] | [~ [[~ [p3_2<=10] & [[[[[10<=p1_2 | p4_2<=p2_1] & 2<=p0_1] & [p1_1<=4 & p4_1<=p3_1]] & [[[p0_1<=6 | 3<=p3_1] & p2_2<=p5_2] | [[p0_2<=7 & p3_1<=0] & 10<=p4_2]]] & [~ [[[p4_1<=p1_1 | 6<=p3_2] | p3_2<=p4_1]] | [[[6<=p3_1 | p1_2<=p4_1] | [6<=p4_2 & 6<=p0_2]] & [~ [5<=p0_2] & [p0_2<=p2_2 & p1_1<=0]]]]]]] | ~ [[[[[[~ [9<=p4_1] | [7<=p5_2 | p2_1<=p0_1]] & [~ [p0_1<=p3_2] & p3_1<=p4_1]] & p3_2<=p1_1] | p3_2<=7] | ~ [[[p3_1<=p5_2 & p0_2<=9] & 3<=p1_1]]]]]]]]]

abstracting: (3<=p1_1)
states: 26,568 (4)
abstracting: (p0_2<=9)
states: 31,716 (4)
abstracting: (p3_1<=p5_2)
states: 36,465 (4)
abstracting: (p3_2<=7)
states: 39,780 (4)
abstracting: (p3_2<=p1_1)
states: 37,458 (4)
abstracting: (p3_1<=p4_1)
states: 33,150 (4)
abstracting: (p0_1<=p3_2)
states: 6,030 (3)
abstracting: (p2_1<=p0_1)
states: 39,780 (4)
abstracting: (7<=p5_2)
states: 0
abstracting: (9<=p4_1)
states: 0
abstracting: (p1_1<=0)
states: 4,644 (3)
abstracting: (p0_2<=p2_2)
states: 39,780 (4)
abstracting: (5<=p0_2)
states: 20,520 (4)
abstracting: (6<=p0_2)
states: 17,280 (4)
abstracting: (6<=p4_2)
states: 0
abstracting: (p1_2<=p4_1)
states: 9,048 (3)
abstracting: (6<=p3_1)
states: 0
abstracting: (p3_2<=p4_1)
states: 33,150 (4)
abstracting: (6<=p3_2)
states: 0
abstracting: (p4_1<=p1_1)
states: 35,136 (4)
abstracting: (10<=p4_2)
states: 0
abstracting: (p3_1<=0)
states: 19,890 (4)
abstracting: (p0_2<=7)
states: 27,684 (4)
abstracting: (p2_2<=p5_2)
states: 10,074 (4)
abstracting: (3<=p3_1)
states: 0
abstracting: (p0_1<=6)
states: 25,092 (4)
abstracting: (p4_1<=p3_1)
states: 19,890 (4)
abstracting: (p1_1<=4)
states: 20,304 (4)
abstracting: (2<=p0_1)
states: 31,608 (4)
abstracting: (p4_2<=p2_1)
states: 35,760 (4)
abstracting: (10<=p1_2)
states: 7,308 (3)
abstracting: (p3_2<=10)
states: 39,780 (4)
abstracting: (p2_1<=4)
states: 19,260 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[[[[~ [[~ [[[p3_1<=p0_2 | p0_2<=5] & ~ [p5_2<=p4_2]]] | ~ [[1<=p5_1 & p2_1<=6]]]] & [[[8<=p0_1 & ~ [[8<=p0_2 | 4<=p5_2]]] | 7<=p1_2] | ~ [[[[7<=p4_2 | p2_2<=2] | [8<=p5_2 & 4<=p4_2]] | ~ [[p5_2<=p3_2 | p1_2<=p1_1]]]]]] | ~ [5<=p3_2]] | [[p1_1<=9 & [[[~ [p2_2<=p4_2] | [p0_1<=p0_2 & ~ [p4_2<=p3_2]]] | [~ [[2<=p2_1 | p1_2<=10]] | [p5_2<=9 | p1_2<=p3_2]]] | p4_2<=p2_2]] | ~ [[~ [[~ [p3_2<=1] & [p3_2<=p4_2 & 4<=p2_2]]] | [[7<=p0_2 & 2<=p1_2] & ~ [[p0_2<=p1_2 | p4_2<=8]]]]]]] | [[~ [[p5_1<=p5_1 | ~ [5<=p4_1]]] & ~ [[[~ [p4_2<=p1_2] & [p2_1<=4 | p3_2<=6]] & ~ [[p1_2<=p2_2 | p5_2<=10]]]]] | [~ [p4_2<=10] | ~ [[~ [[p3_1<=p1_1 | 1<=p4_2]] & p0_2<=8]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[p0_2<=8 & ~ [[p3_1<=p1_1 | 1<=p4_2]]]] | ~ [p4_2<=10]] | [~ [[~ [[p1_2<=p2_2 | p5_2<=10]] & [[p2_1<=4 | p3_2<=6] & ~ [p4_2<=p1_2]]]] & ~ [[p5_1<=p5_1 | ~ [5<=p4_1]]]]] | [[~ [[[~ [[p0_2<=p1_2 | p4_2<=8]] & [7<=p0_2 & 2<=p1_2]] | ~ [[[p3_2<=p4_2 & 4<=p2_2] & ~ [p3_2<=1]]]]] | [p1_1<=9 & [p4_2<=p2_2 | [[[p5_2<=9 | p1_2<=p3_2] | ~ [[2<=p2_1 | p1_2<=10]]] | [[p0_1<=p0_2 & ~ [p4_2<=p3_2]] | ~ [p2_2<=p4_2]]]]]] | [~ [5<=p3_2] | [[~ [[~ [[p5_2<=p3_2 | p1_2<=p1_1]] | [[8<=p5_2 & 4<=p4_2] | [7<=p4_2 | p2_2<=2]]]] | [7<=p1_2 | [8<=p0_1 & ~ [[8<=p0_2 | 4<=p5_2]]]]] & ~ [[~ [[1<=p5_1 & p2_1<=6]] | ~ [[~ [p5_2<=p4_2] & [p3_1<=p0_2 | p0_2<=5]]]]]]]]]]]]

abstracting: (p0_2<=5)
states: 22,500 (4)
abstracting: (p3_1<=p0_2)
states: 37,836 (4)
abstracting: (p5_2<=p4_2)
states: 19,890 (4)
abstracting: (p2_1<=6)
states: 25,092 (4)
abstracting: (1<=p5_1)
states: 33,150 (4)
abstracting: (4<=p5_2)
states: 0
abstracting: (8<=p0_2)
states: 12,096 (4)
abstracting: (8<=p0_1)
states: 12,096 (4)
abstracting: (7<=p1_2)
states: 13,752 (4)
abstracting: (p2_2<=2)
states: 12,096 (4)
abstracting: (7<=p4_2)
states: 0
abstracting: (4<=p4_2)
states: 0
abstracting: (8<=p5_2)
states: 0
abstracting: (p1_2<=p1_1)
states: 21,168 (4)
abstracting: (p5_2<=p3_2)
states: 13,260 (4)
abstracting: (5<=p3_2)
states: 0
abstracting: (p2_2<=p4_2)
states: 8,052 (3)
abstracting: (p4_2<=p3_2)
states: 19,890 (4)
abstracting: (p0_1<=p0_2)
states: 20,952 (4)
abstracting: (p1_2<=10)
states: 33,948 (4)
abstracting: (2<=p2_1)
states: 31,608 (4)
abstracting: (p1_2<=p3_2)
states: 6,966 (3)
abstracting: (p5_2<=9)
states: 39,780 (4)
abstracting: (p4_2<=p2_2)
states: 35,760 (4)
abstracting: (p1_1<=9)
states: 32,472 (4)
abstracting: (p3_2<=1)
states: 39,780 (4)
abstracting: (4<=p2_2)
states: 23,760 (4)
abstracting: (p3_2<=p4_2)
states: 33,150 (4)
abstracting: (2<=p1_2)
states: 30,492 (4)
abstracting: (7<=p0_2)
states: 14,688 (4)
abstracting: (p4_2<=8)
states: 39,780 (4)
abstracting: (p0_2<=p1_2)
states: 19,332 (4)
abstracting: (5<=p4_1)
states: 0
abstracting: (p5_1<=p5_1)
states: 39,780 (4)
abstracting: (p4_2<=p1_2)
states: 35,136 (4)
abstracting: (p3_2<=6)
states: 39,780 (4)
abstracting: (p2_1<=4)
states: 19,260 (4)
abstracting: (p5_2<=10)
states: 39,780 (4)
abstracting: (p1_2<=p2_2)
states: 20,448 (4)
abstracting: (p4_2<=10)
states: 39,780 (4)
abstracting: (1<=p4_2)
states: 26,520 (4)
abstracting: (p3_1<=p1_1)
states: 37,458 (4)
abstracting: (p0_2<=8)
states: 29,700 (4)
-> the formula is TRUE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [~ [[[[[p3_2<=p3_2 & [6<=p1_2 & [[p5_1<=p2_1 & 8<=p0_1] | [[p0_1<=p3_2 | p2_2<=p0_1] & [p2_2<=9 | p1_1<=1]]]]] & [~ [7<=p0_2] | p5_1<=3]] & [[p1_2<=2 | [~ [[[p0_1<=p4_1 | 4<=p3_2] & ~ [10<=p4_2]]] & [~ [[8<=p5_1 | p3_2<=10]] | [[5<=p3_2 & p4_2<=0] | [p0_2<=6 & p4_2<=p5_2]]]]] | ~ [[[[[5<=p2_2 | p5_2<=5] & ~ [p4_2<=p1_1]] | ~ [7<=p3_1]] | [[p3_1<=p5_1 | [2<=p4_1 & p1_2<=p1_1]] & ~ [p3_1<=9]]]]]] | ~ [[[[[~ [[2<=p3_2 & p1_1<=p0_1]] | [~ [p2_1<=7] | p5_2<=2]] & ~ [p3_2<=3]] & [~ [[[p3_2<=p1_2 & p4_2<=9] & p4_1<=3]] & [~ [5<=p5_2] | [[1<=p0_1 & 3<=p5_1] | ~ [p3_1<=9]]]]] & [~ [[p4_1<=8 & [[p5_1<=p0_1 & 5<=p5_1] | [p2_1<=p3_1 | p3_1<=p2_1]]]] & ~ [[p4_1<=4 & [[p3_2<=5 | p0_2<=7] | [p5_2<=10 | p2_1<=p1_2]]]]]]]]]]
normalized: E [true U ~ [[~ [[[~ [[p4_1<=4 & [[p5_2<=10 | p2_1<=p1_2] | [p3_2<=5 | p0_2<=7]]]] & ~ [[p4_1<=8 & [[p2_1<=p3_1 | p3_1<=p2_1] | [p5_1<=p0_1 & 5<=p5_1]]]]] & [[[[~ [p3_1<=9] | [1<=p0_1 & 3<=p5_1]] | ~ [5<=p5_2]] & ~ [[p4_1<=3 & [p3_2<=p1_2 & p4_2<=9]]]] & [~ [p3_2<=3] & [[p5_2<=2 | ~ [p2_1<=7]] | ~ [[2<=p3_2 & p1_1<=p0_1]]]]]]] | [[~ [[[~ [p3_1<=9] & [p3_1<=p5_1 | [2<=p4_1 & p1_2<=p1_1]]] | [~ [7<=p3_1] | [~ [p4_2<=p1_1] & [5<=p2_2 | p5_2<=5]]]]] | [p1_2<=2 | [[[[p0_2<=6 & p4_2<=p5_2] | [5<=p3_2 & p4_2<=0]] | ~ [[8<=p5_1 | p3_2<=10]]] & ~ [[~ [10<=p4_2] & [p0_1<=p4_1 | 4<=p3_2]]]]]] & [[p5_1<=3 | ~ [7<=p0_2]] & [p3_2<=p3_2 & [6<=p1_2 & [[[p2_2<=9 | p1_1<=1] & [p0_1<=p3_2 | p2_2<=p0_1]] | [p5_1<=p2_1 & 8<=p0_1]]]]]]]]]

abstracting: (8<=p0_1)
states: 12,096 (4)
abstracting: (p5_1<=p2_1)
states: 33,744 (4)
abstracting: (p2_2<=p0_1)
states: 20,952 (4)
abstracting: (p0_1<=p3_2)
states: 6,030 (3)
abstracting: (p1_1<=1)
states: 9,288 (3)
abstracting: (p2_2<=9)
states: 31,716 (4)
abstracting: (6<=p1_2)
states: 16,308 (4)
abstracting: (p3_2<=p3_2)
states: 39,780 (4)
abstracting: (7<=p0_2)
states: 14,688 (4)
abstracting: (p5_1<=3)
states: 39,780 (4)
abstracting: (4<=p3_2)
states: 0
abstracting: (p0_1<=p4_1)
states: 8,052 (3)
abstracting: (10<=p4_2)
states: 0
abstracting: (p3_2<=10)
states: 39,780 (4)
abstracting: (8<=p5_1)
states: 0
abstracting: (p4_2<=0)
states: 13,260 (4)
abstracting: (5<=p3_2)
states: 0
abstracting: (p4_2<=p5_2)
states: 26,520 (4)
abstracting: (p0_2<=6)
states: 25,092 (4)
abstracting: (p1_2<=2)
states: 13,212 (4)
abstracting: (p5_2<=5)
states: 39,780 (4)
abstracting: (5<=p2_2)
states: 20,520 (4)
abstracting: (p4_2<=p1_1)
states: 35,136 (4)
abstracting: (7<=p3_1)
states: 0
abstracting: (p1_2<=p1_1)
states: 21,168 (4)
abstracting: (2<=p4_1)
states: 13,260 (4)
abstracting: (p3_1<=p5_1)
states: 33,150 (4)
abstracting: (p3_1<=9)
states: 39,780 (4)
abstracting: (p1_1<=p0_1)
states: 20,448 (4)
abstracting: (2<=p3_2)
states: 0
abstracting: (p2_1<=7)
states: 27,684 (4)
abstracting: (p5_2<=2)
states: 33,150 (4)
abstracting: (p3_2<=3)
states: 39,780 (4)
abstracting: (p4_2<=9)
states: 39,780 (4)
abstracting: (p3_2<=p1_2)
states: 37,458 (4)
abstracting: (p4_1<=3)
states: 39,780 (4)
abstracting: (5<=p5_2)
states: 0
abstracting: (3<=p5_1)
states: 6,630 (3)
abstracting: (1<=p0_1)
states: 35,892 (4)
abstracting: (p3_1<=9)
states: 39,780 (4)
abstracting: (5<=p5_1)
states: 0
abstracting: (p5_1<=p0_1)
states: 33,744 (4)
abstracting: (p3_1<=p2_1)
states: 37,836 (4)
abstracting: (p2_1<=p3_1)
states: 6,030 (3)
abstracting: (p4_1<=8)
states: 39,780 (4)
abstracting: (p0_2<=7)
states: 27,684 (4)
abstracting: (p3_2<=5)
states: 39,780 (4)
abstracting: (p2_1<=p1_2)
states: 20,520 (4)
abstracting: (p5_2<=10)
states: 39,780 (4)
abstracting: (p4_1<=4)
states: 39,780 (4)
-> the formula is FALSE

FORMULA Murphy-PT-D1N010-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 19719 (2.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 30297 17252 47549
used/not used/entry size/cache size: 24772 67084092 16 1024MB
basic ops cache: hits/miss/sum: 42201 39341 81542
used/not used/entry size/cache size: 70246 16706970 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 8397 3707 12104
used/not used/entry size/cache size: 3707 8384901 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67092082
1 15920
2 598
3 88
4 55
5 32
6 6
7 9
8 7
9 4
>= 10 63

Total processing time: 0m 4.526sec


BK_STOP 1679894036326

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:277 (19), effective:98 (7)

initing FirstDep: 0m 0.000sec


iterations count:110 (7), effective:36 (2)

iterations count:14 (1), effective:0 (0)

iterations count:17 (1), effective:1 (0)

iterations count:193 (13), effective:57 (4)

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="Murphy-PT-D1N010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool marcie"
echo " Input is Murphy-PT-D1N010, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987240900334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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