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.r097-tall-167814469500425.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 DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469500425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:22 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 DES-PT-20a-CTLCardinality-00
FORMULA_NAME DES-PT-20a-CTLCardinality-01
FORMULA_NAME DES-PT-20a-CTLCardinality-02
FORMULA_NAME DES-PT-20a-CTLCardinality-03
FORMULA_NAME DES-PT-20a-CTLCardinality-04
FORMULA_NAME DES-PT-20a-CTLCardinality-05
FORMULA_NAME DES-PT-20a-CTLCardinality-06
FORMULA_NAME DES-PT-20a-CTLCardinality-07
FORMULA_NAME DES-PT-20a-CTLCardinality-08
FORMULA_NAME DES-PT-20a-CTLCardinality-09
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678253024165

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=DES-PT-20a
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: DES_PT_20a
(NrP: 195 NrTr: 152 NrArc: 742)

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

net check time: 0m 0.000sec

init dd package: 0m 2.795sec


RS generation: 0m13.574sec


-> reachability set: #nodes 161263 (1.6e+05) #states 7,969,347,823,493 (12)



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

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

abstracting: (1<=p68)
states: 459,379,921,544 (11)
....................
before gc: list nodes free: 504277

after gc: idd nodes used:847856, unused:63152144; list nodes free:287579923
.................
before gc: list nodes free: 1644800

after gc: idd nodes used:1414273, unused:62585727; list nodes free:286651191
.........................MC time: 3m45.002sec

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

abstracting: (p150<=1)
states: 7,969,347,823,493 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.716sec

checking: EG [p122<=1]
normalized: EG [p122<=1]

abstracting: (p122<=1)
states: 7,969,347,823,493 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.128sec

checking: EG [p137<=p150]
normalized: EG [p137<=p150]

abstracting: (p137<=p150)
states: 6,814,823,036,873 (12)

before gc: list nodes free: 4199301

after gc: idd nodes used:421394, unused:63578606; list nodes free:291742307
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.282sec

checking: EF [AX [[1<=p162 | ~ [1<=p150]]]]
normalized: E [true U ~ [EX [~ [[1<=p162 | ~ [1<=p150]]]]]]

abstracting: (1<=p150)
states: 5,030,738,730,184 (12)
abstracting: (1<=p162)
states: 2,660,803,732,557 (12)
.-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m28.992sec

checking: EF [A [p29<=p7 U 1<=p3]]
normalized: E [true U [~ [EG [~ [1<=p3]]] & ~ [E [~ [1<=p3] U [~ [p29<=p7] & ~ [1<=p3]]]]]]

abstracting: (1<=p3)
states: 395,106,915,336 (11)
abstracting: (p29<=p7)
states: 7,509,967,901,949 (12)
abstracting: (1<=p3)
states: 395,106,915,336 (11)
abstracting: (1<=p3)
states: 395,106,915,336 (11)
..............................
before gc: list nodes free: 6023011

after gc: idd nodes used:1112235, unused:62887765; list nodes free:288399276
........................................................................................................................................................
EG iterations: 182

before gc: list nodes free: 2357220

after gc: idd nodes used:617003, unused:63382997; list nodes free:290889808
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m53.131sec

checking: AG [AG [E [EX [p4<=1] U [1<=p29 | AX [p91<=p103]]]]]
normalized: ~ [E [true U E [true U ~ [E [EX [p4<=1] U [1<=p29 | ~ [EX [~ [p91<=p103]]]]]]]]]

abstracting: (p91<=p103)
states: 5,758,320,263,147 (12)
.abstracting: (1<=p29)
states: 459,379,921,544 (11)
abstracting: (p4<=1)
states: 7,969,347,823,493 (12)
.-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m24.176sec

checking: EG [AX [[p102<=p140 | [AF [AF [1<=p153]] | 1<=p141]]]]
normalized: EG [~ [EX [~ [[p102<=p140 | [1<=p141 | ~ [EG [EG [~ [1<=p153]]]]]]]]]]

