Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r033-tajo-167813686000449.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is BusinessProcesses-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813686000449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678302821210

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=BusinessProcesses-PT-01
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: BusinessProcesses_PT_01
(NrP: 200 NrTr: 178 NrArc: 487)

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

net check time: 0m 0.000sec

init dd package: 0m 3.839sec


RS generation: 0m21.183sec


-> reachability set: #nodes 850379 (8.5e+05) #states 24,160,976,859 (10)



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

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

abstracting: (1<=p149)
states: 881,746,968 (8)
.....................
before gc: list nodes free: 500935

after gc: idd nodes used:1934760, unused:62065240; list nodes free:272179683
............
EG iterations: 33
.
EG iterations: 1
MC time: 3m44.022sec

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

abstracting: (1<=p18)
states: 1,524,915,072 (9)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 1.626sec

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

abstracting: (1<=p62)
states: 13,987,824 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.151sec

checking: EX [~ [AG [EX [p125<=p24]]]]
normalized: EX [E [true U ~ [EX [p125<=p24]]]]

abstracting: (p125<=p24)
states: 23,564,984,415 (10)
.
before gc: list nodes free: 2176411

after gc: idd nodes used:1341590, unused:62658410; list nodes free:275266795
.-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m51.087sec

checking: EF [[[~ [AG [p63<=0]] & [~ [1<=p125] & AX [E [1<=p114 U p158<=p153]]]] & 1<=p47]]
normalized: E [true U [1<=p47 & [[~ [EX [~ [E [1<=p114 U p158<=p153]]]] & ~ [1<=p125]] & E [true U ~ [p63<=0]]]]]

abstracting: (p63<=0)
states: 23,661,448,947 (10)
abstracting: (1<=p125)
states: 655,401,084 (8)
abstracting: (p158<=p153)
states: 23,998,945,755 (10)
abstracting: (1<=p114)
states: 8,131,068,756 (9)
.abstracting: (1<=p47)
states: 5,479,866,816 (9)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.233sec

checking: AX [EF [~ [[A [~ [1<=p199] U [p199<=p10 | p5<=1]] & EG [E [1<=p195 U p114<=1]]]]]]
normalized: ~ [EX [~ [E [true U ~ [[EG [E [1<=p195 U p114<=1]] & [~ [EG [~ [[p199<=p10 | p5<=1]]]] & ~ [E [~ [[p199<=p10 | p5<=1]] U [1<=p199 & ~ [[p199<=p10 | p5<=1]]]]]]]]]]]]

abstracting: (p5<=1)
states: 24,160,976,859 (10)
abstracting: (p199<=p10)
states: 24,146,439,531 (10)
abstracting: (1<=p199)
states: 27,972,912 (7)
abstracting: (p5<=1)
states: 24,160,976,859 (10)
abstracting: (p199<=p10)
states: 24,146,439,531 (10)
abstracting: (p5<=1)
states: 24,160,976,859 (10)
abstracting: (p199<=p10)
states: 24,146,439,531 (10)
.
EG iterations: 1
abstracting: (p114<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p195)
states: 27,972,000 (7)

EG iterations: 0
.-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.886sec

checking: EF [A [EF [[EF [p86<=p73] & [p20<=p168 | EX [p196<=0]]]] U AG [[p22<=0 & p87<=0]]]]
normalized: E [true U [~ [EG [E [true U ~ [[p22<=0 & p87<=0]]]]] & ~ [E [E [true U ~ [[p22<=0 & p87<=0]]] U [~ [E [true U [[p20<=p168 | EX [p196<=0]] & E [true U p86<=p73]]]] & E [true U ~ [[p22<=0 & p87<=0]]]]]]]]

abstracting: (p87<=0)
states: 24,158,951,589 (10)
abstracting: (p22<=0)
states: 23,581,384,923 (10)
abstracting: (p86<=p73)
states: 24,160,586,121 (10)
abstracting: (p196<=0)
states: 24,133,004,859 (10)
.abstracting: (p20<=p168)
states: 23,581,384,923 (10)
abstracting: (p87<=0)
states: 24,158,951,589 (10)
abstracting: (p22<=0)
states: 23,581,384,923 (10)
abstracting: (p87<=0)
states: 24,158,951,589 (10)
abstracting: (p22<=0)
states: 23,581,384,923 (10)
.....................................
EG iterations: 37
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m21.717sec

