Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856419800106.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is IOTPpurchase-PT-C01M01P01D01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419800106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 63K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679451039180

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=IOTPpurchase-PT-C01M01P01D01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:10:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:10:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:10:40] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2023-03-22 02:10:40] [INFO ] Transformed 111 places.
[2023-03-22 02:10:40] [INFO ] Transformed 45 transitions.
[2023-03-22 02:10:40] [INFO ] Found NUPN structural information;
[2023-03-22 02:10:40] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 110 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Applied a total of 0 rules in 10 ms. Remains 111 /111 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 111 cols
[2023-03-22 02:10:41] [INFO ] Computed 67 place invariants in 17 ms
[2023-03-22 02:10:41] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-22 02:10:41] [INFO ] Invariant cache hit.
[2023-03-22 02:10:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 02:10:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2023-03-22 02:10:41] [INFO ] Invariant cache hit.
[2023-03-22 02:10:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 111/111 places, 45/45 transitions.
Support contains 110 out of 111 places after structural reductions.
[2023-03-22 02:10:41] [INFO ] Flatten gal took : 23 ms
[2023-03-22 02:10:41] [INFO ] Flatten gal took : 10 ms
[2023-03-22 02:10:41] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 64) seen :56
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-22 02:10:43] [INFO ] Invariant cache hit.
[2023-03-22 02:10:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-22 02:10:43] [INFO ] [Real]Absence check using 8 positive and 59 generalized place invariants in 10 ms returned sat
[2023-03-22 02:10:43] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 7 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 30 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 73 transition count 45
Applied a total of 38 rules in 4 ms. Remains 73 /111 variables (removed 38) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 73/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 6 places :
Implicit places reduction removed 6 places
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 11 rules applied. Total rules applied 11 place count 69 transition count 40
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 62 transition count 37
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 59 transition count 37
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 24 place count 59 transition count 27
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 48 place count 45 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 48 place count 45 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 44 transition count 26
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 65 place count 35 transition count 20
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 33 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 67 place count 33 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 71 place count 31 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 76 place count 28 transition count 16
Applied a total of 76 rules in 15 ms. Remains 28 /111 variables (removed 83) and now considering 16/45 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 28/111 places, 16/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 28 places
Discarding 6 places :
Implicit places reduction removed 6 places
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 11 rules applied. Total rules applied 11 place count 77 transition count 40
Reduce places removed 8 places and 0 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 1 with 14 rules applied. Total rules applied 25 place count 69 transition count 34
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 32 place count 63 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 62 transition count 33
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 33 place count 62 transition count 26
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 50 place count 52 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 52 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 51 transition count 25
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 69 place count 41 transition count 18
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 72 place count 39 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 73 place count 38 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 73 place count 38 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 76 place count 36 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 77 place count 36 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 80 place count 34 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 81 place count 33 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 84 place count 31 transition count 13
Applied a total of 84 rules in 10 ms. Remains 31 /111 variables (removed 80) and now considering 13/45 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 31/111 places, 13/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 31 places
Discarding 8 places :
Implicit places reduction removed 8 places
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 14 rules applied. Total rules applied 14 place count 72 transition count 39
Reduce places removed 9 places and 0 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 1 with 15 rules applied. Total rules applied 29 place count 63 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 57 transition count 33
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 57 transition count 22
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 64 place count 39 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 64 place count 39 transition count 19
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 36 transition count 19
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 90 place count 24 transition count 11
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 92 place count 22 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 92 place count 22 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 97 place count 19 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 19 transition count 8
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 101 place count 17 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 102 place count 16 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 104 place count 15 transition count 6
Applied a total of 104 rules in 21 ms. Remains 15 /111 variables (removed 96) and now considering 6/45 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 15/111 places, 6/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 28 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 75 transition count 45
Applied a total of 36 rules in 2 ms. Remains 75 /111 variables (removed 36) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 75/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 32 places
Discarding 7 places :
Implicit places reduction removed 7 places
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 11 rules applied. Total rules applied 11 place count 72 transition count 41
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 66 transition count 38
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 63 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 62 transition count 37
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 25 place count 62 transition count 24
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 33 rules applied. Total rules applied 58 place count 42 transition count 24
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 58 place count 42 transition count 21
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 64 place count 39 transition count 21
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 79 place count 30 transition count 15
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 28 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 81 place count 28 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 84 place count 26 transition count 14
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 26 transition count 13
Reduce places removed 2 places and 0 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 6 with 3 rules applied. Total rules applied 88 place count 24 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 89 place count 23 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 91 place count 22 transition count 11
Applied a total of 91 rules in 8 ms. Remains 22 /111 variables (removed 89) and now considering 11/45 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 22/111 places, 11/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 28 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 80 transition count 45
Applied a total of 31 rules in 2 ms. Remains 80 /111 variables (removed 31) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 80/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 29 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 74 transition count 42
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 69 transition count 40
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 22 place count 67 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 24 place count 65 transition count 38
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 24 place count 65 transition count 29
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 48 place count 50 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 48 place count 50 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 50 place count 49 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 63 place count 41 transition count 23
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 40 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 64 place count 40 transition count 22
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 66 place count 39 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 69 place count 37 transition count 21
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 70 place count 36 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 74 place count 34 transition count 19
Applied a total of 74 rules in 9 ms. Remains 34 /111 variables (removed 77) and now considering 19/45 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 34/111 places, 19/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 24 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 81 transition count 45
Applied a total of 30 rules in 1 ms. Remains 81 /111 variables (removed 30) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 81/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 11 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 26 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 80 transition count 42
Reduce places removed 4 places and 0 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 5 rules applied. Total rules applied 13 place count 76 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 75 transition count 41
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 14 place count 75 transition count 31
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 39 place count 60 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 60 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 59 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 50 place count 54 transition count 26
Applied a total of 50 rules in 8 ms. Remains 54 /111 variables (removed 57) and now considering 26/45 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 54/111 places, 26/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 29 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 75 transition count 45
Applied a total of 36 rules in 2 ms. Remains 75 /111 variables (removed 36) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 75/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 33 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 72 transition count 45
Applied a total of 39 rules in 2 ms. Remains 72 /111 variables (removed 39) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 72/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 8 places :
Implicit places reduction removed 8 places
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 14 rules applied. Total rules applied 14 place count 67 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 18 rules applied. Total rules applied 32 place count 57 transition count 31
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 49 transition count 31
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 40 place count 49 transition count 21
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 66 place count 33 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 66 place count 33 transition count 19
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 70 place count 31 transition count 19
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 86 place count 21 transition count 13
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 19 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 88 place count 19 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 93 place count 16 transition count 11
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 16 transition count 10
Reduce places removed 2 places and 0 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 5 with 3 rules applied. Total rules applied 97 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 13 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 100 place count 12 transition count 8
Applied a total of 100 rules in 6 ms. Remains 12 /111 variables (removed 99) and now considering 8/45 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 12/111 places, 8/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 36 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 68 transition count 45
Applied a total of 43 rules in 2 ms. Remains 68 /111 variables (removed 43) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 68/111 places, 45/45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:10:43] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:10:43] [INFO ] Flatten gal took : 6 ms
[2023-03-22 02:10:43] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-22 02:10:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 45 transitions and 224 arcs took 2 ms.
Total runtime 3216 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: 111 NrTr: 45 NrArc: 224)

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

net check time: 0m 0.000sec

init dd package: 0m 2.730sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 651 (6.5e+02) #states 204



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

