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-167813686000473.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-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r033-tajo-167813686000473
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:43 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.6K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 79K 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-04-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678304323267

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-04
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_04
(NrP: 288 NrTr: 283 NrArc: 916)

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

net check time: 0m 0.000sec

init dd package: 0m 3.329sec


RS generation: 0m57.960sec


-> reachability set: #nodes 1597090 (1.6e+06) #states 219,702,042,353 (11)



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

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

abstracting: (1<=p41)
states: 9,750,694,080 (9)

before gc: list nodes free: 860250

after gc: idd nodes used:2194754, unused:61805246; list nodes free:265334665
MC time: 3m42.127sec

checking: EF [AX [~ [p148<=0]]]
normalized: E [true U ~ [EX [p148<=0]]]

abstracting: (p148<=0)
states: 193,306,139,379 (11)
.-> the formula is TRUE

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

MC time: 2m 7.689sec

checking: AG [AF [p80<=p51]]
normalized: ~ [E [true U EG [~ [p80<=p51]]]]

abstracting: (p80<=p51)
states: 171,470,781,425 (11)

before gc: list nodes free: 1956330

after gc: idd nodes used:2714140, unused:61285860; list nodes free:271456626
.........
before gc: list nodes free: 1425404

after gc: idd nodes used:3300063, unused:60699937; list nodes free:270964067
................
before gc: list nodes free: 1855992

after gc: idd nodes used:3268702, unused:60731298; list nodes free:271102052
.MC time: 3m34.050sec

checking: AF [AF [[EF [EG [1<=p131]] & EX [AX [p168<=0]]]]]
normalized: ~ [EG [EG [~ [[EX [~ [EX [~ [p168<=0]]]] & E [true U EG [1<=p131]]]]]]]

abstracting: (1<=p131)
states: 1,896,662,806 (9)
..........
before gc: list nodes free: 2768013

after gc: idd nodes used:4586580, unused:59413420; list nodes free:265437488
....MC time: 3m19.021sec

checking: [AX [EF [[~ [p271<=p53] & ~ [p262<=p96]]]] & AF [EX [~ [AX [AX [1<=p10]]]]]]
normalized: [~ [EG [~ [EX [EX [EX [~ [1<=p10]]]]]]] & ~ [EX [~ [E [true U [~ [p262<=p96] & ~ [p271<=p53]]]]]]]

abstracting: (p271<=p53)
states: 219,659,282,129 (11)
abstracting: (p262<=p96)
states: 219,618,105,617 (11)

before gc: list nodes free: 5827486

after gc: idd nodes used:4067306, unused:59932694; list nodes free:267622579
.abstracting: (1<=p10)
states: 130,831,391,412 (11)
........
before gc: list nodes free: 3394471

after gc: idd nodes used:4105940, unused:59894060; list nodes free:267517047
MC time: 3m 6.081sec

checking: EF [~ [[p147<=1 | ~ [[~ [[E [1<=p222 U 1<=p219] & p157<=1]] & p142<=0]]]]]
normalized: E [true U ~ [[p147<=1 | ~ [[p142<=0 & ~ [[p157<=1 & E [1<=p222 U 1<=p219]]]]]]]]

abstracting: (1<=p219)
states: 2,665,046,592 (9)
abstracting: (1<=p222)
states: 11,408,422,752 (10)
abstracting: (p157<=1)
states: 219,702,042,353 (11)
abstracting: (p142<=0)
states: 175,761,086,843 (11)
abstracting: (p147<=1)
states: 219,702,042,353 (11)
-> the formula is FALSE

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

MC time: 0m13.197sec

checking: E [A [~ [1<=p146] U E [EX [p141<=p249] U AX [[1<=p13 | p11<=0]]]] U 1<=p152]
normalized: E [[~ [EG [~ [E [EX [p141<=p249] U ~ [EX [~ [[1<=p13 | p11<=0]]]]]]]] & ~ [E [~ [E [EX [p141<=p249] U ~ [EX [~ [[1<=p13 | p11<=0]]]]]] U [1<=p146 & ~ [E [EX [p141<=p249] U ~ [EX [~ [[1<=p13 | p11<=0]]]]]]]]]] U 1<=p152]

