Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600202.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 22:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 22:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 22:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 22:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 24K 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 ShieldRVt-PT-002B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679346237341

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=ShieldRVt-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:04:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:04:00] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-20 21:04:00] [INFO ] Transformed 103 places.
[2023-03-20 21:04:00] [INFO ] Transformed 103 transitions.
[2023-03-20 21:04:00] [INFO ] Found NUPN structural information;
[2023-03-20 21:04:00] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 88 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 102
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 102
Applied a total of 2 rules in 20 ms. Remains 102 /103 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 102 cols
[2023-03-20 21:04:00] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-20 21:04:00] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-20 21:04:00] [INFO ] Invariant cache hit.
[2023-03-20 21:04:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-20 21:04:00] [INFO ] Invariant cache hit.
[2023-03-20 21:04:01] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/103 places, 102/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 102/103 places, 102/103 transitions.
Support contains 88 out of 102 places after structural reductions.
[2023-03-20 21:04:01] [INFO ] Flatten gal took : 40 ms
[2023-03-20 21:04:01] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:04:01] [INFO ] Input system was already deterministic with 102 transitions.
Incomplete random walk after 10000 steps, including 10 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 83) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 21:04:02] [INFO ] Invariant cache hit.
[2023-03-20 21:04:02] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 21:04:02] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-20 21:04:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 21:04:02] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-20 21:04:02] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
[2023-03-20 21:04:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
[2023-03-20 21:04:03] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2023-03-20 21:04:03] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2023-03-20 21:04:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-20 21:04:03] [INFO ] After 365ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-20 21:04:03] [INFO ] After 544ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 102/102 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 78
Reduce places removed 24 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 29 rules applied. Total rules applied 53 place count 78 transition count 73
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 59 place count 73 transition count 72
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 59 place count 73 transition count 62
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 79 place count 63 transition count 62
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 89 place count 53 transition count 52
Iterating global reduction 3 with 10 rules applied. Total rules applied 99 place count 53 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 99 place count 53 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 48 transition count 47
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 141 place count 32 transition count 31
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 28 transition count 33
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 28 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 27 transition count 31
Applied a total of 151 rules in 34 ms. Remains 27 /102 variables (removed 75) and now considering 31/102 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 27/102 places, 31/102 transitions.
Incomplete random walk after 10000 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished Best-First random walk after 3243 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1081 )
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 102 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 86 transition count 86
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 86 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 85 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 84 transition count 84
Applied a total of 36 rules in 9 ms. Remains 84 /102 variables (removed 18) and now considering 84/102 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 84/102 places, 84/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 17 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 90 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 90 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 89 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 89 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 88 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 88 transition count 88
Applied a total of 28 rules in 20 ms. Remains 88 /102 variables (removed 14) and now considering 88/102 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 88/102 places, 88/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 84 transition count 84
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 84 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 83 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 82 transition count 82
Applied a total of 40 rules in 20 ms. Remains 82 /102 variables (removed 20) and now considering 82/102 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 82/102 places, 82/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 88 transition count 88
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 88 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 87 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 87 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 86 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 86 transition count 86
Applied a total of 32 rules in 5 ms. Remains 86 /102 variables (removed 16) and now considering 86/102 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 86/102 places, 86/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 101 transition count 79
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 79 transition count 77
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 78 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 77 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 49 place count 77 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 69 place count 67 transition count 66
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 83 place count 53 transition count 52
Iterating global reduction 4 with 14 rules applied. Total rules applied 97 place count 53 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 97 place count 53 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 107 place count 48 transition count 47
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 4 with 24 rules applied. Total rules applied 131 place count 36 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 35 transition count 34
Applied a total of 132 rules in 24 ms. Remains 35 /102 variables (removed 67) and now considering 34/102 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 35/102 places, 34/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 81 transition count 81
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 79 transition count 79
Applied a total of 46 rules in 17 ms. Remains 79 /102 variables (removed 23) and now considering 79/102 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 79/102 places, 79/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 101 transition count 88
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 88 transition count 85
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 85 transition count 84
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 33 place count 85 transition count 72
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 57 place count 73 transition count 72
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 69 place count 61 transition count 60
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 61 transition count 60
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 61 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 59 transition count 58
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 105 place count 49 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 48 transition count 47
Applied a total of 106 rules in 22 ms. Remains 48 /102 variables (removed 54) and now considering 47/102 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 48/102 places, 47/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 101 transition count 73
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 73 transition count 71
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 61 place count 72 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 70 transition count 69
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 63 place count 70 transition count 60
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 81 place count 61 transition count 60
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 92 place count 50 transition count 49
Iterating global reduction 4 with 11 rules applied. Total rules applied 103 place count 50 transition count 49
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 103 place count 50 transition count 44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 113 place count 45 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 4 with 22 rules applied. Total rules applied 135 place count 34 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 33 transition count 32
Applied a total of 136 rules in 10 ms. Remains 33 /102 variables (removed 69) and now considering 32/102 (removed 70) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 33/102 places, 32/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 101 transition count 71
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 71 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 70 transition count 70
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 62 place count 70 transition count 61
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 80 place count 61 transition count 61
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 93 place count 48 transition count 48
Iterating global reduction 3 with 13 rules applied. Total rules applied 106 place count 48 transition count 48
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 106 place count 48 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 118 place count 42 transition count 42
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 146 place count 28 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 26 transition count 26
Applied a total of 148 rules in 14 ms. Remains 26 /102 variables (removed 76) and now considering 26/102 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 26/102 places, 26/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 26 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
FORMULA ShieldRVt-PT-002B-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 84 transition count 84
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 84 transition count 84
Applied a total of 36 rules in 2 ms. Remains 84 /102 variables (removed 18) and now considering 84/102 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 84/102 places, 84/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 82 transition count 82
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 80 transition count 80
Applied a total of 44 rules in 24 ms. Remains 80 /102 variables (removed 22) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 80/102 places, 80/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 101 transition count 69
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 69 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 68 transition count 67
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 67 place count 68 transition count 59
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 83 place count 60 transition count 59
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 97 place count 46 transition count 45
Iterating global reduction 3 with 14 rules applied. Total rules applied 111 place count 46 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 111 place count 46 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 121 place count 41 transition count 40
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 147 place count 28 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 25 transition count 25
Applied a total of 150 rules in 21 ms. Remains 25 /102 variables (removed 77) and now considering 25/102 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 25/102 places, 25/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
FORMULA ShieldRVt-PT-002B-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 82 transition count 82
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 80 transition count 80
Applied a total of 44 rules in 3 ms. Remains 80 /102 variables (removed 22) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/102 places, 80/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 87 transition count 87
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 87 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 86 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 86 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 85 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 85 transition count 85
Applied a total of 34 rules in 3 ms. Remains 85 /102 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 85/102 places, 85/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 15 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 82 transition count 82
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 80 transition count 80
Applied a total of 44 rules in 3 ms. Remains 80 /102 variables (removed 22) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 80/102 places, 80/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 102/102 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 82 transition count 82
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 80 transition count 80
Applied a total of 44 rules in 16 ms. Remains 80 /102 variables (removed 22) and now considering 80/102 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 80/102 places, 80/102 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:04:03] [INFO ] Input system was already deterministic with 80 transitions.
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:04:03] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:04:03] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 15 ms.
[2023-03-20 21:04:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 102 transitions and 240 arcs took 1 ms.
Total runtime 3685 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: 102 NrTr: 102 NrArc: 240)

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

