Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r225-tall-167856407400265.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-00100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407400265
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 11:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.6K Feb 25 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 111K Feb 25 11:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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-00100-CTLCardinality-00
FORMULA_NAME Kanban-PT-00100-CTLCardinality-01
FORMULA_NAME Kanban-PT-00100-CTLCardinality-02
FORMULA_NAME Kanban-PT-00100-CTLCardinality-03
FORMULA_NAME Kanban-PT-00100-CTLCardinality-04
FORMULA_NAME Kanban-PT-00100-CTLCardinality-05
FORMULA_NAME Kanban-PT-00100-CTLCardinality-06
FORMULA_NAME Kanban-PT-00100-CTLCardinality-07
FORMULA_NAME Kanban-PT-00100-CTLCardinality-08
FORMULA_NAME Kanban-PT-00100-CTLCardinality-09
FORMULA_NAME Kanban-PT-00100-CTLCardinality-10
FORMULA_NAME Kanban-PT-00100-CTLCardinality-11
FORMULA_NAME Kanban-PT-00100-CTLCardinality-12
FORMULA_NAME Kanban-PT-00100-CTLCardinality-13
FORMULA_NAME Kanban-PT-00100-CTLCardinality-14
FORMULA_NAME Kanban-PT-00100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678613834773

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-00100
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_00100
(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.934sec


RS generation: 0m 1.633sec


-> reachability set: #nodes 11416 (1.1e+04) #states 17,263,002,294,682,342,171 (19)



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

checking: AX [EF [EF [~ [EG [Pm3<=31]]]]]
normalized: ~ [EX [~ [E [true U E [true U ~ [EG [Pm3<=31]]]]]]]

abstracting: (Pm3<=31)
states: 10,717,184,850,121,612,192 (19)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.423sec

checking: EX [EF [EF [55<=Pout2]]]
normalized: EX [E [true U E [true U 55<=Pout2]]]

abstracting: (55<=Pout2)
states: 2,225,351,464,013,355,420 (18)
.-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.728sec

checking: EG [AG [Pback4<=Pback4]]
normalized: EG [~ [E [true U ~ [Pback4<=Pback4]]]]

abstracting: (Pback4<=Pback4)
states: 17,263,002,294,682,342,171 (19)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: E [~ [P1<=17] U P1<=Pout1]
normalized: E [~ [P1<=17] U P1<=Pout1]

abstracting: (P1<=Pout1)
states: 8,758,447,189,400,500,046 (18)
abstracting: (P1<=17)
states: 7,621,740,799,718,927,001 (18)
-> the formula is TRUE

FORMULA Kanban-PT-00100-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.109sec

checking: ~ [E [Pout2<=Pout4 U EF [E [AX [Pback2<=9] U AG [Pout4<=41]]]]]
normalized: ~ [E [Pout2<=Pout4 U E [true U E [~ [EX [~ [Pback2<=9]]] U ~ [E [true U ~ [Pout4<=41]]]]]]]

abstracting: (Pout4<=41)
states: 13,749,901,138,423,019,381 (19)
abstracting: (Pback2<=9)
states: 3,954,861,887,343,232,657 (18)
.abstracting: (Pout2<=Pout4)
states: 8,106,821,143,746,622,531 (18)
-> the formula is TRUE

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

MC time: 0m 3.780sec

checking: [AG [[~ [EG [~ [Pm2<=72]]] & ~ [AF [AF [P2<=Pm3]]]]] & AG [~ [AX [30<=Pback2]]]]
normalized: [~ [E [true U ~ [EX [~ [30<=Pback2]]]]] & ~ [E [true U ~ [[EG [EG [~ [P2<=Pm3]]] & ~ [EG [~ [Pm2<=72]]]]]]]]

abstracting: (Pm2<=72)
states: 16,691,032,358,176,086,310 (19)
.
EG iterations: 1
abstracting: (P2<=Pm3)
states: 11,298,247,988,617,994,391 (19)
......................................................................................................
EG iterations: 102
.
EG iterations: 1
abstracting: (30<=Pback2)
states: 7,051,564,870,415,560,500 (18)
.-> the formula is FALSE

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

MC time: 0m 2.364sec

checking: ~ [EF [A [[~ [[E [1<=Pout2 U P1<=Pback1] | 2<=Pm1]] | [AX [23<=Pout1] | AF [99<=Pout4]]] U ~ [EG [70<=P3]]]]]
normalized: ~ [E [true U [~ [EG [EG [70<=P3]]] & ~ [E [EG [70<=P3] U [~ [[~ [[2<=Pm1 | E [1<=Pout2 U P1<=Pback1]]] | [~ [EG [~ [99<=Pout4]]] | ~ [EX [~ [23<=Pout1]]]]]] & EG [70<=P3]]]]]]]

abstracting: (70<=P3)
states: 52,387,512,426,465,392 (16)
.
EG iterations: 1
abstracting: (23<=Pout1)
states: 8,019,905,279,196,053,360 (18)
.abstracting: (99<=Pout4)
states: 390,453,032,093,284 (14)
.
EG iterations: 1
abstracting: (P1<=Pback1)
states: 8,758,447,189,400,500,046 (18)
abstracting: (1<=Pout2)
states: 16,842,627,999,778,190,295 (19)
abstracting: (2<=Pm1)
states: 16,267,249,449,586,444,650 (19)
abstracting: (70<=P3)
states: 52,387,512,426,465,392 (16)
.
EG iterations: 1
abstracting: (70<=P3)
states: 52,387,512,426,465,392 (16)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.920sec

checking: AG [EG [AG [[[[54<=Pback2 | P1<=90] & [Pout3<=P2 & 53<=Pm3]] | [20<=P3 | [Pout2<=18 | P4<=43]]]]]]
normalized: ~ [E [true U ~ [EG [~ [E [true U ~ [[[20<=P3 | [Pout2<=18 | P4<=43]] | [[Pout3<=P2 & 53<=Pm3] & [54<=Pback2 | P1<=90]]]]]]]]]]

abstracting: (P1<=90)
states: 17,241,527,377,917,211,551 (19)
abstracting: (54<=Pback2)
states: 2,358,526,223,392,527,832 (18)
abstracting: (53<=Pm3)
states: 2,496,411,690,387,990,060 (18)
abstracting: (Pout3<=P2)
states: 6,264,473,328,360,996,931 (18)
abstracting: (P4<=43)
states: 14,089,692,889,602,199,782 (19)
abstracting: (Pout2<=18)
states: 7,041,905,880,588,958,072 (18)
abstracting: (20<=P3)
states: 5,796,243,891,319,771,377 (18)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.818sec

checking: ~ [E [~ [EG [AX [AX [Pout3<=Pout2]]]] U [AX [[[[74<=Pback4 | 51<=P3] | EF [62<=Pout1]] | A [Pback4<=25 U 94<=P4]]] & AX [EF [~ [Pback1<=27]]]]]]
normalized: ~ [E [~ [EG [~ [EX [EX [~ [Pout3<=Pout2]]]]]] U [~ [EX [~ [E [true U ~ [Pback1<=27]]]]] & ~ [EX [~ [[[~ [EG [~ [94<=P4]]] & ~ [E [~ [94<=P4] U [~ [Pback4<=25] & ~ [94<=P4]]]]] | [E [true U 62<=Pout1] | [74<=Pback4 | 51<=P3]]]]]]]]]

abstracting: (51<=P3)
states: 539,209,569,723,242,210 (17)
abstracting: (74<=Pback4)
states: 356,678,844,817,214,934 (17)
abstracting: (62<=Pout1)
states: 1,040,557,330,528,601,860 (18)
abstracting: (94<=P4)
states: 8,199,513,673,958,964 (15)
abstracting: (Pback4<=25)
states: 10,122,592,470,276,411,021 (19)
abstracting: (94<=P4)
states: 8,199,513,673,958,964 (15)
abstracting: (94<=P4)
states: 8,199,513,673,958,964 (15)
.
EG iterations: 1
.abstracting: (Pback1<=27)
states: 10,671,667,046,657,591,646 (19)
.abstracting: (Pout3<=Pout2)
states: 8,772,547,785,762,958,886 (18)
........................................................................................................
EG iterations: 102
-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.397sec

checking: [~ [EX [[88<=P2 | Pout2<=Pm4]]] | AG [E [~ [[E [Pback2<=96 U Pm1<=27] | EG [P2<=P4]]] U 39<=P4]]]
normalized: [~ [E [true U ~ [E [~ [[EG [P2<=P4] | E [Pback2<=96 U Pm1<=27]]] U 39<=P4]]]] | ~ [EX [[88<=P2 | Pout2<=Pm4]]]]

abstracting: (Pout2<=Pm4)
states: 8,106,821,143,746,622,531 (18)
abstracting: (88<=P2)
states: 833,919,352,347,263 (14)
.abstracting: (39<=P4)
states: 4,066,958,782,283,646,144 (18)
abstracting: (Pm1<=27)
states: 10,671,667,046,657,591,646 (19)
abstracting: (Pback2<=96)
states: 17,259,827,408,608,902,460 (19)
abstracting: (P2<=P4)
states: 10,970,016,762,305,884,816 (19)
......................................................................................................
EG iterations: 102
-> the formula is FALSE

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

MC time: 0m16.949sec

checking: AG [A [[A [~ [Pm2<=Pout3] U ~ [[Pback1<=P3 | Pback2<=63]]] & [[44<=Pm4 | ~ [E [5<=Pback3 U Pback3<=P2]]] | AF [~ [P2<=Pm1]]]] U ~ [AG [35<=Pout4]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U ~ [35<=Pout4]]]]] & ~ [E [~ [E [true U ~ [35<=Pout4]]] U [~ [[[~ [EG [P2<=Pm1]] | [44<=Pm4 | ~ [E [5<=Pback3 U Pback3<=P2]]]] & [~ [EG [[Pback1<=P3 | Pback2<=63]]] & ~ [E [[Pback1<=P3 | Pback2<=63] U [Pm2<=Pout3 & [Pback1<=P3 | Pback2<=63]]]]]]] & ~ [E [true U ~ [35<=Pout4]]]]]]]]]]

