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.r225-tall-167856407300233.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 Kanban-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407300233
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 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 Kanban-PT-00005-CTLCardinality-00
FORMULA_NAME Kanban-PT-00005-CTLCardinality-01
FORMULA_NAME Kanban-PT-00005-CTLCardinality-02
FORMULA_NAME Kanban-PT-00005-CTLCardinality-03
FORMULA_NAME Kanban-PT-00005-CTLCardinality-04
FORMULA_NAME Kanban-PT-00005-CTLCardinality-05
FORMULA_NAME Kanban-PT-00005-CTLCardinality-06
FORMULA_NAME Kanban-PT-00005-CTLCardinality-07
FORMULA_NAME Kanban-PT-00005-CTLCardinality-08
FORMULA_NAME Kanban-PT-00005-CTLCardinality-09
FORMULA_NAME Kanban-PT-00005-CTLCardinality-10
FORMULA_NAME Kanban-PT-00005-CTLCardinality-11
FORMULA_NAME Kanban-PT-00005-CTLCardinality-12
FORMULA_NAME Kanban-PT-00005-CTLCardinality-13
FORMULA_NAME Kanban-PT-00005-CTLCardinality-14
FORMULA_NAME Kanban-PT-00005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678613535390

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=Kanban-PT-00005
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: Kanban_PT_00005
(NrP: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.805sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)



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

checking: AG [AF [AX [AX [AX [P2<=5]]]]]
normalized: ~ [E [true U EG [EX [EX [EX [~ [P2<=5]]]]]]]

abstracting: (P2<=5)
states: 2,546,432 (6)
....
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [~ [AG [P2<=Pm3]]]
normalized: ~ [E [true U ~ [E [true U ~ [P2<=Pm3]]]]]

abstracting: (P2<=Pm3)
states: 1,947,456 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [P3<=Pm2]
normalized: EX [P3<=Pm2]

abstracting: (P3<=Pm2)
states: 1,947,456 (6)
.-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AX [[EX [AG [EX [Pback1<=1]]] | AX [AG [[Pback1<=2 | 5<=Pout3]]]]]]
normalized: EX [~ [[~ [EX [E [true U ~ [[Pback1<=2 | 5<=Pout3]]]]] | EX [~ [E [true U ~ [EX [Pback1<=1]]]]]]]]

abstracting: (Pback1<=1)
states: 1,636,992 (6)
..abstracting: (5<=Pout3)
states: 65,856 (4)
abstracting: (Pback1<=2)
states: 2,091,712 (6)
..-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [Pout4<=Pm2 U AX [~ [Pback2<=2]]]
normalized: E [Pout4<=Pm2 U ~ [EX [Pback2<=2]]]

abstracting: (Pback2<=2)
states: 1,978,816 (6)
.abstracting: (Pout4<=Pm2)
states: 1,676,808 (6)
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [EG [AX [[AF [P2<=3] & [E [2<=Pback3 U 3<=P2] & AG [4<=Pback2]]]]]]
normalized: E [true U EG [~ [EX [~ [[[~ [E [true U ~ [4<=Pback2]]] & E [2<=Pback3 U 3<=P2]] & ~ [EG [~ [P2<=3]]]]]]]]]

abstracting: (P2<=3)
states: 2,515,072 (6)
.
EG iterations: 1
abstracting: (3<=P2)
states: 144,256 (5)
abstracting: (2<=Pback3)
states: 1,053,696 (6)
abstracting: (4<=Pback2)
states: 244,608 (5)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[[AG [AG [[P3<=1 | Pback1<=3]]] | EX [4<=Pm1]] & ~ [4<=Pm3]]]
normalized: EG [[~ [4<=Pm3] & [EX [4<=Pm1] | ~ [E [true U E [true U ~ [[P3<=1 | Pback1<=3]]]]]]]]