abstracting: (1<=p152)
states: 26,395,902,974 (10)
abstracting: (p11<=0)
states: 194,433,038,993 (11)
abstracting: (1<=p13)
states: 7,518,194,304 (9)
.abstracting: (p141<=p249)
states: 176,857,996,619 (11)
.
before gc: list nodes free: 3416836

after gc: idd nodes used:5728396, unused:58271604; list nodes free:260812751
MC time: 3m 4.656sec

checking: [EF [E [AG [[~ [1<=p270] | [p51<=0 | 1<=p53]]] U 1<=p281]] | ~ [EF [~ [AF [[p200<=1 | A [1<=p29 U p161<=1]]]]]]]
normalized: [~ [E [true U EG [~ [[p200<=1 | [~ [EG [~ [p161<=1]]] & ~ [E [~ [p161<=1] U [~ [1<=p29] & ~ [p161<=1]]]]]]]]]] | E [true U E [~ [E [true U ~ [[[p51<=0 | 1<=p53] | ~ [1<=p270]]]]] U 1<=p281]]]

abstracting: (1<=p281)
states: 42,816,528 (7)
abstracting: (1<=p270)
states: 71,548,416 (7)
abstracting: (1<=p53)
states: 7,605,615,168 (9)
abstracting: (p51<=0)
states: 194,433,038,993 (11)
abstracting: (p161<=1)
states: 219,702,042,353 (11)
abstracting: (1<=p29)
states: 33,047,355,712 (10)
abstracting: (p161<=1)
states: 219,702,042,353 (11)
abstracting: (p161<=1)
states: 219,702,042,353 (11)
.
EG iterations: 1
abstracting: (p200<=1)
states: 219,702,042,353 (11)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m46.219sec

checking: AG [[E [p277<=1 U ~ [[[[1<=p21 & p283<=1] & E [1<=p174 U p145<=0]] & EX [1<=p17]]]] | p113<=1]]
normalized: ~ [E [true U ~ [[p113<=1 | E [p277<=1 U ~ [[EX [1<=p17] & [E [1<=p174 U p145<=0] & [1<=p21 & p283<=1]]]]]]]]]

abstracting: (p283<=1)
states: 219,702,042,353 (11)
abstracting: (1<=p21)
states: 684,796,768 (8)
abstracting: (p145<=0)
states: 178,710,880,721 (11)
abstracting: (1<=p174)
states: 80,693,587,584 (10)
abstracting: (1<=p17)
states: 16,305,125,696 (10)
.abstracting: (p277<=1)
states: 219,702,042,353 (11)
abstracting: (p113<=1)
states: 219,702,042,353 (11)
-> the formula is TRUE

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

MC time: 0m42.271sec

checking: ~ [AG [[AF [p110<=p18] & EF [[E [1<=p230 U p225<=p45] | A [p160<=p235 U p92<=p212]]]]]]
normalized: E [true U ~ [[E [true U [[~ [EG [~ [p92<=p212]]] & ~ [E [~ [p92<=p212] U [~ [p160<=p235] & ~ [p92<=p212]]]]] | E [1<=p230 U p225<=p45]]] & ~ [EG [~ [p110<=p18]]]]]]

abstracting: (p110<=p18)
states: 170,122,557,953 (11)
.........
before gc: list nodes free: 5195037

after gc: idd nodes used:6903804, unused:57096196; list nodes free:255688365
.......
before gc: list nodes free: 2316630

after gc: idd nodes used:7357379, unused:56642621; list nodes free:253536081
.MC time: 3m12.102sec

checking: AX [~ [A [AG [[[p134<=1 | p119<=p219] & AF [p173<=0]]] U E [[[p159<=1 | p54<=1] & ~ [1<=p163]] U ~ [E [1<=p45 U p57<=0]]]]]]
normalized: ~ [EX [[~ [EG [~ [E [[~ [1<=p163] & [p159<=1 | p54<=1]] U ~ [E [1<=p45 U p57<=0]]]]]] & ~ [E [~ [E [[~ [1<=p163] & [p159<=1 | p54<=1]] U ~ [E [1<=p45 U p57<=0]]]] U [E [true U ~ [[~ [EG [~ [p173<=0]]] & [p134<=1 | p119<=p219]]]] & ~ [E [[~ [1<=p163] & [p159<=1 | p54<=1]] U ~ [E [1<=p45 U p57<=0]]]]]]]]]]

