About the Execution of Marcie for ShieldPPPt-PT-004A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5679.836 | 8219.00 | 8059.00 | 0.00 | TTFFTFTFTFTFFTFT | 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.r385-oct2-167903710200577.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPt-PT-004A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903710200577
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 20:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 20:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 20:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Feb 25 20:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 27K 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 ShieldPPPt-PT-004A-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-004A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679049256069
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=ShieldPPPt-PT-004A
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: ShieldPPPt_PT_004A
(NrP: 103 NrTr: 75 NrArc: 294)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.522sec
RS generation: 0m 0.067sec
-> reachability set: #nodes 309 (3.1e+02) #states 512,000,000,000,001 (14)
starting MCC model checker
--------------------------
checking: EF [EG [1<=p59]]
normalized: E [true U EG [1<=p59]]
abstracting: (1<=p59)
states: 204,800,000,000,000 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: EG [EG [~ [EF [~ [[p99<=0 | p46<=1]]]]]]
normalized: EG [EG [~ [E [true U ~ [[p99<=0 | p46<=1]]]]]]
abstracting: (p46<=1)
states: 512,000,000,000,001 (14)
abstracting: (p99<=0)
states: 256,000,000,000,001 (14)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [EF [AX [[AG [~ [1<=p77]] & EF [A [1<=p3 U 1<=p48]]]]]]
normalized: ~ [E [true U ~ [EX [~ [[E [true U [~ [EG [~ [1<=p48]]] & ~ [E [~ [1<=p48] U [~ [1<=p3] & ~ [1<=p48]]]]]] & ~ [E [true U 1<=p77]]]]]]]]
abstracting: (1<=p77)
states: 256,000,000,000,000 (14)
abstracting: (1<=p48)
states: 256,000,000,000,000 (14)
abstracting: (1<=p3)
states: 256,000,000,000,000 (14)
abstracting: (1<=p48)
states: 256,000,000,000,000 (14)
abstracting: (1<=p48)
states: 256,000,000,000,000 (14)
..
EG iterations: 2
.-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: EF [~ [[[[~ [EX [1<=p91]] | EX [p52<=1]] & 1<=p91] | EF [1<=p20]]]]
normalized: E [true U ~ [[E [true U 1<=p20] | [[EX [p52<=1] | ~ [EX [1<=p91]]] & 1<=p91]]]]
abstracting: (1<=p91)
states: 204,800,000,000,000 (14)
abstracting: (1<=p91)
states: 204,800,000,000,000 (14)
.abstracting: (p52<=1)
states: 512,000,000,000,001 (14)
.abstracting: (1<=p20)
states: 256,000,000,000,000 (14)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: ~ [EX [[~ [[A [1<=p56 U p37<=0] & 1<=p47]] & EF [A [p49<=p11 U p84<=0]]]]]
normalized: ~ [EX [[E [true U [~ [EG [~ [p84<=0]]] & ~ [E [~ [p84<=0] U [~ [p49<=p11] & ~ [p84<=0]]]]]] & ~ [[1<=p47 & [~ [EG [~ [p37<=0]]] & ~ [E [~ [p37<=0] U [~ [1<=p56] & ~ [p37<=0]]]]]]]]]]
abstracting: (p37<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p56)
states: 204,800,000,000,000 (14)
abstracting: (p37<=0)
states: 307,200,000,000,001 (14)
abstracting: (p37<=0)
states: 307,200,000,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p47)
states: 256,000,000,000,000 (14)
abstracting: (p84<=0)
states: 307,200,000,000,001 (14)
abstracting: (p49<=p11)
states: 358,400,000,000,001 (14)
abstracting: (p84<=0)
states: 307,200,000,000,001 (14)
abstracting: (p84<=0)
states: 307,200,000,000,001 (14)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: EF [[[EX [~ [[EG [p56<=p93] & p67<=0]]] & p90<=p94] & EF [AF [[AX [1<=p64] & [1<=p1 & 1<=p85]]]]]]
normalized: E [true U [E [true U ~ [EG [~ [[[1<=p1 & 1<=p85] & ~ [EX [~ [1<=p64]]]]]]]] & [p90<=p94 & EX [~ [[p67<=0 & EG [p56<=p93]]]]]]]
abstracting: (p56<=p93)
states: 389,120,000,000,001 (14)
.
EG iterations: 1
abstracting: (p67<=0)
states: 307,200,000,000,001 (14)
.abstracting: (p90<=p94)
states: 409,600,000,000,001 (14)
abstracting: (1<=p64)
states: 204,800,000,000,000 (14)
.abstracting: (1<=p85)
states: 102,400,000,000,000 (14)
abstracting: (1<=p1)
states: 256,000,000,000,000 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: [EG [~ [EX [[[1<=p67 | p101<=0] & p38<=1]]]] | AF [AG [AG [[[1<=p34 & p67<=1] & [1<=p24 & p34<=p63]]]]]]
normalized: [~ [EG [E [true U E [true U ~ [[[1<=p24 & p34<=p63] & [1<=p34 & p67<=1]]]]]]] | EG [~ [EX [[p38<=1 & [1<=p67 | p101<=0]]]]]]
abstracting: (p101<=0)
states: 256,000,000,000,001 (14)
abstracting: (1<=p67)
states: 204,800,000,000,000 (14)
abstracting: (p38<=1)
states: 512,000,000,000,001 (14)
...
EG iterations: 2
abstracting: (p67<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p34)
states: 204,800,000,000,000 (14)
abstracting: (p34<=p63)
states: 389,120,000,000,001 (14)
abstracting: (1<=p24)
states: 256,000,000,000,000 (14)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EG [E [[AG [[~ [p58<=p64] & ~ [1<=p31]]] | p29<=1] U [EG [[[1<=p57 | p75<=1] & [1<=p75 & p56<=0]]] & AF [EX [1<=p59]]]]]
normalized: EG [E [[p29<=1 | ~ [E [true U ~ [[~ [1<=p31] & ~ [p58<=p64]]]]]] U [~ [EG [~ [EX [1<=p59]]]] & EG [[[1<=p75 & p56<=0] & [1<=p57 | p75<=1]]]]]]
abstracting: (p75<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p57)
states: 204,800,000,000,000 (14)
abstracting: (p56<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p75)
states: 256,000,000,000,000 (14)
.
EG iterations: 1
abstracting: (1<=p59)
states: 204,800,000,000,000 (14)
..
EG iterations: 1
abstracting: (p58<=p64)
states: 389,120,000,000,001 (14)
abstracting: (1<=p31)
states: 204,800,000,000,000 (14)
abstracting: (p29<=1)
states: 512,000,000,000,001 (14)
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: EX [E [~ [AF [p40<=0]] U [~ [E [1<=p20 U p81<=1]] | [AF [AX [p49<=p87]] & ~ [[A [p74<=1 U p2<=0] & EF [p100<=p48]]]]]]]
normalized: EX [E [EG [~ [p40<=0]] U [[~ [[E [true U p100<=p48] & [~ [EG [~ [p2<=0]]] & ~ [E [~ [p2<=0] U [~ [p74<=1] & ~ [p2<=0]]]]]]] & ~ [EG [EX [~ [p49<=p87]]]]] | ~ [E [1<=p20 U p81<=1]]]]]
abstracting: (p81<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p20)
states: 256,000,000,000,000 (14)
abstracting: (p49<=p87)
states: 358,400,000,000,001 (14)
..
EG iterations: 1
abstracting: (p2<=0)
states: 256,000,000,000,001 (14)
abstracting: (p74<=1)
states: 512,000,000,000,001 (14)
abstracting: (p2<=0)
states: 256,000,000,000,001 (14)
abstracting: (p2<=0)
states: 256,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p100<=p48)
states: 384,000,000,000,001 (14)
abstracting: (p40<=0)
states: 409,600,000,000,001 (14)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: [~ [[AG [[EX [EF [p96<=1]] & p4<=1]] | AF [AG [1<=p91]]]] & ~ [[EX [A [[EF [p100<=p22] | [p86<=0 | p87<=1]] U AX [1<=p74]]] & AX [AX [~ [1<=p46]]]]]]
normalized: [~ [[~ [EX [EX [1<=p46]]] & EX [[~ [EG [EX [~ [1<=p74]]]] & ~ [E [EX [~ [1<=p74]] U [~ [[[p86<=0 | p87<=1] | E [true U p100<=p22]]] & EX [~ [1<=p74]]]]]]]]] & ~ [[~ [EG [E [true U ~ [1<=p91]]]] | ~ [E [true U ~ [[p4<=1 & EX [E [true U p96<=1]]]]]]]]]
abstracting: (p96<=1)
states: 512,000,000,000,001 (14)
.abstracting: (p4<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p91)
states: 204,800,000,000,000 (14)
EG iterations: 0
abstracting: (1<=p74)
states: 256,000,000,000,000 (14)
.abstracting: (p100<=p22)
states: 384,000,000,000,001 (14)
abstracting: (p87<=1)
states: 512,000,000,000,001 (14)
abstracting: (p86<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p74)
states: 256,000,000,000,000 (14)
.abstracting: (1<=p74)
states: 256,000,000,000,000 (14)
.
EG iterations: 0
.abstracting: (1<=p46)
states: 256,000,000,000,000 (14)
..-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: ~ [EG [[[[1<=p27 & ~ [[[p49<=0 & p93<=0] | p25<=p52]]] & A [EX [p80<=p26] U 1<=p95]] & p0<=0]]]
normalized: ~ [EG [[p0<=0 & [[~ [EG [~ [1<=p95]]] & ~ [E [~ [1<=p95] U [~ [EX [p80<=p26]] & ~ [1<=p95]]]]] & [1<=p27 & ~ [[p25<=p52 | [p49<=0 & p93<=0]]]]]]]]
abstracting: (p93<=0)
states: 307,200,000,000,001 (14)
abstracting: (p49<=0)
states: 256,000,000,000,001 (14)
abstracting: (p25<=p52)
states: 384,000,000,000,001 (14)
abstracting: (1<=p27)
states: 256,000,000,000,000 (14)
abstracting: (1<=p95)
states: 256,000,000,000,000 (14)
abstracting: (p80<=p26)
states: 460,800,000,000,001 (14)
.abstracting: (1<=p95)
states: 256,000,000,000,000 (14)
abstracting: (1<=p95)
states: 256,000,000,000,000 (14)
.
EG iterations: 1
abstracting: (p0<=0)
states: 512,000,000,000,000 (14)
............................................................................................................................................................................................
EG iterations: 188
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.035sec
checking: EX [AG [[1<=p85 | [[E [p37<=p22 U p90<=p59] & AF [p69<=0]] & A [[p14<=0 | p44<=0] U E [p86<=1 U p44<=0]]]]]]
normalized: EX [~ [E [true U ~ [[1<=p85 | [[E [p37<=p22 U p90<=p59] & ~ [EG [~ [p69<=0]]]] & [~ [E [~ [E [p86<=1 U p44<=0]] U [~ [E [p86<=1 U p44<=0]] & ~ [[p14<=0 | p44<=0]]]]] & ~ [EG [~ [E [p86<=1 U p44<=0]]]]]]]]]]]
abstracting: (p44<=0)
states: 307,200,000,000,001 (14)
abstracting: (p86<=1)
states: 512,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p44<=0)
states: 307,200,000,000,001 (14)
abstracting: (p14<=0)
states: 307,200,000,000,001 (14)
abstracting: (p44<=0)
states: 307,200,000,000,001 (14)
abstracting: (p86<=1)
states: 512,000,000,000,001 (14)
abstracting: (p44<=0)
states: 307,200,000,000,001 (14)
abstracting: (p86<=1)
states: 512,000,000,000,001 (14)
abstracting: (p69<=0)
states: 307,200,000,000,001 (14)
.
EG iterations: 1
abstracting: (p90<=p59)
states: 450,560,000,000,001 (14)
abstracting: (p37<=p22)
states: 409,600,000,000,001 (14)
abstracting: (1<=p85)
states: 102,400,000,000,000 (14)
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: EG [[p16<=p90 & E [[[[1<=p100 & ~ [p4<=1]] | E [p35<=0 U p60<=p52]] & AX [[p5<=0 | 1<=p30]]] U AF [EX [p52<=p48]]]]]
normalized: EG [[p16<=p90 & E [[~ [EX [~ [[p5<=0 | 1<=p30]]]] & [E [p35<=0 U p60<=p52] | [1<=p100 & ~ [p4<=1]]]] U ~ [EG [~ [EX [p52<=p48]]]]]]]
abstracting: (p52<=p48)
states: 384,000,000,000,001 (14)
..
EG iterations: 1
abstracting: (p4<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p100)
states: 256,000,000,000,000 (14)
abstracting: (p60<=p52)
states: 460,800,000,000,001 (14)
abstracting: (p35<=0)
states: 409,600,000,000,001 (14)
abstracting: (1<=p30)
states: 102,400,000,000,000 (14)
abstracting: (p5<=0)
states: 409,600,000,000,001 (14)
.abstracting: (p16<=p90)
states: 348,160,000,000,001 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AF [AG [[[A [~ [1<=p99] U [p12<=p55 & p17<=p40]] & p8<=p21] | EF [[E [1<=p20 U 1<=p84] | [p59<=p41 & 1<=p72]]]]]]
normalized: ~ [EG [E [true U ~ [[E [true U [[p59<=p41 & 1<=p72] | E [1<=p20 U 1<=p84]]] | [p8<=p21 & [~ [EG [~ [[p12<=p55 & p17<=p40]]]] & ~ [E [~ [[p12<=p55 & p17<=p40]] U [1<=p99 & ~ [[p12<=p55 & p17<=p40]]]]]]]]]]]]
abstracting: (p17<=p40)
states: 348,160,000,000,001 (14)
abstracting: (p12<=p55)
states: 348,160,000,000,001 (14)
abstracting: (1<=p99)
states: 256,000,000,000,000 (14)
abstracting: (p17<=p40)
states: 348,160,000,000,001 (14)
abstracting: (p12<=p55)
states: 348,160,000,000,001 (14)
abstracting: (p17<=p40)
states: 348,160,000,000,001 (14)
abstracting: (p12<=p55)
states: 348,160,000,000,001 (14)
.
EG iterations: 1
abstracting: (p8<=p21)
states: 409,600,000,000,001 (14)
abstracting: (1<=p84)
states: 204,800,000,000,000 (14)
abstracting: (1<=p20)
states: 256,000,000,000,000 (14)
abstracting: (1<=p72)
states: 256,000,000,000,000 (14)
abstracting: (p59<=p41)
states: 389,120,000,000,001 (14)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: A [[[~ [EX [EF [p89<=0]]] & AF [[~ [AX [1<=p64]] & [[p18<=p70 | p52<=0] | [p10<=p88 | p6<=p45]]]]] & AX [AF [1<=p30]]] U EF [[AG [p76<=p71] & 1<=p76]]]
normalized: [~ [EG [~ [E [true U [1<=p76 & ~ [E [true U ~ [p76<=p71]]]]]]]] & ~ [E [~ [E [true U [1<=p76 & ~ [E [true U ~ [p76<=p71]]]]]] U [~ [[~ [EX [EG [~ [1<=p30]]]] & [~ [EG [~ [[[[p10<=p88 | p6<=p45] | [p18<=p70 | p52<=0]] & EX [~ [1<=p64]]]]]] & ~ [EX [E [true U p89<=0]]]]]] & ~ [E [true U [1<=p76 & ~ [E [true U ~ [p76<=p71]]]]]]]]]]
abstracting: (p76<=p71)
states: 384,000,000,000,001 (14)
abstracting: (1<=p76)
states: 256,000,000,000,000 (14)
abstracting: (p89<=0)
states: 307,200,000,000,001 (14)
.abstracting: (1<=p64)
states: 204,800,000,000,000 (14)
.abstracting: (p52<=0)
states: 256,000,000,000,001 (14)
abstracting: (p18<=p70)
states: 409,600,000,000,001 (14)
abstracting: (p6<=p45)
states: 409,600,000,000,001 (14)
abstracting: (p10<=p88)
states: 450,560,000,000,001 (14)
.
EG iterations: 1
abstracting: (1<=p30)
states: 102,400,000,000,000 (14)
..
EG iterations: 2
.abstracting: (p76<=p71)
states: 384,000,000,000,001 (14)
abstracting: (1<=p76)
states: 256,000,000,000,000 (14)
abstracting: (p76<=p71)
states: 384,000,000,000,001 (14)
abstracting: (1<=p76)
states: 256,000,000,000,000 (14)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.021sec
checking: ~ [A [A [1<=p60 U [[[~ [1<=p44] | [p17<=p66 | p77<=p14]] | [1<=p93 & AG [p16<=0]]] & ~ [[[p68<=0 & p28<=1] & ~ [p89<=1]]]]] U [AG [~ [AF [p71<=1]]] | [A [1<=p21 U [AX [p90<=p88] & p20<=p93]] & [AF [~ [p48<=1]] | AX [1<=p53]]]]]]
normalized: ~ [[~ [EG [~ [[[[~ [EX [~ [1<=p53]]] | ~ [EG [p48<=1]]] & [~ [EG [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]] & ~ [E [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]] U [~ [1<=p21] & ~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]]]]] | ~ [E [true U ~ [EG [~ [p71<=1]]]]]]]]] & ~ [E [~ [[[[~ [EX [~ [1<=p53]]] | ~ [EG [p48<=1]]] & [~ [EG [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]] & ~ [E [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]] U [~ [1<=p21] & ~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]]]]] | ~ [E [true U ~ [EG [~ [p71<=1]]]]]]] U [~ [[~ [EG [~ [[~ [[~ [p89<=1] & [p68<=0 & p28<=1]]] & [[1<=p93 & ~ [E [true U ~ [p16<=0]]]] | [[p17<=p66 | p77<=p14] | ~ [1<=p44]]]]]]] & ~ [E [~ [[~ [[~ [p89<=1] & [p68<=0 & p28<=1]]] & [[1<=p93 & ~ [E [true U ~ [p16<=0]]]] | [[p17<=p66 | p77<=p14] | ~ [1<=p44]]]]] U [~ [1<=p60] & ~ [[~ [[~ [p89<=1] & [p68<=0 & p28<=1]]] & [[1<=p93 & ~ [E [true U ~ [p16<=0]]]] | [[p17<=p66 | p77<=p14] | ~ [1<=p44]]]]]]]]]] & ~ [[[[~ [EX [~ [1<=p53]]] | ~ [EG [p48<=1]]] & [~ [EG [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]] & ~ [E [~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]] U [~ [1<=p21] & ~ [[p20<=p93 & ~ [EX [~ [p90<=p88]]]]]]]]]] | ~ [E [true U ~ [EG [~ [p71<=1]]]]]]]]]]]]
abstracting: (p71<=1)
states: 512,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (1<=p21)
states: 256,000,000,000,000 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
..................
EG iterations: 18
abstracting: (p48<=1)
states: 512,000,000,000,001 (14)
EG iterations: 0
abstracting: (1<=p53)
states: 256,000,000,000,000 (14)
.abstracting: (1<=p44)
states: 204,800,000,000,000 (14)
abstracting: (p77<=p14)
states: 358,400,000,000,001 (14)
abstracting: (p17<=p66)
states: 389,120,000,000,001 (14)
abstracting: (p16<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p93)
states: 204,800,000,000,000 (14)
abstracting: (p28<=1)
states: 512,000,000,000,001 (14)
abstracting: (p68<=0)
states: 307,200,000,000,001 (14)
abstracting: (p89<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p60)
states: 102,400,000,000,000 (14)
abstracting: (1<=p44)
states: 204,800,000,000,000 (14)
abstracting: (p77<=p14)
states: 358,400,000,000,001 (14)
abstracting: (p17<=p66)
states: 389,120,000,000,001 (14)
abstracting: (p16<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p93)
states: 204,800,000,000,000 (14)
abstracting: (p28<=1)
states: 512,000,000,000,001 (14)
abstracting: (p68<=0)
states: 307,200,000,000,001 (14)
abstracting: (p89<=1)
states: 512,000,000,000,001 (14)
abstracting: (1<=p44)
states: 204,800,000,000,000 (14)
abstracting: (p77<=p14)
states: 358,400,000,000,001 (14)
abstracting: (p17<=p66)
states: 389,120,000,000,001 (14)
abstracting: (p16<=0)
states: 307,200,000,000,001 (14)
abstracting: (1<=p93)
states: 204,800,000,000,000 (14)
abstracting: (p28<=1)
states: 512,000,000,000,001 (14)
abstracting: (p68<=0)
states: 307,200,000,000,001 (14)
abstracting: (p89<=1)
states: 512,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p71<=1)
states: 512,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (1<=p21)
states: 256,000,000,000,000 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
..................
EG iterations: 18
abstracting: (p48<=1)
states: 512,000,000,000,001 (14)
EG iterations: 0
abstracting: (1<=p53)
states: 256,000,000,000,000 (14)
.abstracting: (p71<=1)
states: 512,000,000,000,001 (14)
.
EG iterations: 1
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (1<=p21)
states: 256,000,000,000,000 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
abstracting: (p90<=p88)
states: 450,560,000,000,001 (14)
.abstracting: (p20<=p93)
states: 358,400,000,000,001 (14)
..................
EG iterations: 18
abstracting: (p48<=1)
states: 512,000,000,000,001 (14)
EG iterations: 0
abstracting: (1<=p53)
states: 256,000,000,000,000 (14)
...
EG iterations: 2
-> the formula is FALSE
FORMULA ShieldPPPt-PT-004A-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.207sec
totally nodes used: 3457396 (3.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1814162 5428433 7242595
used/not used/entry size/cache size: 8224125 58884739 16 1024MB
basic ops cache: hits/miss/sum: 340127 894122 1234249
used/not used/entry size/cache size: 1527052 15250164 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: 3176 9218 12394
used/not used/entry size/cache size: 9213 8379395 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 63894662
1 2992752
2 201411
3 18443
4 1491
5 101
6 4
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 8.163sec
BK_STOP 1679049264288
--------------------
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:5651 (75), effective:1053 (14)
initing FirstDep: 0m 0.000sec
iterations count:223 (2), effective:16 (0)
iterations count:196 (2), effective:13 (0)
iterations count:245 (3), effective:33 (0)
iterations count:273 (3), effective:27 (0)
iterations count:474 (6), effective:66 (0)
iterations count:112 (1), effective:7 (0)
iterations count:353 (4), effective:55 (0)
iterations count:84 (1), effective:3 (0)
iterations count:518 (6), effective:80 (1)
iterations count:210 (2), effective:16 (0)
iterations count:136 (1), effective:13 (0)
iterations count:75 (1), effective:0 (0)
iterations count:87 (1), effective:2 (0)
iterations count:251 (3), effective:22 (0)
iterations count:75 (1), effective:0 (0)
iterations count:99 (1), effective:5 (0)
iterations count:638 (8), effective:96 (1)
iterations count:75 (1), effective:0 (0)
iterations count:80 (1), effective:2 (0)
iterations count:99 (1), effective:5 (0)
iterations count:168 (2), effective:27 (0)
iterations count:223 (2), effective:30 (0)
iterations count:223 (2), effective:30 (0)
iterations count:223 (2), effective:30 (0)
iterations count:77 (1), effective:1 (0)
iterations count:398 (5), effective:49 (0)
iterations count:98 (1), effective:8 (0)
iterations count:75 (1), effective:0 (0)
iterations count:99 (1), effective:5 (0)
iterations count:124 (1), effective:11 (0)
iterations count:195 (2), effective:12 (0)
iterations count:327 (4), effective:36 (0)
iterations count:87 (1), effective:3 (0)
iterations count:327 (4), effective:36 (0)
iterations count:75 (1), effective:0 (0)
iterations count:327 (4), effective:36 (0)
iterations count:75 (1), effective:0 (0)
iterations count:691 (9), effective:112 (1)
iterations count:429 (5), effective:58 (0)
iterations count:429 (5), effective:58 (0)
iterations count:251 (3), effective:25 (0)
iterations count:429 (5), effective:58 (0)
iterations count:75 (1), effective:0 (0)
iterations count:691 (9), effective:112 (1)
iterations count:1206 (16), effective:221 (2)
iterations count:75 (1), effective:0 (0)
iterations count:691 (9), effective:112 (1)
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="ShieldPPPt-PT-004A"
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 ShieldPPPt-PT-004A, 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 r385-oct2-167903710200577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-004A.tgz
mv ShieldPPPt-PT-004A 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 ;