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

About the Execution of Marcie for PGCD-COL-D02N100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13412.535 3600000.00 3599089.00 60.00 ???F???????T??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.r513-tall-167987241000393.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 PGCD-COL-D02N100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987241000393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 16K Mar 26 22:42 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 PGCD-COL-D02N100-CTLCardinality-00
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-01
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-02
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-03
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-04
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-05
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-06
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-07
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-08
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-09
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-10
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-11
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-12
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-13
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-14
FORMULA_NAME PGCD-COL-D02N100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679895716141

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=PGCD-COL-D02N100
Not applying reductions.
Model is COL
CTLCardinality COL
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

Unfolding complete |P|=9|T|=9|A|=42
Time for unfolding: 0m 0.200sec

Net: PGCD_COL_D2_N100
(NrP: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.823sec


RS generation: 0m12.264sec


-> reachability set: #nodes 49631 (5.0e+04) #states 5,588,167,526 (9)



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

checking: EG [AX [63<=sum(p0_c2, p0_c1, p0_c0)]]
normalized: EG [~ [EX [~ [63<=sum(p0_c2, p0_c1, p0_c0)]]]]

abstracting: (63<=sum(p0_c2, p0_c1, p0_c0))
states: 5,224,040,448 (9)
...
EG iterations: 2
-> the formula is FALSE

FORMULA PGCD-COL-D02N100-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m38.719sec

checking: AX [AF [[~ [AG [sum(p0_c2, p0_c1, p0_c0)<=0]] & AX [~ [65<=sum(p1_c2, p1_c1, p1_c0)]]]]]
normalized: ~ [EX [EG [~ [[~ [EX [65<=sum(p1_c2, p1_c1, p1_c0)]] & E [true U ~ [sum(p0_c2, p0_c1, p0_c0)<=0]]]]]]]

abstracting: (sum(p0_c2, p0_c1, p0_c0)<=0)
states: 0
abstracting: (65<=sum(p1_c2, p1_c1, p1_c0))
states: 5,193,326,530 (9)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA PGCD-COL-D02N100-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 8.396sec

checking: ~ [[~ [AX [EX [EG [sum(p2_c2, p2_c1, p2_c0)<=51]]]] | AG [~ [98<=sum(p2_c2, p2_c1, p2_c0)]]]]
normalized: ~ [[~ [E [true U 98<=sum(p2_c2, p2_c1, p2_c0)]] | EX [~ [EX [EG [sum(p2_c2, p2_c1, p2_c0)<=51]]]]]]

abstracting: (sum(p2_c2, p2_c1, p2_c0)<=51)
states: 219,997,922 (8)
.
EG iterations: 1
..abstracting: (98<=sum(p2_c2, p2_c1, p2_c0))
states: 4,495,440,768 (9)
-> the formula is TRUE

FORMULA PGCD-COL-D02N100-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m23.806sec

checking: E [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) U sum(p0_c2, p0_c1, p0_c0)<=31]
normalized: E [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0) U sum(p0_c2, p0_c1, p0_c0)<=31]

abstracting: (sum(p0_c2, p0_c1, p0_c0)<=31)
states: 59,121,526 (7)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
MC time: 4m12.014sec