net check time: 0m 0.000sec

init dd package: 0m 3.275sec


RS generation: 0m 0.202sec


-> reachability set: #nodes 11390 (1.1e+04) #states 151,962,013 (8)



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

checking: EG [EF [EX [EF [EX [[p37<=1 & 1<=p37]]]]]]
normalized: EG [E [true U EX [E [true U EX [[p37<=1 & 1<=p37]]]]]]

abstracting: (1<=p37)
states: 17,977,919 (7)
abstracting: (p37<=1)
states: 151,962,013 (8)
................
EG iterations: 14
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.379sec

checking: EX [[EX [AG [[p63<=0 & 0<=p63]]] & [EF [[p8<=1 & 1<=p8]] | [[p48<=1 & 1<=p48] & AX [[p77<=1 & 1<=p77]]]]]]
normalized: EX [[[[~ [EX [~ [[p77<=1 & 1<=p77]]]] & [p48<=1 & 1<=p48]] | E [true U [p8<=1 & 1<=p8]]] & EX [~ [E [true U ~ [[p63<=0 & 0<=p63]]]]]]]

abstracting: (0<=p63)
states: 151,962,013 (8)
abstracting: (p63<=0)
states: 137,927,426 (8)
.abstracting: (1<=p8)
states: 651,815 (5)
abstracting: (p8<=1)
states: 151,962,013 (8)
abstracting: (1<=p48)
states: 18,003,646 (7)
abstracting: (p48<=1)
states: 151,962,013 (8)
abstracting: (1<=p77)
states: 11,810,140 (7)
abstracting: (p77<=1)
states: 151,962,013 (8)
..-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.576sec

checking: AX [E [[[p8<=1 & 1<=p8] | AF [[AX [[p101<=1 & 1<=p101]] & [p1<=1 & 1<=p1]]]] U EG [[~ [A [[p101<=1 & 1<=p101] U [p36<=1 & 1<=p36]]] | AG [[p73<=1 & 1<=p73]]]]]]
normalized: ~ [EX [~ [E [[~ [EG [~ [[[p1<=1 & 1<=p1] & ~ [EX [~ [[p101<=1 & 1<=p101]]]]]]]] | [p8<=1 & 1<=p8]] U EG [[~ [E [true U ~ [[p73<=1 & 1<=p73]]]] | ~ [[~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p101<=1 & 1<=p101]] & ~ [[p36<=1 & 1<=p36]]]]]]]]]]]]]

abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
abstracting: (1<=p101)
states: 14,490 (4)
abstracting: (p101<=1)
states: 151,962,013 (8)
abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
.............................................................................................................
EG iterations: 109
abstracting: (1<=p73)
states: 16,825,772 (7)
abstracting: (p73<=1)
states: 151,962,013 (8)
.............................................................................................................
EG iterations: 109
abstracting: (1<=p8)
states: 651,815 (5)
abstracting: (p8<=1)
states: 151,962,013 (8)
abstracting: (1<=p101)
states: 14,490 (4)
abstracting: (p101<=1)
states: 151,962,013 (8)
.abstracting: (1<=p1)
states: 5,173 (3)
abstracting: (p1<=1)
states: 151,962,013 (8)

EG iterations: 0
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.068sec

checking: EG [EF [[EF [[p33<=1 & 1<=p33]] & [AF [[p36<=1 & 1<=p36]] | [[p3<=1 & 1<=p3] | [[p82<=1 & 1<=p82] & [[p6<=1 & 1<=p6] & [[p55<=1 & 1<=p55] | [p31<=1 & 1<=p31]]]]]]]]]
normalized: EG [E [true U [[[[[[[p31<=1 & 1<=p31] | [p55<=1 & 1<=p55]] & [p6<=1 & 1<=p6]] & [p82<=1 & 1<=p82]] | [p3<=1 & 1<=p3]] | ~ [EG [~ [[p36<=1 & 1<=p36]]]]] & E [true U [p33<=1 & 1<=p33]]]]]

abstracting: (1<=p33)
states: 15,379,733 (7)
abstracting: (p33<=1)
states: 151,962,013 (8)
abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
.............................................................................................................
EG iterations: 109
abstracting: (1<=p3)
states: 46,526,467 (7)
abstracting: (p3<=1)
states: 151,962,013 (8)
abstracting: (1<=p82)
states: 17,997,712 (7)
abstracting: (p82<=1)
states: 151,962,013 (8)
abstracting: (1<=p6)
states: 5,173 (3)
abstracting: (p6<=1)
states: 151,962,013 (8)
abstracting: (1<=p55)
states: 630
abstracting: (p55<=1)
states: 151,962,013 (8)
abstracting: (1<=p31)
states: 9,607,022 (6)
abstracting: (p31<=1)
states: 151,962,013 (8)
..................
EG iterations: 18
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.542sec

