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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.0K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 09:45 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 19K 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-d2n3m1t12-CTLFireability-00
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-01
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-02
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-03
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-04
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-05
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-06
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-07
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-08
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-09
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-10
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-11
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-12
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-13
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-14
FORMULA_NAME NeighborGrid-PT-d2n3m1t12-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678785735694

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-d2n3m1t12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-14 09:22:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 09:22:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:22:18] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-14 09:22:18] [INFO ] Transformed 9 places.
[2023-03-14 09:22:18] [INFO ] Transformed 72 transitions.
[2023-03-14 09:22:18] [INFO ] Parsed PT model containing 9 places and 72 transitions and 144 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Initial state reduction rules removed 3 formulas.
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 15 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
// Phase 1: matrix 72 rows 9 cols
[2023-03-14 09:22:18] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-14 09:22:18] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-14 09:22:18] [INFO ] Invariant cache hit.
[2023-03-14 09:22:18] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-14 09:22:18] [INFO ] Invariant cache hit.
[2023-03-14 09:22:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 385 ms. Remains : 9/9 places, 72/72 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 30 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 10 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Finished random walk after 25 steps, including 0 resets, run visited all 15 properties in 13 ms. (steps per millisecond=1 )
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 8 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 7 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 56 edges and 9 vertex of which 8 / 9 are part of one of the 1 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Applied a total of 1 rules in 10 ms. Remains 2 /9 variables (removed 7) and now considering 3/72 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 2/9 places, 3/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 4 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 30 edges and 9 vertex of which 6 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Applied a total of 1 rules in 2 ms. Remains 4 /9 variables (removed 5) and now considering 13/72 (removed 59) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 4/9 places, 13/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 20 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Applied a total of 1 rules in 2 ms. Remains 5 /9 variables (removed 4) and now considering 21/72 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 5/9 places, 21/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 2 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 1 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 72/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 5 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 72/72 transitions.
Graph (trivial) has 56 edges and 9 vertex of which 8 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /9 variables (removed 7) and now considering 3/72 (removed 69) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/9 places, 3/72 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 0 ms
[2023-03-14 09:22:19] [INFO ] Input system was already deterministic with 3 transitions.
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:22:19] [INFO ] Flatten gal took : 6 ms
[2023-03-14 09:22:19] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-14 09:22:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 72 transitions and 144 arcs took 1 ms.
Total runtime 1452 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: 9 NrTr: 72 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.426sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 81 (8.1e+01) #states 24,310 (4)



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

checking: EF [AG [1<=p5]]
normalized: E [true U ~ [E [true U ~ [1<=p5]]]]

abstracting: (1<=p5)
states: 12,870 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [1<=p6]
normalized: EX [1<=p6]

abstracting: (1<=p6)
states: 12,870 (4)
.-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [1<=p8]
normalized: EG [1<=p8]

abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [AX [[AX [EF [1<=p2]] | AG [EX [1<=p8]]]]]
normalized: E [true U ~ [EX [~ [[~ [EX [~ [E [true U 1<=p2]]]] | ~ [E [true U ~ [EX [1<=p8]]]]]]]]]

abstracting: (1<=p8)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
..-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[1<=p8 & EG [A [AG [1<=p6] U p3<=0]]]]
normalized: ~ [EG [~ [[EG [[~ [EG [~ [p3<=0]]] & ~ [E [~ [p3<=0] U [E [true U ~ [1<=p6]] & ~ [p3<=0]]]]]] & 1<=p8]]]]

abstracting: (1<=p8)
states: 12,870 (4)
abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (p3<=0)
states: 11,440 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

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

abstracting: (1<=p1)
states: 12,870 (4)
.abstracting: (1<=p1)
states: 12,870 (4)
.abstracting: (p2<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 12,870 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AF [AG [E [[~ [[1<=p7 | 1<=p2]] | EF [1<=p5]] U ~ [EX [1<=p5]]]]]
normalized: ~ [EG [E [true U ~ [E [[E [true U 1<=p5] | ~ [[1<=p7 | 1<=p2]]] U ~ [EX [1<=p5]]]]]]]

abstracting: (1<=p5)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [EF [[EF [1<=p7] & ~ [E [A [1<=p6 U 1<=p1] U 1<=p2]]]]]
normalized: ~ [E [true U ~ [E [true U [E [true U 1<=p7] & ~ [E [[~ [E [~ [1<=p1] U [~ [1<=p6] & ~ [1<=p1]]]] & ~ [EG [~ [1<=p1]]]] U 1<=p2]]]]]]]

abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
-> the formula is TRUE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [E [[EG [EF [1<=p2]] & [EG [1<=p0] & 1<=p4]] U ~ [[EX [AG [1<=p4]] & EX [EG [1<=p8]]]]] U AX [[1<=p3 & AX [EG [1<=p3]]]]]
normalized: E [E [[[EG [1<=p0] & 1<=p4] & EG [E [true U 1<=p2]]] U ~ [[EX [EG [1<=p8]] & EX [~ [E [true U ~ [1<=p4]]]]]]] U ~ [EX [~ [[~ [EX [~ [EG [1<=p3]]]] & 1<=p3]]]]]

abstracting: (1<=p3)
states: 12,870 (4)
abstracting: (1<=p3)
states: 12,870 (4)
.
EG iterations: 1
..abstracting: (1<=p4)
states: 12,870 (4)
.abstracting: (1<=p8)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (1<=p2)
states: 12,870 (4)

EG iterations: 0
abstracting: (1<=p4)
states: 12,870 (4)
abstracting: (1<=p0)
states: 12,870 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: AX [AG [[[p3<=0 | EX [1<=p8]] | [A [1<=p0 U p2<=0] | [AX [AF [1<=p1]] & [1<=p2 & 1<=p5]]]]]]
normalized: ~ [EX [E [true U ~ [[[[~ [EG [~ [p2<=0]]] & ~ [E [~ [p2<=0] U [~ [1<=p0] & ~ [p2<=0]]]]] | [~ [EX [EG [~ [1<=p1]]]] & [1<=p2 & 1<=p5]]] | [EX [1<=p8] | p3<=0]]]]]]

abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (1<=p8)
states: 12,870 (4)
.abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
.abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (1<=p0)
states: 12,870 (4)
abstracting: (p2<=0)
states: 11,440 (4)
abstracting: (p2<=0)
states: 11,440 (4)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: AF [E [AX [[~ [EG [1<=p6]] | [p7<=0 | A [1<=p5 U 1<=p1]]]] U ~ [[EX [1<=p2] | E [1<=p5 U 1<=p2]]]]]
normalized: ~ [EG [~ [E [~ [EX [~ [[[[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p5] & ~ [1<=p1]]]]] | p7<=0] | ~ [EG [1<=p6]]]]]] U ~ [[E [1<=p5 U 1<=p2] | EX [1<=p2]]]]]]]

