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.r129-smll-167819403900289.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 DiscoveryGPU-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819403900289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 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.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 46K 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 DiscoveryGPU-PT-06b-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679940837875

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=DiscoveryGPU-PT-06b
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: DiscoveryGPU_PT_06b
(NrP: 184 NrTr: 194 NrArc: 503)

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

net check time: 0m 0.000sec

init dd package: 0m 3.493sec


RS generation: 0m35.564sec


-> reachability set: #nodes 112965 (1.1e+05) #states 6,138,708,333 (9)



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

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

abstracting: (p83<=1)
states: 6,138,708,333 (9)
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (1<=p153)
states: 207,732,028 (8)
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.559sec

checking: ~ [AG [EG [AX [[AF [p15<=p34] | 1<=p73]]]]]
normalized: E [true U ~ [EG [~ [EX [~ [[1<=p73 | ~ [EG [~ [p15<=p34]]]]]]]]]]

abstracting: (p15<=p34)
states: 5,938,793,873 (9)
................................................................
EG iterations: 64
abstracting: (1<=p73)
states: 249,381,640 (8)
.............................
EG iterations: 28
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.748sec

checking: AX [[p130<=p98 & AF [AG [AX [1<=p116]]]]]
normalized: ~ [EX [~ [[p130<=p98 & ~ [EG [E [true U EX [~ [1<=p116]]]]]]]]]

abstracting: (1<=p116)
states: 207,732,024 (8)
...........................
before gc: list nodes free: 554192

after gc: idd nodes used:769088, unused:63230912; list nodes free:292171258
.................................................
EG iterations: 75
abstracting: (p130<=p98)
states: 5,921,771,455 (9)
.-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 1.002sec

checking: EF [AG [[~ [AG [AG [1<=p16]]] | AF [EX [p24<=p56]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [EG [~ [EX [p24<=p56]]]] | E [true U E [true U ~ [1<=p16]]]]]]]]

abstracting: (1<=p16)
states: 207,509,576 (8)
abstracting: (p24<=p56)
states: 5,922,022,124 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.654sec

checking: EG [~ [A [EG [~ [A [p91<=1 U p27<=p119]]] U EX [[AG [p51<=1] & 1<=p73]]]]]
normalized: EG [~ [[~ [EG [~ [EX [[1<=p73 & ~ [E [true U ~ [p51<=1]]]]]]]] & ~ [E [~ [EX [[1<=p73 & ~ [E [true U ~ [p51<=1]]]]]] U [~ [EG [~ [[~ [EG [~ [p27<=p119]]] & ~ [E [~ [p27<=p119] U [~ [p91<=1] & ~ [p27<=p119]]]]]]]] & ~ [EX [[1<=p73 & ~ [E [true U ~ [p51<=1]]]]]]]]]]]]

abstracting: (p51<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p73)
states: 249,381,640 (8)
.abstracting: (p27<=p119)
states: 5,941,686,155 (9)
abstracting: (p91<=1)
states: 6,138,708,333 (9)
abstracting: (p27<=p119)
states: 5,941,686,155 (9)
abstracting: (p27<=p119)
states: 5,941,686,155 (9)
............................................................
EG iterations: 60
.
EG iterations: 1
abstracting: (p51<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p73)
states: 249,381,640 (8)
.abstracting: (p51<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p73)
states: 249,381,640 (8)
...................................................................
EG iterations: 66
..................................................................
EG iterations: 66
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.854sec

checking: [AF [AF [E [p57<=p136 U AG [1<=p65]]]] & AF [[1<=p123 & ~ [AF [[p17<=p177 & 1<=p57]]]]]]
normalized: [~ [EG [~ [[1<=p123 & EG [~ [[p17<=p177 & 1<=p57]]]]]]] & ~ [EG [EG [~ [E [p57<=p136 U ~ [E [true U ~ [1<=p65]]]]]]]]]

abstracting: (1<=p65)
states: 291,319,638 (8)
abstracting: (p57<=p136)
states: 5,898,129,381 (9)

EG iterations: 0

EG iterations: 0
abstracting: (1<=p57)
states: 249,121,872 (8)
abstracting: (p17<=p177)
states: 5,931,198,757 (9)
.........
before gc: list nodes free: 536221

after gc: idd nodes used:592453, unused:63407547; list nodes free:295096551
..........................................................
EG iterations: 67
abstracting: (1<=p123)
states: 206,953,388 (8)
.................................................................
EG iterations: 65
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m50.312sec

