fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r394-oct2-167903717400010
Last Updated
May 14, 2023

About the Execution of Marcie+red for ShieldIIPs-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5750.056 17145.00 27556.00 45.50 FFTFFFTTFTTTTFFF normal

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-167903717400010.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 ShieldIIPs-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-167903717400010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.9K Feb 25 15:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 15:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 15:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:42 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.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 15:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 17K 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 ShieldIIPs-PT-001B-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-001B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679484458127

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=ShieldIIPs-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:27:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:27:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:27:41] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-22 11:27:41] [INFO ] Transformed 63 places.
[2023-03-22 11:27:41] [INFO ] Transformed 62 transitions.
[2023-03-22 11:27:41] [INFO ] Found NUPN structural information;
[2023-03-22 11:27:41] [INFO ] Parsed PT model containing 63 places and 62 transitions and 184 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 48 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 26 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 63 cols
[2023-03-22 11:27:41] [INFO ] Computed 10 place invariants in 11 ms
[2023-03-22 11:27:42] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-22 11:27:42] [INFO ] Invariant cache hit.
[2023-03-22 11:27:42] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-22 11:27:42] [INFO ] Invariant cache hit.
[2023-03-22 11:27:42] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1090 ms. Remains : 63/63 places, 62/62 transitions.
Support contains 48 out of 63 places after structural reductions.
[2023-03-22 11:27:43] [INFO ] Flatten gal took : 24 ms
[2023-03-22 11:27:43] [INFO ] Flatten gal took : 15 ms
[2023-03-22 11:27:43] [INFO ] Input system was already deterministic with 62 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 55) seen :51
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 11:27:43] [INFO ] Invariant cache hit.
[2023-03-22 11:27:44] [INFO ] [Real]Absence check using 10 positive place invariants in 51 ms returned sat
[2023-03-22 11:27:44] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-22 11:27:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 55 ms returned sat
[2023-03-22 11:27:44] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-22 11:27:44] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 6 ms to minimize.
[2023-03-22 11:27:44] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2023-03-22 11:27:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2023-03-22 11:27:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 191 ms
[2023-03-22 11:27:44] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-22 11:27:44] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 11:27:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 8 ms
FORMULA ShieldIIPs-PT-001B-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 62 transitions.
Support contains 47 out of 63 places (down from 48) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 58
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 58
Applied a total of 8 rules in 17 ms. Remains 59 /63 variables (removed 4) and now considering 58/62 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 59/63 places, 58/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 56 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 54
Applied a total of 16 rules in 4 ms. Remains 55 /63 variables (removed 8) and now considering 54/62 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 55/63 places, 54/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 4 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 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 62 transition count 56
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 57 transition count 52
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 53 transition count 52
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 25 place count 46 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 32 place count 46 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 32 place count 46 transition count 42
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 38 place count 43 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 2 with 28 rules applied. Total rules applied 66 place count 29 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 28 transition count 27
Applied a total of 67 rules in 20 ms. Remains 28 /63 variables (removed 35) and now considering 27/62 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 28/63 places, 27/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 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 63 transition count 57
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 58 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 10 place count 58 transition count 51
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 52 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 47 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 47 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 32 place count 47 transition count 43
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 38 place count 44 transition count 43
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 62 place count 32 transition count 31
Applied a total of 62 rules in 9 ms. Remains 32 /63 variables (removed 31) and now considering 31/62 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 32/63 places, 31/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 3 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/63 places, 55/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 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 63 transition count 57
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 58 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 10 place count 58 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 22 place count 52 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 46 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 46 transition count 45
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 46 transition count 42
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 40 place count 43 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 62 place count 32 transition count 31
Applied a total of 62 rules in 7 ms. Remains 32 /63 variables (removed 31) and now considering 31/62 (removed 31) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 32/63 places, 31/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:44] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 3 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/63 places, 55/62 transitions.
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:44] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 3 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/63 places, 55/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 57
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 58 transition count 57
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 58 transition count 53
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 54 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 49 transition count 48
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 49 transition count 48
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 40 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 39 transition count 38
Applied a total of 45 rules in 8 ms. Remains 39 /63 variables (removed 24) and now considering 38/62 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 39/63 places, 38/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 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 62 transition count 56
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 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 10 place count 57 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 20 place count 52 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 47 transition count 46
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 47 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 30 place count 47 transition count 43
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 44 transition count 43
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 62 place count 31 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 30 transition count 29
Applied a total of 63 rules in 10 ms. Remains 30 /63 variables (removed 33) and now considering 29/62 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 30/63 places, 29/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 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 62 transition count 56
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 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 56 transition count 50
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 22 place count 51 transition count 50
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 29 place count 44 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 36 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 41 transition count 40
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 70 place count 27 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 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 72 place count 25 transition count 25
Applied a total of 72 rules in 7 ms. Remains 25 /63 variables (removed 38) and now considering 25/62 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 25/63 places, 25/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 56 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 55 transition count 54
Applied a total of 16 rules in 3 ms. Remains 55 /63 variables (removed 8) and now considering 54/62 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/63 places, 54/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 56 transition count 55
Applied a total of 14 rules in 2 ms. Remains 56 /63 variables (removed 7) and now considering 55/62 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 56/63 places, 55/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 55
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 56 transition count 49
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 24 place count 50 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 43 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 43 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 38 place count 43 transition count 39
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 44 place count 40 transition count 39
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 68 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 27 transition count 26
Applied a total of 69 rules in 7 ms. Remains 27 /63 variables (removed 36) and now considering 26/62 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 27/63 places, 26/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 57 transition count 56
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 57 transition count 56
Applied a total of 12 rules in 2 ms. Remains 57 /63 variables (removed 6) and now considering 56/62 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 57/63 places, 56/62 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Input system was already deterministic with 56 transitions.
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:45] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 11:27:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 62 transitions and 184 arcs took 1 ms.
Total runtime 3536 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: 63 NrTr: 62 NrArc: 184)

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

