fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r481-tall-167912692700950
Last Updated
May 14, 2023

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
5957.159 86629.00 86080.00 0.00 FFTTTTTTTFTTFFFF 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-167912692700950.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692700950
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-01
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-02
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-03
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-04
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-05
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-06
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-07
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-08
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-09
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-10
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-11
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-12
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-13
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-14
FORMULA_NAME UtahNoC-PT-none-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679874582599

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtahNoC-PT-none
Not applying reductions.
Model is PT
ReachabilityCardinality PT
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: UtahNoC_PT_none
(NrP: 216 NrTr: 977 NrArc: 2905)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.013sec

net check time: 0m 0.000sec

init dd package: 0m 2.867sec


RS generation: 0m48.115sec


-> reachability set: #nodes 11093 (1.1e+04) #states 4,759,924,249 (9)



starting MCC model checker
--------------------------

checking: AG [p107<=1]
normalized: ~ [E [true U ~ [p107<=1]]]

abstracting: (p107<=1)
states: 4,759,924,249 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [1<=p75]
normalized: E [true U 1<=p75]

abstracting: (1<=p75)
states: 109,998,216 (8)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.109sec

checking: EF [1<=p92]
normalized: E [true U 1<=p92]

abstracting: (1<=p92)
states: 111,545,928 (8)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.104sec

checking: EF [~ [p88<=1]]
normalized: E [true U ~ [p88<=1]]

abstracting: (p88<=1)
states: 4,759,924,249 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [p115<=0] | p115<=1]]
normalized: ~ [E [true U ~ [[~ [p115<=0] | p115<=1]]]]

abstracting: (p115<=1)
states: 4,759,924,249 (9)
abstracting: (p115<=0)
states: 4,649,926,033 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p110<=p204] | ~ [p30<=1]]]
normalized: E [true U [~ [p110<=p204] | ~ [p30<=1]]]

abstracting: (p30<=1)
states: 4,759,924,249 (9)
abstracting: (p110<=p204)
states: 4,654,551,892 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.800sec

checking: EF [[~ [p184<=1] | [p2<=0 & [1<=p107 & 1<=p80]]]]
normalized: E [true U [[p2<=0 & [1<=p107 & 1<=p80]] | ~ [p184<=1]]]

abstracting: (p184<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p80)
states: 110,072,520 (8)
abstracting: (1<=p107)
states: 109,998,216 (8)
abstracting: (p2<=0)
states: 3,173,282,833 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.893sec

checking: EF [[p77<=p31 & [~ [[p102<=p181 | p3<=1]] & [~ [p68<=0] | p214<=p44]]]]
normalized: E [true U [[[~ [p68<=0] | p214<=p44] & ~ [[p102<=p181 | p3<=1]]] & p77<=p31]]

abstracting: (p77<=p31)
states: 4,652,494,633 (9)
abstracting: (p3<=1)
states: 4,759,924,249 (9)
abstracting: (p102<=p181)
states: 4,652,234,425 (9)
abstracting: (p214<=p44)
states: 4,564,779,547 (9)
abstracting: (p68<=0)
states: 4,649,926,033 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.051sec

checking: EF [~ [[p74<=p1 | [[[1<=p101 | p214<=1] | [1<=p80 | [[~ [[1<=p49 & p127<=p35]] & [~ [1<=p29] | [p203<=p10 & 1<=p2]]] | p208<=0]]] | p34<=1]]]]
normalized: E [true U ~ [[p74<=p1 | [p34<=1 | [[1<=p80 | [p208<=0 | [[[p203<=p10 & 1<=p2] | ~ [1<=p29]] & ~ [[1<=p49 & p127<=p35]]]]] | [1<=p101 | p214<=1]]]]]]

