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-167987241000366.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-D4N025, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241000366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.3K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.7K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 22K 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-D4N025-ReachabilityCardinality-00
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-01
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-02
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-03
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-04
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-05
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-06
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-07
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-08
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-09
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-10
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-11
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-12
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-13
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-14
FORMULA_NAME Murphy-PT-D4N025-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679895245397

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-D4N025
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_D4_N25
(NrP: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.819sec


RS generation: 0m 9.976sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: EF [20<=p4_2]
normalized: E [true U 20<=p4_2]

abstracting: (20<=p4_2)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (9<=p3_4)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.007sec

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

abstracting: (p4_1<=p1_1)
states: 18,730,716,094,531,584 (16)
-> the formula is FALSE

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

MC time: 0m 3.271sec

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

abstracting: (p1_5<=p5_1)
states: 3,082,348,425,192,192 (15)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.706sec

checking: EF [p4_2<=p4_1]
normalized: E [true U p4_2<=p4_1]

abstracting: (p4_2<=p4_1)
states: 13,341,737,539,113,984 (16)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.595sec

checking: AG [~ [[14<=p3_4 & [22<=p5_1 & p0_2<=7]]]]
normalized: ~ [E [true U [14<=p3_4 & [22<=p5_1 & p0_2<=7]]]]

abstracting: (p0_2<=7)
states: 8,458,955,548,932,096 (15)
abstracting: (22<=p5_1)
states: 0
abstracting: (14<=p3_4)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EF [[2<=p5_5 & p2_4<=p1_1]]
normalized: E [true U [2<=p5_5 & p2_4<=p1_1]]

abstracting: (p2_4<=p1_1)
states: 10,340,264,818,211,328 (16)
abstracting: (2<=p5_5)
states: 10,006,303,154,335,488 (16)
-> the formula is TRUE

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

MC time: 0m18.471sec

checking: EF [[~ [[p3_3<=p1_3 | p1_4<=p0_3]] & 4<=p3_3]]
normalized: E [true U [4<=p3_3 & ~ [[p3_3<=p1_3 | p1_4<=p0_3]]]]

abstracting: (p1_4<=p0_3)
states: 10,340,302,342,076,928 (16)
abstracting: (p3_3<=p1_3)
states: 19,346,687,147,563,776 (16)
abstracting: (4<=p3_3)
states: 0
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.427sec

checking: EF [~ [[[~ [[[~ [p5_4<=16] | ~ [[~ [p4_4<=p5_4] & [p4_3<=p4_3 & p0_2<=p4_2]]]] | p2_4<=p2_5]] & ~ [[p3_3<=4 | [22<=p0_3 & ~ [p4_2<=p2_2]]]]] | 3<=p1_3]]]
normalized: E [true U ~ [[3<=p1_3 | [~ [[p3_3<=4 | [22<=p0_3 & ~ [p4_2<=p2_2]]]] & ~ [[p2_4<=p2_5 | [~ [[[p4_3<=p4_3 & p0_2<=p4_2] & ~ [p4_4<=p5_4]]] | ~ [p5_4<=16]]]]]]]]

abstracting: (p5_4<=16)
states: 20,012,606,308,670,976 (16)
abstracting: (p4_4<=p5_4)
states: 13,341,737,539,113,984 (16)
abstracting: (p0_2<=p4_2)
states: 2,513,797,122,710,016 (15)
abstracting: (p4_3<=p4_3)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_4<=p2_5)
states: 10,340,271,134,189,568 (16)
abstracting: (p4_2<=p2_2)
states: 18,730,738,897,288,704 (16)
abstracting: (22<=p0_3)
states: 4,042,174,270,432,320 (15)
abstracting: (p3_3<=4)
states: 20,012,606,308,670,976 (16)
abstracting: (3<=p1_3)
states: 16,316,781,478,493,184 (16)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.696sec

