About the Execution of Marcie for StigmergyElection-PT-04a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.096 | 5804.00 | 5962.00 | 49.00 | FTTTFTFTFFTTFFTF | 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-167912641700585.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 StigmergyElection-PT-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641700585
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 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 71K 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 StigmergyElection-PT-04a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-04a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679388260011
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=StigmergyElection-PT-04a
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: StigmergyElection_PT_04a
(NrP: 58 NrTr: 218 NrArc: 1238)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.509sec
RS generation: 0m 0.041sec
-> reachability set: #nodes 1483 (1.5e+03) #states 977
starting MCC model checker
--------------------------
checking: EG [p15<=1]
normalized: EG [p15<=1]
abstracting: (p15<=1)
states: 977
EG iterations: 0
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EG [p7<=1]]
normalized: ~ [EG [p7<=1]]
abstracting: (p7<=1)
states: 977
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [p21<=p53]
normalized: EG [p21<=p53]
abstracting: (p21<=p53)
states: 913
.
EG iterations: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: ~ [EG [EF [~ [[1<=p38 | ~ [EG [p52<=1]]]]]]]
normalized: ~ [EG [E [true U ~ [[~ [EG [p52<=1]] | 1<=p38]]]]]
abstracting: (1<=p38)
states: 1
abstracting: (p52<=1)
states: 977
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: ~ [A [AX [~ [E [EX [p41<=0] U EG [1<=p0]]]] U E [p55<=1 U EF [~ [p11<=p43]]]]]
normalized: ~ [[~ [EG [~ [E [p55<=1 U E [true U ~ [p11<=p43]]]]]] & ~ [E [~ [E [p55<=1 U E [true U ~ [p11<=p43]]]] U [EX [E [EX [p41<=0] U EG [1<=p0]]] & ~ [E [p55<=1 U E [true U ~ [p11<=p43]]]]]]]]]
abstracting: (p11<=p43)
states: 976
abstracting: (p55<=1)
states: 977
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (p41<=0)
states: 950
..abstracting: (p11<=p43)
states: 976
abstracting: (p55<=1)
states: 977
abstracting: (p11<=p43)
states: 976
abstracting: (p55<=1)
states: 977
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.054sec
checking: AG [E [[AG [~ [p55<=0]] & [p48<=p32 | ~ [EF [1<=p9]]]] U EG [EF [EF [p45<=p54]]]]]
normalized: ~ [E [true U ~ [E [[[~ [E [true U 1<=p9]] | p48<=p32] & ~ [E [true U p55<=0]]] U EG [E [true U E [true U p45<=p54]]]]]]]
abstracting: (p45<=p54)
states: 852
EG iterations: 0
abstracting: (p55<=0)
states: 950
abstracting: (p48<=p32)
states: 913
abstracting: (1<=p9)
states: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EG [EF [[[EX [[p2<=0 & p33<=p22]] | AG [EF [p33<=p13]]] & ~ [EX [p2<=p13]]]]]
normalized: EG [E [true U [~ [EX [p2<=p13]] & [~ [E [true U ~ [E [true U p33<=p13]]]] | EX [[p2<=0 & p33<=p22]]]]]]
abstracting: (p33<=p22)
states: 913
abstracting: (p2<=0)
states: 852
.abstracting: (p33<=p13)
states: 913
abstracting: (p2<=p13)
states: 852
..
EG iterations: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: ~ [A [1<=p22 U [1<=p48 & E [p0<=1 U A [~ [p56<=p0] U ~ [p1<=p6]]]]]]
normalized: ~ [[~ [EG [~ [[E [p0<=1 U [~ [EG [p1<=p6]] & ~ [E [p1<=p6 U [p56<=p0 & p1<=p6]]]]] & 1<=p48]]]] & ~ [E [~ [[E [p0<=1 U [~ [EG [p1<=p6]] & ~ [E [p1<=p6 U [p56<=p0 & p1<=p6]]]]] & 1<=p48]] U [~ [1<=p22] & ~ [[E [p0<=1 U [~ [EG [p1<=p6]] & ~ [E [p1<=p6 U [p56<=p0 & p1<=p6]]]]] & 1<=p48]]]]]]]
abstracting: (1<=p48)
states: 64
abstracting: (p1<=p6)
states: 852
abstracting: (p56<=p0)
states: 950
abstracting: (p1<=p6)
states: 852
abstracting: (p1<=p6)
states: 852
.
EG iterations: 1
abstracting: (p0<=1)
states: 977
abstracting: (1<=p22)
states: 1
abstracting: (1<=p48)
states: 64
abstracting: (p1<=p6)
states: 852
abstracting: (p56<=p0)
states: 950
abstracting: (p1<=p6)
states: 852
abstracting: (p1<=p6)
states: 852
.
EG iterations: 1
abstracting: (p0<=1)
states: 977
abstracting: (1<=p48)
states: 64
abstracting: (p1<=p6)
states: 852
abstracting: (p56<=p0)
states: 950
abstracting: (p1<=p6)
states: 852
abstracting: (p1<=p6)
states: 852
.
EG iterations: 1
abstracting: (p0<=1)
states: 977
..
EG iterations: 2
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: ~ [E [[EF [AG [EF [p10<=1]]] & ~ [[~ [p26<=p46] & p13<=1]]] U ~ [[EG [AG [p24<=0]] & EG [EX [p54<=p37]]]]]]
normalized: ~ [E [[~ [[~ [p26<=p46] & p13<=1]] & E [true U ~ [E [true U ~ [E [true U p10<=1]]]]]] U ~ [[EG [EX [p54<=p37]] & EG [~ [E [true U ~ [p24<=0]]]]]]]]
abstracting: (p24<=0)
states: 976
.
EG iterations: 1
abstracting: (p54<=p37)
states: 752
..........
EG iterations: 9
abstracting: (p10<=1)
states: 977
abstracting: (p13<=1)
states: 977
abstracting: (p26<=p46)
states: 776
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: E [AG [EF [~ [AG [p41<=p19]]]] U [AF [[AX [EG [p19<=1]] & EF [[1<=p52 | p29<=p48]]]] | ~ [EX [AG [[1<=p34 | p9<=1]]]]]]
normalized: E [~ [E [true U ~ [E [true U E [true U ~ [p41<=p19]]]]]] U [~ [EX [~ [E [true U ~ [[1<=p34 | p9<=1]]]]]] | ~ [EG [~ [[E [true U [1<=p52 | p29<=p48]] & ~ [EX [~ [EG [p19<=1]]]]]]]]]]
abstracting: (p19<=1)
states: 977
EG iterations: 0
.abstracting: (p29<=p48)
states: 852
abstracting: (1<=p52)
states: 1
.
EG iterations: 1
abstracting: (p9<=1)
states: 977
abstracting: (1<=p34)
states: 64
.abstracting: (p41<=p19)
states: 950
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: ~ [[AF [~ [[[EG [p22<=0] & [[p47<=1 & p32<=1] & [p40<=p38 | 1<=p20]]] | ~ [EF [1<=p33]]]]] | ~ [AX [EX [1<=p14]]]]]
normalized: ~ [[EX [~ [EX [1<=p14]]] | ~ [EG [[~ [E [true U 1<=p33]] | [[[p40<=p38 | 1<=p20] & [p47<=1 & p32<=1]] & EG [p22<=0]]]]]]]
abstracting: (p22<=0)
states: 976
.
EG iterations: 1
abstracting: (p32<=1)
states: 977
abstracting: (p47<=1)
states: 977
abstracting: (1<=p20)
states: 64
abstracting: (p40<=p38)
states: 751
abstracting: (1<=p33)
states: 64
..........
EG iterations: 10
abstracting: (1<=p14)
states: 27
..-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.052sec
checking: EG [[[AG [A [1<=p7 U [p2<=0 | p0<=0]]] & p51<=p20] | AG [E [[AG [1<=p39] & [1<=p56 | 1<=p33]] U E [p40<=1 U p14<=0]]]]]
normalized: EG [[~ [E [true U ~ [E [[[1<=p56 | 1<=p33] & ~ [E [true U ~ [1<=p39]]]] U E [p40<=1 U p14<=0]]]]] | [p51<=p20 & ~ [E [true U ~ [[~ [EG [~ [[p2<=0 | p0<=0]]]] & ~ [E [~ [[p2<=0 | p0<=0]] U [~ [1<=p7] & ~ [[p2<=0 | p0<=0]]]]]]]]]]]]
abstracting: (p0<=0)
states: 976
abstracting: (p2<=0)
states: 852
abstracting: (1<=p7)
states: 64
abstracting: (p0<=0)
states: 976
abstracting: (p2<=0)
states: 852
abstracting: (p0<=0)
states: 976
abstracting: (p2<=0)
states: 852
.
EG iterations: 1
abstracting: (p51<=p20)
states: 976
abstracting: (p14<=0)
states: 950
abstracting: (p40<=1)
states: 977
abstracting: (1<=p39)
states: 1
abstracting: (1<=p33)
states: 64
abstracting: (1<=p56)
states: 27
EG iterations: 0
-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [~ [AX [~ [p1<=0]]] | EX [[p9<=p51 | [[~ [EG [1<=p31]] | EF [[1<=p15 & p0<=p54]]] | [~ [[~ [p41<=1] | AG [p22<=p33]]] & ~ [[E [p9<=1 U p53<=p30] & ~ [p46<=p7]]]]]]]]
normalized: [EX [[p9<=p51 | [[~ [[~ [p46<=p7] & E [p9<=1 U p53<=p30]]] & ~ [[~ [E [true U ~ [p22<=p33]]] | ~ [p41<=1]]]] | [E [true U [1<=p15 & p0<=p54]] | ~ [EG [1<=p31]]]]]] | EX [p1<=0]]
abstracting: (p1<=0)
states: 852
.abstracting: (1<=p31)
states: 125
..
EG iterations: 2
abstracting: (p0<=p54)
states: 976
abstracting: (1<=p15)
states: 125
abstracting: (p41<=1)
states: 977
abstracting: (p22<=p33)
states: 976
abstracting: (p53<=p30)
states: 976
abstracting: (p9<=1)
states: 977
abstracting: (p46<=p7)
states: 852
abstracting: (p9<=p51)
states: 976
.-> the formula is TRUE
FORMULA StigmergyElection-PT-04a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: ~ [E [~ [[[AG [1<=p7] & ~ [[1<=p19 & p45<=1]]] & ~ [E [p25<=p37 U 1<=p17]]]] U [E [[[[p1<=p29 & 1<=p25] & ~ [p6<=p42]] & A [1<=p16 U p12<=p7]] U ~ [1<=p11]] | [p47<=p20 | [E [AF [1<=p46] U AX [1<=p4]] | EF [[1<=p33 | 1<=p12]]]]]]]
normalized: ~ [E [~ [[~ [E [p25<=p37 U 1<=p17]] & [~ [[1<=p19 & p45<=1]] & ~ [E [true U ~ [1<=p7]]]]]] U [[p47<=p20 | [E [true U [1<=p33 | 1<=p12]] | E [~ [EG [~ [1<=p46]]] U ~ [EX [~ [1<=p4]]]]]] | E [[[~ [EG [~ [p12<=p7]]] & ~ [E [~ [p12<=p7] U [~ [1<=p16] & ~ [p12<=p7]]]]] & [~ [p6<=p42] & [p1<=p29 & 1<=p25]]] U ~ [1<=p11]]]]]
abstracting: (1<=p11)
states: 1
abstracting: (1<=p25)
states: 1
abstracting: (p1<=p29)
states: 877
abstracting: (p6<=p42)
states: 913
abstracting: (p12<=p7)
states: 751
abstracting: (1<=p16)
states: 125
abstracting: (p12<=p7)
states: 751
abstracting: (p12<=p7)
states: 751
.
EG iterations: 1
abstracting: (1<=p4)
states: 125
.abstracting: (1<=p46)
states: 125
.
EG iterations: 1
abstracting: (1<=p12)
states: 226
abstracting: (1<=p33)
states: 64
abstracting: (p47<=p20)
states: 929
abstracting: (1<=p7)
states: 64
abstracting: (p45<=1)
states: 977
abstracting: (1<=p19)
states: 64
abstracting: (1<=p17)
states: 125
abstracting: (p25<=p37)
states: 976
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.049sec
checking: [[A [~ [[AG [AF [1<=p21]] | E [EX [p29<=p53] U [p23<=p2 & p15<=1]]]] U 1<=p27] & E [AF [~ [p53<=p35]] U AG [[[[p24<=1 | p49<=1] & [p55<=1 & 1<=p0]] & EG [p25<=p37]]]]] & E [AF [~ [AG [~ [1<=p41]]]] U [E [1<=p37 U AX [~ [p16<=p8]]] | A [~ [p46<=p11] U 1<=p36]]]]
normalized: [E [~ [EG [~ [E [true U 1<=p41]]]] U [[~ [EG [~ [1<=p36]]] & ~ [E [~ [1<=p36] U [p46<=p11 & ~ [1<=p36]]]]] | E [1<=p37 U ~ [EX [p16<=p8]]]]] & [E [~ [EG [p53<=p35]] U ~ [E [true U ~ [[EG [p25<=p37] & [[p55<=1 & 1<=p0] & [p24<=1 | p49<=1]]]]]]] & [~ [EG [~ [1<=p27]]] & ~ [E [~ [1<=p27] U [[E [EX [p29<=p53] U [p23<=p2 & p15<=1]] | ~ [E [true U EG [~ [1<=p21]]]]] & ~ [1<=p27]]]]]]]
abstracting: (1<=p27)
states: 27
abstracting: (1<=p21)
states: 64
.
EG iterations: 1
abstracting: (p15<=1)
states: 977
abstracting: (p23<=p2)
states: 976
abstracting: (p29<=p53)
states: 852
.abstracting: (1<=p27)
states: 27
abstracting: (1<=p27)
states: 27
.........
EG iterations: 9
abstracting: (p49<=1)
states: 977
abstracting: (p24<=1)
states: 977
abstracting: (1<=p0)
states: 1
abstracting: (p55<=1)
states: 977
abstracting: (p25<=p37)
states: 976
.
EG iterations: 1
abstracting: (p53<=p35)
states: 976
.
EG iterations: 1
abstracting: (p16<=p8)
states: 852
.abstracting: (1<=p37)
states: 1
abstracting: (1<=p36)
states: 1
abstracting: (p46<=p11)
states: 852
abstracting: (1<=p36)
states: 1
abstracting: (1<=p36)
states: 1
.
EG iterations: 1
abstracting: (1<=p41)
states: 27
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: [A [[[AX [~ [p23<=0]] | ~ [[p56<=p43 | p38<=p29]]] & EX [AG [p22<=1]]] U [[EX [~ [AG [p0<=p38]]] | A [AX [1<=p30] U p3<=p25]] & E [E [AF [p8<=0] U [p10<=p12 | p26<=p3]] U ~ [p14<=1]]]] & A [[[[A [~ [p45<=p25] U [p23<=1 & p18<=1]] & [EG [p51<=1] & ~ [EF [p42<=p31]]]] & A [[EX [p27<=p11] & ~ [p52<=p19]] U [[p36<=0 & 1<=p47] & [p42<=p34 | p41<=1]]]] & AX [[[EX [p4<=p42] & [p34<=p39 & p56<=p57]] | AG [1<=p14]]]] U ~ [EX [[[1<=p26 & [p10<=0 & p6<=p24]] | EG [1<=p31]]]]]]
normalized: [[~ [EG [EX [[EG [1<=p31] | [1<=p26 & [p10<=0 & p6<=p24]]]]]] & ~ [E [EX [[EG [1<=p31] | [1<=p26 & [p10<=0 & p6<=p24]]]] U [~ [[~ [EX [~ [[~ [E [true U ~ [1<=p14]]] | [[p34<=p39 & p56<=p57] & EX [p4<=p42]]]]]] & [[~ [EG [~ [[[p42<=p34 | p41<=1] & [p36<=0 & 1<=p47]]]]] & ~ [E [~ [[[p42<=p34 | p41<=1] & [p36<=0 & 1<=p47]]] U [~ [[~ [p52<=p19] & EX [p27<=p11]]] & ~ [[[p42<=p34 | p41<=1] & [p36<=0 & 1<=p47]]]]]]] & [[~ [E [true U p42<=p31]] & EG [p51<=1]] & [~ [EG [~ [[p23<=1 & p18<=1]]]] & ~ [E [~ [[p23<=1 & p18<=1]] U [p45<=p25 & ~ [[p23<=1 & p18<=1]]]]]]]]]] & EX [[EG [1<=p31] | [1<=p26 & [p10<=0 & p6<=p24]]]]]]]] & [~ [EG [~ [[E [E [~ [EG [~ [p8<=0]]] U [p10<=p12 | p26<=p3]] U ~ [p14<=1]] & [[~ [EG [~ [p3<=p25]]] & ~ [E [~ [p3<=p25] U [EX [~ [1<=p30]] & ~ [p3<=p25]]]]] | EX [E [true U ~ [p0<=p38]]]]]]]] & ~ [E [~ [[E [E [~ [EG [~ [p8<=0]]] U [p10<=p12 | p26<=p3]] U ~ [p14<=1]] & [[~ [EG [~ [p3<=p25]]] & ~ [E [~ [p3<=p25] U [EX [~ [1<=p30]] & ~ [p3<=p25]]]]] | EX [E [true U ~ [p0<=p38]]]]]] U [~ [[EX [~ [E [true U ~ [p22<=1]]]] & [~ [[p56<=p43 | p38<=p29]] | ~ [EX [p23<=0]]]]] & ~ [[E [E [~ [EG [~ [p8<=0]]] U [p10<=p12 | p26<=p3]] U ~ [p14<=1]] & [[~ [EG [~ [p3<=p25]]] & ~ [E [~ [p3<=p25] U [EX [~ [1<=p30]] & ~ [p3<=p25]]]]] | EX [E [true U ~ [p0<=p38]]]]]]]]]]]
abstracting: (p0<=p38)
states: 976
.abstracting: (p3<=p25)
states: 852
abstracting: (1<=p30)
states: 125
.abstracting: (p3<=p25)
states: 852
abstracting: (p3<=p25)
states: 852
..
EG iterations: 2
abstracting: (p14<=1)
states: 977
abstracting: (p26<=p3)
states: 776
abstracting: (p10<=p12)
states: 976
abstracting: (p8<=0)
states: 976
.
EG iterations: 1
abstracting: (p23<=0)
states: 976
.abstracting: (p38<=p29)
states: 976
abstracting: (p56<=p43)
states: 950
abstracting: (p22<=1)
states: 977
.abstracting: (p0<=p38)
states: 976
.abstracting: (p3<=p25)
states: 852
abstracting: (1<=p30)
states: 125
.abstracting: (p3<=p25)
states: 852
abstracting: (p3<=p25)
states: 852
..
EG iterations: 2
abstracting: (p14<=1)
states: 977
abstracting: (p26<=p3)
states: 776
abstracting: (p10<=p12)
states: 976
abstracting: (p8<=0)
states: 976
.
EG iterations: 1
abstracting: (p0<=p38)
states: 976
.abstracting: (p3<=p25)
states: 852
abstracting: (1<=p30)
states: 125
.abstracting: (p3<=p25)
states: 852
abstracting: (p3<=p25)
states: 852
..
EG iterations: 2
abstracting: (p14<=1)
states: 977
abstracting: (p26<=p3)
states: 776
abstracting: (p10<=p12)
states: 976
abstracting: (p8<=0)
states: 976
.
EG iterations: 1
EG iterations: 0
abstracting: (p6<=p24)
states: 913
abstracting: (p10<=0)
states: 976
abstracting: (1<=p26)
states: 226
abstracting: (1<=p31)
states: 125
..
EG iterations: 2
.abstracting: (p18<=1)
states: 977
abstracting: (p23<=1)
states: 977
abstracting: (p45<=p25)
states: 852
abstracting: (p18<=1)
states: 977
abstracting: (p23<=1)
states: 977
abstracting: (p18<=1)
states: 977
abstracting: (p23<=1)
states: 977
.
EG iterations: 1
abstracting: (p51<=1)
states: 977
EG iterations: 0
abstracting: (p42<=p31)
states: 950
abstracting: (1<=p47)
states: 64
abstracting: (p36<=0)
states: 976
abstracting: (p41<=1)
states: 977
abstracting: (p42<=p34)
states: 950
abstracting: (p27<=p11)
states: 950
.abstracting: (p52<=p19)
states: 976
abstracting: (1<=p47)
states: 64
abstracting: (p36<=0)
states: 976
abstracting: (p41<=1)
states: 977
abstracting: (p42<=p34)
states: 950
abstracting: (1<=p47)
states: 64
abstracting: (p36<=0)
states: 976
abstracting: (p41<=1)
states: 977
abstracting: (p42<=p34)
states: 950
.
EG iterations: 1
abstracting: (p4<=p42)
states: 852
.abstracting: (p56<=p57)
states: 977
abstracting: (p34<=p39)
states: 913
abstracting: (1<=p14)
states: 27
.abstracting: (p6<=p24)
states: 913
abstracting: (p10<=0)
states: 976
abstracting: (1<=p26)
states: 226
abstracting: (1<=p31)
states: 125
..
EG iterations: 2
.abstracting: (p6<=p24)
states: 913
abstracting: (p10<=0)
states: 976
abstracting: (1<=p26)
states: 226
abstracting: (1<=p31)
states: 125
..
EG iterations: 2
..
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-04a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.071sec
totally nodes used: 219119 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 332887 961398 1294285
used/not used/entry size/cache size: 1147487 65961377 16 1024MB
basic ops cache: hits/miss/sum: 98300 241239 339539
used/not used/entry size/cache size: 343275 16433941 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: 3169 9709 12878
used/not used/entry size/cache size: 9709 8378899 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 66902277
1 195186
2 10363
3 953
4 77
5 8
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.736sec
BK_STOP 1679388265815
--------------------
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:5002 (22), effective:97 (0)
initing FirstDep: 0m 0.000sec
iterations count:225 (1), effective:1 (0)
iterations count:2323 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:2323 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:2323 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:219 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:283 (1), effective:1 (0)
iterations count:2263 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:263 (1), effective:1 (0)
iterations count:2678 (12), effective:61 (0)
iterations count:219 (1), effective:1 (0)
iterations count:2188 (10), effective:49 (0)
iterations count:219 (1), effective:1 (0)
iterations count:2188 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:219 (1), effective:1 (0)
iterations count:2188 (10), effective:49 (0)
iterations count:2313 (10), effective:49 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:265 (1), effective:1 (0)
iterations count:233 (1), effective:2 (0)
iterations count:218 (1), effective:0 (0)
iterations count:311 (1), effective:3 (0)
iterations count:218 (1), effective:0 (0)
iterations count:2270 (10), effective:49 (0)
iterations count:219 (1), effective:1 (0)
iterations count:219 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:2224 (10), effective:49 (0)
iterations count:2323 (10), effective:50 (0)
iterations count:220 (1), effective:1 (0)
iterations count:233 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:941 (4), effective:15 (0)
iterations count:384 (1), effective:1 (0)
iterations count:2282 (10), effective:48 (0)
iterations count:218 (1), effective:0 (0)
iterations count:364 (1), effective:1 (0)
iterations count:266 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:232 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:261 (1), effective:1 (0)
iterations count:233 (1), effective:2 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:229 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:229 (1), effective:1 (0)
iterations count:227 (1), effective:1 (0)
iterations count:218 (1), effective:0 (0)
iterations count:218 (1), effective:0 (0)
iterations count:229 (1), effective:1 (0)
iterations count:219 (1), effective:1 (0)
iterations count:223 (1), effective:1 (0)
iterations count:219 (1), effective:1 (0)
iterations count:218 (1), effective:0 (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="StigmergyElection-PT-04a"
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 StigmergyElection-PT-04a, 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-167912641700585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-04a.tgz
mv StigmergyElection-PT-04a 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 ;