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.r321-tall-167889192500681.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 ResAllocation-PT-R003C005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192500681
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.9K Feb 25 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 15:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 15:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 35K 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 ResAllocation-PT-R003C005-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R003C005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678940610788

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=ResAllocation-PT-R003C005
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: ResAllocation_PT_R003C005
(NrP: 30 NrTr: 20 NrArc: 84)

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

net check time: 0m 0.000sec

init dd package: 0m 2.916sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 166 (1.7e+02) #states 1,200 (3)



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

checking: AX [~ [AX [p_0_0<=0]]]
normalized: ~ [EX [~ [EX [~ [p_0_0<=0]]]]]

abstracting: (p_0_0<=0)
states: 640
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [EX [AF [AF [EG [r_2_1<=1]]]]]
normalized: ~ [EG [~ [EX [~ [EG [EG [~ [EG [r_2_1<=1]]]]]]]]]

abstracting: (r_2_1<=1)
states: 1,200 (3)

EG iterations: 0
.
EG iterations: 1
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [AG [1<=r_0_2]]
normalized: E [true U ~ [1<=r_0_2]]

abstracting: (1<=r_0_2)
states: 480
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [EX [AX [~ [AG [p_4_0<=p_2_1]]]]]
normalized: ~ [EX [~ [EX [~ [E [true U ~ [p_4_0<=p_2_1]]]]]]]

abstracting: (p_4_0<=p_2_1)
states: 848
..-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [r_4_0<=r_0_0]
normalized: EX [r_4_0<=r_0_0]

abstracting: (r_4_0<=r_0_0)
states: 856
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [E [1<=p_0_1 U p_3_2<=p_2_0]]
normalized: ~ [E [1<=p_0_1 U p_3_2<=p_2_0]]

abstracting: (p_3_2<=p_2_0)
states: 992
abstracting: (1<=p_0_1)
states: 488
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [p_3_2<=0] & EG [p_4_0<=r_4_0]]
normalized: [EG [p_4_0<=r_4_0] & ~ [EG [~ [p_3_2<=0]]]]

abstracting: (p_3_2<=0)
states: 848
.
EG iterations: 1
abstracting: (p_4_0<=r_4_0)
states: 640
...........
EG iterations: 11
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [EX [AG [[AF [1<=r_3_2] & EX [p_2_0<=0]]]] U EG [r_0_0<=1]]
normalized: E [EX [~ [E [true U ~ [[EX [p_2_0<=0] & ~ [EG [~ [1<=r_3_2]]]]]]]] U EG [r_0_0<=1]]

abstracting: (r_0_0<=1)
states: 1,200 (3)

EG iterations: 0
abstracting: (1<=r_3_2)
states: 480
..........
EG iterations: 10
abstracting: (p_2_0<=0)
states: 672
..-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [AG [[AX [[EX [r_4_1<=1] | [p_3_2<=r_0_1 & p_1_0<=1]]] & AF [EF [r_3_0<=r_2_2]]]]]
normalized: ~ [E [true U E [true U ~ [[~ [EG [~ [E [true U r_3_0<=r_2_2]]]] & ~ [EX [~ [[[p_3_2<=r_0_1 & p_1_0<=1] | EX [r_4_1<=1]]]]]]]]]]

abstracting: (r_4_1<=1)
states: 1,200 (3)
.abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_3_2<=r_0_1)
states: 996
.abstracting: (r_3_0<=r_2_2)
states: 916
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [[AF [[r_0_0<=0 & EF [r_1_2<=p_1_1]]] | [EF [[1<=r_0_2 & [p_2_0<=1 | ~ [p_2_0<=r_1_1]]]] & r_2_2<=r_0_2]]]
normalized: ~ [EG [~ [[[E [true U [[~ [p_2_0<=r_1_1] | p_2_0<=1] & 1<=r_0_2]] & r_2_2<=r_0_2] | ~ [EG [~ [[E [true U r_1_2<=p_1_1] & r_0_0<=0]]]]]]]]

