About the Execution of Marcie for UtahNoC-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6211.539 | 115087.00 | 115070.00 | 0.00 | FFFFFFTFTFTFTTTT | 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.r481-tall-167912692700945.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 UtahNoC-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692700945
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.9K Feb 26 04:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 04:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 04:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:24 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 205K 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 UtahNoC-PT-none-CTLCardinality-00
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-01
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-02
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-03
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-04
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-05
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-06
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-07
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-08
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-09
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-10
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-11
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-12
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-13
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-14
FORMULA_NAME UtahNoC-PT-none-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679874551828
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=UtahNoC-PT-none
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: UtahNoC_PT_none
(NrP: 216 NrTr: 977 NrArc: 2905)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec
net check time: 0m 0.000sec
init dd package: 0m 2.786sec
RS generation: 0m47.427sec
-> reachability set: #nodes 11093 (1.1e+04) #states 4,759,924,249 (9)
starting MCC model checker
--------------------------
checking: EF [~ [p153<=1]]
normalized: E [true U ~ [p153<=1]]
abstracting: (p153<=1)
states: 4,759,924,249 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EX [EX [AG [AG [[p118<=0 | p21<=1]]]]]
normalized: EX [EX [~ [E [true U E [true U ~ [[p118<=0 | p21<=1]]]]]]]
abstracting: (p21<=1)
states: 4,759,924,249 (9)
abstracting: (p118<=0)
states: 4,649,926,033 (9)
..-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.057sec
checking: AF [EX [[EF [A [1<=p100 U p52<=1]] & EF [AX [1<=p113]]]]]
normalized: ~ [EG [~ [EX [[E [true U [~ [EG [~ [p52<=1]]] & ~ [E [~ [p52<=1] U [~ [p52<=1] & ~ [1<=p100]]]]]] & E [true U ~ [EX [~ [1<=p113]]]]]]]]]
abstracting: (1<=p113)
states: 109,998,216 (8)
.abstracting: (1<=p100)
states: 111,545,928 (8)
abstracting: (p52<=1)
states: 4,759,924,249 (9)
abstracting: (p52<=1)
states: 4,759,924,249 (9)
abstracting: (p52<=1)
states: 4,759,924,249 (9)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.658sec
checking: EX [EX [EF [[[~ [p62<=1] | ~ [1<=p28]] & AX [1<=p164]]]]]
normalized: EX [EX [E [true U [~ [EX [~ [1<=p164]]] & [~ [1<=p28] | ~ [p62<=1]]]]]]
abstracting: (p62<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p28)
states: 109,998,216 (8)
abstracting: (1<=p164)
states: 165,416,184 (8)
...-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.746sec
checking: E [p156<=p111 U AF [EF [AG [[p195<=p111 | 1<=p177]]]]]
normalized: E [p156<=p111 U ~ [EG [~ [E [true U ~ [E [true U ~ [[p195<=p111 | 1<=p177]]]]]]]]]
abstracting: (1<=p177)
states: 162,320,760 (8)
abstracting: (p195<=p111)
states: 4,564,746,523 (9)
EG iterations: 0
abstracting: (p156<=p111)
states: 4,601,230,993 (9)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.812sec
checking: EF [AF [[p106<=0 & EX [[~ [p114<=1] & [p202<=p92 | 1<=p20]]]]]]
normalized: E [true U ~ [EG [~ [[EX [[[p202<=p92 | 1<=p20] & ~ [p114<=1]]] & p106<=0]]]]]
abstracting: (p106<=0)
states: 4,648,378,321 (9)
abstracting: (p114<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p20)
states: 111,545,928 (8)
abstracting: (p202<=p92)
states: 4,568,708,635 (9)
.
EG iterations: 0
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: E [[[p65<=1 | AX [~ [p2<=1]]] | AF [~ [1<=p165]]] U AG [AG [~ [[p72<=p94 & p200<=0]]]]]
normalized: E [[~ [EG [1<=p165]] | [p65<=1 | ~ [EX [p2<=1]]]] U ~ [E [true U E [true U [p72<=p94 & p200<=0]]]]]
abstracting: (p200<=0)
states: 4,560,120,664 (9)
abstracting: (p72<=p94)
states: 4,652,512,201 (9)
abstracting: (p2<=1)
states: 4,759,924,249 (9)
.abstracting: (p65<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p165)
states: 165,416,184 (8)
.
EG iterations: 1
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.759sec
checking: ~ [E [[~ [p65<=p195] | EX [p120<=p174]] U ~ [E [AF [AF [1<=p9]] U EG [[p4<=1 | p70<=1]]]]]]
normalized: ~ [E [[EX [p120<=p174] | ~ [p65<=p195]] U ~ [E [~ [EG [EG [~ [1<=p9]]]] U EG [[p4<=1 | p70<=1]]]]]]
abstracting: (p70<=1)
states: 4,759,924,249 (9)
abstracting: (p4<=1)
states: 4,759,924,249 (9)
EG iterations: 0
abstracting: (1<=p9)
states: 111,545,928 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p65<=p195)
states: 4,654,551,892 (9)
abstracting: (p120<=p174)
states: 4,653,782,137 (9)
.-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.934sec
checking: [EG [~ [AG [[~ [EF [1<=p15]] | [p65<=p178 & p108<=0]]]]] | EG [[EF [AX [[1<=p154 | p103<=p66]]] & AX [~ [p35<=0]]]]]
normalized: [EG [[~ [EX [p35<=0]] & E [true U ~ [EX [~ [[1<=p154 | p103<=p66]]]]]]] | EG [E [true U ~ [[[p65<=p178 & p108<=0] | ~ [E [true U 1<=p15]]]]]]]
abstracting: (1<=p15)
states: 111,545,928 (8)
abstracting: (p108<=0)
states: 4,649,926,033 (9)
abstracting: (p65<=p178)
states: 4,653,757,369 (9)
EG iterations: 0
abstracting: (p103<=p66)
states: 4,650,964,489 (9)
abstracting: (1<=p154)
states: 165,416,184 (8)
.abstracting: (p35<=0)
states: 4,649,926,033 (9)
..
EG iterations: 1
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.288sec
checking: AG [[~ [1<=p113] | EX [~ [[[~ [p67<=1] | ~ [p96<=p129]] | [~ [1<=p35] | [p63<=p103 & p45<=p15]]]]]]]
normalized: ~ [E [true U ~ [[EX [~ [[[[p63<=p103 & p45<=p15] | ~ [1<=p35]] | [~ [p96<=p129] | ~ [p67<=1]]]]] | ~ [1<=p113]]]]]
abstracting: (1<=p113)
states: 109,998,216 (8)
abstracting: (p67<=1)
states: 4,759,924,249 (9)
abstracting: (p96<=p129)
states: 4,648,378,321 (9)
abstracting: (1<=p35)
states: 109,998,216 (8)
abstracting: (p45<=p15)
states: 4,648,378,321 (9)
abstracting: (p63<=p103)
states: 4,650,982,057 (9)
.-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.172sec
checking: EF [AF [~ [[[[1<=p130 | p112<=0] & EG [p98<=1]] | [[p71<=1 & p105<=1] & [p172<=p114 & p52<=p181]]]]]]
normalized: E [true U ~ [EG [[[[p172<=p114 & p52<=p181] & [p71<=1 & p105<=1]] | [EG [p98<=1] & [1<=p130 | p112<=0]]]]]]
abstracting: (p112<=0)
states: 4,649,926,033 (9)
abstracting: (1<=p130)
states: 110,072,520 (8)
abstracting: (p98<=1)
states: 4,759,924,249 (9)
EG iterations: 0
abstracting: (p105<=1)
states: 4,759,924,249 (9)
abstracting: (p71<=1)
states: 4,759,924,249 (9)
abstracting: (p52<=p181)
states: 4,652,234,425 (9)
abstracting: (p172<=p114)
states: 4,601,397,385 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.851sec
checking: AX [[[p202<=1 | [EG [~ [AF [1<=p39]]] | [p97<=p6 & p42<=1]]] | ~ [AG [[p94<=p187 & ~ [[p142<=1 | p47<=0]]]]]]]
normalized: ~ [EX [~ [[E [true U ~ [[p94<=p187 & ~ [[p142<=1 | p47<=0]]]]] | [p202<=1 | [[p97<=p6 & p42<=1] | EG [EG [~ [1<=p39]]]]]]]]]
abstracting: (1<=p39)
states: 110,072,520 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p42<=1)
states: 4,759,924,249 (9)
abstracting: (p97<=p6)
states: 4,650,982,057 (9)
abstracting: (p202<=1)
states: 4,759,924,249 (9)
abstracting: (p47<=0)
states: 4,648,378,321 (9)
abstracting: (p142<=1)
states: 4,759,924,249 (9)
abstracting: (p94<=p187)
states: 4,652,199,289 (9)
.-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.820sec
checking: [EF [AF [AG [EG [p211<=p176]]]] & AF [[[A [AF [1<=p73] U AF [p113<=0]] & E [[[p86<=0 | 1<=p174] & E [p209<=0 U p202<=p51]] U AX [p58<=p198]]] | p66<=0]]]
normalized: [~ [EG [~ [[p66<=0 | [[~ [EG [EG [~ [p113<=0]]]] & ~ [E [EG [~ [p113<=0]] U [EG [~ [1<=p73]] & EG [~ [p113<=0]]]]]] & E [[E [p209<=0 U p202<=p51] & [p86<=0 | 1<=p174]] U ~ [EX [~ [p58<=p198]]]]]]]]] & E [true U ~ [EG [E [true U ~ [EG [p211<=p176]]]]]]]
abstracting: (p211<=p176)
states: 4,570,583,053 (9)
.
EG iterations: 1
EG iterations: 0
abstracting: (p58<=p198)
states: 4,652,992,660 (9)
.abstracting: (1<=p174)
states: 162,320,760 (8)
abstracting: (p86<=0)
states: 4,649,851,729 (9)
abstracting: (p202<=p51)
states: 4,568,664,091 (9)
abstracting: (p209<=0)
states: 4,564,049,752 (9)
abstracting: (p113<=0)
states: 4,649,926,033 (9)
.
EG iterations: 1
abstracting: (1<=p73)
states: 109,998,216 (8)
.
EG iterations: 1
abstracting: (p113<=0)
states: 4,649,926,033 (9)
.
EG iterations: 1
abstracting: (p113<=0)
states: 4,649,926,033 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p66<=0)
states: 4,649,926,033 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.544sec
checking: EF [AG [[AX [AF [p177<=p87]] | [[EF [p203<=p183] & [[p23<=0 & p189<=p131] & ~ [p40<=1]]] & [AX [p76<=1] & [[1<=p114 | p44<=p171] | A [p192<=p39 U 1<=p113]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[~ [E [~ [1<=p113] U [~ [p192<=p39] & ~ [1<=p113]]]] & ~ [EG [~ [1<=p113]]]] | [1<=p114 | p44<=p171]] & ~ [EX [~ [p76<=1]]]] & [[~ [p40<=1] & [p23<=0 & p189<=p131]] & E [true U p203<=p183]]] | ~ [EX [EG [~ [p177<=p87]]]]]]]]]
abstracting: (p177<=p87)
states: 4,601,397,385 (9)
.
EG iterations: 1
.abstracting: (p203<=p183)
states: 4,570,900,813 (9)
abstracting: (p189<=p131)
states: 4,598,364,169 (9)
abstracting: (p23<=0)
states: 4,649,926,033 (9)
abstracting: (p40<=1)
states: 4,759,924,249 (9)
abstracting: (p76<=1)
states: 4,759,924,249 (9)
.abstracting: (p44<=p171)
states: 4,653,498,889 (9)
abstracting: (1<=p114)
states: 109,998,216 (8)
abstracting: (1<=p113)
states: 109,998,216 (8)
.
EG iterations: 1
abstracting: (1<=p113)
states: 109,998,216 (8)
abstracting: (p192<=p39)
states: 4,564,779,547 (9)
abstracting: (1<=p113)
states: 109,998,216 (8)
-> the formula is FALSE
FORMULA UtahNoC-PT-none-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.613sec
checking: A [E [p177<=0 U [~ [p150<=p63] | p21<=p77]] U ~ [[~ [AG [[[1<=p189 | p111<=1] | E [p138<=p194 U p29<=p101]]]] | [~ [AX [A [p15<=1 U p93<=1]]] & p72<=p128]]]]
normalized: [~ [EG [[[p72<=p128 & EX [~ [[~ [EG [~ [p93<=1]]] & ~ [E [~ [p93<=1] U [~ [p15<=1] & ~ [p93<=1]]]]]]]] | E [true U ~ [[E [p138<=p194 U p29<=p101] | [1<=p189 | p111<=1]]]]]]] & ~ [E [[[p72<=p128 & EX [~ [[~ [EG [~ [p93<=1]]] & ~ [E [~ [p93<=1] U [~ [p15<=1] & ~ [p93<=1]]]]]]]] | E [true U ~ [[E [p138<=p194 U p29<=p101] | [1<=p189 | p111<=1]]]]] U [~ [E [p177<=0 U [p21<=p77 | ~ [p150<=p63]]]] & [[p72<=p128 & EX [~ [[~ [EG [~ [p93<=1]]] & ~ [E [~ [p93<=1] U [~ [p15<=1] & ~ [p93<=1]]]]]]]] | E [true U ~ [[E [p138<=p194 U p29<=p101] | [1<=p189 | p111<=1]]]]]]]]]
abstracting: (p111<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p189)
states: 165,416,184 (8)
abstracting: (p29<=p101)
states: 4,652,512,201 (9)
abstracting: (p138<=p194)
states: 4,601,425,174 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p15<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
.
EG iterations: 1
.abstracting: (p72<=p128)
states: 4,652,448,301 (9)
abstracting: (p150<=p63)
states: 4,598,364,169 (9)
abstracting: (p21<=p77)
states: 4,652,442,793 (9)
abstracting: (p177<=0)
states: 4,597,603,489 (9)
abstracting: (p111<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p189)
states: 165,416,184 (8)
abstracting: (p29<=p101)
states: 4,652,512,201 (9)
abstracting: (p138<=p194)
states: 4,601,425,174 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p15<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
.
EG iterations: 1
.abstracting: (p72<=p128)
states: 4,652,448,301 (9)
abstracting: (p111<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p189)
states: 165,416,184 (8)
abstracting: (p29<=p101)
states: 4,652,512,201 (9)
abstracting: (p138<=p194)
states: 4,601,425,174 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p15<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
abstracting: (p93<=1)
states: 4,759,924,249 (9)
.
EG iterations: 1
.abstracting: (p72<=p128)
states: 4,652,448,301 (9)
.
EG iterations: 1
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.710sec
checking: A [~ [A [p197<=p111 U [AG [AG [1<=p51]] & E [E [p164<=1 U 1<=p28] U EF [p3<=1]]]]] U A [[AF [[1<=p16 | [1<=p71 & p125<=p133]]] | E [A [p54<=p152 U p52<=p206] U AF [p2<=0]]] U AG [[EX [p179<=p204] | [AX [p153<=p137] | AF [p206<=p125]]]]]]
normalized: [~ [EG [~ [[~ [EG [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]] & ~ [E [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]] U [~ [[E [[~ [EG [~ [p52<=p206]]] & ~ [E [~ [p52<=p206] U [~ [p54<=p152] & ~ [p52<=p206]]]]] U ~ [EG [~ [p2<=0]]]] | ~ [EG [~ [[1<=p16 | [1<=p71 & p125<=p133]]]]]]] & E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]] & ~ [E [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]] U [~ [[E [[~ [EG [~ [p52<=p206]]] & ~ [E [~ [p52<=p206] U [~ [p54<=p152] & ~ [p52<=p206]]]]] U ~ [EG [~ [p2<=0]]]] | ~ [EG [~ [[1<=p16 | [1<=p71 & p125<=p133]]]]]]] & E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]]]]] U [[~ [EG [~ [[E [E [p164<=1 U 1<=p28] U E [true U p3<=1]] & ~ [E [true U E [true U ~ [1<=p51]]]]]]]] & ~ [E [~ [[E [E [p164<=1 U 1<=p28] U E [true U p3<=1]] & ~ [E [true U E [true U ~ [1<=p51]]]]]] U [~ [p197<=p111] & ~ [[E [E [p164<=1 U 1<=p28] U E [true U p3<=1]] & ~ [E [true U E [true U ~ [1<=p51]]]]]]]]]] & ~ [[~ [EG [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]] & ~ [E [E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]] U [~ [[E [[~ [EG [~ [p52<=p206]]] & ~ [E [~ [p52<=p206] U [~ [p54<=p152] & ~ [p52<=p206]]]]] U ~ [EG [~ [p2<=0]]]] | ~ [EG [~ [[1<=p16 | [1<=p71 & p125<=p133]]]]]]] & E [true U ~ [[[~ [EG [~ [p206<=p125]]] | ~ [EX [~ [p153<=p137]]]] | EX [p179<=p204]]]]]]]]]]]]]
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p125<=p133)
states: 4,649,851,729 (9)
abstracting: (1<=p71)
states: 109,998,216 (8)
abstracting: (1<=p16)
states: 111,545,928 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,173,282,833 (9)
.
EG iterations: 1
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p54<=p152)
states: 4,652,234,425 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p51)
states: 111,545,928 (8)
abstracting: (p3<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p28)
states: 109,998,216 (8)
abstracting: (p164<=1)
states: 4,759,924,249 (9)
abstracting: (p197<=p111)
states: 4,568,627,995 (9)
abstracting: (1<=p51)
states: 111,545,928 (8)
abstracting: (p3<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p28)
states: 109,998,216 (8)
abstracting: (p164<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p51)
states: 111,545,928 (8)
abstracting: (p3<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p28)
states: 109,998,216 (8)
abstracting: (p164<=1)
states: 4,759,924,249 (9)
EG iterations: 0
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p125<=p133)
states: 4,649,851,729 (9)
abstracting: (1<=p71)
states: 109,998,216 (8)
abstracting: (1<=p16)
states: 111,545,928 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,173,282,833 (9)
.
EG iterations: 1
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p54<=p152)
states: 4,652,234,425 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p125<=p133)
states: 4,649,851,729 (9)
abstracting: (1<=p71)
states: 109,998,216 (8)
abstracting: (1<=p16)
states: 111,545,928 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,173,282,833 (9)
.
EG iterations: 1
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p54<=p152)
states: 4,652,234,425 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
abstracting: (p52<=p206)
states: 4,653,037,204 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
abstracting: (p179<=p204)
states: 4,601,425,174 (9)
.abstracting: (p153<=p137)
states: 4,594,508,065 (9)
.abstracting: (p206<=p125)
states: 4,564,779,547 (9)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA UtahNoC-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.390sec
totally nodes used: 10932340 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 171357409 423209555 594566964
used/not used/entry size/cache size: 66979796 129068 16 1024MB
basic ops cache: hits/miss/sum: 3338972 7304353 10643325
used/not used/entry size/cache size: 7694566 9082650 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: 112018 216226 328244
used/not used/entry size/cache size: 213532 8175076 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 58046896
1 7535333
2 1238471
3 240462
4 40848
5 5969
6 768
7 103
8 13
9 1
>= 10 0
Total processing time: 1m55.036sec
BK_STOP 1679874666915
--------------------
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.005sec
1882 4344 7300 10366 10546 11120 11050 12406 11073 11509 7873 8366 8106 11158 11572 12625 10898 8951 9778 9727 10435 10186 14231 15619 14530 16285
iterations count:2659652 (2722), effective:29063 (29)
initing FirstDep: 0m 0.004sec
iterations count:977 (1), effective:0 (0)
iterations count:13123 (13), effective:223 (0)
iterations count:1014 (1), effective:2 (0)
iterations count:977 (1), effective:0 (0)
iterations count:977 (1), effective:0 (0)
iterations count:3385 (3), effective:43 (0)
iterations count:17867 (18), effective:342 (0)
iterations count:15171 (15), effective:369 (0)
iterations count:19070 (19), effective:356 (0)
iterations count:27332 (27), effective:568 (0)
iterations count:977 (1), effective:0 (0)
iterations count:15974 (16), effective:302 (0)
iterations count:2430 (2), effective:42 (0)
iterations count:1206 (1), effective:5 (0)
iterations count:1007 (1), effective:1 (0)
iterations count:11373 (11), effective:265 (0)
iterations count:12138 (12), effective:221 (0)
iterations count:37647 (38), effective:836 (0)
iterations count:987 (1), effective:1 (0)
iterations count:1594 (1), effective:16 (0)
iterations count:987 (1), effective:1 (0)
iterations count:987 (1), effective:1 (0)
iterations count:979 (1), effective:1 (0)
iterations count:981 (1), effective:1 (0)
iterations count:977 (1), effective:0 (0)
iterations count:977 (1), effective:0 (0)
iterations count:18588 (19), effective:372 (0)
iterations count:977 (1), effective:0 (0)
iterations count:981 (1), effective:1 (0)
iterations count:977 (1), effective:0 (0)
iterations count:977 (1), effective:0 (0)
iterations count:18588 (19), effective:372 (0)
iterations count:977 (1), effective:0 (0)
iterations count:12027 (12), effective:242 (0)
iterations count:981 (1), effective:1 (0)
iterations count:977 (1), effective:0 (0)
iterations count:977 (1), effective:0 (0)
iterations count:18588 (19), effective:372 (0)
iterations count:977 (1), effective:0 (0)
iterations count:979 (1), effective:1 (0)
iterations count:979 (1), effective:1 (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="UtahNoC-PT-none"
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 UtahNoC-PT-none, 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 r481-tall-167912692700945"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/UtahNoC-PT-none.tgz
mv UtahNoC-PT-none 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 ;