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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 11:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 11:57 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:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 11:59 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-00010-CTLFireability-00
FORMULA_NAME Kanban-PT-00010-CTLFireability-01
FORMULA_NAME Kanban-PT-00010-CTLFireability-02
FORMULA_NAME Kanban-PT-00010-CTLFireability-03
FORMULA_NAME Kanban-PT-00010-CTLFireability-04
FORMULA_NAME Kanban-PT-00010-CTLFireability-05
FORMULA_NAME Kanban-PT-00010-CTLFireability-06
FORMULA_NAME Kanban-PT-00010-CTLFireability-07
FORMULA_NAME Kanban-PT-00010-CTLFireability-08
FORMULA_NAME Kanban-PT-00010-CTLFireability-09
FORMULA_NAME Kanban-PT-00010-CTLFireability-10
FORMULA_NAME Kanban-PT-00010-CTLFireability-11
FORMULA_NAME Kanban-PT-00010-CTLFireability-12
FORMULA_NAME Kanban-PT-00010-CTLFireability-13
FORMULA_NAME Kanban-PT-00010-CTLFireability-14
FORMULA_NAME Kanban-PT-00010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679466357897

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-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:25:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:25:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:25:59] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-22 06:25:59] [INFO ] Transformed 16 places.
[2023-03-22 06:25:59] [INFO ] Transformed 16 transitions.
[2023-03-22 06:25:59] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-00010-CTLFireability-15 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:25:59] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-22 06:25:59] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 06:25:59] [INFO ] Invariant cache hit.
[2023-03-22 06:25:59] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-22 06:25:59] [INFO ] Invariant cache hit.
[2023-03-22 06:25:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:26:00] [INFO ] Invariant cache hit.
[2023-03-22 06:26:00] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:26:00] [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 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 12 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 11 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 0 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 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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
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:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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 3 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 3 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [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:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [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 7 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.
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 14 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 13 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 12 transition count 12
Applied a total of 5 rules in 3 ms. Remains 12 /16 variables (removed 4) and now considering 12/16 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 12/16 places, 12/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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
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:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 16/16 places, 16/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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
Applied a total of 1 rules in 0 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 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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 1 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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 10 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 10 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 11 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:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 6 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 12
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 10 transition count 11
Applied a total of 5 rules in 3 ms. Remains 10 /16 variables (removed 6) and now considering 11/16 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 10/16 places, 11/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
FORMULA Kanban-PT-00010-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [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 0 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 0 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:26:00] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:26:00] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 06:26:00] [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 1181 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.791sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 256 (2.6e+02) #states 1,005,927,208 (9)



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

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

abstracting: (1<=p1)
states: 807,081,132 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

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

abstracting: (1<=p2)
states: 807,081,132 (8)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EG [p5<=0]
normalized: EG [p5<=0]

abstracting: (p5<=0)
states: 232,137,048 (8)
............
EG iterations: 12
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [AG [1<=p15]]
normalized: ~ [EX [E [true U ~ [1<=p15]]]]

abstracting: (1<=p15)
states: 807,081,132 (8)
.-> the formula is FALSE

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

MC time: 0m 0.001sec

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

abstracting: (p2<=0)
states: 198,846,076 (8)
abstracting: (p12<=0)
states: 198,846,076 (8)
abstracting: (p8<=0)
states: 232,137,048 (8)
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AX [AF [E [EF [1<=p5] U A [1<=p4 U AG [1<=p1]]]]]
normalized: ~ [EX [EG [~ [E [E [true U 1<=p5] U [~ [EG [E [true U ~ [1<=p1]]]] & ~ [E [E [true U ~ [1<=p1]] U [~ [1<=p4] & E [true U ~ [1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 807,081,132 (8)
abstracting: (1<=p4)
states: 773,790,160 (8)
abstracting: (1<=p1)
states: 807,081,132 (8)
abstracting: (1<=p1)
states: 807,081,132 (8)

EG iterations: 0
abstracting: (1<=p5)
states: 773,790,160 (8)

EG iterations: 0
.-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

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

abstracting: (p5<=0)
states: 232,137,048 (8)
.
EG iterations: 1
abstracting: (1<=p12)
states: 807,081,132 (8)
abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p10)
states: 773,790,160 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EX [[EX [AF [[AF [1<=p11] & [1<=p12 | 1<=p5]]]] | EG [[p11<=0 | AF [1<=p4]]]]]
normalized: EX [[EG [[~ [EG [~ [1<=p4]]] | p11<=0]] | EX [~ [EG [~ [[[1<=p12 | 1<=p5] & ~ [EG [~ [1<=p11]]]]]]]]]]

abstracting: (1<=p11)
states: 773,790,160 (8)
.
EG iterations: 1
abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p12)
states: 807,081,132 (8)
.
EG iterations: 1
.abstracting: (p11<=0)
states: 232,137,048 (8)
abstracting: (1<=p4)
states: 773,790,160 (8)
............
EG iterations: 12
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: [AG [1<=p12] | EG [AF [[EF [[[1<=p0 & 1<=p7] & [1<=p13 & 1<=p12]]] & A [EG [1<=p15] U 1<=p8]]]]]
normalized: [EG [~ [EG [~ [[[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [EG [1<=p15]] & ~ [1<=p8]]]]] & E [true U [[1<=p13 & 1<=p12] & [1<=p0 & 1<=p7]]]]]]]] | ~ [E [true U ~ [1<=p12]]]]

abstracting: (1<=p12)
states: 807,081,132 (8)
abstracting: (1<=p7)
states: 773,790,160 (8)
abstracting: (1<=p0)
states: 649,623,832 (8)
abstracting: (1<=p12)
states: 807,081,132 (8)
abstracting: (1<=p13)
states: 649,623,832 (8)
abstracting: (1<=p8)
states: 773,790,160 (8)
abstracting: (1<=p15)
states: 807,081,132 (8)
.
EG iterations: 1
abstracting: (1<=p8)
states: 773,790,160 (8)
abstracting: (1<=p8)
states: 773,790,160 (8)
............
EG iterations: 12
............
EG iterations: 12
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.006sec

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

abstracting: (1<=p6)
states: 773,790,160 (8)
abstracting: (1<=p8)
states: 773,790,160 (8)
............
EG iterations: 12
abstracting: (1<=p8)
states: 773,790,160 (8)
abstracting: (1<=p8)
states: 773,790,160 (8)
abstracting: (1<=p3)
states: 807,081,132 (8)
abstracting: (1<=p14)
states: 807,081,132 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
.
EG iterations: 1
abstracting: (1<=p6)
states: 773,790,160 (8)
abstracting: (1<=p6)
states: 773,790,160 (8)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.004sec

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

abstracting: (p5<=0)
states: 232,137,048 (8)
.abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (p4<=0)
states: 232,137,048 (8)
abstracting: (p8<=0)
states: 232,137,048 (8)
abstracting: (p15<=0)
states: 198,846,076 (8)
abstracting: (p6<=0)
states: 232,137,048 (8)
abstracting: (p4<=0)
states: 232,137,048 (8)
abstracting: (p1<=0)
states: 198,846,076 (8)
abstracting: (p5<=0)
states: 232,137,048 (8)

EG iterations: 0
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: E [EG [A [1<=p2 U ~ [AG [1<=p5]]]] U [EG [[~ [E [1<=p12 U 1<=p15]] & 1<=p4]] & [AG [AF [1<=p15]] & AX [AG [[EF [1<=p6] | [[1<=p3 & 1<=p9] & [1<=p14 & 1<=p12]]]]]]]]
normalized: E [EG [[~ [EG [~ [E [true U ~ [1<=p5]]]]] & ~ [E [~ [E [true U ~ [1<=p5]]] U [~ [1<=p2] & ~ [E [true U ~ [1<=p5]]]]]]]] U [[~ [EX [E [true U ~ [[[[1<=p14 & 1<=p12] & [1<=p3 & 1<=p9]] | E [true U 1<=p6]]]]]] & ~ [E [true U EG [~ [1<=p15]]]]] & EG [[1<=p4 & ~ [E [1<=p12 U 1<=p15]]]]]]

abstracting: (1<=p15)
states: 807,081,132 (8)
abstracting: (1<=p12)
states: 807,081,132 (8)
abstracting: (1<=p4)
states: 773,790,160 (8)
............
EG iterations: 12
abstracting: (1<=p15)
states: 807,081,132 (8)
.
EG iterations: 1
abstracting: (1<=p6)
states: 773,790,160 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (1<=p3)
states: 807,081,132 (8)
abstracting: (1<=p12)
states: 807,081,132 (8)
abstracting: (1<=p14)
states: 807,081,132 (8)
.abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p5)
states: 773,790,160 (8)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AX [[p11<=0 | [AG [[[p2<=0 & p8<=0] | ~ [E [1<=p2 U 1<=p15]]]] | [AG [[p12<=0 & p2<=0]] & [p8<=0 & [[AX [[1<=p3 & [1<=p9 & 1<=p14]]] | p3<=0] | [p9<=0 | p14<=0]]]]]]]
normalized: ~ [EX [~ [[p11<=0 | [[[p8<=0 & [[p9<=0 | p14<=0] | [p3<=0 | ~ [EX [~ [[1<=p3 & [1<=p9 & 1<=p14]]]]]]]] & ~ [E [true U ~ [[p12<=0 & p2<=0]]]]] | ~ [E [true U ~ [[~ [E [1<=p2 U 1<=p15]] | [p2<=0 & p8<=0]]]]]]]]]]

abstracting: (p8<=0)
states: 232,137,048 (8)
abstracting: (p2<=0)
states: 198,846,076 (8)
abstracting: (1<=p15)
states: 807,081,132 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
abstracting: (p2<=0)
states: 198,846,076 (8)
abstracting: (p12<=0)
states: 198,846,076 (8)
abstracting: (1<=p14)
states: 807,081,132 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (1<=p3)
states: 807,081,132 (8)
.abstracting: (p3<=0)
states: 198,846,076 (8)
abstracting: (p14<=0)
states: 198,846,076 (8)
abstracting: (p9<=0)
states: 232,137,048 (8)
abstracting: (p8<=0)
states: 232,137,048 (8)
abstracting: (p11<=0)
states: 232,137,048 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: E [[EX [EF [1<=p1]] | AX [E [1<=p8 U EF [1<=p8]]]] U EX [[~ [[E [1<=p5 U 1<=p6] | EG [1<=p6]]] & [EG [1<=p2] & [[EX [[1<=p0 & [1<=p7 & 1<=p13]]] | 1<=p5] | [1<=p4 | [1<=p2 & 1<=p15]]]]]]]
normalized: E [[EX [E [true U 1<=p1]] | ~ [EX [~ [E [1<=p8 U E [true U 1<=p8]]]]]] U EX [[[[[1<=p4 | [1<=p2 & 1<=p15]] | [1<=p5 | EX [[1<=p0 & [1<=p7 & 1<=p13]]]]] & EG [1<=p2]] & ~ [[EG [1<=p6] | E [1<=p5 U 1<=p6]]]]]]

abstracting: (1<=p6)
states: 773,790,160 (8)
abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p6)
states: 773,790,160 (8)
.
EG iterations: 1
abstracting: (1<=p2)
states: 807,081,132 (8)
.
EG iterations: 1
abstracting: (1<=p13)
states: 649,623,832 (8)
abstracting: (1<=p7)
states: 773,790,160 (8)
abstracting: (1<=p0)
states: 649,623,832 (8)
.abstracting: (1<=p5)
states: 773,790,160 (8)
abstracting: (1<=p15)
states: 807,081,132 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
abstracting: (1<=p4)
states: 773,790,160 (8)
.abstracting: (1<=p8)
states: 773,790,160 (8)
abstracting: (1<=p8)
states: 773,790,160 (8)
.abstracting: (1<=p1)
states: 807,081,132 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

totally nodes used: 41376 (4.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 264842 113285 378127
used/not used/entry size/cache size: 149545 66959319 16 1024MB
basic ops cache: hits/miss/sum: 91216 40262 131478
used/not used/entry size/cache size: 76985 16700231 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: 6685 3165 9850
used/not used/entry size/cache size: 3165 8385443 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 67069394
1 38348
2 758
3 267
4 24
5 21
6 9
7 2
8 9
9 11
>= 10 21

Total processing time: 0m 4.482sec


BK_STOP 1679466365933

--------------------
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:726 (45), effective:220 (13)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

iterations count:100 (6), effective:32 (2)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:125 (7), effective:36 (2)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Kanban-PT-00010"
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-00010, 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-167856420000242"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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