checking: EX [[p31<=1 & EF [[[[E [1<=p65 U 1<=p33] | [p153<=p166 | p9<=1]] & AX [1<=p19]] | ~ [EF [p120<=1]]]]]]
normalized: EX [[p31<=1 & E [true U [~ [E [true U p120<=1]] | [~ [EX [~ [1<=p19]]] & [[p153<=p166 | p9<=1] | E [1<=p65 U 1<=p33]]]]]]]

abstracting: (1<=p33)
states: 206,352,845 (8)
abstracting: (1<=p65)
states: 291,319,638 (8)
abstracting: (p9<=1)
states: 6,138,708,333 (9)
abstracting: (p153<=p166)
states: 5,930,976,305 (9)
abstracting: (1<=p19)
states: 249,095,924 (8)
.abstracting: (p120<=1)
states: 6,138,708,333 (9)
abstracting: (p31<=1)
states: 6,138,708,333 (9)
.-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m14.538sec

checking: EG [[AF [[[[A [1<=p116 U p39<=0] | p164<=p127] & ~ [1<=p126]] & ~ [AG [1<=p49]]]] | AG [~ [E [EX [p156<=1] U p166<=p23]]]]]
normalized: EG [[~ [E [true U E [EX [p156<=1] U p166<=p23]]] | ~ [EG [~ [[E [true U ~ [1<=p49]] & [~ [1<=p126] & [p164<=p127 | [~ [EG [~ [p39<=0]]] & ~ [E [~ [p39<=0] U [~ [1<=p116] & ~ [p39<=0]]]]]]]]]]]]]

abstracting: (p39<=0)
states: 5,871,425,309 (9)
abstracting: (1<=p116)
states: 207,732,024 (8)
abstracting: (p39<=0)
states: 5,871,425,309 (9)
abstracting: (p39<=0)
states: 5,871,425,309 (9)
.................................................................
EG iterations: 65
abstracting: (p164<=p127)
states: 5,939,492,615 (9)
abstracting: (1<=p126)
states: 207,732,024 (8)
abstracting: (1<=p49)
states: 224,365,257 (8)
................................................................
EG iterations: 64
abstracting: (p166<=p23)
states: 5,899,798,121 (9)
abstracting: (p156<=1)
states: 6,138,708,333 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.398sec

checking: ~ [A [[AF [[p11<=0 & [p150<=p178 | p91<=p126]]] & p68<=1] U [AG [p107<=1] | E [1<=p103 U AG [p34<=1]]]]]
normalized: ~ [[~ [EG [~ [[E [1<=p103 U ~ [E [true U ~ [p34<=1]]]] | ~ [E [true U ~ [p107<=1]]]]]]] & ~ [E [~ [[E [1<=p103 U ~ [E [true U ~ [p34<=1]]]] | ~ [E [true U ~ [p107<=1]]]]] U [~ [[p68<=1 & ~ [EG [~ [[p11<=0 & [p150<=p178 | p91<=p126]]]]]]] & ~ [[E [1<=p103 U ~ [E [true U ~ [p34<=1]]]] | ~ [E [true U ~ [p107<=1]]]]]]]]]]

abstracting: (p107<=1)
states: 6,138,708,333 (9)
abstracting: (p34<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p103)
states: 224,624,313 (8)
abstracting: (p91<=p126)
states: 5,857,905,730 (9)
abstracting: (p150<=p178)
states: 5,931,754,941 (9)
abstracting: (p11<=0)
states: 5,847,753,942 (9)

before gc: list nodes free: 2210807

after gc: idd nodes used:621965, unused:63378035; list nodes free:294931348
..................................................................
EG iterations: 66
abstracting: (p68<=1)
states: 6,138,708,333 (9)
abstracting: (p107<=1)
states: 6,138,708,333 (9)
abstracting: (p34<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p103)
states: 224,624,313 (8)
abstracting: (p107<=1)
states: 6,138,708,333 (9)
abstracting: (p34<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p103)
states: 224,624,313 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m52.375sec

checking: [~ [AG [~ [p30<=1]]] & EF [E [[[~ [E [1<=p181 U p5<=p170]] | AX [p101<=1]] | EG [[p171<=p32 | p88<=1]]] U ~ [p181<=p131]]]]
normalized: [E [true U E [[EG [[p171<=p32 | p88<=1]] | [~ [EX [~ [p101<=1]]] | ~ [E [1<=p181 U p5<=p170]]]] U ~ [p181<=p131]]] & E [true U p30<=1]]

