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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10044.859 1064684.00 1064080.00 0.00 FFTTTFTTFTTFTFTF 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-167814469400377.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-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r097-tall-167814469400377
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:38 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.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 14K Feb 26 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:40 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 33K 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-02a-CTLCardinality-00
FORMULA_NAME DES-PT-02a-CTLCardinality-01
FORMULA_NAME DES-PT-02a-CTLCardinality-02
FORMULA_NAME DES-PT-02a-CTLCardinality-03
FORMULA_NAME DES-PT-02a-CTLCardinality-04
FORMULA_NAME DES-PT-02a-CTLCardinality-05
FORMULA_NAME DES-PT-02a-CTLCardinality-06
FORMULA_NAME DES-PT-02a-CTLCardinality-07
FORMULA_NAME DES-PT-02a-CTLCardinality-08
FORMULA_NAME DES-PT-02a-CTLCardinality-09
FORMULA_NAME DES-PT-02a-CTLCardinality-10
FORMULA_NAME DES-PT-02a-CTLCardinality-11
FORMULA_NAME DES-PT-02a-CTLCardinality-12
FORMULA_NAME DES-PT-02a-CTLCardinality-13
FORMULA_NAME DES-PT-02a-CTLCardinality-14
FORMULA_NAME DES-PT-02a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678249620660

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-02a
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_02a
(NrP: 123 NrTr: 80 NrArc: 400)

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

net check time: 0m 0.000sec

init dd package: 0m 2.819sec


RS generation: 0m 1.845sec


-> reachability set: #nodes 46825 (4.7e+04) #states 4,953,223,116 (9)



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

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

abstracting: (1<=p5)
states: 30,340 (4)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 1.751sec

checking: ~ [AX [EG [EF [EX [1<=p7]]]]]
normalized: EX [~ [EG [E [true U EX [1<=p7]]]]]

abstracting: (1<=p7)
states: 4
.....
EG iterations: 4
.-> the formula is TRUE

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

MC time: 0m 0.030sec

checking: ~ [EG [p57<=p83]]
normalized: ~ [EG [p57<=p83]]

abstracting: (p57<=p83)
states: 4,281,072,602 (9)
...............................................................
EG iterations: 63
-> the formula is FALSE

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

MC time: 0m 7.679sec

checking: AG [[AF [EF [AX [p74<=0]]] | AG [p92<=p4]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [p92<=p4]]] | ~ [EG [~ [E [true U ~ [EX [~ [p74<=0]]]]]]]]]]]

abstracting: (p74<=0)
states: 1,717,618,163 (9)
..
EG iterations: 1
abstracting: (p92<=p4)
states: 3,516,639,678 (9)
-> the formula is TRUE

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

MC time: 0m 6.692sec

checking: AF [AF [A [E [p78<=0 U EX [p105<=0]] U EX [AG [1<=p76]]]]]
normalized: ~ [EG [EG [~ [[~ [EG [~ [EX [~ [E [true U ~ [1<=p76]]]]]]] & ~ [E [~ [EX [~ [E [true U ~ [1<=p76]]]]] U [~ [E [p78<=0 U EX [p105<=0]]] & ~ [EX [~ [E [true U ~ [1<=p76]]]]]]]]]]]]]

abstracting: (1<=p76)
states: 3,235,604,953 (9)
.abstracting: (p105<=0)
states: 4,830,976,906 (9)
.abstracting: (p78<=0)
states: 1,717,618,163 (9)
abstracting: (1<=p76)
states: 3,235,604,953 (9)
.abstracting: (1<=p76)
states: 3,235,604,953 (9)
.....................................
before gc: list nodes free: 1717444

after gc: idd nodes used:1186792, unused:62813208; list nodes free:288176016
..........................................................
EG iterations: 94
.....................................................................
EG iterations: 69
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m28.391sec