checking: AG [[~ [[~ [[[~ [[~ [5<=p3_5] | p0_1<=24]] & p0_1<=11] | ~ [[[~ [p4_4<=p1_3] | [p4_3<=18 & 20<=p1_3]] & p2_3<=p5_4]]]] & [[~ [17<=p0_3] & [~ [[~ [p4_5<=p4_5] & ~ [p2_4<=p2_5]]] & ~ [18<=p4_1]]] & [[6<=p2_2 & [[~ [p1_4<=7] & [p3_3<=p5_4 | 16<=p3_5]] & 4<=p2_5]] & p3_2<=24]]]] | ~ [p4_4<=p1_2]]]
normalized: ~ [E [true U ~ [[~ [p4_4<=p1_2] | ~ [[[[p3_2<=24 & [6<=p2_2 & [4<=p2_5 & [[p3_3<=p5_4 | 16<=p3_5] & ~ [p1_4<=7]]]]] & [[~ [18<=p4_1] & ~ [[~ [p2_4<=p2_5] & ~ [p4_5<=p4_5]]]] & ~ [17<=p0_3]]] & ~ [[~ [[p2_3<=p5_4 & [[p4_3<=18 & 20<=p1_3] | ~ [p4_4<=p1_3]]]] | [p0_1<=11 & ~ [[p0_1<=24 | ~ [5<=p3_5]]]]]]]]]]]]

abstracting: (5<=p3_5)
states: 0
abstracting: (p0_1<=24)
states: 16,848,391,412,248,704 (16)
abstracting: (p0_1<=11)
states: 11,348,213,794,613,856 (16)
abstracting: (p4_4<=p1_3)
states: 18,730,716,094,531,584 (16)
abstracting: (20<=p1_3)
states: 4,732,794,534,042,432 (15)
abstracting: (p4_3<=18)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_3<=p5_4)
states: 3,082,313,037,652,992 (15)
abstracting: (17<=p0_3)
states: 5,950,558,423,227,456 (15)
abstracting: (p4_5<=p4_5)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_4<=p2_5)
states: 10,340,271,134,189,568 (16)
abstracting: (18<=p4_1)
states: 0
abstracting: (p1_4<=7)
states: 8,458,986,752,184,960 (15)
abstracting: (16<=p3_5)
states: 0
abstracting: (p3_3<=p5_4)
states: 18,344,889,116,281,728 (16)
abstracting: (4<=p2_5)
states: 15,269,703,720,860,160 (16)
abstracting: (6<=p2_2)
states: 13,296,692,284,761,600 (16)
abstracting: (p3_2<=24)
states: 20,012,606,308,670,976 (16)
abstracting: (p4_4<=p1_2)
states: 18,730,716,094,531,584 (16)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.847sec

checking: EF [[~ [p0_5<=18] & ~ [[[[[[[[p5_4<=p0_2 & 25<=p1_4] | [4<=p5_5 | p4_4<=3]] & p1_2<=8] | [[[p2_2<=p5_3 | 13<=p4_1] & [p0_5<=p4_3 & p5_1<=12]] & p0_3<=0]] & [~ [[p4_4<=8 | [p0_2<=p2_3 | p0_3<=p4_2]]] | ~ [[p5_3<=12 & p0_3<=23]]]] | ~ [p0_3<=p5_4]] & p1_5<=p3_3]]]]
normalized: E [true U [~ [[p1_5<=p3_3 & [~ [p0_3<=p5_4] | [[~ [[p5_3<=12 & p0_3<=23]] | ~ [[p4_4<=8 | [p0_2<=p2_3 | p0_3<=p4_2]]]] & [[p0_3<=0 & [[p0_5<=p4_3 & p5_1<=12] & [p2_2<=p5_3 | 13<=p4_1]]] | [p1_2<=8 & [[4<=p5_5 | p4_4<=3] | [p5_4<=p0_2 & 25<=p1_4]]]]]]]] & ~ [p0_5<=18]]]

