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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.2K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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-00020-CTLCardinality-00
FORMULA_NAME Kanban-PT-00020-CTLCardinality-01
FORMULA_NAME Kanban-PT-00020-CTLCardinality-02
FORMULA_NAME Kanban-PT-00020-CTLCardinality-03
FORMULA_NAME Kanban-PT-00020-CTLCardinality-04
FORMULA_NAME Kanban-PT-00020-CTLCardinality-05
FORMULA_NAME Kanban-PT-00020-CTLCardinality-06
FORMULA_NAME Kanban-PT-00020-CTLCardinality-07
FORMULA_NAME Kanban-PT-00020-CTLCardinality-08
FORMULA_NAME Kanban-PT-00020-CTLCardinality-09
FORMULA_NAME Kanban-PT-00020-CTLCardinality-10
FORMULA_NAME Kanban-PT-00020-CTLCardinality-11
FORMULA_NAME Kanban-PT-00020-CTLCardinality-12
FORMULA_NAME Kanban-PT-00020-CTLCardinality-13
FORMULA_NAME Kanban-PT-00020-CTLCardinality-14
FORMULA_NAME Kanban-PT-00020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678613814099

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-00020
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_00020
(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.817sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 696 (7.0e+02) #states 805,422,366,595 (11)



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

checking: AG [E [Pback3<=9 U P1<=16]]
normalized: ~ [E [true U ~ [E [Pback3<=9 U P1<=16]]]]

abstracting: (P1<=16)
states: 796,326,687,695 (11)
abstracting: (Pback3<=9)
states: 641,267,317,537 (11)
-> the formula is FALSE

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

MC time: 0m 0.039sec

checking: EX [AG [[[P2<=P1 & EG [17<=Pm3]] | AX [~ [EX [P3<=14]]]]]]
normalized: EX [~ [E [true U ~ [[~ [EX [EX [P3<=14]]] | [EG [17<=Pm3] & P2<=P1]]]]]]

abstracting: (P2<=P1)
states: 541,908,899,224 (11)
abstracting: (17<=Pm3)
states: 13,521,197,151 (10)
.
EG iterations: 1
abstracting: (P3<=14)
states: 802,875,576,503 (11)
...-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EX [~ [EF [[P3<=11 & [9<=Pback3 | Pm3<=P4]]]]]
normalized: EX [~ [E [true U [[9<=Pback3 | Pm3<=P4] & P3<=11]]]]

abstracting: (P3<=11)
states: 790,000,486,198 (11)
abstracting: (Pm3<=P4)
states: 402,700,653,817 (11)
abstracting: (9<=Pback3)
states: 204,072,533,665 (11)
.-> the formula is FALSE

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

MC time: 0m 0.014sec

checking: ~ [AG [EG [[[AG [Pout2<=P2] | EF [Pout2<=15]] | AX [P1<=16]]]]]
normalized: E [true U ~ [EG [[~ [EX [~ [P1<=16]]] | [E [true U Pout2<=15] | ~ [E [true U ~ [Pout2<=P2]]]]]]]]

abstracting: (Pout2<=P2)
states: 318,339,352,177 (11)
abstracting: (Pout2<=15)
states: 782,303,659,984 (11)
abstracting: (P1<=16)
states: 796,326,687,695 (11)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00020-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [~ [E [Pm4<=14 U [[Pout3<=19 | [9<=Pout2 & Pback2<=19]] & [7<=P1 & EG [8<=Pback1]]]]]]
normalized: E [true U ~ [E [Pm4<=14 U [[EG [8<=Pback1] & 7<=P1] & [[9<=Pout2 & Pback2<=19] | Pout3<=19]]]]]

abstracting: (Pout3<=19)
states: 804,697,848,724 (11)
abstracting: (Pback2<=19)
states: 804,697,848,724 (11)
abstracting: (9<=Pout2)
states: 204,072,533,665 (11)
abstracting: (7<=P1)
states: 254,679,009,200 (11)
abstracting: (8<=Pback1)
states: 206,926,694,975 (11)
.
EG iterations: 1
abstracting: (Pm4<=14)
states: 779,954,465,675 (11)
-> the formula is TRUE

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

MC time: 0m 0.145sec

checking: AG [[EG [E [~ [E [P2<=12 U 15<=Pout1]] U [EF [P4<=0] | EG [18<=P3]]]] | [AG [AG [AF [Pout3<=3]]] | [EX [~ [[5<=Pout2 | 8<=Pout4]]] | EF [AG [14<=Pm2]]]]]]
normalized: ~ [E [true U ~ [[[[E [true U ~ [E [true U ~ [14<=Pm2]]]] | EX [~ [[5<=Pout2 | 8<=Pout4]]]] | ~ [E [true U E [true U EG [~ [Pout3<=3]]]]]] | EG [E [~ [E [P2<=12 U 15<=Pout1]] U [EG [18<=P3] | E [true U P4<=0]]]]]]]]

abstracting: (P4<=0)
states: 105,055,091,295 (11)
abstracting: (18<=P3)
states: 144,276,286 (8)
.
EG iterations: 1
abstracting: (15<=Pout1)
states: 25,467,900,920 (10)
abstracting: (P2<=12)
states: 796,351,779,223 (11)

EG iterations: 0
abstracting: (Pout3<=3)
states: 322,187,765,284 (11)
.
EG iterations: 1
abstracting: (8<=Pout4)
states: 206,926,694,975 (11)
abstracting: (5<=Pout2)
states: 416,531,910,564 (11)
.abstracting: (14<=Pm2)
states: 52,955,669,844 (10)
-> the formula is TRUE

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

MC time: 0m 0.050sec

checking: EG [AF [A [[[[Pm4<=15 & Pm1<=7] | [P3<=19 & 12<=Pback1]] | AX [Pout1<=5]] U [17<=Pout2 & Pback3<=Pout4]]]]
normalized: EG [~ [EG [~ [[~ [EG [~ [[17<=Pout2 & Pback3<=Pout4]]]] & ~ [E [~ [[17<=Pout2 & Pback3<=Pout4]] U [~ [[~ [EX [~ [Pout1<=5]]] | [[P3<=19 & 12<=Pback1] | [Pm4<=15 & Pm1<=7]]]] & ~ [[17<=Pout2 & Pback3<=Pout4]]]]]]]]]]

abstracting: (Pback3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (17<=Pout2)
states: 13,521,197,151 (10)
abstracting: (Pm1<=7)
states: 598,495,671,620 (11)
abstracting: (Pm4<=15)
states: 789,504,928,520 (11)
abstracting: (12<=Pback1)
states: 75,039,350,925 (10)
abstracting: (P3<=19)
states: 805,419,230,154 (11)
abstracting: (Pout1<=5)
states: 496,169,283,995 (11)
.abstracting: (Pback3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (17<=Pout2)
states: 13,521,197,151 (10)
abstracting: (Pback3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (17<=Pout2)
states: 13,521,197,151 (10)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.211sec

checking: A [[~ [[~ [A [[Pback4<=10 & Pm4<=Pm4] U P1<=Pm1]] | 9<=Pm4]] | ~ [[~ [Pout1<=2] | EX [~ [[5<=Pm3 & Pout3<=9]]]]]] U ~ [12<=Pback4]]
normalized: [~ [EG [12<=Pback4]] & ~ [E [12<=Pback4 U [12<=Pback4 & ~ [[~ [[EX [~ [[5<=Pm3 & Pout3<=9]]] | ~ [Pout1<=2]]] | ~ [[9<=Pm4 | ~ [[~ [EG [~ [P1<=Pm1]]] & ~ [E [~ [P1<=Pm1] U [~ [[Pback4<=10 & Pm4<=Pm4]] & ~ [P1<=Pm1]]]]]]]]]]]]]]

abstracting: (P1<=Pm1)
states: 430,225,611,970 (11)
abstracting: (Pm4<=Pm4)
states: 805,422,366,595 (11)
abstracting: (Pback4<=10)
states: 705,369,898,695 (11)
abstracting: (P1<=Pm1)
states: 430,225,611,970 (11)
abstracting: (P1<=Pm1)
states: 430,225,611,970 (11)
..
EG iterations: 2
abstracting: (9<=Pm4)
states: 165,541,355,980 (11)
abstracting: (Pout1<=2)
states: 286,968,669,295 (11)
abstracting: (Pout3<=9)
states: 641,267,317,537 (11)
abstracting: (5<=Pm3)
states: 416,531,910,564 (11)
.abstracting: (12<=Pback4)
states: 75,039,350,925 (10)
abstracting: (12<=Pback4)
states: 75,039,350,925 (10)
abstracting: (12<=Pback4)
states: 75,039,350,925 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.095sec

checking: E [[E [[[E [15<=Pout3 U Pout1<=13] & 18<=Pout3] & AF [~ [Pm4<=Pm4]]] U ~ [AX [[Pout3<=13 & 18<=Pout2]]]] & AG [P1<=P2]] U AX [E [Pout2<=P4 U 13<=Pm3]]]
normalized: E [[~ [E [true U ~ [P1<=P2]]] & E [[~ [EG [Pm4<=Pm4]] & [18<=Pout3 & E [15<=Pout3 U Pout1<=13]]] U EX [~ [[Pout3<=13 & 18<=Pout2]]]]] U ~ [EX [~ [E [Pout2<=P4 U 13<=Pm3]]]]]

abstracting: (13<=Pm3)
states: 73,900,822,842 (10)
abstracting: (Pout2<=P4)
states: 402,700,653,817 (11)
.abstracting: (18<=Pout2)
states: 6,918,988,846 (9)
abstracting: (Pout3<=13)
states: 752,466,696,751 (11)
.abstracting: (Pout1<=13)
states: 767,220,515,215 (11)
abstracting: (15<=Pout3)
states: 36,138,073,202 (10)
abstracting: (18<=Pout3)
states: 6,918,988,846 (9)
abstracting: (Pm4<=Pm4)
states: 805,422,366,595 (11)

EG iterations: 0
abstracting: (P1<=P2)
states: 341,941,966,828 (11)
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.383sec

checking: [EG [AF [[[[AX [Pm1<=19] | [Pback1<=Pm4 | Pback1<=12]] & AX [8<=Pback4]] | Pm2<=Pm3]]] & AG [EF [[~ [[[13<=Pback2 & 4<=P2] & E [Pout4<=1 U Pback3<=8]]] & 10<=Pm2]]]]
normalized: [~ [E [true U ~ [E [true U [10<=Pm2 & ~ [[E [Pout4<=1 U Pback3<=8] & [13<=Pback2 & 4<=P2]]]]]]]] & EG [~ [EG [~ [[Pm2<=Pm3 | [~ [EX [~ [8<=Pback4]]] & [[Pback1<=Pm4 | Pback1<=12] | ~ [EX [~ [Pm1<=19]]]]]]]]]]]

abstracting: (Pm1<=19)
states: 804,967,582,650 (11)
.abstracting: (Pback1<=12)
states: 750,848,293,195 (11)
abstracting: (Pback1<=Pm4)
states: 435,683,019,310 (11)
abstracting: (8<=Pback4)
states: 206,926,694,975 (11)
.abstracting: (Pm2<=Pm3)
states: 433,261,686,858 (11)
......................
EG iterations: 22
......................
EG iterations: 22
abstracting: (4<=P2)
states: 294,803,498,913 (11)
abstracting: (13<=Pback2)
states: 73,900,822,842 (10)
abstracting: (Pback3<=8)
states: 601,349,832,930 (11)
abstracting: (Pout4<=1)
states: 200,559,719,745 (11)
abstracting: (10<=Pm2)
states: 164,155,049,058 (11)
-> the formula is TRUE

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

MC time: 0m 0.164sec

checking: ~ [AX [E [A [18<=Pout2 U [E [6<=Pback3 U P1<=P2] & E [10<=Pback3 U Pout3<=Pout3]]] U ~ [[[EX [Pm3<=P4] | ~ [Pm4<=0]] & [[1<=P4 & Pout2<=11] | [P1<=Pback3 | 18<=Pm1]]]]]]]
normalized: EX [~ [E [[~ [EG [~ [[E [10<=Pback3 U Pout3<=Pout3] & E [6<=Pback3 U P1<=P2]]]]] & ~ [E [~ [[E [10<=Pback3 U Pout3<=Pout3] & E [6<=Pback3 U P1<=P2]]] U [~ [18<=Pout2] & ~ [[E [10<=Pback3 U Pout3<=Pout3] & E [6<=Pback3 U P1<=P2]]]]]]] U ~ [[[[P1<=Pback3 | 18<=Pm1] | [1<=P4 & Pout2<=11]] & [~ [Pm4<=0] | EX [Pm3<=P4]]]]]]]

abstracting: (Pm3<=P4)
states: 402,700,653,817 (11)
.abstracting: (Pm4<=0)
states: 105,055,091,295 (11)
abstracting: (Pout2<=11)
states: 706,163,418,268 (11)
abstracting: (1<=P4)
states: 700,367,275,300 (11)
abstracting: (18<=Pm1)
states: 4,547,839,450 (9)
abstracting: (P1<=Pback3)
states: 464,674,039,599 (11)
abstracting: (P1<=P2)
states: 341,941,966,828 (11)
abstracting: (6<=Pback3)
states: 355,321,128,008 (11)
abstracting: (Pout3<=Pout3)
states: 805,422,366,595 (11)
abstracting: (10<=Pback3)
states: 164,155,049,058 (11)
abstracting: (18<=Pout2)
states: 6,918,988,846 (9)
abstracting: (P1<=P2)
states: 341,941,966,828 (11)
abstracting: (6<=Pback3)
states: 355,321,128,008 (11)
abstracting: (Pout3<=Pout3)
states: 805,422,366,595 (11)
abstracting: (10<=Pback3)
states: 164,155,049,058 (11)
abstracting: (P1<=P2)
states: 341,941,966,828 (11)
abstracting: (6<=Pback3)
states: 355,321,128,008 (11)
abstracting: (Pout3<=Pout3)
states: 805,422,366,595 (11)
abstracting: (10<=Pback3)
states: 164,155,049,058 (11)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 2.236sec

checking: E [~ [16<=Pm4] U [AG [[~ [[[3<=Pback2 | Pback1<=Pback3] | ~ [Pout4<=17]]] & [P1<=Pout2 | [~ [Pm2<=P3] & ~ [Pout2<=Pback4]]]]] | ~ [[AX [[[Pout4<=Pback3 | Pout3<=Pback1] & ~ [P2<=19]]] | EF [E [Pback1<=17 U 17<=Pout1]]]]]]
normalized: E [~ [16<=Pm4] U [~ [[~ [EX [~ [[~ [P2<=19] & [Pout4<=Pback3 | Pout3<=Pback1]]]]] | E [true U E [Pback1<=17 U 17<=Pout1]]]] | ~ [E [true U ~ [[[P1<=Pout2 | [~ [Pout2<=Pback4] & ~ [Pm2<=P3]]] & ~ [[~ [Pout4<=17] | [3<=Pback2 | Pback1<=Pback3]]]]]]]]]

abstracting: (Pback1<=Pback3)
states: 464,674,039,599 (11)
abstracting: (3<=Pback2)
states: 555,460,564,659 (11)
abstracting: (Pout4<=17)
states: 800,874,527,145 (11)
abstracting: (Pm2<=P3)
states: 318,339,352,177 (11)
abstracting: (Pout2<=Pback4)
states: 402,700,653,817 (11)
abstracting: (P1<=Pout2)
states: 464,674,039,599 (11)
abstracting: (17<=Pout1)
states: 9,095,678,900 (9)
abstracting: (Pback1<=17)
states: 800,874,527,145 (11)
abstracting: (Pout3<=Pback1)
states: 402,700,653,817 (11)
abstracting: (Pout4<=Pback3)
states: 464,674,039,599 (11)
abstracting: (P2<=19)
states: 805,419,230,154 (11)
.abstracting: (16<=Pm4)
states: 15,917,438,075 (10)
-> the formula is FALSE

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

MC time: 0m 6.382sec

checking: [~ [[E [[AG [Pm1<=4] & [E [9<=Pm3 U 20<=Pback1] | EG [Pout4<=Pback3]]] U [EF [11<=Pout2] & ~ [[20<=Pback1 | Pout1<=9]]]] & ~ [AX [EX [8<=Pm3]]]]] & AX [[A [[16<=P4 & Pback2<=6] U AG [~ [13<=Pout1]]] | [[EG [AG [20<=Pout4]] | [AF [Pm3<=Pm4] | AX [Pout4<=3]]] | [13<=Pm4 | A [AG [8<=P4] U ~ [2<=Pback2]]]]]]]
normalized: [~ [EX [~ [[[[13<=Pm4 | [~ [EG [2<=Pback2]] & ~ [E [2<=Pback2 U [2<=Pback2 & E [true U ~ [8<=P4]]]]]]] | [[~ [EX [~ [Pout4<=3]]] | ~ [EG [~ [Pm3<=Pm4]]]] | EG [~ [E [true U ~ [20<=Pout4]]]]]] | [~ [EG [E [true U 13<=Pout1]]] & ~ [E [E [true U 13<=Pout1] U [~ [[16<=P4 & Pback2<=6]] & E [true U 13<=Pout1]]]]]]]]] & ~ [[EX [~ [EX [8<=Pm3]]] & E [[[EG [Pout4<=Pback3] | E [9<=Pm3 U 20<=Pback1]] & ~ [E [true U ~ [Pm1<=4]]]] U [~ [[20<=Pback1 | Pout1<=9]] & E [true U 11<=Pout2]]]]]]

abstracting: (11<=Pout2)
states: 129,274,688,697 (11)
abstracting: (Pout1<=9)
states: 675,354,158,325 (11)
abstracting: (20<=Pback1)
states: 454,783,945 (8)
abstracting: (Pm1<=4)
states: 434,318,667,475 (11)
abstracting: (20<=Pback1)
states: 454,783,945 (8)
abstracting: (9<=Pm3)
states: 204,072,533,665 (11)
abstracting: (Pout4<=Pback3)
states: 464,674,039,599 (11)
......................
EG iterations: 22
abstracting: (8<=Pm3)
states: 249,168,282,363 (11)
..abstracting: (13<=Pout1)
states: 54,574,073,400 (10)
abstracting: (Pback2<=6)
states: 505,867,159,567 (11)
abstracting: (16<=P4)
states: 15,917,438,075 (10)
abstracting: (13<=Pout1)
states: 54,574,073,400 (10)
abstracting: (13<=Pout1)
states: 54,574,073,400 (10)

EG iterations: 0
abstracting: (20<=Pout4)
states: 454,783,945 (8)
.
EG iterations: 1
abstracting: (Pm3<=Pm4)
states: 402,700,653,817 (11)
......................
EG iterations: 22
abstracting: (Pout4<=3)
states: 364,736,723,890 (11)
.abstracting: (8<=P4)
states: 206,926,694,975 (11)
abstracting: (2<=Pback2)
states: 633,228,619,254 (11)
abstracting: (2<=Pback2)
states: 633,228,619,254 (11)
abstracting: (2<=Pback2)
states: 633,228,619,254 (11)
.
EG iterations: 1
abstracting: (13<=Pm4)
states: 54,574,073,400 (10)
.-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.150sec

checking: AG [[[[8<=Pout4 | 12<=Pback3] | [E [AG [P1<=Pm1] U [~ [19<=Pm1] & ~ [Pm1<=13]]] | ~ [[EF [5<=P2] & ~ [Pm3<=Pback2]]]]] | [EF [[~ [Pback2<=15] | [[Pm3<=Pback4 | 8<=Pout2] | AF [Pout1<=P2]]]] | [~ [AF [~ [8<=Pout1]]] | [[EG [Pout4<=P3] | EG [6<=P4]] & EG [[14<=Pback4 | 15<=Pm1]]]]]]]
normalized: ~ [E [true U ~ [[[[[EG [[14<=Pback4 | 15<=Pm1]] & [EG [6<=P4] | EG [Pout4<=P3]]] | EG [8<=Pout1]] | E [true U [[~ [EG [~ [Pout1<=P2]]] | [Pm3<=Pback4 | 8<=Pout2]] | ~ [Pback2<=15]]]] | [[~ [[~ [Pm3<=Pback2] & E [true U 5<=P2]]] | E [~ [E [true U ~ [P1<=Pm1]]] U [~ [Pm1<=13] & ~ [19<=Pm1]]]] | [8<=Pout4 | 12<=Pback3]]]]]]

abstracting: (12<=Pback3)
states: 99,258,948,327 (10)
abstracting: (8<=Pout4)
states: 206,926,694,975 (11)
abstracting: (19<=Pm1)
states: 1,819,135,780 (9)
abstracting: (Pm1<=13)
states: 767,220,515,215 (11)
abstracting: (P1<=Pm1)
states: 430,225,611,970 (11)
abstracting: (5<=P2)
states: 221,382,551,544 (11)
abstracting: (Pm3<=Pback2)
states: 433,261,686,858 (11)
abstracting: (Pback2<=15)
states: 782,303,659,984 (11)
abstracting: (8<=Pout2)
states: 249,168,282,363 (11)
abstracting: (Pm3<=Pback4)
states: 402,700,653,817 (11)
abstracting: (Pout1<=P2)
states: 341,941,966,828 (11)
..
EG iterations: 2
abstracting: (8<=Pout1)
states: 206,926,694,975 (11)
.
EG iterations: 1
abstracting: (Pout4<=P3)
states: 341,941,966,828 (11)
.
EG iterations: 1
abstracting: (6<=P4)
states: 309,253,082,600 (11)
.
EG iterations: 1
abstracting: (15<=Pm1)
states: 25,467,900,920 (10)
abstracting: (14<=Pback4)
states: 38,201,851,380 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00020-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.009sec

checking: A [[~ [[~ [1<=Pback4] & AF [[[P4<=13 & 3<=Pm2] | ~ [Pback4<=7]]]]] & [[[AF [[16<=P4 & 18<=Pm1]] & 14<=Pm4] & AG [~ [[9<=Pout2 | 18<=Pout1]]]] | [[[EF [14<=Pm1] | AG [Pm4<=19]] & AF [E [Pout1<=Pm2 U 2<=Pback2]]] | EX [E [P4<=10 U Pback1<=Pback4]]]]] U EF [[EG [AG [Pout3<=12]] | [E [E [7<=Pback4 U Pout3<=Pback2] U [13<=Pback1 & 19<=Pback3]] & AG [~ [Pout1<=8]]]]]]
normalized: [~ [EG [~ [E [true U [[~ [E [true U Pout1<=8]] & E [E [7<=Pback4 U Pout3<=Pback2] U [13<=Pback1 & 19<=Pback3]]] | EG [~ [E [true U ~ [Pout3<=12]]]]]]]]] & ~ [E [~ [E [true U [[~ [E [true U Pout1<=8]] & E [E [7<=Pback4 U Pout3<=Pback2] U [13<=Pback1 & 19<=Pback3]]] | EG [~ [E [true U ~ [Pout3<=12]]]]]]] U [~ [[[[[[E [true U 14<=Pm1] | ~ [E [true U ~ [Pm4<=19]]]] & ~ [EG [~ [E [Pout1<=Pm2 U 2<=Pback2]]]]] | EX [E [P4<=10 U Pback1<=Pback4]]] | [~ [E [true U [9<=Pout2 | 18<=Pout1]]] & [14<=Pm4 & ~ [EG [~ [[16<=P4 & 18<=Pm1]]]]]]] & ~ [[~ [EG [~ [[~ [Pback4<=7] | [P4<=13 & 3<=Pm2]]]]] & ~ [1<=Pback4]]]]] & ~ [E [true U [[~ [E [true U Pout1<=8]] & E [E [7<=Pback4 U Pout3<=Pback2] U [13<=Pback1 & 19<=Pback3]]] | EG [~ [E [true U ~ [Pout3<=12]]]]]]]]]]]

abstracting: (Pout3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (19<=Pback3)
states: 2,832,206,223 (9)
abstracting: (13<=Pback1)
states: 54,574,073,400 (10)
abstracting: (Pout3<=Pback2)
states: 433,261,686,858 (11)
abstracting: (7<=Pback4)
states: 254,679,009,200 (11)
abstracting: (Pout1<=8)
states: 639,881,010,615 (11)
abstracting: (1<=Pback4)
states: 700,367,275,300 (11)
abstracting: (3<=Pm2)
states: 555,460,564,659 (11)
abstracting: (P4<=13)
states: 767,220,515,215 (11)
abstracting: (Pback4<=7)
states: 598,495,671,620 (11)
.
EG iterations: 1
abstracting: (18<=Pm1)
states: 4,547,839,450 (9)
abstracting: (16<=P4)
states: 15,917,438,075 (10)
.
EG iterations: 1
abstracting: (14<=Pm4)
states: 38,201,851,380 (10)
abstracting: (18<=Pout1)
states: 4,547,839,450 (9)
abstracting: (9<=Pout2)
states: 204,072,533,665 (11)
abstracting: (Pback1<=Pback4)
states: 435,683,019,310 (11)
abstracting: (P4<=10)
states: 705,369,898,695 (11)
.abstracting: (2<=Pback2)
states: 633,228,619,254 (11)
abstracting: (Pout1<=Pm2)
states: 464,674,039,599 (11)
..
EG iterations: 2
abstracting: (Pm4<=19)
states: 804,967,582,650 (11)
abstracting: (14<=Pm1)
states: 38,201,851,380 (10)
abstracting: (Pout3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (19<=Pback3)
states: 2,832,206,223 (9)
abstracting: (13<=Pback1)
states: 54,574,073,400 (10)
abstracting: (Pout3<=Pback2)
states: 433,261,686,858 (11)
abstracting: (7<=Pback4)
states: 254,679,009,200 (11)
abstracting: (Pout1<=8)
states: 639,881,010,615 (11)
abstracting: (Pout3<=12)
states: 731,521,543,753 (11)
.
EG iterations: 1
abstracting: (19<=Pback3)
states: 2,832,206,223 (9)
abstracting: (13<=Pback1)
states: 54,574,073,400 (10)
abstracting: (Pout3<=Pback2)
states: 433,261,686,858 (11)
abstracting: (7<=Pback4)
states: 254,679,009,200 (11)
abstracting: (Pout1<=8)
states: 639,881,010,615 (11)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 3.214sec

checking: [[[EF [[A [AX [Pback1<=P3] U E [P1<=Pback2 U 10<=Pback1]] & EF [2<=Pm4]]] & EF [AX [[P1<=P2 | ~ [11<=P3]]]]] & E [EF [Pback3<=3] U 8<=Pm1]] & [E [[[[[AF [Pm2<=P2] & Pout4<=19] & EX [3<=Pm2]] | AG [~ [Pback1<=P3]]] & [EG [[7<=P4 & Pout4<=Pm4]] & [EG [Pm2<=19] | Pm3<=20]]] U [EF [[E [Pm1<=Pback1 U Pout3<=Pm4] & EX [Pback3<=9]]] | AG [[~ [Pback4<=Pout2] | 15<=Pback4]]]] | AF [AF [[[[Pout3<=Pout4 & Pout1<=7] | Pm1<=Pm2] & ~ [[20<=Pback2 & Pback2<=18]]]]]]]
normalized: [[~ [EG [EG [~ [[~ [[20<=Pback2 & Pback2<=18]] & [Pm1<=Pm2 | [Pout3<=Pout4 & Pout1<=7]]]]]]] | E [[[[Pm3<=20 | EG [Pm2<=19]] & EG [[7<=P4 & Pout4<=Pm4]]] & [~ [E [true U Pback1<=P3]] | [EX [3<=Pm2] & [Pout4<=19 & ~ [EG [~ [Pm2<=P2]]]]]]] U [~ [E [true U ~ [[15<=Pback4 | ~ [Pback4<=Pout2]]]]] | E [true U [EX [Pback3<=9] & E [Pm1<=Pback1 U Pout3<=Pm4]]]]]] & [E [E [true U Pback3<=3] U 8<=Pm1] & [E [true U ~ [EX [~ [[P1<=P2 | ~ [11<=P3]]]]]] & E [true U [E [true U 2<=Pm4] & [~ [EG [~ [E [P1<=Pback2 U 10<=Pback1]]]] & ~ [E [~ [E [P1<=Pback2 U 10<=Pback1]] U [EX [~ [Pback1<=P3]] & ~ [E [P1<=Pback2 U 10<=Pback1]]]]]]]]]]]

abstracting: (10<=Pback1)
states: 130,068,208,270 (11)
abstracting: (P1<=Pback2)
states: 464,674,039,599 (11)
abstracting: (Pback1<=P3)
states: 341,941,966,828 (11)
.abstracting: (10<=Pback1)
states: 130,068,208,270 (11)
abstracting: (P1<=Pback2)
states: 464,674,039,599 (11)
abstracting: (10<=Pback1)
states: 130,068,208,270 (11)
abstracting: (P1<=Pback2)
states: 464,674,039,599 (11)
.
EG iterations: 1
abstracting: (2<=Pm4)
states: 604,862,646,850 (11)
abstracting: (11<=P3)
states: 24,909,614,422 (10)
abstracting: (P1<=P2)
states: 341,941,966,828 (11)
.abstracting: (8<=Pm1)
states: 206,926,694,975 (11)
abstracting: (Pback3<=3)
states: 322,187,765,284 (11)
abstracting: (Pout3<=Pm4)
states: 402,700,653,817 (11)
abstracting: (Pm1<=Pback1)
states: 430,225,611,970 (11)
abstracting: (Pback3<=9)
states: 641,267,317,537 (11)
.abstracting: (Pback4<=Pout2)
states: 464,674,039,599 (11)
abstracting: (15<=Pback4)
states: 25,467,900,920 (10)
abstracting: (Pm2<=P2)
states: 318,339,352,177 (11)
......................
EG iterations: 22
abstracting: (Pout4<=19)
states: 804,967,582,650 (11)
abstracting: (3<=Pm2)
states: 555,460,564,659 (11)
.abstracting: (Pback1<=P3)
states: 341,941,966,828 (11)
abstracting: (Pout4<=Pm4)
states: 430,225,611,970 (11)
abstracting: (7<=P4)
states: 254,679,009,200 (11)
.
EG iterations: 1
abstracting: (Pm2<=19)
states: 804,697,848,724 (11)
.
EG iterations: 1
abstracting: (Pm3<=20)
states: 805,422,366,595 (11)
abstracting: (Pout1<=7)
states: 598,495,671,620 (11)
abstracting: (Pout3<=Pout4)
states: 402,700,653,817 (11)
abstracting: (Pm1<=Pm2)
states: 464,674,039,599 (11)
abstracting: (Pback2<=18)
states: 802,590,160,372 (11)
abstracting: (20<=Pback2)
states: 724,517,871 (8)
.............
EG iterations: 13
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 2.458sec

totally nodes used: 3030390 (3.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 23599098 6615652 30214750
used/not used/entry size/cache size: 8615751 58493113 16 1024MB
basic ops cache: hits/miss/sum: 8736298 3222961 11959259
used/not used/entry size/cache size: 4355799 12421417 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: 188808 73701 262509
used/not used/entry size/cache size: 73442 8315166 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 64446198
1 2547363
2 86059
3 9467
4 4178
5 3256
6 2034
7 1683
8 1545
9 1244
>= 10 5837

Total processing time: 0m24.388sec


BK_STOP 1678613838535

--------------------
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:1436 (89), effective:440 (27)

initing FirstDep: 0m 0.000sec


iterations count:148 (9), effective:36 (2)

iterations count:727 (45), effective:211 (13)

iterations count:107 (6), effective:28 (1)

iterations count:169 (10), effective:45 (2)

iterations count:323 (20), effective:82 (5)

iterations count:143 (8), effective:42 (2)

iterations count:431 (26), effective:127 (7)

iterations count:1233 (77), effective:367 (22)

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

iterations count:841 (52), effective:225 (14)

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

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

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

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

iterations count:1634 (102), effective:444 (27)

iterations count:651 (40), effective:196 (12)

iterations count:93 (5), effective:37 (2)

iterations count:987 (61), effective:271 (16)

iterations count:23 (1), effective:7 (0)

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

iterations count:324 (20), effective:83 (5)

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

iterations count:28 (1), effective:12 (0)

iterations count:458 (28), effective:137 (8)

iterations count:436 (27), effective:114 (7)

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

iterations count:436 (27), effective:114 (7)

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

iterations count:156 (9), effective:42 (2)

iterations count:436 (27), effective:114 (7)

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

iterations count:500 (31), effective:189 (11)

iterations count:250 (15), effective:90 (5)

iterations count:684 (42), effective:184 (11)

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

iterations count:258 (16), effective:66 (4)

iterations count:206 (12), effective:55 (3)

iterations count:1056 (66), effective:300 (18)

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

iterations count:536 (33), effective:143 (8)

iterations count:536 (33), effective:143 (8)

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

iterations count:536 (33), effective:143 (8)

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

iterations count:55 (3), effective:13 (0)

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

iterations count:63 (3), effective:22 (1)

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

iterations count:206 (12), effective:60 (3)

iterations count:136 (8), effective:60 (3)

iterations count:263 (16), effective:78 (4)

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:28 (1), effective:12 (0)

iterations count:214 (13), effective:54 (3)

iterations count:998 (62), effective:285 (17)

iterations count:81 (5), effective:20 (1)

iterations count:1263 (78), effective:352 (22)

iterations count:548 (34), effective:154 (9)

iterations count:263 (16), effective:78 (4)

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:28 (1), effective:12 (0)

iterations count:262 (16), effective:82 (5)

iterations count:263 (16), effective:78 (4)

iterations count:392 (24), effective:109 (6)

iterations count:2287 (142), effective:753 (47)

iterations count:28 (1), effective:12 (0)

iterations count:539 (33), effective:155 (9)

iterations count:539 (33), effective:155 (9)

iterations count:363 (22), effective:95 (5)

iterations count:539 (33), effective:155 (9)

iterations count:111 (6), effective:28 (1)

iterations count:472 (29), effective:132 (8)

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

iterations count:33 (2), effective:17 (1)

iterations count:320 (20), effective:88 (5)

iterations count:746 (46), effective:201 (12)

iterations count:420 (26), effective:119 (7)

iterations count:56 (3), effective:20 (1)

iterations count:609 (38), effective:188 (11)

iterations count:16 (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="Kanban-PT-00020"
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-00020, 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-167856407300249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-00020.tgz
mv Kanban-PT-00020 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 ;