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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 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.0K 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 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 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 70K 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-30a-CTLCardinality-00
FORMULA_NAME DES-PT-30a-CTLCardinality-01
FORMULA_NAME DES-PT-30a-CTLCardinality-02
FORMULA_NAME DES-PT-30a-CTLCardinality-03
FORMULA_NAME DES-PT-30a-CTLCardinality-04
FORMULA_NAME DES-PT-30a-CTLCardinality-05
FORMULA_NAME DES-PT-30a-CTLCardinality-06
FORMULA_NAME DES-PT-30a-CTLCardinality-07
FORMULA_NAME DES-PT-30a-CTLCardinality-08
FORMULA_NAME DES-PT-30a-CTLCardinality-09
FORMULA_NAME DES-PT-30a-CTLCardinality-10
FORMULA_NAME DES-PT-30a-CTLCardinality-11
FORMULA_NAME DES-PT-30a-CTLCardinality-12
FORMULA_NAME DES-PT-30a-CTLCardinality-13
FORMULA_NAME DES-PT-30a-CTLCardinality-14
FORMULA_NAME DES-PT-30a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678254192598

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-30a
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_30a
(NrP: 234 NrTr: 191 NrArc: 926)

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

net check time: 0m 0.000sec

init dd package: 0m 2.865sec


RS generation: 0m22.071sec


-> reachability set: #nodes 178203 (1.8e+05) #states 19,177,775,757,445 (13)



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

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

abstracting: (1<=p51)
states: 701,349,486,824 (11)
-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.773sec

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

abstracting: (1<=p88)
states: 493,768,553,746 (11)
.-> the formula is TRUE

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

MC time: 0m59.628sec

checking: E [p117<=1 U 1<=p111]
normalized: E [p117<=1 U 1<=p111]

abstracting: (1<=p111)
states: 701,349,486,824 (11)
abstracting: (p117<=1)
states: 19,177,775,757,445 (13)
-> the formula is TRUE

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

MC time: 0m27.335sec

checking: [EG [p114<=1] & ~ [AG [~ [AX [[AX [1<=p101] | p137<=1]]]]]]
normalized: [E [true U ~ [EX [~ [[p137<=1 | ~ [EX [~ [1<=p101]]]]]]]] & EG [p114<=1]]

abstracting: (p114<=1)
states: 19,177,775,757,445 (13)

EG iterations: 0
abstracting: (1<=p101)
states: 701,349,486,824 (11)
.abstracting: (p137<=1)
states: 19,177,775,757,445 (13)
.-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.493sec

checking: AX [[1<=p89 | AF [~ [p194<=p200]]]]
normalized: ~ [EX [~ [[1<=p89 | ~ [EG [p194<=p200]]]]]]

abstracting: (p194<=p200)
states: 15,220,563,603,205 (13)
.
EG iterations: 1
abstracting: (1<=p89)
states: 187,413,102,598 (11)
.-> the formula is FALSE

FORMULA DES-PT-30a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.902sec

checking: EG [[[[EF [AX [p92<=p70]] | p0<=0] | AX [AF [AF [1<=p17]]]] | EX [p4<=0]]]
normalized: EG [[EX [p4<=0] | [~ [EX [EG [EG [~ [1<=p17]]]]] | [p0<=0 | E [true U ~ [EX [~ [p92<=p70]]]]]]]]

abstracting: (p92<=p70)
states: 18,690,952,872,117 (13)
.
before gc: list nodes free: 1530301

after gc: idd nodes used:494040, unused:63505960; list nodes free:280796243
abstracting: (p0<=0)
states: 19,177,775,757,444 (13)
abstracting: (1<=p17)
states: 701,349,486,824 (11)
........................................
before gc: list nodes free: 1411272

after gc: idd nodes used:1033721, unused:62966279; list nodes free:288479602
.................................................................................
before gc: list nodes free: 1328115

after gc: idd nodes used:639510, unused:63360490; list nodes free:290628185
...............................................................
EG iterations: 184
.
EG iterations: 1
.abstracting: (p4<=0)
states: 18,476,426,568,589 (13)
.
EG iterations: 0
-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m33.621sec

checking: [~ [AX [EG [[EX [p177<=p55] & ~ [p190<=0]]]]] & AG [AF [~ [A [p168<=0 U 1<=p74]]]]]
normalized: [~ [E [true U EG [[~ [EG [~ [1<=p74]]] & ~ [E [~ [1<=p74] U [~ [p168<=0] & ~ [1<=p74]]]]]]]] & EX [~ [EG [[~ [p190<=0] & EX [p177<=p55]]]]]]

