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.r065-smll-167814392900097.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 CircadianClock-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814392900097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 10:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12K 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 CircadianClock-PT-000001-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-000001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678266227199

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=CircadianClock-PT-000001
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: CircadianClock_PT_000001
(NrP: 14 NrTr: 16 NrArc: 58)

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

net check time: 0m 0.000sec

init dd package: 0m 3.417sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 21 (2.1e+01) #states 128



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

checking: EX [1<=c]
normalized: EX [1<=c]

abstracting: (1<=c)
states: 64
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AG [~ [da<=mr_cap]]]
normalized: E [true U da<=mr_cap]

abstracting: (da<=mr_cap)
states: 96
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [E [~ [[EX [1<=dr] | AF [da_a<=0]]] U ~ [ma<=0]]]]
normalized: E [true U ~ [E [~ [[~ [EG [~ [da_a<=0]]] | EX [1<=dr]]] U ~ [ma<=0]]]]

abstracting: (ma<=0)
states: 64
abstracting: (1<=dr)
states: 64
.abstracting: (da_a<=0)
states: 64
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[~ [AX [ma_cap<=mr]] & mr<=ma_cap]]
normalized: E [true U [EX [~ [ma_cap<=mr]] & mr<=ma_cap]]

abstracting: (mr<=ma_cap)
states: 96
abstracting: (ma_cap<=mr)
states: 96
.-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [1<=ma U AG [A [~ [AX [c_cap<=da]] U A [[mr_cap<=1 | mr_cap<=1] U da_a<=1]]]]
normalized: [~ [EG [E [true U ~ [[~ [E [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]] U [~ [EX [~ [c_cap<=da]]] & ~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]]]]]] & ~ [E [E [true U ~ [[~ [E [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]] U [~ [EX [~ [c_cap<=da]]] & ~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]]]] U [~ [1<=ma] & E [true U ~ [[~ [E [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]] U [~ [EX [~ [c_cap<=da]]] & ~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]] & ~ [EG [~ [[~ [EG [~ [da_a<=1]]] & ~ [E [~ [da_a<=1] U [~ [da_a<=1] & ~ [[mr_cap<=1 | mr_cap<=1]]]]]]]]]]]]]]]]

abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
abstracting: (c_cap<=da)
states: 96
.abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
abstracting: (1<=ma)
states: 64
abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
abstracting: (c_cap<=da)
states: 96
.abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
abstracting: (c_cap<=da)
states: 96
.abstracting: (mr_cap<=1)
states: 128
abstracting: (mr_cap<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [EF [[~ [A [AF [dr<=da_a] U [AX [c<=r] & [ma_cap<=a & da<=0]]]] & ~ [dr_a<=0]]]]
normalized: ~ [E [true U [~ [[~ [EG [~ [[[ma_cap<=a & da<=0] & ~ [EX [~ [c<=r]]]]]]] & ~ [E [~ [[[ma_cap<=a & da<=0] & ~ [EX [~ [c<=r]]]]] U [EG [~ [dr<=da_a]] & ~ [[[ma_cap<=a & da<=0] & ~ [EX [~ [c<=r]]]]]]]]]] & ~ [dr_a<=0]]]]

abstracting: (dr_a<=0)
states: 64
abstracting: (c<=r)
states: 96
.abstracting: (da<=0)
states: 64
abstracting: (ma_cap<=a)
states: 96
abstracting: (dr<=da_a)
states: 96
.
EG iterations: 1
abstracting: (c<=r)
states: 96
.abstracting: (da<=0)
states: 64
abstracting: (ma_cap<=a)
states: 96
abstracting: (c<=r)
states: 96
.abstracting: (da<=0)
states: 64
abstracting: (ma_cap<=a)
states: 96
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [EX [[dr_a<=ma | [E [[da_a<=r & c_cap<=c_cap] U EG [1<=a_cap]] | EX [~ [1<=mr_cap]]]]]]
normalized: ~ [E [true U ~ [EX [[[EX [~ [1<=mr_cap]] | E [[da_a<=r & c_cap<=c_cap] U EG [1<=a_cap]]] | dr_a<=ma]]]]]

abstracting: (dr_a<=ma)
states: 96
abstracting: (1<=a_cap)
states: 64
.
EG iterations: 1
abstracting: (c_cap<=c_cap)
states: 128
abstracting: (da_a<=r)
states: 96
abstracting: (1<=mr_cap)
states: 64
..-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [[[c_cap<=ma_cap & ~ [A [EF [r<=1] U [ma_cap<=a | AF [ma<=c]]]]] & 1<=mr]]
normalized: EX [[[~ [[~ [EG [~ [[~ [EG [~ [ma<=c]]] | ma_cap<=a]]]] & ~ [E [~ [[~ [EG [~ [ma<=c]]] | ma_cap<=a]] U [~ [E [true U r<=1]] & ~ [[~ [EG [~ [ma<=c]]] | ma_cap<=a]]]]]]] & c_cap<=ma_cap] & 1<=mr]]

abstracting: (1<=mr)
states: 64
abstracting: (c_cap<=ma_cap)
states: 96
abstracting: (ma_cap<=a)
states: 96
abstracting: (ma<=c)
states: 96
.
EG iterations: 1
abstracting: (r<=1)
states: 128
abstracting: (ma_cap<=a)
states: 96
abstracting: (ma<=c)
states: 96
.
EG iterations: 1
abstracting: (ma_cap<=a)
states: 96
abstracting: (ma<=c)
states: 96
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AX [1<=da] | EF [[EX [~ [EG [c_cap<=0]]] & [[EX [A [1<=dr U 1<=da_a]] | A [a_cap<=0 U [dr_a<=mr_cap & ma_cap<=1]]] & AF [da_a<=1]]]]]
normalized: [E [true U [[~ [EG [~ [da_a<=1]]] & [EX [[~ [EG [~ [1<=da_a]]] & ~ [E [~ [1<=da_a] U [~ [1<=dr] & ~ [1<=da_a]]]]]] | [~ [EG [~ [[dr_a<=mr_cap & ma_cap<=1]]]] & ~ [E [~ [[dr_a<=mr_cap & ma_cap<=1]] U [~ [a_cap<=0] & ~ [[dr_a<=mr_cap & ma_cap<=1]]]]]]]] & EX [~ [EG [c_cap<=0]]]]] | ~ [EX [~ [1<=da]]]]

abstracting: (1<=da)
states: 64
.abstracting: (c_cap<=0)
states: 64
.
EG iterations: 1
.abstracting: (ma_cap<=1)
states: 128
abstracting: (dr_a<=mr_cap)
states: 96
abstracting: (a_cap<=0)
states: 64
abstracting: (ma_cap<=1)
states: 128
abstracting: (dr_a<=mr_cap)
states: 96
abstracting: (ma_cap<=1)
states: 128
abstracting: (dr_a<=mr_cap)
states: 96
.
EG iterations: 1
abstracting: (1<=da_a)
states: 64
abstracting: (1<=dr)
states: 64
abstracting: (1<=da_a)
states: 64
abstracting: (1<=da_a)
states: 64
.
EG iterations: 1
.abstracting: (da_a<=1)
states: 128
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [A [1<=ma_cap U [AG [r<=1] & [EF [mr<=r] & EG [ma<=0]]]]] | EF [EF [[[[A [da_a<=a_cap U ma_cap<=1] & EX [dr<=0]] & ~ [EF [1<=a]]] | EX [[mr<=0 & c<=1]]]]]]
normalized: [E [true U E [true U [[[[~ [EG [~ [ma_cap<=1]]] & ~ [E [~ [ma_cap<=1] U [~ [da_a<=a_cap] & ~ [ma_cap<=1]]]]] & EX [dr<=0]] & ~ [E [true U 1<=a]]] | EX [[mr<=0 & c<=1]]]]] | ~ [EG [~ [[~ [EG [~ [[[EG [ma<=0] & E [true U mr<=r]] & ~ [E [true U ~ [r<=1]]]]]]] & ~ [E [~ [[[EG [ma<=0] & E [true U mr<=r]] & ~ [E [true U ~ [r<=1]]]]] U [~ [1<=ma_cap] & ~ [[[EG [ma<=0] & E [true U mr<=r]] & ~ [E [true U ~ [r<=1]]]]]]]]]]]]]