abstracting: (1<=p2)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (p7<=0)
states: 11,440 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)
.
EG iterations: 1
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: AG [[EF [[AX [1<=p6] | [1<=p1 & ~ [E [1<=p4 U 1<=p6]]]]] & [EX [p5<=0] | [EG [[p8<=0 | p3<=0]] | EF [AX [p6<=0]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[~ [E [1<=p4 U 1<=p6]] & 1<=p1] | ~ [EX [~ [1<=p6]]]]] & [[E [true U ~ [EX [~ [p6<=0]]]] | EG [[p8<=0 | p3<=0]]] | EX [p5<=0]]]]]]

abstracting: (p5<=0)
states: 11,440 (4)
.abstracting: (p3<=0)
states: 11,440 (4)
abstracting: (p8<=0)
states: 11,440 (4)
.
EG iterations: 1
abstracting: (p6<=0)
states: 11,440 (4)
.abstracting: (1<=p6)
states: 12,870 (4)
.abstracting: (1<=p1)
states: 12,870 (4)
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
-> the formula is FALSE

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: ~ [A [[1<=p7 | [1<=p5 | EG [1<=p7]]] U [AX [[AF [1<=p4] | [1<=p4 & 1<=p6]]] & EG [[EX [1<=p6] | [1<=p1 | 1<=p2]]]]]]
normalized: ~ [[~ [EG [~ [[EG [[[1<=p1 | 1<=p2] | EX [1<=p6]]] & ~ [EX [~ [[[1<=p4 & 1<=p6] | ~ [EG [~ [1<=p4]]]]]]]]]]] & ~ [E [~ [[EG [[[1<=p1 | 1<=p2] | EX [1<=p6]]] & ~ [EX [~ [[[1<=p4 & 1<=p6] | ~ [EG [~ [1<=p4]]]]]]]]] U [~ [[[EG [1<=p7] | 1<=p5] | 1<=p7]] & ~ [[EG [[[1<=p1 | 1<=p2] | EX [1<=p6]]] & ~ [EX [~ [[[1<=p4 & 1<=p6] | ~ [EG [~ [1<=p4]]]]]]]]]]]]]]

abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.abstracting: (1<=p6)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)

EG iterations: 0
abstracting: (1<=p7)
states: 12,870 (4)
abstracting: (1<=p5)
states: 12,870 (4)
abstracting: (1<=p7)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.abstracting: (1<=p6)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)

EG iterations: 0
abstracting: (1<=p4)
states: 12,870 (4)
.
EG iterations: 1
abstracting: (1<=p6)
states: 12,870 (4)
abstracting: (1<=p4)
states: 12,870 (4)
.abstracting: (1<=p6)
states: 12,870 (4)
.abstracting: (1<=p2)
states: 12,870 (4)
abstracting: (1<=p1)
states: 12,870 (4)

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

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

MC time: 0m 0.009sec

totally nodes used: 9831 (9.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 432287 119916 552203
used/not used/entry size/cache size: 124756 66984108 16 1024MB
basic ops cache: hits/miss/sum: 40488 9168 49656
used/not used/entry size/cache size: 16426 16760790 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: 2310 564 2874
used/not used/entry size/cache size: 564 8388044 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 67099530
1 9078
2 142
3 56
4 14
5 28
6 8
7 7
8 1
9 0
>= 10 0

Total processing time: 0m 5.123sec


BK_STOP 1678785745867

--------------------
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 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:1720 (23), effective:72 (1)

initing FirstDep: 0m 0.000sec


iterations count:261 (3), effective:9 (0)

iterations count:249 (3), effective:8 (0)

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

iterations count:351 (4), effective:9 (0)

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

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

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

iterations count:249 (3), effective:8 (0)

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

iterations count:351 (4), effective:9 (0)

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

iterations count:249 (3), effective:8 (0)

iterations count:108 (1), effective:18 (0)

iterations count:189 (2), effective:9 (0)

iterations count:249 (3), effective:8 (0)

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

iterations count:603 (8), effective:24 (0)

iterations count:88 (1), effective:8 (0)

iterations count:141 (1), effective:6 (0)

iterations count:261 (3), effective:9 (0)

iterations count:177 (2), effective:7 (0)

iterations count:353 (4), effective:16 (0)

iterations count:780 (10), effective:32 (0)

iterations count:648 (9), effective:18 (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-d2n3m1t12"
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-d2n3m1t12, 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-167863540400082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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