checking: EX [EF [[[1<=p120 & ~ [E [p63<=1 U 1<=p79]]] | EG [p51<=0]]]]
normalized: EX [E [true U [EG [p51<=0] | [1<=p120 & ~ [E [p63<=1 U 1<=p79]]]]]]

abstracting: (1<=p79)
states: 1,717,618,162 (9)
abstracting: (p63<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p120)
states: 3,312,883,562 (9)
abstracting: (p51<=0)
states: 3,235,604,954 (9)
....................................................................................
EG iterations: 84

before gc: list nodes free: 1667944

after gc: idd nodes used:128463, unused:63871537; list nodes free:293013580
.-> the formula is TRUE

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

MC time: 0m38.609sec

checking: EX [AF [[E [AX [p39<=0] U p61<=p115] & ~ [E [[p63<=p28 | p70<=p106] U 1<=p33]]]]]
normalized: EX [~ [EG [~ [[~ [E [[p63<=p28 | p70<=p106] U 1<=p33]] & E [~ [EX [~ [p39<=0]]] U p61<=p115]]]]]]

abstracting: (p61<=p115)
states: 3,647,243,804 (9)
abstracting: (p39<=0)
states: 3,432,066,969 (9)
.abstracting: (1<=p33)
states: 1,274,827,887 (9)
abstracting: (p70<=p106)
states: 2,551,184,935 (9)
abstracting: (p63<=p28)
states: 3,371,347,324 (9)
...........................................................
EG iterations: 59
.-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.234sec

checking: E [~ [AF [1<=p121]] U EX [A [EG [AX [p48<=p115]] U [EG [p118<=p94] | ~ [[p81<=1 | p8<=p1]]]]]]
normalized: E [EG [~ [1<=p121]] U EX [[~ [EG [~ [[~ [[p81<=1 | p8<=p1]] | EG [p118<=p94]]]]] & ~ [E [~ [[~ [[p81<=1 | p8<=p1]] | EG [p118<=p94]]] U [~ [EG [~ [EX [~ [p48<=p115]]]]] & ~ [[~ [[p81<=1 | p8<=p1]] | EG [p118<=p94]]]]]]]]]

abstracting: (p118<=p94)
states: 3,992,023,618 (9)
.........
before gc: list nodes free: 764180

after gc: idd nodes used:469137, unused:63530863; list nodes free:291425029
..................................................................................................
EG iterations: 107
abstracting: (p8<=p1)
states: 3,957,497,709 (9)
abstracting: (p81<=1)
states: 4,953,223,116 (9)
abstracting: (p48<=p115)
states: 2,481,986,166 (9)
..................
before gc: list nodes free: 1475523

after gc: idd nodes used:1138023, unused:62861977; list nodes free:288426675
...............................................................................
EG iterations: 96
abstracting: (p118<=p94)
states: 3,992,023,618 (9)
............................................
before gc: list nodes free: 1226622

after gc: idd nodes used:789757, unused:63210243; list nodes free:289970663
...............................................................
EG iterations: 107
abstracting: (p8<=p1)
states: 3,957,497,709 (9)
abstracting: (p81<=1)
states: 4,953,223,116 (9)
abstracting: (p118<=p94)
states: 3,992,023,618 (9)
...........................................................................................................
EG iterations: 107
abstracting: (p8<=p1)
states: 3,957,497,709 (9)
abstracting: (p81<=1)
states: 4,953,223,116 (9)
.............................................................
EG iterations: 61
.abstracting: (1<=p121)
states: 2,109,310,219 (9)
...........................................................................................
EG iterations: 91

before gc: list nodes free: 1358914

after gc: idd nodes used:297634, unused:63702366; list nodes free:292244016
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 5.432sec

checking: EG [[[p81<=p74 | p52<=1] & [AG [~ [[EG [p75<=p63] & ~ [1<=p72]]]] & E [~ [AF [p45<=1]] U AF [~ [1<=p49]]]]]]
normalized: EG [[[E [EG [~ [p45<=1]] U ~ [EG [1<=p49]]] & ~ [E [true U [~ [1<=p72] & EG [p75<=p63]]]]] & [p81<=p74 | p52<=1]]]