abstracting: (p214<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p101)
states: 111,545,928 (8)
abstracting: (p127<=p35)
states: 4,652,373,997 (9)
abstracting: (1<=p49)
states: 111,545,928 (8)
abstracting: (1<=p29)
states: 109,998,216 (8)
abstracting: (1<=p2)
states: 1,586,641,416 (9)
abstracting: (p203<=p10)
states: 4,568,664,091 (9)
abstracting: (p208<=0)
states: 4,560,120,664 (9)
abstracting: (1<=p80)
states: 110,072,520 (8)
abstracting: (p34<=1)
states: 4,759,924,249 (9)
abstracting: (p74<=p1)
states: 4,686,592,105 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

checking: EF [[[p131<=1 | ~ [[~ [[[~ [[p199<=1 | p168<=0]] | p70<=p78] & [1<=p209 | ~ [1<=p105]]]] & p142<=0]]] & [~ [[~ [p66<=1] & [[p73<=p128 & [~ [p148<=1] & p15<=p17]] | 1<=p65]]] & 1<=p43]]]
normalized: E [true U [[1<=p43 & ~ [[[1<=p65 | [p73<=p128 & [p15<=p17 & ~ [p148<=1]]]] & ~ [p66<=1]]]] & [p131<=1 | ~ [[p142<=0 & ~ [[[1<=p209 | ~ [1<=p105]] & [p70<=p78 | ~ [[p199<=1 | p168<=0]]]]]]]]]]

abstracting: (p168<=0)
states: 4,594,508,065 (9)
abstracting: (p199<=1)
states: 4,759,924,249 (9)
abstracting: (p70<=p78)
states: 4,649,926,033 (9)
abstracting: (1<=p105)
states: 111,545,928 (8)
abstracting: (1<=p209)
states: 195,874,497 (8)
abstracting: (p142<=0)
states: 4,597,603,489 (9)
abstracting: (p131<=1)
states: 4,759,924,249 (9)
abstracting: (p66<=1)
states: 4,759,924,249 (9)
abstracting: (p148<=1)
states: 4,759,924,249 (9)
abstracting: (p15<=p17)
states: 4,648,378,321 (9)
abstracting: (p73<=p128)
states: 4,652,448,301 (9)
abstracting: (1<=p65)
states: 109,998,216 (8)
abstracting: (1<=p43)
states: 110,072,520 (8)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.174sec

checking: EF [~ [[[p43<=p145 & p115<=1] & [[[[[~ [1<=p133] & ~ [p175<=1]] & [[1<=p197 | 1<=p173] | [p170<=p207 & p33<=p13]]] | p31<=0] | [[~ [1<=p86] | ~ [p22<=p162]] | p87<=p6]] | 1<=p57]]]]
normalized: E [true U ~ [[[1<=p57 | [[p87<=p6 | [~ [p22<=p162] | ~ [1<=p86]]] | [p31<=0 | [[[p170<=p207 & p33<=p13] | [1<=p197 | 1<=p173]] & [~ [p175<=1] & ~ [1<=p133]]]]]] & [p43<=p145 & p115<=1]]]]

abstracting: (p115<=1)
states: 4,759,924,249 (9)
abstracting: (p43<=p145)
states: 4,653,645,625 (9)
abstracting: (1<=p133)
states: 111,545,928 (8)
abstracting: (p175<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p173)
states: 165,416,184 (8)
abstracting: (1<=p197)
states: 195,874,497 (8)
abstracting: (p33<=p13)
states: 4,649,926,033 (9)
abstracting: (p170<=p207)
states: 4,604,454,550 (9)
abstracting: (p31<=0)
states: 4,649,926,033 (9)
abstracting: (1<=p86)
states: 110,072,520 (8)
abstracting: (p22<=p162)
states: 4,653,782,137 (9)
abstracting: (p87<=p6)
states: 4,652,438,761 (9)
abstracting: (1<=p57)
states: 111,545,928 (8)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.273sec