abstracting: (Pback1<=3)
states: 2,364,544 (6)
abstracting: (P3<=1)
states: 2,088,576 (6)
abstracting: (4<=Pm1)
states: 181,888 (5)
.abstracting: (4<=Pm3)
states: 244,608 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [EF [[AG [[EX [5<=Pout4] | P1<=4]] & ~ [E [~ [4<=P4] U ~ [Pm4<=P1]]]]]]
normalized: ~ [EG [~ [E [true U [~ [E [~ [4<=P4] U ~ [Pm4<=P1]]] & ~ [E [true U ~ [[EX [5<=Pout4] | P1<=4]]]]]]]]]

abstracting: (P1<=4)
states: 2,500,960 (6)
abstracting: (5<=Pout4)
states: 45,472 (4)
.abstracting: (Pm4<=P1)
states: 1,602,888 (6)
abstracting: (4<=P4)
states: 181,888 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [[EF [~ [P4<=Pm1]] & EX [P4<=2]] | A [~ [2<=Pout1] U 5<=Pout1]]
normalized: [[~ [EG [~ [5<=Pout1]]] & ~ [E [~ [5<=Pout1] U [~ [5<=Pout1] & 2<=Pout1]]]] | [EX [P4<=2] & E [true U ~ [P4<=Pm1]]]]

abstracting: (P4<=Pm1)
states: 1,602,888 (6)
abstracting: (P4<=2)
states: 2,091,712 (6)
.abstracting: (2<=Pout1)
states: 909,440 (5)
abstracting: (5<=Pout1)
states: 45,472 (4)
abstracting: (5<=Pout1)
states: 45,472 (4)
abstracting: (5<=Pout1)
states: 45,472 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [~ [[Pback3<=3 & Pback2<=Pout3]] U EF [EX [E [~ [Pout4<=Pback2] U [Pout3<=Pback2 & P1<=Pm2]]]]]
normalized: [~ [EG [~ [E [true U EX [E [~ [Pout4<=Pback2] U [Pout3<=Pback2 & P1<=Pm2]]]]]]] & ~ [E [~ [E [true U EX [E [~ [Pout4<=Pback2] U [Pout3<=Pback2 & P1<=Pm2]]]]] U [[Pback3<=3 & Pback2<=Pout3] & ~ [E [true U EX [E [~ [Pout4<=Pback2] U [Pout3<=Pback2 & P1<=Pm2]]]]]]]]]

abstracting: (P1<=Pm2)
states: 1,676,808 (6)
abstracting: (Pout3<=Pback2)
states: 1,580,544 (6)
abstracting: (Pout4<=Pback2)
states: 1,676,808 (6)
.abstracting: (Pback2<=Pout3)
states: 1,580,544 (6)
abstracting: (Pback3<=3)
states: 2,301,824 (6)
abstracting: (P1<=Pm2)
states: 1,676,808 (6)
abstracting: (Pout3<=Pback2)
states: 1,580,544 (6)
abstracting: (Pout4<=Pback2)
states: 1,676,808 (6)
.abstracting: (P1<=Pm2)
states: 1,676,808 (6)
abstracting: (Pout3<=Pback2)
states: 1,580,544 (6)
abstracting: (Pout4<=Pback2)
states: 1,676,808 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [[~ [[Pback4<=Pback4 | [A [EG [5<=P3] U [4<=Pback2 & P2<=0]] & EF [EG [Pout4<=P3]]]]] & AF [Pout4<=Pm3]]]
normalized: E [true U [~ [EG [~ [Pout4<=Pm3]]] & ~ [[[E [true U EG [Pout4<=P3]] & [~ [EG [~ [[4<=Pback2 & P2<=0]]]] & ~ [E [~ [[4<=Pback2 & P2<=0]] U [~ [EG [5<=P3]] & ~ [[4<=Pback2 & P2<=0]]]]]]] | Pback4<=Pback4]]]]