abstracting: (p30<=1)
states: 6,138,708,333 (9)
abstracting: (p181<=p131)
states: 4,313,853,647 (9)
abstracting: (p5<=p170)
states: 6,133,098,524 (9)
abstracting: (1<=p181)
states: 1,897,921,922 (9)
abstracting: (p101<=1)
states: 6,138,708,333 (9)
.abstracting: (p88<=1)
states: 6,138,708,333 (9)
abstracting: (p171<=p32)
states: 5,107,404,765 (9)

EG iterations: 0
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m15.702sec

checking: EG [[AG [[[[AG [1<=p55] | ~ [p181<=1]] | [[p176<=1 | 1<=p92] & [p110<=1 & p153<=p81]]] | [p96<=p150 & 1<=p142]]] & p158<=0]]
normalized: EG [[p158<=0 & ~ [E [true U ~ [[[p96<=p150 & 1<=p142] | [[[p110<=1 & p153<=p81] & [p176<=1 | 1<=p92]] | [~ [p181<=1] | ~ [E [true U ~ [1<=p55]]]]]]]]]]]

abstracting: (1<=p55)
states: 207,538,034 (8)
abstracting: (p181<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p92)
states: 291,332,187 (8)
abstracting: (p176<=1)
states: 6,138,708,333 (9)
abstracting: (p153<=p81)
states: 5,937,801,713 (9)
abstracting: (p110<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p142)
states: 207,761,650 (8)
abstracting: (p96<=p150)
states: 5,938,536,457 (9)
abstracting: (p158<=0)
states: 5,914,083,777 (9)
.................................................................
EG iterations: 65
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.842sec

checking: ~ [A [~ [[[p51<=1 | p155<=p6] & AF [~ [p3<=p169]]]] U ~ [[[p25<=1 & E [p80<=0 U 1<=p27]] | ~ [[AG [p18<=1] | [1<=p89 & p50<=p58]]]]]]]
normalized: ~ [[~ [EG [[~ [[[1<=p89 & p50<=p58] | ~ [E [true U ~ [p18<=1]]]]] | [p25<=1 & E [p80<=0 U 1<=p27]]]]] & ~ [E [[~ [[[1<=p89 & p50<=p58] | ~ [E [true U ~ [p18<=1]]]]] | [p25<=1 & E [p80<=0 U 1<=p27]]] U [[~ [EG [p3<=p169]] & [p51<=1 | p155<=p6]] & [~ [[[1<=p89 & p50<=p58] | ~ [E [true U ~ [p18<=1]]]]] | [p25<=1 & E [p80<=0 U 1<=p27]]]]]]]]

abstracting: (1<=p27)
states: 207,538,034 (8)
abstracting: (p80<=0)
states: 5,931,761,461 (9)
abstracting: (p25<=1)
states: 6,138,708,333 (9)
abstracting: (p18<=1)
states: 6,138,708,333 (9)
abstracting: (p50<=p58)
states: 5,914,343,076 (9)
abstracting: (1<=p89)
states: 207,731,848 (8)
abstracting: (p155<=p6)
states: 5,898,965,916 (9)
abstracting: (p51<=1)
states: 6,138,708,333 (9)
abstracting: (p3<=p169)
states: 6,138,702,086 (9)
................
EG iterations: 16
abstracting: (1<=p27)
states: 207,538,034 (8)
abstracting: (p80<=0)
states: 5,931,761,461 (9)
abstracting: (p25<=1)
states: 6,138,708,333 (9)
abstracting: (p18<=1)
states: 6,138,708,333 (9)
abstracting: (p50<=p58)
states: 5,914,343,076 (9)
abstracting: (1<=p89)
states: 207,731,848 (8)
abstracting: (1<=p27)
states: 207,538,034 (8)
abstracting: (p80<=0)
states: 5,931,761,461 (9)
abstracting: (p25<=1)
states: 6,138,708,333 (9)
abstracting: (p18<=1)
states: 6,138,708,333 (9)
abstracting: (p50<=p58)
states: 5,914,343,076 (9)
abstracting: (1<=p89)
states: 207,731,848 (8)
.................................................................
EG iterations: 65
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.622sec