checking: [EF [[[p45<=1 & 1<=p45] | AX [EF [[p14<=1 & 1<=p14]]]]] & AG [A [~ [[[~ [[p78<=1 & 1<=p78]] & [[p47<=1 & 1<=p47] | [p63<=1 & 1<=p63]]] & [[p30<=1 & 1<=p30] & [p42<=1 & 1<=p42]]]] U [p35<=1 & 1<=p35]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [[[[p42<=1 & 1<=p42] & [p30<=1 & 1<=p30]] & [[[p63<=1 & 1<=p63] | [p47<=1 & 1<=p47]] & ~ [[p78<=1 & 1<=p78]]]] & ~ [[p35<=1 & 1<=p35]]]]]]]]] & E [true U [~ [EX [~ [E [true U [p14<=1 & 1<=p14]]]]] | [p45<=1 & 1<=p45]]]]

abstracting: (1<=p45)
states: 14,425,472 (7)
abstracting: (p45<=1)
states: 151,962,013 (8)
abstracting: (1<=p14)
states: 15,934,820 (7)
abstracting: (p14<=1)
states: 151,962,013 (8)
.abstracting: (1<=p35)
states: 17,977,919 (7)
abstracting: (p35<=1)
states: 151,962,013 (8)
abstracting: (1<=p78)
states: 11,810,140 (7)
abstracting: (p78<=1)
states: 151,962,013 (8)
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
abstracting: (1<=p63)
states: 14,034,587 (7)
abstracting: (p63<=1)
states: 151,962,013 (8)
abstracting: (1<=p30)
states: 263,823 (5)
abstracting: (p30<=1)
states: 151,962,013 (8)
abstracting: (1<=p42)
states: 356,937 (5)
abstracting: (p42<=1)
states: 151,962,013 (8)
abstracting: (1<=p35)
states: 17,977,919 (7)
abstracting: (p35<=1)
states: 151,962,013 (8)
abstracting: (1<=p35)
states: 17,977,919 (7)
abstracting: (p35<=1)
states: 151,962,013 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.774sec

checking: E [[[EF [[EF [[p101<=1 & 1<=p101]] & [~ [[p79<=1 & 1<=p79]] & ~ [[p20<=1 & 1<=p20]]]]] | [p65<=1 & 1<=p65]] | [[p71<=1 & 1<=p71] | [[p74<=1 & 1<=p74] & EX [AX [[p47<=1 & 1<=p47]]]]]] U [[p2<=1 & 1<=p2] & [p34<=1 & 1<=p34]]]
normalized: E [[[[EX [~ [EX [~ [[p47<=1 & 1<=p47]]]]] & [p74<=1 & 1<=p74]] | [p71<=1 & 1<=p71]] | [[p65<=1 & 1<=p65] | E [true U [[~ [[p20<=1 & 1<=p20]] & ~ [[p79<=1 & 1<=p79]]] & E [true U [p101<=1 & 1<=p101]]]]]] U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]

abstracting: (1<=p2)
states: 55,175,011 (7)
abstracting: (p2<=1)
states: 151,962,013 (8)
abstracting: (1<=p34)
states: 17,977,919 (7)
abstracting: (p34<=1)
states: 151,962,013 (8)
abstracting: (1<=p101)
states: 14,490 (4)
abstracting: (p101<=1)
states: 151,962,013 (8)
abstracting: (1<=p79)
states: 10,710 (4)
abstracting: (p79<=1)
states: 151,962,013 (8)
abstracting: (1<=p20)
states: 5,495,900 (6)
abstracting: (p20<=1)
states: 151,962,013 (8)
abstracting: (1<=p65)
states: 12,298,376 (7)
abstracting: (p65<=1)
states: 151,962,013 (8)
abstracting: (1<=p71)
states: 13,785,472 (7)
abstracting: (p71<=1)
states: 151,962,013 (8)
abstracting: (1<=p74)
states: 16,825,772 (7)
abstracting: (p74<=1)
states: 151,962,013 (8)
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
..-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.490sec

checking: EF [[[E [[[p81<=1 & 1<=p81] & ~ [[p20<=1 & 1<=p20]]] U EG [[p91<=1 & 1<=p91]]] & [p18<=1 & 1<=p18]] & [[p24<=1 & 1<=p24] & [[p39<=1 & 1<=p39] & [AG [[p47<=0 & 0<=p47]] | ~ [A [[p87<=1 & 1<=p87] U [p75<=1 & 1<=p75]]]]]]]]
normalized: E [true U [[[[~ [[~ [EG [~ [[p75<=1 & 1<=p75]]]] & ~ [E [~ [[p75<=1 & 1<=p75]] U [~ [[p87<=1 & 1<=p87]] & ~ [[p75<=1 & 1<=p75]]]]]]] | ~ [E [true U ~ [[p47<=0 & 0<=p47]]]]] & [p39<=1 & 1<=p39]] & [p24<=1 & 1<=p24]] & [[p18<=1 & 1<=p18] & E [[~ [[p20<=1 & 1<=p20]] & [p81<=1 & 1<=p81]] U EG [[p91<=1 & 1<=p91]]]]]]

abstracting: (1<=p91)
states: 14,490 (4)
abstracting: (p91<=1)
states: 151,962,013 (8)
.............................
EG iterations: 29
abstracting: (1<=p81)
states: 17,976,518 (7)
abstracting: (p81<=1)
states: 151,962,013 (8)
abstracting: (1<=p20)
states: 5,495,900 (6)
abstracting: (p20<=1)
states: 151,962,013 (8)
abstracting: (1<=p18)
states: 16,436,575 (7)
abstracting: (p18<=1)
states: 151,962,013 (8)
abstracting: (1<=p24)
states: 17,657,698 (7)
abstracting: (p24<=1)
states: 151,962,013 (8)
abstracting: (1<=p39)
states: 18,785,911 (7)
abstracting: (p39<=1)
states: 151,962,013 (8)
abstracting: (0<=p47)
states: 151,962,013 (8)
abstracting: (p47<=0)
states: 133,958,367 (8)
abstracting: (1<=p75)
states: 16,825,772 (7)
abstracting: (p75<=1)
states: 151,962,013 (8)
abstracting: (1<=p87)
states: 17,734,642 (7)
abstracting: (p87<=1)
states: 151,962,013 (8)
abstracting: (1<=p75)
states: 16,825,772 (7)
abstracting: (p75<=1)
states: 151,962,013 (8)
abstracting: (1<=p75)
states: 16,825,772 (7)
abstracting: (p75<=1)
states: 151,962,013 (8)
.............................................................................
EG iterations: 77
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.166sec

