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-167856420000241.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420000241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679466340068

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Kanban-PT-00010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 06:25:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:25:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:25:41] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-22 06:25:41] [INFO ] Transformed 16 places.
[2023-03-22 06:25:41] [INFO ] Transformed 16 transitions.
[2023-03-22 06:25:41] [INFO ] Parsed PT model containing 16 places and 16 transitions and 40 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Kanban-PT-00010-CTLCardinality-13 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:41] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-22 06:25:42] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-22 06:25:42] [INFO ] Invariant cache hit.
[2023-03-22 06:25:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-22 06:25:42] [INFO ] Invariant cache hit.
[2023-03-22 06:25:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 16/16 places, 16/16 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 14 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 5 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 109) seen :104
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-22 06:25:42] [INFO ] Invariant cache hit.
[2023-03-22 06:25:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-22 06:25:42] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 06:25:42] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-22 06:25:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-22 06:25:42] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 06:25:42] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 9 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 16 transitions.
Computed a total of 0 stabilizing places and 0 stable 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:25:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:25:42] [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 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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 13 transition count 14
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 13 transition count 14
Applied a total of 3 rules in 6 ms. Remains 13 /16 variables (removed 3) and now considering 14/16 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 13/16 places, 14/16 transitions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 14 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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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.
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 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
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 11 transition count 12
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 11 transition count 12
Applied a total of 5 rules in 2 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 2 ms. Remains : 11/16 places, 12/16 transitions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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 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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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 0 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 0 ms. Remains : 14/16 places, 15/16 transitions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [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:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 1 ms. Remains 15 /16 variables (removed 1) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 15/16 places, 16/16 transitions.
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 0 ms
[2023-03-22 06:25:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:42] [INFO ] Input system was already deterministic with 16 transitions.
[2023-03-22 06:25:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 06:25:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 06:25:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 06:25:43] [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 1489 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 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.757sec


RS generation: 0m 0.003sec


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



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

checking: AG [EF [AX [EF [~ [2<=p3]]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EX [~ [E [true U ~ [2<=p3]]]]]]]]]

abstracting: (2<=p3)
states: 631,628,712 (8)
.-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EX [~ [E [EF [2<=p2] U AX [AX [5<=p11]]]]]
normalized: EX [~ [E [E [true U 2<=p2] U ~ [EX [EX [~ [5<=p11]]]]]]]

abstracting: (5<=p11)
states: 196,964,768 (8)
..abstracting: (2<=p2)
states: 631,628,712 (8)
.-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[EX [EX [9<=p7]] & [~ [p1<=p13] | [~ [p11<=10] | p7<=p10]]]]
normalized: E [true U [[[~ [p11<=10] | p7<=p10] | ~ [p1<=p13]] & EX [EX [9<=p7]]]]

abstracting: (9<=p7)
states: 14,068,912 (7)
..abstracting: (p1<=p13)
states: 433,437,004 (8)
abstracting: (p7<=p10)
states: 578,584,006 (8)
abstracting: (p11<=10)
states: 1,005,927,208 (9)
-> the formula is TRUE

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

MC time: 0m 0.044sec

checking: AG [EF [[E [p14<=4 U p14<=p12] | A [10<=p0 U p5<=p15]]]]
normalized: ~ [E [true U ~ [E [true U [[~ [EG [~ [p5<=p15]]] & ~ [E [~ [p5<=p15] U [~ [10<=p0] & ~ [p5<=p15]]]]] | E [p14<=4 U p14<=p12]]]]]]

abstracting: (p14<=p12)
states: 555,967,412 (8)
abstracting: (p14<=4)
states: 762,011,536 (8)
abstracting: (p5<=p15)
states: 612,243,060 (8)
abstracting: (10<=p0)
states: 81,796 (4)
abstracting: (p5<=p15)
states: 612,243,060 (8)
abstracting: (p5<=p15)
states: 612,243,060 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.019sec

checking: E [EX [AF [AX [A [p13<=2 U 5<=p13]]]] U [E [AX [1<=0] U 8<=p14] & [9<=p15 | AF [~ [[EF [8<=p1] & 3<=p6]]]]]]
normalized: E [EX [~ [EG [EX [~ [[~ [EG [~ [5<=p13]]] & ~ [E [~ [5<=p13] U [~ [p13<=2] & ~ [5<=p13]]]]]]]]]] U [[~ [EG [[E [true U 8<=p1] & 3<=p6]]] | 9<=p15] & E [~ [EX [~ [1<=0]]] U 8<=p14]]]