checking: A [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] U EG [~ [EG [EF [[p104<=1 & 1<=p104]]]]]]
normalized: [~ [EG [~ [EG [~ [EG [E [true U [p104<=1 & 1<=p104]]]]]]]] & ~ [E [~ [EG [~ [EG [E [true U [p104<=1 & 1<=p104]]]]]] U [~ [EG [~ [EG [E [true U [p104<=1 & 1<=p104]]]]]] & ~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]]]]]

abstracting: (1<=p17)
states: 44
abstracting: (p17<=1)
states: 204
abstracting: (1<=p19)
states: 8
abstracting: (p19<=1)
states: 204
abstracting: (1<=p104)
states: 8
abstracting: (p104<=1)
states: 204

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p104)
states: 8
abstracting: (p104<=1)
states: 204

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p104)
states: 8
abstracting: (p104<=1)
states: 204

EG iterations: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EF [EG [[[[p5<=0 & 0<=p5] | [[p20<=0 & 0<=p20] | [p21<=0 & 0<=p21]]] | [[[p27<=0 & 0<=p27] | [p40<=0 & 0<=p40]] | [[p51<=0 & 0<=p51] | [p78<=0 & 0<=p78]]]]]]
normalized: E [true U EG [[[[[p78<=0 & 0<=p78] | [p51<=0 & 0<=p51]] | [[p40<=0 & 0<=p40] | [p27<=0 & 0<=p27]]] | [[[p21<=0 & 0<=p21] | [p20<=0 & 0<=p20]] | [p5<=0 & 0<=p5]]]]]

abstracting: (0<=p5)
states: 204
abstracting: (p5<=0)
states: 200
abstracting: (0<=p20)
states: 204
abstracting: (p20<=0)
states: 4
abstracting: (0<=p21)
states: 204
abstracting: (p21<=0)
states: 200
abstracting: (0<=p27)
states: 204
abstracting: (p27<=0)
states: 200
abstracting: (0<=p40)
states: 204
abstracting: (p40<=0)
states: 200
abstracting: (0<=p51)
states: 204
abstracting: (p51<=0)
states: 200
abstracting: (0<=p78)
states: 204
abstracting: (p78<=0)
states: 200
...............................................
EG iterations: 47
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: EF [[~ [A [EF [[p4<=1 & 1<=p4]] U [p105<=1 & 1<=p105]]] | [[EX [[[p38<=0 & 0<=p38] | [[p67<=0 & 0<=p67] | [p95<=0 & 0<=p95]]]] & [p89<=0 & 0<=p89]] & [[p14<=1 & 1<=p14] & [p102<=1 & 1<=p102]]]]]
normalized: E [true U [[[[p102<=1 & 1<=p102] & [p14<=1 & 1<=p14]] & [[p89<=0 & 0<=p89] & EX [[[[p95<=0 & 0<=p95] | [p67<=0 & 0<=p67]] | [p38<=0 & 0<=p38]]]]] | ~ [[~ [EG [~ [[p105<=1 & 1<=p105]]]] & ~ [E [~ [[p105<=1 & 1<=p105]] U [~ [E [true U [p4<=1 & 1<=p4]]] & ~ [[p105<=1 & 1<=p105]]]]]]]]]

