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

About the Execution of Marcie for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10176.443 3600000.00 3600118.00 19.40 ?F??????F??T???? 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.r097-tall-167814469600457.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-40a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469600457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.4K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:41 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.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:45 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 83K 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-40a-CTLCardinality-00
FORMULA_NAME DES-PT-40a-CTLCardinality-01
FORMULA_NAME DES-PT-40a-CTLCardinality-02
FORMULA_NAME DES-PT-40a-CTLCardinality-03
FORMULA_NAME DES-PT-40a-CTLCardinality-04
FORMULA_NAME DES-PT-40a-CTLCardinality-05
FORMULA_NAME DES-PT-40a-CTLCardinality-06
FORMULA_NAME DES-PT-40a-CTLCardinality-07
FORMULA_NAME DES-PT-40a-CTLCardinality-08
FORMULA_NAME DES-PT-40a-CTLCardinality-09
FORMULA_NAME DES-PT-40a-CTLCardinality-10
FORMULA_NAME DES-PT-40a-CTLCardinality-11
FORMULA_NAME DES-PT-40a-CTLCardinality-12
FORMULA_NAME DES-PT-40a-CTLCardinality-13
FORMULA_NAME DES-PT-40a-CTLCardinality-14
FORMULA_NAME DES-PT-40a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678256383639

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-40a
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_40a
(NrP: 274 NrTr: 231 NrArc: 1116)

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

net check time: 0m 0.000sec

init dd package: 0m 2.801sec


RS generation: 0m40.516sec


-> reachability set: #nodes 211338 (2.1e+05) #states 35,225,598,483,445 (13)



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

checking: AF [~ [EF [EX [EX [1<=p172]]]]]
normalized: ~ [EG [E [true U EX [EX [1<=p172]]]]]

abstracting: (1<=p172)
states: 17,847,372,089,072 (13)
.....
before gc: list nodes free: 210651

after gc: idd nodes used:1097938, unused:62902062; list nodes free:276071570
.......
before gc: list nodes free: 813880

after gc: idd nodes used:1994585, unused:62005415; list nodes free:279471361
.....MC time: 3m43.045sec

checking: EF [AF [1<=p47]]
normalized: E [true U ~ [EG [~ [1<=p47]]]]

abstracting: (1<=p47)
states: 943,319,052,104 (11)
.....
before gc: list nodes free: 1630997

after gc: idd nodes used:643022, unused:63356978; list nodes free:288603773
...............................
before gc: list nodes free: 513180

after gc: idd nodes used:782947, unused:63217053; list nodes free:294236171
...............................................
before gc: list nodes free: 4485080

after gc: idd nodes used:750699, unused:63249301; list nodes free:294427791
.MC time: 3m29.055sec

checking: ~ [EG [[~ [p43<=0] | EF [~ [p131<=p243]]]]]
normalized: ~ [EG [[E [true U ~ [p131<=p243]] | ~ [p43<=0]]]]

abstracting: (p43<=0)
states: 34,282,279,431,341 (13)
abstracting: (p131<=p243)
states: 34,597,760,025,005 (13)
......
before gc: list nodes free: 11197330

after gc: idd nodes used:1586393, unused:62413607; list nodes free:290553446
.....MC time: 3m16.002sec

checking: EX [A [AG [AG [1<=p205]] U ~ [[EX [[p234<=p51 & p16<=1]] | ~ [EF [p4<=0]]]]]]
normalized: EX [[~ [EG [[~ [E [true U p4<=0]] | EX [[p234<=p51 & p16<=1]]]]] & ~ [E [[~ [E [true U p4<=0]] | EX [[p234<=p51 & p16<=1]]] U [E [true U E [true U ~ [1<=p205]]] & [~ [E [true U p4<=0]] | EX [[p234<=p51 & p16<=1]]]]]]]]

abstracting: (p16<=1)
states: 35,225,598,483,445 (13)
abstracting: (p234<=p51)
states: 14,844,434,361,914 (13)
.abstracting: (p4<=0)
states: 34,282,279,831,389 (13)
abstracting: (1<=p205)
states: 22,213,532,428,376 (13)