net check time: 0m 0.000sec

init dd package: 0m 3.036sec


RS generation: 0m 0.113sec


-> reachability set: #nodes 4416 (4.4e+03) #states 863,505 (5)



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

checking: AX [AG [EF [[p45<=1 & 1<=p45]]]]
normalized: ~ [EX [E [true U ~ [E [true U [p45<=1 & 1<=p45]]]]]]

abstracting: (1<=p45)
states: 103,656 (5)
abstracting: (p45<=1)
states: 863,505 (5)
.-> the formula is FALSE

FORMULA ShieldIIPs-PT-001B-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.253sec

checking: EF [AG [[p7<=1 & 1<=p7]]]
normalized: E [true U ~ [E [true U ~ [[p7<=1 & 1<=p7]]]]]

abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 863,505 (5)
-> the formula is FALSE

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

MC time: 0m 0.005sec

checking: EX [AF [[AF [[[p18<=0 & 0<=p18] | [p34<=0 & 0<=p34]]] & [p56<=1 & 1<=p56]]]]
normalized: EX [~ [EG [~ [[[p56<=1 & 1<=p56] & ~ [EG [~ [[[p34<=0 & 0<=p34] | [p18<=0 & 0<=p18]]]]]]]]]]

abstracting: (0<=p18)
states: 863,505 (5)
abstracting: (p18<=0)
states: 613,443 (5)
abstracting: (0<=p34)
states: 863,505 (5)
abstracting: (p34<=0)
states: 763,692 (5)
...............................................
EG iterations: 47
abstracting: (1<=p56)
states: 82,152 (4)
abstracting: (p56<=1)
states: 863,505 (5)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.132sec

