About the Execution of Marcie for StigmergyCommit-PT-03a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5481.947 | 7829.00 | 7981.00 | 69.30 | FFFTTTTTTTFTFFFF | 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.r449-smll-167912641500409.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 StigmergyCommit-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641500409
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 10:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 10:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 10:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 98K 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 StigmergyCommit-PT-03a-CTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-03a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679302553665
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=StigmergyCommit-PT-03a
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: StigmergyCommit_PT_03a
(NrP: 148 NrTr: 332 NrArc: 1538)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.000sec
init dd package: 0m 3.499sec
RS generation: 0m 0.232sec
-> reachability set: #nodes 2806 (2.8e+03) #states 4,055 (3)
starting MCC model checker
--------------------------
checking: EX [~ [[AF [1<=p18] | AG [AG [[p100<=0 & p6<=1]]]]]]
normalized: EX [~ [[~ [EG [~ [1<=p18]]] | ~ [E [true U E [true U ~ [[p100<=0 & p6<=1]]]]]]]]
abstracting: (p6<=1)
states: 4,055 (3)
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (1<=p18)
states: 1
...
EG iterations: 3
.-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.586sec
checking: EF [EX [[1<=p116 | EG [AF [p64<=p145]]]]]
normalized: E [true U EX [[EG [~ [EG [~ [p64<=p145]]]] | 1<=p116]]]
abstracting: (1<=p116)
states: 1
abstracting: (p64<=p145)
states: 4,054 (3)
..
EG iterations: 2
EG iterations: 0
.-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: EX [AX [~ [AF [~ [[p23<=p98 | p89<=p139]]]]]]
normalized: EX [~ [EX [~ [EG [[p23<=p98 | p89<=p139]]]]]]
abstracting: (p89<=p139)
states: 4,054 (3)
abstracting: (p23<=p98)
states: 4,054 (3)
EG iterations: 0
..-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [EF [~ [[~ [p74<=p146] | [~ [EG [1<=p89]] | p25<=p127]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [1<=p89]] | p25<=p127] | ~ [p74<=p146]]]]]
abstracting: (p74<=p146)
states: 3,930 (3)
abstracting: (p25<=p127)
states: 4,054 (3)
abstracting: (1<=p89)
states: 1
..
EG iterations: 2
-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [[p51<=0 | EG [[~ [[~ [p136<=p31] | EF [p74<=1]]] & [p2<=0 | p128<=1]]]]]
normalized: ~ [E [true U ~ [[EG [[[p2<=0 | p128<=1] & ~ [[E [true U p74<=1] | ~ [p136<=p31]]]]] | p51<=0]]]]
abstracting: (p51<=0)
states: 4,054 (3)
abstracting: (p136<=p31)
states: 4,054 (3)
abstracting: (p74<=1)
states: 4,055 (3)
abstracting: (p128<=1)
states: 4,055 (3)
abstracting: (p2<=0)
states: 3,930 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: AX [AF [[[EG [[1<=p138 | p89<=0]] | [~ [1<=p18] & 1<=p85]] & EX [p22<=p145]]]]
normalized: ~ [EX [EG [~ [[EX [p22<=p145] & [[~ [1<=p18] & 1<=p85] | EG [[1<=p138 | p89<=0]]]]]]]]
abstracting: (p89<=0)
states: 4,054 (3)
abstracting: (1<=p138)
states: 596
EG iterations: 0
abstracting: (1<=p85)
states: 1
abstracting: (1<=p18)
states: 1
abstracting: (p22<=p145)
states: 4,054 (3)
...
EG iterations: 2
.-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: AX [A [A [~ [AF [p92<=p137]] U [~ [[1<=p34 | p63<=p47]] | A [p53<=0 U p100<=0]]] U p36<=p20]]
normalized: ~ [EX [~ [[~ [EG [~ [p36<=p20]]] & ~ [E [~ [p36<=p20] U [~ [[~ [EG [~ [[[~ [EG [~ [p100<=0]]] & ~ [E [~ [p100<=0] U [~ [p53<=0] & ~ [p100<=0]]]]] | ~ [[1<=p34 | p63<=p47]]]]]] & ~ [E [~ [[[~ [EG [~ [p100<=0]]] & ~ [E [~ [p100<=0] U [~ [p53<=0] & ~ [p100<=0]]]]] | ~ [[1<=p34 | p63<=p47]]]] U [~ [EG [~ [p92<=p137]]] & ~ [[[~ [EG [~ [p100<=0]]] & ~ [E [~ [p100<=0] U [~ [p53<=0] & ~ [p100<=0]]]]] | ~ [[1<=p34 | p63<=p47]]]]]]]]] & ~ [p36<=p20]]]]]]]]
abstracting: (p36<=p20)
states: 3,614 (3)
abstracting: (p63<=p47)
states: 4,054 (3)
abstracting: (1<=p34)
states: 441
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p53<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (p92<=p137)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (p63<=p47)
states: 4,054 (3)
abstracting: (1<=p34)
states: 441
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p53<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (p63<=p47)
states: 4,054 (3)
abstracting: (1<=p34)
states: 441
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p53<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
abstracting: (p100<=0)
states: 4,054 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p36<=p20)
states: 3,614 (3)
abstracting: (p36<=p20)
states: 3,614 (3)
......................
EG iterations: 22
.-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.196sec
checking: ~ [AG [[EG [[[~ [p6<=1] | E [1<=p92 U 1<=p134]] & [[1<=p44 | p5<=p143] | [p54<=0 | p48<=0]]]] | [p14<=0 & p42<=0]]]]
normalized: E [true U ~ [[[p14<=0 & p42<=0] | EG [[[[p54<=0 | p48<=0] | [1<=p44 | p5<=p143]] & [E [1<=p92 U 1<=p134] | ~ [p6<=1]]]]]]]
abstracting: (p6<=1)
states: 4,055 (3)
abstracting: (1<=p134)
states: 1
abstracting: (1<=p92)
states: 1
abstracting: (p5<=p143)
states: 3,991 (3)
abstracting: (1<=p44)
states: 1
abstracting: (p48<=0)
states: 4,054 (3)
abstracting: (p54<=0)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (p42<=0)
states: 3,991 (3)
abstracting: (p14<=0)
states: 4,054 (3)
-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.143sec
checking: [EG [p3<=1] | EX [[[1<=p45 | AF [[~ [1<=p17] & AX [p89<=p66]]]] & ~ [[p18<=1 & [[[1<=p75 & p111<=p46] & ~ [1<=p34]] | p40<=1]]]]]]
normalized: [EX [[~ [[[[~ [1<=p34] & [1<=p75 & p111<=p46]] | p40<=1] & p18<=1]] & [~ [EG [~ [[~ [EX [~ [p89<=p66]]] & ~ [1<=p17]]]]] | 1<=p45]]] | EG [p3<=1]]
abstracting: (p3<=1)
states: 4,055 (3)
EG iterations: 0
abstracting: (1<=p45)
states: 1
abstracting: (1<=p17)
states: 1
abstracting: (p89<=p66)
states: 4,055 (3)
...
EG iterations: 2
abstracting: (p18<=1)
states: 4,055 (3)
abstracting: (p40<=1)
states: 4,055 (3)
abstracting: (p111<=p46)
states: 3,930 (3)
abstracting: (1<=p75)
states: 125
abstracting: (1<=p34)
states: 441
.-> the formula is TRUE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: A [[[p126<=1 | A [~ [AF [p70<=p81]] U 1<=p53]] | p33<=p121] U [EX [[EF [E [p40<=p18 U p91<=0]] & AG [~ [p45<=p48]]]] & p28<=0]]
normalized: [~ [EG [~ [[p28<=0 & EX [[~ [E [true U p45<=p48]] & E [true U E [p40<=p18 U p91<=0]]]]]]]] & ~ [E [~ [[p28<=0 & EX [[~ [E [true U p45<=p48]] & E [true U E [p40<=p18 U p91<=0]]]]]] U [~ [[p33<=p121 | [p126<=1 | [~ [EG [~ [1<=p53]]] & ~ [E [~ [1<=p53] U [~ [EG [~ [p70<=p81]]] & ~ [1<=p53]]]]]]]] & ~ [[p28<=0 & EX [[~ [E [true U p45<=p48]] & E [true U E [p40<=p18 U p91<=0]]]]]]]]]]
abstracting: (p91<=0)
states: 4,054 (3)
abstracting: (p40<=p18)
states: 3,930 (3)
abstracting: (p45<=p48)
states: 4,054 (3)
.abstracting: (p28<=0)
states: 4,054 (3)
abstracting: (1<=p53)
states: 1
abstracting: (p70<=p81)
states: 3,614 (3)
......................
EG iterations: 22
abstracting: (1<=p53)
states: 1
abstracting: (1<=p53)
states: 1
....
EG iterations: 4
abstracting: (p126<=1)
states: 4,055 (3)
abstracting: (p33<=p121)
states: 3,614 (3)
abstracting: (p91<=0)
states: 4,054 (3)
abstracting: (p40<=p18)
states: 3,930 (3)
abstracting: (p45<=p48)
states: 4,054 (3)
.abstracting: (p28<=0)
states: 4,054 (3)
abstracting: (p91<=0)
states: 4,054 (3)
abstracting: (p40<=p18)
states: 3,930 (3)
abstracting: (p45<=p48)
states: 4,054 (3)
.abstracting: (p28<=0)
states: 4,054 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.244sec
checking: ~ [[[EF [[EG [[p132<=p14 & p38<=p10]] & AX [1<=p69]]] | AG [A [[[1<=p23 | p94<=p68] | [p131<=0 & 1<=p63]] U AF [1<=p54]]]] & EF [EF [EF [[1<=p145 | p120<=1]]]]]]
normalized: ~ [[E [true U E [true U E [true U [1<=p145 | p120<=1]]]] & [~ [E [true U ~ [[~ [EG [EG [~ [1<=p54]]]] & ~ [E [EG [~ [1<=p54]] U [~ [[[p131<=0 & 1<=p63] | [1<=p23 | p94<=p68]]] & EG [~ [1<=p54]]]]]]]]] | E [true U [~ [EX [~ [1<=p69]]] & EG [[p132<=p14 & p38<=p10]]]]]]]
abstracting: (p38<=p10)
states: 3,930 (3)
abstracting: (p132<=p14)
states: 4,054 (3)
....
EG iterations: 4
abstracting: (1<=p69)
states: 441
.abstracting: (1<=p54)
states: 1
...
EG iterations: 3
abstracting: (p94<=p68)
states: 4,054 (3)
abstracting: (1<=p23)
states: 1
abstracting: (1<=p63)
states: 1
abstracting: (p131<=0)
states: 4,054 (3)
abstracting: (1<=p54)
states: 1
...
EG iterations: 3
abstracting: (1<=p54)
states: 1
...
EG iterations: 3
.
EG iterations: 1
abstracting: (p120<=1)
states: 4,055 (3)
abstracting: (1<=p145)
states: 343
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.246sec
checking: A [[[~ [[[p34<=1 | EG [p95<=p139]] | [p51<=1 | EX [1<=p24]]]] | EX [A [[p58<=p82 | p63<=1] U [p56<=1 | p109<=p85]]]] | ~ [p54<=1]] U ~ [p81<=p143]]
normalized: [~ [EG [p81<=p143]] & ~ [E [p81<=p143 U [p81<=p143 & ~ [[~ [p54<=1] | [EX [[~ [EG [~ [[p56<=1 | p109<=p85]]]] & ~ [E [~ [[p56<=1 | p109<=p85]] U [~ [[p58<=p82 | p63<=1]] & ~ [[p56<=1 | p109<=p85]]]]]]] | ~ [[[p51<=1 | EX [1<=p24]] | [p34<=1 | EG [p95<=p139]]]]]]]]]]]
abstracting: (p95<=p139)
states: 4,054 (3)
.....
EG iterations: 5
abstracting: (p34<=1)
states: 4,055 (3)
abstracting: (1<=p24)
states: 1
.abstracting: (p51<=1)
states: 4,055 (3)
abstracting: (p109<=p85)
states: 3,930 (3)
abstracting: (p56<=1)
states: 4,055 (3)
abstracting: (p63<=1)
states: 4,055 (3)
abstracting: (p58<=p82)
states: 4,054 (3)
abstracting: (p109<=p85)
states: 3,930 (3)
abstracting: (p56<=1)
states: 4,055 (3)
abstracting: (p109<=p85)
states: 3,930 (3)
abstracting: (p56<=1)
states: 4,055 (3)
.
EG iterations: 1
.abstracting: (p54<=1)
states: 4,055 (3)
abstracting: (p81<=p143)
states: 4,054 (3)
abstracting: (p81<=p143)
states: 4,054 (3)
abstracting: (p81<=p143)
states: 4,054 (3)
..
EG iterations: 2
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: A [p99<=0 U [[EF [E [[1<=p53 | p98<=0] U p5<=1]] | A [EG [E [p1<=p93 U p105<=1]] U [[AF [p89<=1] | EF [1<=p108]] & ~ [1<=p137]]]] & AX [[EF [[p62<=p22 | p129<=p63]] & [~ [E [p35<=1 U p75<=p8]] & AX [1<=p7]]]]]]
normalized: [~ [EG [~ [[~ [EX [~ [[[~ [EX [~ [1<=p7]]] & ~ [E [p35<=1 U p75<=p8]]] & E [true U [p62<=p22 | p129<=p63]]]]]] & [[~ [EG [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]] & ~ [E [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]] U [~ [EG [E [p1<=p93 U p105<=1]]] & ~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]]]] | E [true U E [[1<=p53 | p98<=0] U p5<=1]]]]]]] & ~ [E [~ [[~ [EX [~ [[[~ [EX [~ [1<=p7]]] & ~ [E [p35<=1 U p75<=p8]]] & E [true U [p62<=p22 | p129<=p63]]]]]] & [[~ [EG [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]] & ~ [E [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]] U [~ [EG [E [p1<=p93 U p105<=1]]] & ~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]]]] | E [true U E [[1<=p53 | p98<=0] U p5<=1]]]]] U [~ [p99<=0] & ~ [[~ [EX [~ [[[~ [EX [~ [1<=p7]]] & ~ [E [p35<=1 U p75<=p8]]] & E [true U [p62<=p22 | p129<=p63]]]]]] & [[~ [EG [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]] & ~ [E [~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]] U [~ [EG [E [p1<=p93 U p105<=1]]] & ~ [[~ [1<=p137] & [E [true U 1<=p108] | ~ [EG [~ [p89<=1]]]]]]]]]] | E [true U E [[1<=p53 | p98<=0] U p5<=1]]]]]]]]]
abstracting: (p5<=1)
states: 4,055 (3)
abstracting: (p98<=0)
states: 4,054 (3)
abstracting: (1<=p53)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p105<=1)
states: 4,055 (3)
abstracting: (p1<=p93)
states: 3,930 (3)
EG iterations: 0
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
..
EG iterations: 2
abstracting: (p129<=p63)
states: 4,054 (3)
abstracting: (p62<=p22)
states: 4,054 (3)
abstracting: (p75<=p8)
states: 3,930 (3)
abstracting: (p35<=1)
states: 4,055 (3)
abstracting: (1<=p7)
states: 64
..abstracting: (p99<=0)
states: 4,054 (3)
abstracting: (p5<=1)
states: 4,055 (3)
abstracting: (p98<=0)
states: 4,054 (3)
abstracting: (1<=p53)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p105<=1)
states: 4,055 (3)
abstracting: (p1<=p93)
states: 3,930 (3)
EG iterations: 0
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
..
EG iterations: 2
abstracting: (p129<=p63)
states: 4,054 (3)
abstracting: (p62<=p22)
states: 4,054 (3)
abstracting: (p75<=p8)
states: 3,930 (3)
abstracting: (p35<=1)
states: 4,055 (3)
abstracting: (1<=p7)
states: 64
..abstracting: (p5<=1)
states: 4,055 (3)
abstracting: (p98<=0)
states: 4,054 (3)
abstracting: (1<=p53)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p105<=1)
states: 4,055 (3)
abstracting: (p1<=p93)
states: 3,930 (3)
EG iterations: 0
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
abstracting: (p89<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p108)
states: 441
abstracting: (1<=p137)
states: 1
..
EG iterations: 2
abstracting: (p129<=p63)
states: 4,054 (3)
abstracting: (p62<=p22)
states: 4,054 (3)
abstracting: (p75<=p8)
states: 3,930 (3)
abstracting: (p35<=1)
states: 4,055 (3)
abstracting: (1<=p7)
states: 64
..
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.124sec
checking: [AF [~ [AX [AX [[p2<=p26 | p52<=p108]]]]] & [AG [~ [A [AF [p12<=p63] U ~ [EG [p27<=1]]]]] | [AX [[~ [AF [1<=p98]] | [AG [p60<=p104] | EX [p10<=p54]]]] | EG [[E [[p8<=p109 & 1<=p11] U [1<=p134 | p53<=1]] & p47<=0]]]]]
normalized: [[[EG [[p47<=0 & E [[p8<=p109 & 1<=p11] U [1<=p134 | p53<=1]]]] | ~ [EX [~ [[[EX [p10<=p54] | ~ [E [true U ~ [p60<=p104]]]] | EG [~ [1<=p98]]]]]]] | ~ [E [true U [~ [EG [EG [p27<=1]]] & ~ [E [EG [p27<=1] U [EG [~ [p12<=p63]] & EG [p27<=1]]]]]]]] & ~ [EG [~ [EX [EX [~ [[p2<=p26 | p52<=p108]]]]]]]]
abstracting: (p52<=p108)
states: 4,054 (3)
abstracting: (p2<=p26)
states: 3,930 (3)
..
EG iterations: 0
abstracting: (p27<=1)
states: 4,055 (3)
EG iterations: 0
abstracting: (p12<=p63)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (p27<=1)
states: 4,055 (3)
EG iterations: 0
abstracting: (p27<=1)
states: 4,055 (3)
EG iterations: 0
EG iterations: 0
abstracting: (1<=p98)
states: 1
..
EG iterations: 2
abstracting: (p60<=p104)
states: 4,054 (3)
abstracting: (p10<=p54)
states: 4,054 (3)
..abstracting: (p53<=1)
states: 4,055 (3)
abstracting: (1<=p134)
states: 1
abstracting: (1<=p11)
states: 1
abstracting: (p8<=p109)
states: 4,054 (3)
abstracting: (p47<=0)
states: 4,054 (3)
..
EG iterations: 2
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.097sec
checking: [AG [EF [[[~ [E [1<=p89 U p115<=0]] | AX [p59<=p71]] & ~ [[p23<=p68 | AX [1<=p90]]]]]] & [AX [1<=p113] | ~ [EG [[[~ [p124<=1] | ~ [[1<=p18 & 1<=p114]]] | [[~ [p34<=p74] & EF [p125<=0]] & ~ [[p90<=p39 | p99<=p6]]]]]]]]
normalized: [[~ [EG [[[~ [[p90<=p39 | p99<=p6]] & [E [true U p125<=0] & ~ [p34<=p74]]] | [~ [[1<=p18 & 1<=p114]] | ~ [p124<=1]]]]] | ~ [EX [~ [1<=p113]]]] & ~ [E [true U ~ [E [true U [~ [[p23<=p68 | ~ [EX [~ [1<=p90]]]]] & [~ [EX [~ [p59<=p71]]] | ~ [E [1<=p89 U p115<=0]]]]]]]]]
abstracting: (p115<=0)
states: 3,991 (3)
abstracting: (1<=p89)
states: 1
abstracting: (p59<=p71)
states: 4,054 (3)
.abstracting: (1<=p90)
states: 1
.abstracting: (p23<=p68)
states: 4,054 (3)
abstracting: (1<=p113)
states: 64
.abstracting: (p124<=1)
states: 4,055 (3)
abstracting: (1<=p114)
states: 64
abstracting: (1<=p18)
states: 1
abstracting: (p34<=p74)
states: 3,614 (3)
abstracting: (p125<=0)
states: 4,054 (3)
abstracting: (p99<=p6)
states: 4,054 (3)
abstracting: (p90<=p39)
states: 4,054 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.256sec
checking: AG [[[~ [AG [AF [p122<=p57]]] | [[[[p32<=0 | [p42<=p92 & 1<=p4]] & AX [p40<=p26]] & [E [p33<=p96 U p83<=p51] & AX [p26<=p49]]] & [A [A [1<=p96 U p40<=1] U EX [1<=p107]] | [AG [1<=p94] & [AX [p97<=0] | p33<=0]]]]] & AX [AX [A [p42<=p53 U p113<=p23]]]]]
normalized: ~ [E [true U ~ [[~ [EX [EX [~ [[~ [EG [~ [p113<=p23]]] & ~ [E [~ [p113<=p23] U [~ [p42<=p53] & ~ [p113<=p23]]]]]]]]] & [[[[[p33<=0 | ~ [EX [~ [p97<=0]]]] & ~ [E [true U ~ [1<=p94]]]] | [~ [EG [~ [EX [1<=p107]]]] & ~ [E [~ [EX [1<=p107]] U [~ [[~ [EG [~ [p40<=1]]] & ~ [E [~ [p40<=1] U [~ [1<=p96] & ~ [p40<=1]]]]]] & ~ [EX [1<=p107]]]]]]] & [[~ [EX [~ [p26<=p49]]] & E [p33<=p96 U p83<=p51]] & [~ [EX [~ [p40<=p26]]] & [p32<=0 | [p42<=p92 & 1<=p4]]]]] | E [true U EG [~ [p122<=p57]]]]]]]]
abstracting: (p122<=p57)
states: 4,054 (3)
..
EG iterations: 2
abstracting: (1<=p4)
states: 125
abstracting: (p42<=p92)
states: 3,991 (3)
abstracting: (p32<=0)
states: 3,614 (3)
abstracting: (p40<=p26)
states: 3,930 (3)
.abstracting: (p83<=p51)
states: 4,054 (3)
abstracting: (p33<=p96)
states: 3,614 (3)
abstracting: (p26<=p49)
states: 4,054 (3)
.abstracting: (1<=p107)
states: 441
.abstracting: (p40<=1)
states: 4,055 (3)
abstracting: (1<=p96)
states: 1
abstracting: (p40<=1)
states: 4,055 (3)
abstracting: (p40<=1)
states: 4,055 (3)
.
EG iterations: 1
abstracting: (1<=p107)
states: 441
.abstracting: (1<=p107)
states: 441
...
EG iterations: 2
abstracting: (1<=p94)
states: 1
abstracting: (p97<=0)
states: 4,054 (3)
.abstracting: (p33<=0)
states: 3,614 (3)
abstracting: (p113<=p23)
states: 3,991 (3)
abstracting: (p42<=p53)
states: 3,991 (3)
abstracting: (p113<=p23)
states: 3,991 (3)
abstracting: (p113<=p23)
states: 3,991 (3)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA StigmergyCommit-PT-03a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.156sec
totally nodes used: 758592 (7.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 830096 5397935 6228031
used/not used/entry size/cache size: 5763992 61344872 16 1024MB
basic ops cache: hits/miss/sum: 175936 677313 853249
used/not used/entry size/cache size: 926176 15851040 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: 4140 17242 21382
used/not used/entry size/cache size: 17227 8371381 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 66454648
1 564216
2 77344
3 11167
4 1291
5 166
6 31
7 1
8 0
9 0
>= 10 0
Total processing time: 0m 7.758sec
BK_STOP 1679302561494
--------------------
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.001sec
iterations count:9617 (28), effective:187 (0)
initing FirstDep: 0m 0.001sec
iterations count:8269 (24), effective:139 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:8314 (25), effective:139 (0)
iterations count:332 (1), effective:0 (0)
iterations count:8365 (25), effective:138 (0)
iterations count:334 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:441 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:334 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:441 (1), effective:1 (0)
iterations count:334 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:441 (1), effective:1 (0)
iterations count:1118 (3), effective:23 (0)
iterations count:8245 (24), effective:136 (0)
iterations count:389 (1), effective:3 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:333 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:333 (1), effective:1 (0)
iterations count:8381 (25), effective:139 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:366 (1), effective:1 (0)
iterations count:366 (1), effective:1 (0)
iterations count:332 (1), effective:0 (0)
iterations count:333 (1), effective:1 (0)
iterations count:8420 (25), effective:139 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:8401 (25), effective:139 (0)
iterations count:8466 (25), effective:140 (0)
iterations count:334 (1), effective:1 (0)
iterations count:467 (1), effective:1 (0)
iterations count:438 (1), effective:1 (0)
iterations count:567 (1), effective:1 (0)
iterations count:485 (1), effective:8 (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="StigmergyCommit-PT-03a"
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 StigmergyCommit-PT-03a, 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 r449-smll-167912641500409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-03a.tgz
mv StigmergyCommit-PT-03a 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 ;