abstracting: (p52<=1)
states: 4,953,223,116 (9)
abstracting: (p81<=p74)
states: 3,907,755,468 (9)
abstracting: (p75<=p63)
states: 3,848,037,580 (9)
...........................................
EG iterations: 43
abstracting: (1<=p72)
states: 3,235,604,953 (9)
abstracting: (1<=p49)
states: 1,717,618,162 (9)
.............................................................................
EG iterations: 77
abstracting: (p45<=1)
states: 4,953,223,116 (9)
.
EG iterations: 1
............................
EG iterations: 28
-> the formula is FALSE

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

MC time: 0m36.685sec

checking: AX [[~ [EX [AG [EX [p116<=1]]]] & AF [[~ [AG [p57<=p49]] | [[EG [p93<=p3] & [p22<=1 | 1<=p14]] | [AX [p118<=0] & A [p64<=p48 U p89<=0]]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[[[~ [EG [~ [p89<=0]]] & ~ [E [~ [p89<=0] U [~ [p64<=p48] & ~ [p89<=0]]]]] & ~ [EX [~ [p118<=0]]]] | [[p22<=1 | 1<=p14] & EG [p93<=p3]]] | E [true U ~ [p57<=p49]]]]]] & ~ [EX [~ [E [true U ~ [EX [p116<=1]]]]]]]]]]

abstracting: (p116<=1)
states: 4,953,223,116 (9)
..abstracting: (p57<=p49)
states: 3,848,037,580 (9)
abstracting: (p93<=p3)
states: 1,843,692,550 (9)
................................................................................
EG iterations: 80
abstracting: (1<=p14)
states: 1,614,391,546 (9)
abstracting: (p22<=1)
states: 4,953,223,116 (9)
abstracting: (p118<=0)
states: 3,543,509,284 (9)
.abstracting: (p89<=0)
states: 1,843,692,550 (9)
abstracting: (p64<=p48)
states: 3,265,585,868 (9)
abstracting: (p89<=0)
states: 1,843,692,550 (9)
abstracting: (p89<=0)
states: 1,843,692,550 (9)
................................................................................
EG iterations: 80

before gc: list nodes free: 2349177

after gc: idd nodes used:411346, unused:63588654; list nodes free:291715061
.......................................................
EG iterations: 55
.-> the formula is TRUE

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

MC time: 1m17.605sec

checking: ~ [E [E [[[EG [p19<=p96] & ~ [[1<=p34 & p115<=1]]] & EG [~ [p32<=p71]]] U [A [~ [1<=p110] U AG [p104<=0]] | [~ [[p43<=1 & p93<=1]] & AF [p79<=1]]]] U EF [EF [1<=p49]]]]
normalized: ~ [E [E [[EG [~ [p32<=p71]] & [~ [[1<=p34 & p115<=1]] & EG [p19<=p96]]] U [[~ [EG [~ [p79<=1]]] & ~ [[p43<=1 & p93<=1]]] | [~ [EG [E [true U ~ [p104<=0]]]] & ~ [E [E [true U ~ [p104<=0]] U [1<=p110 & E [true U ~ [p104<=0]]]]]]]] U E [true U E [true U 1<=p49]]]]

abstracting: (1<=p49)
states: 1,717,618,162 (9)
abstracting: (p104<=0)
states: 3,310,559,815 (9)
abstracting: (1<=p110)
states: 1,039,825,938 (9)
abstracting: (p104<=0)
states: 3,310,559,815 (9)
abstracting: (p104<=0)
states: 3,310,559,815 (9)
............................................................
EG iterations: 60
abstracting: (p93<=1)
states: 4,953,223,116 (9)
abstracting: (p43<=1)
states: 4,953,223,116 (9)
abstracting: (p79<=1)
states: 4,953,223,116 (9)
.
EG iterations: 1
abstracting: (p19<=p96)
states: 2,547,462,984 (9)
.............................................
EG iterations: 45
abstracting: (p115<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p34)
states: 3,669,439,817 (9)
abstracting: (p32<=p71)
states: 3,937,320,306 (9)
.............................................................................
EG iterations: 77
-> the formula is FALSE