abstracting: (r_0_0<=0)
states: 640
abstracting: (r_1_2<=p_1_1)
states: 700
...........
EG iterations: 11
abstracting: (r_2_2<=r_0_2)
states: 828
abstracting: (1<=r_0_2)
states: 480
abstracting: (p_2_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_1_1)
states: 928
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AX [A [E [A [AF [1<=r_2_0] U ~ [p_0_0<=r_2_1]] U ~ [p_2_2<=r_4_1]] U [~ [[EX [p_2_2<=p_2_1] & [EF [1<=r_3_1] | r_2_0<=1]]] | p_2_2<=r_0_2]]]
normalized: ~ [EX [~ [[~ [EG [~ [[~ [[[E [true U 1<=r_3_1] | r_2_0<=1] & EX [p_2_2<=p_2_1]]] | p_2_2<=r_0_2]]]] & ~ [E [~ [[~ [[[E [true U 1<=r_3_1] | r_2_0<=1] & EX [p_2_2<=p_2_1]]] | p_2_2<=r_0_2]] U [~ [[~ [[[E [true U 1<=r_3_1] | r_2_0<=1] & EX [p_2_2<=p_2_1]]] | p_2_2<=r_0_2]] & ~ [E [[~ [E [p_0_0<=r_2_1 U [EG [~ [1<=r_2_0]] & p_0_0<=r_2_1]]] & ~ [EG [p_0_0<=r_2_1]]] U ~ [p_2_2<=r_4_1]]]]]]]]]]

abstracting: (p_2_2<=r_4_1)
states: 1,072 (3)
abstracting: (p_0_0<=r_2_1)
states: 912
..........
EG iterations: 10
abstracting: (p_0_0<=r_2_1)
states: 912
abstracting: (1<=r_2_0)
states: 592
.......
EG iterations: 7
abstracting: (p_0_0<=r_2_1)
states: 912
abstracting: (p_2_2<=r_0_2)
states: 1,072 (3)
abstracting: (p_2_2<=p_2_1)
states: 1,072 (3)
.abstracting: (r_2_0<=1)
states: 1,200 (3)
abstracting: (1<=r_3_1)
states: 528
abstracting: (p_2_2<=r_0_2)
states: 1,072 (3)
abstracting: (p_2_2<=p_2_1)
states: 1,072 (3)
.abstracting: (r_2_0<=1)
states: 1,200 (3)
abstracting: (1<=r_3_1)
states: 528
abstracting: (p_2_2<=r_0_2)
states: 1,072 (3)
abstracting: (p_2_2<=p_2_1)
states: 1,072 (3)
.abstracting: (r_2_0<=1)
states: 1,200 (3)
abstracting: (1<=r_3_1)
states: 528
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: E [1<=r_4_0 U [EX [[[~ [EX [1<=p_4_2]] | 1<=r_2_1] | ~ [1<=r_2_0]]] & AX [[[[~ [p_4_1<=r_4_1] | EG [p_4_2<=p_0_0]] & ~ [p_3_1<=p_0_0]] | [~ [AX [1<=p_1_2]] | p_3_0<=1]]]]]
normalized: E [1<=r_4_0 U [EX [[[~ [EX [1<=p_4_2]] | 1<=r_2_1] | ~ [1<=r_2_0]]] & ~ [EX [~ [[[EX [~ [1<=p_1_2]] | p_3_0<=1] | [~ [p_3_1<=p_0_0] & [EG [p_4_2<=p_0_0] | ~ [p_4_1<=r_4_1]]]]]]]]]

abstracting: (p_4_1<=r_4_1)
states: 712
abstracting: (p_4_2<=p_0_0)
states: 1,008 (3)
.
EG iterations: 1
abstracting: (p_3_1<=p_0_0)
states: 1,096 (3)
abstracting: (p_3_0<=1)
states: 1,200 (3)
abstracting: (1<=p_1_2)
states: 352
..abstracting: (1<=r_2_0)
states: 592
abstracting: (1<=r_2_1)
states: 600
abstracting: (1<=p_4_2)
states: 368
..abstracting: (1<=r_4_0)
states: 640
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [AX [[[[~ [1<=r_2_0] | AX [[1<=r_1_0 | r_0_2<=0]]] & [E [p_0_1<=r_1_1 U ~ [p_3_0<=p_0_2]] | AF [~ [p_2_0<=0]]]] & [p_4_2<=1 | ~ [[~ [[r_1_1<=0 & p_2_1<=r_1_0]] | p_3_2<=0]]]]]]
normalized: EX [~ [[[~ [[p_3_2<=0 | ~ [[r_1_1<=0 & p_2_1<=r_1_0]]]] | p_4_2<=1] & [[~ [EG [p_2_0<=0]] | E [p_0_1<=r_1_1 U ~ [p_3_0<=p_0_2]]] & [~ [EX [~ [[1<=r_1_0 | r_0_2<=0]]]] | ~ [1<=r_2_0]]]]]]