checking: EG [AX [[AG [[p25<=1 & 1<=p25]] | [~ [A [[[p13<=1 & 1<=p13] & [[p66<=1 & 1<=p66] & [p100<=1 & 1<=p100]]] U [p84<=1 & 1<=p84]]] & [[p11<=0 & 0<=p11] & [[p4<=0 & 0<=p4] | [[p18<=0 & 0<=p18] | [p51<=0 & 0<=p51]]]]]]]]
normalized: EG [~ [EX [~ [[[[[[[p18<=0 & 0<=p18] | [p51<=0 & 0<=p51]] | [p4<=0 & 0<=p4]] & [p11<=0 & 0<=p11]] & ~ [[~ [EG [~ [[p84<=1 & 1<=p84]]]] & ~ [E [~ [[p84<=1 & 1<=p84]] U [~ [[[[p100<=1 & 1<=p100] & [p66<=1 & 1<=p66]] & [p13<=1 & 1<=p13]]] & ~ [[p84<=1 & 1<=p84]]]]]]]] | ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]]]]]]

abstracting: (1<=p25)
states: 17,657,698 (7)
abstracting: (p25<=1)
states: 151,962,013 (8)
abstracting: (1<=p84)
states: 17,976,518 (7)
abstracting: (p84<=1)
states: 151,962,013 (8)
abstracting: (1<=p13)
states: 15,934,820 (7)
abstracting: (p13<=1)
states: 151,962,013 (8)
abstracting: (1<=p66)
states: 14,558,558 (7)
abstracting: (p66<=1)
states: 151,962,013 (8)
abstracting: (1<=p100)
states: 18,629,718 (7)
abstracting: (p100<=1)
states: 151,962,013 (8)
abstracting: (1<=p84)
states: 17,976,518 (7)
abstracting: (p84<=1)
states: 151,962,013 (8)
abstracting: (1<=p84)
states: 17,976,518 (7)
abstracting: (p84<=1)
states: 151,962,013 (8)
.
EG iterations: 1
abstracting: (0<=p11)
states: 151,962,013 (8)
abstracting: (p11<=0)
states: 136,027,193 (8)
abstracting: (0<=p4)
states: 151,962,013 (8)
abstracting: (p4<=0)
states: 101,706,652 (8)
abstracting: (0<=p51)
states: 151,962,013 (8)
abstracting: (p51<=0)
states: 133,136,142 (8)
abstracting: (0<=p18)
states: 151,962,013 (8)
abstracting: (p18<=0)
states: 135,525,438 (8)
...........................................................................................
EG iterations: 90
-> the formula is FALSE

FORMULA ShieldRVt-PT-002B-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.036sec

checking: EG [[[EF [EX [[0<=p59 & p59<=0]]] | ~ [A [~ [[p52<=1 & 1<=p52]] U [[p71<=1 & 1<=p71] | [p29<=1 & 1<=p29]]]]] | [EX [[p74<=0 & 0<=p74]] | [EG [[p99<=0 & 0<=p99]] & [A [[p85<=1 & 1<=p85] U [p47<=1 & 1<=p47]] | [[p29<=1 & 1<=p29] | [p89<=1 & 1<=p89]]]]]]]
normalized: EG [[[E [true U EX [[0<=p59 & p59<=0]]] | ~ [[~ [EG [~ [[[p29<=1 & 1<=p29] | [p71<=1 & 1<=p71]]]]] & ~ [E [~ [[[p29<=1 & 1<=p29] | [p71<=1 & 1<=p71]]] U [[p52<=1 & 1<=p52] & ~ [[[p29<=1 & 1<=p29] | [p71<=1 & 1<=p71]]]]]]]]] | [[[[[p89<=1 & 1<=p89] | [p29<=1 & 1<=p29]] | [~ [EG [~ [[p47<=1 & 1<=p47]]]] & ~ [E [~ [[p47<=1 & 1<=p47]] U [~ [[p85<=1 & 1<=p85]] & ~ [[p47<=1 & 1<=p47]]]]]]] & EG [[p99<=0 & 0<=p99]]] | EX [[p74<=0 & 0<=p74]]]]]

abstracting: (0<=p74)
states: 151,962,013 (8)
abstracting: (p74<=0)
states: 135,136,241 (8)
.abstracting: (0<=p99)
states: 151,962,013 (8)
abstracting: (p99<=0)
states: 134,282,293 (8)
..................................
EG iterations: 34
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
abstracting: (1<=p85)
states: 17,976,518 (7)
abstracting: (p85<=1)
states: 151,962,013 (8)
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
.
EG iterations: 1
abstracting: (1<=p29)
states: 13,550,762 (7)
abstracting: (p29<=1)
states: 151,962,013 (8)
abstracting: (1<=p89)
states: 10,710 (4)
abstracting: (p89<=1)
states: 151,962,013 (8)
abstracting: (1<=p71)
states: 13,785,472 (7)
abstracting: (p71<=1)
states: 151,962,013 (8)
abstracting: (1<=p29)
states: 13,550,762 (7)
abstracting: (p29<=1)
states: 151,962,013 (8)
abstracting: (1<=p52)
states: 356,937 (5)
abstracting: (p52<=1)
states: 151,962,013 (8)
abstracting: (1<=p71)
states: 13,785,472 (7)
abstracting: (p71<=1)
states: 151,962,013 (8)
abstracting: (1<=p29)
states: 13,550,762 (7)
abstracting: (p29<=1)
states: 151,962,013 (8)
abstracting: (1<=p71)
states: 13,785,472 (7)
abstracting: (p71<=1)
states: 151,962,013 (8)
abstracting: (1<=p29)
states: 13,550,762 (7)
abstracting: (p29<=1)
states: 151,962,013 (8)
......................................................................
EG iterations: 70
abstracting: (p59<=0)
states: 137,927,426 (8)
abstracting: (0<=p59)
states: 151,962,013 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.449sec