FORMULA DES-PT-02a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m36.603sec

checking: ~ [AF [[[[[EG [p52<=0] | E [p27<=0 U p81<=p82]] & ~ [[p113<=p69 | 1<=p6]]] | 1<=p120] & [[1<=p81 & AX [p118<=0]] & E [AF [1<=p29] U p78<=p49]]]]]
normalized: EG [~ [[[E [~ [EG [~ [1<=p29]]] U p78<=p49] & [1<=p81 & ~ [EX [~ [p118<=0]]]]] & [1<=p120 | [~ [[p113<=p69 | 1<=p6]] & [E [p27<=0 U p81<=p82] | EG [p52<=0]]]]]]]

abstracting: (p52<=0)
states: 1,717,618,163 (9)
.............................................................................
EG iterations: 77
abstracting: (p81<=p82)
states: 2,889,160,198 (9)
abstracting: (p27<=0)
states: 4,268,228,822 (9)
abstracting: (1<=p6)
states: 1,521,156,147 (9)
abstracting: (p113<=p69)
states: 4,456,174,414 (9)
abstracting: (1<=p120)
states: 3,312,883,562 (9)
abstracting: (p118<=0)
states: 3,543,509,284 (9)
.abstracting: (1<=p81)
states: 3,109,530,566 (9)
abstracting: (p78<=p49)
states: 2,822,803,699 (9)
abstracting: (1<=p29)
states: 1,453,483,976 (9)
..........
before gc: list nodes free: 1753841

after gc: idd nodes used:754288, unused:63245712; list nodes free:290166418
....................................................................................
EG iterations: 94
..................................................
EG iterations: 50
-> the formula is TRUE

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

MC time: 1m10.112sec

checking: EG [EG [[p57<=0 | [[[[p64<=1 & p17<=p101] & EX [p10<=0]] & p74<=p76] | [[~ [p50<=p114] & [p28<=0 | p48<=p21]] & E [p117<=p114 U 1<=p55]]]]]]
normalized: EG [EG [[p57<=0 | [[E [p117<=p114 U 1<=p55] & [[p28<=0 | p48<=p21] & ~ [p50<=p114]]] | [p74<=p76 & [EX [p10<=0] & [p64<=1 & p17<=p101]]]]]]]

abstracting: (p17<=p101)
states: 1,193,863,005 (9)
abstracting: (p64<=1)
states: 4,953,223,116 (9)
abstracting: (p10<=0)
states: 3,506,848,864 (9)
.abstracting: (p74<=p76)
states: 3,848,037,580 (9)
abstracting: (p50<=p114)
states: 2,481,986,166 (9)
abstracting: (p48<=p21)
states: 4,297,022,414 (9)
abstracting: (p28<=0)
states: 4,556,160,433 (9)
abstracting: (1<=p55)
states: 1,717,618,162 (9)
abstracting: (p117<=p114)
states: 4,221,329,896 (9)
abstracting: (p57<=0)
states: 3,235,604,954 (9)
...............................................................
EG iterations: 63
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m25.993sec