checking: AG [[~ [[~ [[~ [[~ [p204<=1] | [1<=p58 & p198<=1]]] | [[[p137<=p198 | p147<=p93] | p160<=p194] | [p201<=0 & ~ [p96<=p201]]]]] | [[~ [[1<=p32 & p213<=p192]] | [~ [p209<=0] & ~ [p108<=1]]] & p49<=0]]] | p119<=p109]]
normalized: ~ [E [true U ~ [[p119<=p109 | ~ [[[p49<=0 & [[~ [p108<=1] & ~ [p209<=0]] | ~ [[1<=p32 & p213<=p192]]]] | ~ [[[[p201<=0 & ~ [p96<=p201]] | [p160<=p194 | [p137<=p198 | p147<=p93]]] | ~ [[[1<=p58 & p198<=1] | ~ [p204<=1]]]]]]]]]]]

abstracting: (p204<=1)
states: 4,759,924,249 (9)
abstracting: (p198<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p58)
states: 111,545,928 (8)
abstracting: (p147<=p93)
states: 4,601,459,593 (9)
abstracting: (p137<=p198)
states: 4,601,359,126 (9)
abstracting: (p160<=p194)
states: 4,601,425,174 (9)
abstracting: (p96<=p201)
states: 4,653,037,204 (9)
abstracting: (p201<=0)
states: 4,564,049,752 (9)
abstracting: (p213<=p192)
states: 4,560,120,664 (9)
abstracting: (1<=p32)
states: 109,998,216 (8)
abstracting: (p209<=0)
states: 4,564,049,752 (9)
abstracting: (p108<=1)
states: 4,759,924,249 (9)
abstracting: (p49<=0)
states: 4,648,378,321 (9)
abstracting: (p119<=p109)
states: 4,649,926,033 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.425sec

checking: AG [[[[1<=p171 & [[~ [[p46<=p135 | ~ [[1<=p167 & 1<=p46]]]] & [~ [p103<=0] & p196<=0]] | p184<=0]] | [[~ [1<=p72] | [~ [[[p106<=0 & ~ [p53<=0]] & [[p134<=1 & p208<=1] | [p125<=1 & p20<=p41]]]] & ~ [[p50<=0 & [[1<=p96 | 1<=p75] | 1<=p55]]]]] | p143<=p45]] | ~ [[~ [p109<=1] | p35<=p203]]]]
normalized: ~ [E [true U ~ [[~ [[p35<=p203 | ~ [p109<=1]]] | [[p143<=p45 | [[~ [[p50<=0 & [1<=p55 | [1<=p96 | 1<=p75]]]] & ~ [[[[p125<=1 & p20<=p41] | [p134<=1 & p208<=1]] & [p106<=0 & ~ [p53<=0]]]]] | ~ [1<=p72]]] | [1<=p171 & [p184<=0 | [[p196<=0 & ~ [p103<=0]] & ~ [[p46<=p135 | ~ [[1<=p167 & 1<=p46]]]]]]]]]]]]

abstracting: (1<=p46)
states: 111,545,928 (8)
abstracting: (1<=p167)
states: 165,416,184 (8)
abstracting: (p46<=p135)
states: 4,652,234,425 (9)
abstracting: (p103<=0)
states: 4,648,378,321 (9)
abstracting: (p196<=0)
states: 4,560,120,664 (9)
abstracting: (p184<=0)
states: 4,597,603,489 (9)
abstracting: (1<=p171)
states: 162,320,760 (8)
abstracting: (1<=p72)
states: 109,998,216 (8)
abstracting: (p53<=0)
states: 4,648,378,321 (9)
abstracting: (p106<=0)
states: 4,648,378,321 (9)
abstracting: (p208<=1)
states: 4,759,924,249 (9)
abstracting: (p134<=1)
states: 4,759,924,249 (9)
abstracting: (p20<=p41)
states: 4,648,378,321 (9)
abstracting: (p125<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p75)
states: 109,998,216 (8)
abstracting: (1<=p96)
states: 111,545,928 (8)
abstracting: (1<=p55)
states: 111,545,928 (8)
abstracting: (p50<=0)
states: 4,648,378,321 (9)
abstracting: (p143<=p45)
states: 4,601,459,593 (9)
abstracting: (p109<=1)
states: 4,759,924,249 (9)
abstracting: (p35<=p203)
states: 4,654,504,276 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.172sec