abstracting: (Pback4<=Pback4)
states: 2,546,432 (6)
abstracting: (P2<=0)
states: 1,382,976 (6)
abstracting: (4<=Pback2)
states: 244,608 (5)
abstracting: (5<=P3)
states: 3,136 (3)
.......
EG iterations: 7
abstracting: (P2<=0)
states: 1,382,976 (6)
abstracting: (4<=Pback2)
states: 244,608 (5)
abstracting: (P2<=0)
states: 1,382,976 (6)
abstracting: (4<=Pback2)
states: 244,608 (5)
.
EG iterations: 1
abstracting: (Pout4<=P3)
states: 1,365,504 (6)
.
EG iterations: 1
abstracting: (Pout4<=Pm3)
states: 1,676,808 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [E [[AX [~ [Pback4<=5]] | ~ [[EF [~ [P1<=3]] & AG [AF [5<=Pout3]]]]] U EX [E [AG [5<=Pm4] U EG [5<=Pback3]]]] & EG [A [~ [AG [[1<=Pm1 | 4<=P1]]] U [[Pm2<=Pout2 | 5<=P2] | AX [AX [3<=Pm1]]]]]]
normalized: [EG [[~ [EG [~ [[~ [EX [EX [~ [3<=Pm1]]]] | [Pm2<=Pout2 | 5<=P2]]]]] & ~ [E [~ [[~ [EX [EX [~ [3<=Pm1]]]] | [Pm2<=Pout2 | 5<=P2]]] U [~ [E [true U ~ [[1<=Pm1 | 4<=P1]]]] & ~ [[~ [EX [EX [~ [3<=Pm1]]]] | [Pm2<=Pout2 | 5<=P2]]]]]]]] & E [[~ [[~ [E [true U EG [~ [5<=Pout3]]]] & E [true U ~ [P1<=3]]]] | ~ [EX [Pback4<=5]]] U EX [E [~ [E [true U ~ [5<=Pm4]]] U EG [5<=Pback3]]]]]

abstracting: (5<=Pback3)
states: 65,856 (4)
.......
EG iterations: 7
abstracting: (5<=Pm4)
states: 45,472 (4)
.abstracting: (Pback4<=5)
states: 2,546,432 (6)
.abstracting: (P1<=3)
states: 2,364,544 (6)
abstracting: (5<=Pout3)
states: 65,856 (4)
.
EG iterations: 1
abstracting: (5<=P2)
states: 3,136 (3)
abstracting: (Pm2<=Pout2)
states: 1,499,008 (6)
abstracting: (3<=Pm1)
states: 454,720 (5)
..abstracting: (4<=P1)
states: 181,888 (5)
abstracting: (1<=Pm1)
states: 1,591,520 (6)
abstracting: (5<=P2)
states: 3,136 (3)
abstracting: (Pm2<=Pout2)
states: 1,499,008 (6)
abstracting: (3<=Pm1)
states: 454,720 (5)
..abstracting: (5<=P2)
states: 3,136 (3)
abstracting: (Pm2<=Pout2)
states: 1,499,008 (6)
abstracting: (3<=Pm1)
states: 454,720 (5)
...
EG iterations: 1
.......
EG iterations: 7
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [[~ [[[~ [E [Pout3<=Pout4 U Pback2<=Pback2]] & [EF [1<=Pout4] & A [Pback4<=5 U Pout2<=P2]]] | [EF [[P1<=0 | 5<=Pm2]] | AF [~ [Pm3<=1]]]]] & ~ [Pm2<=4]]]
normalized: ~ [EX [~ [[~ [Pm2<=4] & ~ [[[~ [EG [Pm3<=1]] | E [true U [P1<=0 | 5<=Pm2]]] | [[[~ [EG [~ [Pout2<=P2]]] & ~ [E [~ [Pout2<=P2] U [~ [Pback4<=5] & ~ [Pout2<=P2]]]]] & E [true U 1<=Pout4]] & ~ [E [Pout3<=Pout4 U Pback2<=Pback2]]]]]]]]]

