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.r234-tall-167856420000234.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 Kanban-PT-00005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:22 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 Kanban-PT-00005-CTLFireability-00
FORMULA_NAME Kanban-PT-00005-CTLFireability-01
FORMULA_NAME Kanban-PT-00005-CTLFireability-02
FORMULA_NAME Kanban-PT-00005-CTLFireability-03
FORMULA_NAME Kanban-PT-00005-CTLFireability-04
FORMULA_NAME Kanban-PT-00005-CTLFireability-05
FORMULA_NAME Kanban-PT-00005-CTLFireability-06
FORMULA_NAME Kanban-PT-00005-CTLFireability-07
FORMULA_NAME Kanban-PT-00005-CTLFireability-08
FORMULA_NAME Kanban-PT-00005-CTLFireability-09
FORMULA_NAME Kanban-PT-00005-CTLFireability-10
FORMULA_NAME Kanban-PT-00005-CTLFireability-11
FORMULA_NAME Kanban-PT-00005-CTLFireability-12
FORMULA_NAME Kanban-PT-00005-CTLFireability-13
FORMULA_NAME Kanban-PT-00005-CTLFireability-14
FORMULA_NAME Kanban-PT-00005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679466227913

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=Kanban-PT-00005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:23:49] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-22 06:23:49] [INFO ] Transformed 16 places.
[2023-03-22 06:23:49] [INFO ] Transformed 16 transitions.
[2023-03-22 06:23:49] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Kanban-PT-00005-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00005-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00005-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-00005-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 8 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-22 06:23:49] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 06:23:49] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-22 06:23:49] [INFO ] Invariant cache hit.
[2023-03-22 06:23:49] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-22 06:23:49] [INFO ] Invariant cache hit.
[2023-03-22 06:23:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:23:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 15 ms
FORMULA Kanban-PT-00005-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 4 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 947 steps, including 0 resets, run visited all 30 properties in 42 ms. (steps per millisecond=22 )
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 10 ms. Remains 11 /16 variables (removed 5) and now considering 12/16 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 11/16 places, 12/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 15 transition count 15
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 15
Applied a total of 2 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 15/16 places, 15/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 6 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 12 transition count 13
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 12 transition count 13
Applied a total of 3 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 13/16 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 12/16 places, 13/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 14 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 15
Applied a total of 3 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 15/16 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 16
Applied a total of 1 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:23:50] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 06:23:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 40 arcs took 1 ms.
Total runtime 984 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: 16 NrTr: 16 NrArc: 40)

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

net check time: 0m 0.000sec

init dd package: 0m 2.746sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 111 (1.1e+02) #states 2,546,432 (6)



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

checking: AX [[1<=p2 | AF [AG [p11<=0]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [p11<=0]]]] | 1<=p2]]]]

abstracting: (1<=p2)
states: 1,712,256 (6)
abstracting: (p11<=0)
states: 954,912 (5)

EG iterations: 0
.-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EF [EG [[~ [A [1<=p2 U 1<=p11]] & [1<=p11 | 1<=p8]]]]]
normalized: ~ [E [true U ~ [E [true U EG [[~ [[~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [~ [1<=p2] & ~ [1<=p11]]]]]] & [1<=p11 | 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p11)
states: 1,591,520 (6)
abstracting: (1<=p11)
states: 1,591,520 (6)
abstracting: (1<=p2)
states: 1,712,256 (6)
abstracting: (1<=p11)
states: 1,591,520 (6)
abstracting: (1<=p11)
states: 1,591,520 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[EF [[EG [p11<=0] & ~ [A [1<=p5 U 1<=p10]]]] & p8<=0]]
normalized: E [true U [E [true U [~ [[~ [E [~ [1<=p10] U [~ [1<=p5] & ~ [1<=p10]]]] & ~ [EG [~ [1<=p10]]]]] & EG [p11<=0]]] & p8<=0]]

abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (p11<=0)
states: 954,912 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [AF [[EF [[1<=p0 & [1<=p7 & 1<=p13]]] & [1<=p1 & 1<=p5]]] U AX [AF [1<=p8]]]
normalized: E [~ [EG [~ [[E [true U [[1<=p7 & 1<=p13] & 1<=p0]] & [1<=p1 & 1<=p5]]]]] U ~ [EX [EG [~ [1<=p8]]]]]

abstracting: (1<=p8)
states: 1,591,520 (6)
.......
EG iterations: 7
.abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p0)
states: 1,163,456 (6)
abstracting: (1<=p13)
states: 1,163,456 (6)
abstracting: (1<=p7)
states: 1,591,520 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AX [A [~ [E [AF [1<=p12] U p1<=0]] U [~ [AF [[1<=p12 & 1<=p8]]] & [p8<=0 | AF [~ [[1<=p3 & [1<=p9 & 1<=p14]]]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[~ [EG [[[1<=p9 & 1<=p14] & 1<=p3]]] | p8<=0] & EG [~ [[1<=p12 & 1<=p8]]]]]]] & ~ [E [~ [[[~ [EG [[[1<=p9 & 1<=p14] & 1<=p3]]] | p8<=0] & EG [~ [[1<=p12 & 1<=p8]]]]] U [~ [[[~ [EG [[[1<=p9 & 1<=p14] & 1<=p3]]] | p8<=0] & EG [~ [[1<=p12 & 1<=p8]]]]] & E [~ [EG [~ [1<=p12]]] U p1<=0]]]]]]]]