checking: AG [[~ [EX [sum(p2_c2, p2_c1, p2_c0)<=16]] | AX [~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]]
normalized: ~ [E [true U ~ [[~ [EX [sum(p2_c2, p2_c1, p2_c0)<=16]] | ~ [EX [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]]]]

abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0))
MC time: 3m53.000sec

checking: [~ [EF [sum(p0_c2, p0_c1, p0_c0)<=19]] & AG [[EX [~ [AX [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] | 24<=sum(p2_c2, p2_c1, p2_c0)]]]
normalized: [~ [E [true U ~ [[24<=sum(p2_c2, p2_c1, p2_c0) | EX [EX [~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]] & ~ [E [true U sum(p0_c2, p0_c1, p0_c0)<=19]]]

abstracting: (sum(p0_c2, p0_c1, p0_c0)<=19)
states: 16,160,514 (7)
MC time: 3m36.299sec

checking: ~ [A [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0) U AG [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]
normalized: ~ [[~ [EG [E [true U ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]] & ~ [E [E [true U ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] U [~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] & E [true U ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]]

abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0))
states: 5,588,167,526 (9)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
MC time: 3m18.000sec

checking: EF [EX [E [[EG [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] & AG [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)]] U 21<=sum(p1_c2, p1_c1, p1_c0)]]]
normalized: E [true U EX [E [[~ [E [true U ~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)]]] & EG [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)]] U 21<=sum(p1_c2, p1_c1, p1_c0)]]]

abstracting: (21<=sum(p1_c2, p1_c1, p1_c0))
states: 5,569,623,319 (9)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0))
MC time: 3m 3.000sec

checking: AX [AF [~ [AF [[E [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0) U sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]]]]
normalized: ~ [EX [EG [~ [EG [~ [[[sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) & sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)] | E [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0) U sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]]]

abstracting: (sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0))
MC time: 2m49.000sec

checking: ~ [[[AF [EG [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)]] & EX [sum(p2_c2, p2_c1, p2_c0)<=98]] | E [~ [[E [sum(p1_c2, p1_c1, p1_c0)<=29 U sum(p0_c2, p0_c1, p0_c0)<=18] | E [sum(p1_c2, p1_c1, p1_c0)<=69 U sum(p0_c2, p0_c1, p0_c0)<=37]]] U sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]
normalized: ~ [[E [~ [[E [sum(p1_c2, p1_c1, p1_c0)<=69 U sum(p0_c2, p0_c1, p0_c0)<=37] | E [sum(p1_c2, p1_c1, p1_c0)<=29 U sum(p0_c2, p0_c1, p0_c0)<=18]]] U sum(p2_c2, p2_c1, p2_c0)<=sum(p2_c2, p2_c1, p2_c0)] | [EX [sum(p2_c2, p2_c1, p2_c0)<=98] & ~ [EG [~ [EG [sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]]]]]

abstracting: (sum(p0_c2, p0_c1, p0_c0)<=sum(p2_c2, p2_c1, p2_c0))
MC time: 2m36.000sec

checking: AX [[~ [EX [[sum(p0_c2, p0_c1, p0_c0)<=2 | [[sum(p0_c2, p0_c1, p0_c0)<=41 | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | ~ [sum(p0_c2, p0_c1, p0_c0)<=44]]]]] & ~ [[~ [EX [[sum(p2_c2, p2_c1, p2_c0)<=31 | sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]]] | AF [AG [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [E [true U ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]] | ~ [EX [[sum(p2_c2, p2_c1, p2_c0)<=31 | sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)]]]]] & ~ [EX [[sum(p0_c2, p0_c1, p0_c0)<=2 | [~ [sum(p0_c2, p0_c1, p0_c0)<=44] | [sum(p0_c2, p0_c1, p0_c0)<=41 | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]]]]

abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
MC time: 2m24.003sec

checking: A [AX [[EG [~ [sum(p1_c2, p1_c1, p1_c0)<=29]] & AG [~ [[sum(p0_c2, p0_c1, p0_c0)<=7 | 67<=sum(p0_c2, p0_c1, p0_c0)]]]]] U ~ [EX [[~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 94<=sum(p2_c2, p2_c1, p2_c0)] | 41<=sum(p0_c2, p0_c1, p0_c0)]] | EG [[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]]]]
normalized: [~ [EG [EX [[EG [[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [[41<=sum(p0_c2, p0_c1, p0_c0) | [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 94<=sum(p2_c2, p2_c1, p2_c0)]]]]]]] & ~ [E [EX [[EG [[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [[41<=sum(p0_c2, p0_c1, p0_c0) | [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 94<=sum(p2_c2, p2_c1, p2_c0)]]]]] U [EX [~ [[~ [E [true U [sum(p0_c2, p0_c1, p0_c0)<=7 | 67<=sum(p0_c2, p0_c1, p0_c0)]]] & EG [~ [sum(p1_c2, p1_c1, p1_c0)<=29]]]]] & EX [[EG [[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]] | ~ [[41<=sum(p0_c2, p0_c1, p0_c0) | [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 94<=sum(p2_c2, p2_c1, p2_c0)]]]]]]]]]

abstracting: (94<=sum(p2_c2, p2_c1, p2_c0))
states: 4,598,162,128 (9)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0))
states: 5,588,167,526 (9)
abstracting: (41<=sum(p0_c2, p0_c1, p0_c0))
states: 5,471,922,610 (9)
abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0))
MC time: 2m13.000sec

checking: [~ [[AG [E [10<=sum(p2_c2, p2_c1, p2_c0) U [AX [42<=sum(p2_c2, p2_c1, p2_c0)] | [sum(p0_c2, p0_c1, p0_c0)<=81 & sum(p1_c2, p1_c1, p1_c0)<=72]]]] & AG [~ [[EG [sum(p0_c2, p0_c1, p0_c0)<=51] | 69<=sum(p1_c2, p1_c1, p1_c0)]]]]] | AG [[[[29<=sum(p1_c2, p1_c1, p1_c0) | [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p0_c2, p0_c1, p0_c0)<=46]] & sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0)] & ~ [sum(p0_c2, p0_c1, p0_c0)<=43]]]]
normalized: [~ [E [true U ~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) & [29<=sum(p1_c2, p1_c1, p1_c0) | [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p0_c2, p0_c1, p0_c0)<=46]]] & ~ [sum(p0_c2, p0_c1, p0_c0)<=43]]]]] | ~ [[~ [E [true U [69<=sum(p1_c2, p1_c1, p1_c0) | EG [sum(p0_c2, p0_c1, p0_c0)<=51]]]] & ~ [E [true U ~ [E [10<=sum(p2_c2, p2_c1, p2_c0) U [[sum(p0_c2, p0_c1, p0_c0)<=81 & sum(p1_c2, p1_c1, p1_c0)<=72] | ~ [EX [~ [42<=sum(p2_c2, p2_c1, p2_c0)]]]]]]]]]]]

abstracting: (42<=sum(p2_c2, p2_c1, p2_c0))
states: 5,464,087,552 (9)
.abstracting: (sum(p1_c2, p1_c1, p1_c0)<=72)
states: 531,249,478 (8)
abstracting: (sum(p0_c2, p0_c1, p0_c0)<=81)
states: 710,513,766 (8)
abstracting: (10<=sum(p2_c2, p2_c1, p2_c0))
states: 5,585,780,480 (9)
MC time: 2m 3.439sec

checking: EX [[[[[~ [AF [sum(p1_c2, p1_c1, p1_c0)<=65]] & sum(p2_c2, p2_c1, p2_c0)<=90] | ~ [EF [EX [74<=sum(p1_c2, p1_c1, p1_c0)]]]] | [E [~ [E [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) U sum(p1_c2, p1_c1, p1_c0)<=75]] U [A [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) U sum(p0_c2, p0_c1, p0_c0)<=53] & [82<=sum(p0_c2, p0_c1, p0_c0) & 67<=sum(p1_c2, p1_c1, p1_c0)]]] & E [sum(p1_c2, p1_c1, p1_c0)<=26 U [~ [sum(p0_c2, p0_c1, p0_c0)<=17] | ~ [95<=sum(p0_c2, p0_c1, p0_c0)]]]]] | 70<=sum(p2_c2, p2_c1, p2_c0)]]
normalized: EX [[70<=sum(p2_c2, p2_c1, p2_c0) | [[E [sum(p1_c2, p1_c1, p1_c0)<=26 U [~ [95<=sum(p0_c2, p0_c1, p0_c0)] | ~ [sum(p0_c2, p0_c1, p0_c0)<=17]]] & E [~ [E [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) U sum(p1_c2, p1_c1, p1_c0)<=75]] U [[82<=sum(p0_c2, p0_c1, p0_c0) & 67<=sum(p1_c2, p1_c1, p1_c0)] & [~ [EG [~ [sum(p0_c2, p0_c1, p0_c0)<=53]]] & ~ [E [~ [sum(p0_c2, p0_c1, p0_c0)<=53] U [~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0)] & ~ [sum(p0_c2, p0_c1, p0_c0)<=53]]]]]]]] | [~ [E [true U EX [74<=sum(p1_c2, p1_c1, p1_c0)]]] | [sum(p2_c2, p2_c1, p2_c0)<=90 & EG [~ [sum(p1_c2, p1_c1, p1_c0)<=65]]]]]]]

abstracting: (sum(p1_c2, p1_c1, p1_c0)<=65)
states: 410,690,896 (8)
.
EG iterations: 1
abstracting: (sum(p2_c2, p2_c1, p2_c0)<=90)
states: 916,003,431 (8)
abstracting: (74<=sum(p1_c2, p1_c1, p1_c0))
states: 5,038,331,542 (9)
.MC time: 1m53.199sec

checking: [AG [EF [AG [[E [90<=sum(p2_c2, p2_c1, p2_c0) U sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] & [sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 22<=sum(p1_c2, p1_c1, p1_c0)]]]]] | ~ [E [[~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)] & [EF [sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | EF [[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p1_c2, p1_c1, p1_c0)<=53]]]] U ~ [EX [[A [82<=sum(p0_c2, p0_c1, p0_c0) U sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] | [58<=sum(p0_c2, p0_c1, p0_c0) & 73<=sum(p2_c2, p2_c1, p2_c0)]]]]]]]
normalized: [~ [E [[[E [true U [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) & sum(p1_c2, p1_c1, p1_c0)<=53]] | E [true U sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]] & ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p0_c2, p0_c1, p0_c0)]] U ~ [EX [[[58<=sum(p0_c2, p0_c1, p0_c0) & 73<=sum(p2_c2, p2_c1, p2_c0)] | [~ [EG [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]]] & ~ [E [~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)] U [~ [82<=sum(p0_c2, p0_c1, p0_c0)] & ~ [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0)]]]]]]]]]] | ~ [E [true U ~ [E [true U ~ [E [true U ~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p1_c2, p1_c1, p1_c0) | 22<=sum(p1_c2, p1_c1, p1_c0)] & E [90<=sum(p2_c2, p2_c1, p2_c0) U sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]]]]]]]]