checking: AG [[~ [[[1<=p8 & [[[[[p203<=p118 & p38<=0] & [1<=p138 & p151<=0]] & ~ [[1<=p127 | p96<=0]]] & ~ [[p51<=p140 | 1<=p133]]] & [~ [p201<=p31] & [[~ [p186<=0] | [1<=p79 | p136<=1]] | ~ [[p73<=0 & p197<=1]]]]]] & [[[~ [[p135<=p201 & p37<=p180]] | [p26<=p18 | [p116<=p44 | ~ [1<=p168]]]] | p148<=1] | [[[[~ [p190<=1] & p84<=0] & [1<=p192 & [p123<=p206 & p29<=1]]] | ~ [p107<=1]] | ~ [1<=p181]]]]] & p84<=1]]
normalized: ~ [E [true U ~ [[p84<=1 & ~ [[[[~ [1<=p181] | [~ [p107<=1] | [[1<=p192 & [p123<=p206 & p29<=1]] & [p84<=0 & ~ [p190<=1]]]]] | [p148<=1 | [[p26<=p18 | [p116<=p44 | ~ [1<=p168]]] | ~ [[p135<=p201 & p37<=p180]]]]] & [1<=p8 & [[[~ [[p73<=0 & p197<=1]] | [[1<=p79 | p136<=1] | ~ [p186<=0]]] & ~ [p201<=p31]] & [~ [[p51<=p140 | 1<=p133]] & [~ [[1<=p127 | p96<=0]] & [[1<=p138 & p151<=0] & [p203<=p118 & p38<=0]]]]]]]]]]]]

abstracting: (p38<=0)
states: 4,649,851,729 (9)
abstracting: (p203<=p118)
states: 4,568,430,043 (9)
abstracting: (p151<=0)
states: 4,594,508,065 (9)
abstracting: (1<=p138)
states: 165,416,184 (8)
abstracting: (p96<=0)
states: 4,648,378,321 (9)
abstracting: (1<=p127)
states: 110,072,520 (8)
abstracting: (1<=p133)
states: 111,545,928 (8)
abstracting: (p51<=p140)
states: 4,652,199,289 (9)
abstracting: (p201<=p31)
states: 4,568,627,995 (9)
abstracting: (p186<=0)
states: 4,597,603,489 (9)
abstracting: (p136<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p79)
states: 109,998,216 (8)
abstracting: (p197<=1)
states: 4,759,924,249 (9)
abstracting: (p73<=0)
states: 4,649,926,033 (9)
abstracting: (1<=p8)
states: 111,545,928 (8)
abstracting: (p37<=p180)
states: 4,653,683,065 (9)
abstracting: (p135<=p201)
states: 4,601,359,126 (9)
abstracting: (1<=p168)
states: 165,416,184 (8)
abstracting: (p116<=p44)
states: 4,652,448,301 (9)
abstracting: (p26<=p18)
states: 4,649,926,033 (9)
abstracting: (p148<=1)
states: 4,759,924,249 (9)
abstracting: (p190<=1)
states: 4,759,924,249 (9)
abstracting: (p84<=0)
states: 4,649,851,729 (9)
abstracting: (p29<=1)
states: 4,759,924,249 (9)
abstracting: (p123<=p206)
states: 4,654,510,612 (9)
abstracting: (1<=p192)
states: 199,803,585 (8)
abstracting: (p107<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p181)
states: 165,416,184 (8)
abstracting: (p84<=1)
states: 4,759,924,249 (9)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.184sec