abstracting: (p1<=0)
states: 834,176 (5)
abstracting: (1<=p12)
states: 1,712,256 (6)
.......
EG iterations: 7
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p9)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p9)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p9)
states: 1,591,520 (6)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [[AF [[[p10<=0 & 1<=p5] | 1<=p4]] & 1<=p1] U EX [[A [AG [1<=p6] U [E [1<=p12 U 1<=p8] & [1<=p5 & 1<=p1]]] & EX [1<=p4]]]]
normalized: E [[~ [EG [~ [[[p10<=0 & 1<=p5] | 1<=p4]]]] & 1<=p1] U EX [[EX [1<=p4] & [~ [EG [~ [[[1<=p5 & 1<=p1] & E [1<=p12 U 1<=p8]]]]] & ~ [E [~ [[[1<=p5 & 1<=p1] & E [1<=p12 U 1<=p8]]] U [E [true U ~ [1<=p6]] & ~ [[[1<=p5 & 1<=p1] & E [1<=p12 U 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p6)
states: 1,591,520 (6)
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p4)
states: 1,591,520 (6)
..abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p4)
states: 1,591,520 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (p10<=0)
states: 954,912 (5)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [[[AG [1<=p15] & ~ [E [[1<=p10 & 1<=p8] U EF [1<=p10]]]] & [EG [[[p1<=0 & p10<=0] | [p1<=0 | p15<=0]]] & AG [[p5<=0 & [EX [p12<=0] & p10<=0]]]]]]
normalized: ~ [EG [~ [[[~ [E [true U ~ [[[EX [p12<=0] & p10<=0] & p5<=0]]]] & EG [[[p1<=0 | p15<=0] | [p1<=0 & p10<=0]]]] & [~ [E [[1<=p10 & 1<=p8] U E [true U 1<=p10]]] & ~ [E [true U ~ [1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (p10<=0)
states: 954,912 (5)
abstracting: (p1<=0)
states: 834,176 (5)
abstracting: (p15<=0)
states: 834,176 (5)
abstracting: (p1<=0)
states: 834,176 (5)
.
EG iterations: 1
abstracting: (p5<=0)
states: 954,912 (5)
abstracting: (p10<=0)
states: 954,912 (5)
abstracting: (p12<=0)
states: 834,176 (5)
.
EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [~ [E [EF [[1<=p6 | 1<=p10]] U AX [A [[1<=p1 | 1<=p12] U EG [1<=p15]]]]] & AG [[[p11<=0 | E [EG [1<=p12] U E [1<=p6 U 1<=p1]]] & [AX [1<=p6] & p8<=0]]]]
normalized: [~ [E [true U ~ [[[~ [EX [~ [1<=p6]]] & p8<=0] & [E [EG [1<=p12] U E [1<=p6 U 1<=p1]] | p11<=0]]]]] & ~ [E [E [true U [1<=p6 | 1<=p10]] U ~ [EX [~ [[~ [EG [~ [EG [1<=p15]]]] & ~ [E [~ [EG [1<=p15]] U [~ [[1<=p1 | 1<=p12]] & ~ [EG [1<=p15]]]]]]]]]]]]

abstracting: (1<=p15)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p15)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,712,256 (6)
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p6)
states: 1,591,520 (6)
abstracting: (p11<=0)
states: 954,912 (5)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p6)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (1<=p6)
states: 1,591,520 (6)
.-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[AX [E [~ [[1<=p12 | 1<=p5]] U 1<=p2]] | [[1<=p12 & p5<=0] | [AG [A [1<=p15 U 1<=p1]] & [A [[1<=p10 & 1<=p5] U A [1<=p12 U 1<=p10]] & AX [EG [1<=p5]]]]]]]
normalized: E [true U [[[[~ [EX [~ [EG [1<=p5]]]] & [~ [EG [~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p12] & ~ [1<=p10]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p12] & ~ [1<=p10]]]]]] U [~ [[1<=p10 & 1<=p5]] & ~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [1<=p12] & ~ [1<=p10]]]]]]]]]]] & ~ [E [true U ~ [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p15] & ~ [1<=p1]]]]]]]]] | [1<=p12 & p5<=0]] | ~ [EX [~ [E [~ [[1<=p12 | 1<=p5]] U 1<=p2]]]]]]