checking: [EG [AG [[[[AF [p181<=0] | [p178<=1 & p91<=0]] | p115<=1] | EF [~ [p15<=p106]]]]] | AG [~ [EG [~ [p20<=0]]]]]
normalized: [~ [E [true U EG [~ [p20<=0]]]] | EG [~ [E [true U ~ [[E [true U ~ [p15<=p106]] | [p115<=1 | [[p178<=1 & p91<=0] | ~ [EG [~ [p181<=0]]]]]]]]]]]

abstracting: (p181<=0)
states: 24,151,652,859 (10)
......................................
EG iterations: 38
abstracting: (p91<=0)
states: 18,179,483,637 (10)
abstracting: (p178<=1)
states: 24,160,976,859 (10)
abstracting: (p115<=1)
states: 24,160,976,859 (10)
abstracting: (p15<=p106)
states: 23,866,601,691 (10)

EG iterations: 0
abstracting: (p20<=0)
states: 23,581,384,923 (10)
.....................................
EG iterations: 37
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.892sec

checking: EF [~ [AX [[EF [[p151<=p110 & p149<=0]] | E [[p55<=p192 & p64<=0] U [p96<=0 & 1<=p118]]]]]]
normalized: E [true U EX [~ [[E [[p55<=p192 & p64<=0] U [p96<=0 & 1<=p118]] | E [true U [p151<=p110 & p149<=0]]]]]]

abstracting: (p149<=0)
states: 23,279,229,891 (10)
abstracting: (p151<=p110)
states: 22,934,527,047 (10)
abstracting: (1<=p118)
states: 2,573,490,096 (9)
abstracting: (p96<=0)
states: 19,521,533,109 (10)
abstracting: (p64<=0)
states: 23,661,448,947 (10)
abstracting: (p55<=p192)
states: 24,146,988,883 (10)
.
before gc: list nodes free: 2316533

after gc: idd nodes used:3680117, unused:60319883; list nodes free:265203539
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m55.531sec

checking: AF [EF [[1<=p128 | E [[A [1<=p19 U p133<=0] & [p115<=p184 | 1<=p116]] U ~ [[p67<=0 & p69<=p41]]]]]]
normalized: ~ [EG [~ [E [true U [1<=p128 | E [[[p115<=p184 | 1<=p116] & [~ [EG [~ [p133<=0]]] & ~ [E [~ [p133<=0] U [~ [1<=p19] & ~ [p133<=0]]]]]] U ~ [[p67<=0 & p69<=p41]]]]]]]]

abstracting: (p69<=p41)
states: 19,705,745,979 (10)
abstracting: (p67<=0)
states: 24,133,001,211 (10)
abstracting: (p133<=0)
states: 24,067,895,091 (10)
abstracting: (1<=p19)
states: 1,524,915,072 (9)
abstracting: (p133<=0)
states: 24,067,895,091 (10)
abstracting: (p133<=0)
states: 24,067,895,091 (10)
.
EG iterations: 1
abstracting: (1<=p116)
states: 1,390,449,078 (9)
abstracting: (p115<=p184)
states: 18,834,977,271 (10)
abstracting: (1<=p128)
states: 2,373,712,152 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m45.057sec

checking: [~ [[EG [[1<=p127 & [A [p106<=1 U 1<=p169] | [p165<=1 | 1<=p87]]]] & ~ [EG [[AX [p46<=0] & ~ [1<=p17]]]]]] & AG [~ [AG [AF [p80<=p188]]]]]
normalized: [~ [E [true U ~ [E [true U EG [~ [p80<=p188]]]]]] & ~ [[~ [EG [[~ [1<=p17] & ~ [EX [~ [p46<=0]]]]]] & EG [[1<=p127 & [[p165<=1 | 1<=p87] | [~ [EG [~ [1<=p169]]] & ~ [E [~ [1<=p169] U [~ [p106<=1] & ~ [1<=p169]]]]]]]]]]]