before gc: list nodes free: 5677414

after gc: idd nodes used:1143345, unused:62856655; list nodes free:292715324
abstracting: (p16<=1)
states: 35,225,598,483,445 (13)
abstracting: (p234<=p51)
states: 14,844,434,361,914 (13)
.abstracting: (p4<=0)
states: 34,282,279,831,389 (13)
abstracting: (p16<=1)
states: 35,225,598,483,445 (13)
abstracting: (p234<=p51)
states: 14,844,434,361,914 (13)
.abstracting: (p4<=0)
states: 34,282,279,831,389 (13)
MC time: 3m 4.030sec

checking: AX [A [AX [A [[p237<=1 & 1<=p226] U A [p27<=0 U p92<=0]]] U ~ [AF [AX [p238<=1]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [EG [EX [~ [p238<=1]]]]]] & ~ [E [~ [EG [EX [~ [p238<=1]]]] U [EX [~ [[~ [EG [~ [[~ [EG [~ [p92<=0]]] & ~ [E [~ [p92<=0] U [~ [p27<=0] & ~ [p92<=0]]]]]]]] & ~ [E [~ [[~ [EG [~ [p92<=0]]] & ~ [E [~ [p92<=0] U [~ [p27<=0] & ~ [p92<=0]]]]]] U [~ [[p237<=1 & 1<=p226]] & ~ [[~ [EG [~ [p92<=0]]] & ~ [E [~ [p92<=0] U [~ [p27<=0] & ~ [p92<=0]]]]]]]]]]]] & ~ [EG [EX [~ [p238<=1]]]]]]]]]]]

abstracting: (p238<=1)
states: 35,225,598,483,445 (13)
..
EG iterations: 1
abstracting: (p92<=0)
states: 34,322,165,697,669 (13)
abstracting: (p27<=0)
states: 34,282,279,431,341 (13)
abstracting: (p92<=0)
states: 34,322,165,697,669 (13)
abstracting: (p92<=0)
states: 34,322,165,697,669 (13)
......
before gc: list nodes free: 20921383

after gc: idd nodes used:1439811, unused:62560189; list nodes free:291231971
...............
before gc: list nodes free: 21120281

after gc: idd nodes used:1992642, unused:62007358; list nodes free:288471470
MC time: 2m55.216sec

checking: ~ [AG [~ [[~ [p264<=p146] & E [p249<=0 U [[1<=p221 & p77<=1] & ~ [p66<=1]]]]]]]
normalized: E [true U [E [p249<=0 U [[1<=p221 & p77<=1] & ~ [p66<=1]]] & ~ [p264<=p146]]]

abstracting: (p264<=p146)
states: 29,468,983,876,080 (13)
abstracting: (p66<=1)
states: 35,225,598,483,445 (13)
abstracting: (p77<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p221)
states: 22,213,532,428,376 (13)
abstracting: (p249<=0)
states: 32,928,538,507,076 (13)
-> the formula is FALSE

FORMULA DES-PT-40a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.938sec

checking: AX [EF [EG [~ [[[p210<=p237 | 1<=p202] & [p10<=p43 | p192<=1]]]]]]
normalized: ~ [EX [~ [E [true U EG [~ [[[p10<=p43 | p192<=1] & [p210<=p237 | 1<=p202]]]]]]]]

abstracting: (1<=p202)
states: 13,012,066,055,068 (13)
abstracting: (p210<=p237)
states: 26,718,321,802,974 (13)
abstracting: (p192<=1)
states: 35,225,598,483,445 (13)
abstracting: (p10<=p43)
states: 34,282,279,431,341 (13)
..........
before gc: list nodes free: 11627829

after gc: idd nodes used:2720252, unused:61279748; list nodes free:285667260
....MC time: 2m52.131sec