abstracting: (8<=p14)
states: 49,568,376 (7)
abstracting: (1<=0)
states: 0
.abstracting: (9<=p15)
states: 20,694,388 (7)
abstracting: (3<=p6)
states: 422,067,360 (8)
abstracting: (8<=p1)
states: 49,568,376 (7)
.
EG iterations: 1
abstracting: (5<=p13)
states: 66,418,352 (7)
abstracting: (p13<=2)
states: 769,373,176 (8)
abstracting: (5<=p13)
states: 66,418,352 (7)
abstracting: (5<=p13)
states: 66,418,352 (7)
.
EG iterations: 1
..
EG iterations: 1
.-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AG [EF [[AG [[A [p3<=2 U p15<=p2] | [8<=p3 | 8<=p5]]] & [p13<=p9 | 7<=p1]]]]
normalized: ~ [E [true U ~ [E [true U [[p13<=p9 | 7<=p1] & ~ [E [true U ~ [[[8<=p3 | 8<=p5] | [~ [EG [~ [p15<=p2]]] & ~ [E [~ [p15<=p2] U [~ [p3<=2] & ~ [p15<=p2]]]]]]]]]]]]]]

abstracting: (p15<=p2)
states: 573,144,572 (8)
abstracting: (p3<=2)
states: 526,439,056 (8)
abstracting: (p15<=p2)
states: 573,144,572 (8)
abstracting: (p15<=p2)
states: 573,144,572 (8)
.
EG iterations: 1
abstracting: (8<=p5)
states: 35,172,280 (7)
abstracting: (8<=p3)
states: 49,568,376 (7)
abstracting: (7<=p1)
states: 94,965,156 (7)
abstracting: (p13<=p9)
states: 715,510,510 (8)
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: E [EG [p14<=4] U ~ [[[3<=p9 & ~ [[EG [p10<=p12] & ~ [[p15<=3 | p7<=p9]]]]] | EX [EX [~ [p1<=p8]]]]]]
normalized: E [EG [p14<=4] U ~ [[EX [EX [~ [p1<=p8]]] | [3<=p9 & ~ [[~ [[p15<=3 | p7<=p9]] & EG [p10<=p12]]]]]]]

abstracting: (p10<=p12)
states: 612,243,060 (8)
.
EG iterations: 1
abstracting: (p7<=p9)
states: 578,584,006 (8)
abstracting: (p15<=3)
states: 655,513,144 (8)
abstracting: (3<=p9)
states: 422,067,360 (8)
abstracting: (p1<=p8)
states: 535,886,494 (8)
..abstracting: (p14<=4)
states: 762,011,536 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.088sec

checking: [EF [[4<=p2 | AG [[AG [~ [p15<=1]] | [~ [p1<=1] | ~ [3<=p12]]]]]] & AF [[[[EG [9<=p5] & [[~ [6<=p10] | ~ [p13<=p10]] & [~ [p1<=4] | ~ [4<=p14]]]] | EX [~ [p3<=p2]]] | [EG [~ [p2<=1]] | p3<=p1]]]]
normalized: [~ [EG [~ [[[p3<=p1 | EG [~ [p2<=1]]] | [EX [~ [p3<=p2]] | [[[~ [4<=p14] | ~ [p1<=4]] & [~ [p13<=p10] | ~ [6<=p10]]] & EG [9<=p5]]]]]]] & E [true U [4<=p2 | ~ [E [true U ~ [[[~ [3<=p12] | ~ [p1<=1]] | ~ [E [true U p15<=1]]]]]]]]]

abstracting: (p15<=1)
states: 374,298,496 (8)
abstracting: (p1<=1)
states: 374,298,496 (8)
abstracting: (3<=p12)
states: 479,488,152 (8)
abstracting: (4<=p2)
states: 350,414,064 (8)
abstracting: (9<=p5)
states: 14,068,912 (7)
.
EG iterations: 1
abstracting: (6<=p10)
states: 123,102,980 (8)
abstracting: (p13<=p10)
states: 715,510,510 (8)
abstracting: (p1<=4)
states: 762,011,536 (8)
abstracting: (4<=p14)
states: 350,414,064 (8)
abstracting: (p3<=p2)
states: 555,967,412 (8)
.abstracting: (p2<=1)
states: 374,298,496 (8)
.
EG iterations: 1
abstracting: (p3<=p1)
states: 555,967,412 (8)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.013sec