abstracting: (1<=p153)
states: 4,745,635,884,211 (12)
........
before gc: list nodes free: 9235664

after gc: idd nodes used:1672542, unused:62327458; list nodes free:286168024
......
before gc: list nodes free: 2743809

after gc: idd nodes used:2282792, unused:61717208; list nodes free:283361415
.....
before gc: list nodes free: 433556

after gc: idd nodes used:2526658, unused:61473342; list nodes free:282298234
..MC time: 5m 0.039sec

checking: AX [[[~ [EF [[EG [1<=p25] | ~ [1<=p163]]]] | p152<=p25] & AF [~ [AG [[1<=p148 | p96<=1]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [E [true U ~ [[1<=p148 | p96<=1]]]]]] & [p152<=p25 | ~ [E [true U [~ [1<=p163] | EG [1<=p25]]]]]]]]]

abstracting: (1<=p25)
states: 459,379,921,544 (11)
....................
before gc: list nodes free: 1725718

after gc: idd nodes used:1071033, unused:62928967; list nodes free:292944147
...................................................................................................................
before gc: list nodes free: 5642993

after gc: idd nodes used:825504, unused:63174496; list nodes free:294147722
.................................................
EG iterations: 184
abstracting: (1<=p163)
states: 4,745,635,884,211 (12)
abstracting: (p152<=p25)
states: 5,462,176,886,840 (12)
abstracting: (p96<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p148)
states: 5,030,738,730,184 (12)

EG iterations: 0
.-> the formula is FALSE

FORMULA DES-PT-20a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 2.359sec

checking: EF [[[EX [[[[p184<=1 & p116<=0] & ~ [p100<=1]] | AG [1<=p187]]] & E [AF [EX [p75<=0]] U EX [[p56<=0 & p63<=0]]]] | ~ [AF [p19<=0]]]]
normalized: E [true U [EG [~ [p19<=0]] | [E [~ [EG [~ [EX [p75<=0]]]] U EX [[p56<=0 & p63<=0]]] & EX [[~ [E [true U ~ [1<=p187]]] | [~ [p100<=1] & [p184<=1 & p116<=0]]]]]]]

abstracting: (p116<=0)
states: 624,269,451,192 (11)
abstracting: (p184<=1)
states: 7,969,347,823,493 (12)
abstracting: (p100<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p187)
states: 1,890,765,980,997 (12)
.abstracting: (p63<=0)
states: 7,638,892,076,357 (12)
abstracting: (p56<=0)
states: 7,549,853,984,373 (12)
.abstracting: (p75<=0)
states: 7,509,967,901,949 (12)
........................
before gc: list nodes free: 12365143

after gc: idd nodes used:1625685, unused:62374315; list nodes free:290583681
.......................................
before gc: list nodes free: 9496471

after gc: idd nodes used:1591172, unused:62408828; list nodes free:290755036
...............................................
EG iterations: 109
MC time: 4m40.019sec

checking: A [p97<=0 U EG [E [~ [AX [p162<=p82]] U [[[1<=p65 | p60<=p155] | [p121<=1 | p0<=p126]] | EX [p76<=1]]]]]
normalized: [~ [EG [~ [EG [E [EX [~ [p162<=p82]] U [EX [p76<=1] | [[p121<=1 | p0<=p126] | [1<=p65 | p60<=p155]]]]]]]] & ~ [E [~ [EG [E [EX [~ [p162<=p82]] U [EX [p76<=1] | [[p121<=1 | p0<=p126] | [1<=p65 | p60<=p155]]]]]] U [~ [p97<=0] & ~ [EG [E [EX [~ [p162<=p82]] U [EX [p76<=1] | [[p121<=1 | p0<=p126] | [1<=p65 | p60<=p155]]]]]]]]]]