abstracting: (1<=p169)
states: 163,159,056 (8)
abstracting: (p106<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p169)
states: 163,159,056 (8)
abstracting: (1<=p169)
states: 163,159,056 (8)
...........................................
EG iterations: 43
abstracting: (1<=p87)
states: 2,025,270 (6)
abstracting: (p165<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p127)
states: 9,108,723,456 (9)
.......................................
EG iterations: 39
abstracting: (p46<=0)
states: 18,681,110,043 (10)
.abstracting: (1<=p17)
states: 15,957,688,908 (10)
.......
before gc: list nodes free: 392696

after gc: idd nodes used:5160681, unused:58839319; list nodes free:260577164
..................................
EG iterations: 41
abstracting: (p80<=p188)
states: 12,150,523,597 (10)

before gc: list nodes free: 387090

after gc: idd nodes used:5059366, unused:58940634; list nodes free:263282949
.......................................
EG iterations: 39

before gc: list nodes free: 1735140

after gc: idd nodes used:4479294, unused:59520706; list nodes free:268104878
MC time: 6m54.780sec

checking: AG [~ [[[~ [[[~ [1<=p176] | p138<=1] | ~ [p113<=1]]] & AG [[AF [p85<=1] | ~ [1<=p135]]]] | AG [[[AF [p56<=0] | AG [1<=p0]] & ~ [A [p66<=p27 U p46<=p64]]]]]]]
normalized: ~ [E [true U [~ [E [true U ~ [[~ [[~ [EG [~ [p46<=p64]]] & ~ [E [~ [p46<=p64] U [~ [p46<=p64] & ~ [p66<=p27]]]]]] & [~ [E [true U ~ [1<=p0]]] | ~ [EG [~ [p56<=0]]]]]]]] | [~ [E [true U ~ [[~ [1<=p135] | ~ [EG [~ [p85<=1]]]]]]] & ~ [[~ [p113<=1] | [p138<=1 | ~ [1<=p176]]]]]]]]

abstracting: (1<=p176)
states: 888,923,232 (8)
abstracting: (p138<=1)
states: 24,160,976,859 (10)
abstracting: (p113<=1)
states: 24,160,976,859 (10)
abstracting: (p85<=1)
states: 24,160,976,859 (10)
.
EG iterations: 1
abstracting: (1<=p135)
states: 72,033,484 (7)
abstracting: (p56<=0)
states: 24,146,988,883 (10)
.........................................
EG iterations: 41
abstracting: (1<=p0)
states: 1
abstracting: (p66<=p27)
states: 24,136,302,075 (10)
abstracting: (p46<=p64)
states: 18,808,530,171 (10)
abstracting: (p46<=p64)
states: 18,808,530,171 (10)
abstracting: (p46<=p64)
states: 18,808,530,171 (10)
......................................
EG iterations: 38
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m32.203sec

checking: AF [E [[[[EX [1<=p143] | [[1<=p62 & p5<=0] | [1<=p145 | 1<=p34]]] | p37<=p90] & EF [EG [p20<=p34]]] U ~ [[EX [p126<=p177] | ~ [1<=p40]]]]]
normalized: ~ [EG [~ [E [[E [true U EG [p20<=p34]] & [p37<=p90 | [[[1<=p145 | 1<=p34] | [1<=p62 & p5<=0]] | EX [1<=p143]]]] U ~ [[~ [1<=p40] | EX [p126<=p177]]]]]]]

abstracting: (p126<=p177)
states: 22,936,505,673 (10)
.abstracting: (1<=p40)
states: 6,665,917,968 (9)
abstracting: (1<=p143)
states: 1,350,196,887 (9)
.abstracting: (p5<=0)
states: 24,159,093,873 (10)
abstracting: (1<=p62)
states: 13,987,824 (7)
abstracting: (1<=p34)
states: 2,809,876,808 (9)
abstracting: (1<=p145)
states: 1,350,196,887 (9)
abstracting: (p37<=p90)
states: 22,017,536,187 (10)
abstracting: (p20<=p34)
states: 23,647,574,235 (10)
.................................
EG iterations: 33

EG iterations: 0
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 6.586sec