checking: [EG [AF [[~ [4<=p3] | AG [p7<=p12]]]] & [EX [[8<=p0 & [[[A [6<=p10 U 6<=p5] | p2<=p6] | [p7<=4 | ~ [p3<=5]]] & E [[9<=p9 & p7<=p11] U [1<=p3 | 8<=p10]]]]] | ~ [E [2<=p10 U 1<=p14]]]]
normalized: [[~ [E [2<=p10 U 1<=p14]] | EX [[8<=p0 & [E [[9<=p9 & p7<=p11] U [1<=p3 | 8<=p10]] & [[p7<=4 | ~ [p3<=5]] | [p2<=p6 | [~ [EG [~ [6<=p5]]] & ~ [E [~ [6<=p5] U [~ [6<=p10] & ~ [6<=p5]]]]]]]]]]] & EG [~ [EG [~ [[~ [E [true U ~ [p7<=p12]]] | ~ [4<=p3]]]]]]]

abstracting: (4<=p3)
states: 350,414,064 (8)
abstracting: (p7<=p12)
states: 612,243,060 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (6<=p5)
states: 123,102,980 (8)
abstracting: (6<=p10)
states: 123,102,980 (8)
abstracting: (6<=p5)
states: 123,102,980 (8)
abstracting: (6<=p5)
states: 123,102,980 (8)
.
EG iterations: 1
abstracting: (p2<=p6)
states: 535,886,494 (8)
abstracting: (p3<=5)
states: 846,752,192 (8)
abstracting: (p7<=4)
states: 808,962,440 (8)
abstracting: (8<=p10)
states: 35,172,280 (7)
abstracting: (1<=p3)
states: 807,081,132 (8)
abstracting: (p7<=p11)
states: 578,584,006 (8)
abstracting: (9<=p9)
states: 14,068,912 (7)
abstracting: (8<=p0)
states: 3,762,616 (6)
.abstracting: (1<=p14)
states: 807,081,132 (8)
abstracting: (2<=p10)
states: 580,342,620 (8)
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [AG [EF [[~ [p15<=p10] | [~ [9<=p6] & [~ [p4<=4] & ~ [p7<=6]]]]]] | AG [[EF [EG [EX [p14<=p3]]] | [E [[~ [3<=p1] & ~ [p12<=p6]] U [~ [p12<=7] | ~ [p15<=p2]]] & [[10<=p0 & ~ [p11<=p3]] | [EG [p3<=4] & EG [~ [p5<=4]]]]]]]]
normalized: [~ [E [true U ~ [[[[[EG [~ [p5<=4]] & EG [p3<=4]] | [10<=p0 & ~ [p11<=p3]]] & E [[~ [p12<=p6] & ~ [3<=p1]] U [~ [p15<=p2] | ~ [p12<=7]]]] | E [true U EG [EX [p14<=p3]]]]]]] | ~ [E [true U ~ [E [true U [[[~ [p7<=6] & ~ [p4<=4]] & ~ [9<=p6]] | ~ [p15<=p10]]]]]]]

abstracting: (p15<=p10)
states: 535,886,494 (8)
abstracting: (9<=p6)
states: 14,068,912 (7)
abstracting: (p4<=4)
states: 808,962,440 (8)
abstracting: (p7<=6)
states: 935,582,648 (8)
abstracting: (p14<=p3)
states: 573,144,572 (8)
..
EG iterations: 1
abstracting: (p12<=7)
states: 956,358,832 (8)
abstracting: (p15<=p2)
states: 573,144,572 (8)
abstracting: (3<=p1)
states: 479,488,152 (8)
abstracting: (p12<=p6)
states: 535,886,494 (8)
abstracting: (p11<=p3)
states: 612,243,060 (8)
abstracting: (10<=p0)
states: 81,796 (4)
abstracting: (p3<=4)
states: 762,011,536 (8)
.
EG iterations: 1
abstracting: (p5<=4)
states: 808,962,440 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.060sec