abstracting: (35<=Pout4)
states: 4,891,986,039,096,755,236 (18)
abstracting: (Pback2<=63)
states: 16,032,487,405,977,299,776 (19)
abstracting: (Pback1<=P3)
states: 6,655,648,998,815,905,036 (18)
abstracting: (Pm2<=Pout3)
states: 8,772,547,785,762,958,886 (18)
abstracting: (Pback2<=63)
states: 16,032,487,405,977,299,776 (19)
abstracting: (Pback1<=P3)
states: 6,655,648,998,815,905,036 (18)
abstracting: (Pback2<=63)
states: 16,032,487,405,977,299,776 (19)
abstracting: (Pback1<=P3)
states: 6,655,648,998,815,905,036 (18)
.
EG iterations: 1
abstracting: (Pback3<=P2)
states: 6,264,473,328,360,996,931 (18)
abstracting: (5<=Pback3)
states: 15,216,442,570,584,013,080 (19)
abstracting: (44<=Pm4)
states: 3,173,309,405,080,142,389 (18)
abstracting: (P2<=Pm1)
states: 10,970,016,762,305,884,816 (19)
.
EG iterations: 1
abstracting: (35<=Pout4)
states: 4,891,986,039,096,755,236 (18)
abstracting: (35<=Pout4)
states: 4,891,986,039,096,755,236 (18)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m34.538sec