abstracting: (1<=r_2_0)
states: 592
abstracting: (r_0_2<=0)
states: 720
abstracting: (1<=r_1_0)
states: 592
.abstracting: (p_3_0<=p_0_2)
states: 1,136 (3)
abstracting: (p_0_1<=r_1_1)
states: 992
abstracting: (p_2_0<=0)
states: 672
........
EG iterations: 8
abstracting: (p_4_2<=1)
states: 1,200 (3)
abstracting: (p_2_1<=r_1_0)
states: 992
abstracting: (r_1_1<=0)
states: 600
abstracting: (p_3_2<=0)
states: 848
.-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [A [~ [[r_0_1<=p_3_1 | E [~ [[r_1_0<=r_3_1 & p_0_1<=p_0_1]] U AG [r_2_2<=r_0_1]]]] U ~ [A [~ [AG [p_1_1<=p_0_2]] U A [[p_2_0<=r_4_2 & p_1_0<=1] U AG [r_2_1<=r_4_1]]]]]]
normalized: ~ [[~ [EG [[~ [EG [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]] U [~ [E [true U ~ [p_1_1<=p_0_2]]] & ~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]]]]]] & ~ [E [[~ [EG [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]] U [~ [E [true U ~ [p_1_1<=p_0_2]]] & ~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]]]] U [[E [~ [[r_1_0<=r_3_1 & p_0_1<=p_0_1]] U ~ [E [true U ~ [r_2_2<=r_0_1]]]] | r_0_1<=p_3_1] & [~ [EG [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]] U [~ [E [true U ~ [p_1_1<=p_0_2]]] & ~ [[~ [EG [E [true U ~ [r_2_1<=r_4_1]]]] & ~ [E [E [true U ~ [r_2_1<=r_4_1]] U [~ [[p_2_0<=r_4_2 & p_1_0<=1]] & E [true U ~ [r_2_1<=r_4_1]]]]]]]]]]]]]]]]

abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (p_1_1<=p_0_2)
states: 1,016 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
.
EG iterations: 1
abstracting: (r_0_1<=p_3_1)
states: 744
abstracting: (r_2_2<=r_0_1)
states: 860
abstracting: (p_0_1<=p_0_1)
states: 1,200 (3)
abstracting: (r_1_0<=r_3_1)
states: 872
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (p_1_1<=p_0_2)
states: 1,016 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
.
EG iterations: 1
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (p_1_1<=p_0_2)
states: 1,016 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (p_1_0<=1)
states: 1,200 (3)
abstracting: (p_2_0<=r_4_2)
states: 1,024 (3)
abstracting: (r_2_1<=r_4_1)
states: 920
abstracting: (r_2_1<=r_4_1)
states: 920
......
EG iterations: 6
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: [~ [A [p_3_1<=p_4_0 U [AG [1<=r_3_1] | ~ [[p_3_2<=p_1_2 | r_4_2<=p_1_2]]]]] & AF [[[E [r_1_2<=r_2_1 U 1<=p_1_2] | [[[[1<=p_0_0 & p_3_1<=p_3_1] | ~ [1<=p_3_0]] | AF [p_1_0<=p_2_1]] & p_3_0<=p_0_2]] & AF [EF [1<=r_2_2]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [E [true U 1<=r_2_2]]]] & [[p_3_0<=p_0_2 & [~ [EG [~ [p_1_0<=p_2_1]]] | [~ [1<=p_3_0] | [1<=p_0_0 & p_3_1<=p_3_1]]]] | E [r_1_2<=r_2_1 U 1<=p_1_2]]]]]] & ~ [[~ [EG [~ [[~ [[p_3_2<=p_1_2 | r_4_2<=p_1_2]] | ~ [E [true U ~ [1<=r_3_1]]]]]]] & ~ [E [~ [[~ [[p_3_2<=p_1_2 | r_4_2<=p_1_2]] | ~ [E [true U ~ [1<=r_3_1]]]]] U [~ [p_3_1<=p_4_0] & ~ [[~ [[p_3_2<=p_1_2 | r_4_2<=p_1_2]] | ~ [E [true U ~ [1<=r_3_1]]]]]]]]]]]