checking: AG [A [~ [[AG [AG [p25<=p130]] | EG [[1<=p43 | p37<=p86]]]] U [[[~ [EF [1<=p111]] | EG [p99<=0]] & [p71<=1 & 1<=p47]] & A [[[1<=p139 | p75<=p168] & E [1<=p70 U p104<=1]] U ~ [p7<=0]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[~ [EG [p7<=0]] & ~ [E [p7<=0 U [p7<=0 & ~ [[E [1<=p70 U p104<=1] & [1<=p139 | p75<=p168]]]]]]] & [[p71<=1 & 1<=p47] & [EG [p99<=0] | ~ [E [true U 1<=p111]]]]]]]] & ~ [E [~ [[[~ [EG [p7<=0]] & ~ [E [p7<=0 U [p7<=0 & ~ [[E [1<=p70 U p104<=1] & [1<=p139 | p75<=p168]]]]]]] & [[p71<=1 & 1<=p47] & [EG [p99<=0] | ~ [E [true U 1<=p111]]]]]] U [[EG [[1<=p43 | p37<=p86]] | ~ [E [true U E [true U ~ [p25<=p130]]]]] & ~ [[[~ [EG [p7<=0]] & ~ [E [p7<=0 U [p7<=0 & ~ [[E [1<=p70 U p104<=1] & [1<=p139 | p75<=p168]]]]]]] & [[p71<=1 & 1<=p47] & [EG [p99<=0] | ~ [E [true U 1<=p111]]]]]]]]]]]]]

abstracting: (1<=p111)
states: 249,418,200 (8)
abstracting: (p99<=0)
states: 5,930,976,485 (9)
...
before gc: list nodes free: 4255848

after gc: idd nodes used:1137375, unused:62862625; list nodes free:292522690
...................................................................
EG iterations: 70
abstracting: (1<=p47)
states: 247,909,877 (8)
abstracting: (p71<=1)
states: 6,138,708,333 (9)
abstracting: (p75<=p168)
states: 5,914,092,003 (9)
abstracting: (1<=p139)
states: 248,227,190 (8)
abstracting: (p104<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p70)
states: 207,725,392 (8)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
.
EG iterations: 1
abstracting: (p25<=p130)
states: 5,921,942,619 (9)
abstracting: (p37<=p86)
states: 5,858,133,171 (9)
abstracting: (1<=p43)
states: 207,509,576 (8)
.................................
before gc: list nodes free: 504899

after gc: idd nodes used:1568682, unused:62431318; list nodes free:290563146
..........................................
EG iterations: 75
abstracting: (1<=p111)
states: 249,418,200 (8)
abstracting: (p99<=0)
states: 5,930,976,485 (9)
......................................................................
EG iterations: 70
abstracting: (1<=p47)
states: 247,909,877 (8)
abstracting: (p71<=1)
states: 6,138,708,333 (9)
abstracting: (p75<=p168)
states: 5,914,092,003 (9)
abstracting: (1<=p139)
states: 248,227,190 (8)
abstracting: (p104<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p70)
states: 207,725,392 (8)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
.
EG iterations: 1
abstracting: (1<=p111)
states: 249,418,200 (8)
abstracting: (p99<=0)
states: 5,930,976,485 (9)
......................................................................
EG iterations: 70
abstracting: (1<=p47)
states: 247,909,877 (8)
abstracting: (p71<=1)
states: 6,138,708,333 (9)
abstracting: (p75<=p168)
states: 5,914,092,003 (9)
abstracting: (1<=p139)
states: 248,227,190 (8)
abstracting: (p104<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p70)
states: 207,725,392 (8)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
abstracting: (p7<=0)
states: 5,931,170,299 (9)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 7m16.106sec