abstracting: (p57<=0)
states: 219,637,648,433 (11)
abstracting: (1<=p45)
states: 24,500,628,220 (10)
abstracting: (p54<=1)
states: 219,702,042,353 (11)
abstracting: (p159<=1)
states: 219,702,042,353 (11)
abstracting: (1<=p163)
states: 23,578,080,796 (10)
abstracting: (p119<=p219)
states: 219,507,204,097 (11)
abstracting: (p134<=1)
states: 219,702,042,353 (11)
abstracting: (p173<=0)
states: 207,177,745,901 (11)
.MC time: 2m56.002sec

checking: E [[E [~ [1<=p98] U [[[EF [p17<=1] | p91<=p200] | [AG [1<=p257] | EX [1<=p17]]] & p241<=1]] | [EG [[EG [1<=p161] | AX [p121<=p159]]] | 1<=p32]] U 1<=p139]
normalized: E [[[1<=p32 | EG [[~ [EX [~ [p121<=p159]]] | EG [1<=p161]]]] | E [~ [1<=p98] U [p241<=1 & [[EX [1<=p17] | ~ [E [true U ~ [1<=p257]]]] | [p91<=p200 | E [true U p17<=1]]]]]] U 1<=p139]

abstracting: (1<=p139)
states: 0
abstracting: (p17<=1)
states: 219,702,042,353 (11)
abstracting: (p91<=p200)
states: 219,630,493,649 (11)
abstracting: (1<=p257)
states: 2,243,802,176 (9)
abstracting: (1<=p17)
states: 16,305,125,696 (10)

before gc: list nodes free: 3691249

after gc: idd nodes used:8041975, unused:55958025; list nodes free:250862344
.abstracting: (p241<=1)
states: 219,702,042,353 (11)
abstracting: (1<=p98)
states: 4,679,936,448 (9)
abstracting: (1<=p161)
states: 66,705,327,214 (10)
MC time: 2m42.218sec

checking: E [[EF [[[[~ [1<=p159] & 1<=p101] | A [p47<=p143 U 1<=p71]] | AX [A [p140<=0 U p138<=p42]]]] | [EG [~ [EX [p5<=p106]]] | AF [p99<=0]]] U 1<=p71]
normalized: E [[[~ [EG [~ [p99<=0]]] | EG [~ [EX [p5<=p106]]]] | E [true U [~ [EX [~ [[~ [EG [~ [p138<=p42]]] & ~ [E [~ [p138<=p42] U [~ [p140<=0] & ~ [p138<=p42]]]]]]]] | [[~ [EG [~ [1<=p71]]] & ~ [E [~ [1<=p71] U [~ [p47<=p143] & ~ [1<=p71]]]]] | [1<=p101 & ~ [1<=p159]]]]]] U 1<=p71]

abstracting: (1<=p71)
states: 779,532,456 (8)
abstracting: (1<=p159)
states: 65,624,935,552 (10)
abstracting: (1<=p101)
states: 4,679,936,592 (9)
abstracting: (1<=p71)
states: 779,532,456 (8)
abstracting: (p47<=p143)
states: 202,162,878,937 (11)
abstracting: (1<=p71)
states: 779,532,456 (8)

before gc: list nodes free: 9157741

after gc: idd nodes used:10288340, unused:53711660; list nodes free:241194955
MC time: 2m28.066sec

checking: ~ [E [AX [A [p51<=0 U [[p46<=0 & 1<=p139] & p84<=p184]]] U [AX [[A [p126<=1 U p234<=1] | ~ [AX [1<=p182]]]] & [EX [[1<=p137 & ~ [1<=p214]]] | [E [AG [p45<=0] U AX [1<=p116]] & EG [EF [p71<=1]]]]]]]
normalized: ~ [E [~ [EX [~ [[~ [EG [~ [[p84<=p184 & [p46<=0 & 1<=p139]]]]] & ~ [E [~ [[p84<=p184 & [p46<=0 & 1<=p139]]] U [~ [p51<=0] & ~ [[p84<=p184 & [p46<=0 & 1<=p139]]]]]]]]]] U [[[EG [E [true U p71<=1]] & E [~ [E [true U ~ [p45<=0]]] U ~ [EX [~ [1<=p116]]]]] | EX [[1<=p137 & ~ [1<=p214]]]] & ~ [EX [~ [[EX [~ [1<=p182]] | [~ [EG [~ [p234<=1]]] & ~ [E [~ [p234<=1] U [~ [p126<=1] & ~ [p234<=1]]]]]]]]]]]]

