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-167863540400090.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540400090
=====================================================================

--------------------
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-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d3n3m1t11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678785858204

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=CTLFireability
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:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 09:24:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:24:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-14 09:24:21] [INFO ] Transformed 27 places.
[2023-03-14 09:24:21] [INFO ] Transformed 162 transitions.
[2023-03-14 09:24:21] [INFO ] Parsed PT model containing 27 places and 162 transitions and 324 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
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 16 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:21] [INFO ] Computed 1 place invariants in 12 ms
[2023-03-14 09:24:21] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 09:24:21] [INFO ] Invariant cache hit.
[2023-03-14 09:24:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-14 09:24:21] [INFO ] Invariant cache hit.
[2023-03-14 09:24:21] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 756 ms. Remains : 27/27 places, 162/162 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 44 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 18 ms
[2023-03-14 09:24:22] [INFO ] Input system was already deterministic with 162 transitions.
Finished random walk after 337 steps, including 0 resets, run visited all 42 properties in 43 ms. (steps per millisecond=7 )
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 13 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 12 ms
[2023-03-14 09:24:22] [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 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:22] [INFO ] Flatten gal took : 9 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:24:22] [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 90 edges and 27 vertex of which 20 / 27 are part of one of the 1 SCC in 3 ms
Free SCC test removed 19 places
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Applied a total of 1 rules in 10 ms. Remains 8 /27 variables (removed 19) and now considering 27/162 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 8/27 places, 27/162 transitions.
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:24:22] [INFO ] Input system was already deterministic with 27 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:22] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [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:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [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 96 edges and 27 vertex of which 21 / 27 are part of one of the 1 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Applied a total of 1 rules in 3 ms. Remains 7 /27 variables (removed 20) and now considering 19/162 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 7/27 places, 19/162 transitions.
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:24:22] [INFO ] Input system was already deterministic with 19 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:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [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 138 edges and 27 vertex of which 25 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Applied a total of 1 rules in 2 ms. Remains 3 /27 variables (removed 24) and now considering 5/162 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 3/27 places, 5/162 transitions.
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:24:22] [INFO ] Input system was already deterministic with 5 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:22] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:22] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [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:23] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [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:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:24:23] [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 128 edges and 27 vertex of which 24 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Applied a total of 1 rules in 2 ms. Remains 4 /27 variables (removed 23) and now considering 9/162 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/27 places, 9/162 transitions.
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:24:23] [INFO ] Input system was already deterministic with 9 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 1 ms. Remains : 27/27 places, 162/162 transitions.
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:24:23] [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 110 edges and 27 vertex of which 22 / 27 are part of one of the 1 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Applied a total of 1 rules in 2 ms. Remains 6 /27 variables (removed 21) and now considering 19/162 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/27 places, 19/162 transitions.
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:24:23] [INFO ] Input system was already deterministic with 19 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:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [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:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:24:23] [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:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Input system was already deterministic with 162 transitions.
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:24:23] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-14 09:24:23] [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 2315 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=CTLFireability.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.426sec


RS generation: 0m 0.619sec


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



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

checking: AX [AF [1<=p4]]
normalized: ~ [EX [EG [~ [1<=p4]]]]

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

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.293sec

checking: AX [A [EG [~ [AX [1<=p26]]] U ~ [AG [AF [1<=p12]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [E [true U EG [~ [1<=p12]]]]]] & ~ [E [~ [E [true U EG [~ [1<=p12]]]] U [~ [EG [EX [~ [1<=p26]]]] & ~ [E [true U EG [~ [1<=p12]]]]]]]]]]]

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

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

MC time: 0m 0.535sec

checking: AG [EF [[1<=p0 | 1<=p14]]]
normalized: ~ [E [true U ~ [E [true U [1<=p0 | 1<=p14]]]]]

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

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: EX [AX [AF [[p18<=0 | p5<=0]]]]
normalized: EX [~ [EX [EG [~ [[p18<=0 | p5<=0]]]]]]

abstracting: (p5<=0)
states: 477,551,179,875,952 (14)
abstracting: (p18<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.473sec

checking: AG [[AF [[p9<=0 & p18<=0]] | EF [~ [E [1<=p16 U 1<=p16]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [E [1<=p16 U 1<=p16]]] | ~ [EG [~ [[p9<=0 & p18<=0]]]]]]]]