checking: [A [1<=p2 U [[[~ [[1<=p57 | p58<=0]] | ~ [[[1<=p53 | p103<=1] & ~ [p131<=1]]]] | 1<=p7] | ~ [p173<=p2]]] & ~ [A [[EG [[E [1<=p21 U 1<=p107] & [1<=p156 & p40<=p21]]] | E [1<=p114 U [[p180<=0 | p17<=0] | p75<=p8]]] U AG [A [1<=p135 U ~ [p38<=p123]]]]]]
normalized: [~ [[~ [EG [E [true U ~ [[~ [EG [p38<=p123]] & ~ [E [p38<=p123 U [p38<=p123 & ~ [1<=p135]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [p38<=p123]] & ~ [E [p38<=p123 U [p38<=p123 & ~ [1<=p135]]]]]]] U [~ [[E [1<=p114 U [p75<=p8 | [p180<=0 | p17<=0]]] | EG [[[1<=p156 & p40<=p21] & E [1<=p21 U 1<=p107]]]]] & E [true U ~ [[~ [EG [p38<=p123]] & ~ [E [p38<=p123 U [p38<=p123 & ~ [1<=p135]]]]]]]]]]]] & [~ [EG [~ [[~ [p173<=p2] | [1<=p7 | [~ [[~ [p131<=1] & [1<=p53 | p103<=1]]] | ~ [[1<=p57 | p58<=0]]]]]]]] & ~ [E [~ [[~ [p173<=p2] | [1<=p7 | [~ [[~ [p131<=1] & [1<=p53 | p103<=1]]] | ~ [[1<=p57 | p58<=0]]]]]] U [~ [1<=p2] & ~ [[~ [p173<=p2] | [1<=p7 | [~ [[~ [p131<=1] & [1<=p53 | p103<=1]]] | ~ [[1<=p57 | p58<=0]]]]]]]]]]]

abstracting: (p58<=0)
states: 5,890,771,970 (9)
abstracting: (1<=p57)
states: 249,121,872 (8)
abstracting: (p103<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p53)
states: 206,733,412 (8)
abstracting: (p131<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p7)
states: 207,538,034 (8)
abstracting: (p173<=p2)
states: 5,382,403,823 (9)
abstracting: (1<=p2)
states: 185
abstracting: (p58<=0)
states: 5,890,771,970 (9)
abstracting: (1<=p57)
states: 249,121,872 (8)
abstracting: (p103<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p53)
states: 206,733,412 (8)
abstracting: (p131<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p7)
states: 207,538,034 (8)
abstracting: (p173<=p2)
states: 5,382,403,823 (9)
abstracting: (p58<=0)
states: 5,890,771,970 (9)
abstracting: (1<=p57)
states: 249,121,872 (8)
abstracting: (p103<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p53)
states: 206,733,412 (8)
abstracting: (p131<=1)
states: 6,138,708,333 (9)
abstracting: (1<=p7)
states: 207,538,034 (8)
abstracting: (p173<=p2)
states: 5,382,403,823 (9)
.
EG iterations: 1
abstracting: (1<=p135)
states: 207,761,644 (8)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
............
before gc: list nodes free: 250391

after gc: idd nodes used:1574617, unused:62425383; list nodes free:290564553
........................................................
EG iterations: 68
abstracting: (1<=p107)
states: 206,953,216 (8)
abstracting: (1<=p21)
states: 224,365,257 (8)
abstracting: (p40<=p21)
states: 5,882,370,819 (9)
abstracting: (1<=p156)
states: 224,624,556 (8)
..................................................
EG iterations: 50
abstracting: (p17<=0)
states: 5,931,198,757 (9)
abstracting: (p180<=0)
states: 4,969,812,037 (9)
abstracting: (p75<=p8)
states: 5,921,771,051 (9)
abstracting: (1<=p114)
states: 206,570,782 (8)
abstracting: (1<=p135)
states: 207,761,644 (8)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
....................................................................
EG iterations: 68
abstracting: (1<=p135)
states: 207,761,644 (8)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
abstracting: (p38<=p123)
states: 5,858,168,548 (9)
....................................................................
EG iterations: 68

EG iterations: 0
-> the formula is TRUE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m 2.345sec

checking: [E [p26<=1 U [~ [p55<=p21] & ~ [p39<=p11]]] & [~ [[A [EG [~ [p47<=p167]] U ~ [[~ [p71<=0] & EG [p106<=1]]]] & AX [[p52<=p178 & [~ [p7<=p53] & [p134<=p93 & p173<=p172]]]]]] & ~ [A [p117<=p151 U E [AG [p15<=1] U EG [p56<=p17]]]]]]
normalized: [[~ [[~ [EG [~ [E [~ [E [true U ~ [p15<=1]]] U EG [p56<=p17]]]]] & ~ [E [~ [E [~ [E [true U ~ [p15<=1]]] U EG [p56<=p17]]] U [~ [p117<=p151] & ~ [E [~ [E [true U ~ [p15<=1]]] U EG [p56<=p17]]]]]]]] & ~ [[~ [EX [~ [[p52<=p178 & [[p134<=p93 & p173<=p172] & ~ [p7<=p53]]]]]] & [~ [EG [[EG [p106<=1] & ~ [p71<=0]]]] & ~ [E [[EG [p106<=1] & ~ [p71<=0]] U [~ [EG [~ [p47<=p167]]] & [EG [p106<=1] & ~ [p71<=0]]]]]]]]] & E [p26<=1 U [~ [p39<=p11] & ~ [p55<=p21]]]]

abstracting: (p55<=p21)
states: 5,938,849,347 (9)
abstracting: (p39<=p11)
states: 5,881,941,165 (9)
abstracting: (p26<=1)
states: 6,138,708,333 (9)
abstracting: (p71<=0)
states: 5,930,982,941 (9)
abstracting: (p106<=1)
states: 6,138,708,333 (9)

EG iterations: 0
abstracting: (p47<=p167)
states: 5,899,255,347 (9)
.................................................................
EG iterations: 65
abstracting: (p71<=0)
states: 5,930,982,941 (9)
abstracting: (p106<=1)
states: 6,138,708,333 (9)

EG iterations: 0
abstracting: (p71<=0)
states: 5,930,982,941 (9)
abstracting: (p106<=1)
states: 6,138,708,333 (9)

EG iterations: 0
.....................
before gc: list nodes free: 3331272

after gc: idd nodes used:1858176, unused:62141824; list nodes free:289274740
...........................................
EG iterations: 64
abstracting: (p7<=p53)
states: 5,937,989,251 (9)
abstracting: (p173<=p172)
states: 5,382,403,813 (9)
abstracting: (p134<=p93)
states: 5,941,001,169 (9)
abstracting: (p52<=p178)
states: 5,914,343,076 (9)
.abstracting: (p56<=p17)
states: 5,937,989,251 (9)
....................................................................
EG iterations: 68
abstracting: (p15<=1)
states: 6,138,708,333 (9)
abstracting: (p117<=p151)
states: 5,938,580,533 (9)
abstracting: (p56<=p17)
states: 5,937,989,251 (9)
....................................................................
EG iterations: 68
abstracting: (p15<=1)
states: 6,138,708,333 (9)
abstracting: (p56<=p17)
states: 5,937,989,251 (9)
....................................................................
EG iterations: 68
abstracting: (p15<=1)
states: 6,138,708,333 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DiscoveryGPU-PT-06b-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m52.866sec

totally nodes used: 486173938 (4.9e+08)
number of garbage collections: 7
fire ops cache: hits/miss/sum: 971748649 2038608240 3010356889
used/not used/entry size/cache size: 63017436 4091428 16 1024MB
basic ops cache: hits/miss/sum: 61558315 130799188 192357503
used/not used/entry size/cache size: 9952115 6825101 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: 1351797 2891514 4243311
used/not used/entry size/cache size: 296138 8092470 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 34273220
1 22406938
2 7953415
3 2005052
4 395597
5 64312
6 9054
7 1129
8 132
9 11
>= 10 4

Total processing time: 28m51.963sec


BK_STOP 1679942569944

--------------------
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:76131 (392), effective:3748 (19)

initing FirstDep: 0m 0.001sec


iterations count:1599 (8), effective:50 (0)

iterations count:1601 (8), effective:51 (0)

iterations count:2022 (10), effective:102 (0)

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

iterations count:235 (1), effective:4 (0)

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

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

iterations count:328 (1), effective:6 (0)

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

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

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

iterations count:10547 (54), effective:476 (2)

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

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

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

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

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

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

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

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

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

iterations count:8268 (42), effective:294 (1)

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

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

iterations count:1666 (8), effective:54 (0)

iterations count:738 (3), effective:27 (0)

iterations count:738 (3), effective:27 (0)

iterations count:201 (1), effective:4 (0)

iterations count:738 (3), effective:27 (0)

iterations count:539 (2), effective:18 (0)

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

iterations count:1192 (6), effective:41 (0)

iterations count:1031 (5), effective:40 (0)

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

iterations count:539 (2), effective:18 (0)

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

iterations count:1192 (6), effective:41 (0)

iterations count:933 (4), effective:29 (0)

iterations count:539 (2), effective:18 (0)

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

iterations count:1192 (6), effective:41 (0)

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

iterations count:338 (1), effective:6 (0)

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

iterations count:818 (4), effective:21 (0)

iterations count:254 (1), effective:6 (0)

iterations count:338 (1), effective:6 (0)

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

iterations count:10109 (52), effective:381 (1)

iterations count:338 (1), effective:6 (0)

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

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

iterations count:723 (3), effective:15 (0)

iterations count:723 (3), effective:15 (0)

iterations count:723 (3), effective:15 (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="DiscoveryGPU-PT-06b"
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 DiscoveryGPU-PT-06b, 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 r129-smll-167819403900289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 ;