abstracting: (p234<=1)
states: 219,702,042,353 (11)
abstracting: (p126<=1)
states: 219,702,042,353 (11)
abstracting: (p234<=1)
states: 219,702,042,353 (11)
abstracting: (p234<=1)
states: 219,702,042,353 (11)
.
EG iterations: 1
abstracting: (1<=p182)
states: 12,495,645,406 (10)
..abstracting: (1<=p214)
states: 1,369,593,536 (9)
abstracting: (1<=p137)
states: 43,940,955,510 (10)

before gc: list nodes free: 3963152

after gc: idd nodes used:12206336, unused:51793664; list nodes free:233025657
MC time: 2m16.584sec

checking: ~ [[AG [AF [[E [p81<=1 U p170<=1] & [~ [p113<=p127] | [p149<=1 & p254<=1]]]]] | [E [AX [EF [p176<=p72]] U [[[E [1<=p117 U p203<=p174] & 1<=p58] & EX [p8<=p81]] & EG [AG [1<=p44]]]] & AG [[E [[p242<=0 | p83<=1] U ~ [1<=p72]] & AF [p163<=0]]]]]]
normalized: ~ [[[~ [E [true U ~ [[~ [EG [~ [p163<=0]]] & E [[p242<=0 | p83<=1] U ~ [1<=p72]]]]]] & E [~ [EX [~ [E [true U p176<=p72]]]] U [EG [~ [E [true U ~ [1<=p44]]]] & [EX [p8<=p81] & [1<=p58 & E [1<=p117 U p203<=p174]]]]]] | ~ [E [true U EG [~ [[[[p149<=1 & p254<=1] | ~ [p113<=p127]] & E [p81<=1 U p170<=1]]]]]]]]

abstracting: (p170<=1)
states: 219,702,042,353 (11)
abstracting: (p81<=1)
states: 219,702,042,353 (11)
abstracting: (p113<=p127)
states: 215,811,532,337 (11)
abstracting: (p254<=1)
states: 219,702,042,353 (11)
abstracting: (p149<=1)
states: 219,702,042,353 (11)
.
EG iterations: 1
abstracting: (p203<=p174)
states: 217,424,755,217 (11)
abstracting: (1<=p117)
states: 48,964,896,864 (10)
abstracting: (1<=p58)
states: 4,822,017,264 (9)
abstracting: (p8<=p81)
states: 219,593,377,589 (11)
MC time: 2m 4.454sec

checking: [A [[[p254<=0 & [[~ [AG [p252<=1]] | A [p187<=p151 U p55<=p287]] & AF [[1<=p76 | p90<=p161]]]] | EF [[AX [p196<=p253] | ~ [[1<=p117 | p232<=p133]]]]] U [[[~ [A [1<=p178 U p61<=p265]] | AG [p244<=0]] & EG [p177<=0]] | EF [~ [p118<=1]]]] & AX [[~ [[A [EX [p158<=p151] U AF [1<=p33]] & AX [[p68<=p137 & 1<=p104]]]] | EF [[E [p111<=p148 U p222<=0] & E [p246<=1 U 1<=p247]]]]]]
normalized: [~ [EX [~ [[E [true U [E [p246<=1 U 1<=p247] & E [p111<=p148 U p222<=0]]] | ~ [[~ [EX [~ [[p68<=p137 & 1<=p104]]]] & [~ [EG [EG [~ [1<=p33]]]] & ~ [E [EG [~ [1<=p33]] U [~ [EX [p158<=p151]] & EG [~ [1<=p33]]]]]]]]]]]] & [~ [EG [~ [[E [true U ~ [p118<=1]] | [EG [p177<=0] & [~ [E [true U ~ [p244<=0]]] | ~ [[~ [EG [~ [p61<=p265]]] & ~ [E [~ [p61<=p265] U [~ [1<=p178] & ~ [p61<=p265]]]]]]]]]]]] & ~ [E [~ [[E [true U ~ [p118<=1]] | [EG [p177<=0] & [~ [E [true U ~ [p244<=0]]] | ~ [[~ [EG [~ [p61<=p265]]] & ~ [E [~ [p61<=p265] U [~ [1<=p178] & ~ [p61<=p265]]]]]]]]]] U [~ [[E [true U [~ [[1<=p117 | p232<=p133]] | ~ [EX [~ [p196<=p253]]]]] | [p254<=0 & [~ [EG [~ [[1<=p76 | p90<=p161]]]] & [[~ [EG [~ [p55<=p287]]] & ~ [E [~ [p55<=p287] U [~ [p187<=p151] & ~ [p55<=p287]]]]] | E [true U ~ [p252<=1]]]]]]] & ~ [[E [true U ~ [p118<=1]] | [EG [p177<=0] & [~ [E [true U ~ [p244<=0]]] | ~ [[~ [EG [~ [p61<=p265]]] & ~ [E [~ [p61<=p265] U [~ [1<=p178] & ~ [p61<=p265]]]]]]]]]]]]]]]

