About the Execution of Marcie for Philosophers-PT-000005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5448.796 | 5230.00 | 5011.00 | 69.30 | TTTTFFFTTFTFFFTF | 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.r289-tall-167873940000185.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 Philosophers-PT-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r289-tall-167873940000185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 22K Mar 5 18:23 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 Philosophers-PT-000005-CTLCardinality-00
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-01
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-02
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-03
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-04
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-05
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-06
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-07
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-08
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-09
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-10
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-11
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-12
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-13
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-14
FORMULA_NAME Philosophers-PT-000005-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678758784589
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=Philosophers-PT-000005
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: Philosophers_PT_000005
(NrP: 25 NrTr: 25 NrArc: 80)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.911sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 110 (1.1e+02) #states 243
starting MCC model checker
--------------------------
checking: EG [~ [1<=Catch2_5]]
normalized: EG [~ [1<=Catch2_5]]
abstracting: (1<=Catch2_5)
states: 54
.
EG iterations: 1
-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: ~ [AG [EF [AG [Think_5<=Catch1_5]]]]
normalized: E [true U ~ [E [true U ~ [E [true U ~ [Think_5<=Catch1_5]]]]]]
abstracting: (Think_5<=Catch1_5)
states: 135
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EX [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=12]
normalized: EX [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=12]
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=12)
states: 243
.-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: AX [AG [~ [AG [EX [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=23]]]]]
normalized: ~ [EX [E [true U ~ [E [true U ~ [EX [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=23]]]]]]]
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=23)
states: 243
..-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AG [AG [~ [sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=30]]]
normalized: ~ [E [true U E [true U sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=30]]]
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=30)
states: 243
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: ~ [AF [~ [EG [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=59]]]]]
normalized: EG [EG [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=59]]]
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=59)
states: 243
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: ~ [EF [~ [[[1<=Catch1_3 | [Think_2<=Eat_5 | Eat_2<=Catch1_1]] & A [AX [Catch1_3<=0] U ~ [Fork_3<=Fork_1]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [Fork_3<=Fork_1]] & ~ [E [Fork_3<=Fork_1 U [EX [~ [Catch1_3<=0]] & Fork_3<=Fork_1]]]] & [[Think_2<=Eat_5 | Eat_2<=Catch1_1] | 1<=Catch1_3]]]]]
abstracting: (1<=Catch1_3)
states: 54
abstracting: (Eat_2<=Catch1_1)
states: 225
abstracting: (Think_2<=Eat_5)
states: 147
abstracting: (Fork_3<=Fork_1)
states: 189
abstracting: (Catch1_3<=0)
states: 189
.abstracting: (Fork_3<=Fork_1)
states: 189
abstracting: (Fork_3<=Fork_1)
states: 189
...
EG iterations: 3
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [AF [AF [[AX [[1<=Catch1_1 & Catch2_5<=Eat_2]] | EX [AF [1<=Think_2]]]]] & EF [E [Think_3<=Catch2_2 U [[AF [Think_5<=0] | [AG [Think_4<=1] & ~ [1<=Catch1_4]]] & AG [[1<=Catch2_2 & 1<=Catch2_1]]]]]]
normalized: [~ [EG [EG [~ [[EX [~ [EG [~ [1<=Think_2]]]] | ~ [EX [~ [[1<=Catch1_1 & Catch2_5<=Eat_2]]]]]]]]] & E [true U E [Think_3<=Catch2_2 U [~ [E [true U ~ [[1<=Catch2_2 & 1<=Catch2_1]]]] & [~ [EG [~ [Think_5<=0]]] | [~ [1<=Catch1_4] & ~ [E [true U ~ [Think_4<=1]]]]]]]]]
abstracting: (Think_4<=1)
states: 243
abstracting: (1<=Catch1_4)
states: 54
abstracting: (Think_5<=0)
states: 135
.
EG iterations: 1
abstracting: (1<=Catch2_1)
states: 54
abstracting: (1<=Catch2_2)
states: 54
abstracting: (Think_3<=Catch2_2)
states: 171
abstracting: (Catch2_5<=Eat_2)
states: 195
abstracting: (1<=Catch1_1)
states: 54
.abstracting: (1<=Think_2)
states: 108
...
EG iterations: 3
....
EG iterations: 3
.
EG iterations: 1
-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: E [~ [[[[[Catch2_5<=Think_5 | Eat_4<=Think_2] & Think_2<=1] | ~ [AG [[Fork_2<=Eat_3 & Think_3<=0]]]] & AF [~ [AF [1<=Think_4]]]]] U AF [~ [EG [[E [Catch1_3<=0 U Think_3<=Think_1] | EF [Catch1_4<=1]]]]]]
normalized: E [~ [[[E [true U ~ [[Fork_2<=Eat_3 & Think_3<=0]]] | [[Catch2_5<=Think_5 | Eat_4<=Think_2] & Think_2<=1]] & ~ [EG [~ [EG [~ [1<=Think_4]]]]]]] U ~ [EG [EG [[E [true U Catch1_4<=1] | E [Catch1_3<=0 U Think_3<=Think_1]]]]]]
abstracting: (Think_3<=Think_1)
states: 183
abstracting: (Catch1_3<=0)
states: 189
abstracting: (Catch1_4<=1)
states: 243
EG iterations: 0
EG iterations: 0
abstracting: (1<=Think_4)
states: 108
...
EG iterations: 3
.
EG iterations: 1
abstracting: (Think_2<=1)
states: 243
abstracting: (Eat_4<=Think_2)
states: 228
abstracting: (Catch2_5<=Think_5)
states: 189
abstracting: (Think_3<=0)
states: 135
abstracting: (Fork_2<=Eat_3)
states: 162
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [AG [Eat_4<=Catch2_4] & [E [EF [~ [EF [1<=Eat_4]]] U ~ [[E [[Fork_5<=0 & Eat_4<=1] U 1<=Catch2_5] | EX [EX [Think_4<=1]]]]] | ~ [[[EF [[[Eat_5<=0 & Think_3<=Think_1] | ~ [1<=Eat_3]]] | AX [EX [Eat_5<=Eat_5]]] | AG [[[AG [1<=Eat_2] & [Catch1_3<=0 & Eat_4<=Catch1_1]] & [~ [1<=Catch1_1] & 1<=Eat_3]]]]]]]
normalized: [[E [E [true U ~ [E [true U 1<=Eat_4]]] U ~ [[E [[Fork_5<=0 & Eat_4<=1] U 1<=Catch2_5] | EX [EX [Think_4<=1]]]]] | ~ [[~ [E [true U ~ [[[~ [E [true U ~ [1<=Eat_2]]] & [Catch1_3<=0 & Eat_4<=Catch1_1]] & [~ [1<=Catch1_1] & 1<=Eat_3]]]]] | [E [true U [~ [1<=Eat_3] | [Eat_5<=0 & Think_3<=Think_1]]] | ~ [EX [~ [EX [Eat_5<=Eat_5]]]]]]]] & ~ [E [true U ~ [Eat_4<=Catch2_4]]]]
abstracting: (Eat_4<=Catch2_4)
states: 216
abstracting: (Eat_5<=Eat_5)
states: 243
..abstracting: (Think_3<=Think_1)
states: 183
abstracting: (Eat_5<=0)
states: 216
abstracting: (1<=Eat_3)
states: 27
abstracting: (1<=Eat_3)
states: 27
abstracting: (1<=Catch1_1)
states: 54
abstracting: (Eat_4<=Catch1_1)
states: 222
abstracting: (Catch1_3<=0)
states: 189
abstracting: (1<=Eat_2)
states: 27
abstracting: (Think_4<=1)
states: 243
..abstracting: (1<=Catch2_5)
states: 54
abstracting: (Eat_4<=1)
states: 243
abstracting: (Fork_5<=0)
states: 162
abstracting: (1<=Eat_4)
states: 27
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [E [[[~ [Think_2<=Fork_4] & ~ [Catch2_4<=1]] & [E [[~ [Eat_4<=Catch2_1] & AX [Think_1<=Think_4]] U ~ [[Catch1_4<=0 & Catch2_5<=0]]] | ~ [AF [[Catch1_4<=Catch1_5 & 1<=Catch2_5]]]]] U [1<=Think_3 & [~ [[Fork_1<=Catch2_5 & [1<=Think_4 & [Fork_4<=Fork_2 | 1<=Fork_1]]]] | [~ [EG [Catch1_3<=1]] & Think_1<=0]]]]]
normalized: ~ [E [[[EG [~ [[Catch1_4<=Catch1_5 & 1<=Catch2_5]]] | E [[~ [EX [~ [Think_1<=Think_4]]] & ~ [Eat_4<=Catch2_1]] U ~ [[Catch1_4<=0 & Catch2_5<=0]]]] & [~ [Catch2_4<=1] & ~ [Think_2<=Fork_4]]] U [[~ [[[[Fork_4<=Fork_2 | 1<=Fork_1] & 1<=Think_4] & Fork_1<=Catch2_5]] | [~ [EG [Catch1_3<=1]] & Think_1<=0]] & 1<=Think_3]]]
abstracting: (1<=Think_3)
states: 108
abstracting: (Think_1<=0)
states: 135
abstracting: (Catch1_3<=1)
states: 243
EG iterations: 0
abstracting: (Fork_1<=Catch2_5)
states: 180
abstracting: (1<=Think_4)
states: 108
abstracting: (1<=Fork_1)
states: 81
abstracting: (Fork_4<=Fork_2)
states: 189
abstracting: (Think_2<=Fork_4)
states: 171
abstracting: (Catch2_4<=1)
states: 243
abstracting: (Catch2_5<=0)
states: 189
abstracting: (Catch1_4<=0)
states: 189
abstracting: (Eat_4<=Catch2_1)
states: 222
abstracting: (Think_1<=Think_4)
states: 183
.abstracting: (1<=Catch2_5)
states: 54
abstracting: (Catch1_4<=Catch1_5)
states: 207
.
EG iterations: 1
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [[[1<=Think_4 & AF [[AX [Catch1_3<=Eat_3] | [[1<=Fork_4 & Think_5<=0] & AX [Catch2_3<=0]]]]] & A [Eat_2<=Catch1_3 U [AF [A [1<=Fork_2 U Eat_5<=1]] | ~ [AX [1<=Catch2_1]]]]] U [[[A [[[Catch1_2<=0 | 1<=Eat_2] | E [Catch1_1<=0 U Catch1_5<=1]] U EX [Think_2<=Think_1]] & 1<=Eat_3] & [~ [A [[1<=Catch1_3 | 1<=Eat_1] U Catch1_1<=Catch1_3]] & ~ [1<=Fork_3]]] | Eat_4<=1]]
normalized: [~ [EG [~ [[[[~ [[~ [EG [~ [Catch1_1<=Catch1_3]]] & ~ [E [~ [Catch1_1<=Catch1_3] U [~ [[1<=Catch1_3 | 1<=Eat_1]] & ~ [Catch1_1<=Catch1_3]]]]]] & ~ [1<=Fork_3]] & [[~ [EG [~ [EX [Think_2<=Think_1]]]] & ~ [E [~ [EX [Think_2<=Think_1]] U [~ [[E [Catch1_1<=0 U Catch1_5<=1] | [Catch1_2<=0 | 1<=Eat_2]]] & ~ [EX [Think_2<=Think_1]]]]]] & 1<=Eat_3]] | Eat_4<=1]]]] & ~ [E [~ [[[[~ [[~ [EG [~ [Catch1_1<=Catch1_3]]] & ~ [E [~ [Catch1_1<=Catch1_3] U [~ [[1<=Catch1_3 | 1<=Eat_1]] & ~ [Catch1_1<=Catch1_3]]]]]] & ~ [1<=Fork_3]] & [[~ [EG [~ [EX [Think_2<=Think_1]]]] & ~ [E [~ [EX [Think_2<=Think_1]] U [~ [[E [Catch1_1<=0 U Catch1_5<=1] | [Catch1_2<=0 | 1<=Eat_2]]] & ~ [EX [Think_2<=Think_1]]]]]] & 1<=Eat_3]] | Eat_4<=1]] U [~ [[[~ [EG [~ [[[~ [EX [~ [Catch2_3<=0]]] & [1<=Fork_4 & Think_5<=0]] | ~ [EX [~ [Catch1_3<=Eat_3]]]]]]] & 1<=Think_4] & [~ [EG [~ [[EX [~ [1<=Catch2_1]] | ~ [EG [~ [[~ [EG [~ [Eat_5<=1]]] & ~ [E [~ [Eat_5<=1] U [~ [1<=Fork_2] & ~ [Eat_5<=1]]]]]]]]]]]] & ~ [E [~ [[EX [~ [1<=Catch2_1]] | ~ [EG [~ [[~ [EG [~ [Eat_5<=1]]] & ~ [E [~ [Eat_5<=1] U [~ [1<=Fork_2] & ~ [Eat_5<=1]]]]]]]]]] U [~ [Eat_2<=Catch1_3] & ~ [[EX [~ [1<=Catch2_1]] | ~ [EG [~ [[~ [EG [~ [Eat_5<=1]]] & ~ [E [~ [Eat_5<=1] U [~ [1<=Fork_2] & ~ [Eat_5<=1]]]]]]]]]]]]]]]] & ~ [[[[~ [[~ [EG [~ [Catch1_1<=Catch1_3]]] & ~ [E [~ [Catch1_1<=Catch1_3] U [~ [[1<=Catch1_3 | 1<=Eat_1]] & ~ [Catch1_1<=Catch1_3]]]]]] & ~ [1<=Fork_3]] & [[~ [EG [~ [EX [Think_2<=Think_1]]]] & ~ [E [~ [EX [Think_2<=Think_1]] U [~ [[E [Catch1_1<=0 U Catch1_5<=1] | [Catch1_2<=0 | 1<=Eat_2]]] & ~ [EX [Think_2<=Think_1]]]]]] & 1<=Eat_3]] | Eat_4<=1]]]]]]
abstracting: (Eat_4<=1)
states: 243
abstracting: (1<=Eat_3)
states: 27
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (1<=Eat_2)
states: 27
abstracting: (Catch1_2<=0)
states: 189
abstracting: (Catch1_5<=1)
states: 243
abstracting: (Catch1_1<=0)
states: 189
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (Think_2<=Think_1)
states: 171
....
EG iterations: 3
abstracting: (1<=Fork_3)
states: 81
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (1<=Eat_1)
states: 27
abstracting: (1<=Catch1_3)
states: 54
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (Catch1_1<=Catch1_3)
states: 201
.
EG iterations: 1
abstracting: (Eat_5<=1)
states: 243
abstracting: (1<=Fork_2)
states: 81
abstracting: (Eat_5<=1)
states: 243
abstracting: (Eat_5<=1)
states: 243
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Catch2_1)
states: 54
.abstracting: (Eat_2<=Catch1_3)
states: 216
abstracting: (Eat_5<=1)
states: 243
abstracting: (1<=Fork_2)
states: 81
abstracting: (Eat_5<=1)
states: 243
abstracting: (Eat_5<=1)
states: 243
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Catch2_1)
states: 54
.abstracting: (Eat_5<=1)
states: 243
abstracting: (1<=Fork_2)
states: 81
abstracting: (Eat_5<=1)
states: 243
abstracting: (Eat_5<=1)
states: 243
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=Catch2_1)
states: 54
..
EG iterations: 1
abstracting: (1<=Think_4)
states: 108
abstracting: (Catch1_3<=Eat_3)
states: 189
.abstracting: (Think_5<=0)
states: 135
abstracting: (1<=Fork_4)
states: 81
abstracting: (Catch2_3<=0)
states: 189
.....
EG iterations: 4
abstracting: (Eat_4<=1)
states: 243
abstracting: (1<=Eat_3)
states: 27
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (1<=Eat_2)
states: 27
abstracting: (Catch1_2<=0)
states: 189
abstracting: (Catch1_5<=1)
states: 243
abstracting: (Catch1_1<=0)
states: 189
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (Think_2<=Think_1)
states: 171
....
EG iterations: 3
abstracting: (1<=Fork_3)
states: 81
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (1<=Eat_1)
states: 27
abstracting: (1<=Catch1_3)
states: 54
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (Catch1_1<=Catch1_3)
states: 201
.
EG iterations: 1
abstracting: (Eat_4<=1)
states: 243
abstracting: (1<=Eat_3)
states: 27
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (1<=Eat_2)
states: 27
abstracting: (Catch1_2<=0)
states: 189
abstracting: (Catch1_5<=1)
states: 243
abstracting: (Catch1_1<=0)
states: 189
abstracting: (Think_2<=Think_1)
states: 171
.abstracting: (Think_2<=Think_1)
states: 171
....
EG iterations: 3
abstracting: (1<=Fork_3)
states: 81
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (1<=Eat_1)
states: 27
abstracting: (1<=Catch1_3)
states: 54
abstracting: (Catch1_1<=Catch1_3)
states: 201
abstracting: (Catch1_1<=Catch1_3)
states: 201
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: [~ [E [94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) U EF [~ [AF [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=63]]]]] & EX [EG [EG [[[95<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=20] & ~ [45<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]]
normalized: [EX [EG [EG [[[95<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) | sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=20] & ~ [45<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]] & ~ [E [94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) U E [true U EG [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=63]]]]]]
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=63)
states: 243
.
EG iterations: 1
abstracting: (94<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 0
abstracting: (45<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=20)
states: 243
abstracting: (95<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
EG iterations: 0
EG iterations: 0
.-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.105sec
checking: EG [E [AX [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=46]] U ~ [[A [A [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2) U 25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] U AX [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] & EF [AG [49<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]]]]
normalized: EG [E [~ [EX [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=46]] U ~ [[E [true U ~ [E [true U ~ [49<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]]] & [~ [EG [EX [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]] & ~ [E [EX [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]] U [~ [[~ [EG [~ [25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]] & ~ [E [~ [25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] U [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2)] & ~ [25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]]]]]] & EX [~ [sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]]]]]]
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
.abstracting: (25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch2_5, Catch2_3, Catch2_4, Catch2_1, Catch2_2))
states: 188
abstracting: (25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (25<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
EG iterations: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
.abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
..
EG iterations: 1
abstracting: (49<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=46)
states: 243
.
EG iterations: 0
-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.117sec
checking: AG [E [E [[100<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & AF [91<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]] U [AF [43<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 56<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=59]]] U ~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=91]]]
normalized: ~ [E [true U ~ [E [E [[~ [EG [~ [91<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)]]] & 100<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)] U [[[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) & 56<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)] | sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=59] | ~ [EG [~ [43<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]] U ~ [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=91]]]]]
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=91)
states: 243
abstracting: (43<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
EG iterations: 0
abstracting: (sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)<=59)
states: 243
abstracting: (56<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 112
abstracting: (100<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 0
abstracting: (91<=sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1))
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Philosophers-PT-000005-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.130sec
checking: ~ [AG [[EF [[[95<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1) | [sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=9 & 18<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)]] & AX [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] | ~ [AG [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & AF [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]]]]
normalized: E [true U ~ [[E [true U ~ [[sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1) & ~ [EG [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)]]]]]] | E [true U [~ [EX [~ [sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]] & [[sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=9 & 18<=sum(Think_5, Think_4, Think_3, Think_2, Think_1)] | 95<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1)]]]]]]
abstracting: (95<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 0
abstracting: (18<=sum(Think_5, Think_4, Think_3, Think_2, Think_1))
states: 0
abstracting: (sum(Think_5, Think_4, Think_3, Think_2, Think_1)<=9)
states: 243
abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Catch1_4, Catch1_5, Catch1_3, Catch1_2, Catch1_1))
states: 188
.abstracting: (sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 243
.
EG iterations: 1
abstracting: (sum(Fork_5, Fork_4, Fork_3, Fork_2, Fork_1)<=sum(Eat_4, Eat_5, Eat_2, Eat_3, Eat_1))
states: 87
-> the formula is TRUE
FORMULA Philosophers-PT-000005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.108sec
totally nodes used: 15848 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 18192 59916 78108
used/not used/entry size/cache size: 73488 67035376 16 1024MB
basic ops cache: hits/miss/sum: 7297 18410 25707
used/not used/entry size/cache size: 32185 16745031 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 4743 4743
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 694 2012 2706
used/not used/entry size/cache size: 2012 8386596 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 67093208
1 15465
2 190
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.183sec
BK_STOP 1678758789819
--------------------
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:108 (4), effective:15 (0)
initing FirstDep: 0m 0.000sec
iterations count:136 (5), effective:15 (0)
iterations count:242 (9), effective:36 (1)
iterations count:242 (9), effective:36 (1)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:116 (4), effective:16 (0)
iterations count:84 (3), effective:11 (0)
iterations count:72 (2), effective:5 (0)
iterations count:186 (7), effective:23 (0)
iterations count:103 (4), effective:11 (0)
iterations count:86 (3), effective:10 (0)
iterations count:25 (1), effective:0 (0)
iterations count:128 (5), effective:14 (0)
iterations count:189 (7), effective:24 (0)
iterations count:31 (1), effective:1 (0)
iterations count:33 (1), effective:1 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:189 (7), effective:24 (0)
iterations count:242 (9), effective:36 (1)
iterations count:213 (8), effective:29 (1)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:233 (9), effective:34 (1)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:95 (3), effective:11 (0)
iterations count:242 (9), effective:36 (1)
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="Philosophers-PT-000005"
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 Philosophers-PT-000005, 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 r289-tall-167873940000185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 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 ;