abstracting: (p0_5<=18)
states: 14,910,289,226,975,232 (16)
abstracting: (25<=p1_4)
states: 3,164,197,804,649,856 (15)
abstracting: (p5_4<=p0_2)
states: 18,114,774,041,624,832 (16)
abstracting: (p4_4<=3)
states: 20,012,606,308,670,976 (16)
abstracting: (4<=p5_5)
states: 0
abstracting: (p1_2<=8)
states: 9,276,128,676,968,832 (15)
abstracting: (13<=p4_1)
states: 0
abstracting: (p2_2<=p5_3)
states: 3,082,313,037,652,992 (15)
abstracting: (p5_1<=12)
states: 20,012,606,308,670,976 (16)
abstracting: (p0_5<=p4_3)
states: 2,513,797,122,710,016 (15)
abstracting: (p0_3<=0)
states: 1,331,807,098,152,960 (15)
abstracting: (p0_3<=p4_2)
states: 2,513,797,122,710,016 (15)
abstracting: (p0_2<=p2_3)
states: 10,340,271,134,189,568 (16)
abstracting: (p4_4<=8)
states: 20,012,606,308,670,976 (16)
abstracting: (p0_3<=23)
states: 16,569,981,528,002,496 (16)
abstracting: (p5_3<=12)
states: 20,012,606,308,670,976 (16)
abstracting: (p0_3<=p5_4)
states: 3,082,313,037,652,992 (15)
abstracting: (p1_5<=p3_3)
states: 1,922,835,321,209,088 (15)
-> the formula is TRUE

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

MC time: 0m29.513sec

checking: AG [[p1_5<=4 | [[[[~ [24<=p4_3] | ~ [[~ [[24<=p0_2 | p0_5<=11]] | ~ [[24<=p5_3 | p3_5<=11]]]]] | p1_5<=p1_4] | 19<=p3_4] | [~ [[[[~ [[10<=p4_2 | 17<=p1_2]] & 2<=p3_2] & p5_1<=12] | p0_5<=p2_4]] & [p2_3<=11 | [~ [[[~ [p3_5<=15] & ~ [p5_3<=10]] & p1_3<=21]] & [~ [p3_4<=4] & ~ [[[p2_1<=p0_1 & p1_3<=p0_3] & [p2_2<=p5_5 | 3<=p5_3]]]]]]]]]]
normalized: ~ [E [true U ~ [[p1_5<=4 | [[[p2_3<=11 | [[~ [[[p2_2<=p5_5 | 3<=p5_3] & [p2_1<=p0_1 & p1_3<=p0_3]]] & ~ [p3_4<=4]] & ~ [[p1_3<=21 & [~ [p5_3<=10] & ~ [p3_5<=15]]]]]] & ~ [[p0_5<=p2_4 | [p5_1<=12 & [2<=p3_2 & ~ [[10<=p4_2 | 17<=p1_2]]]]]]] | [19<=p3_4 | [p1_5<=p1_4 | [~ [[~ [[24<=p5_3 | p3_5<=11]] | ~ [[24<=p0_2 | p0_5<=11]]]] | ~ [24<=p4_3]]]]]]]]]