checking: [[AG [p119<=1] & A [p29<=p31 U [p26<=p59 & p80<=p49]]] | ~ [A [p113<=p108 U [[~ [[~ [p119<=p53] | 1<=p50]] & [1<=p82 | [[p122<=p4 & p28<=1] & 1<=p19]]] | [[AF [1<=p10] & ~ [p89<=1]] | ~ [EG [p9<=p106]]]]]]]
normalized: [~ [[~ [EG [~ [[[~ [EG [p9<=p106]] | [~ [p89<=1] & ~ [EG [~ [1<=p10]]]]] | [[1<=p82 | [1<=p19 & [p122<=p4 & p28<=1]]] & ~ [[1<=p50 | ~ [p119<=p53]]]]]]]] & ~ [E [~ [[[~ [EG [p9<=p106]] | [~ [p89<=1] & ~ [EG [~ [1<=p10]]]]] | [[1<=p82 | [1<=p19 & [p122<=p4 & p28<=1]]] & ~ [[1<=p50 | ~ [p119<=p53]]]]]] U [~ [p113<=p108] & ~ [[[~ [EG [p9<=p106]] | [~ [p89<=1] & ~ [EG [~ [1<=p10]]]]] | [[1<=p82 | [1<=p19 & [p122<=p4 & p28<=1]]] & ~ [[1<=p50 | ~ [p119<=p53]]]]]]]]]]] | [[~ [EG [~ [[p26<=p59 & p80<=p49]]]] & ~ [E [~ [[p26<=p59 & p80<=p49]] U [~ [p29<=p31] & ~ [[p26<=p59 & p80<=p49]]]]]] & ~ [E [true U ~ [p119<=1]]]]]

abstracting: (p119<=1)
states: 4,953,223,116 (9)
abstracting: (p80<=p49)
states: 3,385,021,644 (9)
abstracting: (p26<=p59)
states: 4,193,380,321 (9)
abstracting: (p29<=p31)
states: 3,499,739,140 (9)
abstracting: (p80<=p49)
states: 3,385,021,644 (9)
abstracting: (p26<=p59)
states: 4,193,380,321 (9)
abstracting: (p80<=p49)
states: 3,385,021,644 (9)
abstracting: (p26<=p59)
states: 4,193,380,321 (9)
................
before gc: list nodes free: 1037418

after gc: idd nodes used:1762754, unused:62237246; list nodes free:285551546
....................................................................
EG iterations: 84
abstracting: (p119<=p53)
states: 4,800,793,064 (9)
abstracting: (1<=p50)
states: 3,235,604,953 (9)
abstracting: (p28<=1)
states: 4,953,223,116 (9)
abstracting: (p122<=p4)
states: 3,725,165,333 (9)
abstracting: (1<=p19)
states: 2,505,443,579 (9)
abstracting: (1<=p82)
states: 1,598,167,746 (9)
abstracting: (1<=p10)
states: 1,446,374,252 (9)
...........................................................................................
EG iterations: 91
abstracting: (p89<=1)
states: 4,953,223,116 (9)
abstracting: (p9<=p106)
states: 2,379,333,862 (9)
..........
before gc: list nodes free: 811940

after gc: idd nodes used:1296889, unused:62703111; list nodes free:287660317
...............................................................................
EG iterations: 89
abstracting: (p113<=p108)
states: 4,289,992,691 (9)
abstracting: (p119<=p53)
states: 4,800,793,064 (9)
abstracting: (1<=p50)
states: 3,235,604,953 (9)
abstracting: (p28<=1)
states: 4,953,223,116 (9)
abstracting: (p122<=p4)
states: 3,725,165,333 (9)
abstracting: (1<=p19)
states: 2,505,443,579 (9)
abstracting: (1<=p82)
states: 1,598,167,746 (9)
abstracting: (1<=p10)
states: 1,446,374,252 (9)
...........................................................................................
EG iterations: 91
abstracting: (p89<=1)
states: 4,953,223,116 (9)
abstracting: (p9<=p106)
states: 2,379,333,862 (9)
.........................................................................................
EG iterations: 89
abstracting: (p119<=p53)
states: 4,800,793,064 (9)
abstracting: (1<=p50)
states: 3,235,604,953 (9)
abstracting: (p28<=1)
states: 4,953,223,116 (9)
abstracting: (p122<=p4)
states: 3,725,165,333 (9)
abstracting: (1<=p19)
states: 2,505,443,579 (9)
abstracting: (1<=p82)
states: 1,598,167,746 (9)
abstracting: (1<=p10)
states: 1,446,374,252 (9)
...........................................................................................
EG iterations: 91
abstracting: (p89<=1)
states: 4,953,223,116 (9)
abstracting: (p9<=p106)
states: 2,379,333,862 (9)
.........................................................................................
EG iterations: 89
.......................
before gc: list nodes free: 1036334