abstracting: (p60<=p155)
states: 7,920,957,630,308 (12)
abstracting: (1<=p65)
states: 455,363,118,936 (11)
abstracting: (p0<=p126)
states: 7,969,347,823,492 (12)
abstracting: (p121<=1)
states: 7,969,347,823,493 (12)
abstracting: (p76<=1)
states: 7,969,347,823,493 (12)
.abstracting: (p162<=p82)
states: 6,612,856,723,550 (12)
.
EG iterations: 0
abstracting: (p97<=0)
states: 6,034,418,242,771 (12)
abstracting: (p60<=p155)
states: 7,920,957,630,308 (12)
abstracting: (1<=p65)
states: 455,363,118,936 (11)
abstracting: (p0<=p126)
states: 7,969,347,823,492 (12)
abstracting: (p121<=1)
states: 7,969,347,823,493 (12)
abstracting: (p76<=1)
states: 7,969,347,823,493 (12)
.abstracting: (p162<=p82)
states: 6,612,856,723,550 (12)
.
EG iterations: 0
abstracting: (p60<=p155)
states: 7,920,957,630,308 (12)
abstracting: (1<=p65)
states: 455,363,118,936 (11)
abstracting: (p0<=p126)
states: 7,969,347,823,492 (12)
abstracting: (p121<=1)
states: 7,969,347,823,493 (12)
abstracting: (p76<=1)
states: 7,969,347,823,493 (12)
.abstracting: (p162<=p82)
states: 6,612,856,723,550 (12)
.
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.744sec

checking: EF [[~ [p55<=0] & [[EF [EX [p163<=p106]] & [[AG [p134<=p146] & A [p37<=p118 U p137<=p137]] | p166<=1]] | AG [~ [AG [1<=p127]]]]]]
normalized: E [true U [[~ [E [true U ~ [E [true U ~ [1<=p127]]]]] | [[p166<=1 | [[~ [EG [~ [p137<=p137]]] & ~ [E [~ [p137<=p137] U [~ [p37<=p118] & ~ [p137<=p137]]]]] & ~ [E [true U ~ [p134<=p146]]]]] & E [true U EX [p163<=p106]]]] & ~ [p55<=0]]]

abstracting: (p55<=0)
states: 7,549,853,984,373 (12)
abstracting: (p163<=p106)
states: 5,463,336,823,997 (12)
.abstracting: (p134<=p146)
states: 6,185,263,516,805 (12)
abstracting: (p137<=p137)
states: 7,969,347,823,493 (12)
abstracting: (p37<=p118)
states: 7,740,119,990,884 (12)
abstracting: (p137<=p137)
states: 7,969,347,823,493 (12)
abstracting: (p137<=p137)
states: 7,969,347,823,493 (12)
.
EG iterations: 1
abstracting: (p166<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p127)
states: 2,938,609,093,308 (12)

before gc: list nodes free: 15858053

after gc: idd nodes used:1814332, unused:62185668; list nodes free:289848510
-> the formula is TRUE

FORMULA DES-PT-20a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 2.684sec

checking: [AF [EG [[EG [[p148<=1 & p181<=p97]] & p34<=p105]]] | EG [[AG [AX [EG [1<=p133]]] & AF [E [[p102<=p109 & 1<=p132] U [p128<=p138 & p186<=p117]]]]]]
normalized: [EG [[~ [EG [~ [E [[p102<=p109 & 1<=p132] U [p128<=p138 & p186<=p117]]]]] & ~ [E [true U EX [~ [EG [1<=p133]]]]]]] | ~ [EG [~ [EG [[p34<=p105 & EG [[p148<=1 & p181<=p97]]]]]]]]

abstracting: (p181<=p97)
states: 7,676,779,552,111 (12)
abstracting: (p148<=1)
states: 7,969,347,823,493 (12)
...........
before gc: list nodes free: 17806596