abstracting: (24<=p4_3)
states: 0
abstracting: (p0_5<=11)
states: 11,348,213,794,613,856 (16)
abstracting: (24<=p0_2)
states: 3,442,624,780,668,480 (15)
abstracting: (p3_5<=11)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p5_3)
states: 0
abstracting: (p1_5<=p1_4)
states: 10,340,284,138,398,720 (16)
abstracting: (19<=p3_4)
states: 0
abstracting: (17<=p1_2)
states: 5,950,535,723,543,808 (15)
abstracting: (10<=p4_2)
states: 0
abstracting: (2<=p3_2)
states: 0
abstracting: (p5_1<=12)
states: 20,012,606,308,670,976 (16)
abstracting: (p0_5<=p2_4)
states: 10,340,271,134,189,568 (16)
abstracting: (p3_5<=15)
states: 20,012,606,308,670,976 (16)
abstracting: (p5_3<=10)
states: 20,012,606,308,670,976 (16)
abstracting: (p1_3<=21)
states: 15,970,451,557,553,856 (16)
abstracting: (p3_4<=4)
states: 20,012,606,308,670,976 (16)
abstracting: (p1_3<=p0_3)
states: 10,672,240,907,547,648 (16)
abstracting: (p2_1<=p0_1)
states: 20,012,606,308,670,976 (16)
abstracting: (3<=p5_3)
states: 3,335,434,384,778,496 (15)
abstracting: (p2_2<=p5_5)
states: 3,082,313,037,652,992 (15)
abstracting: (p2_3<=11)
states: 11,348,213,794,613,856 (16)
abstracting: (p1_5<=4)
states: 5,790,049,604,845,056 (15)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.410sec

checking: EF [[11<=p2_4 | ~ [[~ [[[[[21<=p0_5 & 5<=p1_5] & [p2_5<=p3_1 & p1_5<=p4_3]] | [~ [p0_5<=p5_2] | [p0_2<=p0_2 & 25<=p3_3]]] | ~ [[p2_5<=4 & 2<=p1_3]]]] | ~ [[~ [20<=p1_1] & [[[~ [p0_3<=24] | [p4_1<=p5_5 & 10<=p2_1]] & [12<=p2_4 | ~ [p5_3<=p2_2]]] & [[~ [p2_1<=21] & [p3_3<=p2_3 | 4<=p1_2]] & [~ [16<=p5_5] & [p0_2<=p4_3 & p0_3<=10]]]]]]]]]]
normalized: E [true U [11<=p2_4 | ~ [[~ [[[[[[p0_2<=p4_3 & p0_3<=10] & ~ [16<=p5_5]] & [[p3_3<=p2_3 | 4<=p1_2] & ~ [p2_1<=21]]] & [[12<=p2_4 | ~ [p5_3<=p2_2]] & [[p4_1<=p5_5 & 10<=p2_1] | ~ [p0_3<=24]]]] & ~ [20<=p1_1]]] | ~ [[~ [[p2_5<=4 & 2<=p1_3]] | [[[p0_2<=p0_2 & 25<=p3_3] | ~ [p0_5<=p5_2]] | [[p2_5<=p3_1 & p1_5<=p4_3] & [21<=p0_5 & 5<=p1_5]]]]]]]]]

abstracting: (5<=p1_5)
states: 14,222,556,703,825,920 (16)
abstracting: (21<=p0_5)
states: 4,363,313,875,949,952 (15)
abstracting: (p1_5<=p4_3)
states: 2,513,831,824,198,656 (15)
abstracting: (p2_5<=p3_1)
states: 1,922,801,117,073,408 (15)
abstracting: (p0_5<=p5_2)
states: 3,082,313,037,652,992 (15)
abstracting: (25<=p3_3)
states: 0
abstracting: (p0_2<=p0_2)
states: 20,012,606,308,670,976 (16)
abstracting: (2<=p1_3)
states: 17,498,773,988,467,200 (16)
abstracting: (p2_5<=4)
states: 5,790,016,041,638,400 (15)
abstracting: (20<=p1_1)
states: 4,732,794,534,042,432 (15)
abstracting: (p0_3<=24)
states: 16,848,391,412,248,704 (16)
abstracting: (10<=p2_1)
states: 10,016,771,696,294,400 (16)
abstracting: (p4_1<=p5_5)
states: 15,565,360,462,299,648 (16)
abstracting: (p5_3<=p2_2)
states: 18,114,774,041,624,832 (16)
abstracting: (12<=p2_4)
states: 8,664,392,514,057,120 (15)
abstracting: (p2_1<=21)
states: 15,970,432,038,238,656 (16)
abstracting: (4<=p1_2)
states: 15,269,668,380,495,360 (16)
abstracting: (p3_3<=p2_3)
states: 19,346,702,759,594,496 (16)
abstracting: (16<=p5_5)
states: 0
abstracting: (p0_3<=10)
states: 10,715,570,133,069,312 (16)
abstracting: (p0_2<=p4_3)
states: 2,513,797,122,710,016 (15)
abstracting: (11<=p2_4)
states: 9,297,036,175,601,664 (15)
-> the formula is TRUE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.914sec

