About the Execution of Marcie for DNAwalker-PT-09ringLR
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11566.063 | 209250.00 | 209060.00 | 0.00 | FTFTFTTFTTTFTTFT | 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.r097-tall-167814470200937.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 DNAwalker-PT-09ringLR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814470200937
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.6K Feb 25 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-09ringLR-CTLCardinality-00
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-01
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-02
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-03
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-04
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-05
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-06
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-07
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-08
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-09
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-10
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-11
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-12
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-13
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-14
FORMULA_NAME DNAwalker-PT-09ringLR-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678294801065
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-09ringLR
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: DNAwalker_PT_09ringLR
(NrP: 27 NrTr: 260 NrArc: 760)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.926sec
RS generation: 0m36.818sec
-> reachability set: #nodes 20054 (2.0e+04) #states 28,209,796 (7)
starting MCC model checker
--------------------------
checking: EG [AG [A15<=2]]
normalized: EG [~ [E [true U ~ [A15<=2]]]]
abstracting: (A15<=2)
states: 28,209,796 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EG [EF [A9<=B20]]
normalized: EG [E [true U A9<=B20]]
abstracting: (A9<=B20)
states: 17,803,422 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.672sec
checking: AX [~ [EG [E [EX [B20<=A1] U EG [1<=A2]]]]]
normalized: ~ [EX [EG [E [EX [B20<=A1] U EG [1<=A2]]]]]
abstracting: (1<=A2)
states: 9,769,271 (6)
.......
EG iterations: 7
abstracting: (B20<=A1)
states: 19,215,658 (7)
..
EG iterations: 1
.-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.936sec
checking: ~ [EX [~ [EF [~ [A [A13<=2 U A19<=B21]]]]]]
normalized: ~ [EX [~ [E [true U ~ [[~ [EG [~ [A19<=B21]]] & ~ [E [~ [A19<=B21] U [~ [A19<=B21] & ~ [A13<=2]]]]]]]]]]
abstracting: (A13<=2)
states: 28,209,796 (7)
abstracting: (A19<=B21)
states: 17,782,984 (7)
abstracting: (A19<=B21)
states: 17,782,984 (7)
abstracting: (A19<=B21)
states: 17,782,984 (7)
........
EG iterations: 8
.-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.047sec
checking: [A [A8<=A17 U EF [B2<=B3]] & ~ [EG [A2<=A2]]]
normalized: [~ [EG [A2<=A2]] & [~ [EG [~ [E [true U B2<=B3]]]] & ~ [E [~ [E [true U B2<=B3]] U [~ [A8<=A17] & ~ [E [true U B2<=B3]]]]]]]
abstracting: (B2<=B3)
states: 22,173,854 (7)
abstracting: (A8<=A17)
states: 26,811,886 (7)
abstracting: (B2<=B3)
states: 22,173,854 (7)
abstracting: (B2<=B3)
states: 22,173,854 (7)
.
EG iterations: 1
abstracting: (A2<=A2)
states: 28,209,796 (7)
EG iterations: 0
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.334sec
checking: EX [AG [[E [A [2<=A21 U B10<=1] U [A [A16<=1 U A21<=A20] | 2<=B20]] | AF [AX [A15<=0]]]]]
normalized: EX [~ [E [true U ~ [[~ [EG [EX [~ [A15<=0]]]] | E [[~ [EG [~ [B10<=1]]] & ~ [E [~ [B10<=1] U [~ [2<=A21] & ~ [B10<=1]]]]] U [2<=B20 | [~ [EG [~ [A21<=A20]]] & ~ [E [~ [A21<=A20] U [~ [A16<=1] & ~ [A21<=A20]]]]]]]]]]]]
abstracting: (A21<=A20)
states: 21,431,648 (7)
abstracting: (A16<=1)
states: 26,797,634 (7)
abstracting: (A21<=A20)
states: 21,431,648 (7)
abstracting: (A21<=A20)
states: 21,431,648 (7)
.......
EG iterations: 7
abstracting: (2<=B20)
states: 0
abstracting: (B10<=1)
states: 28,209,796 (7)
abstracting: (2<=A21)
states: 939,780 (5)
abstracting: (B10<=1)
states: 28,209,796 (7)
abstracting: (B10<=1)
states: 28,209,796 (7)
.
EG iterations: 1
abstracting: (A15<=0)
states: 13,549,704 (7)
........
EG iterations: 7
.-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m17.083sec
checking: EF [[AG [~ [A7<=A15]] & ~ [[AF [[AF [A13<=A10] | [A2<=A17 | 2<=A1]]] & A14<=1]]]]
normalized: E [true U [~ [E [true U A7<=A15]] & ~ [[A14<=1 & ~ [EG [~ [[~ [EG [~ [A13<=A10]]] | [A2<=A17 | 2<=A1]]]]]]]]]
abstracting: (2<=A1)
states: 729
abstracting: (A2<=A17)
states: 27,273,627 (7)
abstracting: (A13<=A10)
states: 18,589,113 (7)
........
EG iterations: 8
.......
EG iterations: 7
abstracting: (A14<=1)
states: 26,801,196 (7)
abstracting: (A7<=A15)
states: 13,242,466 (7)
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.156sec
checking: [AF [EG [~ [A [AX [1<=A13] U [2<=A4 | B10<=A5]]]]] | AG [EX [AF [[[A18<=B20 & B10<=0] & [B2<=0 | A9<=2]]]]]]
normalized: [~ [E [true U ~ [EX [~ [EG [~ [[[B2<=0 | A9<=2] & [A18<=B20 & B10<=0]]]]]]]]] | ~ [EG [~ [EG [~ [[~ [EG [~ [[2<=A4 | B10<=A5]]]] & ~ [E [~ [[2<=A4 | B10<=A5]] U [EX [~ [1<=A13]] & ~ [[2<=A4 | B10<=A5]]]]]]]]]]]]
abstracting: (B10<=A5)
states: 23,908,124 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
abstracting: (1<=A13)
states: 14,054,156 (7)
.abstracting: (B10<=A5)
states: 23,908,124 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
abstracting: (B10<=A5)
states: 23,908,124 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (B10<=0)
states: 19,219,305 (7)
abstracting: (A18<=B20)
states: 17,919,043 (7)
abstracting: (A9<=2)
states: 28,209,796 (7)
abstracting: (B2<=0)
states: 19,376,694 (7)
.......
EG iterations: 7
.-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.504sec
checking: EG [[~ [[[E [E [1<=A15 U A19<=A20] U ~ [A14<=0]] & EF [2<=B20]] | A [B21<=0 U [~ [A4<=1] & ~ [2<=A4]]]]] | B20<=0]]
normalized: EG [[B20<=0 | ~ [[[~ [EG [~ [[~ [2<=A4] & ~ [A4<=1]]]]] & ~ [E [~ [[~ [2<=A4] & ~ [A4<=1]]] U [~ [B21<=0] & ~ [[~ [2<=A4] & ~ [A4<=1]]]]]]] | [E [true U 2<=B20] & E [E [1<=A15 U A19<=A20] U ~ [A14<=0]]]]]]]
abstracting: (A14<=0)
states: 13,594,612 (7)
abstracting: (A19<=A20)
states: 18,208,825 (7)
abstracting: (1<=A15)
states: 14,660,092 (7)
abstracting: (2<=B20)
states: 0
abstracting: (A4<=1)
states: 26,806,788 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
abstracting: (B21<=0)
states: 19,198,728 (7)
abstracting: (A4<=1)
states: 26,806,788 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
abstracting: (A4<=1)
states: 26,806,788 (7)
abstracting: (2<=A4)
states: 1,403,008 (6)
EG iterations: 0
abstracting: (B20<=0)
states: 19,215,415 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.591sec
checking: EG [A [AF [AF [[1<=A5 & 1<=A7]]] U [[B21<=A8 | EG [EF [A15<=A12]]] & [[2<=A9 | EG [1<=A17]] & E [~ [A1<=0] U ~ [A3<=A14]]]]]]
normalized: EG [[~ [EG [~ [[[E [~ [A1<=0] U ~ [A3<=A14]] & [2<=A9 | EG [1<=A17]]] & [B21<=A8 | EG [E [true U A15<=A12]]]]]]] & ~ [E [~ [[[E [~ [A1<=0] U ~ [A3<=A14]] & [2<=A9 | EG [1<=A17]]] & [B21<=A8 | EG [E [true U A15<=A12]]]]] U [EG [EG [~ [[1<=A5 & 1<=A7]]]] & ~ [[[E [~ [A1<=0] U ~ [A3<=A14]] & [2<=A9 | EG [1<=A17]]] & [B21<=A8 | EG [E [true U A15<=A12]]]]]]]]]]
abstracting: (A15<=A12)
states: 20,437,856 (7)
.
EG iterations: 1
abstracting: (B21<=A8)
states: 23,789,464 (7)
abstracting: (1<=A17)
states: 28,209,796 (7)
EG iterations: 0
abstracting: (2<=A9)
states: 1,403,292 (6)
abstracting: (A3<=A14)
states: 22,926,528 (7)
abstracting: (A1<=0)
states: 28,209,067 (7)
abstracting: (1<=A7)
states: 28,209,796 (7)
abstracting: (1<=A5)
states: 14,714,388 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (A15<=A12)
states: 20,437,856 (7)
.
EG iterations: 1
abstracting: (B21<=A8)
states: 23,789,464 (7)
abstracting: (1<=A17)
states: 28,209,796 (7)
EG iterations: 0
abstracting: (2<=A9)
states: 1,403,292 (6)
abstracting: (A3<=A14)
states: 22,926,528 (7)
abstracting: (A1<=0)
states: 28,209,067 (7)
abstracting: (A15<=A12)
states: 20,437,856 (7)
.
EG iterations: 1
abstracting: (B21<=A8)
states: 23,789,464 (7)
abstracting: (1<=A17)
states: 28,209,796 (7)
EG iterations: 0
abstracting: (2<=A9)
states: 1,403,292 (6)
abstracting: (A3<=A14)
states: 22,926,528 (7)
abstracting: (A1<=0)
states: 28,209,067 (7)
.......
EG iterations: 7
.......
EG iterations: 7
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m29.859sec
checking: [A [A6<=0 U [E [[~ [B10<=A15] | [AG [1<=A13] & ~ [2<=A13]]] U AF [EG [B3<=A7]]] | 1<=A19]] & ~ [EX [EG [[[AF [1<=A7] | AF [A5<=2]] & EF [A1<=A1]]]]]]
normalized: [~ [EX [EG [[E [true U A1<=A1] & [~ [EG [~ [A5<=2]]] | ~ [EG [~ [1<=A7]]]]]]]] & [~ [EG [~ [[1<=A19 | E [[[~ [2<=A13] & ~ [E [true U ~ [1<=A13]]]] | ~ [B10<=A15]] U ~ [EG [~ [EG [B3<=A7]]]]]]]]] & ~ [E [~ [[1<=A19 | E [[[~ [2<=A13] & ~ [E [true U ~ [1<=A13]]]] | ~ [B10<=A15]] U ~ [EG [~ [EG [B3<=A7]]]]]]] U [~ [A6<=0] & ~ [[1<=A19 | E [[[~ [2<=A13] & ~ [E [true U ~ [1<=A13]]]] | ~ [B10<=A15]] U ~ [EG [~ [EG [B3<=A7]]]]]]]]]]]]
abstracting: (B3<=A7)
states: 28,209,796 (7)
EG iterations: 0
.
EG iterations: 1
abstracting: (B10<=A15)
states: 23,916,543 (7)
abstracting: (1<=A13)
states: 14,054,156 (7)
abstracting: (2<=A13)
states: 1,375,538 (6)
abstracting: (1<=A19)
states: 14,672,396 (7)
abstracting: (A6<=0)
states: 13,511,108 (7)
abstracting: (B3<=A7)
states: 28,209,796 (7)
EG iterations: 0
.
EG iterations: 1
abstracting: (B10<=A15)
states: 23,916,543 (7)
abstracting: (1<=A13)
states: 14,054,156 (7)
abstracting: (2<=A13)
states: 1,375,538 (6)
abstracting: (1<=A19)
states: 14,672,396 (7)
abstracting: (B3<=A7)
states: 28,209,796 (7)
EG iterations: 0
.
EG iterations: 1
abstracting: (B10<=A15)
states: 23,916,543 (7)
abstracting: (1<=A13)
states: 14,054,156 (7)
abstracting: (2<=A13)
states: 1,375,538 (6)
abstracting: (1<=A19)
states: 14,672,396 (7)
.
EG iterations: 1
abstracting: (1<=A7)
states: 28,209,796 (7)
.
EG iterations: 1
abstracting: (A5<=2)
states: 28,209,796 (7)
.
EG iterations: 1
abstracting: (A1<=A1)
states: 28,209,796 (7)
EG iterations: 0
.-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.382sec
checking: AF [[~ [A2<=0] | [AX [EG [A [A6<=A15 U A8<=1]]] | [~ [[~ [A7<=A16] & EX [A10<=A12]]] & AF [[~ [A10<=A17] | [B11<=0 & 1<=A4]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [[[B11<=0 & 1<=A4] | ~ [A10<=A17]]]]] & ~ [[EX [A10<=A12] & ~ [A7<=A16]]]] | ~ [EX [~ [EG [[~ [EG [~ [A8<=1]]] & ~ [E [~ [A8<=1] U [~ [A6<=A15] & ~ [A8<=1]]]]]]]]]] | ~ [A2<=0]]]]]
abstracting: (A2<=0)
states: 18,440,525 (7)
abstracting: (A8<=1)
states: 26,811,886 (7)
abstracting: (A6<=A15)
states: 20,417,214 (7)
abstracting: (A8<=1)
states: 26,811,886 (7)
abstracting: (A8<=1)
states: 26,811,886 (7)
........
EG iterations: 8
.
EG iterations: 1
.abstracting: (A7<=A16)
states: 13,228,978 (7)
abstracting: (A10<=A12)
states: 22,929,858 (7)
.abstracting: (A10<=A17)
states: 27,269,198 (7)
abstracting: (1<=A4)
states: 14,606,608 (7)
abstracting: (B11<=0)
states: 19,186,066 (7)
.
EG iterations: 1
................
EG iterations: 16
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.512sec
checking: EG [~ [[~ [[AF [A14<=1] & [A20<=2 & B20<=1]]] & ~ [[[[~ [2<=B21] | [2<=B2 | A2<=2]] & 1<=A14] & [[[2<=A5 & 1<=A8] | [A12<=2 | A19<=A3]] & AG [1<=A17]]]]]]]
normalized: EG [~ [[~ [[[~ [E [true U ~ [1<=A17]]] & [[A12<=2 | A19<=A3] | [2<=A5 & 1<=A8]]] & [1<=A14 & [[2<=B2 | A2<=2] | ~ [2<=B21]]]]] & ~ [[[A20<=2 & B20<=1] & ~ [EG [~ [A14<=1]]]]]]]]
abstracting: (A14<=1)
states: 26,801,196 (7)
........
EG iterations: 8
abstracting: (B20<=1)
states: 28,209,796 (7)
abstracting: (A20<=2)
states: 28,209,796 (7)
abstracting: (2<=B21)
states: 0
abstracting: (A2<=2)
states: 28,209,796 (7)
abstracting: (2<=B2)
states: 0
abstracting: (1<=A14)
states: 14,615,184 (7)
abstracting: (1<=A8)
states: 14,397,124 (7)
abstracting: (2<=A5)
states: 1,411,976 (6)
abstracting: (A19<=A3)
states: 18,243,680 (7)
abstracting: (A12<=2)
states: 28,209,796 (7)
abstracting: (1<=A17)
states: 28,209,796 (7)
EG iterations: 0
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.727sec
checking: A [A [~ [A [[B11<=1 | 1<=A9] U AG [B11<=0]]] U [AF [[1<=A8 | [A16<=1 & A9<=A3]]] | A4<=A18]] U E [[EG [A [2<=A11 U 1<=B20]] | B10<=B21] U EG [[EG [B20<=0] & 1<=A16]]]]
normalized: [~ [EG [~ [E [[B10<=B21 | EG [[~ [EG [~ [1<=B20]]] & ~ [E [~ [1<=B20] U [~ [2<=A11] & ~ [1<=B20]]]]]]] U EG [[1<=A16 & EG [B20<=0]]]]]]] & ~ [E [~ [E [[B10<=B21 | EG [[~ [EG [~ [1<=B20]]] & ~ [E [~ [1<=B20] U [~ [2<=A11] & ~ [1<=B20]]]]]]] U EG [[1<=A16 & EG [B20<=0]]]]] U [~ [[~ [EG [~ [[A4<=A18 | ~ [EG [~ [[1<=A8 | [A16<=1 & A9<=A3]]]]]]]]] & ~ [E [~ [[A4<=A18 | ~ [EG [~ [[1<=A8 | [A16<=1 & A9<=A3]]]]]]] U [[~ [EG [E [true U ~ [B11<=0]]]] & ~ [E [E [true U ~ [B11<=0]] U [~ [[B11<=1 | 1<=A9]] & E [true U ~ [B11<=0]]]]]] & ~ [[A4<=A18 | ~ [EG [~ [[1<=A8 | [A16<=1 & A9<=A3]]]]]]]]]]]] & ~ [E [[B10<=B21 | EG [[~ [EG [~ [1<=B20]]] & ~ [E [~ [1<=B20] U [~ [2<=A11] & ~ [1<=B20]]]]]]] U EG [[1<=A16 & EG [B20<=0]]]]]]]]]
abstracting: (B20<=0)
states: 19,215,415 (7)
.
EG iterations: 1
abstracting: (1<=A16)
states: 14,645,876 (7)
.......
EG iterations: 7
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (2<=A11)
states: 942,760 (5)
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (1<=B20)
states: 8,994,381 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (B10<=B21)
states: 22,082,819 (7)
abstracting: (A9<=A3)
states: 18,268,264 (7)
abstracting: (A16<=1)
states: 26,797,634 (7)
abstracting: (1<=A8)
states: 14,397,124 (7)
........
EG iterations: 8
abstracting: (A4<=A18)
states: 20,406,052 (7)
abstracting: (B11<=0)
states: 19,186,066 (7)
abstracting: (1<=A9)
states: 14,584,608 (7)
abstracting: (B11<=1)
states: 28,209,796 (7)
abstracting: (B11<=0)
states: 19,186,066 (7)
abstracting: (B11<=0)
states: 19,186,066 (7)
.
EG iterations: 1
abstracting: (A9<=A3)
states: 18,268,264 (7)
abstracting: (A16<=1)
states: 26,797,634 (7)
abstracting: (1<=A8)
states: 14,397,124 (7)
........
EG iterations: 8
abstracting: (A4<=A18)
states: 20,406,052 (7)
abstracting: (A9<=A3)
states: 18,268,264 (7)
abstracting: (A16<=1)
states: 26,797,634 (7)
abstracting: (1<=A8)
states: 14,397,124 (7)
........
EG iterations: 8
abstracting: (A4<=A18)
states: 20,406,052 (7)
........
EG iterations: 8
abstracting: (B20<=0)
states: 19,215,415 (7)
.
EG iterations: 1
abstracting: (1<=A16)
states: 14,645,876 (7)
.......
EG iterations: 7
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (2<=A11)
states: 942,760 (5)
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (1<=B20)
states: 8,994,381 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (B10<=B21)
states: 22,082,819 (7)
abstracting: (B20<=0)
states: 19,215,415 (7)
.
EG iterations: 1
abstracting: (1<=A16)
states: 14,645,876 (7)
.......
EG iterations: 7
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (2<=A11)
states: 942,760 (5)
abstracting: (1<=B20)
states: 8,994,381 (6)
abstracting: (1<=B20)
states: 8,994,381 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (B10<=B21)
states: 22,082,819 (7)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m12.662sec
checking: [EF [[2<=A2 & [[B2<=1 & E [AX [2<=A19] U A [A3<=A6 U A20<=A6]]] & EG [[[A12<=0 | A2<=B11] & ~ [A13<=B2]]]]]] | A [~ [[AG [A12<=A5] & [[1<=A10 & 1<=A10] | ~ [1<=A6]]]] U ~ [A [~ [EG [1<=B21]] U AX [~ [A18<=1]]]]]]
normalized: [[~ [EG [[~ [EG [EX [A18<=1]]] & ~ [E [EX [A18<=1] U [EX [A18<=1] & EG [1<=B21]]]]]]] & ~ [E [[~ [EG [EX [A18<=1]]] & ~ [E [EX [A18<=1] U [EX [A18<=1] & EG [1<=B21]]]]] U [[~ [EG [EX [A18<=1]]] & ~ [E [EX [A18<=1] U [EX [A18<=1] & EG [1<=B21]]]]] & [[~ [1<=A6] | [1<=A10 & 1<=A10]] & ~ [E [true U ~ [A12<=A5]]]]]]]] | E [true U [2<=A2 & [EG [[~ [A13<=B2] & [A12<=0 | A2<=B11]]] & [B2<=1 & E [~ [EX [~ [2<=A19]]] U [~ [EG [~ [A20<=A6]]] & ~ [E [~ [A20<=A6] U [~ [A3<=A6] & ~ [A20<=A6]]]]]]]]]]]
abstracting: (A20<=A6)
states: 22,964,158 (7)
abstracting: (A3<=A6)
states: 22,973,396 (7)
abstracting: (A20<=A6)
states: 22,964,158 (7)
abstracting: (A20<=A6)
states: 22,964,158 (7)
.......
EG iterations: 7
abstracting: (2<=A19)
states: 1,404,612 (6)
.abstracting: (B2<=1)
states: 28,209,796 (7)
abstracting: (A2<=B11)
states: 21,251,993 (7)
abstracting: (A12<=0)
states: 13,598,676 (7)
abstracting: (A13<=B2)
states: 18,000,913 (7)
........
EG iterations: 8
abstracting: (2<=A2)
states: 936,169 (5)
abstracting: (A12<=A5)
states: 20,467,616 (7)
abstracting: (1<=A10)
states: 9,931,089 (6)
abstracting: (1<=A10)
states: 9,931,089 (6)
abstracting: (1<=A6)
states: 14,698,688 (7)
abstracting: (1<=B21)
states: 9,011,068 (6)
.
EG iterations: 1
abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.
EG iterations: 0
abstracting: (1<=B21)
states: 9,011,068 (6)
.
EG iterations: 1
abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.
EG iterations: 0
abstracting: (1<=B21)
states: 9,011,068 (6)
.
EG iterations: 1
abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.abstracting: (A18<=1)
states: 26,810,440 (7)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.056sec
checking: [EG [[[AG [~ [AG [A21<=2]]] | B2<=A1] | [[2<=A1 & EX [~ [1<=B20]]] & [~ [A16<=A21] | [[1<=A17 | EX [A3<=0]] & [EG [A18<=A6] | E [A8<=2 U A13<=2]]]]]]] & ~ [E [EG [[AF [2<=A10] & [EF [A5<=A1] | EX [A21<=A16]]]] U ~ [[[EX [1<=A12] & 1<=B21] & AF [~ [A4<=2]]]]]]]
normalized: [~ [E [EG [[[EX [A21<=A16] | E [true U A5<=A1]] & ~ [EG [~ [2<=A10]]]]] U ~ [[~ [EG [A4<=2]] & [1<=B21 & EX [1<=A12]]]]]] & EG [[[[[[E [A8<=2 U A13<=2] | EG [A18<=A6]] & [1<=A17 | EX [A3<=0]]] | ~ [A16<=A21]] & [2<=A1 & EX [~ [1<=B20]]]] | [B2<=A1 | ~ [E [true U ~ [E [true U ~ [A21<=2]]]]]]]]]
abstracting: (A21<=2)
states: 28,209,796 (7)
abstracting: (B2<=A1)
states: 19,376,937 (7)
abstracting: (1<=B20)
states: 8,994,381 (6)
.abstracting: (2<=A1)
states: 729
abstracting: (A16<=A21)
states: 18,240,026 (7)
abstracting: (A3<=0)
states: 18,274,192 (7)
.abstracting: (1<=A17)
states: 28,209,796 (7)
abstracting: (A18<=A6)
states: 20,556,820 (7)
........
EG iterations: 8
abstracting: (A13<=2)
states: 28,209,796 (7)
abstracting: (A8<=2)
states: 28,209,796 (7)
.
EG iterations: 1
abstracting: (1<=A12)
states: 14,611,120 (7)
.abstracting: (1<=B21)
states: 9,011,068 (6)
abstracting: (A4<=2)
states: 28,209,796 (7)
EG iterations: 0
abstracting: (2<=A10)
states: 940,598 (5)
.
EG iterations: 1
abstracting: (A5<=A1)
states: 13,496,137 (7)
before gc: list nodes free: 669713
after gc: idd nodes used:292489, unused:63707511; list nodes free:390538588
abstracting: (A21<=A16)
states: 22,937,020 (7)
........
EG iterations: 7
-> the formula is FALSE
FORMULA DNAwalker-PT-09ringLR-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m23.440sec
totally nodes used: 68754474 (6.9e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 275531861 287180983 562712844
used/not used/entry size/cache size: 14948182 52160682 16 1024MB
basic ops cache: hits/miss/sum: 98050297 74472274 172522571
used/not used/entry size/cache size: 6917012 9860204 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: 356711 304101 660812
used/not used/entry size/cache size: 17547 8371061 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 62772344
1 3946087
2 271707
3 53439
4 20812
5 14608
6 11573
7 8126
8 2759
9 1513
>= 10 5896
Total processing time: 3m29.174sec
BK_STOP 1678295010315
--------------------
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
724 922 794 2062 2210 2282 16196 19183 19678 19635 21188 22672 23563 21126
iterations count:1483072 (5704), effective:35772 (137)
initing FirstDep: 0m 0.000sec
iterations count:12221 (47), effective:165 (0)
iterations count:313 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:13967 (53), effective:255 (0)
iterations count:33815 (130), effective:938 (3)
iterations count:78331 (301), effective:1726 (6)
iterations count:260 (1), effective:0 (0)
iterations count:24706 (95), effective:326 (1)
iterations count:5298 (20), effective:84 (0)
iterations count:12905 (49), effective:149 (0)
iterations count:30432 (117), effective:665 (2)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:57407 (220), effective:733 (2)
iterations count:503 (1), effective:2 (0)
iterations count:57407 (220), effective:733 (2)
iterations count:503 (1), effective:2 (0)
iterations count:21823 (83), effective:540 (2)
iterations count:57407 (220), effective:733 (2)
iterations count:503 (1), effective:2 (0)
iterations count:7049 (27), effective:123 (0)
iterations count:260 (1), effective:0 (0)
iterations count:7049 (27), effective:123 (0)
iterations count:260 (1), effective:0 (0)
iterations count:7049 (27), effective:123 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:265 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:261 (1), effective:1 (0)
iterations count:265 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:38656 (148), effective:930 (3)
iterations count:265 (1), effective:1 (0)
iterations count:261 (1), effective:1 (0)
iterations count:417 (1), effective:1 (0)
iterations count:260 (1), effective:0 (0)
iterations count:46161 (177), effective:1062 (4)
iterations count:5863 (22), effective:91 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:260 (1), effective:0 (0)
iterations count:23439 (90), effective:581 (2)
iterations count:260 (1), effective:0 (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="DNAwalker-PT-09ringLR"
export BK_EXAMINATION="CTLCardinality"
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 DNAwalker-PT-09ringLR, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r097-tall-167814470200937"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-09ringLR.tgz
mv DNAwalker-PT-09ringLR 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 '
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 ;