abstracting: (1<=p105)
states: 4
abstracting: (p105<=1)
states: 204
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 204
abstracting: (1<=p105)
states: 4
abstracting: (p105<=1)
states: 204
abstracting: (1<=p105)
states: 4
abstracting: (p105<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (0<=p38)
states: 204
abstracting: (p38<=0)
states: 200
abstracting: (0<=p67)
states: 204
abstracting: (p67<=0)
states: 6
abstracting: (0<=p95)
states: 204
abstracting: (p95<=0)
states: 202
.abstracting: (0<=p89)
states: 204
abstracting: (p89<=0)
states: 200
abstracting: (1<=p14)
states: 8
abstracting: (p14<=1)
states: 204
abstracting: (1<=p102)
states: 24
abstracting: (p102<=1)
states: 204
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: EG [[EF [[[p46<=1 & 1<=p46] & [p49<=1 & 1<=p49]]] | [EG [[[[p70<=1 & 1<=p70] & [p83<=1 & 1<=p83]] | [[p62<=1 & 1<=p62] & [p65<=1 & 1<=p65]]]] & A [[[p14<=1 & 1<=p14] & [p102<=1 & 1<=p102]] U [p97<=1 & 1<=p97]]]]]
normalized: EG [[[EG [[[[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]] | [[p83<=1 & 1<=p83] & [p70<=1 & 1<=p70]]]] & [~ [EG [~ [[p97<=1 & 1<=p97]]]] & ~ [E [~ [[p97<=1 & 1<=p97]] U [~ [[[p102<=1 & 1<=p102] & [p14<=1 & 1<=p14]]] & ~ [[p97<=1 & 1<=p97]]]]]]] | E [true U [[p49<=1 & 1<=p49] & [p46<=1 & 1<=p46]]]]]

abstracting: (1<=p46)
states: 98
abstracting: (p46<=1)
states: 204
abstracting: (1<=p49)
states: 4
abstracting: (p49<=1)
states: 204
abstracting: (1<=p97)
states: 98
abstracting: (p97<=1)
states: 204
abstracting: (1<=p14)
states: 8
abstracting: (p14<=1)
states: 204
abstracting: (1<=p102)
states: 24
abstracting: (p102<=1)
states: 204
abstracting: (1<=p97)
states: 98
abstracting: (p97<=1)
states: 204
abstracting: (1<=p97)
states: 98
abstracting: (p97<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p70)
states: 200
abstracting: (p70<=1)
states: 204
abstracting: (1<=p83)
states: 4
abstracting: (p83<=1)
states: 204
abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
....
EG iterations: 4

EG iterations: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: A [EF [[EG [[[p18<=1 & 1<=p18] & [p34<=1 & 1<=p34]]] & ~ [EF [[[p12<=1 & 1<=p12] & [[p58<=1 & 1<=p58] & [p103<=1 & 1<=p103]]]]]]] U [[[p28<=1 & 1<=p28] & [p42<=1 & 1<=p42]] & [[p71<=1 & 1<=p71] & [p93<=1 & 1<=p93]]]]
normalized: [~ [EG [~ [[[[p93<=1 & 1<=p93] & [p71<=1 & 1<=p71]] & [[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]]]]]] & ~ [E [~ [[[[p93<=1 & 1<=p93] & [p71<=1 & 1<=p71]] & [[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]]]] U [~ [E [true U [~ [E [true U [[[p103<=1 & 1<=p103] & [p58<=1 & 1<=p58]] & [p12<=1 & 1<=p12]]]] & EG [[[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]]]]]] & ~ [[[[p93<=1 & 1<=p93] & [p71<=1 & 1<=p71]] & [[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]]]]]]]]

abstracting: (1<=p28)
states: 4
abstracting: (p28<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (1<=p71)
states: 200
abstracting: (p71<=1)
states: 204
abstracting: (1<=p93)
states: 4
abstracting: (p93<=1)
states: 204
abstracting: (1<=p18)
states: 20
abstracting: (p18<=1)
states: 204
abstracting: (1<=p34)
states: 4
abstracting: (p34<=1)
states: 204
....
EG iterations: 4
abstracting: (1<=p12)
states: 8
abstracting: (p12<=1)
states: 204
abstracting: (1<=p58)
states: 8
abstracting: (p58<=1)
states: 204
abstracting: (1<=p103)
states: 8
abstracting: (p103<=1)
states: 204
abstracting: (1<=p28)
states: 4
abstracting: (p28<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (1<=p71)
states: 200
abstracting: (p71<=1)
states: 204
abstracting: (1<=p93)
states: 4
abstracting: (p93<=1)
states: 204
abstracting: (1<=p28)
states: 4
abstracting: (p28<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (1<=p71)
states: 200
abstracting: (p71<=1)
states: 204
abstracting: (1<=p93)
states: 4
abstracting: (p93<=1)
states: 204
...............................................
EG iterations: 47
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: [AX [EX [AG [~ [E [[1<=p100 & p100<=1] U [p92<=1 & 1<=p92]]]]]] & AF [EG [[[[[p66<=1 & 1<=p66] & [p79<=1 & 1<=p79]] | [[[p11<=1 & 1<=p11] & [p57<=1 & 1<=p57]] & [[p76<=1 & 1<=p76] & [p109<=1 & 1<=p109]]]] & AG [[[[p6<=0 & 0<=p6] | [[p22<=0 & 0<=p22] | [p26<=0 & 0<=p26]]] | [[p41<=0 & 0<=p41] | [[p52<=0 & 0<=p52] | [p63<=0 & 0<=p63]]]]]]]]]
normalized: [~ [EG [~ [EG [[[[[[p109<=1 & 1<=p109] & [p76<=1 & 1<=p76]] & [[p57<=1 & 1<=p57] & [p11<=1 & 1<=p11]]] | [[p79<=1 & 1<=p79] & [p66<=1 & 1<=p66]]] & ~ [E [true U ~ [[[[[p63<=0 & 0<=p63] | [p52<=0 & 0<=p52]] | [p41<=0 & 0<=p41]] | [[[p26<=0 & 0<=p26] | [p22<=0 & 0<=p22]] | [p6<=0 & 0<=p6]]]]]]]]]]] & ~ [EX [~ [EX [~ [E [true U E [[1<=p100 & p100<=1] U [p92<=1 & 1<=p92]]]]]]]]]

abstracting: (1<=p92)
states: 4
abstracting: (p92<=1)
states: 204
abstracting: (p100<=1)
states: 204
abstracting: (1<=p100)
states: 8
..abstracting: (0<=p6)
states: 204
abstracting: (p6<=0)
states: 200
abstracting: (0<=p22)
states: 204
abstracting: (p22<=0)
states: 200
abstracting: (0<=p26)
states: 204
abstracting: (p26<=0)
states: 200
abstracting: (0<=p41)
states: 204
abstracting: (p41<=0)
states: 200
abstracting: (0<=p52)
states: 204
abstracting: (p52<=0)
states: 200
abstracting: (0<=p63)
states: 204
abstracting: (p63<=0)
states: 200
abstracting: (1<=p66)
states: 200
abstracting: (p66<=1)
states: 204
abstracting: (1<=p79)
states: 4
abstracting: (p79<=1)
states: 204
abstracting: (1<=p11)
states: 4
abstracting: (p11<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (1<=p76)
states: 196
abstracting: (p76<=1)
states: 204
abstracting: (1<=p109)
states: 4
abstracting: (p109<=1)
states: 204
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: ~ [E [~ [[[[[p8<=1 & 1<=p8] & [[p25<=1 & 1<=p25] & [p32<=1 & 1<=p32]]] & [[p59<=1 & 1<=p59] & [[p75<=1 & 1<=p75] & [p101<=1 & 1<=p101]]]] | ~ [[~ [[[p15<=1 & 1<=p15] & [p99<=1 & 1<=p99]]] & ~ [[[[p6<=1 & 1<=p6] & [[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]] & [[p41<=1 & 1<=p41] & [[p52<=1 & 1<=p52] & [p63<=1 & 1<=p63]]]]]]]]] U [[p62<=1 & 1<=p62] & [p65<=1 & 1<=p65]]]]
normalized: ~ [E [~ [[~ [[~ [[[[[p63<=1 & 1<=p63] & [p52<=1 & 1<=p52]] & [p41<=1 & 1<=p41]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p6<=1 & 1<=p6]]]] & ~ [[[p99<=1 & 1<=p99] & [p15<=1 & 1<=p15]]]]] | [[[[p101<=1 & 1<=p101] & [p75<=1 & 1<=p75]] & [p59<=1 & 1<=p59]] & [[[p32<=1 & 1<=p32] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]]]]] U [[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]]]]

abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 204
abstracting: (1<=p25)
states: 16
abstracting: (p25<=1)
states: 204
abstracting: (1<=p32)
states: 16
abstracting: (p32<=1)
states: 204
abstracting: (1<=p59)
states: 8
abstracting: (p59<=1)
states: 204
abstracting: (1<=p75)
states: 196
abstracting: (p75<=1)
states: 204
abstracting: (1<=p101)
states: 8
abstracting: (p101<=1)
states: 204
abstracting: (1<=p15)
states: 8
abstracting: (p15<=1)
states: 204
abstracting: (1<=p99)
states: 20
abstracting: (p99<=1)
states: 204
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 204
abstracting: (1<=p22)
states: 4
abstracting: (p22<=1)
states: 204
abstracting: (1<=p26)
states: 4
abstracting: (p26<=1)
states: 204
abstracting: (1<=p41)
states: 4
abstracting: (p41<=1)
states: 204
abstracting: (1<=p52)
states: 4
abstracting: (p52<=1)
states: 204
abstracting: (1<=p63)
states: 4
abstracting: (p63<=1)
states: 204
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [AF [AG [[AX [[[p45<=0 & 0<=p45] | [p84<=0 & 0<=p84]]] | AF [[[p69<=0 & 0<=p69] | [p90<=0 & 0<=p90]]]]]] & EG [E [[[[p9<=1 & 1<=p9] & [p23<=1 & 1<=p23]] & [[p33<=1 & 1<=p33] & [[p57<=1 & 1<=p57] & [p108<=1 & 1<=p108]]]] U ~ [[EX [[p107<=1 & 1<=p107]] | [[~ [[p100<=1 & 1<=p100]] & [[p0<=1 & 1<=p0] & [p81<=1 & 1<=p81]]] | [[p66<=1 & 1<=p66] & [[p79<=1 & 1<=p79] & [p89<=1 & 1<=p89]]]]]]]]]
normalized: [EG [E [[[[[p108<=1 & 1<=p108] & [p57<=1 & 1<=p57]] & [p33<=1 & 1<=p33]] & [[p23<=1 & 1<=p23] & [p9<=1 & 1<=p9]]] U ~ [[[[[[p89<=1 & 1<=p89] & [p79<=1 & 1<=p79]] & [p66<=1 & 1<=p66]] | [[[p81<=1 & 1<=p81] & [p0<=1 & 1<=p0]] & ~ [[p100<=1 & 1<=p100]]]] | EX [[p107<=1 & 1<=p107]]]]]] & ~ [EG [E [true U ~ [[~ [EG [~ [[[p90<=0 & 0<=p90] | [p69<=0 & 0<=p69]]]]] | ~ [EX [~ [[[p84<=0 & 0<=p84] | [p45<=0 & 0<=p45]]]]]]]]]]]

abstracting: (0<=p45)
states: 204
abstracting: (p45<=0)
states: 200
abstracting: (0<=p84)
states: 204
abstracting: (p84<=0)
states: 188
.abstracting: (0<=p69)
states: 204
abstracting: (p69<=0)
states: 4
abstracting: (0<=p90)
states: 204
abstracting: (p90<=0)
states: 200
....
EG iterations: 4
.
EG iterations: 1
abstracting: (1<=p107)
states: 44
abstracting: (p107<=1)
states: 204
.abstracting: (1<=p100)
states: 8
abstracting: (p100<=1)
states: 204
abstracting: (1<=p0)
states: 4
abstracting: (p0<=1)
states: 204
abstracting: (1<=p81)
states: 16
abstracting: (p81<=1)
states: 204
abstracting: (1<=p66)
states: 200
abstracting: (p66<=1)
states: 204
abstracting: (1<=p79)
states: 4
abstracting: (p79<=1)
states: 204
abstracting: (1<=p89)
states: 4
abstracting: (p89<=1)
states: 204
abstracting: (1<=p9)
states: 4
abstracting: (p9<=1)
states: 204
abstracting: (1<=p23)
states: 4
abstracting: (p23<=1)
states: 204
abstracting: (1<=p33)
states: 4
abstracting: (p33<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (1<=p108)
states: 4
abstracting: (p108<=1)
states: 204
.........................
EG iterations: 25
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [AG [[[p50<=0 & 0<=p50] | [p88<=0 & 0<=p88]]] & [EG [[[[AX [[[p17<=0 & 0<=p17] | [p19<=0 & 0<=p19]]] | [[[p9<=1 & 1<=p9] & [[p23<=1 & 1<=p23] & [p33<=1 & 1<=p33]]] & [[p57<=1 & 1<=p57] & [[p108<=1 & 1<=p108] & [p97<=1 & 1<=p97]]]]] | [[p6<=0 & 0<=p6] | [p22<=0 & 0<=p22]]] | [[[p26<=0 & 0<=p26] | [p41<=0 & 0<=p41]] | [[p52<=0 & 0<=p52] | [p63<=0 & 0<=p63]]]]] & EX [AG [AF [[p104<=1 & 1<=p104]]]]]]
normalized: [[EX [~ [E [true U EG [~ [[p104<=1 & 1<=p104]]]]]] & EG [[[[[p63<=0 & 0<=p63] | [p52<=0 & 0<=p52]] | [[p41<=0 & 0<=p41] | [p26<=0 & 0<=p26]]] | [[[p22<=0 & 0<=p22] | [p6<=0 & 0<=p6]] | [[[[[p97<=1 & 1<=p97] & [p108<=1 & 1<=p108]] & [p57<=1 & 1<=p57]] & [[[p33<=1 & 1<=p33] & [p23<=1 & 1<=p23]] & [p9<=1 & 1<=p9]]] | ~ [EX [~ [[[p19<=0 & 0<=p19] | [p17<=0 & 0<=p17]]]]]]]]]] & ~ [E [true U ~ [[[p88<=0 & 0<=p88] | [p50<=0 & 0<=p50]]]]]]

abstracting: (0<=p50)
states: 204
abstracting: (p50<=0)
states: 196
abstracting: (0<=p88)
states: 204
abstracting: (p88<=0)
states: 198
abstracting: (0<=p17)
states: 204
abstracting: (p17<=0)
states: 160
abstracting: (0<=p19)
states: 204
abstracting: (p19<=0)
states: 196
.abstracting: (1<=p9)
states: 4
abstracting: (p9<=1)
states: 204
abstracting: (1<=p23)
states: 4
abstracting: (p23<=1)
states: 204
abstracting: (1<=p33)
states: 4
abstracting: (p33<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (1<=p108)
states: 4
abstracting: (p108<=1)
states: 204
abstracting: (1<=p97)
states: 98
abstracting: (p97<=1)
states: 204
abstracting: (0<=p6)
states: 204
abstracting: (p6<=0)
states: 200
abstracting: (0<=p22)
states: 204
abstracting: (p22<=0)
states: 200
abstracting: (0<=p26)
states: 204
abstracting: (p26<=0)
states: 200
abstracting: (0<=p41)
states: 204
abstracting: (p41<=0)
states: 200
abstracting: (0<=p52)
states: 204
abstracting: (p52<=0)
states: 200
abstracting: (0<=p63)
states: 204
abstracting: (p63<=0)
states: 200

EG iterations: 0
abstracting: (1<=p104)
states: 8
abstracting: (p104<=1)
states: 204
................................................
EG iterations: 48
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AF [[~ [E [[~ [[[[p28<=1 & 1<=p28] & [p42<=1 & 1<=p42]] & [[p71<=1 & 1<=p71] & [p93<=1 & 1<=p93]]]] & ~ [[[p85<=1 & 1<=p85] & [p104<=1 & 1<=p104]]]] U E [EG [[[[p6<=1 & 1<=p6] & [[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]]] & [[p41<=1 & 1<=p41] & [[p52<=1 & 1<=p52] & [p63<=1 & 1<=p63]]]]] U [[p61<=1 & 1<=p61] & [p64<=1 & 1<=p64]]]]] & E [[[p46<=1 & 1<=p46] & [p49<=1 & 1<=p49]] U EG [~ [[p82<=1 & 1<=p82]]]]]]
normalized: ~ [EG [~ [[E [[[p49<=1 & 1<=p49] & [p46<=1 & 1<=p46]] U EG [~ [[p82<=1 & 1<=p82]]]] & ~ [E [[~ [[[p104<=1 & 1<=p104] & [p85<=1 & 1<=p85]]] & ~ [[[[p93<=1 & 1<=p93] & [p71<=1 & 1<=p71]] & [[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]]]]] U E [EG [[[[[p63<=1 & 1<=p63] & [p52<=1 & 1<=p52]] & [p41<=1 & 1<=p41]] & [[[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]] & [p6<=1 & 1<=p6]]]] U [[p64<=1 & 1<=p64] & [p61<=1 & 1<=p61]]]]]]]]]

abstracting: (1<=p61)
states: 8
abstracting: (p61<=1)
states: 204
abstracting: (1<=p64)
states: 196
abstracting: (p64<=1)
states: 204
abstracting: (1<=p6)
states: 4
abstracting: (p6<=1)
states: 204
abstracting: (1<=p22)
states: 4
abstracting: (p22<=1)
states: 204
abstracting: (1<=p26)
states: 4
abstracting: (p26<=1)
states: 204
abstracting: (1<=p41)
states: 4
abstracting: (p41<=1)
states: 204
abstracting: (1<=p52)
states: 4
abstracting: (p52<=1)
states: 204
abstracting: (1<=p63)
states: 4
abstracting: (p63<=1)
states: 204
....
EG iterations: 4
abstracting: (1<=p28)
states: 4
abstracting: (p28<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (1<=p71)
states: 200
abstracting: (p71<=1)
states: 204
abstracting: (1<=p93)
states: 4
abstracting: (p93<=1)
states: 204
abstracting: (1<=p85)
states: 4
abstracting: (p85<=1)
states: 204
abstracting: (1<=p104)
states: 8
abstracting: (p104<=1)
states: 204
abstracting: (1<=p82)
states: 4
abstracting: (p82<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p46)
states: 98
abstracting: (p46<=1)
states: 204
abstracting: (1<=p49)
states: 4
abstracting: (p49<=1)
states: 204

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EX [A [EF [[[[p7<=1 & 1<=p7] & [p24<=1 & 1<=p24]] & [[p31<=1 & 1<=p31] & [[p74<=1 & 1<=p74] & [p106<=1 & 1<=p106]]]]] U E [[A [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]] U [[[p30<=1 & 1<=p30] & [p44<=1 & 1<=p44]] & [[p56<=1 & 1<=p56] & [p94<=1 & 1<=p94]]]] | [[[p11<=1 & 1<=p11] & [p57<=1 & 1<=p57]] & [[1<=p76 & p76<=1] & [p109<=1 & 1<=p109]]]] U [~ [[[p0<=1 & 1<=p0] & [p81<=1 & 1<=p81]]] | [[p16<=1 & 1<=p16] & [p60<=1 & 1<=p60]]]]]]
normalized: EX [[~ [EG [~ [E [[[[[p109<=1 & 1<=p109] & [1<=p76 & p76<=1]] & [[p57<=1 & 1<=p57] & [p11<=1 & 1<=p11]]] | [~ [EG [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]] & ~ [E [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]] U [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]] & ~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]]]]] U [[[p60<=1 & 1<=p60] & [p16<=1 & 1<=p16]] | ~ [[[p81<=1 & 1<=p81] & [p0<=1 & 1<=p0]]]]]]]] & ~ [E [~ [E [[[[[p109<=1 & 1<=p109] & [1<=p76 & p76<=1]] & [[p57<=1 & 1<=p57] & [p11<=1 & 1<=p11]]] | [~ [EG [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]] & ~ [E [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]] U [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]] & ~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]]]]] U [[[p60<=1 & 1<=p60] & [p16<=1 & 1<=p16]] | ~ [[[p81<=1 & 1<=p81] & [p0<=1 & 1<=p0]]]]]] U [~ [E [[[[[p109<=1 & 1<=p109] & [1<=p76 & p76<=1]] & [[p57<=1 & 1<=p57] & [p11<=1 & 1<=p11]]] | [~ [EG [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]] & ~ [E [~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]] U [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]] & ~ [[[[p94<=1 & 1<=p94] & [p56<=1 & 1<=p56]] & [[p44<=1 & 1<=p44] & [p30<=1 & 1<=p30]]]]]]]]] U [[[p60<=1 & 1<=p60] & [p16<=1 & 1<=p16]] | ~ [[[p81<=1 & 1<=p81] & [p0<=1 & 1<=p0]]]]]] & ~ [E [true U [[[[p106<=1 & 1<=p106] & [p74<=1 & 1<=p74]] & [p31<=1 & 1<=p31]] & [[p24<=1 & 1<=p24] & [p7<=1 & 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 4
abstracting: (p7<=1)
states: 204
abstracting: (1<=p24)
states: 4
abstracting: (p24<=1)
states: 204
abstracting: (1<=p31)
states: 4
abstracting: (p31<=1)
states: 204
abstracting: (1<=p74)
states: 196
abstracting: (p74<=1)
states: 204
abstracting: (1<=p106)
states: 4
abstracting: (p106<=1)
states: 204
abstracting: (1<=p0)
states: 4
abstracting: (p0<=1)
states: 204
abstracting: (1<=p81)
states: 16
abstracting: (p81<=1)
states: 204
abstracting: (1<=p16)
states: 48
abstracting: (p16<=1)
states: 204
abstracting: (1<=p60)
states: 4
abstracting: (p60<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p17)
states: 44
abstracting: (p17<=1)
states: 204
abstracting: (1<=p19)
states: 8
abstracting: (p19<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
..............................................
EG iterations: 46
abstracting: (1<=p11)
states: 4
abstracting: (p11<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (p76<=1)
states: 204
abstracting: (1<=p76)
states: 196
abstracting: (1<=p109)
states: 4
abstracting: (p109<=1)
states: 204
abstracting: (1<=p0)
states: 4
abstracting: (p0<=1)
states: 204
abstracting: (1<=p81)
states: 16
abstracting: (p81<=1)
states: 204
abstracting: (1<=p16)
states: 48
abstracting: (p16<=1)
states: 204
abstracting: (1<=p60)
states: 4
abstracting: (p60<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p17)
states: 44
abstracting: (p17<=1)
states: 204
abstracting: (1<=p19)
states: 8
abstracting: (p19<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
..............................................
EG iterations: 46
abstracting: (1<=p11)
states: 4
abstracting: (p11<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (p76<=1)
states: 204
abstracting: (1<=p76)
states: 196
abstracting: (1<=p109)
states: 4
abstracting: (p109<=1)
states: 204
abstracting: (1<=p0)
states: 4
abstracting: (p0<=1)
states: 204
abstracting: (1<=p81)
states: 16
abstracting: (p81<=1)
states: 204
abstracting: (1<=p16)
states: 48
abstracting: (p16<=1)
states: 204
abstracting: (1<=p60)
states: 4
abstracting: (p60<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p17)
states: 44
abstracting: (p17<=1)
states: 204
abstracting: (1<=p19)
states: 8
abstracting: (p19<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
abstracting: (1<=p30)
states: 2
abstracting: (p30<=1)
states: 204
abstracting: (1<=p44)
states: 2
abstracting: (p44<=1)
states: 204
abstracting: (1<=p56)
states: 2
abstracting: (p56<=1)
states: 204
abstracting: (1<=p94)
states: 2
abstracting: (p94<=1)
states: 204
..............................................
EG iterations: 46
abstracting: (1<=p11)
states: 4
abstracting: (p11<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (p76<=1)
states: 204
abstracting: (1<=p76)
states: 196
abstracting: (1<=p109)
states: 4
abstracting: (p109<=1)
states: 204
....
EG iterations: 4
.-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.039sec

checking: AG [E [[EF [[[p73<=1 & 1<=p73] & [p98<=1 & 1<=p98]]] | ~ [[[AF [[[[p5<=1 & 1<=p5] & [[p20<=1 & 1<=p20] & [p21<=1 & 1<=p21]]] & [[[p27<=1 & 1<=p27] & [p40<=1 & 1<=p40]] & [[p51<=1 & 1<=p51] & [p78<=1 & 1<=p78]]]]] | [[[p35<=1 & 1<=p35] & [[p47<=1 & 1<=p47] & [p53<=1 & 1<=p53]]] & [[[p68<=1 & 1<=p68] & [p96<=1 & 1<=p96]] & [[p69<=1 & 1<=p69] & [p90<=1 & 1<=p90]]]]] | [[p97<=1 & 1<=p97] | [[[p18<=1 & 1<=p18] & [p34<=1 & 1<=p34]] & [[p15<=1 & 1<=p15] & [p99<=1 & 1<=p99]]]]]]] U ~ [A [[[[p28<=1 & 1<=p28] & [p42<=1 & 1<=p42]] & [[p71<=1 & 1<=p71] & [p93<=1 & 1<=p93]]] U [[p37<=1 & 1<=p37] & [p87<=1 & 1<=p87]]]]]]
normalized: ~ [E [true U ~ [E [[~ [[[[[[p99<=1 & 1<=p99] & [p15<=1 & 1<=p15]] & [[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]]] | [p97<=1 & 1<=p97]] | [[[[[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]] & [[p96<=1 & 1<=p96] & [p68<=1 & 1<=p68]]] & [[[p53<=1 & 1<=p53] & [p47<=1 & 1<=p47]] & [p35<=1 & 1<=p35]]] | ~ [EG [~ [[[[[p78<=1 & 1<=p78] & [p51<=1 & 1<=p51]] & [[p40<=1 & 1<=p40] & [p27<=1 & 1<=p27]]] & [[[p21<=1 & 1<=p21] & [p20<=1 & 1<=p20]] & [p5<=1 & 1<=p5]]]]]]]]] | E [true U [[p98<=1 & 1<=p98] & [p73<=1 & 1<=p73]]]] U ~ [[~ [EG [~ [[[p87<=1 & 1<=p87] & [p37<=1 & 1<=p37]]]]] & ~ [E [~ [[[p87<=1 & 1<=p87] & [p37<=1 & 1<=p37]]] U [~ [[[[p93<=1 & 1<=p93] & [p71<=1 & 1<=p71]] & [[p42<=1 & 1<=p42] & [p28<=1 & 1<=p28]]]] & ~ [[[p87<=1 & 1<=p87] & [p37<=1 & 1<=p37]]]]]]]]]]]]

abstracting: (1<=p37)
states: 6
abstracting: (p37<=1)
states: 204
abstracting: (1<=p87)
states: 14
abstracting: (p87<=1)
states: 204
abstracting: (1<=p28)
states: 4
abstracting: (p28<=1)
states: 204
abstracting: (1<=p42)
states: 4
abstracting: (p42<=1)
states: 204
abstracting: (1<=p71)
states: 200
abstracting: (p71<=1)
states: 204
abstracting: (1<=p93)
states: 4
abstracting: (p93<=1)
states: 204
abstracting: (1<=p37)
states: 6
abstracting: (p37<=1)
states: 204
abstracting: (1<=p87)
states: 14
abstracting: (p87<=1)
states: 204
abstracting: (1<=p37)
states: 6
abstracting: (p37<=1)
states: 204
abstracting: (1<=p87)
states: 14
abstracting: (p87<=1)
states: 204
..............................................
EG iterations: 46
abstracting: (1<=p73)
states: 200
abstracting: (p73<=1)
states: 204
abstracting: (1<=p98)
states: 4
abstracting: (p98<=1)
states: 204
abstracting: (1<=p5)
states: 4
abstracting: (p5<=1)
states: 204
abstracting: (1<=p20)
states: 200
abstracting: (p20<=1)
states: 204
abstracting: (1<=p21)
states: 4
abstracting: (p21<=1)
states: 204
abstracting: (1<=p27)
states: 4
abstracting: (p27<=1)
states: 204
abstracting: (1<=p40)
states: 4
abstracting: (p40<=1)
states: 204
abstracting: (1<=p51)
states: 4
abstracting: (p51<=1)
states: 204
abstracting: (1<=p78)
states: 4
abstracting: (p78<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p35)
states: 4
abstracting: (p35<=1)
states: 204
abstracting: (1<=p47)
states: 4
abstracting: (p47<=1)
states: 204
abstracting: (1<=p53)
states: 4
abstracting: (p53<=1)
states: 204
abstracting: (1<=p68)
states: 196
abstracting: (p68<=1)
states: 204
abstracting: (1<=p96)
states: 4
abstracting: (p96<=1)
states: 204
abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
abstracting: (1<=p97)
states: 98
abstracting: (p97<=1)
states: 204
abstracting: (1<=p18)
states: 20
abstracting: (p18<=1)
states: 204
abstracting: (1<=p34)
states: 4
abstracting: (p34<=1)
states: 204
abstracting: (1<=p15)
states: 8
abstracting: (p15<=1)
states: 204
abstracting: (1<=p99)
states: 20
abstracting: (p99<=1)
states: 204
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: A [[[~ [A [[[p37<=1 & 1<=p37] & [p87<=1 & 1<=p87]] U [[p69<=1 & 1<=p69] & [p90<=1 & 1<=p90]]]] | [A [EX [[[[p12<=1 & 1<=p12] & [[p58<=1 & 1<=p58] & [p103<=1 & 1<=p103]]] | [[p37<=1 & 1<=p37] & [p87<=1 & 1<=p87]]]] U EX [[[p62<=1 & 1<=p62] & [p65<=1 & 1<=p65]]]] | EX [[AX [[[p62<=1 & 1<=p62] & [p65<=1 & 1<=p65]]] & [[p45<=1 & 1<=p45] & [p84<=1 & 1<=p84]]]]]] | [AF [[[[p29<=1 & 1<=p29] & [[p39<=1 & 1<=p39] & [p43<=1 & 1<=p43]]] & [[p55<=1 & 1<=p55] & [[p72<=1 & 1<=p72] & [p86<=1 & 1<=p86]]]]] | [[AF [[[p17<=1 & 1<=p17] & [p19<=1 & 1<=p19]]] & [~ [[[p46<=1 & 1<=p46] & [p49<=1 & 1<=p49]]] & [~ [[[p0<=1 & 1<=p0] & [p81<=1 & 1<=p81]]] | [[[p36<=1 & 1<=p36] & [[p48<=1 & 1<=p48] & [p54<=1 & 1<=p54]]] & [[p80<=1 & 1<=p80] & [[p1<=1 & 1<=p1] & [p91<=1 & 1<=p91]]]]]]] | [~ [EX [[[p45<=1 & 1<=p45] & [p84<=1 & 1<=p84]]]] & AX [1<=0]]]]] U [p85<=1 & 1<=p85]]
normalized: [~ [EG [~ [[p85<=1 & 1<=p85]]]] & ~ [E [~ [[p85<=1 & 1<=p85]] U [~ [[[[[~ [EX [~ [1<=0]]] & ~ [EX [[[p84<=1 & 1<=p84] & [p45<=1 & 1<=p45]]]]] | [[[[[[[p91<=1 & 1<=p91] & [p1<=1 & 1<=p1]] & [p80<=1 & 1<=p80]] & [[[p54<=1 & 1<=p54] & [p48<=1 & 1<=p48]] & [p36<=1 & 1<=p36]]] | ~ [[[p81<=1 & 1<=p81] & [p0<=1 & 1<=p0]]]] & ~ [[[p49<=1 & 1<=p49] & [p46<=1 & 1<=p46]]]] & ~ [EG [~ [[[p19<=1 & 1<=p19] & [p17<=1 & 1<=p17]]]]]]] | ~ [EG [~ [[[[[p86<=1 & 1<=p86] & [p72<=1 & 1<=p72]] & [p55<=1 & 1<=p55]] & [[[p43<=1 & 1<=p43] & [p39<=1 & 1<=p39]] & [p29<=1 & 1<=p29]]]]]]] | [[EX [[[[p84<=1 & 1<=p84] & [p45<=1 & 1<=p45]] & ~ [EX [~ [[[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]]]]]]] | [~ [EG [~ [EX [[[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]]]]]] & ~ [E [~ [EX [[[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]]]] U [~ [EX [[[[p87<=1 & 1<=p87] & [p37<=1 & 1<=p37]] | [[[p103<=1 & 1<=p103] & [p58<=1 & 1<=p58]] & [p12<=1 & 1<=p12]]]]] & ~ [EX [[[p65<=1 & 1<=p65] & [p62<=1 & 1<=p62]]]]]]]]] | ~ [[~ [EG [~ [[[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]]]]] & ~ [E [~ [[[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]]] U [~ [[[p87<=1 & 1<=p87] & [p37<=1 & 1<=p37]]] & ~ [[[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]]]]]]]]]]] & ~ [[p85<=1 & 1<=p85]]]]]]

abstracting: (1<=p85)
states: 4
abstracting: (p85<=1)
states: 204
abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
abstracting: (1<=p37)
states: 6
abstracting: (p37<=1)
states: 204
abstracting: (1<=p87)
states: 14
abstracting: (p87<=1)
states: 204
abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
.abstracting: (1<=p12)
states: 8
abstracting: (p12<=1)
states: 204
abstracting: (1<=p58)
states: 8
abstracting: (p58<=1)
states: 204
abstracting: (1<=p103)
states: 8
abstracting: (p103<=1)
states: 204
abstracting: (1<=p37)
states: 6
abstracting: (p37<=1)
states: 204
abstracting: (1<=p87)
states: 14
abstracting: (p87<=1)
states: 204
.abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
.abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
...............................................
EG iterations: 46
abstracting: (1<=p62)
states: 20
abstracting: (p62<=1)
states: 204
abstracting: (1<=p65)
states: 4
abstracting: (p65<=1)
states: 204
.abstracting: (1<=p45)
states: 4
abstracting: (p45<=1)
states: 204
abstracting: (1<=p84)
states: 16
abstracting: (p84<=1)
states: 204
.abstracting: (1<=p29)
states: 8
abstracting: (p29<=1)
states: 204
abstracting: (1<=p39)
states: 4
abstracting: (p39<=1)
states: 204
abstracting: (1<=p43)
states: 8
abstracting: (p43<=1)
states: 204
abstracting: (1<=p55)
states: 4
abstracting: (p55<=1)
states: 204
abstracting: (1<=p72)
states: 200
abstracting: (p72<=1)
states: 204
abstracting: (1<=p86)
states: 4
abstracting: (p86<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p17)
states: 44
abstracting: (p17<=1)
states: 204
abstracting: (1<=p19)
states: 8
abstracting: (p19<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p46)
states: 98
abstracting: (p46<=1)
states: 204
abstracting: (1<=p49)
states: 4
abstracting: (p49<=1)
states: 204
abstracting: (1<=p0)
states: 4
abstracting: (p0<=1)
states: 204
abstracting: (1<=p81)
states: 16
abstracting: (p81<=1)
states: 204
abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 204
abstracting: (1<=p54)
states: 4
abstracting: (p54<=1)
states: 204
abstracting: (1<=p80)
states: 4
abstracting: (p80<=1)
states: 204
abstracting: (1<=p1)
states: 4
abstracting: (p1<=1)
states: 204
abstracting: (1<=p91)
states: 16
abstracting: (p91<=1)
states: 204
abstracting: (1<=p45)
states: 4
abstracting: (p45<=1)
states: 204
abstracting: (1<=p84)
states: 16
abstracting: (p84<=1)
states: 204
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p85)
states: 4
abstracting: (p85<=1)
states: 204
abstracting: (1<=p85)
states: 4
abstracting: (p85<=1)
states: 204
...............................................
EG iterations: 47
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: [E [A [EF [[[p14<=1 & 1<=p14] & [p102<=1 & 1<=p102]]] U [~ [EX [[[[p8<=1 & 1<=p8] & [[p25<=1 & 1<=p25] & [p32<=1 & 1<=p32]]] & [[p59<=1 & 1<=p59] & [[p75<=1 & 1<=p75] & [p101<=1 & 1<=p101]]]]]] | [[[p36<=1 & 1<=p36] & [p48<=1 & 1<=p48]] & [[p54<=1 & 1<=p54] & [p80<=1 & 1<=p80]]]]] U [AG [[[EF [[[p69<=1 & 1<=p69] & [p90<=1 & 1<=p90]]] & [p38<=1 & 1<=p38]] & [[p67<=1 & 1<=p67] & [p95<=1 & 1<=p95]]]] & [EF [EX [[[p69<=1 & 1<=p69] & [p90<=1 & 1<=p90]]]] & [[p107<=1 & 1<=p107] | AX [AX [[p2<=1 & 1<=p2]]]]]]] | [EF [[AG [[[[p11<=1 & 1<=p11] & [p57<=1 & 1<=p57]] & [[p76<=1 & 1<=p76] & [p109<=1 & 1<=p109]]]] | [EG [[[[p36<=1 & 1<=p36] & [p48<=1 & 1<=p48]] & [[p54<=1 & 1<=p54] & [p80<=1 & 1<=p80]]]] | AF [[[p46<=1 & 1<=p46] & [p49<=1 & 1<=p49]]]]]] & [EX [EG [A [[p110<=1 & 1<=p110] U [p92<=1 & 1<=p92]]]] & [AF [AG [E [[[p12<=1 & 1<=p12] & [[p58<=1 & 1<=p58] & [p103<=1 & 1<=p103]]] U [[p18<=1 & 1<=p18] & [p34<=1 & 1<=p34]]]]] | EX [[[p89<=1 & 1<=p89] | [A [[[[p29<=1 & 1<=p29] & [[p39<=1 & 1<=p39] & [p43<=1 & 1<=p43]]] & [[p55<=1 & 1<=p55] & [[p72<=1 & 1<=p72] & [p86<=1 & 1<=p86]]]] U [[p73<=1 & 1<=p73] & [p98<=1 & 1<=p98]]] & [[p46<=1 & 1<=p46] & [p49<=1 & 1<=p49]]]]]]]]]
normalized: [[[EX [EG [[~ [EG [~ [[p92<=1 & 1<=p92]]]] & ~ [E [~ [[p92<=1 & 1<=p92]] U [~ [[p110<=1 & 1<=p110]] & ~ [[p92<=1 & 1<=p92]]]]]]]] & [EX [[[[[p49<=1 & 1<=p49] & [p46<=1 & 1<=p46]] & [~ [EG [~ [[[p98<=1 & 1<=p98] & [p73<=1 & 1<=p73]]]]] & ~ [E [~ [[[p98<=1 & 1<=p98] & [p73<=1 & 1<=p73]]] U [~ [[[[[p86<=1 & 1<=p86] & [p72<=1 & 1<=p72]] & [p55<=1 & 1<=p55]] & [[[p43<=1 & 1<=p43] & [p39<=1 & 1<=p39]] & [p29<=1 & 1<=p29]]]] & ~ [[[p98<=1 & 1<=p98] & [p73<=1 & 1<=p73]]]]]]]] | [p89<=1 & 1<=p89]]] | ~ [EG [E [true U ~ [E [[[[p103<=1 & 1<=p103] & [p58<=1 & 1<=p58]] & [p12<=1 & 1<=p12]] U [[p34<=1 & 1<=p34] & [p18<=1 & 1<=p18]]]]]]]]] & E [true U [[~ [EG [~ [[[p49<=1 & 1<=p49] & [p46<=1 & 1<=p46]]]]] | EG [[[[p80<=1 & 1<=p80] & [p54<=1 & 1<=p54]] & [[p48<=1 & 1<=p48] & [p36<=1 & 1<=p36]]]]] | ~ [E [true U ~ [[[[p109<=1 & 1<=p109] & [p76<=1 & 1<=p76]] & [[p57<=1 & 1<=p57] & [p11<=1 & 1<=p11]]]]]]]]] | E [[~ [EG [~ [[[[[p80<=1 & 1<=p80] & [p54<=1 & 1<=p54]] & [[p48<=1 & 1<=p48] & [p36<=1 & 1<=p36]]] | ~ [EX [[[[[p101<=1 & 1<=p101] & [p75<=1 & 1<=p75]] & [p59<=1 & 1<=p59]] & [[[p32<=1 & 1<=p32] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]]]]]]]]] & ~ [E [~ [[[[[p80<=1 & 1<=p80] & [p54<=1 & 1<=p54]] & [[p48<=1 & 1<=p48] & [p36<=1 & 1<=p36]]] | ~ [EX [[[[[p101<=1 & 1<=p101] & [p75<=1 & 1<=p75]] & [p59<=1 & 1<=p59]] & [[[p32<=1 & 1<=p32] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]]]]]]] U [~ [E [true U [[p102<=1 & 1<=p102] & [p14<=1 & 1<=p14]]]] & ~ [[[[[p80<=1 & 1<=p80] & [p54<=1 & 1<=p54]] & [[p48<=1 & 1<=p48] & [p36<=1 & 1<=p36]]] | ~ [EX [[[[[p101<=1 & 1<=p101] & [p75<=1 & 1<=p75]] & [p59<=1 & 1<=p59]] & [[[p32<=1 & 1<=p32] & [p25<=1 & 1<=p25]] & [p8<=1 & 1<=p8]]]]]]]]]]] U [[[~ [EX [EX [~ [[p2<=1 & 1<=p2]]]]] | [p107<=1 & 1<=p107]] & E [true U EX [[[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]]]]] & ~ [E [true U ~ [[[[p95<=1 & 1<=p95] & [p67<=1 & 1<=p67]] & [[p38<=1 & 1<=p38] & E [true U [[p90<=1 & 1<=p90] & [p69<=1 & 1<=p69]]]]]]]]]]]

abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
abstracting: (1<=p38)
states: 4
abstracting: (p38<=1)
states: 204
abstracting: (1<=p67)
states: 198
abstracting: (p67<=1)
states: 204
abstracting: (1<=p95)
states: 2
abstracting: (p95<=1)
states: 204
abstracting: (1<=p69)
states: 200
abstracting: (p69<=1)
states: 204
abstracting: (1<=p90)
states: 4
abstracting: (p90<=1)
states: 204
.abstracting: (1<=p107)
states: 44
abstracting: (p107<=1)
states: 204
abstracting: (1<=p2)
states: 4
abstracting: (p2<=1)
states: 204
..abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 204
abstracting: (1<=p25)
states: 16
abstracting: (p25<=1)
states: 204
abstracting: (1<=p32)
states: 16
abstracting: (p32<=1)
states: 204
abstracting: (1<=p59)
states: 8
abstracting: (p59<=1)
states: 204
abstracting: (1<=p75)
states: 196
abstracting: (p75<=1)
states: 204
abstracting: (1<=p101)
states: 8
abstracting: (p101<=1)
states: 204
.abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 204
abstracting: (1<=p54)
states: 4
abstracting: (p54<=1)
states: 204
abstracting: (1<=p80)
states: 4
abstracting: (p80<=1)
states: 204
abstracting: (1<=p14)
states: 8
abstracting: (p14<=1)
states: 204
abstracting: (1<=p102)
states: 24
abstracting: (p102<=1)
states: 204
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 204
abstracting: (1<=p25)
states: 16
abstracting: (p25<=1)
states: 204
abstracting: (1<=p32)
states: 16
abstracting: (p32<=1)
states: 204
abstracting: (1<=p59)
states: 8
abstracting: (p59<=1)
states: 204
abstracting: (1<=p75)
states: 196
abstracting: (p75<=1)
states: 204
abstracting: (1<=p101)
states: 8
abstracting: (p101<=1)
states: 204
.abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 204
abstracting: (1<=p54)
states: 4
abstracting: (p54<=1)
states: 204
abstracting: (1<=p80)
states: 4
abstracting: (p80<=1)
states: 204
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 204
abstracting: (1<=p25)
states: 16
abstracting: (p25<=1)
states: 204
abstracting: (1<=p32)
states: 16
abstracting: (p32<=1)
states: 204
abstracting: (1<=p59)
states: 8
abstracting: (p59<=1)
states: 204
abstracting: (1<=p75)
states: 196
abstracting: (p75<=1)
states: 204
abstracting: (1<=p101)
states: 8
abstracting: (p101<=1)
states: 204
.abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 204
abstracting: (1<=p54)
states: 4
abstracting: (p54<=1)
states: 204
abstracting: (1<=p80)
states: 4
abstracting: (p80<=1)
states: 204
.....
EG iterations: 5
abstracting: (1<=p11)
states: 4
abstracting: (p11<=1)
states: 204
abstracting: (1<=p57)
states: 8
abstracting: (p57<=1)
states: 204
abstracting: (1<=p76)
states: 196
abstracting: (p76<=1)
states: 204
abstracting: (1<=p109)
states: 4
abstracting: (p109<=1)
states: 204
abstracting: (1<=p36)
states: 4
abstracting: (p36<=1)
states: 204
abstracting: (1<=p48)
states: 4
abstracting: (p48<=1)
states: 204
abstracting: (1<=p54)
states: 4
abstracting: (p54<=1)
states: 204
abstracting: (1<=p80)
states: 4
abstracting: (p80<=1)
states: 204
....
EG iterations: 4
abstracting: (1<=p46)
states: 98
abstracting: (p46<=1)
states: 204
abstracting: (1<=p49)
states: 4
abstracting: (p49<=1)
states: 204
..............................................
EG iterations: 46
abstracting: (1<=p18)
states: 20
abstracting: (p18<=1)
states: 204
abstracting: (1<=p34)
states: 4
abstracting: (p34<=1)
states: 204
abstracting: (1<=p12)
states: 8
abstracting: (p12<=1)
states: 204
abstracting: (1<=p58)
states: 8
abstracting: (p58<=1)
states: 204
abstracting: (1<=p103)
states: 8
abstracting: (p103<=1)
states: 204

EG iterations: 0
abstracting: (1<=p89)
states: 4
abstracting: (p89<=1)
states: 204
abstracting: (1<=p73)
states: 200
abstracting: (p73<=1)
states: 204
abstracting: (1<=p98)
states: 4
abstracting: (p98<=1)
states: 204
abstracting: (1<=p29)
states: 8
abstracting: (p29<=1)
states: 204
abstracting: (1<=p39)
states: 4
abstracting: (p39<=1)
states: 204
abstracting: (1<=p43)
states: 8
abstracting: (p43<=1)
states: 204
abstracting: (1<=p55)
states: 4
abstracting: (p55<=1)
states: 204
abstracting: (1<=p72)
states: 200
abstracting: (p72<=1)
states: 204
abstracting: (1<=p86)
states: 4
abstracting: (p86<=1)
states: 204
abstracting: (1<=p73)
states: 200
abstracting: (p73<=1)
states: 204
abstracting: (1<=p98)
states: 4
abstracting: (p98<=1)
states: 204
abstracting: (1<=p73)
states: 200
abstracting: (p73<=1)
states: 204
abstracting: (1<=p98)
states: 4
abstracting: (p98<=1)
states: 204
...............................................
EG iterations: 47
abstracting: (1<=p46)
states: 98
abstracting: (p46<=1)
states: 204
abstracting: (1<=p49)
states: 4
abstracting: (p49<=1)
states: 204
.abstracting: (1<=p92)
states: 4
abstracting: (p92<=1)
states: 204
abstracting: (1<=p110)
states: 98
abstracting: (p110<=1)
states: 204
abstracting: (1<=p92)
states: 4
abstracting: (p92<=1)
states: 204
abstracting: (1<=p92)
states: 4
abstracting: (p92<=1)
states: 204
...............................................
EG iterations: 47
....
EG iterations: 4
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.094sec

totally nodes used: 501339 (5.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 233467 1410819 1644286
used/not used/entry size/cache size: 1906466 65202398 16 1024MB
basic ops cache: hits/miss/sum: 16173 181472 197645
used/not used/entry size/cache size: 324580 16452636 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: 1266 7258 8524
used/not used/entry size/cache size: 7257 8381351 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 66667514
1 389118
2 45192
3 6357
4 650
5 32
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.950sec


BK_STOP 1679451049840

--------------------
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:457 (10), effective:83 (1)

initing FirstDep: 0m 0.000sec


iterations count:258 (5), effective:44 (0)

iterations count:258 (5), effective:44 (0)

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

iterations count:258 (5), effective:44 (0)

iterations count:257 (5), effective:44 (0)

iterations count:257 (5), effective:44 (0)

iterations count:255 (5), effective:44 (0)

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

iterations count:257 (5), effective:44 (0)

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

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

iterations count:257 (5), effective:44 (0)

iterations count:256 (5), effective:44 (0)

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

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

iterations count:257 (5), effective:44 (0)

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

iterations count:161 (3), effective:27 (0)

iterations count:257 (5), effective:44 (0)

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

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

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

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

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

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

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

iterations count:255 (5), effective:44 (0)

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

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

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

iterations count:257 (5), effective:44 (0)

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

iterations count:256 (5), effective:44 (0)

iterations count:257 (5), effective:44 (0)

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

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

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

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

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

iterations count:48 (1), effective:1 (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="IOTPpurchase-PT-C01M01P01D01"
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 IOTPpurchase-PT-C01M01P01D01, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419800106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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