checking: AG [~ [[[[[~ [[[~ [p4_2<=p4_2] | [24<=p3_1 & p3_3<=15]] & ~ [[p3_4<=p5_2 & p0_2<=20]]]] & p4_3<=p2_1] | [[p1_5<=19 | [p3_2<=p2_5 | ~ [p4_2<=18]]] & p5_4<=2]] | ~ [1<=p2_3]] & ~ [[~ [[[p5_5<=p2_2 | [4<=p2_1 | p5_3<=p4_3]] & 9<=p5_1]] | [~ [[[~ [1<=p2_1] | [p1_1<=23 & 16<=p1_3]] | [1<=p4_4 & [p0_2<=23 | 20<=p1_4]]]] & [[~ [[12<=p4_2 | 25<=p2_3]] & p0_1<=13] | p1_5<=p5_3]]]]]]]
normalized: ~ [E [true U [~ [[[[p1_5<=p5_3 | [p0_1<=13 & ~ [[12<=p4_2 | 25<=p2_3]]]] & ~ [[[1<=p4_4 & [p0_2<=23 | 20<=p1_4]] | [[p1_1<=23 & 16<=p1_3] | ~ [1<=p2_1]]]]] | ~ [[9<=p5_1 & [p5_5<=p2_2 | [4<=p2_1 | p5_3<=p4_3]]]]]] & [~ [1<=p2_3] | [[p5_4<=2 & [p1_5<=19 | [p3_2<=p2_5 | ~ [p4_2<=18]]]] | [p4_3<=p2_1 & ~ [[~ [[p3_4<=p5_2 & p0_2<=20]] & [[24<=p3_1 & p3_3<=15] | ~ [p4_2<=p4_2]]]]]]]]]]

abstracting: (p4_2<=p4_2)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_3<=15)
states: 20,012,606,308,670,976 (16)
abstracting: (24<=p3_1)
states: 0
abstracting: (p0_2<=20)
states: 15,649,292,432,721,024 (16)
abstracting: (p3_4<=p5_2)
states: 18,344,889,116,281,728 (16)
abstracting: (p4_3<=p2_1)
states: 18,730,738,897,288,704 (16)
abstracting: (p4_2<=18)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_2<=p2_5)
states: 19,346,702,759,594,496 (16)
abstracting: (p1_5<=19)
states: 15,279,811,774,628,544 (16)
abstracting: (p5_4<=2)
states: 16,677,171,923,892,480 (16)
abstracting: (1<=p2_3)
states: 18,680,799,210,518,016 (16)
abstracting: (p5_3<=p4_3)
states: 10,006,303,154,335,488 (16)
abstracting: (4<=p2_1)
states: 15,269,703,720,860,160 (16)
abstracting: (p5_5<=p2_2)
states: 18,114,774,041,624,832 (16)
abstracting: (9<=p5_1)
states: 0
abstracting: (1<=p2_1)
states: 18,680,799,210,518,016 (16)
abstracting: (16<=p1_3)
states: 6,436,212,726,318,624 (15)
abstracting: (p1_1<=23)
states: 16,569,999,695,848,896 (16)
abstracting: (20<=p1_4)
states: 4,732,794,534,042,432 (15)
abstracting: (p0_2<=23)
states: 16,569,981,528,002,496 (16)
abstracting: (1<=p4_4)
states: 13,341,737,539,113,984 (16)
abstracting: (25<=p2_3)
states: 3,164,214,896,422,272 (15)
abstracting: (12<=p4_2)
states: 0
abstracting: (p0_1<=13)
states: 12,535,774,339,356,576 (16)
abstracting: (p1_5<=p5_3)
states: 3,082,348,425,192,192 (15)
-> the formula is TRUE

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