checking: EF [[~ [E [~ [[p11<=0 & 10<=p14]] U EF [[3<=p9 | p3<=0]]]] & E [[[[[~ [p8<=p0] | ~ [2<=p8]] & [p6<=p14 | p1<=9]] & [p12<=2 & p1<=9]] | p12<=9] U E [p10<=p7 U [EF [p14<=9] | E [p4<=p0 U 8<=p4]]]]]]
normalized: E [true U [E [[p12<=9 | [[p12<=2 & p1<=9] & [[p6<=p14 | p1<=9] & [~ [2<=p8] | ~ [p8<=p0]]]]] U E [p10<=p7 U [E [p4<=p0 U 8<=p4] | E [true U p14<=9]]]] & ~ [E [~ [[p11<=0 & 10<=p14]] U E [true U [3<=p9 | p3<=0]]]]]]

abstracting: (p3<=0)
states: 198,846,076 (8)
abstracting: (3<=p9)
states: 422,067,360 (8)
abstracting: (10<=p14)
states: 5,398,536 (6)
abstracting: (p11<=0)
states: 232,137,048 (8)
abstracting: (p14<=9)
states: 1,000,528,672 (9)
abstracting: (8<=p4)
states: 35,172,280 (7)
abstracting: (p4<=p0)
states: 469,877,122 (8)
abstracting: (p10<=p7)
states: 578,584,006 (8)
abstracting: (p8<=p0)
states: 469,877,122 (8)
abstracting: (2<=p8)
states: 580,342,620 (8)
abstracting: (p1<=9)
states: 1,000,528,672 (9)
abstracting: (p6<=p14)
states: 612,243,060 (8)
abstracting: (p1<=9)
states: 1,000,528,672 (9)
abstracting: (p12<=2)
states: 526,439,056 (8)
abstracting: (p12<=9)
states: 1,000,528,672 (9)
-> the formula is FALSE

FORMULA Kanban-PT-00010-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: [AF [[[AX [[[p3<=p11 | 3<=p14] & ~ [p13<=1]]] & ~ [E [p3<=p7 U 9<=p15]]] & [A [p4<=7 U p13<=p8] & [E [~ [p8<=3] U p9<=6] & AX [EF [[p5<=3 & p14<=2]]]]]]] | [EF [AG [[E [p1<=p7 U p14<=9] | EF [p14<=8]]]] & [EX [~ [p3<=2]] | AF [EX [EF [p9<=4]]]]]]
normalized: [[[EX [~ [p3<=2]] | ~ [EG [~ [EX [E [true U p9<=4]]]]]] & E [true U ~ [E [true U ~ [[E [true U p14<=8] | E [p1<=p7 U p14<=9]]]]]]] | ~ [EG [~ [[[[~ [EX [~ [E [true U [p5<=3 & p14<=2]]]]] & E [~ [p8<=3] U p9<=6]] & [~ [EG [~ [p13<=p8]]] & ~ [E [~ [p13<=p8] U [~ [p4<=7] & ~ [p13<=p8]]]]]] & [~ [E [p3<=p7 U 9<=p15]] & ~ [EX [~ [[~ [p13<=1] & [p3<=p11 | 3<=p14]]]]]]]]]]]