checking: AX [[EX [EX [~ [35<=Pback2]]] & [E [A [AF [Pout3<=P2] U [Pout2<=Pout1 | 66<=P2]] U [~ [AF [57<=Pm2]] & AF [P2<=P3]]] & [EF [E [Pm2<=Pback3 U 47<=P3]] & [[EX [Pback4<=Pback4] & AG [Pout3<=46]] & AF [~ [27<=Pout3]]]]]]]
normalized: ~ [EX [~ [[[[[~ [EG [27<=Pout3]] & [~ [E [true U ~ [Pout3<=46]]] & EX [Pback4<=Pback4]]] & E [true U E [Pm2<=Pback3 U 47<=P3]]] & E [[~ [EG [~ [[Pout2<=Pout1 | 66<=P2]]]] & ~ [E [~ [[Pout2<=Pout1 | 66<=P2]] U [EG [~ [Pout3<=P2]] & ~ [[Pout2<=Pout1 | 66<=P2]]]]]] U [~ [EG [~ [P2<=P3]]] & EG [~ [57<=Pm2]]]]] & EX [EX [~ [35<=Pback2]]]]]]]

abstracting: (35<=Pback2)
states: 5,827,356,967,911,554,559 (18)
..abstracting: (57<=Pm2)
states: 1,972,946,566,828,055,049 (18)
.
EG iterations: 1
abstracting: (P2<=P3)
states: 17,263,002,294,682,342,171 (19)
.
EG iterations: 1
abstracting: (66<=P2)
states: 94,436,276,439,375,822 (16)
abstracting: (Pout2<=Pout1)
states: 8,106,821,143,746,622,531 (18)
abstracting: (Pout3<=P2)
states: 6,264,473,328,360,996,931 (18)
.
EG iterations: 1
abstracting: (66<=P2)
states: 94,436,276,439,375,822 (16)
abstracting: (Pout2<=Pout1)
states: 8,106,821,143,746,622,531 (18)
abstracting: (66<=P2)
states: 94,436,276,439,375,822 (16)
abstracting: (Pout2<=Pout1)
states: 8,106,821,143,746,622,531 (18)
.
EG iterations: 1
abstracting: (47<=P3)
states: 786,609,480,809,477,556 (17)
abstracting: (Pm2<=Pback3)
states: 8,772,547,785,762,958,886 (18)
abstracting: (Pback4<=Pback4)
states: 17,263,002,294,682,342,171 (19)
.abstracting: (Pout3<=46)
states: 13,837,960,870,223,087,725 (19)
abstracting: (27<=Pout3)
states: 7,850,647,611,660,482,665 (18)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00100-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.744sec