abstracting: (p18<=0)
states: 477,551,179,875,952 (14)
abstracting: (p9<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 495,918,532,948,104 (14)
abstracting: (1<=p16)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.395sec

checking: AX [E [~ [AG [AX [1<=p16]]] U AG [[~ [[1<=p7 | 1<=p22]] & ~ [EG [1<=p14]]]]]]
normalized: ~ [EX [~ [E [E [true U EX [~ [1<=p16]]] U ~ [E [true U ~ [[~ [EG [1<=p14]] & ~ [[1<=p7 | 1<=p22]]]]]]]]]]

abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (1<=p7)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p16)
states: 495,918,532,948,104 (14)
..-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.273sec

checking: EX [[E [EF [[[1<=p23 | 1<=p9] & 1<=p20]] U p1<=0] & AG [p8<=0]]]
normalized: EX [[~ [E [true U ~ [p8<=0]]] & E [E [true U [1<=p20 & [1<=p23 | 1<=p9]]] U p1<=0]]]

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

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

MC time: 0m 0.572sec

checking: AF [[1<=p10 & AG [[E [1<=p22 U [1<=p17 | 1<=p19]] | 1<=p1]]]]
normalized: ~ [EG [~ [[1<=p10 & ~ [E [true U ~ [[1<=p1 | E [1<=p22 U [1<=p17 | 1<=p19]]]]]]]]]]

abstracting: (1<=p19)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)

EG iterations: 0
-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.824sec

checking: E [E [1<=p15 U EF [1<=p6]] U ~ [AG [A [[1<=p22 & 1<=p10] U [1<=p17 | 1<=p12]]]]]
normalized: E [E [1<=p15 U E [true U 1<=p6]] U E [true U ~ [[~ [EG [~ [[1<=p17 | 1<=p12]]]] & ~ [E [~ [[1<=p17 | 1<=p12]] U [~ [[1<=p22 & 1<=p10]] & ~ [[1<=p17 | 1<=p12]]]]]]]]]

abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

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

MC time: 0m 0.719sec

checking: E [[EF [[A [[1<=p22 & 1<=p3] U p21<=0] & 1<=p23]] | ~ [AX [p23<=0]]] U ~ [[EX [1<=p10] | 1<=p6]]]
normalized: E [[EX [~ [p23<=0]] | E [true U [1<=p23 & [~ [EG [~ [p21<=0]]] & ~ [E [~ [p21<=0] U [~ [[1<=p22 & 1<=p3]] & ~ [p21<=0]]]]]]]] U ~ [[1<=p6 | EX [1<=p10]]]]

abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
.abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (p21<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p3)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (p21<=0)
states: 477,551,179,875,952 (14)
abstracting: (p21<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (p23<=0)
states: 477,551,179,875,952 (14)
.-> the formula is TRUE

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

MC time: 0m 1.938sec

checking: AX [[~ [E [1<=p4 U ~ [[AF [1<=p13] | [1<=p18 | 1<=p2]]]]] | EX [~ [E [1<=p13 U [1<=p6 & 1<=p21]]]]]]
normalized: ~ [EX [~ [[EX [~ [E [1<=p13 U [1<=p6 & 1<=p21]]]] | ~ [E [1<=p4 U ~ [[[1<=p18 | 1<=p2] | ~ [EG [~ [1<=p13]]]]]]]]]]]

abstracting: (1<=p13)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p18)
states: 495,918,532,948,104 (14)
abstracting: (1<=p4)
states: 495,918,532,948,104 (14)
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (1<=p13)
states: 495,918,532,948,104 (14)
..-> the formula is FALSE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.999sec

checking: AF [[E [A [[p16<=0 & AG [1<=p1]] U [[1<=p14 | 1<=p17] & [1<=p15 & 1<=p20]]] U EG [p12<=0]] & 1<=p14]]
normalized: ~ [EG [~ [[1<=p14 & E [[~ [EG [~ [[[1<=p15 & 1<=p20] & [1<=p14 | 1<=p17]]]]] & ~ [E [~ [[[1<=p15 & 1<=p20] & [1<=p14 | 1<=p17]]] U [~ [[p16<=0 & ~ [E [true U ~ [1<=p1]]]]] & ~ [[[1<=p15 & 1<=p20] & [1<=p14 | 1<=p17]]]]]]] U EG [p12<=0]]]]]]

abstracting: (p12<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p20)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (p16<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p20)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p20)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.598sec