checking: [AF [[[[EG [EG [p35<=0]] | ~ [AX [p18<=p108]]] | AX [[AF [p110<=p150] | [1<=p5 | p51<=p181]]]] & EF [~ [[AG [p0<=1] & [p76<=p23 & p69<=0]]]]]] | AG [~ [p91<=p50]]]
normalized: [~ [E [true U p91<=p50]] | ~ [EG [~ [[E [true U ~ [[[p76<=p23 & p69<=0] & ~ [E [true U ~ [p0<=1]]]]]] & [~ [EX [~ [[[1<=p5 | p51<=p181] | ~ [EG [~ [p110<=p150]]]]]]] | [EX [~ [p18<=p108]] | EG [EG [p35<=0]]]]]]]]]

abstracting: (p35<=0)
states: 21,351,100,051 (10)
......
before gc: list nodes free: 5834280

after gc: idd nodes used:6810635, unused:57189365; list nodes free:257516863
.........
before gc: list nodes free: 4099782

after gc: idd nodes used:7812166, unused:56187834; list nodes free:253030459
.............................
EG iterations: 44
.
EG iterations: 1
abstracting: (p18<=p108)
states: 22,964,146,779 (10)
.abstracting: (p110<=p150)
states: 21,678,378,960 (10)

before gc: list nodes free: 6540330

after gc: idd nodes used:6853316, unused:57146684; list nodes free:257929654
.MC time: 7m45.194sec

checking: E [E [[~ [[E [p54<=p15 U p106<=1] | p103<=p163]] & p81<=p147] U [[[~ [E [1<=p140 U p87<=p177]] | E [p145<=1 U p95<=0]] | [[[p193<=0 | 1<=p139] | ~ [1<=p108]] & A [p175<=1 U p149<=p36]]] & [A [[1<=p2 & p36<=0] U AX [p188<=1]] & p135<=0]]] U ~ [E [1<=p157 U p80<=1]]]
normalized: E [E [[p81<=p147 & ~ [[p103<=p163 | E [p54<=p15 U p106<=1]]]] U [[p135<=0 & [~ [EG [EX [~ [p188<=1]]]] & ~ [E [EX [~ [p188<=1]] U [~ [[1<=p2 & p36<=0]] & EX [~ [p188<=1]]]]]]] & [[[~ [EG [~ [p149<=p36]]] & ~ [E [~ [p149<=p36] U [~ [p175<=1] & ~ [p149<=p36]]]]] & [~ [1<=p108] | [p193<=0 | 1<=p139]]] | [E [p145<=1 U p95<=0] | ~ [E [1<=p140 U p87<=p177]]]]]] U ~ [E [1<=p157 U p80<=1]]]

abstracting: (p80<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p157)
states: 162,031,104 (8)
abstracting: (p87<=p177)
states: 24,158,957,745 (10)
abstracting: (1<=p140)
states: 42,027,342 (7)
abstracting: (p95<=0)
states: 18,179,483,637 (10)
abstracting: (p145<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p139)
states: 12,035,446,074 (10)
abstracting: (p193<=0)
states: 22,810,779,972 (10)
abstracting: (1<=p108)
states: 5,140,348,992 (9)
abstracting: (p149<=p36)
states: 23,279,229,891 (10)
abstracting: (p175<=1)
states: 24,160,976,859 (10)
abstracting: (p149<=p36)
states: 23,279,229,891 (10)
abstracting: (p149<=p36)
states: 23,279,229,891 (10)
..................................
EG iterations: 34
abstracting: (p188<=1)
states: 24,160,976,859 (10)
.abstracting: (p36<=0)
states: 21,877,083,159 (10)
abstracting: (1<=p2)
states: 688,900 (5)
abstracting: (p188<=1)
states: 24,160,976,859 (10)
.abstracting: (p188<=1)
states: 24,160,976,859 (10)
..
EG iterations: 1
abstracting: (p135<=0)
states: 24,088,943,375 (10)
abstracting: (p106<=1)
states: 24,160,976,859 (10)
abstracting: (p54<=p15)
states: 24,146,988,883 (10)
abstracting: (p103<=p163)
states: 17,396,914,395 (10)
abstracting: (p81<=p147)
states: 24,099,679,739 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m18.580sec