checking: EF [~ [EF [[[A [p37<=p127 U p227<=p51] & [1<=p271 & ~ [1<=p176]]] | [~ [AG [1<=p219]] | AF [1<=p47]]]]]]
normalized: E [true U ~ [E [true U [[~ [EG [~ [1<=p47]]] | E [true U ~ [1<=p219]]] | [[1<=p271 & ~ [1<=p176]] & [~ [EG [~ [p227<=p51]]] & ~ [E [~ [p227<=p51] U [~ [p37<=p127] & ~ [p227<=p51]]]]]]]]]]

abstracting: (p227<=p51)
states: 13,606,394,804,109 (13)
abstracting: (p37<=p127)
states: 34,344,526,438,055 (13)
abstracting: (p227<=p51)
states: 13,606,394,804,109 (13)
abstracting: (p227<=p51)
states: 13,606,394,804,109 (13)

before gc: list nodes free: 7958286

after gc: idd nodes used:2069589, unused:61930411; list nodes free:288505369
........
before gc: list nodes free: 9452613

after gc: idd nodes used:3484249, unused:60515751; list nodes free:281250802
.MC time: 2m40.037sec

checking: ~ [AF [A [EG [[p3<=0 & EF [1<=p184]]] U ~ [E [E [p118<=1 U 1<=p31] U [p173<=p249 & p261<=p111]]]]]]
normalized: EG [~ [[~ [EG [E [E [p118<=1 U 1<=p31] U [p173<=p249 & p261<=p111]]]] & ~ [E [E [E [p118<=1 U 1<=p31] U [p173<=p249 & p261<=p111]] U [~ [EG [[p3<=0 & E [true U 1<=p184]]]] & E [E [p118<=1 U 1<=p31] U [p173<=p249 & p261<=p111]]]]]]]]

abstracting: (p261<=p111)
states: 24,314,689,363,870 (13)
abstracting: (p173<=p249)
states: 18,958,153,039,583 (13)
abstracting: (1<=p31)
states: 943,319,052,104 (11)
abstracting: (p118<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p184)
states: 8,563,285,800,964 (12)
MC time: 2m30.159sec

checking: A [[p171<=0 | [AF [[EF [p110<=0] & ~ [E [1<=p152 U p176<=1]]]] & ~ [AX [1<=p186]]]] U AF [[A [~ [p185<=1] U AG [1<=p260]] & p91<=p49]]]
normalized: [~ [EG [EG [~ [[p91<=p49 & [~ [EG [E [true U ~ [1<=p260]]]] & ~ [E [E [true U ~ [1<=p260]] U [p185<=1 & E [true U ~ [1<=p260]]]]]]]]]]] & ~ [E [EG [~ [[p91<=p49 & [~ [EG [E [true U ~ [1<=p260]]]] & ~ [E [E [true U ~ [1<=p260]] U [p185<=1 & E [true U ~ [1<=p260]]]]]]]]] U [~ [[p171<=0 | [EX [~ [1<=p186]] & ~ [EG [~ [[~ [E [1<=p152 U p176<=1]] & E [true U p110<=0]]]]]]]] & EG [~ [[p91<=p49 & [~ [EG [E [true U ~ [1<=p260]]]] & ~ [E [E [true U ~ [1<=p260]] U [p185<=1 & E [true U ~ [1<=p260]]]]]]]]]]]]]

abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (p185<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)

EG iterations: 0
abstracting: (p91<=p49)
states: 34,346,362,654,197 (13)

EG iterations: 0
abstracting: (p110<=0)
states: 34,322,165,697,669 (13)

before gc: list nodes free: 10960158

after gc: idd nodes used:2224402, unused:61775598; list nodes free:287992894
abstracting: (p176<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p152)
states: 943,319,052,104 (11)

EG iterations: 0
abstracting: (1<=p186)
states: 18,919,410,652,226 (13)
.abstracting: (p171<=0)
states: 1
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (p185<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)

EG iterations: 0
abstracting: (p91<=p49)
states: 34,346,362,654,197 (13)

EG iterations: 0
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (p185<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)
abstracting: (1<=p260)
states: 1,704,266,009,786 (12)