abstracting: (r<=1)
states: 128
abstracting: (mr<=r)
states: 96
abstracting: (ma<=0)
states: 64
.
EG iterations: 1
abstracting: (1<=ma_cap)
states: 64
abstracting: (r<=1)
states: 128
abstracting: (mr<=r)
states: 96
abstracting: (ma<=0)
states: 64
.
EG iterations: 1
abstracting: (r<=1)
states: 128
abstracting: (mr<=r)
states: 96
abstracting: (ma<=0)
states: 64
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (c<=1)
states: 128
abstracting: (mr<=0)
states: 64
.abstracting: (1<=a)
states: 64
abstracting: (dr<=0)
states: 64
.abstracting: (ma_cap<=1)
states: 128
abstracting: (da_a<=a_cap)
states: 96
abstracting: (ma_cap<=1)
states: 128
abstracting: (ma_cap<=1)
states: 128
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [AX [A [[~ [[1<=mr & a_cap<=a_cap]] | AG [r<=1]] U ~ [AF [1<=mr]]]] U ~ [[[[~ [[1<=a_cap | dr_a<=0]] | [AX [1<=c_cap] | [c<=0 | da_a<=1]]] & AX [1<=da_a]] | [1<=r | a_cap<=r_cap]]]]
normalized: E [~ [EX [~ [[~ [EG [~ [EG [~ [1<=mr]]]]] & ~ [E [~ [EG [~ [1<=mr]]] U [~ [[~ [E [true U ~ [r<=1]]] | ~ [[1<=mr & a_cap<=a_cap]]]] & ~ [EG [~ [1<=mr]]]]]]]]]] U ~ [[[1<=r | a_cap<=r_cap] | [~ [EX [~ [1<=da_a]]] & [[[c<=0 | da_a<=1] | ~ [EX [~ [1<=c_cap]]]] | ~ [[1<=a_cap | dr_a<=0]]]]]]]

abstracting: (dr_a<=0)
states: 64
abstracting: (1<=a_cap)
states: 64
abstracting: (1<=c_cap)
states: 64
.abstracting: (da_a<=1)
states: 128
abstracting: (c<=0)
states: 64
abstracting: (1<=da_a)
states: 64
.abstracting: (a_cap<=r_cap)
states: 96
abstracting: (1<=r)
states: 64
abstracting: (1<=mr)
states: 64
.
EG iterations: 1
abstracting: (a_cap<=a_cap)
states: 128
abstracting: (1<=mr)
states: 64
abstracting: (r<=1)
states: 128
abstracting: (1<=mr)
states: 64
.
EG iterations: 1
abstracting: (1<=mr)
states: 64
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[[AF [1<=r] & AF [~ [EF [1<=c]]]] & [EF [AG [[A [1<=ma U c<=a_cap] & [da<=1 & da_a<=0]]]] | [EF [[EX [1<=c] | AF [1<=da]]] & E [[EX [da<=0] & ma<=1] U [AX [r_cap<=0] & ~ [[dr_a<=da & da_a<=1]]]]]]]]
normalized: ~ [[[E [true U ~ [E [true U ~ [[[da<=1 & da_a<=0] & [~ [EG [~ [c<=a_cap]]] & ~ [E [~ [c<=a_cap] U [~ [1<=ma] & ~ [c<=a_cap]]]]]]]]]] | [E [[EX [da<=0] & ma<=1] U [~ [[dr_a<=da & da_a<=1]] & ~ [EX [~ [r_cap<=0]]]]] & E [true U [~ [EG [~ [1<=da]]] | EX [1<=c]]]]] & [~ [EG [E [true U 1<=c]]] & ~ [EG [~ [1<=r]]]]]]