abstracting: (Pback2<=Pback2)
states: 2,546,432 (6)
abstracting: (Pout3<=Pout4)
states: 1,491,000 (6)
abstracting: (1<=Pout4)
states: 1,591,520 (6)
abstracting: (Pout2<=P2)
states: 1,244,992 (6)
abstracting: (Pback4<=5)
states: 2,546,432 (6)
abstracting: (Pout2<=P2)
states: 1,244,992 (6)
abstracting: (Pout2<=P2)
states: 1,244,992 (6)
.
EG iterations: 1
abstracting: (5<=Pm2)
states: 65,856 (4)
abstracting: (P1<=0)
states: 954,912 (5)
abstracting: (Pm3<=1)
states: 1,492,736 (6)
.
EG iterations: 1
abstracting: (Pm2<=4)
states: 2,480,576 (6)
.-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: A [Pm4<=5 U [[AX [Pm3<=1] & [EG [[[Pout1<=0 | 5<=Pback3] & EG [Pm1<=Pback3]]] | EF [[[Pout3<=Pback4 & 5<=Pm4] & ~ [Pback2<=4]]]]] | Pm3<=P2]]
normalized: [~ [EG [~ [[Pm3<=P2 | [[E [true U [~ [Pback2<=4] & [Pout3<=Pback4 & 5<=Pm4]]] | EG [[EG [Pm1<=Pback3] & [Pout1<=0 | 5<=Pback3]]]] & ~ [EX [~ [Pm3<=1]]]]]]]] & ~ [E [~ [[Pm3<=P2 | [[E [true U [~ [Pback2<=4] & [Pout3<=Pback4 & 5<=Pm4]]] | EG [[EG [Pm1<=Pback3] & [Pout1<=0 | 5<=Pback3]]]] & ~ [EX [~ [Pm3<=1]]]]]] U [~ [Pm4<=5] & ~ [[Pm3<=P2 | [[E [true U [~ [Pback2<=4] & [Pout3<=Pback4 & 5<=Pm4]]] | EG [[EG [Pm1<=Pback3] & [Pout1<=0 | 5<=Pback3]]]] & ~ [EX [~ [Pm3<=1]]]]]]]]]]

abstracting: (Pm3<=1)
states: 1,492,736 (6)
.abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (Pm1<=Pback3)
states: 1,676,808 (6)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (5<=Pm4)
states: 45,472 (4)
abstracting: (Pout3<=Pback4)
states: 1,491,000 (6)
abstracting: (Pback2<=4)
states: 2,480,576 (6)
abstracting: (Pm3<=P2)
states: 1,244,992 (6)
abstracting: (Pm4<=5)
states: 2,546,432 (6)
abstracting: (Pm3<=1)
states: 1,492,736 (6)
.abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (Pm1<=Pback3)
states: 1,676,808 (6)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (5<=Pm4)
states: 45,472 (4)
abstracting: (Pout3<=Pback4)
states: 1,491,000 (6)
abstracting: (Pback2<=4)
states: 2,480,576 (6)
abstracting: (Pm3<=P2)
states: 1,244,992 (6)
abstracting: (Pm3<=1)
states: 1,492,736 (6)
.abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (Pout1<=0)
states: 954,912 (5)
abstracting: (Pm1<=Pback3)
states: 1,676,808 (6)
.......
EG iterations: 7
.
EG iterations: 1
abstracting: (5<=Pm4)
states: 45,472 (4)
abstracting: (Pout3<=Pback4)
states: 1,491,000 (6)
abstracting: (Pback2<=4)
states: 2,480,576 (6)
abstracting: (Pm3<=P2)
states: 1,244,992 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [~ [[E [E [E [Pout4<=1 U Pm1<=P1] U EG [5<=P1]] U EX [~ [P4<=Pout4]]] & EX [[[5<=Pback3 & A [2<=Pout4 U 2<=Pm2]] & ~ [[3<=Pout2 & 5<=Pout2]]]]]] & AG [A [~ [EG [EF [4<=Pback1]]] U ~ [5<=Pback2]]]]
normalized: [~ [E [true U ~ [[~ [EG [5<=Pback2]] & ~ [E [5<=Pback2 U [5<=Pback2 & EG [E [true U 4<=Pback1]]]]]]]]] & ~ [[EX [[~ [[3<=Pout2 & 5<=Pout2]] & [5<=Pback3 & [~ [EG [~ [2<=Pm2]]] & ~ [E [~ [2<=Pm2] U [~ [2<=Pout4] & ~ [2<=Pm2]]]]]]]] & E [E [E [Pout4<=1 U Pm1<=P1] U EG [5<=P1]] U EX [~ [P4<=Pout4]]]]]]