after gc: idd nodes used:2707431, unused:61292569; list nodes free:285516871
..................................
EG iterations: 45
abstracting: (p34<=p105)
states: 7,621,728,291,305 (12)
...
before gc: list nodes free: 13175418

after gc: idd nodes used:2133588, unused:61866412; list nodes free:288448381
....................................MC time: 4m43.020sec

checking: ~ [[E [AG [~ [[EX [1<=p35] & ~ [p183<=p124]]]] U [[AX [~ [p50<=p122]] & EF [AF [p103<=p49]]] | [[EX [p9<=p135] & AF [p56<=p180]] | ~ [[E [1<=p22 U p120<=p11] & AG [p104<=0]]]]]] & EG [[[[AG [p71<=p194] & 1<=p85] & A [EF [p188<=p41] U [p24<=0 | p184<=0]]] | ~ [AX [AG [p114<=p148]]]]]]]
normalized: ~ [[EG [[EX [E [true U ~ [p114<=p148]]] | [[~ [EG [~ [[p24<=0 | p184<=0]]]] & ~ [E [~ [[p24<=0 | p184<=0]] U [~ [E [true U p188<=p41]] & ~ [[p24<=0 | p184<=0]]]]]] & [1<=p85 & ~ [E [true U ~ [p71<=p194]]]]]]] & E [~ [E [true U [~ [p183<=p124] & EX [1<=p35]]]] U [[~ [[~ [E [true U ~ [p104<=0]]] & E [1<=p22 U p120<=p11]]] | [~ [EG [~ [p56<=p180]]] & EX [p9<=p135]]] | [E [true U ~ [EG [~ [p103<=p49]]]] & ~ [EX [p50<=p122]]]]]]]

abstracting: (p50<=p122)
states: 7,814,665,278,469 (12)

before gc: list nodes free: 10012804

after gc: idd nodes used:2076800, unused:61923200; list nodes free:288645479
.abstracting: (p103<=p49)
states: 6,198,877,619,851 (12)
...............
before gc: list nodes free: 16811298

after gc: idd nodes used:2816756, unused:61183244; list nodes free:285424951
..........MC time: 4m 2.052sec

checking: E [[A [A [AG [p137<=1] U [AF [p133<=1] & [p185<=0 | p175<=p101]]] U AG [[[1<=p87 & 1<=p101] | [1<=p103 & p24<=1]]]] & EX [AF [[~ [p185<=0] | p131<=0]]]] U [AF [p193<=1] & [EG [[~ [p175<=p114] & EX [p65<=1]]] & [EG [[[p115<=1 | 1<=p48] | E [p164<=p192 U p140<=p115]]] & ~ [EX [[p146<=p151 & p27<=p23]]]]]]]
normalized: E [[EX [~ [EG [~ [[p131<=0 | ~ [p185<=0]]]]]] & [~ [EG [E [true U ~ [[[1<=p103 & p24<=1] | [1<=p87 & 1<=p101]]]]]] & ~ [E [E [true U ~ [[[1<=p103 & p24<=1] | [1<=p87 & 1<=p101]]]] U [~ [[~ [EG [~ [[[p185<=0 | p175<=p101] & ~ [EG [~ [p133<=1]]]]]]] & ~ [E [~ [[[p185<=0 | p175<=p101] & ~ [EG [~ [p133<=1]]]]] U [E [true U ~ [p137<=1]] & ~ [[[p185<=0 | p175<=p101] & ~ [EG [~ [p133<=1]]]]]]]]]] & E [true U ~ [[[1<=p103 & p24<=1] | [1<=p87 & 1<=p101]]]]]]]]] U [[[~ [EX [[p146<=p151 & p27<=p23]]] & EG [[E [p164<=p192 U p140<=p115] | [p115<=1 | 1<=p48]]]] & EG [[EX [p65<=1] & ~ [p175<=p114]]]] & ~ [EG [~ [p193<=1]]]]]