checking: E [[[p14<=1 & 1<=p14] & [p41<=1 & 1<=p41]] U ~ [AG [~ [[[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]]]]]
normalized: E [[[p41<=1 & 1<=p41] & [p14<=1 & 1<=p14]] U E [true U [[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]]]]

abstracting: (1<=p19)
states: 239,040 (5)
abstracting: (p19<=1)
states: 863,505 (5)
abstracting: (1<=p21)
states: 235,524 (5)
abstracting: (p21<=1)
states: 863,505 (5)
abstracting: (1<=p14)
states: 302,706 (5)
abstracting: (p14<=1)
states: 863,505 (5)
abstracting: (1<=p41)
states: 280,022 (5)
abstracting: (p41<=1)
states: 863,505 (5)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001B-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AX [[EG [EX [[[p20<=0 & 0<=p20] | [p48<=0 & 0<=p48]]]] & [[p46<=1 & 1<=p46] | [EX [0<=0] & EF [AX [[p10<=0 & 0<=p10]]]]]]]
normalized: ~ [EX [~ [[[[E [true U ~ [EX [~ [[p10<=0 & 0<=p10]]]]] & EX [0<=0]] | [p46<=1 & 1<=p46]] & EG [EX [[[p48<=0 & 0<=p48] | [p20<=0 & 0<=p20]]]]]]]]

abstracting: (0<=p20)
states: 863,505 (5)
abstracting: (p20<=0)
states: 609,927 (5)
abstracting: (0<=p48)
states: 863,505 (5)
abstracting: (p48<=0)
states: 759,597 (5)
................
EG iterations: 15
abstracting: (1<=p46)
states: 104,964 (5)
abstracting: (p46<=1)
states: 863,505 (5)
abstracting: (0<=0)
states: 863,505 (5)
.abstracting: (0<=p10)
states: 863,505 (5)
abstracting: (p10<=0)
states: 862,889 (5)
..-> the formula is TRUE

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

MC time: 0m 0.050sec

checking: AG [[AG [EF [EX [[[p27<=1 & 1<=p27] & [[p49<=1 & 1<=p49] & [p57<=1 & 1<=p57]]]]]] & [[p17<=0 & 0<=p17] | EG [[[p15<=0 & 0<=p15] | [p40<=0 & 0<=p40]]]]]]
normalized: ~ [E [true U ~ [[[EG [[[p40<=0 & 0<=p40] | [p15<=0 & 0<=p15]]] | [p17<=0 & 0<=p17]] & ~ [E [true U ~ [E [true U EX [[[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]]]]]]]]

abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
.abstracting: (0<=p17)
states: 863,505 (5)
abstracting: (p17<=0)
states: 732,039 (5)
abstracting: (0<=p15)
states: 863,505 (5)
abstracting: (p15<=0)
states: 740,423 (5)
abstracting: (0<=p40)
states: 863,505 (5)
abstracting: (p40<=0)
states: 563,919 (5)
.....................................................................................
EG iterations: 85
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001B-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.684sec

checking: EF [EG [[[[p16<=0 & 0<=p16] | [p27<=0 & 0<=p27]] | [[p46<=0 & 0<=p46] | [[p57<=0 & 0<=p57] | [[p14<=1 & 1<=p14] & [p41<=1 & 1<=p41]]]]]]]
normalized: E [true U EG [[[[[[p41<=1 & 1<=p41] & [p14<=1 & 1<=p14]] | [p57<=0 & 0<=p57]] | [p46<=0 & 0<=p46]] | [[p27<=0 & 0<=p27] | [p16<=0 & 0<=p16]]]]]

abstracting: (0<=p16)
states: 863,505 (5)
abstracting: (p16<=0)
states: 746,577 (5)
abstracting: (0<=p27)
states: 863,505 (5)
abstracting: (p27<=0)
states: 575,603 (5)
abstracting: (0<=p46)
states: 863,505 (5)
abstracting: (p46<=0)
states: 758,541 (5)
abstracting: (0<=p57)
states: 863,505 (5)
abstracting: (p57<=0)
states: 767,559 (5)
abstracting: (1<=p14)
states: 302,706 (5)
abstracting: (p14<=1)
states: 863,505 (5)
abstracting: (1<=p41)
states: 280,022 (5)
abstracting: (p41<=1)
states: 863,505 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001B-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [A [~ [[p32<=1 & 1<=p32]] U [p6<=1 & 1<=p6]] U EG [AG [[[EG [[p45<=1 & 1<=p45]] | [p26<=1 & 1<=p26]] | [[p4<=1 & 1<=p4] | [[p5<=1 & 1<=p5] | ~ [[p56<=1 & 1<=p56]]]]]]]]
normalized: [~ [EG [~ [EG [~ [E [true U ~ [[[[~ [[p56<=1 & 1<=p56]] | [p5<=1 & 1<=p5]] | [p4<=1 & 1<=p4]] | [[p26<=1 & 1<=p26] | EG [[p45<=1 & 1<=p45]]]]]]]]]]] & ~ [E [~ [EG [~ [E [true U ~ [[[[~ [[p56<=1 & 1<=p56]] | [p5<=1 & 1<=p5]] | [p4<=1 & 1<=p4]] | [[p26<=1 & 1<=p26] | EG [[p45<=1 & 1<=p45]]]]]]]]] U [~ [[~ [EG [~ [[p6<=1 & 1<=p6]]]] & ~ [E [~ [[p6<=1 & 1<=p6]] U [[p32<=1 & 1<=p32] & ~ [[p6<=1 & 1<=p6]]]]]]] & ~ [EG [~ [E [true U ~ [[[[~ [[p56<=1 & 1<=p56]] | [p5<=1 & 1<=p5]] | [p4<=1 & 1<=p4]] | [[p26<=1 & 1<=p26] | EG [[p45<=1 & 1<=p45]]]]]]]]]]]]]

abstracting: (1<=p45)
states: 103,656 (5)
abstracting: (p45<=1)
states: 863,505 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p26)
states: 287,518 (5)
abstracting: (p26<=1)
states: 863,505 (5)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 863,505 (5)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 863,505 (5)
abstracting: (1<=p56)
states: 82,152 (4)
abstracting: (p56<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 863,505 (5)
abstracting: (1<=p32)
states: 104,745 (5)
abstracting: (p32<=1)
states: 863,505 (5)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 863,505 (5)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 863,505 (5)
....
EG iterations: 4
abstracting: (1<=p45)
states: 103,656 (5)
abstracting: (p45<=1)
states: 863,505 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p26)
states: 287,518 (5)
abstracting: (p26<=1)
states: 863,505 (5)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 863,505 (5)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 863,505 (5)
abstracting: (1<=p56)
states: 82,152 (4)
abstracting: (p56<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p45)
states: 103,656 (5)
abstracting: (p45<=1)
states: 863,505 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p26)
states: 287,518 (5)
abstracting: (p26<=1)
states: 863,505 (5)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 863,505 (5)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 863,505 (5)
abstracting: (1<=p56)
states: 82,152 (4)
abstracting: (p56<=1)
states: 863,505 (5)
.
EG iterations: 1
..............
EG iterations: 14
-> the formula is FALSE

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

MC time: 0m 0.386sec

checking: [EX [EG [[[0<=p37 & p37<=0] | A [[p33<=1 & 1<=p33] U [p36<=1 & 1<=p36]]]]] & [AF [[p38<=1 & 1<=p38]] & AG [[[[p5<=1 & 1<=p5] | [p10<=1 & 1<=p10]] | [[p19<=0 & 0<=p19] | [p21<=0 & 0<=p21]]]]]]
normalized: [[~ [E [true U ~ [[[[p21<=0 & 0<=p21] | [p19<=0 & 0<=p19]] | [[p10<=1 & 1<=p10] | [p5<=1 & 1<=p5]]]]]] & ~ [EG [~ [[p38<=1 & 1<=p38]]]]] & EX [EG [[[~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[p33<=1 & 1<=p33]] & ~ [[p36<=1 & 1<=p36]]]]]] | [0<=p37 & p37<=0]]]]]

