About the Execution of Marcie for CircadianClock-PT-000100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5582.764 | 10211.00 | 10060.00 | 0.00 | TFTFTTFTFFFFFFFF | normal |
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-167814393000113.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-000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:34 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.5K Feb 25 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:38 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 11K 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-000100-CTLCardinality-00
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-01
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-02
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-03
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-04
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-05
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-06
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-07
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-08
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-09
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-10
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-11
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-12
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-13
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-14
FORMULA_NAME CircadianClock-PT-000100-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678266361236
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-000100
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_000100
(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.676sec
RS generation: 0m 0.047sec
-> reachability set: #nodes 516 (5.2e+02) #states 42,040,402,004 (10)
starting MCC model checker
--------------------------
checking: EF [c_cap<=ma]
normalized: E [true U c_cap<=ma]
abstracting: (c_cap<=ma)
states: 21,228,321,804 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.210sec
checking: EF [EG [[22<=da_a & dr<=69]]]
normalized: E [true U EG [[22<=da_a & dr<=69]]]
abstracting: (dr<=69)
states: 42,040,402,004 (10)
abstracting: (22<=da_a)
states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [EF [AX [E [~ [da_a<=45] U [mr<=57 | 4<=r_cap]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [E [~ [da_a<=45] U [mr<=57 | 4<=r_cap]]]]]]]]]
abstracting: (4<=r_cap)
states: 40,375,435,588 (10)
abstracting: (mr<=57)
states: 24,142,013,032 (10)
abstracting: (da_a<=45)
states: 42,040,402,004 (10)
.-> the formula is TRUE
FORMULA CircadianClock-PT-000100-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: EX [EX [EF [[38<=c | [[16<=dr_a | 32<=a] & c<=mr_cap]]]]]
normalized: EX [EX [E [true U [38<=c | [c<=mr_cap & [16<=dr_a | 32<=a]]]]]]
abstracting: (32<=a)
states: 28,720,670,676 (10)
abstracting: (16<=dr_a)
states: 0
abstracting: (c<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (38<=c)
states: 26,223,221,052 (10)
..-> the formula is TRUE
FORMULA CircadianClock-PT-000100-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.141sec
checking: ~ [AG [EX [EF [[AG [a<=dr] | [mr_cap<=dr & da<=39]]]]]]
normalized: E [true U ~ [EX [E [true U [[mr_cap<=dr & da<=39] | ~ [E [true U ~ [a<=dr]]]]]]]]
abstracting: (a<=dr)
states: 624,362,406 (8)
abstracting: (da<=39)
states: 42,040,402,004 (10)
abstracting: (mr_cap<=dr)
states: 624,362,406 (8)
.-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.157sec
checking: EF [[EF [EX [c_cap<=92]] & AG [[~ [[EX [63<=mr_cap] | AF [mr_cap<=95]]] | ~ [a_cap<=a_cap]]]]]
normalized: E [true U [~ [E [true U ~ [[~ [a_cap<=a_cap] | ~ [[~ [EG [~ [mr_cap<=95]]] | EX [63<=mr_cap]]]]]]] & E [true U EX [c_cap<=92]]]]
abstracting: (c_cap<=92)
states: 38,710,469,172 (10)
.abstracting: (63<=mr_cap)
states: 15,817,180,952 (10)
.abstracting: (mr_cap<=95)
states: 39,959,193,984 (10)
.
EG iterations: 1
abstracting: (a_cap<=a_cap)
states: 42,040,402,004 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: [AG [~ [EX [[41<=mr_cap | ~ [[da_a<=67 | r<=da]]]]]] & EG [ma<=da_a]]
normalized: [EG [ma<=da_a] & ~ [E [true U EX [[41<=mr_cap | ~ [[da_a<=67 | r<=da]]]]]]]
abstracting: (r<=da)
states: 624,362,406 (8)
abstracting: (da_a<=67)
states: 42,040,402,004 (10)
abstracting: (41<=mr_cap)
states: 24,974,496,240 (10)
.abstracting: (ma<=da_a)
states: 624,362,406 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: EX [[AG [EF [[[c_cap<=c_cap | ma<=c_cap] & ~ [da_a<=14]]]] & EX [EG [[[c<=47 | 72<=mr] | EG [63<=da]]]]]]
normalized: EX [[EX [EG [[EG [63<=da] | [c<=47 | 72<=mr]]]] & ~ [E [true U ~ [E [true U [~ [da_a<=14] & [c_cap<=c_cap | ma<=c_cap]]]]]]]]
abstracting: (ma<=c_cap)
states: 21,228,321,804 (10)
abstracting: (c_cap<=c_cap)
states: 42,040,402,004 (10)
abstracting: (da_a<=14)
states: 42,040,402,004 (10)
abstracting: (72<=mr)
states: 12,071,006,516 (10)
abstracting: (c<=47)
states: 19,979,596,992 (10)
abstracting: (63<=da)
states: 0
.
EG iterations: 1
.
EG iterations: 1
..-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: AF [[[EF [~ [[a<=10 & 29<=mr_cap]]] | ~ [[AF [~ [ma_cap<=mr]] | [AF [ma_cap<=10] & A [38<=mr U 36<=r]]]]] & da_a<=77]]
normalized: ~ [EG [~ [[da_a<=77 & [~ [[[[~ [EG [~ [36<=r]]] & ~ [E [~ [36<=r] U [~ [38<=mr] & ~ [36<=r]]]]] & ~ [EG [~ [ma_cap<=10]]]] | ~ [EG [ma_cap<=mr]]]] | E [true U ~ [[a<=10 & 29<=mr_cap]]]]]]]]
abstracting: (29<=mr_cap)
states: 29,969,395,488 (10)
abstracting: (a<=10)
states: 4,578,657,644 (9)
abstracting: (ma_cap<=mr)
states: 21,228,321,804 (10)
.
EG iterations: 1
abstracting: (ma_cap<=10)
states: 4,578,657,644 (9)
.
EG iterations: 1
abstracting: (36<=r)
states: 27,055,704,260 (10)
abstracting: (38<=mr)
states: 26,223,221,052 (10)
abstracting: (36<=r)
states: 27,055,704,260 (10)
abstracting: (36<=r)
states: 27,055,704,260 (10)
.
EG iterations: 1
abstracting: (da_a<=77)
states: 42,040,402,004 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.317sec
checking: AG [[~ [AF [[[[99<=da & 34<=mr_cap] | a_cap<=ma] & [~ [r<=17] & EG [r<=86]]]]] & EG [[dr<=52 | 74<=a]]]]
normalized: ~ [E [true U ~ [[EG [[dr<=52 | 74<=a]] & EG [~ [[[EG [r<=86] & ~ [r<=17]] & [a_cap<=ma | [99<=da & 34<=mr_cap]]]]]]]]]
abstracting: (34<=mr_cap)
states: 27,888,187,468 (10)
abstracting: (99<=da)
states: 0
abstracting: (a_cap<=ma)
states: 21,228,321,804 (10)
abstracting: (r<=17)
states: 7,492,348,872 (9)
abstracting: (r<=86)
states: 36,213,019,548 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (74<=a)
states: 11,238,523,308 (10)
abstracting: (dr<=52)
states: 42,040,402,004 (10)
EG iterations: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.183sec
checking: EX [AG [[[EG [mr<=ma_cap] | AX [[74<=c & dr<=29]]] | EX [[ma<=r_cap | [19<=ma_cap | 76<=dr_a]]]]]]
normalized: EX [~ [E [true U ~ [[EX [[ma<=r_cap | [19<=ma_cap | 76<=dr_a]]] | [~ [EX [~ [[74<=c & dr<=29]]]] | EG [mr<=ma_cap]]]]]]]
abstracting: (mr<=ma_cap)
states: 21,228,321,804 (10)
.
EG iterations: 1
abstracting: (dr<=29)
states: 42,040,402,004 (10)
abstracting: (74<=c)
states: 11,238,523,308 (10)
.abstracting: (76<=dr_a)
states: 0
abstracting: (19<=ma_cap)
states: 34,131,811,528 (10)
abstracting: (ma<=r_cap)
states: 21,228,321,804 (10)
..-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.326sec
checking: ~ [A [EF [[~ [E [dr_a<=mr_cap U 1<=r_cap]] | ~ [[EG [ma_cap<=81] | [a<=a_cap & a<=mr]]]]] U ~ [AG [[[EG [a<=91] | ~ [87<=c]] | 60<=r]]]]]
normalized: ~ [[~ [EG [~ [E [true U ~ [[60<=r | [~ [87<=c] | EG [a<=91]]]]]]]] & ~ [E [~ [E [true U ~ [[60<=r | [~ [87<=c] | EG [a<=91]]]]]] U [~ [E [true U [~ [[[a<=a_cap & a<=mr] | EG [ma_cap<=81]]] | ~ [E [dr_a<=mr_cap U 1<=r_cap]]]]] & ~ [E [true U ~ [[60<=r | [~ [87<=c] | EG [a<=91]]]]]]]]]]]
abstracting: (a<=91)
states: 38,294,227,568 (10)
.
EG iterations: 1
abstracting: (87<=c)
states: 5,827,382,456 (9)
abstracting: (60<=r)
states: 17,065,905,764 (10)
abstracting: (1<=r_cap)
states: 41,624,160,400 (10)
abstracting: (dr_a<=mr_cap)
states: 41,832,281,202 (10)
abstracting: (ma_cap<=81)
states: 34,131,811,528 (10)
.
EG iterations: 1
abstracting: (a<=mr)
states: 21,228,321,804 (10)
abstracting: (a<=a_cap)
states: 21,228,321,804 (10)
abstracting: (a<=91)
states: 38,294,227,568 (10)
.
EG iterations: 1
abstracting: (87<=c)
states: 5,827,382,456 (9)
abstracting: (60<=r)
states: 17,065,905,764 (10)
abstracting: (a<=91)
states: 38,294,227,568 (10)
.
EG iterations: 1
abstracting: (87<=c)
states: 5,827,382,456 (9)
abstracting: (60<=r)
states: 17,065,905,764 (10)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.289sec
checking: [EX [[E [[~ [[97<=mr_cap & 79<=dr_a]] | AG [r_cap<=85]] U ma_cap<=a] & mr_cap<=r_cap]] | AF [[mr_cap<=mr & [EF [[67<=r & [mr<=75 | r<=49]]] | AX [AG [a<=26]]]]]]
normalized: [~ [EG [~ [[mr_cap<=mr & [~ [EX [E [true U ~ [a<=26]]]] | E [true U [67<=r & [mr<=75 | r<=49]]]]]]]] | EX [[mr_cap<=r_cap & E [[~ [E [true U ~ [r_cap<=85]]] | ~ [[97<=mr_cap & 79<=dr_a]]] U ma_cap<=a]]]]
abstracting: (ma_cap<=a)
states: 21,228,321,804 (10)
abstracting: (79<=dr_a)
states: 0
abstracting: (97<=mr_cap)
states: 1,664,966,416 (9)
abstracting: (r_cap<=85)
states: 35,796,777,944 (10)
abstracting: (mr_cap<=r_cap)
states: 21,228,321,804 (10)
.abstracting: (r<=49)
states: 20,812,080,200 (10)
abstracting: (mr<=75)
states: 31,634,361,904 (10)
abstracting: (67<=r)
states: 14,152,214,536 (10)
abstracting: (a<=26)
states: 11,238,523,308 (10)
.abstracting: (mr_cap<=mr)
states: 21,228,321,804 (10)
.
EG iterations: 1
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.359sec
checking: [EG [[E [AX [[a<=76 | ma<=1]] U ~ [AG [dr_a<=da]]] & A [[EX [da_a<=22] | [AG [r<=a_cap] & [58<=mr_cap & da_a<=23]]] U [~ [AX [dr_a<=13]] | ~ [[50<=ma_cap | da_a<=a_cap]]]]]] | AF [23<=dr_a]]
normalized: [~ [EG [~ [23<=dr_a]]] | EG [[[~ [EG [~ [[~ [[50<=ma_cap | da_a<=a_cap]] | EX [~ [dr_a<=13]]]]]] & ~ [E [~ [[~ [[50<=ma_cap | da_a<=a_cap]] | EX [~ [dr_a<=13]]]] U [~ [[[[58<=mr_cap & da_a<=23] & ~ [E [true U ~ [r<=a_cap]]]] | EX [da_a<=22]]] & ~ [[~ [[50<=ma_cap | da_a<=a_cap]] | EX [~ [dr_a<=13]]]]]]]] & E [~ [EX [~ [[a<=76 | ma<=1]]]] U E [true U ~ [dr_a<=da]]]]]]
abstracting: (dr_a<=da)
states: 31,530,301,503 (10)
abstracting: (ma<=1)
states: 832,483,208 (8)
abstracting: (a<=76)
states: 32,050,603,508 (10)
.abstracting: (dr_a<=13)
states: 42,040,402,004 (10)
.abstracting: (da_a<=a_cap)
states: 41,832,281,202 (10)
abstracting: (50<=ma_cap)
states: 21,228,321,804 (10)
abstracting: (da_a<=22)
states: 42,040,402,004 (10)
.abstracting: (r<=a_cap)
states: 21,228,321,804 (10)
abstracting: (da_a<=23)
states: 42,040,402,004 (10)
abstracting: (58<=mr_cap)
states: 17,898,388,972 (10)
abstracting: (dr_a<=13)
states: 42,040,402,004 (10)
.abstracting: (da_a<=a_cap)
states: 41,832,281,202 (10)
abstracting: (50<=ma_cap)
states: 21,228,321,804 (10)
abstracting: (dr_a<=13)
states: 42,040,402,004 (10)
.abstracting: (da_a<=a_cap)
states: 41,832,281,202 (10)
abstracting: (50<=ma_cap)
states: 21,228,321,804 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (23<=dr_a)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.161sec
checking: E [[[~ [[[[[ma<=39 | r_cap<=da] | EF [mr_cap<=da]] | a<=83] & [[[75<=r_cap & 55<=a] | [da<=78 | 86<=r_cap]] | EF [a<=41]]]] & [ma_cap<=1 & E [AG [r<=96] U EF [24<=ma_cap]]]] & E [c<=c U ~ [EF [[65<=ma | 86<=da_a]]]]] U ~ [AG [[EF [a<=33] | ~ [[r_cap<=mr_cap & 59<=c_cap]]]]]]
normalized: E [[E [c<=c U ~ [E [true U [65<=ma | 86<=da_a]]]] & [[ma_cap<=1 & E [~ [E [true U ~ [r<=96]]] U E [true U 24<=ma_cap]]] & ~ [[[E [true U a<=41] | [[da<=78 | 86<=r_cap] | [75<=r_cap & 55<=a]]] & [a<=83 | [E [true U mr_cap<=da] | [ma<=39 | r_cap<=da]]]]]]] U E [true U ~ [[~ [[r_cap<=mr_cap & 59<=c_cap]] | E [true U a<=33]]]]]
abstracting: (a<=33)
states: 14,152,214,536 (10)
abstracting: (59<=c_cap)
states: 17,482,147,368 (10)
abstracting: (r_cap<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (r_cap<=da)
states: 624,362,406 (8)
abstracting: (ma<=39)
states: 16,649,664,160 (10)
abstracting: (mr_cap<=da)
states: 624,362,406 (8)
abstracting: (a<=83)
states: 34,964,294,736 (10)
abstracting: (55<=a)
states: 19,147,113,784 (10)
abstracting: (75<=r_cap)
states: 10,822,281,704 (10)
abstracting: (86<=r_cap)
states: 6,243,624,060 (9)
abstracting: (da<=78)
states: 42,040,402,004 (10)
abstracting: (a<=41)
states: 17,482,147,368 (10)
abstracting: (24<=ma_cap)
states: 32,050,603,508 (10)
abstracting: (r<=96)
states: 40,375,435,588 (10)
abstracting: (ma_cap<=1)
states: 832,483,208 (8)
abstracting: (86<=da_a)
states: 0
abstracting: (65<=ma)
states: 14,984,697,744 (10)
abstracting: (c<=c)
states: 42,040,402,004 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.291sec
checking: E [[~ [EG [[[EX [26<=ma] & ~ [48<=da]] | [mr<=54 & [c<=0 & dr<=r_cap]]]]] | [[[EF [[ma<=mr & r<=da]] & AX [4<=a_cap]] & EG [c<=dr]] | A [[EG [mr_cap<=mr_cap] | ~ [AX [36<=da_a]]] U ~ [r_cap<=42]]]] U ~ [[EG [A [[ma<=dr_a & 47<=dr] U 35<=da]] | EF [[[[68<=c & dr_a<=26] | E [da_a<=63 U dr_a<=49]] | [~ [49<=da] | ~ [dr_a<=40]]]]]]]
normalized: E [[[[~ [EG [r_cap<=42]] & ~ [E [r_cap<=42 U [r_cap<=42 & ~ [[EX [~ [36<=da_a]] | EG [mr_cap<=mr_cap]]]]]]] | [EG [c<=dr] & [~ [EX [~ [4<=a_cap]]] & E [true U [ma<=mr & r<=da]]]]] | ~ [EG [[[mr<=54 & [c<=0 & dr<=r_cap]] | [~ [48<=da] & EX [26<=ma]]]]]] U ~ [[E [true U [[~ [dr_a<=40] | ~ [49<=da]] | [E [da_a<=63 U dr_a<=49] | [68<=c & dr_a<=26]]]] | EG [[~ [EG [~ [35<=da]]] & ~ [E [~ [35<=da] U [~ [[ma<=dr_a & 47<=dr]] & ~ [35<=da]]]]]]]]]
abstracting: (35<=da)
states: 0
abstracting: (47<=dr)
states: 0
abstracting: (ma<=dr_a)
states: 624,362,406 (8)
abstracting: (35<=da)
states: 0
abstracting: (35<=da)
states: 0
EG iterations: 0
.
EG iterations: 1
abstracting: (dr_a<=26)
states: 42,040,402,004 (10)
abstracting: (68<=c)
states: 13,735,972,932 (10)
abstracting: (dr_a<=49)
states: 42,040,402,004 (10)
abstracting: (da_a<=63)
states: 42,040,402,004 (10)
abstracting: (49<=da)
states: 0
abstracting: (dr_a<=40)
states: 42,040,402,004 (10)
abstracting: (26<=ma)
states: 31,218,120,300 (10)
.abstracting: (48<=da)
states: 0
abstracting: (dr<=r_cap)
states: 41,832,281,202 (10)
abstracting: (c<=0)
states: 416,241,604 (8)
abstracting: (mr<=54)
states: 22,893,288,220 (10)
.
EG iterations: 1
abstracting: (r<=da)
states: 624,362,406 (8)
abstracting: (ma<=mr)
states: 21,228,321,804 (10)
abstracting: (4<=a_cap)
states: 40,375,435,588 (10)
.abstracting: (c<=dr)
states: 624,362,406 (8)
.
EG iterations: 1
abstracting: (mr_cap<=mr_cap)
states: 42,040,402,004 (10)
EG iterations: 0
abstracting: (36<=da_a)
states: 0
.abstracting: (r_cap<=42)
states: 17,898,388,972 (10)
abstracting: (r_cap<=42)
states: 17,898,388,972 (10)
abstracting: (r_cap<=42)
states: 17,898,388,972 (10)
.
EG iterations: 1
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.959sec
totally nodes used: 1338367 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8550476 3820500 12370976
used/not used/entry size/cache size: 4869560 62239304 16 1024MB
basic ops cache: hits/miss/sum: 2406971 1727665 4134636
used/not used/entry size/cache size: 2379037 14398179 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: 124500 96781 221281
used/not used/entry size/cache size: 96321 8292287 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 65854677
1 1224545
2 28691
3 362
4 97
5 7
6 3
7 5
8 89
9 4
>= 10 384
Total processing time: 0m10.140sec
BK_STOP 1678266371447
--------------------
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:8528 (533), effective:1503 (93)
initing FirstDep: 0m 0.000sec
iterations count:1516 (94), effective:400 (25)
iterations count:16 (1), effective:0 (0)
iterations count:60 (3), effective:44 (2)
iterations count:263 (16), effective:73 (4)
iterations count:42 (2), effective:5 (0)
iterations count:514 (32), effective:199 (12)
iterations count:396 (24), effective:63 (3)
iterations count:16 (1), effective:0 (0)
iterations count:56 (3), effective:40 (2)
iterations count:16 (1), effective:0 (0)
iterations count:376 (23), effective:144 (9)
iterations count:79 (4), effective:63 (3)
iterations count:980 (61), effective:171 (10)
iterations count:1800 (112), effective:495 (30)
iterations count:4931 (308), effective:833 (52)
iterations count:18 (1), effective:1 (0)
iterations count:766 (47), effective:287 (17)
iterations count:4931 (308), effective:833 (52)
iterations count:4931 (308), effective:833 (52)
iterations count:188 (11), effective:86 (5)
iterations count:628 (39), effective:103 (6)
iterations count:1247 (77), effective:226 (14)
iterations count:196 (12), effective:31 (1)
iterations count:44 (2), effective:6 (0)
iterations count:16 (1), effective:0 (0)
iterations count:652 (40), effective:107 (6)
iterations count:220 (13), effective:68 (4)
iterations count:516 (32), effective:200 (12)
iterations count:196 (12), effective:60 (3)
iterations count:112 (7), effective:24 (1)
iterations count:1762 (110), effective:291 (18)
iterations count:16 (1), effective:0 (0)
iterations count:991 (61), effective:260 (16)
iterations count:16 (1), effective:0 (0)
iterations count:16 (1), effective:0 (0)
iterations count:16 (1), effective:0 (0)
iterations count:725 (45), effective:302 (18)
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-000100"
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-000100, 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-167814393000113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircadianClock-PT-000100.tgz
mv CircadianClock-PT-000100 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 '
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 ;