checking: AG [[[[[~ [[[[[1<=p30 | 1<=p40] & [1<=p150 & p129<=0]] & [[1<=p106 | p34<=p200] & [1<=p58 & p114<=1]]] | p158<=p63]] | p204<=p156] | ~ [[[1<=p175 & [~ [[p92<=p120 & 1<=p168]] | 1<=p108]] | ~ [[~ [[p214<=0 | 1<=p145]] | ~ [[p132<=p11 | p173<=p152]]]]]]] | [~ [1<=p52] | ~ [[~ [[[[1<=p149 | p105<=0] & [p96<=0 | 1<=p57]] & [~ [p76<=1] | ~ [1<=p37]]]] & ~ [p47<=p23]]]]] | [[p34<=p197 | [[1<=p75 & ~ [[[[p111<=0 | p43<=p38] & [p165<=p184 & p98<=p205]] & ~ [[1<=p190 & p51<=0]]]]] | p124<=0]] & p179<=1]]]
normalized: ~ [E [true U ~ [[[p179<=1 & [p34<=p197 | [p124<=0 | [1<=p75 & ~ [[[[p165<=p184 & p98<=p205] & [p111<=0 | p43<=p38]] & ~ [[1<=p190 & p51<=0]]]]]]]] | [[~ [[~ [[[~ [1<=p37] | ~ [p76<=1]] & [[p96<=0 | 1<=p57] & [1<=p149 | p105<=0]]]] & ~ [p47<=p23]]] | ~ [1<=p52]] | [~ [[~ [[~ [[p132<=p11 | p173<=p152]] | ~ [[p214<=0 | 1<=p145]]]] | [1<=p175 & [1<=p108 | ~ [[p92<=p120 & 1<=p168]]]]]] | [p204<=p156 | ~ [[p158<=p63 | [[[1<=p58 & p114<=1] & [1<=p106 | p34<=p200]] & [[1<=p150 & p129<=0] & [1<=p30 | 1<=p40]]]]]]]]]]]]

abstracting: (1<=p40)
states: 110,072,520 (8)
abstracting: (1<=p30)
states: 109,998,216 (8)
abstracting: (p129<=0)
states: 4,649,851,729 (9)
abstracting: (1<=p150)
states: 165,416,184 (8)
abstracting: (p34<=p200)
states: 4,654,551,892 (9)
abstracting: (1<=p106)
states: 111,545,928 (8)
abstracting: (p114<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p58)
states: 111,545,928 (8)
abstracting: (p158<=p63)
states: 4,601,459,593 (9)
abstracting: (p204<=p156)
states: 4,566,971,725 (9)
abstracting: (1<=p168)
states: 165,416,184 (8)
abstracting: (p92<=p120)
states: 4,648,378,321 (9)
abstracting: (1<=p108)
states: 109,998,216 (8)
abstracting: (1<=p175)
states: 162,320,760 (8)
abstracting: (1<=p145)
states: 162,320,760 (8)
abstracting: (p214<=0)
states: 4,560,120,664 (9)
abstracting: (p173<=p152)
states: 4,600,232,569 (9)
abstracting: (p132<=p11)
states: 4,650,982,057 (9)
abstracting: (1<=p52)
states: 111,545,928 (8)
abstracting: (p47<=p23)
states: 4,648,378,321 (9)
abstracting: (p105<=0)
states: 4,648,378,321 (9)
abstracting: (1<=p149)
states: 165,416,184 (8)
abstracting: (1<=p57)
states: 111,545,928 (8)
abstracting: (p96<=0)
states: 4,648,378,321 (9)
abstracting: (p76<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p37)
states: 110,072,520 (8)
abstracting: (p51<=0)
states: 4,648,378,321 (9)
abstracting: (1<=p190)
states: 165,416,184 (8)
abstracting: (p43<=p38)
states: 4,649,851,729 (9)
abstracting: (p111<=0)
states: 4,649,926,033 (9)
abstracting: (p98<=p205)
states: 4,653,037,204 (9)
abstracting: (p165<=p184)
states: 4,594,508,065 (9)
abstracting: (1<=p75)
states: 109,998,216 (8)
abstracting: (p124<=0)
states: 4,649,851,729 (9)
abstracting: (p34<=p197)
states: 4,654,306,324 (9)
abstracting: (p179<=1)
states: 4,759,924,249 (9)
-> the formula is TRUE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.276sec

