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

About the Execution of Marcie for ResAllocation-PT-R050C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10180.380 3600000.00 3600018.00 81.00 TT?T?T?FFF??FF?F 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.r321-tall-167889192600761.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 ResAllocation-PT-R050C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r321-tall-167889192600761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 15:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 15:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 15:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 212K Mar 5 18:23 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 ResAllocation-PT-R050C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R050C002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678942586535

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=ResAllocation-PT-R050C002
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: ResAllocation_PT_R050C002
(NrP: 200 NrTr: 102 NrArc: 500)

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

net check time: 0m 0.000sec

init dd package: 0m 2.891sec


RS generation: 0m 0.191sec


-> reachability set: #nodes 556 (5.6e+02) #states 29,273,397,577,908,224 (16)



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

checking: AF [EG [1<=r_0_1]]
normalized: ~ [EG [~ [EG [1<=r_0_1]]]]

abstracting: (1<=r_0_1)
states: 14,355,223,812,243,456 (16)
........................................................................................................................................................
before gc: list nodes free: 1048124

after gc: idd nodes used:1733570, unused:62266430; list nodes free:293835089
.....................................................
before gc: list nodes free: 47730

after gc: idd nodes used:2126087, unused:61873913; list nodes free:291945325
...........................................
before gc: list nodes free: 1890178

after gc: idd nodes used:2184234, unused:61815766; list nodes free:293810457
..............................MC time: 3m45.006sec

checking: EX [~ [EG [~ [AX [AG [p_0_29<=0]]]]]]
normalized: EX [~ [EG [EX [E [true U ~ [p_0_29<=0]]]]]]

abstracting: (p_0_29<=0)
states: 23,080,948,090,273,792 (16)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 1714218

after gc: idd nodes used:109244, unused:63890756; list nodes free:303583913
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1225
.-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.509sec

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

abstracting: (p_1_23<=1)
states: 29,273,397,577,908,224 (16)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.255sec

checking: EG [EG [r_0_48<=r_0_16]]
normalized: EG [EG [r_0_48<=r_0_16]]

abstracting: (r_0_48<=r_0_16)
states: 21,955,048,183,431,168 (16)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1189
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.847sec

checking: AF [AF [EF [~ [[r_1_18<=r_0_7 | p_0_49<=p_1_41]]]]]
normalized: ~ [EG [EG [~ [E [true U ~ [[r_1_18<=r_0_7 | p_0_49<=p_1_41]]]]]]]

abstracting: (p_0_49<=p_1_41)
states: 28,710,447,624,486,912 (16)
abstracting: (r_1_18<=r_0_7)
states: 17,310,711,067,705,344 (16)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec

checking: ~ [EF [AG [EX [[AF [p_1_48<=p_1_43] & [p_0_0<=1 & r_0_18<=1]]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [[[p_0_0<=1 & r_0_18<=1] & ~ [EG [~ [p_1_48<=p_1_43]]]]]]]]]]

abstracting: (p_1_48<=p_1_43)
states: 21,532,835,718,365,184 (16)
...........................................
before gc: list nodes free: 5807928

after gc: idd nodes used:342068, unused:63657932; list nodes free:302543104
.................................................................................
before gc: list nodes free: 13989771

after gc: idd nodes used:2594412, unused:61405588; list nodes free:292399226
............................
before gc: list nodes free: 14249418

after gc: idd nodes used:3315719, unused:60684281; list nodes free:289150821
MC time: 4m36.205sec

checking: AX [[AX [[AG [p_0_21<=1] & EF [~ [p_1_40<=1]]]] & ~ [AF [[[r_1_46<=0 | 1<=r_0_1] & ~ [E [p_0_29<=0 U r_1_38<=0]]]]]]]
normalized: ~ [EX [~ [[EG [~ [[~ [E [p_0_29<=0 U r_1_38<=0]] & [r_1_46<=0 | 1<=r_0_1]]]] & ~ [EX [~ [[E [true U ~ [p_1_40<=1]] & ~ [E [true U ~ [p_0_21<=1]]]]]]]]]]]