abstracting: (p177<=p55)
states: 7,500,539,731,356 (12)
.abstracting: (p190<=0)
states: 12,097,627,311,257 (13)
......
before gc: list nodes free: 5428784

after gc: idd nodes used:1716482, unused:62283518; list nodes free:285450367
.......
before gc: list nodes free: 1281752

after gc: idd nodes used:1619374, unused:62380626; list nodes free:288302167
....
before gc: list nodes free: 500218

after gc: idd nodes used:2892193, unused:61107807; list nodes free:282471702
...MC time: 5m24.223sec

checking: AG [AF [[AF [A [p114<=1 U p213<=0]] & ~ [E [p181<=0 U p15<=p199]]]]]
normalized: ~ [E [true U EG [~ [[~ [E [p181<=0 U p15<=p199]] & ~ [EG [~ [[~ [EG [~ [p213<=0]]] & ~ [E [~ [p213<=0] U [~ [p114<=1] & ~ [p213<=0]]]]]]]]]]]]]

abstracting: (p213<=0)
states: 17,139,804,186,480 (13)
abstracting: (p114<=1)
states: 19,177,775,757,445 (13)
abstracting: (p213<=0)
states: 17,139,804,186,480 (13)
abstracting: (p213<=0)
states: 17,139,804,186,480 (13)
...
before gc: list nodes free: 879005

after gc: idd nodes used:1270096, unused:62729904; list nodes free:289658076
.............
before gc: list nodes free: 4239622

after gc: idd nodes used:1876730, unused:62123270; list nodes free:286979972
...............
before gc: list nodes free: 5398268

after gc: idd nodes used:1295485, unused:62704515; list nodes free:289796720
.........MC time: 4m51.015sec

checking: AG [[AX [~ [p118<=0]] | [p201<=1 | ~ [AF [[EF [p52<=p182] | [1<=p69 & 1<=p9]]]]]]]
normalized: ~ [E [true U ~ [[[p201<=1 | EG [~ [[[1<=p69 & 1<=p9] | E [true U p52<=p182]]]]] | ~ [EX [p118<=0]]]]]]

abstracting: (p118<=0)
states: 18,631,630,723,514 (13)
.abstracting: (p52<=p182)
states: 18,735,897,660,885 (13)
abstracting: (1<=p9)
states: 701,349,486,824 (11)
abstracting: (1<=p69)
states: 661,463,220,496 (11)
.
EG iterations: 1
abstracting: (p201<=1)
states: 19,177,775,757,445 (13)
-> the formula is TRUE

FORMULA DES-PT-30a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.886sec

checking: [EF [AX [EG [[[p27<=1 | p136<=p20] | AF [p141<=1]]]]] | AX [~ [AF [[~ [1<=p127] & AF [p34<=p147]]]]]]
normalized: [~ [EX [~ [EG [~ [[~ [EG [~ [p34<=p147]]] & ~ [1<=p127]]]]]]] | E [true U ~ [EX [~ [EG [[~ [EG [~ [p141<=1]]] | [p27<=1 | p136<=p20]]]]]]]]

abstracting: (p136<=p20)
states: 14,694,141,263,667 (13)
abstracting: (p27<=1)
states: 19,177,775,757,445 (13)
abstracting: (p141<=1)
states: 19,177,775,757,445 (13)
.
EG iterations: 1

EG iterations: 0
.abstracting: (1<=p127)
states: 6,690,034,165,637 (12)
abstracting: (p34<=p147)
states: 18,827,202,726,923 (13)
.............................
before gc: list nodes free: 4323873

after gc: idd nodes used:1455060, unused:62544940; list nodes free:289039445
.................................................................................................
before gc: list nodes free: 2852544

after gc: idd nodes used:1381889, unused:62618111; list nodes free:289348040
...................................
EG iterations: 161
.........
before gc: list nodes free: 5290083

after gc: idd nodes used:2362531, unused:61637469; list nodes free:284906608
MC time: 4m48.200sec

checking: EF [E [E [[p196<=p162 & ~ [p127<=p95]] U EG [AF [1<=p114]]] U ~ [A [E [p2<=0 U 1<=p158] U E [p138<=0 U 1<=p27]]]]]
normalized: E [true U E [E [[p196<=p162 & ~ [p127<=p95]] U EG [~ [EG [~ [1<=p114]]]]] U ~ [[~ [EG [~ [E [p138<=0 U 1<=p27]]]] & ~ [E [~ [E [p138<=0 U 1<=p27]] U [~ [E [p2<=0 U 1<=p158]] & ~ [E [p138<=0 U 1<=p27]]]]]]]]]