checking: AG [[[[[[[[1<=p194 | ~ [[p86<=p92 & p74<=p165]]] | ~ [1<=p119]] | [[[~ [p215<=1] | [p207<=0 & p33<=0]] | 1<=p30] & ~ [p37<=p127]]] & ~ [p106<=0]] | p175<=0] | [[1<=p2 & [1<=p5 & [~ [[[p3<=p153 & p65<=1] | ~ [p2<=p134]]] | p211<=0]]] & ~ [[p16<=0 & ~ [1<=p128]]]]] | [[[[[[1<=p207 & ~ [[p178<=p95 & 1<=p19]]] & [~ [[p93<=0 & p76<=0]] & [[p90<=0 | p158<=1] & p174<=p174]]] & [[[1<=p66 & [1<=p150 | 1<=p33]] & p85<=p204] | [[~ [p179<=0] | p151<=0] & ~ [p164<=1]]]] & [p189<=p140 | [[~ [p62<=p153] & p1<=p150] & [[[1<=p51 | 1<=p48] | ~ [1<=p144]] | [1<=p20 | p159<=p33]]]]] & ~ [[[p156<=1 | ~ [p86<=0]] & [[[~ [1<=p117] & [p150<=p66 & 1<=p196]] & [[p155<=1 & 1<=p126] & [p6<=p7 & p4<=p150]]] & p9<=0]]]] | [1<=p214 | 1<=p201]]]]
normalized: ~ [E [true U ~ [[[[1<=p214 | 1<=p201] | [~ [[[p9<=0 & [[[p6<=p7 & p4<=p150] & [p155<=1 & 1<=p126]] & [[p150<=p66 & 1<=p196] & ~ [1<=p117]]]] & [p156<=1 | ~ [p86<=0]]]] & [[p189<=p140 | [[[1<=p20 | p159<=p33] | [~ [1<=p144] | [1<=p51 | 1<=p48]]] & [p1<=p150 & ~ [p62<=p153]]]] & [[[~ [p164<=1] & [p151<=0 | ~ [p179<=0]]] | [p85<=p204 & [1<=p66 & [1<=p150 | 1<=p33]]]] & [[[p174<=p174 & [p90<=0 | p158<=1]] & ~ [[p93<=0 & p76<=0]]] & [1<=p207 & ~ [[p178<=p95 & 1<=p19]]]]]]]] | [[~ [[p16<=0 & ~ [1<=p128]]] & [1<=p2 & [1<=p5 & [p211<=0 | ~ [[~ [p2<=p134] | [p3<=p153 & p65<=1]]]]]]] | [p175<=0 | [~ [p106<=0] & [[~ [p37<=p127] & [1<=p30 | [[p207<=0 & p33<=0] | ~ [p215<=1]]]] | [~ [1<=p119] | [1<=p194 | ~ [[p86<=p92 & p74<=p165]]]]]]]]]]]]