MC time: 0m 1.667sec

checking: EF [~ [[[[[~ [[~ [[p1_4<=15 & p1_1<=p1_1]] & ~ [[p5_4<=4 | 14<=p4_4]]]] & p3_4<=p2_4] | [p2_1<=25 & [[p1_1<=p1_5 & [20<=p2_3 | [p4_3<=p1_5 | p5_2<=p3_3]]] & ~ [[15<=p0_3 | [p5_3<=p0_4 | p2_5<=p3_4]]]]]] | [1<=p4_4 & [p3_1<=19 & [~ [[p3_4<=p1_2 & p0_5<=8]] & [~ [[p4_3<=p0_5 & 12<=p2_4]] | [[p4_1<=p5_5 | p0_4<=15] | [4<=p3_2 | p2_5<=p4_3]]]]]]] | [[p3_4<=16 | ~ [p3_5<=p4_2]] & p4_1<=16]]]]
normalized: E [true U ~ [[[p4_1<=16 & [p3_4<=16 | ~ [p3_5<=p4_2]]] | [[1<=p4_4 & [p3_1<=19 & [[[[4<=p3_2 | p2_5<=p4_3] | [p4_1<=p5_5 | p0_4<=15]] | ~ [[p4_3<=p0_5 & 12<=p2_4]]] & ~ [[p3_4<=p1_2 & p0_5<=8]]]]] | [[p2_1<=25 & [~ [[15<=p0_3 | [p5_3<=p0_4 | p2_5<=p3_4]]] & [p1_1<=p1_5 & [20<=p2_3 | [p4_3<=p1_5 | p5_2<=p3_3]]]]] | [p3_4<=p2_4 & ~ [[~ [[p5_4<=4 | 14<=p4_4]] & ~ [[p1_4<=15 & p1_1<=p1_1]]]]]]]]]]