abstracting: (p_0_21<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (p_1_40<=1)
states: 29,273,397,577,908,224 (16)
.abstracting: (1<=r_0_1)
states: 14,355,223,812,243,456 (16)
abstracting: (r_1_46<=0)
states: 13,510,798,882,111,488 (16)
abstracting: (r_1_38<=0)
states: 11,258,999,068,426,240 (16)
abstracting: (p_0_29<=0)
states: 23,080,948,090,273,792 (16)
.................................................................................................................................................................
before gc: list nodes free: 11169857

after gc: idd nodes used:913046, unused:63086954; list nodes free:299794327
.............................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 542
.-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m31.438sec

checking: ~ [[[AG [A [AG [r_0_1<=p_1_30] U AF [p_0_23<=1]]] | AX [r_0_6<=p_0_34]] & EF [1<=p_0_47]]]
normalized: ~ [[[~ [EX [~ [r_0_6<=p_0_34]]] | ~ [E [true U ~ [[~ [EG [EG [~ [p_0_23<=1]]]] & ~ [E [EG [~ [p_0_23<=1]] U [EG [~ [p_0_23<=1]] & E [true U ~ [r_0_1<=p_1_30]]]]]]]]]] & E [true U 1<=p_0_47]]]

abstracting: (1<=p_0_47)
states: 1,125,899,906,842,624 (15)
abstracting: (r_0_1<=p_1_30)
states: 19,281,035,904,679,936 (16)
abstracting: (p_0_23<=1)
states: 29,273,397,577,908,224 (16)
.
EG iterations: 1
abstracting: (p_0_23<=1)
states: 29,273,397,577,908,224 (16)
.
EG iterations: 1
abstracting: (p_0_23<=1)
states: 29,273,397,577,908,224 (16)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (r_0_6<=p_0_34)
states: 17,310,711,067,705,344 (16)
.-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.290sec

checking: ~ [AX [E [EX [~ [EG [1<=r_0_38]]] U [[AG [1<=r_0_48] & [EX [1<=r_0_33] | r_0_11<=p_1_12]] | ~ [E [r_1_40<=1 U r_1_37<=p_0_33]]]]]]
normalized: EX [~ [E [EX [~ [EG [1<=r_0_38]]] U [~ [E [r_1_40<=1 U r_1_37<=p_0_33]] | [[r_0_11<=p_1_12 | EX [1<=r_0_33]] & ~ [E [true U ~ [1<=r_0_48]]]]]]]]

abstracting: (1<=r_0_48)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=r_0_33)
states: 14,355,223,812,243,456 (16)
.abstracting: (r_0_11<=p_1_12)
states: 16,747,761,114,284,032 (16)
abstracting: (r_1_37<=p_0_33)
states: 15,340,386,230,730,752 (16)
abstracting: (r_1_40<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (1<=r_0_38)
states: 14,355,223,812,243,456 (16)
................................
before gc: list nodes free: 7301272

after gc: idd nodes used:259623, unused:63740377; list nodes free:302913487
...................................................................
before gc: list nodes free: 14274699

after gc: idd nodes used:3009156, unused:60990844; list nodes free:290532922
..................
before gc: list nodes free: 14715884

after gc: idd nodes used:4040731, unused:59959269; list nodes free:285779956
.MC time: 4m58.145sec

checking: AX [E [1<=r_1_15 U [[AX [r_1_0<=p_1_5] & 1<=r_0_34] | [AG [EX [1<=p_1_49]] | [AF [r_0_14<=0] | [EX [r_1_32<=0] & AG [1<=p_1_20]]]]]]]
normalized: ~ [EX [~ [E [1<=r_1_15 U [[1<=r_0_34 & ~ [EX [~ [r_1_0<=p_1_5]]]] | [~ [E [true U ~ [EX [1<=p_1_49]]]] | [[EX [r_1_32<=0] & ~ [E [true U ~ [1<=p_1_20]]]] | ~ [EG [~ [r_0_14<=0]]]]]]]]]]

abstracting: (r_0_14<=0)
states: 14,918,173,765,664,768 (16)
.........................................................................................................................................................................................................................
before gc: list nodes free: 7493602

after gc: idd nodes used:737129, unused:63262871; list nodes free:300624518
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1367
abstracting: (1<=p_1_20)
states: 6,192,449,487,634,432 (15)
abstracting: (r_1_32<=0)
states: 9,570,149,208,162,304 (15)
.abstracting: (1<=p_1_49)
states: 14,355,223,812,243,456 (16)
.abstracting: (r_1_0<=p_1_5)
states: 2,251,799,813,685,248 (15)
.abstracting: (1<=r_0_34)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=r_1_15)
states: 24,488,322,973,827,072 (16)
.-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m40.129sec