EG iterations: 0
abstracting: (p91<=p49)
states: 34,346,362,654,197 (13)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DES-PT-40a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.039sec

checking: [AG [AF [[E [~ [1<=p217] U ~ [p55<=0]] & [EF [p255<=p175] | p14<=1]]]] & A [E [p246<=0 U [AX [p216<=p114] & [p30<=p181 | ~ [[1<=p245 | p163<=p174]]]]] U EX [1<=p125]]]
normalized: [[~ [EG [~ [EX [1<=p125]]]] & ~ [E [~ [EX [1<=p125]] U [~ [E [p246<=0 U [[p30<=p181 | ~ [[1<=p245 | p163<=p174]]] & ~ [EX [~ [p216<=p114]]]]]] & ~ [EX [1<=p125]]]]]] & ~ [E [true U EG [~ [[[p14<=1 | E [true U p255<=p175]] & E [~ [1<=p217] U ~ [p55<=0]]]]]]]]

abstracting: (p55<=0)
states: 34,282,279,431,341 (13)
abstracting: (1<=p217)
states: 22,213,532,428,376 (13)
abstracting: (p255<=p175)
states: 30,810,144,349,510 (13)
abstracting: (p14<=1)
states: 35,225,598,483,445 (13)
........
before gc: list nodes free: 17172671

after gc: idd nodes used:3494165, unused:60505835; list nodes free:281771819
.MC time: 2m21.246sec

checking: [AF [~ [[EG [[A [p80<=p56 U p133<=p136] & [p94<=0 | p158<=1]]] | 1<=p104]]] | EX [A [[1<=p269 & p241<=p84] U AG [[[p259<=p214 & p116<=0] & p235<=1]]]]]
normalized: [EX [[~ [EG [E [true U ~ [[p235<=1 & [p259<=p214 & p116<=0]]]]]] & ~ [E [E [true U ~ [[p235<=1 & [p259<=p214 & p116<=0]]]] U [~ [[1<=p269 & p241<=p84]] & E [true U ~ [[p235<=1 & [p259<=p214 & p116<=0]]]]]]]]] | ~ [EG [[1<=p104 | EG [[[p94<=0 | p158<=1] & [~ [EG [~ [p133<=p136]]] & ~ [E [~ [p133<=p136] U [~ [p80<=p56] & ~ [p133<=p136]]]]]]]]]]]

abstracting: (p133<=p136)
states: 34,282,279,431,341 (13)
abstracting: (p80<=p56)
states: 35,225,598,440,289 (13)
abstracting: (p133<=p136)
states: 34,282,279,431,341 (13)
abstracting: (p133<=p136)
states: 34,282,279,431,341 (13)
................
before gc: list nodes free: 4681522

after gc: idd nodes used:3229029, unused:60770971; list nodes free:283356143
......MC time: 2m11.064sec

checking: A [A [[[[p256<=p115 | [[p45<=p236 & 1<=p257] | [p89<=p206 & p93<=0]]] | ~ [p88<=p113]] & EG [AF [1<=p230]]] U p43<=1] U ~ [[p80<=1 | AF [EG [EX [1<=p53]]]]]]
normalized: [~ [EG [[p80<=1 | ~ [EG [~ [EG [EX [1<=p53]]]]]]]] & ~ [E [[p80<=1 | ~ [EG [~ [EG [EX [1<=p53]]]]]] U [~ [[~ [EG [~ [p43<=1]]] & ~ [E [~ [p43<=1] U [~ [[EG [~ [EG [~ [1<=p230]]]] & [~ [p88<=p113] | [p256<=p115 | [[p89<=p206 & p93<=0] | [p45<=p236 & 1<=p257]]]]]] & ~ [p43<=1]]]]]] & [p80<=1 | ~ [EG [~ [EG [EX [1<=p53]]]]]]]]]]

abstracting: (1<=p53)
states: 943,319,052,104 (11)
................
before gc: list nodes free: 930416