checking: EF [[[1<=p11 & [p23<=0 | [1<=p24 & p9<=0]]] & [[AX [1<=p6] | [EG [p18<=0] & 1<=p0]] & [AX [~ [A [1<=p16 U 1<=p6]]] | 1<=p3]]]]
normalized: E [true U [[[1<=p3 | ~ [EX [[~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [~ [1<=p16] & ~ [1<=p6]]]]]]]] & [[1<=p0 & EG [p18<=0]] | ~ [EX [~ [1<=p6]]]]] & [1<=p11 & [p23<=0 | [1<=p24 & p9<=0]]]]]

abstracting: (p9<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p24)
states: 495,918,532,948,104 (14)
abstracting: (p23<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p11)
states: 495,918,532,948,104 (14)
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
.abstracting: (p18<=0)
states: 477,551,179,875,952 (14)
.
EG iterations: 1
abstracting: (1<=p0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (1<=p16)
states: 495,918,532,948,104 (14)
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
abstracting: (1<=p6)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
.abstracting: (1<=p3)
states: 495,918,532,948,104 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.039sec

checking: ~ [A [EG [~ [E [AG [1<=p3] U E [1<=p25 U 1<=p13]]]] U [AF [[AG [1<=p12] & [1<=p14 & EG [1<=p22]]]] | A [[~ [EF [1<=p21]] | [p0<=0 & AX [1<=p1]]] U AG [EF [1<=p1]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [EG [E [true U ~ [E [true U 1<=p1]]]]] & ~ [E [E [true U ~ [E [true U 1<=p1]]] U [~ [[[p0<=0 & ~ [EX [~ [1<=p1]]]] | ~ [E [true U 1<=p21]]]] & E [true U ~ [E [true U 1<=p1]]]]]]] | ~ [EG [~ [[[1<=p14 & EG [1<=p22]] & ~ [E [true U ~ [1<=p12]]]]]]]]]]] & ~ [E [~ [[[~ [EG [E [true U ~ [E [true U 1<=p1]]]]] & ~ [E [E [true U ~ [E [true U 1<=p1]]] U [~ [[[p0<=0 & ~ [EX [~ [1<=p1]]]] | ~ [E [true U 1<=p21]]]] & E [true U ~ [E [true U 1<=p1]]]]]]] | ~ [EG [~ [[[1<=p14 & EG [1<=p22]] & ~ [E [true U ~ [1<=p12]]]]]]]]] U [~ [EG [~ [E [~ [E [true U ~ [1<=p3]]] U E [1<=p25 U 1<=p13]]]]] & ~ [[[~ [EG [E [true U ~ [E [true U 1<=p1]]]]] & ~ [E [E [true U ~ [E [true U 1<=p1]]] U [~ [[[p0<=0 & ~ [EX [~ [1<=p1]]]] | ~ [E [true U 1<=p21]]]] & E [true U ~ [E [true U 1<=p1]]]]]]] | ~ [EG [~ [[[1<=p14 & EG [1<=p22]] & ~ [E [true U ~ [1<=p12]]]]]]]]]]]]]]

abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)

EG iterations: 0
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.abstracting: (p0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p13)
states: 495,918,532,948,104 (14)
abstracting: (1<=p25)
states: 495,918,532,948,104 (14)
abstracting: (1<=p3)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)

EG iterations: 0
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p21)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.abstracting: (p0<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p12)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)

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

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

MC time: 0m 0.522sec