abstracting: (1<=p27)
states: 655,248,989,030 (11)
abstracting: (p138<=0)
states: 16,253,371,171,777 (13)
abstracting: (1<=p158)
states: 12,162,487,921,991 (13)
abstracting: (p2<=0)
states: 18,574,521,293,149 (13)
abstracting: (1<=p27)
states: 655,248,989,030 (11)
abstracting: (p138<=0)
states: 16,253,371,171,777 (13)
abstracting: (1<=p27)
states: 655,248,989,030 (11)
abstracting: (p138<=0)
states: 16,253,371,171,777 (13)
...............................................................
before gc: list nodes free: 9609610

after gc: idd nodes used:1905753, unused:62094247; list nodes free:286794621
..................................................................................
EG iterations: 145
abstracting: (1<=p114)
states: 701,349,486,824 (11)
.............
before gc: list nodes free: 4035752

after gc: idd nodes used:2078124, unused:61921876; list nodes free:286125183
MC time: 4m16.269sec

checking: ~ [A [[AF [[p60<=p90 & AF [p16<=p119]]] | 1<=p218] U ~ [EX [[~ [[1<=p61 & 1<=p215]] & [[p114<=0 & p183<=1] | p147<=p218]]]]]]
normalized: ~ [[~ [EG [EX [[[p147<=p218 | [p114<=0 & p183<=1]] & ~ [[1<=p61 & 1<=p215]]]]]] & ~ [E [EX [[[p147<=p218 | [p114<=0 & p183<=1]] & ~ [[1<=p61 & 1<=p215]]]] U [~ [[1<=p218 | ~ [EG [~ [[p60<=p90 & ~ [EG [~ [p16<=p119]]]]]]]]] & EX [[[p147<=p218 | [p114<=0 & p183<=1]] & ~ [[1<=p61 & 1<=p215]]]]]]]]]

abstracting: (1<=p215)
states: 3,303,352,443,135 (12)
abstracting: (1<=p61)
states: 661,463,220,496 (11)
abstracting: (p183<=1)
states: 19,177,775,757,445 (13)
abstracting: (p114<=0)
states: 18,476,426,270,621 (13)
abstracting: (p147<=p218)
states: 11,748,136,987,103 (13)
.abstracting: (p16<=p119)
states: 18,476,426,270,621 (13)
..................................................
before gc: list nodes free: 1688900

after gc: idd nodes used:1955165, unused:62044835; list nodes free:288689252
............................................................................................................
before gc: list nodes free: 6158382

after gc: idd nodes used:1765997, unused:62234003; list nodes free:289717155
..........................
EG iterations: 184
abstracting: (p60<=p90)
states: 19,177,775,714,291 (13)
............................................
EG iterations: 44
abstracting: (1<=p218)
states: 4,359,173,841,050 (12)
abstracting: (1<=p215)
states: 3,303,352,443,135 (12)
abstracting: (1<=p61)
states: 661,463,220,496 (11)
abstracting: (p183<=1)
states: 19,177,775,757,445 (13)
abstracting: (p114<=0)
states: 18,476,426,270,621 (13)
abstracting: (p147<=p218)
states: 11,748,136,987,103 (13)
MC time: 3m48.013sec

checking: E [[EF [1<=p64] & A [AG [[p87<=1 & [p51<=0 & p47<=0]]] U ~ [E [AG [p168<=1] U [p27<=p18 | p56<=1]]]]] U AF [E [[~ [1<=p221] & p210<=1] U EF [[p151<=p13 & 1<=p124]]]]]
normalized: E [[[~ [EG [E [~ [E [true U ~ [p168<=1]]] U [p27<=p18 | p56<=1]]]] & ~ [E [E [~ [E [true U ~ [p168<=1]]] U [p27<=p18 | p56<=1]] U [E [true U ~ [[p87<=1 & [p51<=0 & p47<=0]]]] & E [~ [E [true U ~ [p168<=1]]] U [p27<=p18 | p56<=1]]]]]] & E [true U 1<=p64]] U ~ [EG [~ [E [[p210<=1 & ~ [1<=p221]] U E [true U [p151<=p13 & 1<=p124]]]]]]]