checking: [[AG [[EX [EG [86<=P3]] | [[~ [89<=P1] & AF [44<=P4]] | [[EF [73<=Pm4] | A [92<=Pback1 U Pback4<=Pout4]] & [[Pm1<=Pm2 & Pm1<=Pm1] & ~ [50<=Pout2]]]]]] | [AG [~ [P3<=0]] | EX [~ [31<=P1]]]] & [AG [~ [E [AG [Pback2<=Pm1] U ~ [[Pout1<=6 | P3<=9]]]]] & EG [Pm1<=53]]]
normalized: [[EG [Pm1<=53] & ~ [E [true U E [~ [E [true U ~ [Pback2<=Pm1]]] U ~ [[Pout1<=6 | P3<=9]]]]]] & [[EX [~ [31<=P1]] | ~ [E [true U P3<=0]]] | ~ [E [true U ~ [[[[[~ [50<=Pout2] & [Pm1<=Pm2 & Pm1<=Pm1]] & [[~ [EG [~ [Pback4<=Pout4]]] & ~ [E [~ [Pback4<=Pout4] U [~ [92<=Pback1] & ~ [Pback4<=Pout4]]]]] | E [true U 73<=Pm4]]] | [~ [EG [~ [44<=P4]]] & ~ [89<=P1]]] | EX [EG [86<=P3]]]]]]]]

abstracting: (86<=P3)
states: 1,629,118,674,757,688 (15)
.
EG iterations: 1
.abstracting: (89<=P1)
states: 35,531,225,920,488,844 (16)
abstracting: (44<=P4)
states: 3,173,309,405,080,142,389 (18)
.
EG iterations: 1
abstracting: (73<=Pm4)
states: 396,309,827,574,683,260 (17)
abstracting: (Pback4<=Pout4)
states: 8,758,447,189,400,500,046 (18)
abstracting: (92<=Pback1)
states: 16,106,187,573,847,965 (16)
abstracting: (Pback4<=Pout4)
states: 8,758,447,189,400,500,046 (18)
abstracting: (Pback4<=Pout4)
states: 8,758,447,189,400,500,046 (18)
.
EG iterations: 1
abstracting: (Pm1<=Pm1)
states: 17,263,002,294,682,342,171 (19)
abstracting: (Pm1<=Pm2)
states: 9,442,299,684,526,363,941 (18)
abstracting: (50<=Pout2)
states: 2,938,771,643,647,634,886 (18)
abstracting: (P3<=0)
states: 829,847,212,462,169,001 (17)
abstracting: (31<=P1)
states: 5,821,654,708,510,864,440 (18)
.abstracting: (P3<=9)
states: 6,958,223,857,892,467,497 (18)
abstracting: (Pout1<=6)
states: 3,316,019,988,310,237,691 (18)
abstracting: (Pback2<=Pm1)
states: 8,106,821,143,746,622,531 (18)
abstracting: (Pm1<=53)
states: 15,464,575,628,860,676,067 (19)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m54.652sec