abstracting: (3<=p14)
states: 479,488,152 (8)
abstracting: (p3<=p11)
states: 535,886,494 (8)
abstracting: (p13<=1)
states: 603,736,276 (8)
.abstracting: (9<=p15)
states: 20,694,388 (7)
abstracting: (p3<=p7)
states: 535,886,494 (8)
abstracting: (p13<=p8)
states: 715,510,510 (8)
abstracting: (p4<=7)
states: 970,754,928 (8)
abstracting: (p13<=p8)
states: 715,510,510 (8)
abstracting: (p13<=p8)
states: 715,510,510 (8)
..
EG iterations: 2
abstracting: (p9<=6)
states: 935,582,648 (8)
abstracting: (p8<=3)
states: 710,480,056 (8)
abstracting: (p14<=2)
states: 526,439,056 (8)
abstracting: (p5<=3)
states: 710,480,056 (8)
..
EG iterations: 1
abstracting: (p14<=9)
states: 1,000,528,672 (9)
abstracting: (p1<=p7)
states: 535,886,494 (8)
abstracting: (p14<=8)
states: 985,232,820 (8)
abstracting: (p9<=4)
states: 808,962,440 (8)
..
EG iterations: 1
abstracting: (p3<=2)
states: 526,439,056 (8)
.-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: E [AG [[~ [[EG [8<=p1] | A [p3<=9 U 4<=p15]]] | [[AG [p12<=7] & 7<=p9] & [6<=p14 & [[AX [p6<=p3] | [p9<=p3 & p12<=1]] & [~ [p13<=9] | ~ [9<=p13]]]]]]] U [AF [AX [[p2<=p3 & [p9<=p13 & ~ [2<=p0]]]]] | [EF [~ [EG [p8<=8]]] & EX [p0<=p15]]]]
normalized: E [~ [E [true U ~ [[[[6<=p14 & [[~ [9<=p13] | ~ [p13<=9]] & [[p9<=p3 & p12<=1] | ~ [EX [~ [p6<=p3]]]]]] & [7<=p9 & ~ [E [true U ~ [p12<=7]]]]] | ~ [[[~ [EG [~ [4<=p15]]] & ~ [E [~ [4<=p15] U [~ [p3<=9] & ~ [4<=p15]]]]] | EG [8<=p1]]]]]]] U [[EX [p0<=p15] & E [true U ~ [EG [p8<=8]]]] | ~ [EG [EX [~ [[p2<=p3 & [p9<=p13 & ~ [2<=p0]]]]]]]]]

abstracting: (2<=p0)
states: 402,190,932 (8)
abstracting: (p9<=p13)
states: 469,877,122 (8)
abstracting: (p2<=p3)
states: 555,967,412 (8)
..
EG iterations: 1
abstracting: (p8<=8)
states: 991,858,296 (8)
.
EG iterations: 1
abstracting: (p0<=p15)
states: 721,440,720 (8)
.abstracting: (8<=p1)
states: 49,568,376 (7)
.
EG iterations: 1
abstracting: (4<=p15)
states: 350,414,064 (8)
abstracting: (p3<=9)
states: 1,000,528,672 (9)
abstracting: (4<=p15)
states: 350,414,064 (8)
abstracting: (4<=p15)
states: 350,414,064 (8)
.
EG iterations: 1
abstracting: (p12<=7)
states: 956,358,832 (8)
abstracting: (7<=p9)
states: 70,344,560 (7)
abstracting: (p6<=p3)
states: 612,243,060 (8)
.abstracting: (p12<=1)
states: 374,298,496 (8)
abstracting: (p9<=p3)
states: 612,243,060 (8)
abstracting: (p13<=9)
states: 1,005,845,412 (9)
abstracting: (9<=p13)
states: 817,960 (5)
abstracting: (6<=p14)
states: 159,175,016 (8)
-> the formula is FALSE

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

MC time: 0m 0.029sec

checking: AF [[A [A [~ [AF [p14<=p6]] U A [p14<=p10 U 1<=p9]] U [[10<=p2 | AF [p13<=p10]] & p6<=p1]] | [[~ [10<=p10] & [AG [~ [p5<=p1]] | ~ [E [p7<=p8 U 10<=p12]]]] & [[~ [p6<=p10] | [~ [A [p3<=p12 U 1<=p2]] | AG [~ [p14<=p8]]]] & [p13<=p14 | p15<=p3]]]]]
normalized: ~ [EG [~ [[[[[p13<=p14 | p15<=p3] & [[~ [E [true U p14<=p8]] | ~ [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [p3<=p12] & ~ [1<=p2]]]]]]] | ~ [p6<=p10]]] & [[~ [E [p7<=p8 U 10<=p12]] | ~ [E [true U p5<=p1]]] & ~ [10<=p10]]] | [~ [EG [~ [[p6<=p1 & [10<=p2 | ~ [EG [~ [p13<=p10]]]]]]]] & ~ [E [~ [[p6<=p1 & [10<=p2 | ~ [EG [~ [p13<=p10]]]]]] U [~ [[~ [EG [~ [[~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [p14<=p10] & ~ [1<=p9]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [p14<=p10] & ~ [1<=p9]]]]]] U [~ [EG [~ [p14<=p6]]] & ~ [[~ [EG [~ [1<=p9]]] & ~ [E [~ [1<=p9] U [~ [p14<=p10] & ~ [1<=p9]]]]]]]]]]] & ~ [[p6<=p1 & [10<=p2 | ~ [EG [~ [p13<=p10]]]]]]]]]]]]]]