abstracting: (P4<=Pout4)
states: 1,546,048 (6)
.abstracting: (5<=P1)
states: 45,472 (4)
..
EG iterations: 2
abstracting: (Pm1<=P1)
states: 1,546,048 (6)
abstracting: (Pout4<=1)
states: 1,636,992 (6)
abstracting: (2<=Pm2)
states: 1,053,696 (6)
abstracting: (2<=Pout4)
states: 909,440 (5)
abstracting: (2<=Pm2)
states: 1,053,696 (6)
abstracting: (2<=Pm2)
states: 1,053,696 (6)
.
EG iterations: 1
abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (5<=Pout2)
states: 65,856 (4)
abstracting: (3<=Pout2)
states: 567,616 (5)
.abstracting: (4<=Pback1)
states: 181,888 (5)

EG iterations: 0
abstracting: (5<=Pback2)
states: 65,856 (4)
abstracting: (5<=Pback2)
states: 65,856 (4)
abstracting: (5<=Pback2)
states: 65,856 (4)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: ~ [[[[EX [~ [[3<=Pm3 | [5<=Pm2 | Pm2<=P2]]]] | AF [AG [Pout2<=4]]] | [AG [[[~ [1<=Pback1] & EX [Pm1<=1]] | EX [Pm3<=Pout2]]] | A [A [[3<=Pout1 | Pout3<=4] U ~ [5<=Pback3]] U A [Pback3<=5 U AF [Pout1<=Pback2]]]]] | [AX [[[EG [Pback1<=1] | [2<=Pm1 | ~ [Pm1<=5]]] & EG [[Pout2<=Pout3 & 4<=P3]]]] | ~ [AG [[~ [2<=P4] | [[2<=P3 | Pout3<=Pm2] | Pback3<=5]]]]]]]
normalized: ~ [[[E [true U ~ [[[Pback3<=5 | [2<=P3 | Pout3<=Pm2]] | ~ [2<=P4]]]] | ~ [EX [~ [[EG [[Pout2<=Pout3 & 4<=P3]] & [[2<=Pm1 | ~ [Pm1<=5]] | EG [Pback1<=1]]]]]]] | [[[~ [EG [~ [[~ [EG [EG [~ [Pout1<=Pback2]]]] & ~ [E [EG [~ [Pout1<=Pback2]] U [~ [Pback3<=5] & EG [~ [Pout1<=Pback2]]]]]]]]] & ~ [E [~ [[~ [EG [EG [~ [Pout1<=Pback2]]]] & ~ [E [EG [~ [Pout1<=Pback2]] U [~ [Pback3<=5] & EG [~ [Pout1<=Pback2]]]]]]] U [~ [[~ [EG [5<=Pback3]] & ~ [E [5<=Pback3 U [5<=Pback3 & ~ [[3<=Pout1 | Pout3<=4]]]]]]] & ~ [[~ [EG [EG [~ [Pout1<=Pback2]]]] & ~ [E [EG [~ [Pout1<=Pback2]] U [~ [Pback3<=5] & EG [~ [Pout1<=Pback2]]]]]]]]]]] | ~ [E [true U ~ [[EX [Pm3<=Pout2] | [EX [Pm1<=1] & ~ [1<=Pback1]]]]]]] | [~ [EG [E [true U ~ [Pout2<=4]]]] | EX [~ [[3<=Pm3 | [5<=Pm2 | Pm2<=P2]]]]]]]]

abstracting: (Pm2<=P2)
states: 1,244,992 (6)
abstracting: (5<=Pm2)
states: 65,856 (4)
abstracting: (3<=Pm3)
states: 567,616 (5)
.abstracting: (Pout2<=4)
states: 2,480,576 (6)