abstracting: (p1_1<=p1_1)
states: 20,012,606,308,670,976 (16)
abstracting: (p1_4<=15)
states: 13,576,393,582,352,352 (16)
abstracting: (14<=p4_4)
states: 0
abstracting: (p5_4<=4)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_4<=p2_4)
states: 19,346,702,759,594,496 (16)
abstracting: (p5_2<=p3_3)
states: 6,670,868,769,556,992 (15)
abstracting: (p4_3<=p1_5)
states: 18,730,716,094,531,584 (16)
abstracting: (20<=p2_3)
states: 4,732,815,478,822,848 (15)
abstracting: (p1_1<=p1_5)
states: 10,340,284,138,398,720 (16)
abstracting: (p2_5<=p3_4)
states: 1,922,801,117,073,408 (15)
abstracting: (p5_3<=p0_4)
states: 18,114,774,041,624,832 (16)
abstracting: (15<=p0_3)
states: 6,921,915,086,116,224 (15)
abstracting: (p2_1<=25)
states: 17,089,131,942,121,536 (16)
abstracting: (p0_5<=8)
states: 9,276,099,091,683,840 (15)
abstracting: (p3_4<=p1_2)
states: 19,346,687,147,563,776 (16)
abstracting: (12<=p2_4)
states: 8,664,392,514,057,120 (15)
abstracting: (p4_3<=p0_5)
states: 18,730,738,897,288,704 (16)
abstracting: (p0_4<=15)
states: 13,576,369,553,999,136 (16)
abstracting: (p4_1<=p5_5)
states: 15,565,360,462,299,648 (16)
abstracting: (p2_5<=p4_3)
states: 2,513,797,122,710,016 (15)
abstracting: (4<=p3_2)
states: 0
abstracting: (p3_1<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (1<=p4_4)
states: 13,341,737,539,113,984 (16)
abstracting: (p3_5<=p4_2)
states: 16,677,171,923,892,480 (16)
abstracting: (p3_4<=16)
states: 20,012,606,308,670,976 (16)
abstracting: (p4_1<=16)
states: 20,012,606,308,670,976 (16)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.924sec

checking: EF [[[[~ [[[~ [[~ [9<=p2_3] & [25<=p5_1 & 24<=p4_1]]] | [[~ [p0_1<=3] & ~ [p3_2<=16]] | [p0_3<=p1_5 & ~ [p3_5<=20]]]] | [[[[p5_1<=p3_1 & p1_3<=p0_2] | [p3_4<=p4_5 | p5_1<=11]] | [~ [p0_3<=13] | [14<=p1_1 & 8<=p5_5]]] & ~ [[[p2_1<=18 & p2_3<=p2_4] & p5_1<=p1_2]]]]] & 18<=p0_5] & p2_1<=5] & ~ [[[[~ [p3_4<=p1_5] & p3_1<=23] & [14<=p3_2 | [[p4_3<=19 | [p3_1<=6 & p3_1<=p0_1]] | 12<=p4_4]]] | [[[[[~ [14<=p5_1] | p5_3<=21] | [[p4_1<=24 | p2_4<=p5_2] & [7<=p3_3 | 9<=p3_1]]] | [[p4_3<=p5_1 | ~ [p2_4<=18]] & p2_3<=p2_1]] | ~ [[[~ [p0_5<=2] & p1_5<=p5_4] & [[p3_2<=p1_1 | p1_4<=p4_4] | 1<=p0_3]]]] | p0_1<=p1_1]]]]]
normalized: E [true U [~ [[[p0_1<=p1_1 | [~ [[[1<=p0_3 | [p3_2<=p1_1 | p1_4<=p4_4]] & [p1_5<=p5_4 & ~ [p0_5<=2]]]] | [[p2_3<=p2_1 & [p4_3<=p5_1 | ~ [p2_4<=18]]] | [[[7<=p3_3 | 9<=p3_1] & [p4_1<=24 | p2_4<=p5_2]] | [p5_3<=21 | ~ [14<=p5_1]]]]]] | [[14<=p3_2 | [12<=p4_4 | [p4_3<=19 | [p3_1<=6 & p3_1<=p0_1]]]] & [p3_1<=23 & ~ [p3_4<=p1_5]]]]] & [p2_1<=5 & [18<=p0_5 & ~ [[[~ [[p5_1<=p1_2 & [p2_1<=18 & p2_3<=p2_4]]] & [[[14<=p1_1 & 8<=p5_5] | ~ [p0_3<=13]] | [[p3_4<=p4_5 | p5_1<=11] | [p5_1<=p3_1 & p1_3<=p0_2]]]] | [[[p0_3<=p1_5 & ~ [p3_5<=20]] | [~ [p3_2<=16] & ~ [p0_1<=3]]] | ~ [[[25<=p5_1 & 24<=p4_1] & ~ [9<=p2_3]]]]]]]]]]

abstracting: (9<=p2_3)
states: 10,736,507,216,987,136 (16)
abstracting: (24<=p4_1)
states: 0
abstracting: (25<=p5_1)
states: 0
abstracting: (p0_1<=3)
states: 4,742,902,587,810,816 (15)
abstracting: (p3_2<=16)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_5<=20)
states: 20,012,606,308,670,976 (16)
abstracting: (p0_3<=p1_5)
states: 10,340,264,818,211,328 (16)
abstracting: (p1_3<=p0_2)
states: 10,340,302,342,076,928 (16)
abstracting: (p5_1<=p3_1)
states: 6,670,868,769,556,992 (15)
abstracting: (p5_1<=11)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_4<=p4_5)
states: 16,677,171,923,892,480 (16)
abstracting: (p0_3<=13)
states: 12,535,774,339,356,576 (16)
abstracting: (8<=p5_5)
states: 0
abstracting: (14<=p1_1)
states: 7,476,806,277,410,400 (15)
abstracting: (p2_3<=p2_4)
states: 10,340,271,134,189,568 (16)
abstracting: (p2_1<=18)
states: 14,910,289,226,975,232 (16)
abstracting: (p5_1<=p1_2)
states: 18,114,745,289,501,952 (16)
abstracting: (18<=p0_5)
states: 5,526,437,752,461,600 (15)
abstracting: (p2_1<=5)
states: 6,715,914,023,909,376 (15)
abstracting: (p3_4<=p1_5)
states: 19,346,687,147,563,776 (16)
abstracting: (p3_1<=23)
states: 20,012,606,308,670,976 (16)
abstracting: (p3_1<=p0_1)
states: 19,346,702,759,594,496 (16)
abstracting: (p3_1<=6)
states: 20,012,606,308,670,976 (16)
abstracting: (p4_3<=19)
states: 20,012,606,308,670,976 (16)
abstracting: (12<=p4_4)
states: 0
abstracting: (14<=p3_2)
states: 0
abstracting: (14<=p5_1)
states: 0
abstracting: (p5_3<=21)
states: 20,012,606,308,670,976 (16)
abstracting: (p2_4<=p5_2)
states: 3,082,313,037,652,992 (15)
abstracting: (p4_1<=24)
states: 20,012,606,308,670,976 (16)
abstracting: (9<=p3_1)
states: 0
abstracting: (7<=p3_3)
states: 0
abstracting: (p2_4<=18)
states: 14,910,289,226,975,232 (16)
abstracting: (p4_3<=p5_1)
states: 15,565,360,462,299,648 (16)
abstracting: (p2_3<=p2_1)
states: 10,340,271,134,189,568 (16)
abstracting: (p0_5<=2)
states: 3,695,789,133,983,232 (15)
abstracting: (p1_5<=p5_4)
states: 3,082,348,425,192,192 (15)
abstracting: (p1_4<=p4_4)
states: 2,513,831,824,198,656 (15)
abstracting: (p3_2<=p1_1)
states: 19,346,687,147,563,776 (16)
abstracting: (1<=p0_3)
states: 18,680,799,210,518,016 (16)
abstracting: (p0_1<=p1_1)
states: 10,672,203,723,337,728 (16)
-> the formula is FALSE

FORMULA Murphy-PT-D4N025-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.294sec

totally nodes used: 29070965 (2.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 500523607 67392754 567916361
used/not used/entry size/cache size: 49676993 17431871 16 1024MB
basic ops cache: hits/miss/sum: 209536599 40871544 250408143
used/not used/entry size/cache size: 16349361 427855 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: 7432239 1974202 9406441
used/not used/entry size/cache size: 1755940 6632668 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 45042791
1 16948193
2 4073356
3 773471
4 153555
5 47238
6 21861
7 13185
8 10175
9 7364
>= 10 17675

Total processing time: 2m11.560sec


BK_STOP 1679895377039

--------------------
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:23162 (661), effective:4563 (130)

initing FirstDep: 0m 0.000sec


iterations count:246 (7), effective:146 (4)

iterations count:703 (20), effective:144 (4)

iterations count:46 (1), effective:3 (0)

iterations count:1119 (31), effective:279 (7)

iterations count:753 (21), effective:142 (4)

iterations count:3707 (105), effective:640 (18)

iterations count:2251 (64), effective:421 (12)

iterations count:1552 (44), effective:381 (10)

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-D4N025"
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-D4N025, 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-167987241000366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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