About the Execution of Marcie for Eratosthenes-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.647 | 4730.00 | 4000.00 | 80.00 | TFFTFTFTFFTFFFTF | 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.r161-tall-167838844700145.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 Eratosthenes-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838844700145
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 11:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K 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 Eratosthenes-PT-020-CTLCardinality-00
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-01
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-02
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-03
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-04
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-05
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-06
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-07
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-08
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-09
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-10
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-11
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-12
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-13
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-14
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679420055764
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=Eratosthenes-PT-020
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: Eratosthenes_PT_020
(NrP: 19 NrTr: 27 NrArc: 81)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.885sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 19 (1.9e+01) #states 2,048 (3)
starting MCC model checker
--------------------------
checking: EG [[p9<=p18 & p18<=1]]
normalized: EG [[p9<=p18 & p18<=1]]
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (p9<=p18)
states: 1,536 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [AG [[AF [~ [p2<=p2]] | 1<=p19]]]]
normalized: E [true U E [true U ~ [[~ [EG [p2<=p2]] | 1<=p19]]]]
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (p2<=p2)
states: 2,048 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AF [~ [[p2<=0 | p5<=p6]]]]
normalized: EG [[p2<=0 | p5<=p6]]
abstracting: (p5<=p6)
states: 1,024 (3)
abstracting: (p2<=0)
states: 0
............
EG iterations: 12
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [~ [AG [~ [E [[p6<=1 | p3<=p2] U A [p4<=1 U p8<=p3]]]]]]
normalized: EG [E [true U E [[p6<=1 | p3<=p2] U [~ [EG [~ [p8<=p3]]] & ~ [E [~ [p8<=p3] U [~ [p4<=1] & ~ [p8<=p3]]]]]]]]
abstracting: (p8<=p3)
states: 2,048 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (p8<=p3)
states: 2,048 (3)
abstracting: (p8<=p3)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (p3<=p2)
states: 2,048 (3)
abstracting: (p6<=1)
states: 2,048 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [AG [AX [[EG [A [1<=p15 U 1<=p11]] | A [AF [p19<=p12] U ~ [p9<=p9]]]]]]
normalized: E [true U EX [~ [[[~ [EG [p9<=p9]] & ~ [E [p9<=p9 U [EG [~ [p19<=p12]] & p9<=p9]]]] | EG [[~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [~ [1<=p15] & ~ [1<=p11]]]]]]]]]]
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p15)
states: 1,024 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
.
EG iterations: 1
EG iterations: 0
abstracting: (p9<=p9)
states: 2,048 (3)
abstracting: (p19<=p12)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p9<=p9)
states: 2,048 (3)
abstracting: (p9<=p9)
states: 2,048 (3)
EG iterations: 0
.-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[AG [[E [p4<=1 U p2<=p10] & EG [1<=p5]]] | ~ [EG [p12<=p13]]]]]
normalized: E [true U ~ [[~ [EG [p12<=p13]] | ~ [E [true U ~ [[EG [1<=p5] & E [p4<=1 U p2<=p10]]]]]]]]
abstracting: (p2<=p10)
states: 1,024 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (1<=p5)
states: 2,048 (3)
EG iterations: 0
abstracting: (p12<=p13)
states: 2,048 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [[[p10<=p5 & E [p7<=p8 U [~ [p5<=0] | EG [1<=p10]]]] & EG [EF [EF [p3<=1]]]]]
normalized: EG [[EG [E [true U E [true U p3<=1]]] & [E [p7<=p8 U [EG [1<=p10] | ~ [p5<=0]]] & p10<=p5]]]
abstracting: (p10<=p5)
states: 2,048 (3)
abstracting: (p5<=0)
states: 0
abstracting: (1<=p10)
states: 1,024 (3)
............
EG iterations: 12
abstracting: (p7<=p8)
states: 1,024 (3)
abstracting: (p3<=1)
states: 2,048 (3)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [A [EX [[A [[p11<=1 | p4<=1] U [1<=p11 & 1<=p19]] | E [EF [1<=p2] U [p13<=p6 & 1<=p20]]]] U p4<=0]]
normalized: ~ [[~ [EG [~ [p4<=0]]] & ~ [E [~ [p4<=0] U [~ [EX [[E [E [true U 1<=p2] U [p13<=p6 & 1<=p20]] | [~ [EG [~ [[1<=p11 & 1<=p19]]]] & ~ [E [~ [[1<=p11 & 1<=p19]] U [~ [[p11<=1 | p4<=1]] & ~ [[1<=p11 & 1<=p19]]]]]]]]] & ~ [p4<=0]]]]]]
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (p11<=1)
states: 2,048 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
abstracting: (1<=p19)
states: 2,048 (3)
abstracting: (1<=p11)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p13<=p6)
states: 1,024 (3)
abstracting: (1<=p2)
states: 2,048 (3)
.abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (p4<=0)
states: 1,024 (3)
............
EG iterations: 12
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [A [[EF [[EX [p7<=1] & [[p17<=0 | p9<=p8] | [1<=p10 & p15<=p2]]]] | AF [p17<=p8]] U EG [1<=p7]]]
normalized: ~ [[~ [EG [~ [EG [1<=p7]]]] & ~ [E [~ [EG [1<=p7]] U [~ [[~ [EG [~ [p17<=p8]]] | E [true U [[[p17<=0 | p9<=p8] | [1<=p10 & p15<=p2]] & EX [p7<=1]]]]] & ~ [EG [1<=p7]]]]]]]
abstracting: (1<=p7)
states: 2,048 (3)
EG iterations: 0
abstracting: (p7<=1)
states: 2,048 (3)
.abstracting: (p15<=p2)
states: 2,048 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (p9<=p8)
states: 1,536 (3)
abstracting: (p17<=0)
states: 0
abstracting: (p17<=p8)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (1<=p7)
states: 2,048 (3)
EG iterations: 0
abstracting: (1<=p7)
states: 2,048 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [AF [[~ [[[p6<=p18 | ~ [p15<=0]] & [[p20<=1 | 1<=p2] & [p13<=p5 | p14<=p7]]]] & EX [~ [p19<=p9]]]]]
normalized: EG [~ [EG [~ [[~ [[[[p13<=p5 | p14<=p7] & [p20<=1 | 1<=p2]] & [~ [p15<=0] | p6<=p18]]] & EX [~ [p19<=p9]]]]]]]
abstracting: (p19<=p9)
states: 1,024 (3)
.abstracting: (p6<=p18)
states: 1,536 (3)
abstracting: (p15<=0)
states: 1,024 (3)
abstracting: (1<=p2)
states: 2,048 (3)
abstracting: (p20<=1)
states: 2,048 (3)
abstracting: (p14<=p7)
states: 2,048 (3)
abstracting: (p13<=p5)
states: 2,048 (3)
.
EG iterations: 1
..........
EG iterations: 10
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [A [[~ [[AG [1<=p17] & [EG [p3<=p9] & EF [p10<=p8]]]] & ~ [AF [AG [p10<=p20]]]] U [[~ [EF [1<=p6]] | EG [EX [p6<=p13]]] | [[1<=p4 & EG [p3<=1]] | ~ [1<=p16]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[[~ [1<=p16] | [EG [p3<=1] & 1<=p4]] | [~ [E [true U 1<=p6]] | EG [EX [p6<=p13]]]]]]] & ~ [E [~ [[[~ [1<=p16] | [EG [p3<=1] & 1<=p4]] | [~ [E [true U 1<=p6]] | EG [EX [p6<=p13]]]]] U [~ [[~ [[~ [E [true U ~ [1<=p17]]] & [E [true U p10<=p8] & EG [p3<=p9]]]] & EG [E [true U ~ [p10<=p20]]]]] & ~ [[[~ [1<=p16] | [EG [p3<=1] & 1<=p4]] | [~ [E [true U 1<=p6]] | EG [EX [p6<=p13]]]]]]]]]]]]
abstracting: (p6<=p13)
states: 2,048 (3)
.............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p3<=1)
states: 2,048 (3)
EG iterations: 0
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p10<=p20)
states: 1,536 (3)
............
EG iterations: 12
abstracting: (p3<=p9)
states: 1,024 (3)
............
EG iterations: 12
abstracting: (p10<=p8)
states: 1,536 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p6<=p13)
states: 2,048 (3)
.............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p3<=1)
states: 2,048 (3)
EG iterations: 0
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p6<=p13)
states: 2,048 (3)
.............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p3<=1)
states: 2,048 (3)
EG iterations: 0
abstracting: (1<=p16)
states: 1,024 (3)
..........
EG iterations: 10
..........
EG iterations: 10
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [E [EF [EX [[1<=p20 | [p18<=0 & p18<=1]]]] U [[EG [AF [p19<=p2]] & p14<=1] & EF [AG [~ [p9<=p3]]]]] & EG [[~ [EX [[[p7<=p5 & p15<=p14] | p14<=p19]]] | p13<=p4]]]
normalized: [EG [[~ [EX [[[p7<=p5 & p15<=p14] | p14<=p19]]] | p13<=p4]] & E [E [true U EX [[[p18<=0 & p18<=1] | 1<=p20]]] U [E [true U ~ [E [true U p9<=p3]]] & [EG [~ [EG [~ [p19<=p2]]]] & p14<=1]]]]
abstracting: (p14<=1)
states: 2,048 (3)
abstracting: (p19<=p2)
states: 2,048 (3)
.
EG iterations: 1
EG iterations: 0
abstracting: (p9<=p3)
states: 2,048 (3)
abstracting: (1<=p20)
states: 1,024 (3)
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (p18<=0)
states: 1,024 (3)
.abstracting: (p13<=p4)
states: 1,024 (3)
abstracting: (p14<=p19)
states: 2,048 (3)
abstracting: (p15<=p14)
states: 1,536 (3)
abstracting: (p7<=p5)
states: 2,048 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[p11<=p12 & [E [1<=p3 U p19<=0] & ~ [[EX [EX [p17<=p17]] | [[p14<=p13 & [p13<=0 & p13<=p10]] | [[p13<=p17 | p12<=p18] & [1<=p18 & p19<=0]]]]]]]]
normalized: E [true U [[~ [[[[[1<=p18 & p19<=0] & [p13<=p17 | p12<=p18]] | [[p13<=0 & p13<=p10] & p14<=p13]] | EX [EX [p17<=p17]]]] & E [1<=p3 U p19<=0]] & p11<=p12]]
abstracting: (p11<=p12)
states: 1,024 (3)
abstracting: (p19<=0)
states: 0
abstracting: (1<=p3)
states: 2,048 (3)
abstracting: (p17<=p17)
states: 2,048 (3)
..abstracting: (p14<=p13)
states: 2,048 (3)
abstracting: (p13<=p10)
states: 1,024 (3)
abstracting: (p13<=0)
states: 0
abstracting: (p12<=p18)
states: 1,536 (3)
abstracting: (p13<=p17)
states: 2,048 (3)
abstracting: (p19<=0)
states: 0
abstracting: (1<=p18)
states: 1,024 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [~ [A [E [AF [[1<=p20 | p4<=0]] U EF [EF [1<=p4]]] U AX [AG [[p10<=1 | p5<=p5]]]]] & A [A [[AF [~ [p8<=1]] | [[p15<=p9 & [p19<=p7 | 1<=p5]] & ~ [[p4<=0 | 1<=p5]]]] U [1<=p17 | ~ [[p17<=0 & p9<=p16]]]] U AG [EF [EF [1<=p7]]]]]
normalized: [[~ [EG [E [true U ~ [E [true U E [true U 1<=p7]]]]]] & ~ [E [E [true U ~ [E [true U E [true U 1<=p7]]]] U [E [true U ~ [E [true U E [true U 1<=p7]]]] & ~ [[~ [EG [~ [[~ [[p17<=0 & p9<=p16]] | 1<=p17]]]] & ~ [E [~ [[~ [[p17<=0 & p9<=p16]] | 1<=p17]] U [~ [[[~ [[p4<=0 | 1<=p5]] & [[p19<=p7 | 1<=p5] & p15<=p9]] | ~ [EG [p8<=1]]]] & ~ [[~ [[p17<=0 & p9<=p16]] | 1<=p17]]]]]]]]]]] & ~ [[~ [EG [EX [E [true U ~ [[p10<=1 | p5<=p5]]]]]] & ~ [E [EX [E [true U ~ [[p10<=1 | p5<=p5]]]] U [EX [E [true U ~ [[p10<=1 | p5<=p5]]]] & ~ [E [~ [EG [~ [[1<=p20 | p4<=0]]]] U E [true U E [true U 1<=p4]]]]]]]]]]
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (1<=p20)
states: 1,024 (3)
...........
EG iterations: 11
abstracting: (p5<=p5)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
.abstracting: (p5<=p5)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
.abstracting: (p5<=p5)
states: 2,048 (3)
abstracting: (p10<=1)
states: 2,048 (3)
..
EG iterations: 1
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p9<=p16)
states: 1,536 (3)
abstracting: (p17<=0)
states: 0
abstracting: (p8<=1)
states: 2,048 (3)
EG iterations: 0
abstracting: (p15<=p9)
states: 1,536 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p19<=p7)
states: 2,048 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p4<=0)
states: 1,024 (3)
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p9<=p16)
states: 1,536 (3)
abstracting: (p17<=0)
states: 0
abstracting: (1<=p17)
states: 2,048 (3)
abstracting: (p9<=p16)
states: 1,536 (3)
abstracting: (p17<=0)
states: 0
.
EG iterations: 1
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p7)
states: 2,048 (3)
abstracting: (1<=p7)
states: 2,048 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[A [EG [[EG [p2<=0] & EG [p19<=1]]] U AG [p12<=p11]] & [A [[AF [p11<=p18] & [A [p13<=p11 U p13<=p20] | [1<=p4 & p11<=1]]] U [[p11<=p9 | EG [1<=p12]] & ~ [AX [1<=p6]]]] & [A [[~ [p8<=1] & p10<=p16] U [[p18<=p3 | p8<=1] | EX [p18<=1]]] | ~ [AX [EG [p9<=0]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [[EX [~ [1<=p6]] & [EG [1<=p12] | p11<=p9]]]]] & ~ [E [~ [[EX [~ [1<=p6]] & [EG [1<=p12] | p11<=p9]]] U [~ [[EX [~ [1<=p6]] & [EG [1<=p12] | p11<=p9]]] & ~ [[[[1<=p4 & p11<=1] | [~ [EG [~ [p13<=p20]]] & ~ [E [~ [p13<=p20] U [~ [p13<=p11] & ~ [p13<=p20]]]]]] & ~ [EG [~ [p11<=p18]]]]]]]]] & [[~ [EG [~ [[EX [p18<=1] | [p18<=p3 | p8<=1]]]]] & ~ [E [~ [[EX [p18<=1] | [p18<=p3 | p8<=1]]] U [~ [[~ [p8<=1] & p10<=p16]] & ~ [[EX [p18<=1] | [p18<=p3 | p8<=1]]]]]]] | EX [~ [EG [p9<=0]]]]] & [~ [EG [E [true U ~ [p12<=p11]]]] & ~ [E [E [true U ~ [p12<=p11]] U [~ [EG [[EG [p19<=1] & EG [p2<=0]]]] & E [true U ~ [p12<=p11]]]]]]]]]]
abstracting: (p12<=p11)
states: 2,048 (3)
abstracting: (p2<=0)
states: 0
.
EG iterations: 1
abstracting: (p19<=1)
states: 2,048 (3)
EG iterations: 0
.
EG iterations: 1
abstracting: (p12<=p11)
states: 2,048 (3)
abstracting: (p12<=p11)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (p9<=0)
states: 1,024 (3)
.
EG iterations: 1
.abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p18<=p3)
states: 2,048 (3)
abstracting: (p18<=1)
states: 2,048 (3)
.abstracting: (p10<=p16)
states: 1,536 (3)
abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p18<=p3)
states: 2,048 (3)
abstracting: (p18<=1)
states: 2,048 (3)
.abstracting: (p8<=1)
states: 2,048 (3)
abstracting: (p18<=p3)
states: 2,048 (3)
abstracting: (p18<=1)
states: 2,048 (3)
..
EG iterations: 1
abstracting: (p11<=p18)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p13<=p20)
states: 1,024 (3)
abstracting: (p13<=p11)
states: 2,048 (3)
abstracting: (p13<=p20)
states: 1,024 (3)
abstracting: (p13<=p20)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p11<=1)
states: 2,048 (3)
abstracting: (1<=p4)
states: 1,024 (3)
abstracting: (p11<=p9)
states: 1,024 (3)
abstracting: (1<=p12)
states: 1,024 (3)
............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
.abstracting: (p11<=p9)
states: 1,024 (3)
abstracting: (1<=p12)
states: 1,024 (3)
............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
.abstracting: (p11<=p9)
states: 1,024 (3)
abstracting: (1<=p12)
states: 1,024 (3)
............
EG iterations: 12
abstracting: (1<=p6)
states: 1,024 (3)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [E [[1<=p6 | [[[[[1<=p16 & p4<=p4] & AX [p6<=0]] | AX [1<=p15]] | A [AF [p12<=p7] U A [p16<=p3 U p3<=p6]]] & ~ [[[p9<=0 & [1<=p16 & p18<=1]] & ~ [1<=p5]]]]] U [~ [AG [E [p19<=p18 U p11<=p8]]] & [[~ [EF [1<=p16]] & [[E [1<=p16 U p4<=1] | ~ [p11<=p9]] & p11<=0]] & A [EF [1<=p10] U [AG [p12<=p17] | [p3<=1 & p4<=p5]]]]]] | AF [p17<=0]]
normalized: [~ [EG [~ [p17<=0]]] | E [[[~ [[~ [1<=p5] & [[1<=p16 & p18<=1] & p9<=0]]] & [[~ [EG [~ [[~ [EG [~ [p3<=p6]]] & ~ [E [~ [p3<=p6] U [~ [p16<=p3] & ~ [p3<=p6]]]]]]]] & ~ [E [~ [[~ [EG [~ [p3<=p6]]] & ~ [E [~ [p3<=p6] U [~ [p16<=p3] & ~ [p3<=p6]]]]]] U [EG [~ [p12<=p7]] & ~ [[~ [EG [~ [p3<=p6]]] & ~ [E [~ [p3<=p6] U [~ [p16<=p3] & ~ [p3<=p6]]]]]]]]]] | [~ [EX [~ [1<=p15]]] | [~ [EX [~ [p6<=0]]] & [1<=p16 & p4<=p4]]]]] | 1<=p6] U [[[~ [EG [~ [[[p3<=1 & p4<=p5] | ~ [E [true U ~ [p12<=p17]]]]]]] & ~ [E [~ [[[p3<=1 & p4<=p5] | ~ [E [true U ~ [p12<=p17]]]]] U [~ [E [true U 1<=p10]] & ~ [[[p3<=1 & p4<=p5] | ~ [E [true U ~ [p12<=p17]]]]]]]]] & [[[~ [p11<=p9] | E [1<=p16 U p4<=1]] & p11<=0] & ~ [E [true U 1<=p16]]]] & E [true U ~ [E [p19<=p18 U p11<=p8]]]]]]
abstracting: (p11<=p8)
states: 1,024 (3)
abstracting: (p19<=p18)
states: 1,024 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p11<=0)
states: 0
abstracting: (p4<=1)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p11<=p9)
states: 1,024 (3)
abstracting: (p12<=p17)
states: 2,048 (3)
abstracting: (p4<=p5)
states: 2,048 (3)
abstracting: (p3<=1)
states: 2,048 (3)
abstracting: (1<=p10)
states: 1,024 (3)
abstracting: (p12<=p17)
states: 2,048 (3)
abstracting: (p4<=p5)
states: 2,048 (3)
abstracting: (p3<=1)
states: 2,048 (3)
abstracting: (p12<=p17)
states: 2,048 (3)
abstracting: (p4<=p5)
states: 2,048 (3)
abstracting: (p3<=1)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,024 (3)
abstracting: (p4<=p4)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (p6<=0)
states: 1,024 (3)
.abstracting: (1<=p15)
states: 1,024 (3)
.abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p16<=p3)
states: 2,048 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p12<=p7)
states: 2,048 (3)
.
EG iterations: 1
abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p16<=p3)
states: 2,048 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
.
EG iterations: 1
abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p16<=p3)
states: 2,048 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
abstracting: (p3<=p6)
states: 1,024 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p9<=0)
states: 1,024 (3)
abstracting: (p18<=1)
states: 2,048 (3)
abstracting: (1<=p16)
states: 1,024 (3)
abstracting: (1<=p5)
states: 2,048 (3)
abstracting: (p17<=0)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 5966 (6.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13412 16165 29577
used/not used/entry size/cache size: 21966 67086898 16 1024MB
basic ops cache: hits/miss/sum: 2986 4140 7126
used/not used/entry size/cache size: 7604 16769612 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: 197 156 353
used/not used/entry size/cache size: 156 8388452 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 67103044
1 5685
2 124
3 11
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.668sec
BK_STOP 1679420060494
--------------------
content from stderr:
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p19
p17
p13
p11
The net has transition(s) that can never fire:
check for constant places
p2
p3
p7
p5
p11
p13
p17
p19
found 8 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.000sec
iterations count:153 (5), effective:11 (0)
initing FirstDep: 0m 0.000sec
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:32 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:38 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:39 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:36 (1), effective:1 (0)
iterations count:38 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:48 (1), effective:1 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:27 (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="Eratosthenes-PT-020"
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 Eratosthenes-PT-020, 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 r161-tall-167838844700145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-020.tgz
mv Eratosthenes-PT-020 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 ;