checking: AG [[[EG [~ [Pout2<=P2]] | E [[EX [P3<=97] | ~ [20<=Pout2]] U [P4<=38 | AF [81<=Pout2]]]] | [[AX [[AF [P2<=19] | P3<=P4]] | AF [EF [Pm3<=P2]]] | [Pback3<=Pout1 & [[[P1<=Pback3 | ~ [27<=Pout2]] | [EX [Pm2<=39] & [Pm1<=P3 & 56<=Pm1]]] | 44<=Pback1]]]]]
normalized: ~ [E [true U ~ [[[[Pback3<=Pout1 & [44<=Pback1 | [[[Pm1<=P3 & 56<=Pm1] & EX [Pm2<=39]] | [P1<=Pback3 | ~ [27<=Pout2]]]]] | [~ [EG [~ [E [true U Pm3<=P2]]]] | ~ [EX [~ [[P3<=P4 | ~ [EG [~ [P2<=19]]]]]]]]] | [E [[~ [20<=Pout2] | EX [P3<=97]] U [P4<=38 | ~ [EG [~ [81<=Pout2]]]]] | EG [~ [Pout2<=P2]]]]]]]

abstracting: (Pout2<=P2)
states: 6,264,473,328,360,996,931 (18)
.
EG iterations: 1
abstracting: (81<=Pout2)
states: 225,816,559,471,515,859 (17)
.
EG iterations: 1
abstracting: (P4<=38)
states: 13,196,043,512,398,696,027 (19)
abstracting: (P3<=97)
states: 17,263,000,855,973,636,925 (19)
.abstracting: (20<=Pout2)
states: 9,905,628,504,402,207,207 (18)
abstracting: (P2<=19)
states: 11,466,758,403,362,570,794 (19)
.
EG iterations: 1
abstracting: (P3<=P4)
states: 10,970,016,762,305,884,816 (19)
.abstracting: (Pm3<=P2)
states: 6,264,473,328,360,996,931 (18)
.
EG iterations: 1
abstracting: (27<=Pout2)
states: 7,850,647,611,660,482,665 (18)
abstracting: (P1<=Pback3)
states: 9,442,299,684,526,363,941 (18)
abstracting: (Pm2<=39)
states: 12,527,209,759,999,447,528 (19)
.abstracting: (56<=Pm1)
states: 1,582,798,978,848,150,015 (18)
abstracting: (Pm1<=P3)
states: 6,655,648,998,815,905,036 (18)
abstracting: (44<=Pback1)
states: 3,173,309,405,080,142,389 (18)
abstracting: (Pback3<=Pout1)
states: 8,106,821,143,746,622,531 (18)
-> the formula is TRUE

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

MC time: 3m 8.950sec

checking: E [~ [AG [~ [[[[Pm4<=41 | Pout1<=28] | Pback4<=Pback4] | [E [Pout4<=33 U Pback3<=Pback3] | [11<=Pback4 | P3<=P1]]]]]] U [E [AG [EG [Pout3<=85]] U 97<=Pm4] | ~ [[Pback1<=Pm3 | [EX [[86<=Pm2 | 44<=P3]] | [A [Pm2<=22 U 27<=P3] & [[P3<=76 | P2<=Pback4] & ~ [45<=Pm3]]]]]]]]
normalized: E [E [true U [[[11<=Pback4 | P3<=P1] | E [Pout4<=33 U Pback3<=Pback3]] | [Pback4<=Pback4 | [Pm4<=41 | Pout1<=28]]]] U [~ [[Pback1<=Pm3 | [[[~ [45<=Pm3] & [P3<=76 | P2<=Pback4]] & [~ [EG [~ [27<=P3]]] & ~ [E [~ [27<=P3] U [~ [Pm2<=22] & ~ [27<=P3]]]]]] | EX [[86<=Pm2 | 44<=P3]]]]] | E [~ [E [true U ~ [EG [Pout3<=85]]]] U 97<=Pm4]]]