abstracting: (1<=p2)
states: 1,712,256 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
.abstracting: (p5<=0)
states: 954,912 (5)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p15)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
.......
EG iterations: 7
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p12)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,591,520 (6)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Kanban-PT-00005-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [[EF [1<=p1] | ~ [AX [AX [1<=p5]]]] U [[~ [[[AX [1<=p11] & [1<=p1 & EG [1<=p2]]] | EF [[1<=p6 & 1<=p10]]]] & p8<=0] & [~ [[1<=p3 & [1<=p9 & 1<=p14]]] & [p10<=0 & AF [[1<=p10 | 1<=p8]]]]]]
normalized: E [[EX [EX [~ [1<=p5]]] | E [true U 1<=p1]] U [[[~ [EG [~ [[1<=p10 | 1<=p8]]]] & p10<=0] & ~ [[[1<=p9 & 1<=p14] & 1<=p3]]] & [~ [[E [true U [1<=p6 & 1<=p10]] | [[EG [1<=p2] & 1<=p1] & ~ [EX [~ [1<=p11]]]]]] & p8<=0]]]

abstracting: (p8<=0)
states: 954,912 (5)
abstracting: (1<=p11)
states: 1,591,520 (6)
.abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p2)
states: 1,712,256 (6)
.
EG iterations: 1
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p6)
states: 1,591,520 (6)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p9)
states: 1,591,520 (6)
abstracting: (p10<=0)
states: 954,912 (5)
abstracting: (1<=p8)
states: 1,591,520 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
..
EG iterations: 2
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p5)
states: 1,591,520 (6)
..-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AF [[A [AF [1<=p10] U 1<=p1] | [~ [E [EG [1<=p4] U ~ [E [1<=p1 U 1<=p15]]]] | [[AX [1<=p5] | [[1<=p3 & 1<=p9] & [1<=p14 & 1<=p1]]] & [1<=p10 | [1<=p3 & [1<=p9 & 1<=p14]]]]]]]
normalized: ~ [EG [~ [[[[[[[1<=p9 & 1<=p14] & 1<=p3] | 1<=p10] & [[[1<=p14 & 1<=p1] & [1<=p3 & 1<=p9]] | ~ [EX [~ [1<=p5]]]]] | ~ [E [EG [1<=p4] U ~ [E [1<=p1 U 1<=p15]]]]] | [~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [EG [~ [1<=p10]] & ~ [1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
.......
EG iterations: 7
abstracting: (1<=p15)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p4)
states: 1,591,520 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,591,520 (6)
.abstracting: (1<=p9)
states: 1,591,520 (6)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p1)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p10)
states: 1,591,520 (6)
abstracting: (1<=p3)
states: 1,712,256 (6)
abstracting: (1<=p14)
states: 1,712,256 (6)
abstracting: (1<=p9)
states: 1,591,520 (6)
............
EG iterations: 12
-> the formula is FALSE

FORMULA Kanban-PT-00005-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 31060 (3.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 101109 68302 169411
used/not used/entry size/cache size: 93789 67015075 16 1024MB
basic ops cache: hits/miss/sum: 47452 33223 80675
used/not used/entry size/cache size: 62132 16715084 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: 1586 1057 2643
used/not used/entry size/cache size: 1057 8387551 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 67079465
1 28437
2 728
3 77
4 62
5 42
6 13
7 7
8 5
9 14
>= 10 14

Total processing time: 0m 4.384sec


BK_STOP 1679466235883

--------------------
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:371 (23), effective:110 (6)

initing FirstDep: 0m 0.000sec


iterations count:53 (3), effective:11 (0)

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

iterations count:70 (4), effective:15 (0)

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

iterations count:41 (2), effective:10 (0)

iterations count:31 (1), effective:5 (0)

iterations count:51 (3), effective:11 (0)

iterations count:122 (7), effective:30 (1)

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

iterations count:24 (1), effective:4 (0)

iterations count:54 (3), effective:11 (0)

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

iterations count:54 (3), effective:11 (0)

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

iterations count:54 (3), effective:11 (0)

iterations count:49 (3), effective:12 (0)

iterations count:31 (1), effective:5 (0)

iterations count:56 (3), effective:11 (0)

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

iterations count:73 (4), effective:21 (1)

iterations count:46 (2), effective:10 (0)

iterations count:51 (3), effective:10 (0)

iterations count:96 (6), effective:25 (1)

iterations count:54 (3), effective:11 (0)

iterations count:49 (3), effective:10 (0)

iterations count:24 (1), effective:4 (0)

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

iterations count:31 (1), effective:5 (0)

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

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

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

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

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

iterations count:101 (6), effective:30 (1)

iterations count:89 (5), effective:22 (1)

iterations count:54 (3), effective:11 (0)

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

iterations count:52 (3), effective:11 (0)

iterations count:41 (2), effective:10 (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="Kanban-PT-00005"
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 Kanban-PT-00005, 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 r234-tall-167856420000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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