abstracting: (p74<=p165)
states: 4,653,782,137 (9)
abstracting: (p86<=p92)
states: 4,652,438,761 (9)
abstracting: (1<=p194)
states: 199,803,585 (8)
abstracting: (1<=p119)
states: 109,998,216 (8)
abstracting: (p215<=1)
states: 4,759,924,249 (9)
abstracting: (p33<=0)
states: 4,649,926,033 (9)
abstracting: (p207<=0)
states: 4,560,120,664 (9)
abstracting: (1<=p30)
states: 109,998,216 (8)
abstracting: (p37<=p127)
states: 4,652,422,057 (9)
abstracting: (p106<=0)
states: 4,648,378,321 (9)
abstracting: (p175<=0)
states: 4,597,603,489 (9)
abstracting: (p65<=1)
states: 4,759,924,249 (9)
abstracting: (p3<=p153)
states: 3,228,421,561 (9)
abstracting: (p2<=p134)
states: 3,228,421,561 (9)
abstracting: (p211<=0)
states: 4,564,049,752 (9)
abstracting: (1<=p5)
states: 111,545,928 (8)
abstracting: (1<=p2)
states: 1,586,641,416 (9)
abstracting: (1<=p128)
states: 110,072,520 (8)
abstracting: (p16<=0)
states: 4,648,378,321 (9)
abstracting: (1<=p19)
states: 111,545,928 (8)
abstracting: (p178<=p95)
states: 4,598,364,169 (9)
abstracting: (1<=p207)
states: 199,803,585 (8)
abstracting: (p76<=0)
states: 4,649,926,033 (9)
abstracting: (p93<=0)
states: 4,648,378,321 (9)
abstracting: (p158<=1)
states: 4,759,924,249 (9)
abstracting: (p90<=0)
states: 4,648,378,321 (9)
abstracting: (p174<=p174)
states: 4,759,924,249 (9)
abstracting: (1<=p33)
states: 109,998,216 (8)
abstracting: (1<=p150)
states: 165,416,184 (8)
abstracting: (1<=p66)
states: 109,998,216 (8)
abstracting: (p85<=p204)
states: 4,654,510,612 (9)
abstracting: (p179<=0)
states: 4,594,508,065 (9)
abstracting: (p151<=0)
states: 4,594,508,065 (9)
abstracting: (p164<=1)
states: 4,759,924,249 (9)
abstracting: (p62<=p153)
states: 4,652,234,425 (9)
abstracting: (p1<=p150)
states: 3,228,421,561 (9)
abstracting: (1<=p48)
states: 111,545,928 (8)
abstracting: (1<=p51)
states: 111,545,928 (8)
abstracting: (1<=p144)
states: 165,416,184 (8)
abstracting: (p159<=p33)
states: 4,598,339,401 (9)
abstracting: (1<=p20)
states: 111,545,928 (8)
abstracting: (p189<=p140)
states: 4,600,183,033 (9)
abstracting: (p86<=0)
states: 4,649,851,729 (9)
abstracting: (p156<=1)
states: 4,759,924,249 (9)
abstracting: (1<=p117)
states: 109,998,216 (8)
abstracting: (1<=p196)
states: 199,803,585 (8)
abstracting: (p150<=p66)
states: 4,598,364,169 (9)
abstracting: (1<=p126)
states: 110,072,520 (8)
abstracting: (p155<=1)
states: 4,759,924,249 (9)
abstracting: (p4<=p150)
states: 165,416,185 (8)
abstracting: (p6<=p7)
states: 4,648,378,321 (9)
abstracting: (p9<=0)
states: 4,648,378,321 (9)
abstracting: (1<=p201)
states: 195,874,497 (8)
abstracting: (1<=p214)
states: 199,803,585 (8)
-> the formula is FALSE

FORMULA UtahNoC-PT-none-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.743sec

totally nodes used: 7409842 (7.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 123251256 330436263 453687519
used/not used/entry size/cache size: 66601702 507162 16 1024MB
basic ops cache: hits/miss/sum: 2844418 6498854 9343272
used/not used/entry size/cache size: 7369118 9408098 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: 245640 486530 732170
used/not used/entry size/cache size: 473362 7915246 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 60972700
1 5105525
2 827019
3 169827
4 28921
5 4217
6 568
7 77
8 8
9 2
>= 10 0

Total processing time: 1m26.578sec


BK_STOP 1679874669228

--------------------
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.004sec

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:35794 (36), effective:707 (0)

iterations count:4316 (4), effective:43 (0)

iterations count:37599 (38), effective:800 (0)

iterations count:39321 (40), effective:819 (0)

iterations count:13021 (13), effective:272 (0)

iterations count:14917 (15), effective:304 (0)

iterations count:48561 (49), effective:961 (0)

iterations count:49234 (50), effective:1006 (1)

iterations count:66380 (67), effective:1484 (1)

iterations count:23608 (24), effective:434 (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="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is UtahNoC-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r481-tall-167912692700950"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;