abstracting: (1<=p124)
states: 6,385,123,009,256 (12)
abstracting: (p151<=p13)
states: 6,914,857,231,026 (12)
abstracting: (1<=p221)
states: 6,081,591,320,393 (12)
abstracting: (p210<=1)
states: 19,177,775,757,445 (13)
.
EG iterations: 1
abstracting: (1<=p64)
states: 661,463,220,496 (11)

before gc: list nodes free: 21108718

after gc: idd nodes used:2255238, unused:61744762; list nodes free:287561289
MC time: 3m31.187sec

checking: EG [[[[[p150<=p65 & EX [[1<=p194 | p140<=0]]] & [p164<=0 | [EX [p76<=1] & E [1<=p159 U 1<=p232]]]] | [AX [1<=p214] | AF [1<=p121]]] | ~ [[EF [[p118<=p38 | A [p220<=0 U p142<=1]]] | 1<=p184]]]]
normalized: EG [[~ [[1<=p184 | E [true U [p118<=p38 | [~ [EG [~ [p142<=1]]] & ~ [E [~ [p142<=1] U [~ [p220<=0] & ~ [p142<=1]]]]]]]]] | [[~ [EG [~ [1<=p121]]] | ~ [EX [~ [1<=p214]]]] | [[p164<=0 | [E [1<=p159 U 1<=p232] & EX [p76<=1]]] & [p150<=p65 & EX [[1<=p194 | p140<=0]]]]]]]

abstracting: (p140<=0)
states: 15,336,047,510,469 (13)
abstracting: (1<=p194)
states: 11,407,007,756,535 (13)
.abstracting: (p150<=p65)
states: 10,084,985,294,095 (13)
abstracting: (p76<=1)
states: 19,177,775,757,445 (13)
.abstracting: (1<=p232)
states: 12,222,103,248,292 (13)
abstracting: (1<=p159)
states: 12,097,627,311,256 (13)
abstracting: (p164<=0)
states: 12,097,627,311,257 (13)
abstracting: (1<=p214)
states: 358,576,821,391 (11)
.abstracting: (1<=p121)
states: 9,468,476,578,620 (12)
.........
before gc: list nodes free: 10245701

after gc: idd nodes used:3518938, unused:60481062; list nodes free:281909502
....MC time: 2m59.124sec

checking: [EX [[~ [p206<=1] | AF [~ [[EG [1<=p169] | EG [1<=p202]]]]]] & [AG [[~ [[~ [[1<=p3 | p4<=p22]] & AF [p111<=p221]]] & [EF [[p16<=p206 & 1<=p175]] & E [EX [p129<=p0] U 1<=p163]]]] | EF [EG [p97<=0]]]]
normalized: [[E [true U EG [p97<=0]] | ~ [E [true U ~ [[[E [EX [p129<=p0] U 1<=p163] & E [true U [p16<=p206 & 1<=p175]]] & ~ [[~ [EG [~ [p111<=p221]]] & ~ [[1<=p3 | p4<=p22]]]]]]]]] & EX [[~ [EG [[EG [1<=p202] | EG [1<=p169]]]] | ~ [p206<=1]]]]

abstracting: (p206<=1)
states: 19,177,775,757,445 (13)
abstracting: (1<=p169)
states: 12,097,627,311,256 (13)
.....
before gc: list nodes free: 7304154

after gc: idd nodes used:3209220, unused:60790780; list nodes free:283310541
........
before gc: list nodes free: 4012808

after gc: idd nodes used:3801735, unused:60198265; list nodes free:280572332
MC time: 2m39.484sec