checking: AX [[AF [EG [1<=p1]] | [[[EX [[[1<=p24 & 1<=p10] | EG [1<=p8]]] & [EX [1<=p20] & A [1<=p26 U 1<=p14]]] & [1<=p9 & [1<=p22 & 1<=p15]]] | [1<=p19 & AX [AX [1<=p19]]]]]]
normalized: ~ [EX [~ [[[[1<=p19 & ~ [EX [EX [~ [1<=p19]]]]] | [[1<=p9 & [1<=p22 & 1<=p15]] & [[[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [1<=p26] & ~ [1<=p14]]]]] & EX [1<=p20]] & EX [[EG [1<=p8] | [1<=p24 & 1<=p10]]]]]] | ~ [EG [~ [EG [1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p10)
states: 495,918,532,948,104 (14)
abstracting: (1<=p24)
states: 495,918,532,948,104 (14)
abstracting: (1<=p8)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
.abstracting: (1<=p20)
states: 495,918,532,948,104 (14)
.abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p26)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p22)
states: 495,918,532,948,104 (14)
abstracting: (1<=p9)
states: 495,918,532,948,104 (14)
abstracting: (1<=p19)
states: 495,918,532,948,104 (14)
..abstracting: (1<=p19)
states: 495,918,532,948,104 (14)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.073sec

checking: [EX [[p12<=0 & [[[p15<=0 & p1<=0] | ~ [A [1<=p17 U 1<=p25]]] | [EF [p25<=0] | ~ [A [AG [1<=p2] U [1<=p23 | 1<=p14]]]]]]] & [EF [~ [E [p1<=0 U ~ [[1<=p2 & 1<=p0]]]]] | EX [~ [A [[1<=p11 & p17<=0] U [[1<=p1 | 1<=p23] & 1<=p15]]]]]]
normalized: [[E [true U ~ [E [p1<=0 U ~ [[1<=p2 & 1<=p0]]]]] | EX [~ [[~ [EG [~ [[1<=p15 & [1<=p1 | 1<=p23]]]]] & ~ [E [~ [[1<=p15 & [1<=p1 | 1<=p23]]] U [~ [[1<=p11 & p17<=0]] & ~ [[1<=p15 & [1<=p1 | 1<=p23]]]]]]]]]] & EX [[p12<=0 & [[~ [[~ [EG [~ [[1<=p23 | 1<=p14]]]] & ~ [E [~ [[1<=p23 | 1<=p14]] U [E [true U ~ [1<=p2]] & ~ [[1<=p23 | 1<=p14]]]]]]] | E [true U p25<=0]] | [~ [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [1<=p17] & ~ [1<=p25]]]]]] | [p15<=0 & p1<=0]]]]]]

abstracting: (p1<=0)
states: 477,551,179,875,952 (14)
abstracting: (p15<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p25)
states: 495,918,532,948,104 (14)
abstracting: (1<=p17)
states: 495,918,532,948,104 (14)
abstracting: (1<=p25)
states: 495,918,532,948,104 (14)
abstracting: (1<=p25)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p25<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p2)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p14)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
abstracting: (p12<=0)
states: 477,551,179,875,952 (14)
.abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (p17<=0)
states: 477,551,179,875,952 (14)
abstracting: (1<=p11)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
abstracting: (1<=p23)
states: 495,918,532,948,104 (14)
abstracting: (1<=p1)
states: 495,918,532,948,104 (14)
abstracting: (1<=p15)
states: 495,918,532,948,104 (14)
.
EG iterations: 1
.abstracting: (1<=p0)
states: 495,918,532,948,104 (14)
abstracting: (1<=p2)
states: 495,918,532,948,104 (14)
abstracting: (p1<=0)
states: 477,551,179,875,952 (14)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d3n3m1t11-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.518sec

totally nodes used: 832436 (8.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 166086133 12717969 178804102
used/not used/entry size/cache size: 12064166 55044698 16 1024MB
basic ops cache: hits/miss/sum: 8743188 619793 9362981
used/not used/entry size/cache size: 1097622 15679594 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: 184322 14158 198480
used/not used/entry size/cache size: 14153 8374455 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 66294003
1 799340
2 14753
3 544
4 45
5 76
6 26
7 4
8 4
9 4
>= 10 65

Total processing time: 0m19.850sec


BK_STOP 1678785884119

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:1323 (8), effective:27 (0)

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

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

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

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

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

iterations count:1478 (9), effective:24 (0)

iterations count:1488 (9), effective:26 (0)

iterations count:2990 (18), effective:51 (0)

iterations count:189 (1), effective:27 (0)

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

iterations count:1095 (6), effective:22 (0)

iterations count:7074 (43), effective:108 (0)

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

iterations count:2754 (17), effective:54 (0)

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

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

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

iterations count:337 (2), effective:25 (0)

iterations count:4311 (26), effective:52 (0)

iterations count:9018 (55), effective:216 (1)

iterations count:3776 (23), effective:78 (0)

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

iterations count:189 (1), effective:27 (0)

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

iterations count:1194 (7), effective:24 (0)

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

iterations count:8658 (53), effective:147 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:3483 (21), effective:27 (0)

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

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

iterations count:243 (1), effective:27 (0)

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

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

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

iterations count:4568 (28), effective:78 (0)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d3n3m1t11"
export BK_EXAMINATION="CTLFireability"
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 CTLFireability"
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-167863540400090"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;