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.r394-oct2-167903717800362.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-001B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717800362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 26 01:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 26 01:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 02:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-001B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679508104888

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=ShieldPPPs-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:01:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 18:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:01:47] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-22 18:01:47] [INFO ] Transformed 71 places.
[2023-03-22 18:01:47] [INFO ] Transformed 66 transitions.
[2023-03-22 18:01:47] [INFO ] Found NUPN structural information;
[2023-03-22 18:01:47] [INFO ] Parsed PT model containing 71 places and 66 transitions and 180 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 52 out of 71 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Applied a total of 0 rules in 24 ms. Remains 71 /71 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 71 cols
[2023-03-22 18:01:47] [INFO ] Computed 12 place invariants in 4 ms
[2023-03-22 18:01:47] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-22 18:01:47] [INFO ] Invariant cache hit.
[2023-03-22 18:01:47] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-22 18:01:47] [INFO ] Invariant cache hit.
[2023-03-22 18:01:48] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 71/71 places, 66/66 transitions.
Support contains 52 out of 71 places after structural reductions.
[2023-03-22 18:01:48] [INFO ] Flatten gal took : 27 ms
[2023-03-22 18:01:48] [INFO ] Flatten gal took : 11 ms
[2023-03-22 18:01:48] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 428 ms. (steps per millisecond=23 ) properties (out of 46) seen :40
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 18:01:49] [INFO ] Invariant cache hit.
[2023-03-22 18:01:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:01:49] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:2
[2023-03-22 18:01:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-22 18:01:49] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2023-03-22 18:01:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 6 ms to minimize.
[2023-03-22 18:01:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2023-03-22 18:01:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
[2023-03-22 18:01:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-22 18:01:49] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 18:01:49] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 66/66 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 71 transition count 58
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 63 transition count 58
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 63 transition count 53
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 58 transition count 53
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 52 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 52 transition count 47
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 38 place count 52 transition count 45
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 50 transition count 45
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 35 transition count 30
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 35 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 34 transition count 29
Applied a total of 79 rules in 78 ms. Remains 34 /71 variables (removed 37) and now considering 29/66 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 34/71 places, 29/66 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 30044 states, properties seen :0
Probabilistic random walk after 148218 steps, saw 30044 distinct states, run finished after 185 ms. (steps per millisecond=801 ) properties seen :0
Explored full state space saw : 30044 states, properties seen :0
Exhaustive walk after 148218 steps, saw 30044 distinct states, run finished after 98 ms. (steps per millisecond=1512 ) properties seen :0
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 6 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 6 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 4 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 63/71 places, 58/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 70 transition count 60
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 65 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 64 transition count 59
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 64 transition count 52
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 32 place count 51 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 66 place count 37 transition count 32
Applied a total of 66 rules in 8 ms. Remains 37 /71 variables (removed 34) and now considering 32/66 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 37/71 places, 32/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 62 transition count 51
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 42 place count 49 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 47 transition count 42
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 8 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 33/71 places, 28/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 62 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 33 place count 50 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 40 place count 50 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 50 transition count 44
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 42 place count 49 transition count 44
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 64 place count 38 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 37 transition count 32
Applied a total of 65 rules in 7 ms. Remains 37 /71 variables (removed 34) and now considering 32/66 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 37/71 places, 32/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 3 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/71 places, 58/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 64 transition count 59
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 64 transition count 59
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 63 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 63 transition count 58
Applied a total of 16 rules in 3 ms. Remains 63 /71 variables (removed 8) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 63/71 places, 58/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 2 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/71 places, 60/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 2 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/71 places, 61/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 62 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 51 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 38 place count 51 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 35 transition count 30
Applied a total of 69 rules in 7 ms. Remains 35 /71 variables (removed 36) and now considering 30/66 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 35/71 places, 30/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 42 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 46 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 7 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 33/71 places, 28/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/71 places, 59/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 57
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 16 place count 62 transition count 52
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 26 place count 57 transition count 52
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 32 place count 51 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 51 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 38 place count 51 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 72 place count 34 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 33 transition count 28
Applied a total of 73 rules in 6 ms. Remains 33 /71 variables (removed 38) and now considering 28/66 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 33/71 places, 28/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 65 transition count 60
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 65 transition count 60
Applied a total of 12 rules in 3 ms. Remains 65 /71 variables (removed 6) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/71 places, 60/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 66 transition count 61
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 66 transition count 61
Applied a total of 10 rules in 1 ms. Remains 66 /71 variables (removed 5) and now considering 61/66 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 66/71 places, 61/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 23 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 70 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 61 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 18 place count 61 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 56 transition count 51
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 35 place count 49 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 42 place count 49 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 42 place count 49 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 46 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 33 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 32 transition count 27
Applied a total of 75 rules in 7 ms. Remains 32 /71 variables (removed 39) and now considering 27/66 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 32/71 places, 27/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 1 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 71/71 places, 66/66 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 65 transition count 60
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 65 transition count 60
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 64 transition count 59
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 64 transition count 59
Applied a total of 14 rules in 3 ms. Remains 64 /71 variables (removed 7) and now considering 59/66 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/71 places, 59/66 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:01:50] [INFO ] Input system was already deterministic with 59 transitions.
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:01:50] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 18:01:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 71 places, 66 transitions and 180 arcs took 0 ms.
Total runtime 3211 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: 71 NrTr: 66 NrArc: 180)

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