abstracting: (1<=r_3_1)
states: 528
abstracting: (r_4_2<=p_1_2)
states: 632
abstracting: (p_3_2<=p_1_2)
states: 980
abstracting: (p_3_1<=p_4_0)
states: 1,088 (3)
abstracting: (1<=r_3_1)
states: 528
abstracting: (r_4_2<=p_1_2)
states: 632
abstracting: (p_3_2<=p_1_2)
states: 980
abstracting: (1<=r_3_1)
states: 528
abstracting: (r_4_2<=p_1_2)
states: 632
abstracting: (p_3_2<=p_1_2)
states: 980
.
EG iterations: 1
abstracting: (1<=p_1_2)
states: 352
abstracting: (r_1_2<=r_2_1)
states: 896
abstracting: (p_3_1<=p_3_1)
states: 1,200 (3)
abstracting: (1<=p_0_0)
states: 560
abstracting: (1<=p_3_0)
states: 80
abstracting: (p_1_0<=p_2_1)
states: 1,120 (3)
.......
EG iterations: 7
abstracting: (p_3_0<=p_0_2)
states: 1,136 (3)
abstracting: (1<=r_2_2)
states: 592
.
EG iterations: 1
.........
EG iterations: 9
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EG [[[[r_4_0<=0 | [~ [[AG [1<=p_4_0] & r_2_2<=0]] | 1<=r_0_1]] | AX [A [EX [r_3_1<=0] U [p_2_2<=p_3_0 & r_4_2<=1]]]] & [[AF [p_0_0<=1] | [~ [[r_4_2<=0 | [r_0_2<=r_3_2 | 1<=p_2_0]]] | [[[p_4_0<=p_1_0 & 1<=r_0_0] | [p_2_2<=r_1_2 & r_4_1<=0]] & r_4_0<=1]]] | p_0_1<=r_3_2]]]
normalized: EG [[[p_0_1<=r_3_2 | [[[r_4_0<=1 & [[p_2_2<=r_1_2 & r_4_1<=0] | [p_4_0<=p_1_0 & 1<=r_0_0]]] | ~ [[r_4_2<=0 | [r_0_2<=r_3_2 | 1<=p_2_0]]]] | ~ [EG [~ [p_0_0<=1]]]]] & [~ [EX [~ [[~ [EG [~ [[p_2_2<=p_3_0 & r_4_2<=1]]]] & ~ [E [~ [[p_2_2<=p_3_0 & r_4_2<=1]] U [~ [EX [r_3_1<=0]] & ~ [[p_2_2<=p_3_0 & r_4_2<=1]]]]]]]]] | [r_4_0<=0 | [1<=r_0_1 | ~ [[r_2_2<=0 & ~ [E [true U ~ [1<=p_4_0]]]]]]]]]]

abstracting: (1<=p_4_0)
states: 560
abstracting: (r_2_2<=0)
states: 608
abstracting: (1<=r_0_1)
states: 528
abstracting: (r_4_0<=0)
states: 560
abstracting: (r_4_2<=1)
states: 1,200 (3)
abstracting: (p_2_2<=p_3_0)
states: 944
abstracting: (r_3_1<=0)
states: 672
.abstracting: (r_4_2<=1)
states: 1,200 (3)
abstracting: (p_2_2<=p_3_0)
states: 944
abstracting: (r_4_2<=1)
states: 1,200 (3)
abstracting: (p_2_2<=p_3_0)
states: 944
.
EG iterations: 1
.abstracting: (p_0_0<=1)
states: 1,200 (3)
.
EG iterations: 1
abstracting: (1<=p_2_0)
states: 528
abstracting: (r_0_2<=r_3_2)
states: 916
abstracting: (r_4_2<=0)
states: 368
abstracting: (1<=r_0_0)
states: 560
abstracting: (p_4_0<=p_1_0)
states: 672
abstracting: (r_4_1<=0)
states: 488
abstracting: (p_2_2<=r_1_2)
states: 944
abstracting: (r_4_0<=1)
states: 1,200 (3)
abstracting: (p_0_1<=r_3_2)
states: 908

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 57227 (5.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 29283 107616 136899
used/not used/entry size/cache size: 152180 66956684 16 1024MB
basic ops cache: hits/miss/sum: 14244 40858 55102
used/not used/entry size/cache size: 80105 16697111 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: 868 2910 3778
used/not used/entry size/cache size: 2910 8385698 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 67053173
1 54209
2 1429
3 52
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.731sec


BK_STOP 1678940615566

--------------------
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:154 (7), effective:30 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:52 (2), effective:4 (0)

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

iterations count:51 (2), effective:10 (0)

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

iterations count:49 (2), effective:4 (0)

iterations count:153 (7), effective:29 (1)

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

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

iterations count:35 (1), effective:4 (0)

iterations count:44 (2), effective:5 (0)

iterations count:41 (2), effective:3 (0)

iterations count:46 (2), effective:4 (0)

iterations count:46 (2), effective:4 (0)

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

iterations count:46 (2), effective:4 (0)

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

iterations count:125 (6), effective:16 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:10 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:48 (2), effective:5 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:10 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

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

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:10 (0)

iterations count:73 (3), effective:7 (0)

iterations count:73 (3), effective:7 (0)

iterations count:87 (4), effective:11 (0)

iterations count:73 (3), effective:7 (0)

iterations count:74 (3), effective:8 (0)

iterations count:74 (3), effective:8 (0)

iterations count:61 (3), effective:8 (0)

iterations count:74 (3), effective:8 (0)

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

iterations count:50 (2), effective:4 (0)

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

iterations count:48 (2), effective:5 (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="ResAllocation-PT-R003C005"
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 ResAllocation-PT-R003C005, 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 r321-tall-167889192500681"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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