checking: A [A [[[~ [[EX [p8<=0] | [1<=p59 | p18<=p40]]] | E [p146<=0 U A [1<=p2 U p129<=p138]]] & 1<=p117] U ~ [AG [EX [p93<=1]]]] U [[AX [[p57<=p141 & [[1<=p102 | p145<=p6] | 1<=p193]]] & [[[AF [p127<=1] & AF [1<=p230]] | p196<=p1] | [[1<=p107 & p66<=p72] & AG [[p91<=0 & p117<=p180]]]]] | [[A [[E [p82<=0 U 1<=p92] | ~ [p219<=p75]] U ~ [p117<=0]] | p164<=1] & E [~ [p143<=0] U E [~ [p145<=1] U [1<=p82 | 1<=p119]]]]]]
normalized: [~ [EG [~ [[[E [~ [p143<=0] U E [~ [p145<=1] U [1<=p82 | 1<=p119]]] & [p164<=1 | [~ [EG [p117<=0]] & ~ [E [p117<=0 U [p117<=0 & ~ [[~ [p219<=p75] | E [p82<=0 U 1<=p92]]]]]]]]] | [[[~ [E [true U ~ [[p91<=0 & p117<=p180]]]] & [1<=p107 & p66<=p72]] | [p196<=p1 | [~ [EG [~ [1<=p230]]] & ~ [EG [~ [p127<=1]]]]]] & ~ [EX [~ [[p57<=p141 & [1<=p193 | [1<=p102 | p145<=p6]]]]]]]]]]] & ~ [E [~ [[[E [~ [p143<=0] U E [~ [p145<=1] U [1<=p82 | 1<=p119]]] & [p164<=1 | [~ [EG [p117<=0]] & ~ [E [p117<=0 U [p117<=0 & ~ [[~ [p219<=p75] | E [p82<=0 U 1<=p92]]]]]]]]] | [[[~ [E [true U ~ [[p91<=0 & p117<=p180]]]] & [1<=p107 & p66<=p72]] | [p196<=p1 | [~ [EG [~ [1<=p230]]] & ~ [EG [~ [p127<=1]]]]]] & ~ [EX [~ [[p57<=p141 & [1<=p193 | [1<=p102 | p145<=p6]]]]]]]]] U [~ [[~ [EG [~ [E [true U ~ [EX [p93<=1]]]]]] & ~ [E [~ [E [true U ~ [EX [p93<=1]]]] U [~ [[1<=p117 & [E [p146<=0 U [~ [EG [~ [p129<=p138]]] & ~ [E [~ [p129<=p138] U [~ [1<=p2] & ~ [p129<=p138]]]]]] | ~ [[[1<=p59 | p18<=p40] | EX [p8<=0]]]]]] & ~ [E [true U ~ [EX [p93<=1]]]]]]]]] & ~ [[[E [~ [p143<=0] U E [~ [p145<=1] U [1<=p82 | 1<=p119]]] & [p164<=1 | [~ [EG [p117<=0]] & ~ [E [p117<=0 U [p117<=0 & ~ [[~ [p219<=p75] | E [p82<=0 U 1<=p92]]]]]]]]] | [[[~ [E [true U ~ [[p91<=0 & p117<=p180]]]] & [1<=p107 & p66<=p72]] | [p196<=p1 | [~ [EG [~ [1<=p230]]] & ~ [EG [~ [p127<=1]]]]]] & ~ [EX [~ [[p57<=p141 & [1<=p193 | [1<=p102 | p145<=p6]]]]]]]]]]]]]

abstracting: (p145<=p6)
states: 10,566,430,393,147 (13)
abstracting: (1<=p102)
states: 701,349,486,824 (11)
abstracting: (1<=p193)
states: 6,406,983,260,937 (12)
abstracting: (p57<=p141)
states: 18,962,238,101,276 (13)
.abstracting: (p127<=1)
states: 19,177,775,757,445 (13)
.
EG iterations: 1
abstracting: (1<=p230)
states: 3,486,416,778,819 (12)
..........
before gc: list nodes free: 8259577

after gc: idd nodes used:4212149, unused:59787851; list nodes free:278105331
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393932 kB
MemFree: 6071620 kB
After kill :
MemTotal: 16393932 kB
MemFree: 16181968 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

157304 177364 172506 177311
iterations count:471034 (2466), effective:37457 (196)

initing FirstDep: 0m 0.000sec


iterations count:55487 (290), effective:3963 (20)

iterations count:72609 (380), effective:5411 (28)

iterations count:51256 (268), effective:3778 (19)

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

iterations count:36032 (188), effective:4063 (21)

net_ddint.h:600: Timeout: after 323 sec


net_ddint.h:600: Timeout: after 290 sec


iterations count:8874 (46), effective:664 (3)

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

net_ddint.h:600: Timeout: after 287 sec


iterations count:20692 (108), effective:1402 (7)

iterations count:10934 (57), effective:497 (2)

iterations count:20692 (108), effective:1402 (7)
205254
iterations count:127529 (667), effective:8824 (46)

iterations count:20692 (108), effective:1402 (7)

net_ddint.h:600: Timeout: after 255 sec


net_ddint.h:600: Timeout: after 227 sec


iterations count:44169 (231), effective:3068 (16)

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

sat_reach.icc:155: Timeout: after 201 sec


iterations count:4551 (23), effective:145 (0)

net_ddint.h:600: Timeout: after 178 sec


net_ddint.h:600: Timeout: after 158 sec


net_ddint.h:600: Timeout: after 140 sec

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

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