net check time: 0m 0.000sec

init dd package: 0m 2.843sec


RS generation: 0m 0.466sec


-> reachability set: #nodes 12183 (1.2e+04) #states 5,212,975 (6)



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

checking: EG [[p37<=0 & 0<=p37]]
normalized: EG [[p37<=0 & 0<=p37]]

abstracting: (0<=p37)
states: 5,212,975 (6)
abstracting: (p37<=0)
states: 4,563,338 (6)
................................................................................................................
EG iterations: 112
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.203sec

checking: EG [[p17<=0 & 0<=p17]]
normalized: EG [[p17<=0 & 0<=p17]]

abstracting: (0<=p17)
states: 5,212,975 (6)
abstracting: (p17<=0)
states: 4,443,173 (6)
.............................................................................................................................
EG iterations: 125
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.004sec

checking: EG [[[p32<=0 & 0<=p32] | [p68<=0 & 0<=p68]]]
normalized: EG [[[p68<=0 & 0<=p68] | [p32<=0 & 0<=p32]]]

abstracting: (0<=p32)
states: 5,212,975 (6)
abstracting: (p32<=0)
states: 3,737,143 (6)
abstracting: (0<=p68)
states: 5,212,975 (6)
abstracting: (p68<=0)
states: 4,646,268 (6)
...................................................................................................
EG iterations: 99
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.631sec

checking: EG [AF [[AG [[p2<=0 & 0<=p2]] | [p17<=0 & 0<=p17]]]]
normalized: EG [~ [EG [~ [[[p17<=0 & 0<=p17] | ~ [E [true U ~ [[p2<=0 & 0<=p2]]]]]]]]]

abstracting: (0<=p2)
states: 5,212,975 (6)
abstracting: (p2<=0)
states: 3,496,608 (6)
abstracting: (0<=p17)
states: 5,212,975 (6)
abstracting: (p17<=0)
states: 4,443,173 (6)
.......................................................................................................................
EG iterations: 119

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.923sec

checking: EF [AX [[AF [[[p20<=1 & 1<=p20] & [p57<=1 & 1<=p57]]] & EF [[p60<=0 & 0<=p60]]]]]
normalized: E [true U ~ [EX [~ [[E [true U [p60<=0 & 0<=p60]] & ~ [EG [~ [[[p57<=1 & 1<=p57] & [p20<=1 & 1<=p20]]]]]]]]]]