EG iterations: 0
abstracting: (1<=Pback1)
states: 1,591,520 (6)
abstracting: (Pm1<=1)
states: 1,636,992 (6)
.abstracting: (Pm3<=Pout2)
states: 1,580,544 (6)
.abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pback3<=5)
states: 2,546,432 (6)
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Pout3<=4)
states: 2,480,576 (6)
abstracting: (3<=Pout1)
states: 454,720 (5)
abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (5<=Pback3)
states: 65,856 (4)
abstracting: (5<=Pback3)
states: 65,856 (4)
.......
EG iterations: 7
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pback3<=5)
states: 2,546,432 (6)
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pback3<=5)
states: 2,546,432 (6)
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
abstracting: (Pout1<=Pback2)
states: 1,676,808 (6)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (Pback1<=1)
states: 1,636,992 (6)
.
EG iterations: 1
abstracting: (Pm1<=5)
states: 2,546,432 (6)
abstracting: (2<=Pm1)
states: 909,440 (5)
abstracting: (4<=P3)
states: 31,360 (4)
abstracting: (Pout2<=Pout3)
states: 1,580,544 (6)
.
EG iterations: 1
.abstracting: (2<=P4)
states: 909,440 (5)
abstracting: (Pout3<=Pm2)
states: 1,580,544 (6)
abstracting: (2<=P3)
states: 457,856 (5)
abstracting: (Pback3<=5)
states: 2,546,432 (6)
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

totally nodes used: 47825 (4.8e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 234255 137759 372014
used/not used/entry size/cache size: 176325 66932539 16 1024MB
basic ops cache: hits/miss/sum: 87919 52867 140786
used/not used/entry size/cache size: 99993 16677223 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: 5208 3690 8898
used/not used/entry size/cache size: 3690 8384918 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 67065798
1 40873
2 1490
3 313
4 142
5 60
6 53
7 34
8 22
9 15
>= 10 64

Total processing time: 0m 6.857sec


BK_STOP 1678613542292

--------------------
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:371 (23), effective:110 (6)

initing FirstDep: 0m 0.000sec


iterations count:50 (3), effective:12 (0)

iterations count:127 (7), effective:33 (2)

iterations count:149 (9), effective:39 (2)

iterations count:172 (10), effective:48 (3)

iterations count:124 (7), effective:34 (2)

iterations count:22 (1), effective:2 (0)

iterations count:212 (13), effective:59 (3)

iterations count:16 (1), effective:0 (0)

iterations count:85 (5), effective:24 (1)

iterations count:160 (10), effective:39 (2)

iterations count:117 (7), effective:28 (1)

iterations count:96 (6), effective:22 (1)

iterations count:290 (18), effective:80 (5)

iterations count:66 (4), effective:17 (1)

iterations count:290 (18), effective:80 (5)

iterations count:66 (4), effective:17 (1)

iterations count:290 (18), effective:80 (5)

iterations count:66 (4), effective:17 (1)

iterations count:76 (4), effective:19 (1)

iterations count:248 (15), effective:67 (4)

iterations count:17 (1), effective:1 (0)

iterations count:16 (1), effective:0 (0)

iterations count:48 (3), effective:12 (0)

iterations count:38 (2), effective:6 (0)

iterations count:362 (22), effective:96 (6)

iterations count:97 (6), effective:23 (1)

iterations count:16 (1), effective:0 (0)

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

iterations count:161 (10), effective:40 (2)

iterations count:421 (26), effective:123 (7)

iterations count:421 (26), effective:123 (7)

iterations count:421 (26), effective:123 (7)

iterations count:27 (1), effective:5 (0)

iterations count:77 (4), effective:24 (1)

iterations count:147 (9), effective:38 (2)

iterations count:227 (14), effective:60 (3)

iterations count:164 (10), effective:44 (2)

iterations count:16 (1), effective:0 (0)

iterations count:228 (14), effective:67 (4)

iterations count:126 (7), effective:30 (1)

iterations count:227 (14), effective:64 (4)

iterations count:286 (17), effective:76 (4)

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="Kanban-PT-00005"
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 Kanban-PT-00005, 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 r225-tall-167856407300233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00005.tgz
mv Kanban-PT-00005 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;