abstracting: (sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0))
MC time: 1m45.000sec

checking: [E [EG [[[AX [83<=sum(p2_c2, p2_c1, p2_c0)] | [~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)] & 7<=sum(p2_c2, p2_c1, p2_c0)]] | AX [EF [sum(p0_c2, p0_c1, p0_c0)<=64]]]] U EG [AF [85<=sum(p1_c2, p1_c1, p1_c0)]]] & A [[[A [EG [73<=sum(p0_c2, p0_c1, p0_c0)] U [EG [sum(p2_c2, p2_c1, p2_c0)<=43] | [sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] | ~ [[[sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p2_c2, p2_c1, p2_c0)<=30] | AX [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]]] | EX [77<=sum(p1_c2, p1_c1, p1_c0)]] U EG [~ [AX [[sum(p0_c2, p0_c1, p0_c0)<=77 & sum(p0_c2, p0_c1, p0_c0)<=56]]]]]]
normalized: [[~ [EG [~ [EG [EX [~ [[sum(p0_c2, p0_c1, p0_c0)<=77 & sum(p0_c2, p0_c1, p0_c0)<=56]]]]]]] & ~ [E [~ [EG [EX [~ [[sum(p0_c2, p0_c1, p0_c0)<=77 & sum(p0_c2, p0_c1, p0_c0)<=56]]]]] U [~ [[EX [77<=sum(p1_c2, p1_c1, p1_c0)] | [~ [[~ [EX [~ [sum(p2_c2, p2_c1, p2_c0)<=sum(p0_c2, p0_c1, p0_c0)]]] | [sum(p2_c2, p2_c1, p2_c0)<=sum(p1_c2, p1_c1, p1_c0) | sum(p2_c2, p2_c1, p2_c0)<=30]]] | [~ [EG [~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | EG [sum(p2_c2, p2_c1, p2_c0)<=43]]]]] & ~ [E [~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | EG [sum(p2_c2, p2_c1, p2_c0)<=43]]] U [~ [EG [73<=sum(p0_c2, p0_c1, p0_c0)]] & ~ [[[sum(p1_c2, p1_c1, p1_c0)<=sum(p2_c2, p2_c1, p2_c0) | sum(p1_c2, p1_c1, p1_c0)<=sum(p0_c2, p0_c1, p0_c0)] | EG [sum(p2_c2, p2_c1, p2_c0)<=43]]]]]]]]]] & ~ [EG [EX [~ [[sum(p0_c2, p0_c1, p0_c0)<=77 & sum(p0_c2, p0_c1, p0_c0)<=56]]]]]]]]] & E [EG [[~ [EX [~ [E [true U sum(p0_c2, p0_c1, p0_c0)<=64]]]] | [[7<=sum(p2_c2, p2_c1, p2_c0) & ~ [sum(p0_c2, p0_c1, p0_c0)<=sum(p1_c2, p1_c1, p1_c0)]] | ~ [EX [~ [83<=sum(p2_c2, p2_c1, p2_c0)]]]]]] U EG [~ [EG [~ [85<=sum(p1_c2, p1_c1, p1_c0)]]]]]]

