About the Execution of Marcie for Parking-PT-208
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5515.535 | 9188.00 | 9060.00 | 19.80 | FFTTFTTFTFFTFFTT | 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.r257-smll-167863532700422.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 Parking-PT-208, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r257-smll-167863532700422
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 49K 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 Parking-PT-208-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678842089424
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=Parking-PT-208
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: Parking_PT_208
(NrP: 137 NrTr: 201 NrArc: 593)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.686sec
RS generation: 0m 0.079sec
-> reachability set: #nodes 1406 (1.4e+03) #states 4,567,597,057 (9)
starting MCC model checker
--------------------------
checking: EF [~ [p55<=0]]
normalized: E [true U ~ [p55<=0]]
abstracting: (p55<=0)
states: 4,429,185,025 (9)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.697sec
checking: EF [1<=p133]
normalized: E [true U 1<=p133]
abstracting: (1<=p133)
states: 968,884,224 (8)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.114sec
checking: EF [1<=p114]
normalized: E [true U 1<=p114]
abstracting: (1<=p114)
states: 69,206,016 (7)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.163sec
checking: AG [p56<=1]
normalized: ~ [E [true U ~ [p56<=1]]]
abstracting: (p56<=1)
states: 4,567,597,057 (9)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [1<=p100]
normalized: E [true U 1<=p100]
abstracting: (1<=p100)
states: 138,412,032 (8)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.064sec
checking: AG [p50<=p133]
normalized: ~ [E [true U ~ [p50<=p133]]]
abstracting: (p50<=p133)
states: 4,458,545,153 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.260sec
checking: AG [p26<=p97]
normalized: ~ [E [true U ~ [p26<=p97]]]
abstracting: (p26<=p97)
states: 4,432,330,753 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.233sec
checking: AG [p133<=p119]
normalized: ~ [E [true U ~ [p133<=p119]]]
abstracting: (p133<=p119)
states: 3,633,315,841 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [[[[p31<=0 & 1<=p85] & p42<=p36] | p107<=p31]]
normalized: ~ [E [true U ~ [[p107<=p31 | [p42<=p36 & [p31<=0 & 1<=p85]]]]]]
abstracting: (1<=p85)
states: 2,283,798,528 (9)
abstracting: (p31<=0)
states: 4,463,788,033 (9)
abstracting: (p42<=p36)
states: 4,567,597,057 (9)
abstracting: (p107<=p31)
states: 4,499,963,905 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.384sec
checking: EF [~ [[[p12<=1 & [~ [p14<=p64] | p124<=1]] | [~ [p71<=p7] | p107<=p81]]]]
normalized: E [true U ~ [[[p107<=p81 | ~ [p71<=p7]] | [p12<=1 & [p124<=1 | ~ [p14<=p64]]]]]]
abstracting: (p14<=p64)
states: 3,806,330,881 (9)
abstracting: (p124<=1)
states: 4,567,597,057 (9)
abstracting: (p12<=1)
states: 4,567,597,057 (9)
abstracting: (p71<=p7)
states: 3,425,697,793 (9)
abstracting: (p107<=p81)
states: 4,532,994,049 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [~ [[[[[[~ [1<=p104] & ~ [[p36<=p113 & 1<=p50]]] | ~ [p53<=1]] | ~ [p62<=1]] & p44<=0] | [p69<=1 | 1<=p22]]]]
normalized: E [true U ~ [[[p69<=1 | 1<=p22] | [p44<=0 & [~ [p62<=1] | [~ [p53<=1] | [~ [[p36<=p113 & 1<=p50]] & ~ [1<=p104]]]]]]]]
abstracting: (1<=p104)
states: 103,809,024 (8)
abstracting: (1<=p50)
states: 138,412,032 (8)
abstracting: (p36<=p113)
states: 818,937,857 (8)
abstracting: (p53<=1)
states: 4,567,597,057 (9)
abstracting: (p62<=1)
states: 4,567,597,057 (9)
abstracting: (p44<=0)
states: 692,060,161 (8)
abstracting: (1<=p22)
states: 103,809,024 (8)
abstracting: (p69<=1)
states: 4,567,597,057 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: AG [[[p108<=p19 | [[~ [p44<=1] & ~ [[~ [p13<=0] & [[p42<=1 | 1<=p128] | [[1<=p62 & p13<=0] | 1<=p121]]]]] | ~ [p80<=1]]] | p130<=p85]]
normalized: ~ [E [true U ~ [[p130<=p85 | [p108<=p19 | [~ [p80<=1] | [~ [[[[1<=p121 | [1<=p62 & p13<=0]] | [p42<=1 | 1<=p128]] & ~ [p13<=0]]] & ~ [p44<=1]]]]]]]]
abstracting: (p44<=1)
states: 4,567,597,057 (9)
abstracting: (p13<=0)
states: 2,283,798,529 (9)
abstracting: (1<=p128)
states: 138,412,032 (8)
abstracting: (p42<=1)
states: 4,567,597,057 (9)
abstracting: (p13<=0)
states: 2,283,798,529 (9)
abstracting: (1<=p62)
states: 138,412,032 (8)
abstracting: (1<=p121)
states: 138,412,032 (8)
abstracting: (p80<=1)
states: 4,567,597,057 (9)
abstracting: (p108<=p19)
states: 4,498,391,041 (9)
abstracting: (p130<=p85)
states: 3,045,064,705 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.218sec
checking: AG [[~ [[[[[p133<=p93 & [[p9<=p23 | 1<=p125] & 1<=p13]] | ~ [p80<=p4]] & 1<=p51] & [[~ [[1<=p130 & ~ [p39<=0]]] & ~ [[p65<=0 | p129<=p29]]] & [[1<=p101 & [~ [p31<=p65] | [1<=p118 & p80<=p83]]] & [[[1<=p120 | p92<=p94] | ~ [p63<=1]] | [[p51<=p120 | p58<=0] & ~ [p15<=1]]]]]]] | [[p79<=p47 & [1<=p98 & p114<=p83]] & 1<=p95]]]
normalized: ~ [E [true U ~ [[[1<=p95 & [p79<=p47 & [1<=p98 & p114<=p83]]] | ~ [[[1<=p51 & [[p133<=p93 & [1<=p13 & [p9<=p23 | 1<=p125]]] | ~ [p80<=p4]]] & [[[1<=p101 & [~ [p31<=p65] | [1<=p118 & p80<=p83]]] & [[~ [p15<=1] & [p51<=p120 | p58<=0]] | [~ [p63<=1] | [1<=p120 | p92<=p94]]]] & [~ [[1<=p130 & ~ [p39<=0]]] & ~ [[p65<=0 | p129<=p29]]]]]]]]]]
abstracting: (p129<=p29)
states: 4,432,330,753 (9)
abstracting: (p65<=0)
states: 4,429,185,025 (9)
abstracting: (p39<=0)
states: 4,498,391,041 (9)
abstracting: (1<=p130)
states: 3,045,064,704 (9)
abstracting: (p92<=p94)
states: 4,429,185,025 (9)
abstracting: (1<=p120)
states: 138,412,032 (8)
abstracting: (p63<=1)
states: 4,567,597,057 (9)
abstracting: (p58<=0)
states: 4,429,185,025 (9)
abstracting: (p51<=p120)
states: 4,433,379,329 (9)
abstracting: (p15<=1)
states: 4,567,597,057 (9)
abstracting: (p80<=p83)
states: 3,425,697,793 (9)
abstracting: (1<=p118)
states: 3,875,536,896 (9)
abstracting: (p31<=p65)
states: 4,463,788,033 (9)
abstracting: (1<=p101)
states: 138,412,032 (8)
abstracting: (p80<=p4)
states: 3,425,697,793 (9)
abstracting: (1<=p125)
states: 138,412,032 (8)
abstracting: (p9<=p23)
states: 2,335,703,041 (9)
abstracting: (1<=p13)
states: 2,283,798,528 (9)
abstracting: (p133<=p93)
states: 3,633,315,841 (9)
abstracting: (1<=p51)
states: 138,412,032 (8)
abstracting: (p114<=p83)
states: 4,532,994,049 (9)
abstracting: (1<=p98)
states: 103,809,024 (8)
abstracting: (p79<=p47)
states: 2,318,401,537 (9)
abstracting: (1<=p95)
states: 103,809,024 (8)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: AG [[~ [[1<=p100 & [[p27<=0 & p69<=0] | p49<=p16]]] & [[~ [[[~ [[1<=p90 | p62<=1]] & p134<=p78] & p128<=1]] | [[p54<=0 | [[[~ [1<=p19] & ~ [p62<=1]] & [~ [p77<=p48] & 1<=p41]] | [[[p42<=1 | p2<=p40] | [p47<=0 & p65<=0]] & [[p0<=p97 & p97<=1] & [1<=p100 | p95<=p128]]]]] & [[p64<=p60 | [~ [1<=p68] & [[1<=p15 & p1<=p23] | [1<=p133 & p135<=1]]]] | ~ [[~ [p111<=p110] | [p107<=1 & [p102<=1 | p97<=1]]]]]]] | ~ [p134<=1]]]]
normalized: ~ [E [true U ~ [[[~ [p134<=1] | [[[~ [[[p107<=1 & [p102<=1 | p97<=1]] | ~ [p111<=p110]]] | [p64<=p60 | [[[1<=p133 & p135<=1] | [1<=p15 & p1<=p23]] & ~ [1<=p68]]]] & [p54<=0 | [[[[1<=p100 | p95<=p128] & [p0<=p97 & p97<=1]] & [[p47<=0 & p65<=0] | [p42<=1 | p2<=p40]]] | [[1<=p41 & ~ [p77<=p48]] & [~ [p62<=1] & ~ [1<=p19]]]]]] | ~ [[p128<=1 & [p134<=p78 & ~ [[1<=p90 | p62<=1]]]]]]] & ~ [[1<=p100 & [p49<=p16 | [p27<=0 & p69<=0]]]]]]]]
abstracting: (p69<=0)
states: 3,183,476,737 (9)
abstracting: (p27<=0)
states: 4,429,185,025 (9)
abstracting: (p49<=p16)
states: 4,532,994,049 (9)
abstracting: (1<=p100)
states: 138,412,032 (8)
abstracting: (p62<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p90)
states: 103,809,024 (8)
abstracting: (p134<=p78)
states: 4,152,360,961 (9)
abstracting: (p128<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p19)
states: 2,283,798,528 (9)
abstracting: (p62<=1)
states: 4,567,597,057 (9)
abstracting: (p77<=p48)
states: 2,318,401,537 (9)
abstracting: (1<=p41)
states: 69,206,016 (7)
abstracting: (p2<=p40)
states: 2,318,401,537 (9)
abstracting: (p42<=1)
states: 4,567,597,057 (9)
abstracting: (p65<=0)
states: 4,429,185,025 (9)
abstracting: (p47<=0)
states: 4,498,391,041 (9)
abstracting: (p97<=1)
states: 4,567,597,057 (9)
abstracting: (p0<=p97)
states: 4,567,597,056 (9)
abstracting: (p95<=p128)
states: 4,463,788,033 (9)
abstracting: (1<=p100)
states: 138,412,032 (8)
abstracting: (p54<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p68)
states: 830,472,192 (8)
abstracting: (p1<=p23)
states: 2,335,703,041 (9)
abstracting: (1<=p15)
states: 2,283,798,528 (9)
abstracting: (p135<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p133)
states: 968,884,224 (8)
abstracting: (p64<=p60)
states: 1,522,532,353 (9)
abstracting: (p111<=p110)
states: 4,567,597,057 (9)
abstracting: (p97<=1)
states: 4,567,597,057 (9)
abstracting: (p102<=1)
states: 4,567,597,057 (9)
abstracting: (p107<=1)
states: 4,567,597,057 (9)
abstracting: (p134<=1)
states: 4,567,597,057 (9)
-> the formula is FALSE
FORMULA Parking-PT-208-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.070sec
checking: EF [[[[[[p127<=0 | ~ [[[[p40<=p57 & p112<=1] | [p112<=0 | p81<=1]] & [[1<=p34 & p126<=p12] & ~ [p63<=1]]]]] | [1<=p82 & [[~ [p106<=p15] & [1<=p95 | [1<=p52 | p84<=0]]] & [p127<=0 & 1<=p35]]]] & [[[[~ [[p19<=0 & p56<=p1]] | ~ [[1<=p37 | 1<=p118]]] & p37<=0] & [1<=p77 | [[[p92<=0 & p45<=p3] | ~ [p16<=1]] & [p1<=1 & p18<=p9]]]] | ~ [[[[[p74<=1 | p85<=1] | [1<=p49 & p77<=p108]] | [~ [1<=p107] | p73<=1]] & [p91<=p132 | ~ [1<=p18]]]]]] & p51<=1] & 1<=p22]]
normalized: E [true U [1<=p22 & [p51<=1 & [[~ [[[p91<=p132 | ~ [1<=p18]] & [[p73<=1 | ~ [1<=p107]] | [[1<=p49 & p77<=p108] | [p74<=1 | p85<=1]]]]] | [[1<=p77 | [[p1<=1 & p18<=p9] & [~ [p16<=1] | [p92<=0 & p45<=p3]]]] & [p37<=0 & [~ [[1<=p37 | 1<=p118]] | ~ [[p19<=0 & p56<=p1]]]]]] & [[1<=p82 & [[p127<=0 & 1<=p35] & [[1<=p95 | [1<=p52 | p84<=0]] & ~ [p106<=p15]]]] | [p127<=0 | ~ [[[~ [p63<=1] & [1<=p34 & p126<=p12]] & [[p112<=0 | p81<=1] | [p40<=p57 & p112<=1]]]]]]]]]]
abstracting: (p112<=1)
states: 4,567,597,057 (9)
abstracting: (p40<=p57)
states: 4,498,391,041 (9)
abstracting: (p81<=1)
states: 4,567,597,057 (9)
abstracting: (p112<=0)
states: 4,463,788,033 (9)
abstracting: (p126<=p12)
states: 4,498,391,041 (9)
abstracting: (1<=p34)
states: 138,412,032 (8)
abstracting: (p63<=1)
states: 4,567,597,057 (9)
abstracting: (p127<=0)
states: 4,429,185,025 (9)
abstracting: (p106<=p15)
states: 4,532,994,049 (9)
abstracting: (p84<=0)
states: 2,283,798,529 (9)
abstracting: (1<=p52)
states: 3,875,536,896 (9)
abstracting: (1<=p95)
states: 103,809,024 (8)
abstracting: (1<=p35)
states: 138,412,032 (8)
abstracting: (p127<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p82)
states: 2,283,798,528 (9)
abstracting: (p56<=p1)
states: 4,498,391,041 (9)
abstracting: (p19<=0)
states: 2,283,798,529 (9)
abstracting: (1<=p118)
states: 3,875,536,896 (9)
abstracting: (1<=p37)
states: 103,809,024 (8)
abstracting: (p37<=0)
states: 4,463,788,033 (9)
abstracting: (p45<=p3)
states: 4,515,692,545 (9)
abstracting: (p92<=0)
states: 4,429,185,025 (9)
abstracting: (p16<=1)
states: 4,567,597,057 (9)
abstracting: (p18<=p9)
states: 3,425,697,793 (9)
abstracting: (p1<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p77)
states: 2,283,798,528 (9)
abstracting: (p85<=1)
states: 4,567,597,057 (9)
abstracting: (p74<=1)
states: 4,567,597,057 (9)
abstracting: (p77<=p108)
states: 2,353,004,545 (9)
abstracting: (1<=p49)
states: 69,206,016 (7)
abstracting: (1<=p107)
states: 69,206,016 (7)
abstracting: (p73<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p18)
states: 2,283,798,528 (9)
abstracting: (p91<=p132)
states: 4,567,597,057 (9)
abstracting: (p51<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p22)
states: 103,809,024 (8)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.245sec
checking: AG [[[[[p32<=p72 | [p56<=1 | [1<=p58 & ~ [[p131<=0 | p97<=p119]]]]] | [[[p80<=1 | [[~ [1<=p40] | p46<=1] | ~ [1<=p125]]] & [[~ [[p24<=0 & p75<=0]] | ~ [p35<=p80]] | [~ [p7<=1] & ~ [[p84<=0 & 1<=p82]]]]] & [p20<=p101 & [[[~ [1<=p12] & [p89<=p52 | p104<=p55]] & 1<=p23] | [p81<=0 & [1<=p49 & ~ [p59<=1]]]]]]] & ~ [[~ [[p6<=p3 & [~ [1<=p54] | p132<=p133]]] & 1<=p83]]] | ~ [[[~ [[[[p89<=p125 & 1<=p100] & [1<=p69 | p73<=1]] | [[1<=p104 & p120<=1] & p78<=p17]]] | ~ [[[[p66<=p81 | 1<=p91] | ~ [p61<=1]] | 1<=p35]]] & ~ [[~ [1<=p112] | ~ [[1<=p111 & 1<=p33]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [[1<=p111 & 1<=p33]] | ~ [1<=p112]]] & [~ [[1<=p35 | [~ [p61<=1] | [p66<=p81 | 1<=p91]]]] | ~ [[[p78<=p17 & [1<=p104 & p120<=1]] | [[1<=p69 | p73<=1] & [p89<=p125 & 1<=p100]]]]]]] | [~ [[1<=p83 & ~ [[p6<=p3 & [p132<=p133 | ~ [1<=p54]]]]]] & [[[p20<=p101 & [[p81<=0 & [1<=p49 & ~ [p59<=1]]] | [1<=p23 & [[p89<=p52 | p104<=p55] & ~ [1<=p12]]]]] & [[[~ [[p84<=0 & 1<=p82]] & ~ [p7<=1]] | [~ [p35<=p80] | ~ [[p24<=0 & p75<=0]]]] & [p80<=1 | [~ [1<=p125] | [p46<=1 | ~ [1<=p40]]]]]] | [p32<=p72 | [p56<=1 | [1<=p58 & ~ [[p131<=0 | p97<=p119]]]]]]]]]]]
abstracting: (p97<=p119)
states: 4,463,788,033 (9)
abstracting: (p131<=0)
states: 4,429,185,025 (9)
abstracting: (1<=p58)
states: 138,412,032 (8)
abstracting: (p56<=1)
states: 4,567,597,057 (9)
abstracting: (p32<=p72)
states: 4,515,692,545 (9)
abstracting: (1<=p40)
states: 69,206,016 (7)
abstracting: (p46<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p125)
states: 138,412,032 (8)
abstracting: (p80<=1)
states: 4,567,597,057 (9)
abstracting: (p75<=0)
states: 2,283,798,529 (9)
abstracting: (p24<=0)
states: 4,463,788,033 (9)
abstracting: (p35<=p80)
states: 4,498,391,041 (9)
abstracting: (p7<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p82)
states: 2,283,798,528 (9)
abstracting: (p84<=0)
states: 2,283,798,529 (9)
abstracting: (1<=p12)
states: 2,283,798,528 (9)
abstracting: (p104<=p55)
states: 4,466,933,761 (9)
abstracting: (p89<=p52)
states: 4,551,868,417 (9)
abstracting: (1<=p23)
states: 103,809,024 (8)
abstracting: (p59<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p49)
states: 69,206,016 (7)
abstracting: (p81<=0)
states: 2,283,798,529 (9)
abstracting: (p20<=p101)
states: 2,353,004,545 (9)
abstracting: (1<=p54)
states: 138,412,032 (8)
abstracting: (p132<=p133)
states: 1,072,693,249 (9)
abstracting: (p6<=p3)
states: 3,425,697,793 (9)
abstracting: (1<=p83)
states: 2,283,798,528 (9)
abstracting: (1<=p100)
states: 138,412,032 (8)
abstracting: (p89<=p125)
states: 4,463,788,033 (9)
abstracting: (p73<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p69)
states: 1,384,120,320 (9)
abstracting: (p120<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p104)
states: 103,809,024 (8)
abstracting: (p78<=p17)
states: 3,425,697,793 (9)
abstracting: (1<=p91)
states: 69,206,016 (7)
abstracting: (p66<=p81)
states: 2,353,004,545 (9)
abstracting: (p61<=1)
states: 4,567,597,057 (9)
abstracting: (1<=p35)
states: 138,412,032 (8)
abstracting: (1<=p112)
states: 103,809,024 (8)
abstracting: (1<=p33)
states: 69,206,016 (7)
abstracting: (1<=p111)
states: 103,809,024 (8)
-> the formula is TRUE
FORMULA Parking-PT-208-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
totally nodes used: 1344856 (1.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2877726 7512006 10389732
used/not used/entry size/cache size: 8175996 58932868 16 1024MB
basic ops cache: hits/miss/sum: 580764 1524243 2105007
used/not used/entry size/cache size: 2617334 14159882 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: 14143 46722 60865
used/not used/entry size/cache size: 46626 8341982 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 65863707
1 1156793
2 78101
3 9271
4 917
5 71
6 3
7 1
8 0
9 0
>= 10 0
Total processing time: 0m 9.106sec
BK_STOP 1678842098612
--------------------
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:2847 (14), effective:253 (1)
initing FirstDep: 0m 0.000sec
iterations count:4283 (21), effective:278 (1)
iterations count:2061 (10), effective:112 (0)
iterations count:4628 (23), effective:323 (1)
iterations count:2027 (10), effective:114 (0)
iterations count:2181 (10), effective:122 (0)
iterations count:2203 (10), effective:120 (0)
iterations count:2077 (10), effective:113 (0)
iterations count:7905 (39), effective:557 (2)
iterations count:11046 (54), effective:769 (3)
iterations count:2126 (10), effective:115 (0)
iterations count:2218 (11), effective:126 (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="Parking-PT-208"
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 Parking-PT-208, 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 r257-smll-167863532700422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 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 ;