abstracting: (1<=r)
states: 64
.
EG iterations: 1
abstracting: (1<=c)
states: 64

EG iterations: 0
abstracting: (1<=c)
states: 64
.abstracting: (1<=da)
states: 64
.
EG iterations: 1
abstracting: (r_cap<=0)
states: 64
.abstracting: (da_a<=1)
states: 128
abstracting: (dr_a<=da)
states: 96
abstracting: (ma<=1)
states: 128
abstracting: (da<=0)
states: 64
.abstracting: (c<=a_cap)
states: 96
abstracting: (1<=ma)
states: 64
abstracting: (c<=a_cap)
states: 96
abstracting: (c<=a_cap)
states: 96
.
EG iterations: 1
abstracting: (da_a<=0)
states: 64
abstracting: (da<=1)
states: 128
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [~ [[A [[E [c<=dr_a U r<=c] | [A [1<=c_cap U 1<=ma_cap] | [1<=ma | 1<=r]]] U 1<=da_a] | EF [[AX [r_cap<=da] & [E [mr_cap<=r_cap U ma<=1] & [r_cap<=mr_cap & a_cap<=a]]]]]]]
normalized: ~ [E [true U [[~ [EG [~ [1<=da_a]]] & ~ [E [~ [1<=da_a] U [~ [[E [c<=dr_a U r<=c] | [[1<=ma | 1<=r] | [~ [EG [~ [1<=ma_cap]]] & ~ [E [~ [1<=ma_cap] U [~ [1<=c_cap] & ~ [1<=ma_cap]]]]]]]] & ~ [1<=da_a]]]]] | E [true U [[[r_cap<=mr_cap & a_cap<=a] & E [mr_cap<=r_cap U ma<=1]] & ~ [EX [~ [r_cap<=da]]]]]]]]

abstracting: (r_cap<=da)
states: 96
.abstracting: (ma<=1)
states: 128
abstracting: (mr_cap<=r_cap)
states: 96
abstracting: (a_cap<=a)
states: 64
abstracting: (r_cap<=mr_cap)
states: 96
abstracting: (1<=da_a)
states: 64
abstracting: (1<=ma_cap)
states: 64
abstracting: (1<=c_cap)
states: 64
abstracting: (1<=ma_cap)
states: 64
abstracting: (1<=ma_cap)
states: 64
.
EG iterations: 1
abstracting: (1<=r)
states: 64
abstracting: (1<=ma)
states: 64
abstracting: (r<=c)
states: 96
abstracting: (c<=dr_a)
states: 96
abstracting: (1<=da_a)
states: 64
abstracting: (1<=da_a)
states: 64
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[~ [[[1<=r | E [r<=c U c_cap<=0]] | ~ [[[a_cap<=0 | 1<=mr_cap] | dr<=1]]]] & [r<=mr_cap & [a<=ma_cap & [EF [[a_cap<=1 & ma_cap<=0]] & [[~ [r<=r] & [r<=ma & da<=0]] | E [1<=r U 1<=c_cap]]]]]]]
normalized: ~ [EG [~ [[~ [[~ [[[a_cap<=0 | 1<=mr_cap] | dr<=1]] | [E [r<=c U c_cap<=0] | 1<=r]]] & [[[[E [1<=r U 1<=c_cap] | [[r<=ma & da<=0] & ~ [r<=r]]] & E [true U [a_cap<=1 & ma_cap<=0]]] & a<=ma_cap] & r<=mr_cap]]]]]

abstracting: (r<=mr_cap)
states: 96
abstracting: (a<=ma_cap)
states: 96
abstracting: (ma_cap<=0)
states: 64
abstracting: (a_cap<=1)
states: 128
abstracting: (r<=r)
states: 128
abstracting: (da<=0)
states: 64
abstracting: (r<=ma)
states: 96
abstracting: (1<=c_cap)
states: 64
abstracting: (1<=r)
states: 64
abstracting: (1<=r)
states: 64
abstracting: (c_cap<=0)
states: 64
abstracting: (r<=c)
states: 96
abstracting: (dr<=1)
states: 128
abstracting: (1<=mr_cap)
states: 64
abstracting: (a_cap<=0)
states: 64
.
EG iterations: 1
-> the formula is TRUE