abstracting: (p193<=1)
states: 7,969,347,823,493 (12)
.
EG iterations: 1
abstracting: (p175<=p114)
states: 7,820,197,523,986 (12)
abstracting: (p65<=1)
states: 7,969,347,823,493 (12)

before gc: list nodes free: 17199685

after gc: idd nodes used:2173725, unused:61826275; list nodes free:288284715
...............................
before gc: list nodes free: 11926300

after gc: idd nodes used:2346349, unused:61653651; list nodes free:287460519
..........................
EG iterations: 56
abstracting: (1<=p48)
states: 419,493,839,120 (11)
abstracting: (p115<=1)
states: 7,969,347,823,493 (12)
abstracting: (p140<=p115)
states: 6,235,188,890,319 (12)
abstracting: (p164<=p192)
states: 7,073,108,535,647 (12)

EG iterations: 0
abstracting: (p27<=p23)
states: 7,509,967,901,949 (12)
abstracting: (p146<=p151)
states: 4,722,693,399,997 (12)
MC time: 3m28.016sec

checking: [[[EG [EF [[p151<=p71 | p43<=1]]] & AX [[[AG [1<=p57] & ~ [p119<=p76]] | ~ [[E [p120<=0 U p63<=p30] & [p127<=0 & p175<=p127]]]]]] & ~ [EG [~ [[E [p126<=1 U p71<=0] | [AX [p8<=p156] | ~ [p63<=p12]]]]]]] | ~ [[[~ [A [[AG [1<=p136] & E [1<=p61 U 1<=p122]] U p27<=1]] | A [[[[1<=p16 | p187<=p70] | A [p30<=p107 U p160<=p182]] | ~ [EX [p78<=0]]] U AG [[p7<=1 | p183<=1]]]] & AF [~ [[[EX [p141<=1] & AX [p189<=p32]] | p101<=1]]]]]]
normalized: [~ [[~ [EG [[p101<=1 | [~ [EX [~ [p189<=p32]]] & EX [p141<=1]]]]] & [[~ [EG [E [true U ~ [[p7<=1 | p183<=1]]]]] & ~ [E [E [true U ~ [[p7<=1 | p183<=1]]] U [~ [[~ [EX [p78<=0]] | [[~ [EG [~ [p160<=p182]]] & ~ [E [~ [p160<=p182] U [~ [p30<=p107] & ~ [p160<=p182]]]]] | [1<=p16 | p187<=p70]]]] & E [true U ~ [[p7<=1 | p183<=1]]]]]]] | ~ [[~ [EG [~ [p27<=1]]] & ~ [E [~ [p27<=1] U [~ [[E [1<=p61 U 1<=p122] & ~ [E [true U ~ [1<=p136]]]]] & ~ [p27<=1]]]]]]]]] | [~ [EG [~ [[[~ [p63<=p12] | ~ [EX [~ [p8<=p156]]]] | E [p126<=1 U p71<=0]]]]] & [~ [EX [~ [[~ [[[p127<=0 & p175<=p127] & E [p120<=0 U p63<=p30]]] | [~ [p119<=p76] & ~ [E [true U ~ [1<=p57]]]]]]]] & EG [E [true U [p151<=p71 | p43<=1]]]]]]

abstracting: (p43<=1)
states: 7,969,347,823,493 (12)
abstracting: (p151<=p71)
states: 5,200,691,207,649 (12)