abstracting: (p13<=p10)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=p2)
states: 5,398,536 (6)
abstracting: (p6<=p1)
states: 612,243,060 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (p14<=p10)
states: 535,886,494 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
..
EG iterations: 2
abstracting: (p14<=p6)
states: 535,886,494 (8)
.
EG iterations: 1
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (p14<=p10)
states: 535,886,494 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
..
EG iterations: 2
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (p14<=p10)
states: 535,886,494 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
abstracting: (1<=p9)
states: 773,790,160 (8)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p13<=p10)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=p2)
states: 5,398,536 (6)
abstracting: (p6<=p1)
states: 612,243,060 (8)
abstracting: (p13<=p10)
states: 715,510,510 (8)
.
EG iterations: 1
abstracting: (10<=p2)
states: 5,398,536 (6)
abstracting: (p6<=p1)
states: 612,243,060 (8)
............
EG iterations: 12
abstracting: (10<=p10)
states: 3,517,228 (6)
abstracting: (p5<=p1)
states: 612,243,060 (8)
abstracting: (10<=p12)
states: 5,398,536 (6)
abstracting: (p7<=p8)
states: 578,584,006 (8)
abstracting: (p6<=p10)
states: 578,584,006 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
abstracting: (p3<=p12)
states: 573,144,572 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
abstracting: (1<=p2)
states: 807,081,132 (8)
.
EG iterations: 1
abstracting: (p14<=p8)
states: 535,886,494 (8)
abstracting: (p15<=p3)
states: 573,144,572 (8)
abstracting: (p13<=p14)
states: 721,440,720 (8)
..................
EG iterations: 18
-> the formula is TRUE

FORMULA Kanban-PT-00010-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.589sec

checking: [AF [[[[~ [6<=p10] | ~ [p5<=7]] | [p5<=4 | ~ [p13<=3]]] & AG [~ [6<=p2]]]] & [E [p9<=7 U [[AG [[9<=p13 & p15<=4]] & [[~ [6<=p5] & [p2<=p13 | 9<=p7]] | EF [p2<=p15]]] | p14<=p8]] & [AF [p8<=6] | [E [~ [AX [p2<=0]] U ~ [A [7<=p2 U p14<=2]]] & E [E [E [3<=p8 U 7<=p8] U A [p13<=8 U p4<=p1]] U [~ [AG [7<=p3]] | [[p4<=1 | p3<=7] & p14<=p1]]]]]]]
normalized: [[[[E [E [E [3<=p8 U 7<=p8] U [~ [EG [~ [p4<=p1]]] & ~ [E [~ [p4<=p1] U [~ [p13<=8] & ~ [p4<=p1]]]]]] U [[p14<=p1 & [p4<=1 | p3<=7]] | E [true U ~ [7<=p3]]]] & E [EX [~ [p2<=0]] U ~ [[~ [EG [~ [p14<=2]]] & ~ [E [~ [p14<=2] U [~ [7<=p2] & ~ [p14<=2]]]]]]]] | ~ [EG [~ [p8<=6]]]] & E [p9<=7 U [p14<=p8 | [[E [true U p2<=p15] | [[p2<=p13 | 9<=p7] & ~ [6<=p5]]] & ~ [E [true U ~ [[9<=p13 & p15<=4]]]]]]]] & ~ [EG [~ [[~ [E [true U 6<=p2]] & [[p5<=4 | ~ [p13<=3]] | [~ [p5<=7] | ~ [6<=p10]]]]]]]]

abstracting: (6<=p10)
states: 123,102,980 (8)
abstracting: (p5<=7)
states: 970,754,928 (8)
abstracting: (p13<=3)
states: 875,380,792 (8)
abstracting: (p5<=4)
states: 808,962,440 (8)
abstracting: (6<=p2)
states: 159,175,016 (8)