abstracting: (97<=Pm4)
states: 1,952,265,160,466,420 (15)
abstracting: (Pout3<=85)
states: 17,160,776,161,234,688,083 (19)
.
EG iterations: 1
abstracting: (44<=P3)
states: 1,025,911,307,185,473,781 (18)
abstracting: (86<=Pm2)
states: 102,226,133,447,654,088 (17)
.abstracting: (27<=P3)
states: 3,709,903,996,626,495,190 (18)
abstracting: (Pm2<=22)
states: 8,270,866,588,577,020,375 (18)
abstracting: (27<=P3)
states: 3,709,903,996,626,495,190 (18)
abstracting: (27<=P3)
states: 3,709,903,996,626,495,190 (18)
.
EG iterations: 1
abstracting: (P2<=Pback4)
states: 10,970,016,762,305,884,816 (19)
abstracting: (P3<=76)
states: 17,247,771,373,697,979,191 (19)
abstracting: (45<=Pm3)
states: 3,774,111,439,354,842,502 (18)
abstracting: (Pback1<=Pm3)
states: 9,442,299,684,526,363,941 (18)
abstracting: (Pout1<=28)
states: 10,935,320,456,578,581,667 (19)
abstracting: (Pm4<=41)
states: 13,749,901,138,423,019,381 (19)
abstracting: (Pback4<=Pback4)
states: 17,263,002,294,682,342,171 (19)
abstracting: (Pback3<=Pback3)
states: 17,263,002,294,682,342,171 (19)
abstracting: (Pout4<=33)
states: 12,148,653,253,808,461,697 (19)
abstracting: (P3<=P1)
states: 10,970,016,762,305,884,816 (19)
abstracting: (11<=Pback4)
states: 12,258,272,942,568,651,180 (19)

BK_STOP 1678614620139

--------------------
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:7116 (444), effective:2200 (137)

initing FirstDep: 0m 0.000sec


iterations count:2488 (155), effective:689 (43)

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

iterations count:1226 (76), effective:330 (20)

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

iterations count:2874 (179), effective:781 (48)

iterations count:394 (24), effective:126 (7)

iterations count:1716 (107), effective:550 (34)

iterations count:1372 (85), effective:431 (26)

iterations count:3294 (205), effective:894 (55)

iterations count:200 (12), effective:107 (6)

iterations count:481 (30), effective:124 (7)

iterations count:4269 (266), effective:1232 (77)

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

iterations count:2496 (156), effective:682 (42)

iterations count:1621 (101), effective:460 (28)

iterations count:1052 (65), effective:308 (19)

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

iterations count:235 (14), effective:73 (4)

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

iterations count:202 (12), effective:62 (3)

iterations count:3877 (242), effective:1048 (65)

iterations count:416 (26), effective:200 (12)

iterations count:257 (16), effective:139 (8)

iterations count:3877 (242), effective:1048 (65)

iterations count:3877 (242), effective:1048 (65)

iterations count:456 (28), effective:164 (10)

iterations count:104 (6), effective:44 (2)

iterations count:2116 (132), effective:699 (43)

iterations count:758 (47), effective:297 (18)

iterations count:909 (56), effective:282 (17)

iterations count:4655 (290), effective:1306 (81)

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

iterations count:1937 (121), effective:577 (36)

iterations count:1516 (94), effective:400 (25)

iterations count:2035 (127), effective:606 (37)

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

iterations count:580 (36), effective:172 (10)

iterations count:202 (12), effective:62 (3)

iterations count:216 (13), effective:100 (6)

iterations count:1650 (103), effective:516 (32)

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

iterations count:1043 (65), effective:319 (19)

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

iterations count:16 (1), effective:0 (0)
/home/mcc/BenchKit/bin//../marcie/bin//../BenchKit_head.sh: line 16: 336 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-00100"
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-00100, 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-167856407400265"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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