after gc: idd nodes used:3440589, unused:60559411; list nodes free:282008129
.........MC time: 2m 1.010sec

checking: EF [[E [[~ [[p46<=p41 | 1<=p180]] & 1<=p265] U p260<=1] & A [~ [[AX [1<=p83] | [EG [p131<=1] | [1<=p215 | p228<=0]]]] U [[EX [1<=p83] | ~ [p64<=0]] | EG [A [1<=p236 U p249<=p253]]]]]]
normalized: E [true U [[~ [EG [~ [[EG [[~ [EG [~ [p249<=p253]]] & ~ [E [~ [p249<=p253] U [~ [1<=p236] & ~ [p249<=p253]]]]]] | [~ [p64<=0] | EX [1<=p83]]]]]] & ~ [E [~ [[EG [[~ [EG [~ [p249<=p253]]] & ~ [E [~ [p249<=p253] U [~ [1<=p236] & ~ [p249<=p253]]]]]] | [~ [p64<=0] | EX [1<=p83]]]] U [[[[1<=p215 | p228<=0] | EG [p131<=1]] | ~ [EX [~ [1<=p83]]]] & ~ [[EG [[~ [EG [~ [p249<=p253]]] & ~ [E [~ [p249<=p253] U [~ [1<=p236] & ~ [p249<=p253]]]]]] | [~ [p64<=0] | EX [1<=p83]]]]]]]] & E [[1<=p265 & ~ [[p46<=p41 | 1<=p180]]] U p260<=1]]]

abstracting: (p260<=1)
states: 35,225,598,483,445 (13)
abstracting: (1<=p180)
states: 7,027,566,875,696 (12)
abstracting: (p46<=p41)
states: 34,282,279,431,341 (13)
abstracting: (1<=p265)
states: 8,353,616,147,277 (12)
abstracting: (1<=p83)
states: 903,432,785,776 (11)
.abstracting: (p64<=0)
states: 34,282,279,431,341 (13)
abstracting: (p249<=p253)
states: 33,188,302,802,783 (13)
abstracting: (1<=p236)
states: 20,941,133,233,595 (13)
abstracting: (p249<=p253)
states: 33,188,302,802,783 (13)
abstracting: (p249<=p253)
states: 33,188,302,802,783 (13)
....
before gc: list nodes free: 7304333

after gc: idd nodes used:4503618, unused:59496382; list nodes free:277008966
.MC time: 1m53.063sec

checking: ~ [AG [~ [E [[[[p115<=p56 & p178<=p161] & 1<=p78] & [[1<=p103 & p270<=p169] | [p212<=p84 | p248<=p95]]] U [p105<=p74 & [[p25<=p145 | 1<=p191] & ~ [p154<=p109]]]]]]]
normalized: E [true U E [[[[p212<=p84 | p248<=p95] | [1<=p103 & p270<=p169]] & [1<=p78 & [p115<=p56 & p178<=p161]]] U [p105<=p74 & [~ [p154<=p109] & [p25<=p145 | 1<=p191]]]]]

abstracting: (1<=p191)
states: 23,373,660,519,151 (13)
abstracting: (p25<=p145)
states: 34,581,631,354,933 (13)
abstracting: (p154<=p109)
states: 34,306,476,387,869 (13)
abstracting: (p105<=p74)
states: 34,346,232,223,813 (13)
abstracting: (p178<=p161)
states: 32,513,652,226,863 (13)
abstracting: (p115<=p56)
states: 34,346,362,654,197 (13)
abstracting: (1<=p78)
states: 159,178,929,171 (11)
abstracting: (p270<=p169)
states: 33,595,830,287,289 (13)
abstracting: (1<=p103)
states: 903,432,785,776 (11)
abstracting: (p248<=p95)
states: 34,039,451,790,664 (13)
abstracting: (p212<=p84)
states: 22,547,252,799,001 (13)
-> the formula is TRUE

FORMULA DES-PT-40a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.862sec

