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 |
5848.056 | 17378.00 | 17089.00 | 0.00 | FTTFFFFTFFFTTTFF | 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-167814393000118.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065-smll-167814393000118
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-01
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-02
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-03
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-04
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-05
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-06
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-07
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-08
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-09
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-10
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-11
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-12
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-13
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-14
FORMULA_NAME CircadianClock-PT-000100-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678266404209
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircadianClock-PT-000100
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.732sec
RS generation: 0m 0.048sec
-> reachability set: #nodes 516 (5.2e+02) #states 42,040,402,004 (10)
starting MCC model checker
--------------------------
checking: AG [da_a<=16]
normalized: ~ [E [true U ~ [da_a<=16]]]
abstracting: (da_a<=16)
states: 42,040,402,004 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [76<=da_a]
normalized: E [true U 76<=da_a]
abstracting: (76<=da_a)
states: 0
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [da_a<=24]
normalized: ~ [E [true U ~ [da_a<=24]]]
abstracting: (da_a<=24)
states: 42,040,402,004 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [53<=r]
normalized: E [true U 53<=r]
abstracting: (53<=r)
states: 19,979,596,992 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.060sec
checking: AG [21<=r_cap]
normalized: ~ [E [true U ~ [21<=r_cap]]]
abstracting: (21<=r_cap)
states: 33,299,328,320 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
checking: AG [~ [mr_cap<=37]]
normalized: ~ [E [true U mr_cap<=37]]
abstracting: (mr_cap<=37)
states: 15,817,180,952 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: AG [mr<=ma_cap]
normalized: ~ [E [true U ~ [mr<=ma_cap]]]
abstracting: (mr<=ma_cap)
states: 21,228,321,804 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.954sec
checking: AG [~ [[r<=c & ~ [[~ [[[[[mr<=c_cap | a_cap<=mr] & 95<=r] & [a<=14 & [dr<=da_a | 15<=a]]] & ~ [a<=mr]]] & 61<=a_cap]]]]]
normalized: ~ [E [true U [r<=c & ~ [[61<=a_cap & ~ [[~ [a<=mr] & [[a<=14 & [dr<=da_a | 15<=a]] & [95<=r & [mr<=c_cap | a_cap<=mr]]]]]]]]]]
abstracting: (a_cap<=mr)
states: 21,228,321,804 (10)
abstracting: (mr<=c_cap)
states: 21,228,321,804 (10)
abstracting: (95<=r)
states: 2,497,449,624 (9)
abstracting: (15<=a)
states: 35,796,777,944 (10)
abstracting: (dr<=da_a)
states: 31,530,301,503 (10)
abstracting: (a<=14)
states: 6,243,624,060 (9)
abstracting: (a<=mr)
states: 21,228,321,804 (10)
abstracting: (61<=a_cap)
states: 16,649,664,160 (10)
abstracting: (r<=c)
states: 21,228,321,804 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.861sec
checking: AG [[~ [[[[[80<=r & dr<=dr_a] | ~ [[mr_cap<=73 | 18<=dr_a]]] | 88<=a_cap] & [~ [[[[da<=63 | da<=13] & [72<=a_cap & 100<=dr]] & ~ [mr<=da_a]]] & ~ [[[[c_cap<=84 | [dr<=mr_cap | mr_cap<=80]] | [~ [da<=dr_a] & c<=86]] | 2<=dr]]]]] | 69<=a]]
normalized: ~ [E [true U ~ [[69<=a | ~ [[[~ [[2<=dr | [[c<=86 & ~ [da<=dr_a]] | [c_cap<=84 | [dr<=mr_cap | mr_cap<=80]]]]] & ~ [[~ [mr<=da_a] & [[72<=a_cap & 100<=dr] & [da<=63 | da<=13]]]]] & [88<=a_cap | [~ [[mr_cap<=73 | 18<=dr_a]] | [80<=r & dr<=dr_a]]]]]]]]]
abstracting: (dr<=dr_a)
states: 21,020,201,002 (10)
abstracting: (80<=r)
states: 8,741,073,684 (9)
abstracting: (18<=dr_a)
states: 0
abstracting: (mr_cap<=73)
states: 30,801,878,696 (10)
abstracting: (88<=a_cap)
states: 5,411,140,852 (9)
abstracting: (da<=13)
states: 42,040,402,004 (10)
abstracting: (da<=63)
states: 42,040,402,004 (10)
abstracting: (100<=dr)
states: 0
abstracting: (72<=a_cap)
states: 12,071,006,516 (10)
abstracting: (mr<=da_a)
states: 624,362,406 (8)
abstracting: (mr_cap<=80)
states: 33,715,569,924 (10)
abstracting: (dr<=mr_cap)
states: 41,832,281,202 (10)
abstracting: (c_cap<=84)
states: 35,380,536,340 (10)
abstracting: (da<=dr_a)
states: 31,530,301,503 (10)
abstracting: (c<=86)
states: 36,213,019,548 (10)
abstracting: (2<=dr)
states: 0
abstracting: (69<=a)
states: 13,319,731,328 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AG [~ [[da<=47 & [[~ [r<=r_cap] & [[mr_cap<=8 & [[~ [ma<=14] | [c_cap<=18 & dr_a<=56]] & ~ [mr<=c]]] & ma<=a]] & [[22<=ma_cap & dr_a<=da_a] | [[~ [7<=r] | da_a<=a] | [~ [62<=c_cap] & ~ [[65<=da_a & [dr<=ma | dr<=mr]]]]]]]]]]
normalized: ~ [E [true U [da<=47 & [[[[~ [[65<=da_a & [dr<=ma | dr<=mr]]] & ~ [62<=c_cap]] | [da_a<=a | ~ [7<=r]]] | [22<=ma_cap & dr_a<=da_a]] & [[ma<=a & [mr_cap<=8 & [~ [mr<=c] & [[c_cap<=18 & dr_a<=56] | ~ [ma<=14]]]]] & ~ [r<=r_cap]]]]]]
abstracting: (r<=r_cap)
states: 21,228,321,804 (10)
abstracting: (ma<=14)
states: 6,243,624,060 (9)
abstracting: (dr_a<=56)
states: 42,040,402,004 (10)
abstracting: (c_cap<=18)
states: 7,908,590,476 (9)
abstracting: (mr<=c)
states: 21,228,321,804 (10)
abstracting: (mr_cap<=8)
states: 3,746,174,436 (9)
abstracting: (ma<=a)
states: 21,228,321,804 (10)
abstracting: (dr_a<=da_a)
states: 31,530,301,503 (10)
abstracting: (22<=ma_cap)
states: 32,883,086,716 (10)
abstracting: (7<=r)
states: 39,126,710,776 (10)
abstracting: (da_a<=a)
states: 41,832,281,202 (10)
abstracting: (62<=c_cap)
states: 16,233,422,556 (10)
abstracting: (dr<=mr)
states: 41,832,281,202 (10)
abstracting: (dr<=ma)
states: 41,832,281,202 (10)
abstracting: (65<=da_a)
states: 0
abstracting: (da<=47)
states: 42,040,402,004 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.666sec
checking: EF [[[~ [87<=mr_cap] | [~ [[[~ [[11<=a & ma_cap<=1]] & da<=r] & [[[~ [12<=mr_cap] | [c<=50 & 100<=dr]] | [~ [da<=mr_cap] & 76<=mr]] & [[~ [dr_a<=81] | ~ [c_cap<=49]] | mr<=ma]]]] & ~ [[3<=r_cap | ~ [[~ [11<=a] & ~ [[85<=c & 57<=da]]]]]]]] & ~ [[[r<=r & c_cap<=mr] | 65<=r_cap]]]]
normalized: E [true U [~ [[65<=r_cap | [r<=r & c_cap<=mr]]] & [[~ [[3<=r_cap | ~ [[~ [[85<=c & 57<=da]] & ~ [11<=a]]]]] & ~ [[[[mr<=ma | [~ [c_cap<=49] | ~ [dr_a<=81]]] & [[76<=mr & ~ [da<=mr_cap]] | [[c<=50 & 100<=dr] | ~ [12<=mr_cap]]]] & [da<=r & ~ [[11<=a & ma_cap<=1]]]]]] | ~ [87<=mr_cap]]]]
abstracting: (87<=mr_cap)
states: 5,827,382,456 (9)
abstracting: (ma_cap<=1)
states: 832,483,208 (8)
abstracting: (11<=a)
states: 37,461,744,360 (10)
abstracting: (da<=r)
states: 41,832,281,202 (10)
abstracting: (12<=mr_cap)
states: 37,045,502,756 (10)
abstracting: (100<=dr)
states: 0
abstracting: (c<=50)
states: 21,228,321,804 (10)
abstracting: (da<=mr_cap)
states: 41,832,281,202 (10)
abstracting: (76<=mr)
states: 10,406,040,100 (10)
abstracting: (dr_a<=81)
states: 42,040,402,004 (10)
abstracting: (c_cap<=49)
states: 20,812,080,200 (10)
abstracting: (mr<=ma)
states: 21,228,321,804 (10)
abstracting: (11<=a)
states: 37,461,744,360 (10)
abstracting: (57<=da)
states: 0
abstracting: (85<=c)
states: 6,659,865,664 (9)
abstracting: (3<=r_cap)
states: 40,791,677,192 (10)
abstracting: (c_cap<=mr)
states: 21,228,321,804 (10)
abstracting: (r<=r)
states: 42,040,402,004 (10)
abstracting: (65<=r_cap)
states: 14,984,697,744 (10)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.328sec
checking: AG [[~ [[[~ [[3<=ma | [mr<=a_cap & [25<=c_cap | 7<=mr]]]] & [~ [[[~ [r<=da_a] | mr<=70] | 21<=mr_cap]] | ~ [[~ [[63<=dr_a & da<=ma]] | [~ [mr<=11] | ~ [ma_cap<=c]]]]]] & [~ [mr<=da_a] | [mr_cap<=43 & [[~ [a<=a_cap] & ~ [[41<=mr_cap | 75<=c_cap]]] | r<=52]]]]] & [~ [[[23<=da_a & c_cap<=r_cap] | [[mr_cap<=mr & [~ [80<=r] | c<=57]] | ~ [[da_a<=c_cap & [[100<=ma & dr<=dr] | a<=30]]]]]] | ~ [da<=ma]]]]
normalized: ~ [E [true U ~ [[[~ [da<=ma] | ~ [[[~ [[da_a<=c_cap & [a<=30 | [100<=ma & dr<=dr]]]] | [mr_cap<=mr & [c<=57 | ~ [80<=r]]]] | [23<=da_a & c_cap<=r_cap]]]] & ~ [[[[mr_cap<=43 & [r<=52 | [~ [[41<=mr_cap | 75<=c_cap]] & ~ [a<=a_cap]]]] | ~ [mr<=da_a]] & [[~ [[[~ [ma_cap<=c] | ~ [mr<=11]] | ~ [[63<=dr_a & da<=ma]]]] | ~ [[21<=mr_cap | [mr<=70 | ~ [r<=da_a]]]]] & ~ [[3<=ma | [mr<=a_cap & [25<=c_cap | 7<=mr]]]]]]]]]]]
abstracting: (7<=mr)
states: 39,126,710,776 (10)
abstracting: (25<=c_cap)
states: 31,634,361,904 (10)
abstracting: (mr<=a_cap)
states: 21,228,321,804 (10)
abstracting: (3<=ma)
states: 40,791,677,192 (10)
abstracting: (r<=da_a)
states: 624,362,406 (8)
abstracting: (mr<=70)
states: 29,553,153,884 (10)
abstracting: (21<=mr_cap)
states: 33,299,328,320 (10)
abstracting: (da<=ma)
states: 41,832,281,202 (10)
abstracting: (63<=dr_a)
states: 0
abstracting: (mr<=11)
states: 4,994,899,248 (9)
abstracting: (ma_cap<=c)
states: 21,228,321,804 (10)
abstracting: (mr<=da_a)
states: 624,362,406 (8)
abstracting: (a<=a_cap)
states: 21,228,321,804 (10)
abstracting: (75<=c_cap)
states: 10,822,281,704 (10)
abstracting: (41<=mr_cap)
states: 24,974,496,240 (10)
abstracting: (r<=52)
states: 22,060,805,012 (10)
abstracting: (mr_cap<=43)
states: 18,314,630,576 (10)
abstracting: (c_cap<=r_cap)
states: 21,228,321,804 (10)
abstracting: (23<=da_a)
states: 0
abstracting: (80<=r)
states: 8,741,073,684 (9)
abstracting: (c<=57)
states: 24,142,013,032 (10)
abstracting: (mr_cap<=mr)
states: 21,228,321,804 (10)
abstracting: (dr<=dr)
states: 42,040,402,004 (10)
abstracting: (100<=ma)
states: 416,241,604 (8)
abstracting: (a<=30)
states: 12,903,489,724 (10)
abstracting: (da_a<=c_cap)
states: 41,832,281,202 (10)
abstracting: (da<=ma)
states: 41,832,281,202 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.293sec
checking: AG [[c<=75 | [[[[[~ [25<=a] & ~ [[c<=ma | ma_cap<=a_cap]]] & 8<=r] | [[[~ [mr<=1] | ~ [[a<=mr_cap | c_cap<=42]]] & ~ [[da_a<=a & ma<=dr_a]]] | 87<=dr_a]] | [[~ [[[[65<=ma | mr<=mr_cap] | [ma_cap<=mr_cap & 7<=r]] | [[da_a<=dr_a | 59<=dr_a] | [mr_cap<=0 | a<=36]]]] & ~ [[[r_cap<=r_cap & c_cap<=da] | [17<=mr_cap & ma_cap<=a_cap]]]] & [90<=ma_cap | ~ [[12<=dr | dr<=43]]]]] & ~ [28<=dr]]]]
normalized: ~ [E [true U ~ [[c<=75 | [~ [28<=dr] & [[[90<=ma_cap | ~ [[12<=dr | dr<=43]]] & [~ [[[17<=mr_cap & ma_cap<=a_cap] | [r_cap<=r_cap & c_cap<=da]]] & ~ [[[[mr_cap<=0 | a<=36] | [da_a<=dr_a | 59<=dr_a]] | [[ma_cap<=mr_cap & 7<=r] | [65<=ma | mr<=mr_cap]]]]]] | [[87<=dr_a | [~ [[da_a<=a & ma<=dr_a]] & [~ [[a<=mr_cap | c_cap<=42]] | ~ [mr<=1]]]] | [8<=r & [~ [[c<=ma | ma_cap<=a_cap]] & ~ [25<=a]]]]]]]]]]
abstracting: (25<=a)
states: 31,634,361,904 (10)
abstracting: (ma_cap<=a_cap)
states: 21,228,321,804 (10)
abstracting: (c<=ma)
states: 21,228,321,804 (10)
abstracting: (8<=r)
states: 38,710,469,172 (10)
abstracting: (mr<=1)
states: 832,483,208 (8)
abstracting: (c_cap<=42)
states: 17,898,388,972 (10)
abstracting: (a<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (ma<=dr_a)
states: 624,362,406 (8)
abstracting: (da_a<=a)
states: 41,832,281,202 (10)
abstracting: (87<=dr_a)
states: 0
abstracting: (mr<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (65<=ma)
states: 14,984,697,744 (10)
abstracting: (7<=r)
states: 39,126,710,776 (10)
abstracting: (ma_cap<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (59<=dr_a)
states: 0
abstracting: (da_a<=dr_a)
states: 31,530,301,503 (10)
abstracting: (a<=36)
states: 15,400,939,348 (10)
abstracting: (mr_cap<=0)
states: 416,241,604 (8)
abstracting: (c_cap<=da)
states: 624,362,406 (8)
abstracting: (r_cap<=r_cap)
states: 42,040,402,004 (10)
abstracting: (ma_cap<=a_cap)
states: 21,228,321,804 (10)
abstracting: (17<=mr_cap)
states: 34,964,294,736 (10)
abstracting: (dr<=43)
states: 42,040,402,004 (10)
abstracting: (12<=dr)
states: 0
abstracting: (90<=ma_cap)
states: 4,578,657,644 (9)
abstracting: (28<=dr)
states: 0
abstracting: (c<=75)
states: 31,634,361,904 (10)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.399sec
checking: EF [[~ [[~ [[[~ [r_cap<=mr_cap] | [mr_cap<=22 | 47<=a_cap]] & 52<=da]] | [[[[[[mr_cap<=42 & a_cap<=mr] & ~ [mr<=54]] & [ma_cap<=dr | dr_a<=43]] | [dr<=70 | [~ [30<=mr_cap] & [da_a<=r_cap | 70<=mr_cap]]]] & c_cap<=da_a] | 64<=c]]] & [82<=mr_cap & [[[[mr<=14 | [[ma<=da | ~ [ma_cap<=62]] & [~ [mr_cap<=43] | [ma_cap<=da | r<=3]]]] | [[[[58<=r | 89<=r_cap] | ~ [ma<=22]] & [~ [da<=r] | [81<=da & da<=7]]] & [[[mr_cap<=a_cap & 68<=a_cap] & ma_cap<=a_cap] | [a_cap<=dr | ~ [86<=r]]]]] & ~ [[[[dr<=dr | ma_cap<=20] | ~ [ma_cap<=72]] & ~ [[dr_a<=dr & mr_cap<=68]]]]] | da_a<=3]]]]
normalized: E [true U [[82<=mr_cap & [da_a<=3 | [~ [[[[dr<=dr | ma_cap<=20] | ~ [ma_cap<=72]] & ~ [[dr_a<=dr & mr_cap<=68]]]] & [[[[ma_cap<=a_cap & [mr_cap<=a_cap & 68<=a_cap]] | [a_cap<=dr | ~ [86<=r]]] & [[[81<=da & da<=7] | ~ [da<=r]] & [~ [ma<=22] | [58<=r | 89<=r_cap]]]] | [mr<=14 | [[[ma_cap<=da | r<=3] | ~ [mr_cap<=43]] & [ma<=da | ~ [ma_cap<=62]]]]]]]] & ~ [[[64<=c | [c_cap<=da_a & [[dr<=70 | [[da_a<=r_cap | 70<=mr_cap] & ~ [30<=mr_cap]]] | [[ma_cap<=dr | dr_a<=43] & [~ [mr<=54] & [mr_cap<=42 & a_cap<=mr]]]]]] | ~ [[52<=da & [[mr_cap<=22 | 47<=a_cap] | ~ [r_cap<=mr_cap]]]]]]]]
abstracting: (r_cap<=mr_cap)
states: 21,228,321,804 (10)
abstracting: (47<=a_cap)
states: 22,477,046,616 (10)
abstracting: (mr_cap<=22)
states: 9,573,556,892 (9)
abstracting: (52<=da)
states: 0
abstracting: (a_cap<=mr)
states: 21,228,321,804 (10)
abstracting: (mr_cap<=42)
states: 17,898,388,972 (10)
abstracting: (mr<=54)
states: 22,893,288,220 (10)
abstracting: (dr_a<=43)
states: 42,040,402,004 (10)
abstracting: (ma_cap<=dr)
states: 624,362,406 (8)
abstracting: (30<=mr_cap)
states: 29,553,153,884 (10)
abstracting: (70<=mr_cap)
states: 12,903,489,724 (10)
abstracting: (da_a<=r_cap)
states: 41,832,281,202 (10)
abstracting: (dr<=70)
states: 42,040,402,004 (10)
abstracting: (c_cap<=da_a)
states: 624,362,406 (8)
abstracting: (64<=c)
states: 15,400,939,348 (10)
abstracting: (ma_cap<=62)
states: 26,223,221,052 (10)
abstracting: (ma<=da)
states: 624,362,406 (8)
abstracting: (mr_cap<=43)
states: 18,314,630,576 (10)
abstracting: (r<=3)
states: 1,664,966,416 (9)
abstracting: (ma_cap<=da)
states: 624,362,406 (8)
abstracting: (mr<=14)
states: 6,243,624,060 (9)
abstracting: (89<=r_cap)
states: 4,994,899,248 (9)
abstracting: (58<=r)
states: 17,898,388,972 (10)
abstracting: (ma<=22)
states: 9,573,556,892 (9)
abstracting: (da<=r)
states: 41,832,281,202 (10)
abstracting: (da<=7)
states: 42,040,402,004 (10)
abstracting: (81<=da)
states: 0
abstracting: (86<=r)
states: 6,243,624,060 (9)
abstracting: (a_cap<=dr)
states: 624,362,406 (8)
abstracting: (68<=a_cap)
states: 13,735,972,932 (10)
abstracting: (mr_cap<=a_cap)
states: 21,228,321,804 (10)
abstracting: (ma_cap<=a_cap)
states: 21,228,321,804 (10)
abstracting: (mr_cap<=68)
states: 28,720,670,676 (10)
abstracting: (dr_a<=dr)
states: 21,020,201,002 (10)
abstracting: (ma_cap<=72)
states: 30,385,637,092 (10)
abstracting: (ma_cap<=20)
states: 8,741,073,684 (9)
abstracting: (dr<=dr)
states: 42,040,402,004 (10)
abstracting: (da_a<=3)
states: 42,040,402,004 (10)
abstracting: (82<=mr_cap)
states: 7,908,590,476 (9)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.103sec
checking: AG [[[~ [a_cap<=da_a] | [[~ [[66<=r & [88<=da & [~ [ma<=mr] & 36<=dr_a]]]] | ~ [[[~ [dr<=91] & ~ [c<=ma]] & da<=da_a]]] | a<=a_cap]] & [~ [[dr_a<=r & ~ [[[[~ [62<=mr_cap] & [da<=c_cap & r<=r]] | ~ [[ma_cap<=6 & mr<=r_cap]]] | [[~ [49<=ma_cap] | [dr_a<=51 & dr<=mr_cap]] | ~ [[86<=a_cap & r<=10]]]]]]] & [[mr_cap<=11 & [[[mr<=56 | [da_a<=41 | [94<=dr_a | 96<=dr_a]]] | [[~ [r<=dr] | 58<=dr_a] | a_cap<=81]] & [[~ [ma_cap<=80] & [[ma<=20 & r<=16] & [r_cap<=38 | a<=10]]] | r<=27]]] | ~ [[[[[c<=49 | c<=dr_a] & r_cap<=73] | mr_cap<=30] & [~ [[r<=c_cap & dr<=da_a]] | [[mr<=52 | dr_a<=mr] | [97<=r & ma_cap<=42]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [[[[[97<=r & ma_cap<=42] | [mr<=52 | dr_a<=mr]] | ~ [[r<=c_cap & dr<=da_a]]] & [mr_cap<=30 | [r_cap<=73 & [c<=49 | c<=dr_a]]]]] | [mr_cap<=11 & [[r<=27 | [[[r_cap<=38 | a<=10] & [ma<=20 & r<=16]] & ~ [ma_cap<=80]]] & [[a_cap<=81 | [58<=dr_a | ~ [r<=dr]]] | [mr<=56 | [da_a<=41 | [94<=dr_a | 96<=dr_a]]]]]]] & ~ [[dr_a<=r & ~ [[[~ [[86<=a_cap & r<=10]] | [[dr_a<=51 & dr<=mr_cap] | ~ [49<=ma_cap]]] | [~ [[ma_cap<=6 & mr<=r_cap]] | [[da<=c_cap & r<=r] & ~ [62<=mr_cap]]]]]]]] & [[a<=a_cap | [~ [[da<=da_a & [~ [c<=ma] & ~ [dr<=91]]]] | ~ [[66<=r & [88<=da & [36<=dr_a & ~ [ma<=mr]]]]]]] | ~ [a_cap<=da_a]]]]]]
abstracting: (a_cap<=da_a)
states: 624,362,406 (8)
abstracting: (ma<=mr)
states: 21,228,321,804 (10)
abstracting: (36<=dr_a)
states: 0
abstracting: (88<=da)
states: 0
abstracting: (66<=r)
states: 14,568,456,140 (10)
abstracting: (dr<=91)
states: 42,040,402,004 (10)
abstracting: (c<=ma)
states: 21,228,321,804 (10)
abstracting: (da<=da_a)
states: 21,020,201,002 (10)
abstracting: (a<=a_cap)
states: 21,228,321,804 (10)
abstracting: (62<=mr_cap)
states: 16,233,422,556 (10)
abstracting: (r<=r)
states: 42,040,402,004 (10)
abstracting: (da<=c_cap)
states: 41,832,281,202 (10)
abstracting: (mr<=r_cap)
states: 21,228,321,804 (10)
abstracting: (ma_cap<=6)
states: 2,913,691,228 (9)
abstracting: (49<=ma_cap)
states: 21,644,563,408 (10)
abstracting: (dr<=mr_cap)
states: 41,832,281,202 (10)
abstracting: (dr_a<=51)
states: 42,040,402,004 (10)
abstracting: (r<=10)
states: 4,578,657,644 (9)
abstracting: (86<=a_cap)
states: 6,243,624,060 (9)
abstracting: (dr_a<=r)
states: 41,832,281,202 (10)
abstracting: (96<=dr_a)
states: 0
abstracting: (94<=dr_a)
states: 0
abstracting: (da_a<=41)
states: 42,040,402,004 (10)
abstracting: (mr<=56)
states: 23,725,771,428 (10)
abstracting: (r<=dr)
states: 624,362,406 (8)
abstracting: (58<=dr_a)
states: 0
abstracting: (a_cap<=81)
states: 34,131,811,528 (10)
abstracting: (ma_cap<=80)
states: 33,715,569,924 (10)
abstracting: (r<=16)
states: 7,076,107,268 (9)
abstracting: (ma<=20)
states: 8,741,073,684 (9)
abstracting: (a<=10)
states: 4,578,657,644 (9)
abstracting: (r_cap<=38)
states: 16,233,422,556 (10)
abstracting: (r<=27)
states: 11,654,764,912 (10)
abstracting: (mr_cap<=11)
states: 4,994,899,248 (9)
abstracting: (c<=dr_a)
states: 624,362,406 (8)
abstracting: (c<=49)
states: 20,812,080,200 (10)
abstracting: (r_cap<=73)
states: 30,801,878,696 (10)
abstracting: (mr_cap<=30)
states: 12,903,489,724 (10)
abstracting: (dr<=da_a)
states: 31,530,301,503 (10)
abstracting: (r<=c_cap)
states: 21,228,321,804 (10)
abstracting: (dr_a<=mr)
states: 41,832,281,202 (10)
abstracting: (mr<=52)
states: 22,060,805,012 (10)
abstracting: (ma_cap<=42)
states: 17,898,388,972 (10)
abstracting: (97<=r)
states: 1,664,966,416 (9)
-> the formula is FALSE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.192sec
checking: EF [[[a_cap<=dr | [[ma_cap<=3 | a_cap<=r_cap] & [[[mr<=dr | [[15<=r_cap & ~ [a_cap<=12]] | ~ [r_cap<=mr]]] & ~ [[[da_a<=21 | r_cap<=66] & ~ [r_cap<=74]]]] & [[~ [[~ [dr_a<=dr_a] | r<=43]] & [[mr_cap<=58 & [da_a<=ma & da_a<=ma]] | [~ [dr_a<=da_a] & ma<=mr]]] & [c<=62 & 100<=da_a]]]]] & [[[~ [82<=r] & [19<=dr & [19<=a_cap | ~ [[~ [mr_cap<=mr_cap] | ~ [a<=28]]]]]] | ~ [r_cap<=c_cap]] | [[~ [da<=30] & [[[[~ [c<=mr] | mr_cap<=r_cap] & [[da<=19 & mr_cap<=da_a] & [r<=c | r_cap<=ma]]] & ~ [[[c_cap<=r & 38<=ma_cap] & ~ [85<=mr]]]] | [[8<=r & [[79<=mr & r<=8] | [a_cap<=dr_a | 15<=dr]]] & ~ [20<=dr]]]] | [~ [[~ [[[da_a<=55 & ma_cap<=35] | [r<=r_cap | 22<=dr]]] & ~ [[[c<=72 & 82<=da] & [dr_a<=5 & dr<=da]]]]] & ma<=dr]]]]]
normalized: E [true U [[[[ma<=dr & ~ [[~ [[[dr_a<=5 & dr<=da] & [c<=72 & 82<=da]]] & ~ [[[r<=r_cap | 22<=dr] | [da_a<=55 & ma_cap<=35]]]]]] | [[[~ [20<=dr] & [8<=r & [[a_cap<=dr_a | 15<=dr] | [79<=mr & r<=8]]]] | [~ [[~ [85<=mr] & [c_cap<=r & 38<=ma_cap]]] & [[[r<=c | r_cap<=ma] & [da<=19 & mr_cap<=da_a]] & [mr_cap<=r_cap | ~ [c<=mr]]]]] & ~ [da<=30]]] | [~ [r_cap<=c_cap] | [[19<=dr & [19<=a_cap | ~ [[~ [a<=28] | ~ [mr_cap<=mr_cap]]]]] & ~ [82<=r]]]] & [a_cap<=dr | [[[[c<=62 & 100<=da_a] & [[[ma<=mr & ~ [dr_a<=da_a]] | [mr_cap<=58 & [da_a<=ma & da_a<=ma]]] & ~ [[r<=43 | ~ [dr_a<=dr_a]]]]] & [~ [[~ [r_cap<=74] & [da_a<=21 | r_cap<=66]]] & [mr<=dr | [~ [r_cap<=mr] | [15<=r_cap & ~ [a_cap<=12]]]]]] & [ma_cap<=3 | a_cap<=r_cap]]]]]
abstracting: (a_cap<=r_cap)
states: 21,228,321,804 (10)
abstracting: (ma_cap<=3)
states: 1,664,966,416 (9)
abstracting: (a_cap<=12)
states: 5,411,140,852 (9)
abstracting: (15<=r_cap)
states: 35,796,777,944 (10)
abstracting: (r_cap<=mr)
states: 21,228,321,804 (10)
abstracting: (mr<=dr)
states: 624,362,406 (8)
abstracting: (r_cap<=66)
states: 27,888,187,468 (10)
abstracting: (da_a<=21)
states: 42,040,402,004 (10)
abstracting: (r_cap<=74)
states: 31,218,120,300 (10)
abstracting: (dr_a<=dr_a)
states: 42,040,402,004 (10)
abstracting: (r<=43)
states: 18,314,630,576 (10)
abstracting: (da_a<=ma)
states: 41,832,281,202 (10)
abstracting: (da_a<=ma)
states: 41,832,281,202 (10)
abstracting: (mr_cap<=58)
states: 24,558,254,636 (10)
abstracting: (dr_a<=da_a)
states: 31,530,301,503 (10)
abstracting: (ma<=mr)
states: 21,228,321,804 (10)
abstracting: (100<=da_a)
states: 0
abstracting: (c<=62)
states: 26,223,221,052 (10)
abstracting: (a_cap<=dr)
states: 624,362,406 (8)
abstracting: (82<=r)
states: 7,908,590,476 (9)
abstracting: (mr_cap<=mr_cap)
states: 42,040,402,004 (10)
abstracting: (a<=28)
states: 12,071,006,516 (10)
abstracting: (19<=a_cap)
states: 34,131,811,528 (10)
abstracting: (19<=dr)
states: 0
abstracting: (r_cap<=c_cap)
states: 21,228,321,804 (10)
abstracting: (da<=30)
states: 42,040,402,004 (10)
abstracting: (c<=mr)
states: 21,228,321,804 (10)
abstracting: (mr_cap<=r_cap)
states: 21,228,321,804 (10)
abstracting: (mr_cap<=da_a)
states: 624,362,406 (8)
abstracting: (da<=19)
states: 42,040,402,004 (10)
abstracting: (r_cap<=ma)
states: 21,228,321,804 (10)
abstracting: (r<=c)
states: 21,228,321,804 (10)
abstracting: (38<=ma_cap)
states: 26,223,221,052 (10)
abstracting: (c_cap<=r)
states: 21,228,321,804 (10)
abstracting: (85<=mr)
states: 6,659,865,664 (9)
abstracting: (r<=8)
states: 3,746,174,436 (9)
abstracting: (79<=mr)
states: 9,157,315,288 (9)
abstracting: (15<=dr)
states: 0
abstracting: (a_cap<=dr_a)
states: 624,362,406 (8)
abstracting: (8<=r)
states: 38,710,469,172 (10)
abstracting: (20<=dr)
states: 0
abstracting: (ma_cap<=35)
states: 14,984,697,744 (10)
abstracting: (da_a<=55)
states: 42,040,402,004 (10)
abstracting: (22<=dr)
states: 0
abstracting: (r<=r_cap)
states: 21,228,321,804 (10)
abstracting: (82<=da)
states: 0
abstracting: (c<=72)
states: 30,385,637,092 (10)
abstracting: (dr<=da)
states: 31,530,301,503 (10)
abstracting: (dr_a<=5)
states: 42,040,402,004 (10)
abstracting: (ma<=dr)
states: 624,362,406 (8)
-> the formula is TRUE
FORMULA CircadianClock-PT-000100-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.928sec
totally nodes used: 2996211 (3.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 21509819 3841986 25351805
used/not used/entry size/cache size: 5247340 61861524 16 1024MB
basic ops cache: hits/miss/sum: 12276374 6276685 18553059
used/not used/entry size/cache size: 7365692 9411524 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: 143678 109753 253431
used/not used/entry size/cache size: 109065 8279543 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 64251486
1 2796324
2 59262
3 994
4 37
5 68
6 2
7 11
8 51
9 27
>= 10 602
Total processing time: 0m17.306sec
BK_STOP 1678266421587
--------------------
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:970 (60), effective:159 (9)
iterations count:1456 (91), effective:240 (15)
iterations count:331 (20), effective:126 (7)
iterations count:531 (33), effective:204 (12)
iterations count:649 (40), effective:269 (16)
iterations count:2274 (142), effective:517 (32)
iterations count:2229 (139), effective:515 (32)
iterations count:732 (45), effective:238 (14)
iterations count:3915 (244), effective:732 (45)
iterations count:378 (23), effective:152 (9)
iterations count:1127 (70), effective:253 (15)
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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167814393000118"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;