checking: ~ [A [EX [[[[AX [[p49<=1 & 1<=p49]] | [[p87<=1 & 1<=p87] & [p60<=1 & 1<=p60]]] & A [AX [[[p66<=1 & 1<=p66] & [[p72<=1 & 1<=p72] & [p88<=1 & 1<=p88]]]] U [p30<=1 & 1<=p30]]] & [[p41<=1 & 1<=p41] & [[p74<=1 & 1<=p74] & [[p21<=1 & 1<=p21] | [p58<=1 & 1<=p58]]]]]] U EX [[p36<=1 & 1<=p36]]]]
normalized: ~ [[~ [EG [~ [EX [[p36<=1 & 1<=p36]]]]] & ~ [E [~ [EX [[p36<=1 & 1<=p36]]] U [~ [EX [[[[[[p58<=1 & 1<=p58] | [p21<=1 & 1<=p21]] & [p74<=1 & 1<=p74]] & [p41<=1 & 1<=p41]] & [[~ [EG [~ [[p30<=1 & 1<=p30]]]] & ~ [E [~ [[p30<=1 & 1<=p30]] U [EX [~ [[[[p88<=1 & 1<=p88] & [p72<=1 & 1<=p72]] & [p66<=1 & 1<=p66]]]] & ~ [[p30<=1 & 1<=p30]]]]]] & [[[p60<=1 & 1<=p60] & [p87<=1 & 1<=p87]] | ~ [EX [~ [[p49<=1 & 1<=p49]]]]]]]]] & ~ [EX [[p36<=1 & 1<=p36]]]]]]]]

abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
.abstracting: (1<=p49)
states: 18,003,646 (7)
abstracting: (p49<=1)
states: 151,962,013 (8)
.abstracting: (1<=p87)
states: 17,734,642 (7)
abstracting: (p87<=1)
states: 151,962,013 (8)
abstracting: (1<=p60)
states: 14,034,587 (7)
abstracting: (p60<=1)
states: 151,962,013 (8)
abstracting: (1<=p30)
states: 263,823 (5)
abstracting: (p30<=1)
states: 151,962,013 (8)
abstracting: (1<=p66)
states: 14,558,558 (7)
abstracting: (p66<=1)
states: 151,962,013 (8)
abstracting: (1<=p72)
states: 16,825,772 (7)
abstracting: (p72<=1)
states: 151,962,013 (8)
abstracting: (1<=p88)
states: 18,202,646 (7)
abstracting: (p88<=1)
states: 151,962,013 (8)
.abstracting: (1<=p30)
states: 263,823 (5)
abstracting: (p30<=1)
states: 151,962,013 (8)
abstracting: (1<=p30)
states: 263,823 (5)
abstracting: (p30<=1)
states: 151,962,013 (8)
..........................
EG iterations: 26
abstracting: (1<=p41)
states: 263,823 (5)
abstracting: (p41<=1)
states: 151,962,013 (8)
abstracting: (1<=p74)
states: 16,825,772 (7)
abstracting: (p74<=1)
states: 151,962,013 (8)
abstracting: (1<=p21)
states: 13,550,762 (7)
abstracting: (p21<=1)
states: 151,962,013 (8)
abstracting: (1<=p58)
states: 9,771,634 (6)
abstracting: (p58<=1)
states: 151,962,013 (8)
.abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
.abstracting: (1<=p36)
states: 17,977,919 (7)
abstracting: (p36<=1)
states: 151,962,013 (8)
.............................................................................................................
EG iterations: 108
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.697sec

checking: [[AG [AF [[p94<=1 & 1<=p94]]] | AX [[p92<=0 & 0<=p92]]] & [EF [[p74<=1 & 1<=p74]] | [A [[[~ [[p65<=1 & 1<=p65]] | [EX [[p63<=1 & 1<=p63]] | EX [[p37<=1 & 1<=p37]]]] & [p23<=1 & 1<=p23]] U [p9<=1 & 1<=p9]] & AF [[AX [[p33<=1 & 1<=p33]] & [[[[p58<=1 & 1<=p58] | [p77<=1 & 1<=p77]] & [[p31<=1 & 1<=p31] | [p78<=1 & 1<=p78]]] | EX [[p25<=1 & 1<=p25]]]]]]]]
normalized: [[[[~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[[p23<=1 & 1<=p23] & [[EX [[p37<=1 & 1<=p37]] | EX [[p63<=1 & 1<=p63]]] | ~ [[p65<=1 & 1<=p65]]]]] & ~ [[p9<=1 & 1<=p9]]]]] & ~ [EG [~ [[p9<=1 & 1<=p9]]]]] & ~ [EG [~ [[[EX [[p25<=1 & 1<=p25]] | [[[p78<=1 & 1<=p78] | [p31<=1 & 1<=p31]] & [[p77<=1 & 1<=p77] | [p58<=1 & 1<=p58]]]] & ~ [EX [~ [[p33<=1 & 1<=p33]]]]]]]]] | E [true U [p74<=1 & 1<=p74]]] & [~ [EX [~ [[p92<=0 & 0<=p92]]]] | ~ [E [true U EG [~ [[p94<=1 & 1<=p94]]]]]]]

abstracting: (1<=p94)
states: 13,499,616 (7)
abstracting: (p94<=1)
states: 151,962,013 (8)
..............................................................................
EG iterations: 78
abstracting: (0<=p92)
states: 151,962,013 (8)
abstracting: (p92<=0)
states: 141,307,395 (8)
.abstracting: (1<=p74)
states: 16,825,772 (7)
abstracting: (p74<=1)
states: 151,962,013 (8)
abstracting: (1<=p33)
states: 15,379,733 (7)
abstracting: (p33<=1)
states: 151,962,013 (8)
.abstracting: (1<=p58)
states: 9,771,634 (6)
abstracting: (p58<=1)
states: 151,962,013 (8)
abstracting: (1<=p77)
states: 11,810,140 (7)
abstracting: (p77<=1)
states: 151,962,013 (8)
abstracting: (1<=p31)
states: 9,607,022 (6)
abstracting: (p31<=1)
states: 151,962,013 (8)
abstracting: (1<=p78)
states: 11,810,140 (7)
abstracting: (p78<=1)
states: 151,962,013 (8)
abstracting: (1<=p25)
states: 17,657,698 (7)
abstracting: (p25<=1)
states: 151,962,013 (8)
.
EG iterations: 0
abstracting: (1<=p9)
states: 5,495,900 (6)
abstracting: (p9<=1)
states: 151,962,013 (8)
............................
EG iterations: 28
abstracting: (1<=p9)
states: 5,495,900 (6)
abstracting: (p9<=1)
states: 151,962,013 (8)
abstracting: (1<=p65)
states: 12,298,376 (7)
abstracting: (p65<=1)
states: 151,962,013 (8)
abstracting: (1<=p63)
states: 14,034,587 (7)
abstracting: (p63<=1)
states: 151,962,013 (8)
.abstracting: (1<=p37)
states: 17,977,919 (7)
abstracting: (p37<=1)
states: 151,962,013 (8)
.abstracting: (1<=p23)
states: 16,441,565 (7)
abstracting: (p23<=1)
states: 151,962,013 (8)
abstracting: (1<=p9)
states: 5,495,900 (6)
abstracting: (p9<=1)
states: 151,962,013 (8)
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.654sec