abstracting: (p61<=p265)
states: 219,659,113,073 (11)
abstracting: (1<=p178)
states: 12,495,645,406 (10)
abstracting: (p61<=p265)
states: 219,659,113,073 (11)
abstracting: (p61<=p265)
states: 219,659,113,073 (11)
...........................................
EG iterations: 43
abstracting: (p244<=0)
states: 217,756,789,937 (11)

before gc: list nodes free: 10637592

after gc: idd nodes used:12857483, unused:51142517; list nodes free:230179794
MC time: 1m54.022sec

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

abstracting: (1<=p41)
states: 9,750,694,080 (9)

before gc: list nodes free: 11671408

after gc: idd nodes used:13284379, unused:50715621; list nodes free:228336259
.
EG iterations: 0
-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m37.909sec

checking: AG [AF [p80<=p51]]
normalized: ~ [E [true U EG [~ [p80<=p51]]]]

abstracting: (p80<=p51)
states: 171,470,781,425 (11)
.......
before gc: list nodes free: 8261282

after gc: idd nodes used:13117308, unused:50882692; list nodes free:229015275
............
before gc: list nodes free: 3237677

after gc: idd nodes used:13882077, unused:50117923; list nodes free:225463092
....................
EG iterations: 39

before gc: list nodes free: 5378908

after gc: idd nodes used:12928871, unused:51071129; list nodes free:229877025
-> the formula is FALSE

FORMULA BusinessProcesses-PT-04-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16394036 kB
MemFree: 6137276 kB
After kill :
MemTotal: 16394036 kB
MemFree: 16180824 kB

BK_TIME_CONFINEMENT_REACHED

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p134
p139

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

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.001sec


iterations count:30394 (107), effective:2412 (8)

initing FirstDep: 0m 0.001sec


iterations count:8273 (29), effective:362 (1)

sat_reach.icc:155: Timeout: after 221 sec


iterations count:9481 (33), effective:303 (1)

ctl_mc.icc:221: Timeout: after 212 sec


net_ddint.h:600: Timeout: after 198 sec


net_ddint.h:600: Timeout: after 185 sec


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

sat_reach.icc:155: Timeout: after 183 sec


iterations count:2087 (7), effective:97 (0)

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

iterations count:1289 (4), effective:72 (0)

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

ctl_mc.icc:221: Timeout: after 191 sec


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

iterations count:1676 (5), effective:84 (0)

net_ddint.h:600: Timeout: after 175 sec


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

iterations count:434 (1), effective:5 (0)

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

net_ddint.h:600: Timeout: after 161 sec


sat_reach.icc:155: Timeout: after 147 sec


net_ddint.h:600: Timeout: after 135 sec


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

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

net_ddint.h:600: Timeout: after 123 sec


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

sat_reach.icc:155: Timeout: after 113 sec


iterations count:8273 (29), effective:362 (1)

iterations count:5566 (19), effective:187 (0)

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

iterations count:2120 (7), effective:110 (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-04"
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-04, 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-167813686000473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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