EG iterations: 0
abstracting: (1<=p57)
states: 419,493,839,120 (11)
abstracting: (p119<=p76)
states: 3,203,258,349,954 (12)
abstracting: (p63<=p30)
states: 7,638,892,076,357 (12)
abstracting: (p120<=0)
states: 2,938,609,093,309 (12)
abstracting: (p175<=p127)
states: 7,871,248,839,173 (12)
abstracting: (p127<=0)
states: 5,030,738,730,185 (12)
.abstracting: (p71<=0)
states: 7,509,967,901,949 (12)
abstracting: (p126<=1)
states: 7,969,347,823,493 (12)
abstracting: (p8<=p156)
states: 7,663,600,697,853 (12)
.abstracting: (p63<=p12)
states: 7,638,892,076,357 (12)
.
EG iterations: 1
abstracting: (p27<=1)
states: 7,969,347,823,493 (12)
abstracting: (1<=p136)
states: 5,030,738,730,184 (12)
abstracting: (1<=p122)
states: 5,030,738,730,184 (12)
abstracting: (1<=p61)
states: 4
abstracting: (p27<=1)
states: 7,969,347,823,493 (12)
abstracting: (p27<=1)
states: 7,969,347,823,493 (12)
.
EG iterations: 1
abstracting: (p183<=1)
states: 7,969,347,823,493 (12)
abstracting: (p7<=1)
states: 7,969,347,823,493 (12)
abstracting: (p187<=p70)
states: 6,187,478,145,768 (12)
abstracting: (1<=p16)
states: 459,373,104,572 (11)
abstracting: (p160<=p182)
states: 6,200,741,691,245 (12)
abstracting: (p30<=p107)
states: 7,756,680,735,253 (12)
abstracting: (p160<=p182)
states: 6,200,741,691,245 (12)
abstracting: (p160<=p182)
states: 6,200,741,691,245 (12)
....
before gc: list nodes free: 16798920

after gc: idd nodes used:3652347, unused:60347653; list nodes free:281678430
..MC time: 2m58.091sec

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

abstracting: (1<=p68)
states: 459,379,921,544 (11)
................
before gc: list nodes free: 7497724

after gc: idd nodes used:3475495, unused:60524505; list nodes free:282384056
................
before gc: list nodes free: 6135757

after gc: idd nodes used:4007230, unused:59992770; list nodes free:279530286
....................
before gc: list nodes free: 7605300

after gc: idd nodes used:3805530, unused:60194470; list nodes free:280632555
..........................................................
EG iterations: 110

before gc: list nodes free: 12276037

after gc: idd nodes used:2981520, unused:61018480; list nodes free:284741694
-> the formula is FALSE

FORMULA DES-PT-20a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6071224 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16180292 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

132359
iterations count:183582 (1207), effective:19892 (130)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 224 sec


iterations count:152 (1), effective:0 (0)

iterations count:24115 (158), effective:2054 (13)

iterations count:51454 (338), effective:4823 (31)
129130
iterations count:122057 (803), effective:12896 (84)

iterations count:12979 (85), effective:783 (5)

net_ddint.h:600: Timeout: after 299 sec


iterations count:238 (1), effective:15 (0)

iterations count:2385 (15), effective:217 (1)

sat_reach.icc:155: Timeout: after 279 sec


iterations count:152 (1), effective:0 (0)

iterations count:152 (1), effective:0 (0)

iterations count:152 (1), effective:0 (0)

iterations count:230 (1), effective:15 (0)

iterations count:14348 (94), effective:1148 (7)

iterations count:1426 (9), effective:112 (0)

iterations count:56099 (369), effective:4700 (30)

iterations count:40921 (269), effective:4003 (26)

net_ddint.h:600: Timeout: after 282 sec


net_ddint.h:600: Timeout: after 241 sec


iterations count:10295 (67), effective:821 (5)

net_ddint.h:600: Timeout: after 207 sec


iterations count:152 (1), effective:0 (0)

iterations count:15449 (101), effective:1286 (8)

iterations count:1490 (9), effective:48 (0)

iterations count:4594 (30), effective:384 (2)

iterations count:14083 (92), effective:1068 (7)

iterations count:152 (1), effective:0 (0)

iterations count:3103 (20), effective:259 (1)

net_ddint.h:600: Timeout: after 177 sec


iterations count:61859 (406), effective:6099 (40)

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="DES-PT-20a"
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 DES-PT-20a, 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 r097-tall-167814469500425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;