abstracting: (1<=p20)
states: 1,509,068 (6)
abstracting: (p20<=1)
states: 5,212,975 (6)
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
..........................................................................
EG iterations: 74
abstracting: (0<=p60)
states: 5,212,975 (6)
abstracting: (p60<=0)
states: 5,212,210 (6)
.-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.548sec

checking: AF [[[p46<=1 & 1<=p46] & [[p32<=1 & 1<=p32] & [p68<=1 & 1<=p68]]]]
normalized: ~ [EG [~ [[[p46<=1 & 1<=p46] & [[p68<=1 & 1<=p68] & [p32<=1 & 1<=p32]]]]]]

abstracting: (1<=p32)
states: 1,475,832 (6)
abstracting: (p32<=1)
states: 5,212,975 (6)
abstracting: (1<=p68)
states: 566,707 (5)
abstracting: (p68<=1)
states: 5,212,975 (6)
abstracting: (1<=p46)
states: 31,337 (4)
abstracting: (p46<=1)
states: 5,212,975 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [A [~ [EF [AG [[1<=p63 & p63<=1]]]] U AX [[[p14<=1 & 1<=p14] & [p49<=1 & 1<=p49]]]] & EF [EG [[p54<=0 & 0<=p54]]]]
normalized: [E [true U EG [[p54<=0 & 0<=p54]]] & [~ [EG [EX [~ [[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]]]]]] & ~ [E [EX [~ [[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]]]] U [E [true U ~ [E [true U ~ [[1<=p63 & p63<=1]]]]] & EX [~ [[[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]]]]]]]]]

abstracting: (1<=p14)
states: 1,779,685 (6)
abstracting: (p14<=1)
states: 5,212,975 (6)
abstracting: (1<=p49)
states: 1,714,401 (6)
abstracting: (p49<=1)
states: 5,212,975 (6)
.abstracting: (p63<=1)
states: 5,212,975 (6)
abstracting: (1<=p63)
states: 605,555 (5)
abstracting: (1<=p14)
states: 1,779,685 (6)
abstracting: (p14<=1)
states: 5,212,975 (6)
abstracting: (1<=p49)
states: 1,714,401 (6)
abstracting: (p49<=1)
states: 5,212,975 (6)
.abstracting: (1<=p14)
states: 1,779,685 (6)
abstracting: (p14<=1)
states: 5,212,975 (6)
abstracting: (1<=p49)
states: 1,714,401 (6)
abstracting: (p49<=1)
states: 5,212,975 (6)
.........................
EG iterations: 24
abstracting: (0<=p54)
states: 5,212,975 (6)
abstracting: (p54<=0)
states: 4,559,757 (6)
............................................
EG iterations: 44
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.384sec

checking: EF [AG [[AG [~ [A [[[p20<=1 & 1<=p20] & [p57<=1 & 1<=p57]] U [p44<=1 & 1<=p44]]]] & [p60<=0 & 0<=p60]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [true U [~ [EG [~ [[p44<=1 & 1<=p44]]]] & ~ [E [~ [[p44<=1 & 1<=p44]] U [~ [[[p20<=1 & 1<=p20] & [p57<=1 & 1<=p57]]] & ~ [[p44<=1 & 1<=p44]]]]]]]] & [p60<=0 & 0<=p60]]]]]]

abstracting: (0<=p60)
states: 5,212,975 (6)
abstracting: (p60<=0)
states: 5,212,210 (6)
abstracting: (1<=p44)
states: 652,981 (5)
abstracting: (p44<=1)
states: 5,212,975 (6)
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
abstracting: (1<=p20)
states: 1,509,068 (6)
abstracting: (p20<=1)
states: 5,212,975 (6)
abstracting: (1<=p44)
states: 652,981 (5)
abstracting: (p44<=1)
states: 5,212,975 (6)
abstracting: (1<=p44)
states: 652,981 (5)
abstracting: (p44<=1)
states: 5,212,975 (6)
............................................................................................................
EG iterations: 108
-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.096sec