after gc: idd nodes used:1277180, unused:62722820; list nodes free:287777467
...............................
EG iterations: 54
-> the formula is TRUE

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

MC time: 3m50.031sec

checking: [[[EG [p40<=1] & [A [~ [[1<=p38 & AX [1<=p46]]] U AF [[p65<=1 & 1<=p111]]] | A [~ [AF [p66<=0]] U A [~ [p49<=p75] U [p41<=p117 | p68<=p82]]]]] & E [EF [[~ [p13<=p53] & p10<=p46]] U [[p111<=p48 & p56<=0] & ~ [[[p51<=0 | p119<=p72] | 1<=p84]]]]] | EF [1<=p69]]
normalized: [[[[[~ [EG [EG [~ [[p65<=1 & 1<=p111]]]]] & ~ [E [EG [~ [[p65<=1 & 1<=p111]]] U [[1<=p38 & ~ [EX [~ [1<=p46]]]] & EG [~ [[p65<=1 & 1<=p111]]]]]]] | [~ [EG [~ [[~ [EG [~ [[p41<=p117 | p68<=p82]]]] & ~ [E [~ [[p41<=p117 | p68<=p82]] U [p49<=p75 & ~ [[p41<=p117 | p68<=p82]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[p41<=p117 | p68<=p82]]]] & ~ [E [~ [[p41<=p117 | p68<=p82]] U [p49<=p75 & ~ [[p41<=p117 | p68<=p82]]]]]]] U [~ [EG [~ [p66<=0]]] & ~ [[~ [EG [~ [[p41<=p117 | p68<=p82]]]] & ~ [E [~ [[p41<=p117 | p68<=p82]] U [p49<=p75 & ~ [[p41<=p117 | p68<=p82]]]]]]]]]]]] & EG [p40<=1]] & E [E [true U [p10<=p46 & ~ [p13<=p53]]] U [~ [[1<=p84 | [p51<=0 | p119<=p72]]] & [p111<=p48 & p56<=0]]]] | E [true U 1<=p69]]

abstracting: (1<=p69)
states: 1,717,618,162 (9)
abstracting: (p56<=0)
states: 1,717,618,163 (9)
abstracting: (p111<=p48)
states: 4,706,698,709 (9)
abstracting: (p119<=p72)
states: 4,875,027,447 (9)
abstracting: (p51<=0)
states: 3,235,604,954 (9)
abstracting: (1<=p84)
states: 1,598,167,746 (9)
abstracting: (p13<=p53)
states: 3,896,378,266 (9)
abstracting: (p10<=p46)
states: 4,013,722,824 (9)
abstracting: (p40<=1)
states: 4,953,223,116 (9)

EG iterations: 0
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p49<=p75)
states: 3,848,037,580 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
.................................................
EG iterations: 49
abstracting: (p66<=0)
states: 1,717,618,163 (9)
.......................................................................................
EG iterations: 87
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p49<=p75)
states: 3,848,037,580 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
.................................................
EG iterations: 49
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p49<=p75)
states: 3,848,037,580 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
abstracting: (p68<=p82)
states: 2,763,085,811 (9)
abstracting: (p41<=p117)
states: 3,853,570,371 (9)
.................................................
EG iterations: 49
.................................................
EG iterations: 49
abstracting: (1<=p111)
states: 696,615,743 (8)
abstracting: (p65<=1)
states: 4,953,223,116 (9)
.......................................................
EG iterations: 55
abstracting: (1<=p46)
states: 1,803,392,672 (9)
.abstracting: (1<=p38)
states: 3,432,066,968 (9)
abstracting: (1<=p111)
states: 696,615,743 (8)
abstracting: (p65<=1)
states: 4,953,223,116 (9)
.......................................................
EG iterations: 55
abstracting: (1<=p111)
states: 696,615,743 (8)
abstracting: (p65<=1)
states: 4,953,223,116 (9)
.......................................................
EG iterations: 55
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m10.350sec