checking: EF [[[EX [[[p85<=1 & 1<=p85] & AG [[p23<=1 & 1<=p23]]]] & [p26<=1 & 1<=p26]] | [[[EG [[[p43<=1 & 1<=p43] | [p19<=1 & 1<=p19]]] | [EX [[p38<=1 & 1<=p38]] | [p59<=1 & 1<=p59]]] & [EG [[p42<=1 & 1<=p42]] | E [[p93<=1 & 1<=p93] U [p74<=1 & 1<=p74]]]] & [[[p45<=0 & 0<=p45] | EF [[[p81<=1 & 1<=p81] | [p6<=1 & 1<=p6]]]] & [[p101<=1 & 1<=p101] | [EX [[p101<=1 & 1<=p101]] & [[p7<=1 & 1<=p7] & [p85<=1 & 1<=p85]]]]]]]]
normalized: E [true U [[[[[[[p85<=1 & 1<=p85] & [p7<=1 & 1<=p7]] & EX [[p101<=1 & 1<=p101]]] | [p101<=1 & 1<=p101]] & [E [true U [[p6<=1 & 1<=p6] | [p81<=1 & 1<=p81]]] | [p45<=0 & 0<=p45]]] & [[E [[p93<=1 & 1<=p93] U [p74<=1 & 1<=p74]] | EG [[p42<=1 & 1<=p42]]] & [[[p59<=1 & 1<=p59] | EX [[p38<=1 & 1<=p38]]] | EG [[[p19<=1 & 1<=p19] | [p43<=1 & 1<=p43]]]]]] | [[p26<=1 & 1<=p26] & EX [[~ [E [true U ~ [[p23<=1 & 1<=p23]]]] & [p85<=1 & 1<=p85]]]]]]

abstracting: (1<=p85)
states: 17,976,518 (7)
abstracting: (p85<=1)
states: 151,962,013 (8)
abstracting: (1<=p23)
states: 16,441,565 (7)
abstracting: (p23<=1)
states: 151,962,013 (8)
.abstracting: (1<=p26)
states: 17,657,698 (7)
abstracting: (p26<=1)
states: 151,962,013 (8)
abstracting: (1<=p43)
states: 12,269,124 (7)
abstracting: (p43<=1)
states: 151,962,013 (8)
abstracting: (1<=p19)
states: 5,495,900 (6)
abstracting: (p19<=1)
states: 151,962,013 (8)
...............................................................................
EG iterations: 79
abstracting: (1<=p38)
states: 17,477,244 (7)
abstracting: (p38<=1)
states: 151,962,013 (8)
.abstracting: (1<=p59)
states: 14,034,587 (7)
abstracting: (p59<=1)
states: 151,962,013 (8)
abstracting: (1<=p42)
states: 356,937 (5)
abstracting: (p42<=1)
states: 151,962,013 (8)
................................
EG iterations: 32
abstracting: (1<=p74)
states: 16,825,772 (7)
abstracting: (p74<=1)
states: 151,962,013 (8)
abstracting: (1<=p93)
states: 18,293,788 (7)
abstracting: (p93<=1)
states: 151,962,013 (8)
abstracting: (0<=p45)
states: 151,962,013 (8)
abstracting: (p45<=0)
states: 137,536,541 (8)
abstracting: (1<=p81)
states: 17,976,518 (7)
abstracting: (p81<=1)
states: 151,962,013 (8)
abstracting: (1<=p6)
states: 5,173 (3)
abstracting: (p6<=1)
states: 151,962,013 (8)
abstracting: (1<=p101)
states: 14,490 (4)
abstracting: (p101<=1)
states: 151,962,013 (8)
abstracting: (1<=p101)
states: 14,490 (4)
abstracting: (p101<=1)
states: 151,962,013 (8)
.abstracting: (1<=p7)
states: 15,519 (4)
abstracting: (p7<=1)
states: 151,962,013 (8)
abstracting: (1<=p85)
states: 17,976,518 (7)
abstracting: (p85<=1)
states: 151,962,013 (8)
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.272sec

checking: E [[[E [[EG [[p74<=1 & 1<=p74]] | [[[p39<=1 & 1<=p39] & [[p51<=1 & 1<=p51] & [p83<=1 & 1<=p83]]] | [p17<=1 & 1<=p17]]] U EG [[p65<=1 & 1<=p65]]] | [p69<=1 & 1<=p69]] | [[p47<=1 & 1<=p47] | [~ [[p38<=1 & 1<=p38]] & ~ [[[p64<=1 & 1<=p64] | [p55<=1 & 1<=p55]]]]]] U ~ [A [[~ [[AF [[p86<=1 & 1<=p86]] | [[p88<=1 & 1<=p88] & [p100<=1 & 1<=p100]]]] | ~ [[[p96<=1 & 1<=p96] | [p63<=1 & 1<=p63]]]] U AG [[AG [[p70<=1 & 1<=p70]] | [[p19<=1 & 1<=p19] | [p73<=1 & 1<=p73]]]]]]]
normalized: E [[[[~ [[[p55<=1 & 1<=p55] | [p64<=1 & 1<=p64]]] & ~ [[p38<=1 & 1<=p38]]] | [p47<=1 & 1<=p47]] | [[p69<=1 & 1<=p69] | E [[[[p17<=1 & 1<=p17] | [[[p83<=1 & 1<=p83] & [p51<=1 & 1<=p51]] & [p39<=1 & 1<=p39]]] | EG [[p74<=1 & 1<=p74]]] U EG [[p65<=1 & 1<=p65]]]]] U ~ [[~ [EG [E [true U ~ [[[[p73<=1 & 1<=p73] | [p19<=1 & 1<=p19]] | ~ [E [true U ~ [[p70<=1 & 1<=p70]]]]]]]]] & ~ [E [E [true U ~ [[[[p73<=1 & 1<=p73] | [p19<=1 & 1<=p19]] | ~ [E [true U ~ [[p70<=1 & 1<=p70]]]]]]] U [~ [[~ [[[p63<=1 & 1<=p63] | [p96<=1 & 1<=p96]]] | ~ [[[[p100<=1 & 1<=p100] & [p88<=1 & 1<=p88]] | ~ [EG [~ [[p86<=1 & 1<=p86]]]]]]]] & E [true U ~ [[[[p73<=1 & 1<=p73] | [p19<=1 & 1<=p19]] | ~ [E [true U ~ [[p70<=1 & 1<=p70]]]]]]]]]]]]]

abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p19)
states: 5,495,900 (6)
abstracting: (p19<=1)
states: 151,962,013 (8)
abstracting: (1<=p73)
states: 16,825,772 (7)
abstracting: (p73<=1)
states: 151,962,013 (8)
abstracting: (1<=p86)
states: 17,976,518 (7)
abstracting: (p86<=1)
states: 151,962,013 (8)
..........................................................
EG iterations: 58
abstracting: (1<=p88)
states: 18,202,646 (7)
abstracting: (p88<=1)
states: 151,962,013 (8)
abstracting: (1<=p100)
states: 18,629,718 (7)
abstracting: (p100<=1)
states: 151,962,013 (8)
abstracting: (1<=p96)
states: 18,293,788 (7)
abstracting: (p96<=1)
states: 151,962,013 (8)
abstracting: (1<=p63)
states: 14,034,587 (7)
abstracting: (p63<=1)
states: 151,962,013 (8)
abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p19)
states: 5,495,900 (6)
abstracting: (p19<=1)
states: 151,962,013 (8)
abstracting: (1<=p73)
states: 16,825,772 (7)
abstracting: (p73<=1)
states: 151,962,013 (8)
abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p19)
states: 5,495,900 (6)
abstracting: (p19<=1)
states: 151,962,013 (8)
abstracting: (1<=p73)
states: 16,825,772 (7)
abstracting: (p73<=1)
states: 151,962,013 (8)

EG iterations: 0
abstracting: (1<=p65)
states: 12,298,376 (7)
abstracting: (p65<=1)
states: 151,962,013 (8)
...........................................
EG iterations: 43
abstracting: (1<=p74)
states: 16,825,772 (7)
abstracting: (p74<=1)
states: 151,962,013 (8)
................................................
EG iterations: 48
abstracting: (1<=p39)
states: 18,785,911 (7)
abstracting: (p39<=1)
states: 151,962,013 (8)
abstracting: (1<=p51)
states: 18,825,871 (7)
abstracting: (p51<=1)
states: 151,962,013 (8)
abstracting: (1<=p83)
states: 17,976,518 (7)
abstracting: (p83<=1)
states: 151,962,013 (8)
abstracting: (1<=p17)
states: 15,314,000 (7)
abstracting: (p17<=1)
states: 151,962,013 (8)
abstracting: (1<=p69)
states: 11,810,140 (7)
abstracting: (p69<=1)
states: 151,962,013 (8)
abstracting: (1<=p47)
states: 18,003,646 (7)
abstracting: (p47<=1)
states: 151,962,013 (8)
abstracting: (1<=p38)
states: 17,477,244 (7)
abstracting: (p38<=1)
states: 151,962,013 (8)
abstracting: (1<=p64)
states: 14,034,587 (7)
abstracting: (p64<=1)
states: 151,962,013 (8)
abstracting: (1<=p55)
states: 630
abstracting: (p55<=1)
states: 151,962,013 (8)
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.531sec

checking: EG [[[[p77<=0 & 0<=p77] | A [[[A [[p32<=1 & 1<=p32] U [p87<=1 & 1<=p87]] | ~ [[p1<=1 & 1<=p1]]] & [[[p42<=1 & 1<=p42] | [p31<=1 & 1<=p31]] & [p98<=1 & 1<=p98]]] U E [AX [[p86<=1 & 1<=p86]] U ~ [[p70<=1 & 1<=p70]]]]] | [[A [[[p3<=1 & 1<=p3] | [p50<=1 & 1<=p50]] U [p41<=1 & 1<=p41]] & EX [[p20<=1 & 1<=p20]]] | [[p5<=1 & 1<=p5] & [EG [[AF [[p5<=1 & 1<=p5]] & [[p2<=1 & 1<=p2] & [p34<=1 & 1<=p34]]]] & [[[p56<=0 & 0<=p56] & [[p76<=0 & 0<=p76] | [[p95<=0 & 0<=p95] | [p20<=0 & 0<=p20]]]] | [[p64<=0 & 0<=p64] & EX [[p97<=0 & 0<=p97]]]]]]]]]
normalized: EG [[[[[[[EX [[p97<=0 & 0<=p97]] & [p64<=0 & 0<=p64]] | [[[[p20<=0 & 0<=p20] | [p95<=0 & 0<=p95]] | [p76<=0 & 0<=p76]] & [p56<=0 & 0<=p56]]] & EG [[[[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]] & ~ [EG [~ [[p5<=1 & 1<=p5]]]]]]] & [p5<=1 & 1<=p5]] | [EX [[p20<=1 & 1<=p20]] & [~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [~ [[[p50<=1 & 1<=p50] | [p3<=1 & 1<=p3]]] & ~ [[p41<=1 & 1<=p41]]]]]]]] | [[~ [EG [~ [E [~ [EX [~ [[p86<=1 & 1<=p86]]]] U ~ [[p70<=1 & 1<=p70]]]]]] & ~ [E [~ [E [~ [EX [~ [[p86<=1 & 1<=p86]]]] U ~ [[p70<=1 & 1<=p70]]]] U [~ [[[[p98<=1 & 1<=p98] & [[p31<=1 & 1<=p31] | [p42<=1 & 1<=p42]]] & [~ [[p1<=1 & 1<=p1]] | [~ [EG [~ [[p87<=1 & 1<=p87]]]] & ~ [E [~ [[p87<=1 & 1<=p87]] U [~ [[p32<=1 & 1<=p32]] & ~ [[p87<=1 & 1<=p87]]]]]]]]] & ~ [E [~ [EX [~ [[p86<=1 & 1<=p86]]]] U ~ [[p70<=1 & 1<=p70]]]]]]]] | [p77<=0 & 0<=p77]]]]