abstracting: (p37<=0)
states: 857,512 (5)
abstracting: (0<=p37)
states: 863,505 (5)
abstracting: (1<=p36)
states: 111,203 (5)
abstracting: (p36<=1)
states: 863,505 (5)
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
abstracting: (1<=p36)
states: 111,203 (5)
abstracting: (p36<=1)
states: 863,505 (5)
abstracting: (1<=p36)
states: 111,203 (5)
abstracting: (p36<=1)
states: 863,505 (5)
.....................................................................................
EG iterations: 85
..............................................................
EG iterations: 62
.abstracting: (1<=p38)
states: 5,996 (3)
abstracting: (p38<=1)
states: 863,505 (5)
............
EG iterations: 12
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 863,505 (5)
abstracting: (1<=p10)
states: 616
abstracting: (p10<=1)
states: 863,505 (5)
abstracting: (0<=p19)
states: 863,505 (5)
abstracting: (p19<=0)
states: 624,465 (5)
abstracting: (0<=p21)
states: 863,505 (5)
abstracting: (p21<=0)
states: 627,981 (5)
-> the formula is FALSE

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

MC time: 0m 1.224sec

checking: EG [EF [[A [[p56<=1 & 1<=p56] U [[[p15<=1 & 1<=p15] & [[p40<=1 & 1<=p40] & [p34<=1 & 1<=p34]]] & [[p27<=1 & 1<=p27] & [[p46<=1 & 1<=p46] & [p57<=1 & 1<=p57]]]]] | [p38<=1 & 1<=p38]]]]
normalized: EG [E [true U [[p38<=1 & 1<=p38] | [~ [EG [~ [[[[[p57<=1 & 1<=p57] & [p46<=1 & 1<=p46]] & [p27<=1 & 1<=p27]] & [[[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]] & [p15<=1 & 1<=p15]]]]]] & ~ [E [~ [[[[[p57<=1 & 1<=p57] & [p46<=1 & 1<=p46]] & [p27<=1 & 1<=p27]] & [[[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]] & [p15<=1 & 1<=p15]]]] U [~ [[p56<=1 & 1<=p56]] & ~ [[[[[p57<=1 & 1<=p57] & [p46<=1 & 1<=p46]] & [p27<=1 & 1<=p27]] & [[[p34<=1 & 1<=p34] & [p40<=1 & 1<=p40]] & [p15<=1 & 1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 123,082 (5)
abstracting: (p15<=1)
states: 863,505 (5)
abstracting: (1<=p40)
states: 299,586 (5)
abstracting: (p40<=1)
states: 863,505 (5)
abstracting: (1<=p34)
states: 99,813 (4)
abstracting: (p34<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p46)
states: 104,964 (5)
abstracting: (p46<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p56)
states: 82,152 (4)
abstracting: (p56<=1)
states: 863,505 (5)
abstracting: (1<=p15)
states: 123,082 (5)
abstracting: (p15<=1)
states: 863,505 (5)
abstracting: (1<=p40)
states: 299,586 (5)
abstracting: (p40<=1)
states: 863,505 (5)
abstracting: (1<=p34)
states: 99,813 (4)
abstracting: (p34<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p46)
states: 104,964 (5)
abstracting: (p46<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p15)
states: 123,082 (5)
abstracting: (p15<=1)
states: 863,505 (5)
abstracting: (1<=p40)
states: 299,586 (5)
abstracting: (p40<=1)
states: 863,505 (5)
abstracting: (1<=p34)
states: 99,813 (4)
abstracting: (p34<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p46)
states: 104,964 (5)
abstracting: (p46<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p38)
states: 5,996 (3)
abstracting: (p38<=1)
states: 863,505 (5)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.081sec

checking: EX [EF [[[[p20<=1 & 1<=p20] & [p48<=1 & 1<=p48]] | [EG [[p33<=0 & 0<=p33]] & [[[p27<=0 & 0<=p27] | [[p49<=0 & 0<=p49] | [p57<=0 & 0<=p57]]] & [~ [E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]]] | [p16<=1 & 1<=p16]]]]]]]
normalized: EX [E [true U [[[[[p16<=1 & 1<=p16] | ~ [E [[p4<=1 & 1<=p4] U [p13<=1 & 1<=p13]]]] & [[[p57<=0 & 0<=p57] | [p49<=0 & 0<=p49]] | [p27<=0 & 0<=p27]]] & EG [[p33<=0 & 0<=p33]]] | [[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]]

abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (0<=p33)
states: 863,505 (5)
abstracting: (p33<=0)
states: 758,760 (5)
.
EG iterations: 1
abstracting: (0<=p27)
states: 863,505 (5)
abstracting: (p27<=0)
states: 575,603 (5)
abstracting: (0<=p49)
states: 863,505 (5)
abstracting: (p49<=0)
states: 758,155 (5)
abstracting: (0<=p57)
states: 863,505 (5)
abstracting: (p57<=0)
states: 767,559 (5)
abstracting: (1<=p13)
states: 278,238 (5)
abstracting: (p13<=1)
states: 863,505 (5)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 863,505 (5)
abstracting: (1<=p16)
states: 116,928 (5)
abstracting: (p16<=1)
states: 863,505 (5)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001B-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: EG [E [[AG [[[p19<=1 & 1<=p19] & [p21<=1 & 1<=p21]]] | A [[EF [[p34<=1 & 1<=p34]] & [[p33<=1 & 1<=p33] & [p2<=1 & 1<=p2]]] U ~ [[[p20<=1 & 1<=p20] & [p48<=1 & 1<=p48]]]]] U A [~ [[[[p15<=1 & 1<=p15] & [[p40<=1 & 1<=p40] & [p13<=1 & 1<=p13]]] | AF [[p33<=1 & 1<=p33]]]] U ~ [[p0<=1 & 1<=p0]]]]]
normalized: EG [E [[[~ [EG [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]] & ~ [E [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]] U [~ [[[[p2<=1 & 1<=p2] & [p33<=1 & 1<=p33]] & E [true U [p34<=1 & 1<=p34]]]] & [[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]]] | ~ [E [true U ~ [[[p21<=1 & 1<=p21] & [p19<=1 & 1<=p19]]]]]] U [~ [EG [[p0<=1 & 1<=p0]]] & ~ [E [[p0<=1 & 1<=p0] U [[~ [EG [~ [[p33<=1 & 1<=p33]]]] | [[[p13<=1 & 1<=p13] & [p40<=1 & 1<=p40]] & [p15<=1 & 1<=p15]]] & [p0<=1 & 1<=p0]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 863,505 (5)
abstracting: (1<=p15)
states: 123,082 (5)
abstracting: (p15<=1)
states: 863,505 (5)
abstracting: (1<=p40)
states: 299,586 (5)
abstracting: (p40<=1)
states: 863,505 (5)
abstracting: (1<=p13)
states: 278,238 (5)
abstracting: (p13<=1)
states: 863,505 (5)
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 863,505 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 863,505 (5)
..
EG iterations: 2
abstracting: (1<=p19)
states: 239,040 (5)
abstracting: (p19<=1)
states: 863,505 (5)
abstracting: (1<=p21)
states: 235,524 (5)
abstracting: (p21<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p34)
states: 99,813 (4)
abstracting: (p34<=1)
states: 863,505 (5)
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
abstracting: (1<=p2)
states: 279,177 (5)
abstracting: (p2<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
...........................................
EG iterations: 43

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001B-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.180sec

checking: AF [[AG [[p23<=1 & 1<=p23]] & [[AX [[p6<=1 & 1<=p6]] & EX [[p53<=0 & 0<=p53]]] | [EX [[p57<=1 & 1<=p57]] & [[[p17<=0 & 0<=p17] & [[p55<=0 & 0<=p55] & [p9<=0 & 0<=p9]]] | [[[p4<=0 & 0<=p4] & [p14<=1 & 1<=p14]] & [[p41<=1 & 1<=p41] & [[p27<=0 & 0<=p27] | [[p49<=0 & 0<=p49] | [p57<=0 & 0<=p57]]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[[p57<=0 & 0<=p57] | [p49<=0 & 0<=p49]] | [p27<=0 & 0<=p27]] & [p41<=1 & 1<=p41]] & [[p14<=1 & 1<=p14] & [p4<=0 & 0<=p4]]] | [[[p9<=0 & 0<=p9] & [p55<=0 & 0<=p55]] & [p17<=0 & 0<=p17]]] & EX [[p57<=1 & 1<=p57]]] | [EX [[p53<=0 & 0<=p53]] & ~ [EX [~ [[p6<=1 & 1<=p6]]]]]] & ~ [E [true U ~ [[p23<=1 & 1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 276,369 (5)
abstracting: (p23<=1)
states: 863,505 (5)
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 863,505 (5)
.abstracting: (0<=p53)
states: 863,505 (5)
abstracting: (p53<=0)
states: 768,999 (5)
.abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
.abstracting: (0<=p17)
states: 863,505 (5)
abstracting: (p17<=0)
states: 732,039 (5)
abstracting: (0<=p55)
states: 863,505 (5)
abstracting: (p55<=0)
states: 753,219 (5)
abstracting: (0<=p9)
states: 863,505 (5)
abstracting: (p9<=0)
states: 863,377 (5)
abstracting: (0<=p4)
states: 863,505 (5)
abstracting: (p4<=0)
states: 863,504 (5)
abstracting: (1<=p14)
states: 302,706 (5)
abstracting: (p14<=1)
states: 863,505 (5)
abstracting: (1<=p41)
states: 280,022 (5)
abstracting: (p41<=1)
states: 863,505 (5)
abstracting: (0<=p27)
states: 863,505 (5)
abstracting: (p27<=0)
states: 575,603 (5)
abstracting: (0<=p49)
states: 863,505 (5)
abstracting: (p49<=0)
states: 758,155 (5)
abstracting: (0<=p57)
states: 863,505 (5)
abstracting: (p57<=0)
states: 767,559 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001B-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: EG [A [A [[[~ [[p10<=1 & 1<=p10]] & [p26<=1 & 1<=p26]] & [[p15<=1 & 1<=p15] & [[p40<=1 & 1<=p40] & ~ [[[p20<=1 & 1<=p20] & [p49<=1 & 1<=p49]]]]]] U ~ [[[[p51<=1 & 1<=p51] | [p11<=1 & 1<=p11]] & AF [[[p20<=1 & 1<=p20] & [p48<=1 & 1<=p48]]]]]] U [[EF [[[p27<=1 & 1<=p27] & [[p49<=1 & 1<=p49] & [p57<=1 & 1<=p57]]]] & ~ [[A [[p31<=1 & 1<=p31] U [[p20<=1 & 1<=p20] & [p48<=1 & 1<=p48]]] | [[p33<=1 & 1<=p33] | [p16<=1 & 1<=p16]]]]] | [[p24<=1 & 1<=p24] & [[p35<=1 & 1<=p35] & [p60<=1 & 1<=p60]]]]]]
normalized: EG [[~ [EG [~ [[[[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]] | [~ [[[[p16<=1 & 1<=p16] | [p33<=1 & 1<=p33]] | [~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]] U [~ [[p31<=1 & 1<=p31]] & ~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]]]]]] & E [true U [[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]]]]] & ~ [E [~ [[[[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]] | [~ [[[[p16<=1 & 1<=p16] | [p33<=1 & 1<=p33]] | [~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]] U [~ [[p31<=1 & 1<=p31]] & ~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]]]]]] & E [true U [[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]]] U [~ [[~ [EG [[~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & [[p11<=1 & 1<=p11] | [p51<=1 & 1<=p51]]]]] & ~ [E [[~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & [[p11<=1 & 1<=p11] | [p51<=1 & 1<=p51]]] U [~ [[[[~ [[[p49<=1 & 1<=p49] & [p20<=1 & 1<=p20]]] & [p40<=1 & 1<=p40]] & [p15<=1 & 1<=p15]] & [[p26<=1 & 1<=p26] & ~ [[p10<=1 & 1<=p10]]]]] & [~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & [[p11<=1 & 1<=p11] | [p51<=1 & 1<=p51]]]]]]]] & ~ [[[[[p60<=1 & 1<=p60] & [p35<=1 & 1<=p35]] & [p24<=1 & 1<=p24]] | [~ [[[[p16<=1 & 1<=p16] | [p33<=1 & 1<=p33]] | [~ [EG [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]] U [~ [[p31<=1 & 1<=p31]] & ~ [[[p48<=1 & 1<=p48] & [p20<=1 & 1<=p20]]]]]]]]] & E [true U [[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]]]]]]]]

abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p31)
states: 98,937 (4)
abstracting: (p31<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
abstracting: (1<=p16)
states: 116,928 (5)
abstracting: (p16<=1)
states: 863,505 (5)
abstracting: (1<=p24)
states: 305,778 (5)
abstracting: (p24<=1)
states: 863,505 (5)
abstracting: (1<=p35)
states: 111,203 (5)
abstracting: (p35<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
abstracting: (1<=p51)
states: 236
abstracting: (p51<=1)
states: 863,505 (5)
abstracting: (1<=p11)
states: 2,128 (3)
abstracting: (p11<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 616
abstracting: (p10<=1)
states: 863,505 (5)
abstracting: (1<=p26)
states: 287,518 (5)
abstracting: (p26<=1)
states: 863,505 (5)
abstracting: (1<=p15)
states: 123,082 (5)
abstracting: (p15<=1)
states: 863,505 (5)
abstracting: (1<=p40)
states: 299,586 (5)
abstracting: (p40<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p51)
states: 236
abstracting: (p51<=1)
states: 863,505 (5)
abstracting: (1<=p11)
states: 2,128 (3)
abstracting: (p11<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p51)
states: 236
abstracting: (p51<=1)
states: 863,505 (5)
abstracting: (1<=p11)
states: 2,128 (3)
abstracting: (p11<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p31)
states: 98,937 (4)
abstracting: (p31<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
abstracting: (1<=p16)
states: 116,928 (5)
abstracting: (p16<=1)
states: 863,505 (5)
abstracting: (1<=p24)
states: 305,778 (5)
abstracting: (p24<=1)
states: 863,505 (5)
abstracting: (1<=p35)
states: 111,203 (5)
abstracting: (p35<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p31)
states: 98,937 (4)
abstracting: (p31<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
abstracting: (1<=p20)
states: 253,578 (5)
abstracting: (p20<=1)
states: 863,505 (5)
abstracting: (1<=p48)
states: 103,908 (5)
abstracting: (p48<=1)
states: 863,505 (5)
.
EG iterations: 1
abstracting: (1<=p33)
states: 104,745 (5)
abstracting: (p33<=1)
states: 863,505 (5)
abstracting: (1<=p16)
states: 116,928 (5)
abstracting: (p16<=1)
states: 863,505 (5)
abstracting: (1<=p24)
states: 305,778 (5)
abstracting: (p24<=1)
states: 863,505 (5)
abstracting: (1<=p35)
states: 111,203 (5)
abstracting: (p35<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
.................................................................................
EG iterations: 81
..........
EG iterations: 10
-> the formula is TRUE

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

MC time: 0m 0.513sec

checking: [A [A [[[EF [[p8<=1 & 1<=p8]] & ~ [[~ [[[p1<=1 & 1<=p1] & [p44<=1 & 1<=p44]]] | AG [[[p27<=1 & 1<=p27] & [[p49<=1 & 1<=p49] & [p57<=1 & 1<=p57]]]]]]] & [~ [[p36<=1 & 1<=p36]] & ~ [[p26<=1 & 1<=p26]]]] U ~ [EX [[[[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]] & [[p49<=1 & 1<=p49] & [p60<=1 & 1<=p60]]]]]] U [p13<=1 & 1<=p13]] | ~ [E [EG [[[p29<=1 & 1<=p29] | ~ [[p32<=1 & 1<=p32]]]] U [[[p8<=1 & 1<=p8] & [~ [[[p10<=1 & 1<=p10] & [p5<=1 & 1<=p5]]] & [p16<=1 & 1<=p16]]] | [[p27<=1 & 1<=p27] & [[p46<=1 & 1<=p46] & [p60<=1 & 1<=p60]]]]]]]
normalized: [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[~ [EG [EX [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]]]]]] & ~ [E [EX [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]]]] U [~ [[[~ [[~ [E [true U ~ [[[[p57<=1 & 1<=p57] & [p49<=1 & 1<=p49]] & [p27<=1 & 1<=p27]]]]] | ~ [[[p44<=1 & 1<=p44] & [p1<=1 & 1<=p1]]]]] & E [true U [p8<=1 & 1<=p8]]] & [~ [[p26<=1 & 1<=p26]] & ~ [[p36<=1 & 1<=p36]]]]] & EX [[[[p60<=1 & 1<=p60] & [p49<=1 & 1<=p49]] & [[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]]]]]]]]] & ~ [[p13<=1 & 1<=p13]]]]]] | ~ [E [EG [[~ [[p32<=1 & 1<=p32]] | [p29<=1 & 1<=p29]]] U [[[[p46<=1 & 1<=p46] & [p60<=1 & 1<=p60]] & [p27<=1 & 1<=p27]] | [[[p16<=1 & 1<=p16] & ~ [[[p5<=1 & 1<=p5] & [p10<=1 & 1<=p10]]]] & [p8<=1 & 1<=p8]]]]]]

abstracting: (1<=p8)
states: 32
abstracting: (p8<=1)
states: 863,505 (5)
abstracting: (1<=p10)
states: 616
abstracting: (p10<=1)
states: 863,505 (5)
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 863,505 (5)
abstracting: (1<=p16)
states: 116,928 (5)
abstracting: (p16<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
abstracting: (1<=p46)
states: 104,964 (5)
abstracting: (p46<=1)
states: 863,505 (5)
abstracting: (1<=p29)
states: 110,409 (5)
abstracting: (p29<=1)
states: 863,505 (5)
abstracting: (1<=p32)
states: 104,745 (5)
abstracting: (p32<=1)
states: 863,505 (5)
.............................
EG iterations: 29
abstracting: (1<=p13)
states: 278,238 (5)
abstracting: (p13<=1)
states: 863,505 (5)
abstracting: (1<=p28)
states: 5,993 (3)
abstracting: (p28<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
.abstracting: (1<=p36)
states: 111,203 (5)
abstracting: (p36<=1)
states: 863,505 (5)
abstracting: (1<=p26)
states: 287,518 (5)
abstracting: (p26<=1)
states: 863,505 (5)
abstracting: (1<=p8)
states: 32
abstracting: (p8<=1)
states: 863,505 (5)
abstracting: (1<=p1)
states: 281,141 (5)
abstracting: (p1<=1)
states: 863,505 (5)
abstracting: (1<=p44)
states: 121,386 (5)
abstracting: (p44<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p57)
states: 95,946 (4)
abstracting: (p57<=1)
states: 863,505 (5)
abstracting: (1<=p28)
states: 5,993 (3)
abstracting: (p28<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
.abstracting: (1<=p28)
states: 5,993 (3)
abstracting: (p28<=1)
states: 863,505 (5)
abstracting: (1<=p27)
states: 287,902 (5)
abstracting: (p27<=1)
states: 863,505 (5)
abstracting: (1<=p49)
states: 105,350 (5)
abstracting: (p49<=1)
states: 863,505 (5)
abstracting: (1<=p60)
states: 94,743 (4)
abstracting: (p60<=1)
states: 863,505 (5)
...........
EG iterations: 10
abstracting: (1<=p13)
states: 278,238 (5)
abstracting: (p13<=1)
states: 863,505 (5)
abstracting: (1<=p13)
states: 278,238 (5)
abstracting: (p13<=1)
states: 863,505 (5)
.................................................................................
EG iterations: 81
-> the formula is FALSE

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

MC time: 0m 0.625sec

totally nodes used: 3983067 (4.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4247516 10376119 14623635
used/not used/entry size/cache size: 12678537 54430327 16 1024MB
basic ops cache: hits/miss/sum: 752883 1665429 2418312
used/not used/entry size/cache size: 2887605 13889611 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: 12755 36397 49152
used/not used/entry size/cache size: 36318 8352290 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 63484518
1 3307451
2 279131
3 34028
4 3430
5 286
6 20
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.659sec


BK_STOP 1679484475272

--------------------
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:6163 (99), effective:627 (10)

initing FirstDep: 0m 0.000sec


iterations count:1523 (24), effective:152 (2)

iterations count:2874 (46), effective:307 (4)

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

iterations count:1362 (21), effective:144 (2)

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

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

iterations count:1212 (19), effective:128 (2)

iterations count:2870 (46), effective:306 (4)

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

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

iterations count:1271 (20), effective:129 (2)

iterations count:1104 (17), effective:105 (1)

iterations count:1271 (20), effective:129 (2)

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

iterations count:1271 (20), effective:129 (2)

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

iterations count:1362 (21), effective:144 (2)

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

iterations count:2424 (39), effective:258 (4)

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

iterations count:328 (5), effective:38 (0)

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

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

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

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

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

iterations count:1283 (20), effective:128 (2)

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

iterations count:1283 (20), effective:128 (2)

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

iterations count:1283 (20), effective:128 (2)

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

iterations count:2031 (32), effective:205 (3)

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

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

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

iterations count:386 (6), effective:44 (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="ShieldIIPs-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 ShieldIIPs-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-167903717400010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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