About the Execution of Marcie for NQueens-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6010.168 | 54182.00 | 53961.00 | 180.30 | TTFTTTTFTTTFTFTF | normal |
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.r257-smll-167863532200022.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 NQueens-PT-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532200022
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K Mar 5 18:22 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 NQueens-PT-08-ReachabilityCardinality-00
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-01
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-02
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-03
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-04
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-05
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-06
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-07
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-08
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-09
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-10
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-11
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-12
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-13
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-14
FORMULA_NAME NQueens-PT-08-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678648691001
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=NQueens-PT-08
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: NQueens_PT_08
(NrP: 112 NrTr: 64 NrArc: 320)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.510sec
RS generation: 0m 3.882sec
-> reachability set: #nodes 343599 (3.4e+05) #states 118,969 (5)
starting MCC model checker
--------------------------
checking: EF [R_7<=0]
normalized: E [true U R_7<=0]
abstracting: (R_7<=0)
states: 58,485 (4)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.855sec
checking: EF [cX_1<=1]
normalized: E [true U cX_1<=1]
abstracting: (cX_1<=1)
states: 118,969 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.063sec
checking: AG [R_11<=0]
normalized: ~ [E [true U ~ [R_11<=0]]]
abstracting: (R_11<=0)
states: 45,465 (4)
-> the formula is FALSE
FORMULA NQueens-PT-08-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: AG [P_4_1<=1]
normalized: ~ [E [true U ~ [P_4_1<=1]]]
abstracting: (P_4_1<=1)
states: 118,969 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.154sec
checking: AG [~ [R_4<=P_5_1]]
normalized: ~ [E [true U R_4<=P_5_1]]
abstracting: (R_4<=P_5_1)
states: 44,270 (4)
-> the formula is FALSE
FORMULA NQueens-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.497sec
checking: AG [cY_2<=R_2]
normalized: ~ [E [true U ~ [cY_2<=R_2]]]
abstracting: (cY_2<=R_2)
states: 110,587 (5)
-> the formula is FALSE
FORMULA NQueens-PT-08-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.706sec
checking: AG [~ [[~ [P_5_7<=1] & [P_0_2<=0 | P_5_5<=0]]]]
normalized: ~ [E [true U [[P_0_2<=0 | P_5_5<=0] & ~ [P_5_7<=1]]]]
abstracting: (P_5_7<=1)
states: 118,969 (5)
abstracting: (P_5_5<=0)
states: 111,682 (5)
abstracting: (P_0_2<=0)
states: 108,797 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.326sec
checking: AG [[~ [P_1_2<=P_6_6] & 1<=P_2_0]]
normalized: ~ [E [true U ~ [[1<=P_2_0 & ~ [P_1_2<=P_6_6]]]]]
abstracting: (P_1_2<=P_6_6)
states: 110,891 (5)
abstracting: (1<=P_2_0)
states: 10,172 (4)
-> the formula is FALSE
FORMULA NQueens-PT-08-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.919sec
checking: AG [[[~ [1<=cX_6] | P_2_1<=1] | [[~ [L_1<=1] & cX_6<=1] & P_3_6<=0]]]
normalized: ~ [E [true U ~ [[[P_3_6<=0 & [cX_6<=1 & ~ [L_1<=1]]] | [P_2_1<=1 | ~ [1<=cX_6]]]]]]
abstracting: (1<=cX_6)
states: 47,617 (4)
abstracting: (P_2_1<=1)
states: 118,969 (5)
abstracting: (L_1<=1)
states: 118,969 (5)
abstracting: (cX_6<=1)
states: 118,969 (5)
abstracting: (P_3_6<=0)
states: 110,183 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.239sec
checking: EF [~ [[[1<=P_2_2 | 1<=P_1_7] | ~ [[1<=R_0 & [[~ [[P_4_4<=1 | P_7_7<=1]] & P_3_6<=0] | [[[1<=P_6_0 & R_7<=0] & [1<=P_0_1 & L_8<=cX_0]] & P_0_3<=P_7_6]]]]]]]
normalized: E [true U ~ [[~ [[1<=R_0 & [[P_0_3<=P_7_6 & [[1<=P_0_1 & L_8<=cX_0] & [1<=P_6_0 & R_7<=0]]] | [P_3_6<=0 & ~ [[P_4_4<=1 | P_7_7<=1]]]]]] | [1<=P_2_2 | 1<=P_1_7]]]]
abstracting: (1<=P_1_7)
states: 9,369 (3)
abstracting: (1<=P_2_2)
states: 7,287 (3)
abstracting: (P_7_7<=1)
states: 118,969 (5)
abstracting: (P_4_4<=1)
states: 118,969 (5)
abstracting: (P_3_6<=0)
states: 110,183 (5)
abstracting: (R_7<=0)
states: 58,485 (4)
abstracting: (1<=P_6_0)
states: 9,369 (3)
abstracting: (L_8<=cX_0)
states: 79,930 (4)
abstracting: (1<=P_0_1)
states: 9,369 (3)
abstracting: (P_0_3<=P_7_6)
states: 109,551 (5)
abstracting: (1<=R_0)
states: 118,969 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.444sec
checking: AG [[P_1_5<=1 | [[[~ [P_2_4<=0] | [~ [[P_6_4<=cY_4 | ~ [[1<=L_2 & R_11<=0]]]] & P_2_0<=P_1_5]] | [~ [1<=L_8] & L_12<=cY_2]] | ~ [[~ [1<=P_6_4] | ~ [[~ [R_8<=1] | [P_2_3<=0 | P_0_1<=0]]]]]]]]
normalized: ~ [E [true U ~ [[P_1_5<=1 | [~ [[~ [[[P_2_3<=0 | P_0_1<=0] | ~ [R_8<=1]]] | ~ [1<=P_6_4]]] | [[L_12<=cY_2 & ~ [1<=L_8]] | [[P_2_0<=P_1_5 & ~ [[P_6_4<=cY_4 | ~ [[1<=L_2 & R_11<=0]]]]] | ~ [P_2_4<=0]]]]]]]]
abstracting: (P_2_4<=0)
states: 111,284 (5)
abstracting: (R_11<=0)
states: 45,465 (4)
abstracting: (1<=L_2)
states: 89,936 (4)
abstracting: (P_6_4<=cY_4)
states: 110,183 (5)
abstracting: (P_2_0<=P_1_5)
states: 109,743 (5)
abstracting: (1<=L_8)
states: 60,484 (4)
abstracting: (L_12<=cY_2)
states: 70,829 (4)
abstracting: (1<=P_6_4)
states: 8,786 (3)
abstracting: (R_8<=1)
states: 118,969 (5)
abstracting: (P_0_1<=0)
states: 109,600 (5)
abstracting: (P_2_3<=0)
states: 111,284 (5)
abstracting: (P_1_5<=1)
states: 118,969 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.166sec
checking: AG [[[~ [[[[P_4_7<=1 | [[[cY_7<=P_4_2 | 1<=P_7_4] | ~ [1<=P_2_6]] | [~ [1<=cX_2] | ~ [P_5_3<=0]]]] & cX_5<=cY_0] & ~ [[L_6<=0 & ~ [[P_1_0<=P_6_5 | P_4_3<=P_6_0]]]]]] & ~ [[~ [[[R_7<=L_6 | [P_3_4<=1 & L_0<=1]] | ~ [P_5_0<=cX_1]]] & ~ [R_1<=1]]]] | R_14<=1]]
normalized: ~ [E [true U ~ [[R_14<=1 | [~ [[~ [R_1<=1] & ~ [[~ [P_5_0<=cX_1] | [R_7<=L_6 | [P_3_4<=1 & L_0<=1]]]]]] & ~ [[~ [[L_6<=0 & ~ [[P_1_0<=P_6_5 | P_4_3<=P_6_0]]]] & [cX_5<=cY_0 & [P_4_7<=1 | [[~ [P_5_3<=0] | ~ [1<=cX_2]] | [~ [1<=P_2_6] | [cY_7<=P_4_2 | 1<=P_7_4]]]]]]]]]]]]
abstracting: (1<=P_7_4)
states: 10,303 (4)
abstracting: (cY_7<=P_4_2)
states: 78,907 (4)
abstracting: (1<=P_2_6)
states: 8,832 (3)
abstracting: (1<=cX_2)
states: 51,017 (4)
abstracting: (P_5_3<=0)
states: 111,284 (5)
abstracting: (P_4_7<=1)
states: 118,969 (5)
abstracting: (cX_5<=cY_0)
states: 88,516 (4)
abstracting: (P_4_3<=P_6_0)
states: 112,969 (5)
abstracting: (P_1_0<=P_6_5)
states: 109,600 (5)
abstracting: (L_6<=0)
states: 58,485 (4)
abstracting: (L_0<=1)
states: 118,969 (5)
abstracting: (P_3_4<=1)
states: 118,969 (5)
abstracting: (R_7<=L_6)
states: 88,114 (4)
abstracting: (P_5_0<=cX_1)
states: 113,229 (5)
abstracting: (R_1<=1)
states: 118,969 (5)
abstracting: (R_14<=1)
states: 118,969 (5)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.415sec
checking: EF [~ [[~ [[[R_3<=cY_1 & [~ [[[P_4_7<=1 & R_4<=0] & ~ [1<=P_0_3]]] & ~ [[[1<=P_1_4 & P_3_5<=1] & [P_4_4<=1 & cX_0<=P_4_1]]]]] | [[R_12<=P_5_7 & L_12<=P_2_0] & [cX_6<=P_7_6 | ~ [[1<=P_6_7 | 1<=P_1_0]]]]]] | [[[[1<=R_6 | ~ [P_5_0<=P_0_4]] | [[~ [P_5_3<=P_3_6] | ~ [cX_0<=0]] | 1<=P_4_5]] | 1<=cY_1] | P_1_4<=1]]]]
normalized: E [true U ~ [[[P_1_4<=1 | [1<=cY_1 | [[1<=P_4_5 | [~ [cX_0<=0] | ~ [P_5_3<=P_3_6]]] | [1<=R_6 | ~ [P_5_0<=P_0_4]]]]] | ~ [[[[cX_6<=P_7_6 | ~ [[1<=P_6_7 | 1<=P_1_0]]] & [R_12<=P_5_7 & L_12<=P_2_0]] | [R_3<=cY_1 & [~ [[[P_4_4<=1 & cX_0<=P_4_1] & [1<=P_1_4 & P_3_5<=1]]] & ~ [[~ [1<=P_0_3] & [P_4_7<=1 & R_4<=0]]]]]]]]]]
abstracting: (R_4<=0)
states: 38,270 (4)
abstracting: (P_4_7<=1)
states: 118,969 (5)
abstracting: (1<=P_0_3)
states: 10,303 (4)
abstracting: (P_3_5<=1)
states: 118,969 (5)
abstracting: (1<=P_1_4)
states: 8,786 (3)
abstracting: (cX_0<=P_4_1)
states: 79,503 (4)
abstracting: (P_4_4<=1)
states: 118,969 (5)
abstracting: (R_3<=cY_1)
states: 67,900 (4)
abstracting: (L_12<=P_2_0)
states: 37,041 (4)
abstracting: (R_12<=P_5_7)
states: 46,071 (4)
abstracting: (1<=P_1_0)
states: 9,369 (3)
abstracting: (1<=P_6_7)
states: 9,369 (3)
abstracting: (cX_6<=P_7_6)
states: 75,490 (4)
abstracting: (P_5_0<=P_0_4)
states: 109,779 (5)
abstracting: (1<=R_6)
states: 65,683 (4)
abstracting: (P_5_3<=P_3_6)
states: 111,972 (5)
abstracting: (cX_0<=0)
states: 76,162 (4)
abstracting: (1<=P_4_5)
states: 7,685 (3)
abstracting: (1<=cY_1)
states: 47,617 (4)
abstracting: (P_1_4<=1)
states: 118,969 (5)
-> the formula is FALSE
FORMULA NQueens-PT-08-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.480sec
checking: EF [[R_5<=0 | [[[[[~ [[1<=P_0_1 | 1<=L_1]] | ~ [[1<=cY_1 & ~ [1<=P_2_2]]]] & ~ [P_5_6<=1]] & [~ [1<=P_4_3] & P_0_1<=P_0_3]] & 1<=cX_2] & ~ [[[[P_7_0<=0 & ~ [1<=P_7_4]] | [[[P_1_6<=P_4_3 & [1<=P_0_4 | 1<=P_4_7]] | [1<=P_3_5 | ~ [1<=L_13]]] | ~ [P_4_5<=1]]] | [[[P_7_0<=R_6 | ~ [[L_14<=P_2_4 & 1<=P_7_1]]] | ~ [[P_1_2<=0 | [P_2_5<=1 | 1<=R_10]]]] | P_0_2<=0]]]]]]
normalized: E [true U [R_5<=0 | [~ [[[P_0_2<=0 | [~ [[P_1_2<=0 | [P_2_5<=1 | 1<=R_10]]] | [P_7_0<=R_6 | ~ [[L_14<=P_2_4 & 1<=P_7_1]]]]] | [[~ [P_4_5<=1] | [[1<=P_3_5 | ~ [1<=L_13]] | [P_1_6<=P_4_3 & [1<=P_0_4 | 1<=P_4_7]]]] | [P_7_0<=0 & ~ [1<=P_7_4]]]]] & [1<=cX_2 & [[P_0_1<=P_0_3 & ~ [1<=P_4_3]] & [~ [P_5_6<=1] & [~ [[1<=cY_1 & ~ [1<=P_2_2]]] | ~ [[1<=P_0_1 | 1<=L_1]]]]]]]]]
abstracting: (1<=L_1)
states: 100,231 (5)
abstracting: (1<=P_0_1)
states: 9,369 (3)
abstracting: (1<=P_2_2)
states: 7,287 (3)
abstracting: (1<=cY_1)
states: 47,617 (4)
abstracting: (P_5_6<=1)
states: 118,969 (5)
abstracting: (1<=P_4_3)
states: 6,713 (3)
abstracting: (P_0_1<=P_0_3)
states: 109,600 (5)
abstracting: (1<=cX_2)
states: 51,017 (4)
abstracting: (1<=P_7_4)
states: 10,303 (4)
abstracting: (P_7_0<=0)
states: 110,732 (5)
abstracting: (1<=P_4_7)
states: 10,303 (4)
abstracting: (1<=P_0_4)
states: 10,303 (4)
abstracting: (P_1_6<=P_4_3)
states: 110,280 (5)
abstracting: (1<=L_13)
states: 100,231 (5)
abstracting: (1<=P_3_5)
states: 7,685 (3)
abstracting: (P_4_5<=1)
states: 118,969 (5)
abstracting: (1<=P_7_1)
states: 9,369 (3)
abstracting: (L_14<=P_2_4)
states: 15,372 (4)
abstracting: (P_7_0<=R_6)
states: 115,058 (5)
abstracting: (1<=R_10)
states: 65,683 (4)
abstracting: (P_2_5<=1)
states: 118,969 (5)
abstracting: (P_1_2<=0)
states: 110,137 (5)
abstracting: (P_0_2<=0)
states: 108,797 (5)
abstracting: (R_5<=0)
states: 45,465 (4)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.152sec
checking: EF [~ [[[[cY_2<=1 | L_14<=P_2_5] & ~ [[1<=L_11 | ~ [[P_3_2<=P_2_7 | R_3<=0]]]]] | [[[cY_6<=1 & cY_4<=0] & [[[[cY_0<=0 | [R_3<=1 & 1<=R_10]] & [[cY_4<=1 | 1<=P_1_3] & cX_4<=L_8]] | [[1<=R_6 & [L_4<=1 & 1<=R_12]] | [[cX_2<=1 & 1<=P_3_4] & P_7_3<=cX_5]]] | [[~ [P_1_1<=cX_3] & P_2_6<=R_15] | [[1<=L_2 & [P_5_7<=0 | 1<=R_1]] & ~ [[1<=P_1_6 | P_4_4<=cY_4]]]]]] & [1<=P_2_5 | ~ [1<=P_3_7]]]]]]
normalized: E [true U ~ [[[[1<=P_2_5 | ~ [1<=P_3_7]] & [[[[~ [[1<=P_1_6 | P_4_4<=cY_4]] & [1<=L_2 & [P_5_7<=0 | 1<=R_1]]] | [P_2_6<=R_15 & ~ [P_1_1<=cX_3]]] | [[[P_7_3<=cX_5 & [cX_2<=1 & 1<=P_3_4]] | [1<=R_6 & [L_4<=1 & 1<=R_12]]] | [[cX_4<=L_8 & [cY_4<=1 | 1<=P_1_3]] & [cY_0<=0 | [R_3<=1 & 1<=R_10]]]]] & [cY_6<=1 & cY_4<=0]]] | [~ [[1<=L_11 | ~ [[P_3_2<=P_2_7 | R_3<=0]]]] & [cY_2<=1 | L_14<=P_2_5]]]]]
abstracting: (L_14<=P_2_5)
states: 15,524 (4)
abstracting: (cY_2<=1)
states: 118,969 (5)
abstracting: (R_3<=0)
states: 29,033 (4)
abstracting: (P_3_2<=P_2_7)
states: 112,160 (5)
abstracting: (1<=L_11)
states: 80,699 (4)
abstracting: (cY_4<=0)
states: 66,974 (4)
abstracting: (cY_6<=1)
states: 118,969 (5)
abstracting: (1<=R_10)
states: 65,683 (4)
abstracting: (R_3<=1)
states: 118,969 (5)
abstracting: (cY_0<=0)
states: 76,162 (4)
abstracting: (1<=P_1_3)
states: 8,786 (3)
abstracting: (cY_4<=1)
states: 118,969 (5)
abstracting: (cX_4<=L_8)
states: 95,046 (4)
abstracting: (1<=R_12)
states: 80,699 (4)
abstracting: (L_4<=1)
states: 118,969 (5)
abstracting: (1<=R_6)
states: 65,683 (4)
abstracting: (1<=P_3_4)
states: 6,713 (3)
abstracting: (cX_2<=1)
states: 118,969 (5)
abstracting: (P_7_3<=cX_5)
states: 113,470 (5)
abstracting: (P_1_1<=cX_3)
states: 114,111 (5)
abstracting: (P_2_6<=R_15)
states: 118,074 (5)
abstracting: (1<=R_1)
states: 110,732 (5)
abstracting: (P_5_7<=0)
states: 108,797 (5)
abstracting: (1<=L_2)
states: 89,936 (4)
abstracting: (P_4_4<=cY_4)
states: 112,256 (5)
abstracting: (1<=P_1_6)
states: 8,689 (3)
abstracting: (1<=P_3_7)
states: 10,303 (4)
abstracting: (1<=P_2_5)
states: 7,287 (3)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.403sec
checking: AG [[[[~ [[~ [[1<=R_4 & P_3_4<=1]] | 1<=L_8]] | ~ [P_1_6<=0]] | ~ [1<=P_4_3]] | [[~ [[[1<=P_2_3 & ~ [[P_3_7<=R_8 | 1<=P_4_4]]] & P_7_5<=cY_2]] | [R_13<=1 & [[[L_13<=cY_3 | [[P_3_2<=1 | P_2_4<=1] & [P_2_5<=P_6_5 | P_4_7<=1]]] & [[[cY_4<=1 & 1<=R_15] | P_1_0<=L_9] & [~ [1<=cX_1] | [cY_7<=0 | P_7_3<=0]]]] & ~ [[P_6_4<=0 & L_5<=P_6_1]]]]] | [1<=P_4_3 & [[~ [P_2_3<=cX_7] | [[1<=P_0_7 & [R_12<=0 | ~ [L_9<=P_2_6]]] | [[1<=R_8 | [R_0<=1 | 1<=P_1_4]] | cY_6<=R_8]]] & [P_3_4<=P_0_0 | [P_4_5<=P_2_0 & ~ [[[P_7_4<=P_6_4 | P_2_3<=R_5] & ~ [1<=P_2_2]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[1<=P_4_3 & [[P_3_4<=P_0_0 | [P_4_5<=P_2_0 & ~ [[~ [1<=P_2_2] & [P_7_4<=P_6_4 | P_2_3<=R_5]]]]] & [[[cY_6<=R_8 | [1<=R_8 | [R_0<=1 | 1<=P_1_4]]] | [1<=P_0_7 & [R_12<=0 | ~ [L_9<=P_2_6]]]] | ~ [P_2_3<=cX_7]]]] | [[R_13<=1 & [~ [[P_6_4<=0 & L_5<=P_6_1]] & [[[[cY_7<=0 | P_7_3<=0] | ~ [1<=cX_1]] & [P_1_0<=L_9 | [cY_4<=1 & 1<=R_15]]] & [L_13<=cY_3 | [[P_2_5<=P_6_5 | P_4_7<=1] & [P_3_2<=1 | P_2_4<=1]]]]]] | ~ [[P_7_5<=cY_2 & [1<=P_2_3 & ~ [[P_3_7<=R_8 | 1<=P_4_4]]]]]]] | [~ [1<=P_4_3] | [~ [P_1_6<=0] | ~ [[1<=L_8 | ~ [[1<=R_4 & P_3_4<=1]]]]]]]]]]
abstracting: (P_3_4<=1)
states: 118,969 (5)
abstracting: (1<=R_4)
states: 80,699 (4)
abstracting: (1<=L_8)
states: 60,484 (4)
abstracting: (P_1_6<=0)
states: 110,280 (5)
abstracting: (1<=P_4_3)
states: 6,713 (3)
abstracting: (1<=P_4_4)
states: 6,713 (3)
abstracting: (P_3_7<=R_8)
states: 113,950 (5)
abstracting: (1<=P_2_3)
states: 7,685 (3)
abstracting: (P_7_5<=cY_2)
states: 113,521 (5)
abstracting: (P_2_4<=1)
states: 118,969 (5)
abstracting: (P_3_2<=1)
states: 118,969 (5)
abstracting: (P_4_7<=1)
states: 118,969 (5)
abstracting: (P_2_5<=P_6_5)
states: 111,682 (5)
abstracting: (L_13<=cY_3)
states: 62,027 (4)
abstracting: (1<=R_15)
states: 110,732 (5)
abstracting: (cY_4<=1)
states: 118,969 (5)
abstracting: (P_1_0<=L_9)
states: 114,830 (5)
abstracting: (1<=cX_1)
states: 47,617 (4)
abstracting: (P_7_3<=0)
states: 108,666 (5)
abstracting: (cY_7<=0)
states: 76,162 (4)
abstracting: (L_5<=P_6_1)
states: 57,759 (4)
abstracting: (P_6_4<=0)
states: 110,183 (5)
abstracting: (R_13<=1)
states: 118,969 (5)
abstracting: (P_2_3<=cX_7)
states: 114,029 (5)
abstracting: (L_9<=P_2_6)
states: 58,346 (4)
abstracting: (R_12<=0)
states: 38,270 (4)
abstracting: (1<=P_0_7)
states: 8,237 (3)
abstracting: (1<=P_1_4)
states: 8,786 (3)
abstracting: (R_0<=1)
states: 118,969 (5)
abstracting: (1<=R_8)
states: 57,117 (4)
abstracting: (cY_6<=R_8)
states: 95,778 (4)
abstracting: (P_2_3<=R_5)
states: 116,193 (5)
abstracting: (P_7_4<=P_6_4)
states: 108,666 (5)
abstracting: (1<=P_2_2)
states: 7,287 (3)
abstracting: (P_4_5<=P_2_0)
states: 112,073 (5)
abstracting: (P_3_4<=P_0_0)
states: 112,806 (5)
abstracting: (1<=P_4_3)
states: 6,713 (3)
-> the formula is TRUE
FORMULA NQueens-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.524sec
totally nodes used: 6977074 (7.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3798784 50884932 54683716
used/not used/entry size/cache size: 35634385 31474479 16 1024MB
basic ops cache: hits/miss/sum: 1910433 31380863 33291296
used/not used/entry size/cache size: 15377448 1399768 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: 413872 4187868 4601740
used/not used/entry size/cache size: 3292751 5095857 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 61562317
1 4403343
2 902244
3 200791
4 34641
5 4912
6 572
7 38
8 6
9 0
>= 10 0
Total processing time: 0m54.075sec
BK_STOP 1678648745183
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
L_15
R_0
The net has transition(s) that can never fire:
check for constant places
L_15
R_0
found 2 constant places
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.001sec
iterations count:1974 (30), effective:64 (1)
initing FirstDep: 0m 0.000sec
iterations count:261 (4), effective:7 (0)
iterations count:64 (1), effective:0 (0)
iterations count:64 (1), effective:0 (0)
iterations count:140 (2), effective:5 (0)
iterations count:69 (1), effective:2 (0)
iterations count:118 (1), effective:1 (0)
iterations count:260 (4), effective:6 (0)
iterations count:134 (2), effective:5 (0)
iterations count:608 (9), effective:18 (0)
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="NQueens-PT-08"
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 NQueens-PT-08, 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 r257-smll-167863532200022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 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 '
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 ;