FORMULA CircadianClock-PT-000001-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [EX [[1<=da | [da<=1 | AG [[c_cap<=0 & da_a<=dr]]]]] U [~ [[[AG [c<=r_cap] & A [[dr_a<=dr & 1<=dr] U AF [r_cap<=0]]] | [[r<=1 | AX [mr<=c_cap]] & dr<=c_cap]]] | ~ [[~ [[AF [da_a<=mr] | mr_cap<=da_a]] | A [~ [r<=0] U EF [mr<=0]]]]]]
normalized: [~ [EG [~ [[~ [[[~ [E [true U ~ [c<=r_cap]]] & [~ [EG [EG [~ [r_cap<=0]]]] & ~ [E [EG [~ [r_cap<=0]] U [~ [[dr_a<=dr & 1<=dr]] & EG [~ [r_cap<=0]]]]]]] | [[~ [EX [~ [mr<=c_cap]]] | r<=1] & dr<=c_cap]]] | ~ [[[~ [EG [~ [E [true U mr<=0]]]] & ~ [E [~ [E [true U mr<=0]] U [~ [E [true U mr<=0]] & r<=0]]]] | ~ [[~ [EG [~ [da_a<=mr]]] | mr_cap<=da_a]]]]]]]] & ~ [E [~ [[~ [[[~ [E [true U ~ [c<=r_cap]]] & [~ [EG [EG [~ [r_cap<=0]]]] & ~ [E [EG [~ [r_cap<=0]] U [~ [[dr_a<=dr & 1<=dr]] & EG [~ [r_cap<=0]]]]]]] | [[~ [EX [~ [mr<=c_cap]]] | r<=1] & dr<=c_cap]]] | ~ [[[~ [EG [~ [E [true U mr<=0]]]] & ~ [E [~ [E [true U mr<=0]] U [~ [E [true U mr<=0]] & r<=0]]]] | ~ [[~ [EG [~ [da_a<=mr]]] | mr_cap<=da_a]]]]]] U [~ [[~ [[[~ [E [true U ~ [c<=r_cap]]] & [~ [EG [EG [~ [r_cap<=0]]]] & ~ [E [EG [~ [r_cap<=0]] U [~ [[dr_a<=dr & 1<=dr]] & EG [~ [r_cap<=0]]]]]]] | [[~ [EX [~ [mr<=c_cap]]] | r<=1] & dr<=c_cap]]] | ~ [[[~ [EG [~ [E [true U mr<=0]]]] & ~ [E [~ [E [true U mr<=0]] U [~ [E [true U mr<=0]] & r<=0]]]] | ~ [[~ [EG [~ [da_a<=mr]]] | mr_cap<=da_a]]]]]] & ~ [EX [[[~ [E [true U ~ [[c_cap<=0 & da_a<=dr]]]] | da<=1] | 1<=da]]]]]]]