checking: E [[[p17<=p11 | ~ [p21<=p54]] & [[~ [[~ [p1<=1] & [p28<=p108 & p81<=p49]]] | [~ [[EF [p44<=1] | EG [p31<=0]]] & EF [[p74<=1 | p68<=p17]]]] | [AX [[A [1<=p11 U p101<=p19] | ~ [1<=p9]]] & [EG [[1<=p42 & 1<=p86]] & ~ [1<=p44]]]]] U [A [E [[[1<=p4 & p45<=1] | E [1<=p3 U p86<=p75]] U p85<=p12] U ~ [[[AG [1<=p42] | [1<=p116 | p5<=1]] | ~ [1<=p104]]]] & AX [p12<=p100]]]
normalized: E [[[[~ [[~ [p1<=1] & [p28<=p108 & p81<=p49]]] | [E [true U [p74<=1 | p68<=p17]] & ~ [[EG [p31<=0] | E [true U p44<=1]]]]] | [[~ [1<=p44] & EG [[1<=p42 & 1<=p86]]] & ~ [EX [~ [[~ [1<=p9] | [~ [EG [~ [p101<=p19]]] & ~ [E [~ [p101<=p19] U [~ [1<=p11] & ~ [p101<=p19]]]]]]]]]]] & [p17<=p11 | ~ [p21<=p54]]] U [~ [EX [~ [p12<=p100]]] & [~ [EG [[~ [1<=p104] | [[1<=p116 | p5<=1] | ~ [E [true U ~ [1<=p42]]]]]]] & ~ [E [[~ [1<=p104] | [[1<=p116 | p5<=1] | ~ [E [true U ~ [1<=p42]]]]] U [~ [E [[E [1<=p3 U p86<=p75] | [1<=p4 & p45<=1]] U p85<=p12]] & [~ [1<=p104] | [[1<=p116 | p5<=1] | ~ [E [true U ~ [1<=p42]]]]]]]]]]]

abstracting: (1<=p42)
states: 1,768,007,421 (9)
abstracting: (p5<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p116)
states: 1,113,479,827 (9)
abstracting: (1<=p104)
states: 1,642,663,301 (9)
abstracting: (p85<=p12)
states: 3,303,056,451 (9)
abstracting: (p45<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p4)
states: 507,219,527 (8)
abstracting: (p86<=p75)
states: 3,907,755,468 (9)
abstracting: (1<=p3)
states: 2,100 (3)
abstracting: (1<=p42)
states: 1,768,007,421 (9)
abstracting: (p5<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p116)
states: 1,113,479,827 (9)
abstracting: (1<=p104)
states: 1,642,663,301 (9)
abstracting: (1<=p42)
states: 1,768,007,421 (9)
abstracting: (p5<=1)
states: 4,953,223,116 (9)
abstracting: (1<=p116)
states: 1,113,479,827 (9)
abstracting: (1<=p104)
states: 1,642,663,301 (9)

EG iterations: 0
abstracting: (p12<=p100)
states: 4,754,875,187 (9)
.abstracting: (p21<=p54)
states: 3,576,069,525 (9)
abstracting: (p17<=p11)
states: 3,000,601,889 (9)
abstracting: (p101<=p19)
states: 4,726,446,233 (9)
abstracting: (1<=p11)
states: 2,632,953,677 (9)
abstracting: (p101<=p19)
states: 4,726,446,233 (9)
abstracting: (p101<=p19)
states: 4,726,446,233 (9)
.............................................
EG iterations: 45
abstracting: (1<=p9)
states: 3,506,848,863 (9)
.abstracting: (1<=p86)
states: 1,598,167,746 (9)
abstracting: (1<=p42)
states: 1,768,007,421 (9)
..................................................
EG iterations: 50
abstracting: (1<=p44)
states: 4,857,968,349 (9)
abstracting: (p44<=1)
states: 4,953,223,116 (9)
abstracting: (p31<=0)
states: 4,402,141,373 (9)
..
before gc: list nodes free: 1134716