checking: EX [EG [[EG [[~ [[p33<=1 & 1<=p33]] | ~ [[p35<=1 & 1<=p35]]]] | [~ [[p34<=1 & 1<=p34]] | ~ [[p57<=1 & 1<=p57]]]]]]
normalized: EX [EG [[[~ [[p34<=1 & 1<=p34]] | ~ [[p57<=1 & 1<=p57]]] | EG [[~ [[p35<=1 & 1<=p35]] | ~ [[p33<=1 & 1<=p33]]]]]]]

abstracting: (1<=p33)
states: 1,476,130 (6)
abstracting: (p33<=1)
states: 5,212,975 (6)
abstracting: (1<=p35)
states: 1,475,448 (6)
abstracting: (p35<=1)
states: 5,212,975 (6)
.
EG iterations: 1
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
abstracting: (1<=p34)
states: 1,476,514 (6)
abstracting: (p34<=1)
states: 5,212,975 (6)

EG iterations: 0
.-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: EX [EF [[AX [[p37<=1 & 1<=p37]] & [[p29<=1 & 1<=p29] | [[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]]]
normalized: EX [E [true U [[[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]] | [p29<=1 & 1<=p29]] & ~ [EX [~ [[p37<=1 & 1<=p37]]]]]]]

abstracting: (1<=p37)
states: 649,637 (5)
abstracting: (p37<=1)
states: 5,212,975 (6)
.abstracting: (1<=p29)
states: 753,738 (5)
abstracting: (p29<=1)
states: 5,212,975 (6)
abstracting: (1<=p19)
states: 1,459,562 (6)
abstracting: (p19<=1)
states: 5,212,975 (6)
abstracting: (1<=p21)
states: 1,445,556 (6)
abstracting: (p21<=1)
states: 5,212,975 (6)
.-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: AF [EX [AG [[[[p9<=0 & 0<=p9] & [p47<=0 & 0<=p47]] & [[p34<=1 & 1<=p34] & [p57<=1 & 1<=p57]]]]]]
normalized: ~ [EG [~ [EX [~ [E [true U ~ [[[[p57<=1 & 1<=p57] & [p34<=1 & 1<=p34]] & [[p47<=0 & 0<=p47] & [p9<=0 & 0<=p9]]]]]]]]]]

abstracting: (0<=p9)
states: 5,212,975 (6)
abstracting: (p9<=0)
states: 5,212,847 (6)
abstracting: (0<=p47)
states: 5,212,975 (6)
abstracting: (p47<=0)
states: 3,508,891 (6)
abstracting: (1<=p34)
states: 1,476,514 (6)
abstracting: (p34<=1)
states: 5,212,975 (6)
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
.
EG iterations: 0
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [[[p63<=1 & 1<=p63] | E [~ [[[p25<=1 & 1<=p25] & [p43<=1 & 1<=p43]]] U [[p32<=1 & 1<=p32] & [p68<=1 & 1<=p68]]]]]
normalized: ~ [E [true U ~ [[E [~ [[[p43<=1 & 1<=p43] & [p25<=1 & 1<=p25]]] U [[p68<=1 & 1<=p68] & [p32<=1 & 1<=p32]]] | [p63<=1 & 1<=p63]]]]]

abstracting: (1<=p63)
states: 605,555 (5)
abstracting: (p63<=1)
states: 5,212,975 (6)
abstracting: (1<=p32)
states: 1,475,832 (6)
abstracting: (p32<=1)
states: 5,212,975 (6)
abstracting: (1<=p68)
states: 566,707 (5)
abstracting: (p68<=1)
states: 5,212,975 (6)
abstracting: (1<=p25)
states: 1,516,909 (6)
abstracting: (p25<=1)
states: 5,212,975 (6)
abstracting: (1<=p43)
states: 652,981 (5)
abstracting: (p43<=1)
states: 5,212,975 (6)
-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.935sec

checking: [AG [[p56<=0 & 0<=p56]] | [EF [[p53<=1 & 1<=p53]] & [EF [[EG [[p30<=1 & 1<=p30]] & [p30<=1 & 1<=p30]]] & AX [AF [[p6<=1 & 1<=p6]]]]]]
normalized: [[[E [true U [EG [[p30<=1 & 1<=p30]] & [p30<=1 & 1<=p30]]] & ~ [EX [EG [~ [[p6<=1 & 1<=p6]]]]]] & E [true U [p53<=1 & 1<=p53]]] | ~ [E [true U ~ [[p56<=0 & 0<=p56]]]]]

abstracting: (0<=p56)
states: 5,212,975 (6)
abstracting: (p56<=0)
states: 4,576,461 (6)
abstracting: (1<=p53)
states: 649,908 (5)
abstracting: (p53<=1)
states: 5,212,975 (6)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 5,212,975 (6)
....
EG iterations: 4
.abstracting: (1<=p30)
states: 753,354 (5)
abstracting: (p30<=1)
states: 5,212,975 (6)
abstracting: (1<=p30)
states: 753,354 (5)
abstracting: (p30<=1)
states: 5,212,975 (6)
....................
EG iterations: 20
-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.477sec

checking: [AF [[[[p8<=1 & 1<=p8] & [p39<=1 & 1<=p39]] | [[[p14<=1 & 1<=p14] & [p49<=1 & 1<=p49]] | [p2<=1 & 1<=p2]]]] | [EX [AG [[p59<=1 & 1<=p59]]] | [EG [AF [[[p15<=1 & 1<=p15] & [p48<=1 & 1<=p48]]]] & [EF [[p42<=0 & 0<=p42]] & EG [AG [[p60<=1 & 1<=p60]]]]]]]
normalized: [[[[EG [~ [E [true U ~ [[p60<=1 & 1<=p60]]]]] & E [true U [p42<=0 & 0<=p42]]] & EG [~ [EG [~ [[[p48<=1 & 1<=p48] & [p15<=1 & 1<=p15]]]]]]] | EX [~ [E [true U ~ [[p59<=1 & 1<=p59]]]]]] | ~ [EG [~ [[[[p2<=1 & 1<=p2] | [[p49<=1 & 1<=p49] & [p14<=1 & 1<=p14]]] | [[p39<=1 & 1<=p39] & [p8<=1 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 32
abstracting: (p8<=1)
states: 5,212,975 (6)
abstracting: (1<=p39)
states: 631,968 (5)
abstracting: (p39<=1)
states: 5,212,975 (6)
abstracting: (1<=p14)
states: 1,779,685 (6)
abstracting: (p14<=1)
states: 5,212,975 (6)
abstracting: (1<=p49)
states: 1,714,401 (6)
abstracting: (p49<=1)
states: 5,212,975 (6)
abstracting: (1<=p2)
states: 1,716,367 (6)
abstracting: (p2<=1)
states: 5,212,975 (6)
.................................................................
EG iterations: 65
abstracting: (1<=p59)
states: 608
abstracting: (p59<=1)
states: 5,212,975 (6)
.abstracting: (1<=p15)
states: 754,956 (5)
abstracting: (p15<=1)
states: 5,212,975 (6)
abstracting: (1<=p48)
states: 1,763,130 (6)
abstracting: (p48<=1)
states: 5,212,975 (6)
............................................................................................................................
EG iterations: 124
.....................................................................................................
EG iterations: 101
abstracting: (0<=p42)
states: 5,212,975 (6)
abstracting: (p42<=0)
states: 4,575,981 (6)
abstracting: (1<=p60)
states: 765
abstracting: (p60<=1)
states: 5,212,975 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.207sec

checking: AX [[[E [AG [[~ [[[p15<=1 & 1<=p15] & [p48<=1 & 1<=p48]]] & ~ [[p67<=1 & 1<=p67]]]] U ~ [[~ [EG [[p10<=1 & 1<=p10]]] | [[p45<=1 & 1<=p45] & [[p34<=1 & 1<=p34] & [p57<=1 & 1<=p57]]]]]] | ~ [E [~ [[p61<=1 & 1<=p61]] U AF [[p13<=1 & 1<=p13]]]]] | [EX [[[p11<=1 & 1<=p11] & [[p54<=0 & 0<=p54] & [p56<=0 & 0<=p56]]]] | [[p12<=1 & 1<=p12] & [p62<=1 & 1<=p62]]]]]
normalized: ~ [EX [~ [[[[[p62<=1 & 1<=p62] & [p12<=1 & 1<=p12]] | EX [[[[p56<=0 & 0<=p56] & [p54<=0 & 0<=p54]] & [p11<=1 & 1<=p11]]]] | [~ [E [~ [[p61<=1 & 1<=p61]] U ~ [EG [~ [[p13<=1 & 1<=p13]]]]]] | E [~ [E [true U ~ [[~ [[p67<=1 & 1<=p67]] & ~ [[[p48<=1 & 1<=p48] & [p15<=1 & 1<=p15]]]]]]] U ~ [[[[[p57<=1 & 1<=p57] & [p34<=1 & 1<=p34]] & [p45<=1 & 1<=p45]] | ~ [EG [[p10<=1 & 1<=p10]]]]]]]]]]]

abstracting: (1<=p10)
states: 1,288 (3)
abstracting: (p10<=1)
states: 5,212,975 (6)
............................
EG iterations: 28
abstracting: (1<=p45)
states: 41,222 (4)
abstracting: (p45<=1)
states: 5,212,975 (6)
abstracting: (1<=p34)
states: 1,476,514 (6)
abstracting: (p34<=1)
states: 5,212,975 (6)
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
abstracting: (1<=p15)
states: 754,956 (5)
abstracting: (p15<=1)
states: 5,212,975 (6)
abstracting: (1<=p48)
states: 1,763,130 (6)
abstracting: (p48<=1)
states: 5,212,975 (6)
abstracting: (1<=p67)
states: 557,507 (5)
abstracting: (p67<=1)
states: 5,212,975 (6)
abstracting: (1<=p13)
states: 1,706,316 (6)
abstracting: (p13<=1)
states: 5,212,975 (6)
............................................................................................................
EG iterations: 108
abstracting: (1<=p61)
states: 566,004 (5)
abstracting: (p61<=1)
states: 5,212,975 (6)
abstracting: (1<=p11)
states: 11,826 (4)
abstracting: (p11<=1)
states: 5,212,975 (6)
abstracting: (0<=p54)
states: 5,212,975 (6)
abstracting: (p54<=0)
states: 4,559,757 (6)
abstracting: (0<=p56)
states: 5,212,975 (6)
abstracting: (p56<=0)
states: 4,576,461 (6)
.abstracting: (1<=p12)
states: 1,713,677 (6)
abstracting: (p12<=1)
states: 5,212,975 (6)
abstracting: (1<=p62)
states: 605,555 (5)
abstracting: (p62<=1)
states: 5,212,975 (6)
.-> the formula is FALSE

FORMULA ShieldPPPs-PT-001B-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.641sec

checking: EF [[EX [[AG [[[p15<=0 & 0<=p15] | [p48<=0 & 0<=p48]]] & [[p18<=0 & 0<=p18] | [p43<=0 & 0<=p43]]]] & [[EF [[[[p12<=0 & 0<=p12] | [p62<=0 & 0<=p62]] & [p36<=0 & 0<=p36]]] | [p51<=1 & 1<=p51]] | [[[p19<=1 & 1<=p19] & [[p21<=1 & 1<=p21] & [p69<=1 & 1<=p69]]] | [[p41<=1 & 1<=p41] & [[p20<=1 & 1<=p20] & [p57<=1 & 1<=p57]]]]]]]
normalized: E [true U [[[[[[p57<=1 & 1<=p57] & [p20<=1 & 1<=p20]] & [p41<=1 & 1<=p41]] | [[[p69<=1 & 1<=p69] & [p21<=1 & 1<=p21]] & [p19<=1 & 1<=p19]]] | [[p51<=1 & 1<=p51] | E [true U [[p36<=0 & 0<=p36] & [[p62<=0 & 0<=p62] | [p12<=0 & 0<=p12]]]]]] & EX [[[[p43<=0 & 0<=p43] | [p18<=0 & 0<=p18]] & ~ [E [true U ~ [[[p48<=0 & 0<=p48] | [p15<=0 & 0<=p15]]]]]]]]]

abstracting: (0<=p15)
states: 5,212,975 (6)
abstracting: (p15<=0)
states: 4,458,019 (6)
abstracting: (0<=p48)
states: 5,212,975 (6)
abstracting: (p48<=0)
states: 3,449,845 (6)
abstracting: (0<=p18)
states: 5,212,975 (6)
abstracting: (p18<=0)
states: 3,717,913 (6)
abstracting: (0<=p43)
states: 5,212,975 (6)
abstracting: (p43<=0)
states: 4,559,994 (6)
.abstracting: (0<=p12)
states: 5,212,975 (6)
abstracting: (p12<=0)
states: 3,499,298 (6)
abstracting: (0<=p62)
states: 5,212,975 (6)
abstracting: (p62<=0)
states: 4,607,420 (6)
abstracting: (0<=p36)
states: 5,212,975 (6)
abstracting: (p36<=0)
states: 5,171,753 (6)
abstracting: (1<=p51)
states: 643,590 (5)
abstracting: (p51<=1)
states: 5,212,975 (6)
abstracting: (1<=p19)
states: 1,459,562 (6)
abstracting: (p19<=1)
states: 5,212,975 (6)
abstracting: (1<=p21)
states: 1,445,556 (6)
abstracting: (p21<=1)
states: 5,212,975 (6)
abstracting: (1<=p69)
states: 566,707 (5)
abstracting: (p69<=1)
states: 5,212,975 (6)
abstracting: (1<=p41)
states: 628,127 (5)
abstracting: (p41<=1)
states: 5,212,975 (6)
abstracting: (1<=p20)
states: 1,509,068 (6)
abstracting: (p20<=1)
states: 5,212,975 (6)
abstracting: (1<=p57)
states: 644,068 (5)
abstracting: (p57<=1)
states: 5,212,975 (6)
-> the formula is TRUE

FORMULA ShieldPPPs-PT-001B-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.437sec

totally nodes used: 47824221 (4.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 44927111 111825689 156752800
used/not used/entry size/cache size: 59851973 7256891 16 1024MB
basic ops cache: hits/miss/sum: 6981407 14933785 21915192
used/not used/entry size/cache size: 14203219 2573997 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: 45495 122628 168123
used/not used/entry size/cache size: 121780 8266828 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 33478214
1 22666807
2 8324531
3 2138085
4 423408
5 67668
6 9082
7 936
8 117
9 15
>= 10 1

Total processing time: 1m 7.207sec


BK_STOP 1679508177816

--------------------
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:13612 (206), effective:1641 (24)

initing FirstDep: 0m 0.000sec


iterations count:1630 (24), effective:153 (2)

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

iterations count:2401 (36), effective:296 (4)

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

iterations count:758 (11), effective:72 (1)

iterations count:281 (4), effective:25 (0)

iterations count:1116 (16), effective:107 (1)

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

iterations count:5200 (78), effective:562 (8)

iterations count:500 (7), effective:57 (0)

iterations count:1547 (23), effective:165 (2)

iterations count:1560 (23), effective:150 (2)

iterations count:1203 (18), effective:128 (1)

iterations count:1854 (28), effective:224 (3)

iterations count:1510 (22), effective:170 (2)

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

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

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

iterations count:1086 (16), effective:108 (1)

iterations count:936 (14), effective:94 (1)

iterations count:1343 (20), effective:147 (2)

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

iterations count:4440 (67), effective:468 (7)

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="ShieldPPPs-PT-001B"
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 ShieldPPPs-PT-001B, 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 r394-oct2-167903717800362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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