abstracting: (0<=p77)
states: 151,962,013 (8)
abstracting: (p77<=0)
states: 140,151,873 (8)
abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p86)
states: 17,976,518 (7)
abstracting: (p86<=1)
states: 151,962,013 (8)
.abstracting: (1<=p87)
states: 17,734,642 (7)
abstracting: (p87<=1)
states: 151,962,013 (8)
abstracting: (1<=p32)
states: 17,977,919 (7)
abstracting: (p32<=1)
states: 151,962,013 (8)
abstracting: (1<=p87)
states: 17,734,642 (7)
abstracting: (p87<=1)
states: 151,962,013 (8)
abstracting: (1<=p87)
states: 17,734,642 (7)
abstracting: (p87<=1)
states: 151,962,013 (8)
..................................
EG iterations: 34
abstracting: (1<=p1)
states: 5,173 (3)
abstracting: (p1<=1)
states: 151,962,013 (8)
abstracting: (1<=p42)
states: 356,937 (5)
abstracting: (p42<=1)
states: 151,962,013 (8)
abstracting: (1<=p31)
states: 9,607,022 (6)
abstracting: (p31<=1)
states: 151,962,013 (8)
abstracting: (1<=p98)
states: 18,293,788 (7)
abstracting: (p98<=1)
states: 151,962,013 (8)
abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p86)
states: 17,976,518 (7)
abstracting: (p86<=1)
states: 151,962,013 (8)
.abstracting: (1<=p70)
states: 16,825,772 (7)
abstracting: (p70<=1)
states: 151,962,013 (8)
abstracting: (1<=p86)
states: 17,976,518 (7)
abstracting: (p86<=1)
states: 151,962,013 (8)
.................................................
EG iterations: 48
abstracting: (1<=p41)
states: 263,823 (5)
abstracting: (p41<=1)
states: 151,962,013 (8)
abstracting: (1<=p3)
states: 46,526,467 (7)
abstracting: (p3<=1)
states: 151,962,013 (8)
abstracting: (1<=p50)
states: 15,693,922 (7)
abstracting: (p50<=1)
states: 151,962,013 (8)
abstracting: (1<=p41)
states: 263,823 (5)
abstracting: (p41<=1)
states: 151,962,013 (8)
abstracting: (1<=p41)
states: 263,823 (5)
abstracting: (p41<=1)
states: 151,962,013 (8)
..................................
EG iterations: 34
abstracting: (1<=p20)
states: 5,495,900 (6)
abstracting: (p20<=1)
states: 151,962,013 (8)
.abstracting: (1<=p5)
states: 5,173 (3)
abstracting: (p5<=1)
states: 151,962,013 (8)
abstracting: (1<=p5)
states: 5,173 (3)
abstracting: (p5<=1)
states: 151,962,013 (8)
.....................
EG iterations: 21
abstracting: (1<=p2)
states: 55,175,011 (7)
abstracting: (p2<=1)
states: 151,962,013 (8)
abstracting: (1<=p34)
states: 17,977,919 (7)
abstracting: (p34<=1)
states: 151,962,013 (8)
.
EG iterations: 1
abstracting: (0<=p56)
states: 151,962,013 (8)
abstracting: (p56<=0)
states: 150,942,582 (8)
abstracting: (0<=p76)
states: 151,962,013 (8)
abstracting: (p76<=0)
states: 134,365,234 (8)
abstracting: (0<=p95)
states: 151,962,013 (8)
abstracting: (p95<=0)
states: 133,668,225 (8)
abstracting: (0<=p20)
states: 151,962,013 (8)
abstracting: (p20<=0)
states: 146,466,113 (8)
abstracting: (0<=p64)
states: 151,962,013 (8)
abstracting: (p64<=0)
states: 137,927,426 (8)
abstracting: (0<=p97)
states: 151,962,013 (8)
abstracting: (p97<=0)
states: 133,668,225 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002B-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.957sec

totally nodes used: 38305288 (3.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 36993546 82603229 119596775
used/not used/entry size/cache size: 55713871 11394993 16 1024MB
basic ops cache: hits/miss/sum: 6651546 13419098 20070644
used/not used/entry size/cache size: 13084691 3692525 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: 52431 167009 219440
used/not used/entry size/cache size: 165316 8223292 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 38815418
1 20345420
2 6233232
3 1415200
4 256206
5 37991
6 4814
7 529
8 49
9 4
>= 10 1

Total processing time: 1m 3.367sec


BK_STOP 1679346307807

--------------------
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:6568 (64), effective:1009 (9)

initing FirstDep: 0m 0.000sec


iterations count:1633 (16), effective:190 (1)

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

iterations count:2009 (19), effective:245 (2)

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

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

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

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

iterations count:1876 (18), effective:219 (2)

iterations count:1592 (15), effective:185 (1)

iterations count:1655 (16), effective:193 (1)

iterations count:1078 (10), effective:124 (1)

iterations count:591 (5), effective:50 (0)

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

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

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

iterations count:1191 (11), effective:144 (1)

iterations count:1619 (15), effective:194 (1)

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

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

iterations count:396 (3), effective:36 (0)

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

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

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

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

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

iterations count:571 (5), effective:53 (0)

iterations count:2296 (22), effective:273 (2)

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

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

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

iterations count:2031 (19), effective:241 (2)

iterations count:156 (1), effective:11 (0)

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

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

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

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

iterations count:3792 (37), effective:506 (4)

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

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

iterations count:1642 (16), effective:210 (2)

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

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

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

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

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

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

iterations count:107 (1), effective:2 (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="ShieldRVt-PT-002B"
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 ShieldRVt-PT-002B, 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 r426-tajo-167905978600202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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