checking: E [1<=p_0_46 U [[[AG [[[r_1_10<=1 & p_0_47<=0] | r_1_35<=1]] | 1<=p_1_37] | [AF [EX [r_1_39<=1]] & EX [AG [p_0_13<=1]]]] | E [~ [p_1_3<=0] U AG [[~ [1<=p_0_18] & AG [1<=r_0_45]]]]]]
normalized: E [1<=p_0_46 U [E [~ [p_1_3<=0] U ~ [E [true U ~ [[~ [E [true U ~ [1<=r_0_45]]] & ~ [1<=p_0_18]]]]]] | [[EX [~ [E [true U ~ [p_0_13<=1]]]] & ~ [EG [~ [EX [r_1_39<=1]]]]] | [~ [E [true U ~ [[[r_1_10<=1 & p_0_47<=0] | r_1_35<=1]]]] | 1<=p_1_37]]]]

abstracting: (1<=p_1_37)
states: 10,977,524,091,715,584 (16)
abstracting: (r_1_35<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (p_0_47<=0)
states: 28,147,497,671,065,600 (16)
abstracting: (r_1_10<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (r_1_39<=1)
states: 29,273,397,577,908,224 (16)
..
EG iterations: 1
abstracting: (p_0_13<=1)
states: 29,273,397,577,908,224 (16)
.abstracting: (1<=p_0_18)
states: 9,288,674,231,451,648 (15)
abstracting: (1<=r_0_45)
states: 14,355,223,812,243,456 (16)
abstracting: (p_1_3<=0)
states: 27,866,022,694,354,944 (16)
abstracting: (1<=p_0_46)
states: 1,407,374,883,553,280 (15)
-> the formula is TRUE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AF [A [r_1_2<=1 U ~ [[[[[r_0_18<=r_1_36 & 1<=r_0_22] | [1<=p_1_13 & 1<=p_0_33]] | r_0_47<=p_1_48] & p_0_30<=r_0_42]]]]
normalized: ~ [EG [~ [[~ [EG [[[[[1<=p_1_13 & 1<=p_0_33] | [r_0_18<=r_1_36 & 1<=r_0_22]] | r_0_47<=p_1_48] & p_0_30<=r_0_42]]] & ~ [E [[[[[1<=p_1_13 & 1<=p_0_33] | [r_0_18<=r_1_36 & 1<=r_0_22]] | r_0_47<=p_1_48] & p_0_30<=r_0_42] U [~ [r_1_2<=1] & [[[[1<=p_1_13 & 1<=p_0_33] | [r_0_18<=r_1_36 & 1<=r_0_22]] | r_0_47<=p_1_48] & p_0_30<=r_0_42]]]]]]]]

abstracting: (p_0_30<=r_0_42)
states: 26,177,172,834,091,008 (16)
abstracting: (r_0_47<=p_1_48)
states: 21,814,310,695,075,840 (16)
abstracting: (1<=r_0_22)
states: 14,355,223,812,243,456 (16)
abstracting: (r_0_18<=r_1_36)
states: 24,066,110,508,761,088 (16)
abstracting: (1<=p_0_33)
states: 5,066,549,580,791,808 (15)
abstracting: (1<=p_1_13)
states: 4,222,124,650,659,840 (15)
abstracting: (r_1_2<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (p_0_30<=r_0_42)
states: 26,177,172,834,091,008 (16)
abstracting: (r_0_47<=p_1_48)
states: 21,814,310,695,075,840 (16)
abstracting: (1<=r_0_22)
states: 14,355,223,812,243,456 (16)
abstracting: (r_0_18<=r_1_36)
states: 24,066,110,508,761,088 (16)
abstracting: (1<=p_0_33)
states: 5,066,549,580,791,808 (15)
abstracting: (1<=p_1_13)
states: 4,222,124,650,659,840 (15)
abstracting: (p_0_30<=r_0_42)
states: 26,177,172,834,091,008 (16)
abstracting: (r_0_47<=p_1_48)
states: 21,814,310,695,075,840 (16)
abstracting: (1<=r_0_22)
states: 14,355,223,812,243,456 (16)
abstracting: (r_0_18<=r_1_36)
states: 24,066,110,508,761,088 (16)
abstracting: (1<=p_0_33)
states: 5,066,549,580,791,808 (15)
abstracting: (1<=p_1_13)
states: 4,222,124,650,659,840 (15)
..........................................................................................
before gc: list nodes free: 6979348

after gc: idd nodes used:302563, unused:63697437; list nodes free:302681491
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 1153
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.647sec

checking: AF [[E [~ [[[[p_0_48<=r_0_24 & r_0_40<=0] | 1<=p_0_9] & [AX [p_1_2<=p_0_49] & ~ [p_0_14<=p_1_32]]]] U A [p_1_37<=0 U 1<=r_0_0]] & [[1<=r_1_36 & [AG [~ [1<=r_0_13]] & E [r_1_15<=1 U ~ [r_0_20<=r_0_33]]]] & AX [p_1_41<=p_0_37]]]]
normalized: ~ [EG [~ [[[[[~ [E [true U 1<=r_0_13]] & E [r_1_15<=1 U ~ [r_0_20<=r_0_33]]] & 1<=r_1_36] & ~ [EX [~ [p_1_41<=p_0_37]]]] & E [~ [[[~ [EX [~ [p_1_2<=p_0_49]]] & ~ [p_0_14<=p_1_32]] & [1<=p_0_9 | [p_0_48<=r_0_24 & r_0_40<=0]]]] U [~ [EG [~ [1<=r_0_0]]] & ~ [E [~ [1<=r_0_0] U [~ [1<=r_0_0] & ~ [p_1_37<=0]]]]]]]]]]

abstracting: (p_1_37<=0)
states: 18,295,873,486,192,640 (16)
abstracting: (1<=r_0_0)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=r_0_0)
states: 14,355,223,812,243,456 (16)
abstracting: (1<=r_0_0)
states: 14,355,223,812,243,456 (16)
.....................................................................................................
before gc: list nodes free: 4817176

after gc: idd nodes used:1192725, unused:62807275; list nodes free:298485006
....................................................................
before gc: list nodes free: 2334813

after gc: idd nodes used:2006901, unused:61993099; list nodes free:294595537
........................................
before gc: list nodes free: 1662921

after gc: idd nodes used:2304987, unused:61695013; list nodes free:293184450
.................................
before gc: list nodes free: 1428404

after gc: idd nodes used:2396904, unused:61603096; list nodes free:292817994
MC time: 5m49.270sec

checking: E [[[EX [AF [[r_0_28<=0 | 1<=p_0_15]]] & A [AF [~ [p_1_8<=r_0_44]] U AX [r_0_31<=r_0_1]]] | EF [EG [[EX [p_0_17<=0] | A [p_1_40<=p_0_12 U p_0_5<=1]]]]] U A [EG [[~ [AG [r_0_20<=p_1_29]] & EG [1<=p_1_41]]] U EX [A [[p_0_24<=1 & 1<=p_1_9] U ~ [p_1_40<=p_0_3]]]]]
normalized: E [[[[~ [EG [EX [~ [r_0_31<=r_0_1]]]] & ~ [E [EX [~ [r_0_31<=r_0_1]] U [EG [p_1_8<=r_0_44] & EX [~ [r_0_31<=r_0_1]]]]]] & EX [~ [EG [~ [[r_0_28<=0 | 1<=p_0_15]]]]]] | E [true U EG [[[~ [EG [~ [p_0_5<=1]]] & ~ [E [~ [p_0_5<=1] U [~ [p_1_40<=p_0_12] & ~ [p_0_5<=1]]]]] | EX [p_0_17<=0]]]]] U [~ [EG [~ [EX [[~ [EG [p_1_40<=p_0_3]] & ~ [E [p_1_40<=p_0_3 U [p_1_40<=p_0_3 & ~ [[p_0_24<=1 & 1<=p_1_9]]]]]]]]]] & ~ [E [~ [EX [[~ [EG [p_1_40<=p_0_3]] & ~ [E [p_1_40<=p_0_3 U [p_1_40<=p_0_3 & ~ [[p_0_24<=1 & 1<=p_1_9]]]]]]]] U [~ [EX [[~ [EG [p_1_40<=p_0_3]] & ~ [E [p_1_40<=p_0_3 U [p_1_40<=p_0_3 & ~ [[p_0_24<=1 & 1<=p_1_9]]]]]]]] & ~ [EG [[EG [1<=p_1_41] & E [true U ~ [r_0_20<=p_1_29]]]]]]]]]]

abstracting: (r_0_20<=p_1_29)
states: 19,140,298,416,324,608 (16)
abstracting: (1<=p_1_41)
states: 12,103,423,998,558,208 (16)
.......................................................................
before gc: list nodes free: 7378962

after gc: idd nodes used:1470041, unused:62529959; list nodes free:297463697
........................................
before gc: list nodes free: 14295498

after gc: idd nodes used:3301055, unused:60698945; list nodes free:289216932
.....MC time: 5m 0.049sec

checking: AF [[E [[EF [[r_0_20<=r_1_14 & r_1_36<=p_1_0]] | r_0_43<=r_1_10] U E [[~ [r_0_28<=r_0_17] & p_1_7<=r_1_30] U ~ [EG [p_0_21<=p_1_23]]]] & [[[AG [r_0_19<=0] | 1<=r_1_43] & AF [[EG [p_1_25<=p_0_29] | ~ [1<=r_1_34]]]] & ~ [r_1_1<=1]]]]
normalized: ~ [EG [~ [[[[~ [EG [~ [[~ [1<=r_1_34] | EG [p_1_25<=p_0_29]]]]] & [1<=r_1_43 | ~ [E [true U ~ [r_0_19<=0]]]]] & ~ [r_1_1<=1]] & E [[E [true U [r_0_20<=r_1_14 & r_1_36<=p_1_0]] | r_0_43<=r_1_10] U E [[~ [r_0_28<=r_0_17] & p_1_7<=r_1_30] U ~ [EG [p_0_21<=p_1_23]]]]]]]]

abstracting: (p_0_21<=p_1_23)
states: 21,251,360,741,654,528 (16)
...............................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 11900252

after gc: idd nodes used:354730, unused:63645270; list nodes free:302427182
........................................................................................................................................................................................................................................
EG iterations: 583
abstracting: (p_1_7<=r_1_30)
states: 28,006,760,182,710,272 (16)
abstracting: (r_0_28<=r_0_17)
states: 21,955,048,183,431,168 (16)
abstracting: (r_0_43<=r_1_10)
states: 27,584,547,717,644,288 (16)
abstracting: (r_1_36<=p_1_0)
states: 10,977,524,091,715,584 (16)
abstracting: (r_0_20<=r_1_14)
states: 27,021,597,764,222,976 (16)
abstracting: (r_1_1<=1)
states: 29,273,397,577,908,224 (16)
abstracting: (r_0_19<=0)
states: 14,918,173,765,664,768 (16)
abstracting: (1<=r_1_43)
states: 16,607,023,625,928,704 (16)
abstracting: (p_1_25<=p_0_29)
states: 21,673,573,206,720,512 (16)
........................................................................................................................................
before gc: list nodes free: 13572890

after gc: idd nodes used:900183, unused:63099817; list nodes free:300029804
........................................................MC time: 4m17.009sec

checking: [EG [[EG [EG [1<=r_1_27]] & [p_0_28<=0 & ~ [AX [[r_1_22<=p_1_23 & r_0_36<=0]]]]]] & [EG [1<=r_1_46] & E [[~ [[[r_0_31<=r_1_31 & 1<=r_1_21] & E [p_0_34<=r_1_48 U p_0_28<=0]]] | AX [[r_0_34<=0 & r_0_5<=p_0_20]]] U [r_0_39<=1 & EG [[[1<=r_1_42 & 1<=r_0_14] | [r_1_17<=0 | r_0_7<=1]]]]]]]
normalized: [[E [[~ [[E [p_0_34<=r_1_48 U p_0_28<=0] & [r_0_31<=r_1_31 & 1<=r_1_21]]] | ~ [EX [~ [[r_0_34<=0 & r_0_5<=p_0_20]]]]] U [EG [[[r_1_17<=0 | r_0_7<=1] | [1<=r_1_42 & 1<=r_0_14]]] & r_0_39<=1]] & EG [1<=r_1_46]] & EG [[[EX [~ [[r_1_22<=p_1_23 & r_0_36<=0]]] & p_0_28<=0] & EG [EG [1<=r_1_27]]]]]

abstracting: (1<=r_1_27)
states: 21,110,623,253,299,200 (16)
........................................................................
before gc: list nodes free: 14806397

after gc: idd nodes used:792278, unused:63207722; list nodes free:300516088
.....................................................................
before gc: list nodes free: 14809411

after gc: idd nodes used:1399581, unused:62600419; list nodes free:297781675
.MC time: 3m40.178sec

checking: AF [EG [1<=r_0_1]]
normalized: ~ [EG [~ [EG [1<=r_0_1]]]]

abstracting: (1<=r_0_1)
states: 14,355,223,812,243,456 (16)
...........................................................................................................................................
before gc: list nodes free: 4684961

after gc: idd nodes used:1611106, unused:62388894; list nodes free:296498592
..........................................................
before gc: list nodes free: 2108146

after gc: idd nodes used:2075635, unused:61924365; list nodes free:294336336
...........................................
before gc: list nodes free: 1596720

after gc: idd nodes used:2217365, unused:61782635; list nodes free:293569393
...........................................
before gc: list nodes free: 1425602

after gc: idd nodes used:2086121, unused:61913879; list nodes free:294279194
....................................................
before gc: list nodes free: 1470768

after gc: idd nodes used:1647335, unused:62352665; list nodes free:296350040
...................................................................................
before gc: list nodes free: 1745747

after gc: idd nodes used:759349, unused:63240651; list nodes free:300499365
............................................................................................................................................................................................................................................................................................................................................................................................................................................................
before gc: list nodes free: 2872163

after gc: idd nodes used:100770, unused:63899230; list nodes free:303628740
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 2355

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R050C002-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 6046160 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16179136 kB

BK_TIME_CONFINEMENT_REACHED

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

check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:9174 (89), effective:2550 (25)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 224 sec


iterations count:1588 (15), effective:495 (4)

iterations count:82324 (807), effective:22003 (215)

iterations count:4112 (40), effective:1333 (13)

net_ddint.h:600: Timeout: after 275 sec


iterations count:404 (3), effective:90 (0)

iterations count:3775 (37), effective:1224 (12)

iterations count:391 (3), effective:82 (0)

iterations count:110 (1), effective:3 (0)

iterations count:592 (5), effective:138 (1)

ctl_mc.icc:221: Timeout: after 294 sec


iterations count:164 (1), effective:21 (0)

iterations count:8817 (86), effective:2450 (24)

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

iterations count:328 (3), effective:61 (0)

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

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

iterations count:455 (4), effective:104 (1)

net_ddint.h:600: Timeout: after 348 sec


iterations count:369 (3), effective:81 (0)

net_ddint.h:600: Timeout: after 299 sec


iterations count:126 (1), effective:7 (0)

iterations count:602 (5), effective:149 (1)

iterations count:1023 (10), effective:307 (3)

iterations count:281 (2), effective:51 (0)

net_ddint.h:600: Timeout: after 256 sec


ctl_mc.icc:221: Timeout: after 219 sec

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r321-tall-167889192600761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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