after gc: idd nodes used:1090357, unused:62909643; list nodes free:288632610
.......................................................................................................
EG iterations: 105
abstracting: (p68<=p17)
states: 4,404,721,500 (9)
abstracting: (p74<=1)
states: 4,953,223,116 (9)
abstracting: (p81<=p49)
states: 3,411,894,022 (9)
abstracting: (p28<=p108)
states: 4,597,249,601 (9)
abstracting: (p1<=1)
states: 4,953,223,116 (9)
-> the formula is FALSE

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

MC time: 0m53.903sec

totally nodes used: 780306866 (7.8e+08)
number of garbage collections: 12
fire ops cache: hits/miss/sum: 183520545 1258507134 1442027679
used/not used/entry size/cache size: 35484155 31624709 16 1024MB
basic ops cache: hits/miss/sum: 35589312 202752224 238341536
used/not used/entry size/cache size: 7547292 9229924 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: 298143 1969759 2267902
used/not used/entry size/cache size: 107809 8280799 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 48638466
1 14766893
2 3071286
3 541000
4 80322
5 9766
6 1018
7 109
8 4
9 0
>= 10 0

Total processing time: 17m44.615sec


BK_STOP 1678250685344

--------------------
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


iterations count:4708 (58), effective:544 (6)

initing FirstDep: 0m 0.000sec


iterations count:157 (1), effective:2 (0)

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

iterations count:3961 (49), effective:506 (6)

iterations count:2029 (25), effective:237 (2)

iterations count:1782 (22), effective:211 (2)

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

iterations count:1782 (22), effective:211 (2)

iterations count:1984 (24), effective:232 (2)

iterations count:1782 (22), effective:211 (2)

iterations count:1847 (23), effective:212 (2)

iterations count:1223 (15), effective:129 (1)

iterations count:323 (4), effective:26 (0)

iterations count:1667 (20), effective:200 (2)

iterations count:623 (7), effective:76 (0)

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

iterations count:1835 (22), effective:220 (2)

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

iterations count:4202 (52), effective:533 (6)

iterations count:1964 (24), effective:221 (2)

iterations count:113 (1), effective:9 (0)

iterations count:1293 (16), effective:130 (1)

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

iterations count:563 (7), effective:58 (0)

iterations count:563 (7), effective:58 (0)

iterations count:950 (11), effective:101 (1)

iterations count:563 (7), effective:58 (0)

iterations count:1641 (20), effective:180 (2)

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

iterations count:166 (2), effective:13 (0)

iterations count:631 (7), effective:46 (0)

iterations count:926 (11), effective:87 (1)

iterations count:797 (9), effective:82 (1)

iterations count:1522 (19), effective:185 (2)

iterations count:1897 (23), effective:212 (2)

iterations count:1446 (18), effective:161 (2)

iterations count:172 (2), effective:11 (0)

iterations count:172 (2), effective:11 (0)

iterations count:622 (7), effective:64 (0)

iterations count:172 (2), effective:11 (0)

iterations count:3648 (45), effective:505 (6)

iterations count:1146 (14), effective:139 (1)

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

iterations count:178 (2), effective:17 (0)

iterations count:1146 (14), effective:139 (1)

iterations count:2236 (27), effective:268 (3)

iterations count:1146 (14), effective:139 (1)

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

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

iterations count:80 (1), effective:0 (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="DES-PT-02a"
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-02a, 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-167814469400377"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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