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.r266-smll-167863540400089.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 marciexred
Input is NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540400089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.4K Feb 26 09:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 09:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Feb 26 09:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 46K 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 NeighborGrid-PT-d3n3m1t11-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678785841508

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d3n3m1t11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:24:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 09:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:24:05] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-14 09:24:05] [INFO ] Transformed 27 places.
[2023-03-14 09:24:05] [INFO ] Transformed 162 transitions.
[2023-03-14 09:24:05] [INFO ] Parsed PT model containing 27 places and 162 transitions and 324 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Initial state reduction rules removed 2 formulas.
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 23 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 27 cols
[2023-03-14 09:24:05] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-14 09:24:05] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-14 09:24:05] [INFO ] Invariant cache hit.
[2023-03-14 09:24:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-14 09:24:05] [INFO ] Invariant cache hit.
[2023-03-14 09:24:05] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 27/27 places, 162/162 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 45 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 23 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 8035 steps, including 2 resets, run visited all 70 properties in 171 ms. (steps per millisecond=46 )
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 14 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 16 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:06] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:06] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 36 edges and 27 vertex of which 13 / 27 are part of one of the 1 SCC in 5 ms
Free SCC test removed 12 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Applied a total of 1 rules in 19 ms. Remains 15 /27 variables (removed 12) and now considering 71/162 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 15/27 places, 71/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Graph (trivial) has 118 edges and 27 vertex of which 23 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Applied a total of 1 rules in 3 ms. Remains 5 /27 variables (removed 22) and now considering 13/162 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 5/27 places, 13/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:07] [INFO ] Input system was already deterministic with 162 transitions.
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:07] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:24:07] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-14 09:24:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 162 transitions and 324 arcs took 2 ms.
Total runtime 2489 ms.
There are residual formulas that ITS could not solve within timeout
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 27 NrTr: 162 NrArc: 324)

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

net check time: 0m 0.000sec

init dd package: 0m 3.621sec


RS generation: 0m 0.607sec


-> reachability set: #nodes 729 (7.3e+02) #states 973,469,712,824,056 (14)



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

checking: AX [AF [[EX [AF [1<=p0]] | 1<=p23]]]
normalized: ~ [EX [EG [~ [[EX [~ [EG [~ [1<=p0]]]] | 1<=p23]]]]]

abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p0)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
..
EG iterations: 1
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.431sec

checking: ~ [E [p5<=p7 U AX [p3<=p18]]]
normalized: ~ [E [p5<=p7 U ~ [EX [~ [p3<=p18]]]]]

abstracting: (p3<=p18)
states: 643,572,802,900,536 (14)
.abstracting: (p5<=p7)
states: 643,572,802,900,536 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.653sec

checking: EG [EF [[p12<=p14 | ~ [p19<=p18]]]]
normalized: EG [E [true U [p12<=p14 | ~ [p19<=p18]]]]

abstracting: (p19<=p18)
states: 643,572,802,900,536 (14)
abstracting: (p12<=p14)
states: 643,572,802,900,536 (14)

EG iterations: 0
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.450sec

checking: EF [[AX [AG [EX [p25<=0]]] & [1<=p12 | [EG [[A [1<=p24 U 1<=p23] | ~ [1<=p1]]] & 1<=p20]]]]
normalized: E [true U [[1<=p12 | [1<=p20 & EG [[~ [1<=p1] | [~ [EG [~ [1<=p23]]] & ~ [E [~ [1<=p23] U [~ [1<=p24] & ~ [1<=p23]]]]]]]]] & ~ [EX [E [true U ~ [EX [p25<=0]]]]]]]

abstracting: (p25<=0)
states: 477,551,179,875,952 (14)
..abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p24)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p20)
states: 495,918,532,948,104 (14)
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.655sec

checking: AX [AF [[p10<=p13 | [~ [1<=p6] | [EG [~ [p6<=p13]] & [~ [p15<=0] & ~ [1<=p9]]]]]]]
normalized: ~ [EX [EG [~ [[p10<=p13 | [[[~ [1<=p9] & ~ [p15<=0]] & EG [~ [p6<=p13]]] | ~ [1<=p6]]]]]]]

abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (p6<=p13)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
abstracting: (p15<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p9)
states: 495,918,532,948,104 (14)
abstracting: (p10<=p13)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.554sec

checking: EG [[[p11<=1 & A [[EX [p17<=1] & EG [1<=p7]] U AX [1<=p6]]] & [p11<=p14 & [1<=p7 | EX [~ [p8<=0]]]]]]
normalized: EG [[[p11<=p14 & [1<=p7 | EX [~ [p8<=0]]]] & [p11<=1 & [~ [EG [EX [~ [1<=p6]]]] & ~ [E [EX [~ [1<=p6]] U [~ [[EG [1<=p7] & EX [p17<=1]]] & EX [~ [1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
.abstracting: (p17<=1)
states: 725,510,446,350,004 (14)
.abstracting: (1<=p7)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
.abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
..
EG iterations: 1
abstracting: (p11<=1)
states: 725,510,446,350,004 (14)
abstracting: (p8<=0)
states: 477,551,179,875,952 (14)
.abstracting: (1<=p7)
states: 495,918,532,948,104 (14)
abstracting: (p11<=p14)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.883sec

checking: AF [AX [[A [~ [EG [p11<=0]] U 1<=p22] | [E [p10<=1 U p22<=p19] & [p14<=0 & [~ [1<=p14] | p13<=p15]]]]]]
normalized: ~ [EG [EX [~ [[[[p14<=0 & [p13<=p15 | ~ [1<=p14]]] & E [p10<=1 U p22<=p19]] | [~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [EG [p11<=0] & ~ [1<=p22]]]]]]]]]]

abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (p11<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p22<=p19)
states: 643,572,802,900,536 (14)
abstracting: (p10<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (p13<=p15)
states: 643,572,802,900,536 (14)
abstracting: (p14<=0)
states: 477,551,179,875,952 (14)
..
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.631sec

checking: [AX [[~ [A [[AX [p18<=p12] | 1<=p7] U ~ [[p18<=1 & p13<=p2]]]] | AX [[[~ [1<=p10] & ~ [p22<=1]] | AF [~ [p0<=1]]]]]] & EF [[p1<=1 | 1<=p9]]]
normalized: [E [true U [p1<=1 | 1<=p9]] & ~ [EX [~ [[~ [EX [~ [[~ [EG [p0<=1]] | [~ [p22<=1] & ~ [1<=p10]]]]]] | ~ [[~ [EG [[p18<=1 & p13<=p2]]] & ~ [E [[p18<=1 & p13<=p2] U [~ [[1<=p7 | ~ [EX [~ [p18<=p12]]]]] & [p18<=1 & p13<=p2]]]]]]]]]]]

abstracting: (p13<=p2)
states: 643,572,802,900,536 (14)
abstracting: (p18<=1)
states: 725,510,446,350,004 (14)
abstracting: (p18<=p12)
states: 643,572,802,900,536 (14)
.abstracting: (1<=p7)
states: 495,918,532,948,104 (14)
abstracting: (p13<=p2)
states: 643,572,802,900,536 (14)
abstracting: (p18<=1)
states: 725,510,446,350,004 (14)
abstracting: (p13<=p2)
states: 643,572,802,900,536 (14)
abstracting: (p18<=1)
states: 725,510,446,350,004 (14)
.
EG iterations: 1
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (p22<=1)
states: 725,510,446,350,004 (14)
abstracting: (p0<=1)
states: 725,510,446,350,004 (14)
.
EG iterations: 1
..abstracting: (1<=p9)
states: 495,918,532,948,104 (14)
abstracting: (p1<=1)
states: 725,510,446,350,004 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.591sec

checking: E [E [EX [p15<=1] U E [[~ [[p6<=p0 | 1<=p16]] & [~ [p17<=p25] | E [1<=p13 U p2<=1]]] U EF [[p8<=0 | 1<=p19]]]] U ~ [EF [AG [p26<=p2]]]]
normalized: E [E [EX [p15<=1] U E [[[E [1<=p13 U p2<=1] | ~ [p17<=p25]] & ~ [[p6<=p0 | 1<=p16]]] U E [true U [p8<=0 | 1<=p19]]]] U ~ [E [true U ~ [E [true U ~ [p26<=p2]]]]]]

abstracting: (p26<=p2)
states: 643,572,802,900,536 (14)
abstracting: (1<=p19)
states: 495,918,532,948,104 (14)
abstracting: (p8<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p16)
states: 495,918,532,948,104 (14)
abstracting: (p6<=p0)
states: 643,572,802,900,536 (14)
abstracting: (p17<=p25)
states: 643,572,802,900,536 (14)
abstracting: (p2<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p13)
states: 495,918,532,948,104 (14)
abstracting: (p15<=1)
states: 725,510,446,350,004 (14)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.624sec

checking: A [EF [[EX [p7<=p12] & [EG [[1<=p14 | p13<=p16]] | [E [1<=p3 U p1<=0] | EF [1<=p8]]]]] U EG [EF [~ [[[p26<=1 | p7<=1] & p12<=p2]]]]]
normalized: [~ [EG [~ [EG [E [true U ~ [[p12<=p2 & [p26<=1 | p7<=1]]]]]]]] & ~ [E [~ [EG [E [true U ~ [[p12<=p2 & [p26<=1 | p7<=1]]]]]] U [~ [E [true U [[[E [true U 1<=p8] | E [1<=p3 U p1<=0]] | EG [[1<=p14 | p13<=p16]]] & EX [p7<=p12]]]] & ~ [EG [E [true U ~ [[p12<=p2 & [p26<=1 | p7<=1]]]]]]]]]]

abstracting: (p7<=1)
states: 725,510,446,350,004 (14)
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
abstracting: (p12<=p2)
states: 643,572,802,900,536 (14)

EG iterations: 0
abstracting: (p7<=p12)
states: 643,572,802,900,536 (14)
.abstracting: (p13<=p16)
states: 643,572,802,900,536 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p1<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p3)
states: 495,918,532,948,104 (14)
abstracting: (1<=p8)
states: 495,918,532,948,104 (14)
abstracting: (p7<=1)
states: 725,510,446,350,004 (14)
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
abstracting: (p12<=p2)
states: 643,572,802,900,536 (14)

EG iterations: 0
abstracting: (p7<=1)
states: 725,510,446,350,004 (14)
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
abstracting: (p12<=p2)
states: 643,572,802,900,536 (14)

EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.250sec

checking: AX [[[1<=p4 | A [A [AF [p10<=p26] U 1<=p15] U ~ [p26<=1]]] | [EF [EG [AX [p19<=p22]]] | EX [[~ [A [1<=p21 U p3<=p5]] | [[p6<=p0 | 1<=p25] & [p24<=0 | p13<=p11]]]]]]]
normalized: ~ [EX [~ [[[EX [[[[p24<=0 | p13<=p11] & [p6<=p0 | 1<=p25]] | ~ [[~ [EG [~ [p3<=p5]]] & ~ [E [~ [p3<=p5] U [~ [1<=p21] & ~ [p3<=p5]]]]]]]] | E [true U EG [~ [EX [~ [p19<=p22]]]]]] | [1<=p4 | [~ [EG [p26<=1]] & ~ [E [p26<=1 U [p26<=1 & ~ [[~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [EG [~ [p10<=p26]] & ~ [1<=p15]]]]]]]]]]]]]]]

abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (p10<=p26)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
abstracting: (p26<=1)
states: 725,510,446,350,004 (14)
.
EG iterations: 1
abstracting: (1<=p4)
states: 495,918,532,948,104 (14)
abstracting: (p19<=p22)
states: 643,572,802,900,536 (14)
..
EG iterations: 1
abstracting: (p3<=p5)
states: 643,572,802,900,536 (14)
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
abstracting: (p3<=p5)
states: 643,572,802,900,536 (14)
abstracting: (p3<=p5)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
abstracting: (1<=p25)
states: 495,918,532,948,104 (14)
abstracting: (p6<=p0)
states: 643,572,802,900,536 (14)
abstracting: (p13<=p11)
states: 643,572,802,900,536 (14)
abstracting: (p24<=0)
states: 477,551,179,875,952 (14)
..-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.273sec

checking: [AG [EF [[~ [p16<=p18] | [[~ [p11<=0] & ~ [p23<=p5]] | ~ [1<=p9]]]]] & [AF [1<=p15] | [EG [p7<=p10] & [EX [[AF [~ [1<=p4]] & EG [~ [p9<=p5]]]] & ~ [E [A [1<=p12 U p0<=p22] U AF [p4<=0]]]]]]]
normalized: [[[[~ [E [[~ [EG [~ [p0<=p22]]] & ~ [E [~ [p0<=p22] U [~ [1<=p12] & ~ [p0<=p22]]]]] U ~ [EG [~ [p4<=0]]]]] & EX [[EG [~ [p9<=p5]] & ~ [EG [1<=p4]]]]] & EG [p7<=p10]] | ~ [EG [~ [1<=p15]]]] & ~ [E [true U ~ [E [true U [[~ [1<=p9] | [~ [p23<=p5] & ~ [p11<=0]]] | ~ [p16<=p18]]]]]]]

abstracting: (p16<=p18)
states: 643,572,802,900,536 (14)
abstracting: (p11<=0)
states: 477,551,179,875,952 (14)
abstracting: (p23<=p5)
states: 643,572,802,900,536 (14)
abstracting: (1<=p9)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p7<=p10)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
abstracting: (1<=p4)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p9<=p5)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
.abstracting: (p4<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (p0<=p22)
states: 643,572,802,900,536 (14)
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (p0<=p22)
states: 643,572,802,900,536 (14)
abstracting: (p0<=p22)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.772sec

checking: [AG [[AX [[EX [~ [1<=p10]] & [~ [1<=p17] | ~ [p15<=p25]]]] | p7<=p3]] & AX [[[EF [EG [p8<=0]] | EX [A [1<=p11 U p25<=p21]]] & [[p9<=p23 & EF [1<=p26]] | [A [~ [1<=p11] U [p11<=1 & 1<=p10]] | [EF [~ [1<=p21]] & p7<=1]]]]]]
normalized: [~ [EX [~ [[[[[p7<=1 & E [true U ~ [1<=p21]]] | [~ [EG [~ [[p11<=1 & 1<=p10]]]] & ~ [E [~ [[p11<=1 & 1<=p10]] U [1<=p11 & ~ [[p11<=1 & 1<=p10]]]]]]] | [p9<=p23 & E [true U 1<=p26]]] & [EX [[~ [EG [~ [p25<=p21]]] & ~ [E [~ [p25<=p21] U [~ [1<=p11] & ~ [p25<=p21]]]]]] | E [true U EG [p8<=0]]]]]]] & ~ [E [true U ~ [[p7<=p3 | ~ [EX [~ [[[~ [p15<=p25] | ~ [1<=p17]] & EX [~ [1<=p10]]]]]]]]]]]

abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
.abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (p15<=p25)
states: 643,572,802,900,536 (14)
.abstracting: (p7<=p3)
states: 643,572,802,900,536 (14)
abstracting: (p8<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (p25<=p21)
states: 643,572,802,900,536 (14)
abstracting: (1<=p11)
states: 495,918,532,948,104 (14)
abstracting: (p25<=p21)
states: 643,572,802,900,536 (14)
abstracting: (p25<=p21)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
.abstracting: (1<=p26)
states: 495,918,532,948,104 (14)
abstracting: (p9<=p23)
states: 643,572,802,900,536 (14)
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (p11<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p11)
states: 495,918,532,948,104 (14)
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (p11<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (p11<=1)
states: 725,510,446,350,004 (14)
.
EG iterations: 1
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
abstracting: (p7<=1)
states: 725,510,446,350,004 (14)
.-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.707sec

checking: AG [[p7<=1 | [[AF [p20<=p12] & [[E [1<=p23 U p4<=p5] | ~ [1<=p5]] | [~ [p19<=p3] | AF [~ [1<=p21]]]]] | [[~ [p9<=0] & ~ [p2<=p9]] & [EF [p3<=1] & [~ [1<=p26] & [E [p26<=0 U p26<=p2] | [1<=p14 & 1<=p15]]]]]]]]
normalized: ~ [E [true U ~ [[p7<=1 | [[[[[[1<=p14 & 1<=p15] | E [p26<=0 U p26<=p2]] & ~ [1<=p26]] & E [true U p3<=1]] & [~ [p2<=p9] & ~ [p9<=0]]] | [[[~ [EG [1<=p21]] | ~ [p19<=p3]] | [~ [1<=p5] | E [1<=p23 U p4<=p5]]] & ~ [EG [~ [p20<=p12]]]]]]]]]

abstracting: (p20<=p12)
states: 643,572,802,900,536 (14)
.
EG iterations: 1
abstracting: (p4<=p5)
states: 643,572,802,900,536 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p5)
states: 495,918,532,948,104 (14)
abstracting: (p19<=p3)
states: 643,572,802,900,536 (14)
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p9<=0)
states: 477,551,179,875,952 (14)
abstracting: (p2<=p9)
states: 643,572,802,900,536 (14)
abstracting: (p3<=1)
states: 725,510,446,350,004 (14)
abstracting: (1<=p26)
states: 495,918,532,948,104 (14)
abstracting: (p26<=p2)
states: 643,572,802,900,536 (14)
abstracting: (p26<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (p7<=1)
states: 725,510,446,350,004 (14)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.257sec

totally nodes used: 3261110 (3.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 516067973 47047231 563115204
used/not used/entry size/cache size: 35129426 31979438 16 1024MB
basic ops cache: hits/miss/sum: 33816146 2977086 36793232
used/not used/entry size/cache size: 4075667 12701549 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 718975 59722 778697
used/not used/entry size/cache size: 59479 8329129 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64085787
1 2909634
2 96020
3 5387
4 2112
5 1543
6 1401
7 1208
8 1042
9 949
>= 10 3781

Total processing time: 1m 0.011sec


BK_STOP 1678785908615

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
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:40446 (249), effective:702 (4)

initing FirstDep: 0m 0.000sec


iterations count:3331 (20), effective:169 (1)

iterations count:1323 (8), effective:27 (0)

iterations count:3104 (19), effective:52 (0)

iterations count:3267 (20), effective:27 (0)

iterations count:783 (4), effective:27 (0)

iterations count:1269 (7), effective:27 (0)

iterations count:13295 (82), effective:287 (1)

iterations count:2806 (17), effective:72 (0)

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

iterations count:1711 (10), effective:52 (0)

iterations count:891 (5), effective:27 (0)

iterations count:237 (1), effective:25 (0)

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

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

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

iterations count:2148 (13), effective:74 (0)

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

iterations count:1632 (10), effective:26 (0)

iterations count:760 (4), effective:26 (0)

iterations count:2148 (13), effective:74 (0)

iterations count:2148 (13), effective:74 (0)

iterations count:20056 (123), effective:350 (2)

iterations count:1485 (9), effective:27 (0)

iterations count:11740 (72), effective:186 (1)

iterations count:2840 (17), effective:26 (0)

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

iterations count:1280 (7), effective:26 (0)

iterations count:405 (2), effective:27 (0)

iterations count:3461 (21), effective:94 (0)

iterations count:891 (5), effective:27 (0)

iterations count:1228 (7), effective:26 (0)

iterations count:1633 (10), effective:26 (0)

iterations count:1593 (9), effective:25 (0)

iterations count:2943 (18), effective:27 (0)

iterations count:396 (2), effective:26 (0)

iterations count:344 (2), effective:26 (0)

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

iterations count:14436 (89), effective:400 (2)

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="NeighborGrid-PT-d3n3m1t11"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540400089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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