checking: AX [[[[[AF [EG [p27<=p149]] | p79<=1] | AF [[A [p164<=0 U p78<=p0] & ~ [p204<=1]]]] & ~ [EG [EF [p235<=1]]]] | ~ [[[p221<=1 & [[[p157<=1 & p100<=p98] | [p42<=p117 | p53<=p133]] | EX [1<=p12]]] & AF [[A [p53<=1 U p213<=p41] | [p124<=p212 & p97<=1]]]]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [~ [[[p124<=p212 & p97<=1] | [~ [EG [~ [p213<=p41]]] & ~ [E [~ [p213<=p41] U [~ [p53<=1] & ~ [p213<=p41]]]]]]]]] & [p221<=1 & [EX [1<=p12] | [[p42<=p117 | p53<=p133] | [p157<=1 & p100<=p98]]]]]] | [~ [EG [E [true U p235<=1]]] & [~ [EG [~ [[~ [p204<=1] & [~ [EG [~ [p78<=p0]]] & ~ [E [~ [p78<=p0] U [~ [p164<=0] & ~ [p78<=p0]]]]]]]]] | [p79<=1 | ~ [EG [~ [EG [p27<=p149]]]]]]]]]]]

abstracting: (p27<=p149)
states: 34,360,793,224,199 (13)
.............
before gc: list nodes free: 9156470

after gc: idd nodes used:4442047, unused:59557953; list nodes free:277890852
...........MC time: 1m47.047sec

checking: AF [~ [EF [EX [EX [1<=p172]]]]]
normalized: ~ [EG [E [true U EX [EX [1<=p172]]]]]

abstracting: (1<=p172)
states: 17,847,372,089,072 (13)
..
before gc: list nodes free: 10255954

after gc: idd nodes used:4205868, unused:59794132; list nodes free:279181557
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6049480 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16181484 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.000sec

151708 182438 198872 190920 200258 201864 203841 214713
iterations count:871957 (3774), effective:56567 (244)

initing FirstDep: 0m 0.000sec


iterations count:26840 (116), effective:699 (3)

net_ddint.h:600: Timeout: after 222 sec


net_ddint.h:600: Timeout: after 208 sec

292328 296328
iterations count:281520 (1218), effective:18052 (78)

net_ddint.h:600: Timeout: after 195 sec


iterations count:11079 (47), effective:759 (3)

iterations count:30379 (131), effective:939 (4)

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

iterations count:11079 (47), effective:759 (3)

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

iterations count:11079 (47), effective:759 (3)

net_ddint.h:600: Timeout: after 183 sec


iterations count:72841 (315), effective:5656 (24)

net_ddint.h:600: Timeout: after 171 sec


net_ddint.h:600: Timeout: after 171 sec


iterations count:8011 (34), effective:403 (1)

net_ddint.h:600: Timeout: after 159 sec


iterations count:94130 (407), effective:5838 (25)

iterations count:3529 (15), effective:248 (1)

sat_reach.icc:155: Timeout: after 149 sec


iterations count:262 (1), effective:3 (0)

iterations count:262 (1), effective:3 (0)

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

iterations count:262 (1), effective:3 (0)

iterations count:37824 (163), effective:2126 (9)

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

iterations count:262 (1), effective:3 (0)

iterations count:262 (1), effective:3 (0)

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

iterations count:262 (1), effective:3 (0)

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

iterations count:262 (1), effective:3 (0)

iterations count:262 (1), effective:3 (0)

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

iterations count:262 (1), effective:3 (0)

iterations count:8815 (38), effective:495 (2)

iterations count:10899 (47), effective:447 (1)

net_ddint.h:600: Timeout: after 140 sec


net_ddint.h:600: Timeout: after 130 sec


net_ddint.h:600: Timeout: after 120 sec


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

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

net_ddint.h:600: Timeout: after 112 sec


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

iterations count:50714 (219), effective:3782 (16)

net_ddint.h:600: Timeout: after 106 sec


iterations count:26840 (116), effective:699 (3)

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-40a"
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-40a, 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-167814469600457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;