EG iterations: 0
abstracting: (p15<=4)
states: 762,011,536 (8)
abstracting: (9<=p13)
states: 817,960 (5)
abstracting: (6<=p5)
states: 123,102,980 (8)
abstracting: (9<=p7)
states: 14,068,912 (7)
abstracting: (p2<=p13)
states: 433,437,004 (8)
abstracting: (p2<=p15)
states: 573,144,572 (8)
abstracting: (p14<=p8)
states: 535,886,494 (8)
abstracting: (p9<=7)
states: 970,754,928 (8)
abstracting: (p8<=6)
states: 935,582,648 (8)
.
EG iterations: 1
abstracting: (p14<=2)
states: 526,439,056 (8)
abstracting: (7<=p2)
states: 94,965,156 (7)
abstracting: (p14<=2)
states: 526,439,056 (8)
abstracting: (p14<=2)
states: 526,439,056 (8)
.
EG iterations: 1
abstracting: (p2<=0)
states: 198,846,076 (8)
.abstracting: (7<=p3)
states: 94,965,156 (7)
abstracting: (p3<=7)
states: 956,358,832 (8)
abstracting: (p4<=1)
states: 425,584,588 (8)
abstracting: (p14<=p1)
states: 573,144,572 (8)
abstracting: (p4<=p1)
states: 612,243,060 (8)
abstracting: (p13<=8)
states: 1,005,109,248 (9)
abstracting: (p4<=p1)
states: 612,243,060 (8)
abstracting: (p4<=p1)
states: 612,243,060 (8)
............
EG iterations: 12
abstracting: (7<=p8)
states: 70,344,560 (7)
abstracting: (3<=p8)
states: 422,067,360 (8)
-> the formula is FALSE

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

MC time: 0m 0.046sec

totally nodes used: 506125 (5.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2578489 1014985 3593474
used/not used/entry size/cache size: 1376714 65732150 16 1024MB
basic ops cache: hits/miss/sum: 1657943 663789 2321732
used/not used/entry size/cache size: 1165964 15611252 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: 40633 19131 59764
used/not used/entry size/cache size: 19118 8369490 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 66682521
1 403988
2 14626
3 3132
4 1492
5 612
6 444
7 465
8 265
9 208
>= 10 1111

Total processing time: 0m 5.489sec


BK_STOP 1679466349561

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:726 (45), effective:220 (13)

initing FirstDep: 0m 0.000sec


iterations count:527 (32), effective:138 (8)

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

iterations count:120 (7), effective:29 (1)

iterations count:275 (17), effective:77 (4)

iterations count:206 (12), effective:60 (3)

iterations count:88 (5), effective:20 (1)

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

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

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

iterations count:592 (37), effective:161 (10)

iterations count:124 (7), effective:34 (2)

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

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

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

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

iterations count:414 (25), effective:138 (8)

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

iterations count:161 (10), effective:48 (3)

iterations count:280 (17), effective:73 (4)

iterations count:108 (6), effective:31 (1)

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

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

iterations count:38 (2), effective:6 (0)

iterations count:215 (13), effective:66 (4)

iterations count:53 (3), effective:19 (1)

iterations count:215 (13), effective:74 (4)

iterations count:368 (23), effective:98 (6)

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

iterations count:35 (2), effective:6 (0)

iterations count:799 (49), effective:228 (14)

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

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

iterations count:404 (25), effective:123 (7)

iterations count:376 (23), effective:102 (6)

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

iterations count:231 (14), effective:76 (4)

iterations count:35 (2), effective:6 (0)

iterations count:62 (3), effective:15 (0)

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

iterations count:214 (13), effective:54 (3)

iterations count:358 (22), effective:99 (6)

iterations count:206 (12), effective:60 (3)

iterations count:368 (23), effective:109 (6)

iterations count:284 (17), effective:79 (4)

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

iterations count:236 (14), effective:60 (3)

iterations count:236 (14), effective:60 (3)

iterations count:86 (5), effective:25 (1)

iterations count:236 (14), effective:60 (3)

iterations count:931 (58), effective:405 (25)

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

iterations count:519 (32), effective:148 (9)

iterations count:63 (3), effective:15 (0)

iterations count:203 (12), effective:62 (3)

iterations count:440 (27), effective:117 (7)

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

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

iterations count:203 (12), effective:62 (3)

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

iterations count:82 (5), effective:18 (1)

iterations count:212 (13), effective:53 (3)

iterations count:787 (49), effective:217 (13)

iterations count:168 (10), effective:44 (2)

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

iterations count:16 (1), effective:0 (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-00010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Kanban-PT-00010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420000241"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;