abstracting: (1<=da)
states: 64
abstracting: (da<=1)
states: 128
abstracting: (da_a<=dr)
states: 96
abstracting: (c_cap<=0)
states: 64
.abstracting: (mr_cap<=da_a)
states: 96
abstracting: (da_a<=mr)
states: 96
.
EG iterations: 1
abstracting: (r<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
.
EG iterations: 1
abstracting: (dr<=c_cap)
states: 96
abstracting: (r<=1)
states: 128
abstracting: (mr<=c_cap)
states: 96
.abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (1<=dr)
states: 64
abstracting: (dr_a<=dr)
states: 64
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
.
EG iterations: 1
abstracting: (c<=r_cap)
states: 96
abstracting: (mr_cap<=da_a)
states: 96
abstracting: (da_a<=mr)
states: 96
.
EG iterations: 1
abstracting: (r<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
.
EG iterations: 1
abstracting: (dr<=c_cap)
states: 96
abstracting: (r<=1)
states: 128
abstracting: (mr<=c_cap)
states: 96
.abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (1<=dr)
states: 64
abstracting: (dr_a<=dr)
states: 64
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
.
EG iterations: 1
abstracting: (c<=r_cap)
states: 96
abstracting: (mr_cap<=da_a)
states: 96
abstracting: (da_a<=mr)
states: 96
.
EG iterations: 1
abstracting: (r<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
abstracting: (mr<=0)
states: 64
.
EG iterations: 1
abstracting: (dr<=c_cap)
states: 96
abstracting: (r<=1)
states: 128
abstracting: (mr<=c_cap)
states: 96
.abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (1<=dr)
states: 64
abstracting: (dr_a<=dr)
states: 64
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
abstracting: (r_cap<=0)
states: 64
.
EG iterations: 1
.
EG iterations: 1
abstracting: (c<=r_cap)
states: 96
.
EG iterations: 1
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: ~ [AG [[[[~ [1<=c_cap] | c_cap<=0] | [EG [[1<=a_cap & a_cap<=c]] | ~ [[E [r<=da_a U a_cap<=ma_cap] | 1<=a_cap]]]] | [EF [[[1<=mr_cap & a<=da_a] & E [mr_cap<=1 U mr_cap<=0]]] | [dr_a<=a & [[[da_a<=1 & ma_cap<=mr_cap] & [da_a<=0 & a_cap<=a_cap]] | E [c<=0 U 1<=ma_cap]]]]]]]
normalized: E [true U ~ [[[[[E [c<=0 U 1<=ma_cap] | [[da_a<=0 & a_cap<=a_cap] & [da_a<=1 & ma_cap<=mr_cap]]] & dr_a<=a] | E [true U [E [mr_cap<=1 U mr_cap<=0] & [1<=mr_cap & a<=da_a]]]] | [[~ [[1<=a_cap | E [r<=da_a U a_cap<=ma_cap]]] | EG [[1<=a_cap & a_cap<=c]]] | [~ [1<=c_cap] | c_cap<=0]]]]]

abstracting: (c_cap<=0)
states: 64
abstracting: (1<=c_cap)
states: 64
abstracting: (a_cap<=c)
states: 96
abstracting: (1<=a_cap)
states: 64
.
EG iterations: 1
abstracting: (a_cap<=ma_cap)
states: 96
abstracting: (r<=da_a)
states: 96
abstracting: (1<=a_cap)
states: 64
abstracting: (a<=da_a)
states: 96
abstracting: (1<=mr_cap)
states: 64
abstracting: (mr_cap<=0)
states: 64
abstracting: (mr_cap<=1)
states: 128
abstracting: (dr_a<=a)
states: 96
abstracting: (ma_cap<=mr_cap)
states: 96
abstracting: (da_a<=1)
states: 128
abstracting: (a_cap<=a_cap)
states: 128
abstracting: (da_a<=0)
states: 64
abstracting: (1<=ma_cap)
states: 64
abstracting: (c<=0)
states: 64
-> the formula is FALSE

FORMULA CircadianClock-PT-000001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 2090 (2.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4410 7603 12013
used/not used/entry size/cache size: 9062 67099802 16 1024MB
basic ops cache: hits/miss/sum: 2041 3099 5140
used/not used/entry size/cache size: 5882 16771334 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: 371 346 717
used/not used/entry size/cache size: 346 8388262 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 67106794
1 2050
2 20
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.134sec


BK_STOP 1678266232399

--------------------
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.003sec


iterations count:113 (7), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:43 (2), effective:7 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:65 (4), effective:8 (0)

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

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

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

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

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

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

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

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

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

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

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

iterations count:47 (2), effective:7 (0)

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

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

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

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

iterations count:83 (5), effective:11 (0)

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

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

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

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

iterations count:83 (5), effective:11 (0)

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

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

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

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

iterations count:83 (5), effective:11 (0)

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

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

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

iterations count:20 (1), effective:1 (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="CircadianClock-PT-000001"
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 CircadianClock-PT-000001, 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 r065-smll-167814392900097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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