abstracting: (85<=sum(p1_c2, p1_c1, p1_c0))
states: 4,811,937,159 (9)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (83<=sum(p2_c2, p2_c1, p2_c0))
states: 4,856,085,017 (9)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 2811060 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16178640 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:9204 (1022), effective:3130 (347)

initing FirstDep: 0m 0.000sec


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

iterations count:1380 (153), effective:473 (52)

idd.h:1025: Timeout: after 251 sec


idd.h:1025: Timeout: after 232 sec


sat_reach.icc:155: Timeout: after 214 sec


idd.h:1025: Timeout: after 197 sec


idd.h:1025: Timeout: after 182 sec


idd.h:1025: Timeout: after 168 sec


idd.h:1025: Timeout: after 155 sec


idd.h:1025: Timeout: after 143 sec


idd.h:1025: Timeout: after 132 sec


iterations count:524 (58), effective:174 (19)

sat_reach.icc:155: Timeout: after 122 sec


sat_reach.icc:155: Timeout: after 112 sec


idd.h:1025: Timeout: after 104 sec


net_ddint.h:600: Timeout: after 96 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="PGCD-COL-D02N100"
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 PGCD-COL-D02N100, 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 r513-tall-167987241000393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N100.tgz
mv PGCD-COL-D02N100 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 ;