checking: [~ [AF [[[EF [EF [p118<=p47]] | ~ [[EX [p92<=p8] | p8<=1]]] & EF [p71<=0]]]] | E [[[[AF [[1<=p173 | 1<=p114]] & 1<=p145] | [[p85<=p46 & AF [p109<=1]] & [[~ [p112<=0] & [p49<=p50 | p37<=p167]] | EX [p47<=0]]]] | ~ [[[p187<=1 & EX [p146<=p42]] | [[1<=p88 & 1<=p53] | [p166<=p15 & 1<=p192]]]]] U ~ [A [[~ [p183<=0] & [~ [p77<=0] & A [p153<=1 U p167<=1]]] U A [[p92<=0 & p124<=p40] U AG [p184<=p184]]]]]]
normalized: [E [[~ [[[[p166<=p15 & 1<=p192] | [1<=p88 & 1<=p53]] | [p187<=1 & EX [p146<=p42]]]] | [[[EX [p47<=0] | [[p49<=p50 | p37<=p167] & ~ [p112<=0]]] & [p85<=p46 & ~ [EG [~ [p109<=1]]]]] | [1<=p145 & ~ [EG [~ [[1<=p173 | 1<=p114]]]]]]] U ~ [[~ [EG [~ [[~ [EG [E [true U ~ [p184<=p184]]]] & ~ [E [E [true U ~ [p184<=p184]] U [~ [[p92<=0 & p124<=p40]] & E [true U ~ [p184<=p184]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [p184<=p184]]]] & ~ [E [E [true U ~ [p184<=p184]] U [~ [[p92<=0 & p124<=p40]] & E [true U ~ [p184<=p184]]]]]]] U [~ [[[[~ [EG [~ [p167<=1]]] & ~ [E [~ [p167<=1] U [~ [p153<=1] & ~ [p167<=1]]]]] & ~ [p77<=0]] & ~ [p183<=0]]] & ~ [[~ [EG [E [true U ~ [p184<=p184]]]] & ~ [E [E [true U ~ [p184<=p184]] U [~ [[p92<=0 & p124<=p40]] & E [true U ~ [p184<=p184]]]]]]]]]]]]] | EG [~ [[E [true U p71<=0] & [~ [[p8<=1 | EX [p92<=p8]]] | E [true U E [true U p118<=p47]]]]]]]

abstracting: (p118<=p47)
states: 22,174,517,739 (10)
abstracting: (p92<=p8)
states: 24,160,976,859 (10)

before gc: list nodes free: 11248484

after gc: idd nodes used:8608579, unused:55391421; list nodes free:250234845
.abstracting: (p8<=1)
states: 24,160,976,859 (10)
abstracting: (p71<=0)
states: 24,114,353,211 (10)
.
EG iterations: 1
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p124<=p40)
states: 16,358,788,815 (10)
abstracting: (p92<=0)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
.
EG iterations: 1
abstracting: (p183<=0)
states: 24,146,990,859 (10)
abstracting: (p77<=0)
states: 18,837,019,803 (10)
abstracting: (p167<=1)
states: 24,160,976,859 (10)
abstracting: (p153<=1)
states: 24,160,976,859 (10)
abstracting: (p167<=1)
states: 24,160,976,859 (10)
abstracting: (p167<=1)
states: 24,160,976,859 (10)
.
EG iterations: 1
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p124<=p40)
states: 16,358,788,815 (10)
abstracting: (p92<=0)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
.
EG iterations: 1
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p124<=p40)
states: 16,358,788,815 (10)
abstracting: (p92<=0)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
abstracting: (p184<=p184)
states: 24,160,976,859 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p114)
states: 8,131,068,756 (9)
abstracting: (1<=p173)
states: 295,812,000 (8)
...............
before gc: list nodes free: 3651682

after gc: idd nodes used:9637727, unused:54362273; list nodes free:245468206
.............................
EG iterations: 44
abstracting: (1<=p145)
states: 1,350,196,887 (9)
abstracting: (p109<=1)
states: 24,160,976,859 (10)
.
EG iterations: 1
abstracting: (p85<=p46)
states: 24,160,900,461 (10)
abstracting: (p112<=0)
states: 21,351,919,323 (10)
abstracting: (p37<=p167)
states: 21,877,083,159 (10)
abstracting: (p49<=p50)
states: 23,568,361,371 (10)
abstracting: (p47<=0)
states: 18,681,110,043 (10)

before gc: list nodes free: 5651226

after gc: idd nodes used:9081692, unused:54918308; list nodes free:247975247
MC time: 6m55.047sec

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

abstracting: (1<=p149)
states: 881,746,968 (8)
..................
before gc: list nodes free: 7303578

after gc: idd nodes used:9348364, unused:54651636; list nodes free:246919434
...............
EG iterations: 33
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m36.231sec

checking: [~ [[EG [[1<=p127 & [A [p106<=1 U 1<=p169] | [p165<=1 | 1<=p87]]]] & ~ [EG [[AX [p46<=0] & ~ [1<=p17]]]]]] & AG [~ [AG [AF [p80<=p188]]]]]
normalized: [~ [E [true U ~ [E [true U EG [~ [p80<=p188]]]]]] & ~ [[~ [EG [[~ [1<=p17] & ~ [EX [~ [p46<=0]]]]]] & EG [[1<=p127 & [[p165<=1 | 1<=p87] | [~ [EG [~ [1<=p169]]] & ~ [E [~ [1<=p169] U [~ [p106<=1] & ~ [1<=p169]]]]]]]]]]]

abstracting: (1<=p169)
states: 163,159,056 (8)
abstracting: (p106<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p169)
states: 163,159,056 (8)
abstracting: (1<=p169)
states: 163,159,056 (8)
....................
before gc: list nodes free: 7406217

after gc: idd nodes used:9608545, unused:54391455; list nodes free:245511920
.......................
EG iterations: 43
abstracting: (1<=p87)
states: 2,025,270 (6)
abstracting: (p165<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p127)
states: 9,108,723,456 (9)
.......................................
EG iterations: 39
abstracting: (p46<=0)
states: 18,681,110,043 (10)
.abstracting: (1<=p17)
states: 15,957,688,908 (10)
.............
before gc: list nodes free: 2327795

after gc: idd nodes used:9479779, unused:54520221; list nodes free:246353974
............................
EG iterations: 41
abstracting: (p80<=p188)
states: 12,150,523,597 (10)
........
before gc: list nodes free: 3263857

after gc: idd nodes used:9026868, unused:54973132; list nodes free:248449310
...............................
EG iterations: 39

before gc: list nodes free: 2725788

after gc: idd nodes used:8493315, unused:55506685; list nodes free:250888734
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16394036 kB
MemFree: 6146012 kB
After kill :
MemTotal: 16394036 kB
MemFree: 16182660 kB

BK_TIME_CONFINEMENT_REACHED

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p92

The net has transition(s) that can never fire:
t90

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:10786 (60), effective:882 (4)

initing FirstDep: 0m 0.001sec


iterations count:2625 (14), effective:117 (0)

net_ddint.h:600: Timeout: after 223 sec


iterations count:5070 (28), effective:337 (1)

iterations count:2369 (13), effective:123 (0)

iterations count:2188 (12), effective:144 (0)

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

iterations count:4111 (23), effective:189 (1)

iterations count:2379 (13), effective:146 (0)

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

iterations count:3147 (17), effective:197 (1)

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

iterations count:4894 (27), effective:309 (1)

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

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

iterations count:4894 (27), effective:309 (1)

iterations count:4894 (27), effective:309 (1)

iterations count:2265 (12), effective:119 (0)

iterations count:4291 (24), effective:279 (1)

iterations count:275 (1), effective:26 (0)

iterations count:2334 (13), effective:132 (0)

iterations count:3317 (18), effective:184 (1)

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

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

iterations count:2385 (13), effective:147 (0)

sat_reach.icc:155: Timeout: after 413 sec


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

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

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

net_ddint.h:600: Timeout: after 464 sec


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

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

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

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

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

iterations count:821 (4), effective:51 (0)

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

iterations count:374 (2), effective:5 (0)

net_ddint.h:600: Timeout: after 414 sec


iterations count:2625 (14), effective:117 (0)

iterations count:1214 (6), effective:57 (0)

iterations count:1991 (11), effective:119 (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="BusinessProcesses-PT-01"
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 BusinessProcesses-PT-01, 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 r033-tajo-167813686000449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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