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.r330-tall-167889203100298.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 Raft-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203100298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.3K Feb 26 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 17:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 17:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 17:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 17:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 24K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679139886024

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=Raft-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 11:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 11:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:44:47] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-18 11:44:47] [INFO ] Transformed 53 places.
[2023-03-18 11:44:47] [INFO ] Transformed 98 transitions.
[2023-03-18 11:44:47] [INFO ] Found NUPN structural information;
[2023-03-18 11:44:47] [INFO ] Parsed PT model containing 53 places and 98 transitions and 328 arcs in 97 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA Raft-PT-03-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 53 /53 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2023-03-18 11:44:47] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
// Phase 1: matrix 73 rows 53 cols
[2023-03-18 11:44:48] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-18 11:44:48] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-18 11:44:48] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
[2023-03-18 11:44:48] [INFO ] Invariant cache hit.
[2023-03-18 11:44:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 11:44:48] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-18 11:44:48] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
[2023-03-18 11:44:48] [INFO ] Invariant cache hit.
[2023-03-18 11:44:48] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 53/53 places, 84/84 transitions.
Support contains 47 out of 53 places after structural reductions.
[2023-03-18 11:44:48] [INFO ] Flatten gal took : 24 ms
[2023-03-18 11:44:48] [INFO ] Flatten gal took : 9 ms
[2023-03-18 11:44:48] [INFO ] Input system was already deterministic with 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 60) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 11:44:48] [INFO ] Flow matrix only has 73 transitions (discarded 11 similar events)
[2023-03-18 11:44:48] [INFO ] Invariant cache hit.
[2023-03-18 11:44:49] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-18 11:44:49] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 84 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 4 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 3 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 5 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 82
Applied a total of 2 rules in 3 ms. Remains 52 /53 variables (removed 1) and now considering 82/84 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/53 places, 82/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 80
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 51 transition count 79
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 0 with 2 rules applied. Total rules applied 7 place count 50 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 48 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 48 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 48 transition count 74
Applied a total of 13 rules in 17 ms. Remains 48 /53 variables (removed 5) and now considering 74/84 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 48/53 places, 74/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 80
Applied a total of 4 rules in 7 ms. Remains 51 /53 variables (removed 2) and now considering 80/84 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 51/53 places, 80/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 82
Applied a total of 2 rules in 1 ms. Remains 52 /53 variables (removed 1) and now considering 82/84 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/53 places, 82/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 80
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 0 with 2 rules applied. Total rules applied 6 place count 50 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 48 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 48 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 48 transition count 75
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 48 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 46 transition count 71
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 42 transition count 67
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 42 transition count 67
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 30 place count 42 transition count 63
Applied a total of 30 rules in 12 ms. Remains 42 /53 variables (removed 11) and now considering 63/84 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 42/53 places, 63/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 80
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 80/84 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/53 places, 80/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 50 transition count 77
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 0 with 2 rules applied. Total rules applied 9 place count 49 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 11 place count 47 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 47 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 47 transition count 72
Applied a total of 15 rules in 9 ms. Remains 47 /53 variables (removed 6) and now considering 72/84 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 47/53 places, 72/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 2 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 50 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 47 transition count 72
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 21 place count 41 transition count 66
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 41 transition count 66
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 33 place count 41 transition count 60
Applied a total of 33 rules in 10 ms. Remains 41 /53 variables (removed 12) and now considering 60/84 (removed 24) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 41/53 places, 60/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 2 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 51 transition count 80
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 51 transition count 80
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 80/84 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 51/53 places, 80/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 84/84 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 78
Applied a total of 6 rules in 1 ms. Remains 50 /53 variables (removed 3) and now considering 78/84 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 50/53 places, 78/84 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 3 ms
[2023-03-18 11:44:49] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 4 ms
[2023-03-18 11:44:49] [INFO ] Flatten gal took : 10 ms
[2023-03-18 11:44:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 11:44:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 84 transitions and 300 arcs took 1 ms.
Total runtime 1894 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: 53 NrTr: 84 NrArc: 300)

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

net check time: 0m 0.000sec

init dd package: 0m 2.750sec


RS generation: 0m 0.108sec


-> reachability set: #nodes 639 (6.4e+02) #states 33,819,621 (7)



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

checking: EF [[EX [[p44<=0 & 0<=p44]] | [[p40<=1 & 1<=p40] & [p46<=1 & 1<=p46]]]]
normalized: E [true U [EX [[p44<=0 & 0<=p44]] | [[p40<=1 & 1<=p40] & [p46<=1 & 1<=p46]]]]

abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (0<=p44)
states: 33,819,621 (7)
abstracting: (p44<=0)
states: 27,317,841 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: E [E [AG [AF [[p45<=1 & 1<=p45]]] U [[p3<=1 & 1<=p3] & [p40<=1 & 1<=p40]]] U [[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]]]
normalized: E [E [~ [E [true U EG [~ [[p45<=1 & 1<=p45]]]]] U [[p40<=1 & 1<=p40] & [p3<=1 & 1<=p3]]] U [[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]]

abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p3)
states: 6,501,780 (6)
abstracting: (p3<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: EF [[~ [A [EF [[[p31<=1 & 1<=p31] & [p52<=1 & 1<=p52]]] U EF [[p35<=1 & 1<=p35]]]] & ~ [A [EF [[[p20<=1 & 1<=p20] & [p40<=1 & 1<=p40]]] U [p51<=1 & 1<=p51]]]]]
normalized: E [true U [~ [[~ [EG [~ [[p51<=1 & 1<=p51]]]] & ~ [E [~ [[p51<=1 & 1<=p51]] U [~ [E [true U [[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]]] & ~ [[p51<=1 & 1<=p51]]]]]]] & ~ [[~ [EG [~ [E [true U [p35<=1 & 1<=p35]]]]] & ~ [E [~ [E [true U [p35<=1 & 1<=p35]]] U [~ [E [true U [[p52<=1 & 1<=p52] & [p31<=1 & 1<=p31]]]] & ~ [E [true U [p35<=1 & 1<=p35]]]]]]]]]]

abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p31)
states: 6,501,780 (6)
abstracting: (p31<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: EF [AG [EX [[[AF [[[p8<=1 & 1<=p8] & [p45<=1 & 1<=p45]]] | [[p42<=1 & 1<=p42] | [p6<=0 & 0<=p6]]] | [[p45<=0 & 0<=p45] | [[[p12<=1 & 1<=p12] & [p35<=1 & 1<=p35]] | [[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]]]]]]]
normalized: E [true U ~ [E [true U ~ [EX [[[[[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]] | [[p35<=1 & 1<=p35] & [p12<=1 & 1<=p12]]] | [p45<=0 & 0<=p45]] | [[[p6<=0 & 0<=p6] | [p42<=1 & 1<=p42]] | ~ [EG [~ [[[p45<=1 & 1<=p45] & [p8<=1 & 1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 6,501,780 (6)
abstracting: (p8<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p42<=1)
states: 33,819,621 (7)
abstracting: (0<=p6)
states: 33,819,621 (7)
abstracting: (p6<=0)
states: 27,317,841 (7)
abstracting: (0<=p45)
states: 33,819,621 (7)
abstracting: (p45<=0)
states: 26,007,121 (7)
abstracting: (1<=p12)
states: 6,501,780 (6)
abstracting: (p12<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [E [A [[p40<=1 & 1<=p40] U E [EX [[[p17<=1 & 1<=p17] & [p45<=1 & 1<=p45]]] U [p37<=1 & 1<=p37]]] U ~ [EG [[[p32<=1 & 1<=p32] & A [[[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]] U [[p35<=1 & 1<=p35] & [p48<=1 & 1<=p48]]]]]]]]
normalized: ~ [E [true U ~ [E [[~ [EG [~ [E [EX [[[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]] U [p37<=1 & 1<=p37]]]]] & ~ [E [~ [E [EX [[[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]] U [p37<=1 & 1<=p37]]] U [~ [[p40<=1 & 1<=p40]] & ~ [E [EX [[[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]] U [p37<=1 & 1<=p37]]]]]]] U ~ [EG [[[~ [EG [~ [[[p48<=1 & 1<=p48] & [p35<=1 & 1<=p35]]]]] & ~ [E [~ [[[p48<=1 & 1<=p48] & [p35<=1 & 1<=p35]]] U [~ [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]] & ~ [[[p48<=1 & 1<=p48] & [p35<=1 & 1<=p35]]]]]]] & [p32<=1 & 1<=p32]]]]]]]]

abstracting: (1<=p32)
states: 6,501,780 (6)
abstracting: (p32<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p37)
states: 6,501,780 (6)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p17<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p37)
states: 6,501,780 (6)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p17<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.abstracting: (1<=p37)
states: 6,501,780 (6)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p17<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
...
EG iterations: 2
-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.065sec

checking: EF [EX [[AX [[[p40<=1 & 1<=p40] & [p46<=1 & 1<=p46]]] & EX [[[E [[[p27<=1 & 1<=p27] & [p40<=1 & 1<=p40]] U [[p23<=1 & 1<=p23] & [p35<=1 & 1<=p35]]] & [p10<=1 & 1<=p10]] & [[p35<=1 & 1<=p35] & [[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]]]]]]]]
normalized: E [true U EX [[EX [[[[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]] & [p35<=1 & 1<=p35]] & [[p10<=1 & 1<=p10] & E [[[p40<=1 & 1<=p40] & [p27<=1 & 1<=p27]] U [[p35<=1 & 1<=p35] & [p23<=1 & 1<=p23]]]]]] & ~ [EX [~ [[[p46<=1 & 1<=p46] & [p40<=1 & 1<=p40]]]]]]]]

abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
.abstracting: (1<=p23)
states: 6,501,780 (6)
abstracting: (p23<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p27)
states: 6,501,780 (6)
abstracting: (p27<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [[EX [AF [[[p28<=1 & 1<=p28] & [p40<=1 & 1<=p40]]]] | EX [[EX [[[p1<=0 & 0<=p1] | [p40<=0 & 0<=p40]]] | [[[[p5<=0 & 0<=p5] | [p35<=0 & 0<=p35]] & [[p17<=0 & 0<=p17] | [p45<=0 & 0<=p45]]] | [[p19<=1 & 1<=p19] & [p45<=1 & 1<=p45]]]]]]]
normalized: EG [[EX [[[[[p45<=1 & 1<=p45] & [p19<=1 & 1<=p19]] | [[[p45<=0 & 0<=p45] | [p17<=0 & 0<=p17]] & [[p35<=0 & 0<=p35] | [p5<=0 & 0<=p5]]]] | EX [[[p40<=0 & 0<=p40] | [p1<=0 & 0<=p1]]]]] | EX [~ [EG [~ [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]]]]]]]]

abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.abstracting: (0<=p1)
states: 33,819,621 (7)
abstracting: (p1<=0)
states: 27,317,841 (7)
abstracting: (0<=p40)
states: 33,819,621 (7)
abstracting: (p40<=0)
states: 26,007,121 (7)
.abstracting: (0<=p5)
states: 33,819,621 (7)
abstracting: (p5<=0)
states: 26,007,121 (7)
abstracting: (0<=p35)
states: 33,819,621 (7)
abstracting: (p35<=0)
states: 26,007,121 (7)
abstracting: (0<=p17)
states: 33,819,621 (7)
abstracting: (p17<=0)
states: 27,317,841 (7)
abstracting: (0<=p45)
states: 33,819,621 (7)
abstracting: (p45<=0)
states: 26,007,121 (7)
abstracting: (1<=p19)
states: 6,501,780 (6)
abstracting: (p19<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.
EG iterations: 0
-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [EG [[EX [E [[[1<=p20 & p20<=1] & [p40<=1 & 1<=p40]] U [[p45<=1 & 1<=p45] & [p48<=1 & 1<=p48]]]] & [EX [[[p10<=1 & 1<=p10] & [p35<=1 & 1<=p35]]] | [A [[p45<=1 & 1<=p45] U [[p10<=1 & 1<=p10] & [p35<=1 & 1<=p35]]] | AG [A [[[p15<=1 & 1<=p15] & [p40<=1 & 1<=p40]] U [p0<=1 & 1<=p0]]]]]]]]
normalized: EX [EG [[[[~ [E [true U ~ [[~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[[p40<=1 & 1<=p40] & [p15<=1 & 1<=p15]]] & ~ [[p0<=1 & 1<=p0]]]]]]]]] | [~ [EG [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]]]] & ~ [E [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] U [~ [[p45<=1 & 1<=p45]] & ~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]]]]]]] | EX [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]]] & EX [E [[[p40<=1 & 1<=p40] & [1<=p20 & p20<=1]] U [[p48<=1 & 1<=p48] & [p45<=1 & 1<=p45]]]]]]]

abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p15<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33,819,621 (7)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: ~ [E [[A [[[[p20<=1 & 1<=p20] & [p40<=1 & 1<=p40]] | AG [[[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]]]] U ~ [[[p24<=1 & 1<=p24] & [p35<=1 & 1<=p35]]]] | AX [[[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]]]] U [AX [EG [[[[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]] | [p43<=1 & 1<=p43]]]] & [[p45<=1 & 1<=p45] & [p46<=1 & 1<=p46]]]]]
normalized: ~ [E [[~ [EX [~ [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]]]] | [~ [EG [[[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]]]] & ~ [E [[[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]] U [~ [[~ [E [true U ~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]] | [[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]]] & [[p35<=1 & 1<=p35] & [p24<=1 & 1<=p24]]]]]]] U [[[p46<=1 & 1<=p46] & [p45<=1 & 1<=p45]] & ~ [EX [~ [EG [[[p43<=1 & 1<=p43] | [[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]]]]]]]]]

abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p43<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
abstracting: (1<=p24)
states: 6,501,780 (6)
abstracting: (p24<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p24)
states: 6,501,780 (6)
abstracting: (p24<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p24)
states: 6,501,780 (6)
abstracting: (p24<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [~ [A [[p34<=1 & 1<=p34] U AF [~ [[AF [[p42<=1 & 1<=p42]] & EX [[[p20<=1 & 1<=p20] & [p40<=1 & 1<=p40]]]]]]]] | ~ [E [AG [[A [[[p2<=1 & 1<=p2] & [p40<=1 & 1<=p40]] U [p51<=1 & 1<=p51]] | EX [[[p20<=1 & 1<=p20] & [p40<=1 & 1<=p40]]]]] U EX [[A [[p43<=1 & 1<=p43] U [[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]] & EX [[[p49<=1 & 1<=p49] & [p50<=1 & 1<=p50]]]]]]]]
normalized: [~ [E [~ [E [true U ~ [[EX [[[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]] | [~ [EG [~ [[p51<=1 & 1<=p51]]]] & ~ [E [~ [[p51<=1 & 1<=p51]] U [~ [[[p40<=1 & 1<=p40] & [p2<=1 & 1<=p2]]] & ~ [[p51<=1 & 1<=p51]]]]]]]]]] U EX [[EX [[[p50<=1 & 1<=p50] & [p49<=1 & 1<=p49]]] & [~ [EG [~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]] & ~ [E [~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]] U [~ [[p43<=1 & 1<=p43]] & ~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]]]]]] | ~ [[~ [EG [EG [[EX [[[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]] & ~ [EG [~ [[p42<=1 & 1<=p42]]]]]]]] & ~ [E [EG [[EX [[[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]] & ~ [EG [~ [[p42<=1 & 1<=p42]]]]]] U [~ [[p34<=1 & 1<=p34]] & EG [[EX [[[p40<=1 & 1<=p40] & [p20<=1 & 1<=p20]]] & ~ [EG [~ [[p42<=1 & 1<=p42]]]]]]]]]]]]

abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p42<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
..
EG iterations: 1
abstracting: (1<=p34)
states: 6,501,780 (6)
abstracting: (p34<=1)
states: 33,819,621 (7)
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p42<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
..
EG iterations: 1
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p42<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p43<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p49)
states: 6,763,924 (6)
abstracting: (p49<=1)
states: 33,819,621 (7)
abstracting: (1<=p50)
states: 8,454,905 (6)
abstracting: (p50<=1)
states: 33,819,621 (7)
..abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p2)
states: 6,501,780 (6)
abstracting: (p2<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p20)
states: 7,812,500 (6)
abstracting: (p20<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: AG [EF [[[E [E [[[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]] U [p42<=1 & 1<=p42]] U [[[[p26<=1 & 1<=p26] & [p40<=1 & 1<=p40]] & [[p41<=1 & 1<=p41] & [p52<=1 & 1<=p52]]] | ~ [[[p9<=1 & 1<=p9] & [p45<=1 & 1<=p45]]]]] | [p39<=0 & 0<=p39]] | [[AG [[[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]] & [p37<=0 & 0<=p37]] | [[p40<=1 & 1<=p40] & [[p14<=0 & 0<=p14] | [p35<=0 & 0<=p35]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[p35<=0 & 0<=p35] | [p14<=0 & 0<=p14]] & [p40<=1 & 1<=p40]] | [[p37<=0 & 0<=p37] & ~ [E [true U ~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]] | [[p39<=0 & 0<=p39] | E [E [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]] U [p42<=1 & 1<=p42]] U [~ [[[p45<=1 & 1<=p45] & [p9<=1 & 1<=p9]]] | [[[p52<=1 & 1<=p52] & [p41<=1 & 1<=p41]] & [[p40<=1 & 1<=p40] & [p26<=1 & 1<=p26]]]]]]]]]]]

abstracting: (1<=p26)
states: 6,501,780 (6)
abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p41)
states: 6,501,780 (6)
abstracting: (p41<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p42)
states: 6,501,780 (6)
abstracting: (p42<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (0<=p39)
states: 33,819,621 (7)
abstracting: (p39<=0)
states: 27,317,841 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (0<=p37)
states: 33,819,621 (7)
abstracting: (p37<=0)
states: 27,317,841 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (0<=p14)
states: 33,819,621 (7)
abstracting: (p14<=0)
states: 27,317,841 (7)
abstracting: (0<=p35)
states: 33,819,621 (7)
abstracting: (p35<=0)
states: 26,007,121 (7)
-> the formula is TRUE

FORMULA Raft-PT-03-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AF [[AG [EF [AX [[[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]]]] & [A [[[A [[p37<=1 & 1<=p37] U [[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]]] & [[p1<=1 & 1<=p1] & [p40<=1 & 1<=p40]]] | [[p33<=1 & 1<=p33] & [p52<=1 & 1<=p52]]] U ~ [AF [[[p28<=1 & 1<=p28] & [p40<=1 & 1<=p40]]]]] & A [AG [E [[[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]] U [[p17<=1 & 1<=p17] & [p45<=1 & 1<=p45]]]] U ~ [[E [[[p28<=1 & 1<=p28] & [p40<=1 & 1<=p40]] U [[p38<=1 & 1<=p38] & [p52<=1 & 1<=p52]]] | ~ [[[p15<=1 & 1<=p15] & [p40<=1 & 1<=p40]]]]]]]]]
normalized: ~ [EG [~ [[[[~ [EG [[~ [[[p40<=1 & 1<=p40] & [p15<=1 & 1<=p15]]] | E [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]] U [[p52<=1 & 1<=p52] & [p38<=1 & 1<=p38]]]]]] & ~ [E [[~ [[[p40<=1 & 1<=p40] & [p15<=1 & 1<=p15]]] | E [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]] U [[p52<=1 & 1<=p52] & [p38<=1 & 1<=p38]]]] U [E [true U ~ [E [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]] U [[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]]]] & [~ [[[p40<=1 & 1<=p40] & [p15<=1 & 1<=p15]]] | E [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]] U [[p52<=1 & 1<=p52] & [p38<=1 & 1<=p38]]]]]]]] & [~ [EG [~ [EG [~ [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]]]]]]] & ~ [E [~ [EG [~ [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]]]]] U [~ [[[[p52<=1 & 1<=p52] & [p33<=1 & 1<=p33]] | [[[p40<=1 & 1<=p40] & [p1<=1 & 1<=p1]] & [~ [EG [~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]] & ~ [E [~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]] U [~ [[p37<=1 & 1<=p37]] & ~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]]]]]]] & ~ [EG [~ [[[p40<=1 & 1<=p40] & [p28<=1 & 1<=p28]]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [EX [~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]]]]]]]]

abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
.abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p37)
states: 6,501,780 (6)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p1)
states: 6,501,780 (6)
abstracting: (p1<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p33)
states: 6,501,780 (6)
abstracting: (p33<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p38)
states: 6,501,780 (6)
abstracting: (p38<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p15<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p17<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p38)
states: 6,501,780 (6)
abstracting: (p38<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p15<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p38)
states: 6,501,780 (6)
abstracting: (p38<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
abstracting: (1<=p28)
states: 6,501,780 (6)
abstracting: (p28<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p15<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
..
EG iterations: 2

EG iterations: 0
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.038sec

checking: E [A [~ [[[[[p17<=1 & 1<=p17] & [p45<=1 & 1<=p45]] | [[[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]] | [[p15<=1 & 1<=p15] & [p40<=1 & 1<=p40]]]] | [E [~ [[p51<=1 & 1<=p51]] U ~ [[[p35<=1 & 1<=p35] & [p48<=1 & 1<=p48]]]] | [[[p45<=1 & 1<=p45] & [p48<=1 & 1<=p48]] | [[p47<=1 & 1<=p47] & [p50<=1 & 1<=p50]]]]]] U [E [~ [[[p10<=1 & 1<=p10] & [p35<=1 & 1<=p35]]] U E [[[p6<=1 & 1<=p6] & [p45<=1 & 1<=p45]] U [p43<=1 & 1<=p43]]] | EX [[[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]]]]] U AX [[[p41<=1 & 1<=p41] & [p52<=1 & 1<=p52]]]]
normalized: E [[~ [EG [~ [[EX [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]] | E [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] U E [[[p45<=1 & 1<=p45] & [p6<=1 & 1<=p6]] U [p43<=1 & 1<=p43]]]]]]] & ~ [E [~ [[EX [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]] | E [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] U E [[[p45<=1 & 1<=p45] & [p6<=1 & 1<=p6]] U [p43<=1 & 1<=p43]]]]] U [[[[[[p50<=1 & 1<=p50] & [p47<=1 & 1<=p47]] | [[p48<=1 & 1<=p48] & [p45<=1 & 1<=p45]]] | E [~ [[p51<=1 & 1<=p51]] U ~ [[[p48<=1 & 1<=p48] & [p35<=1 & 1<=p35]]]]] | [[[[p40<=1 & 1<=p40] & [p15<=1 & 1<=p15]] | [[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]] | [[p45<=1 & 1<=p45] & [p17<=1 & 1<=p17]]]] & ~ [[EX [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]] | E [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] U E [[[p45<=1 & 1<=p45] & [p6<=1 & 1<=p6]] U [p43<=1 & 1<=p43]]]]]]]]] U ~ [EX [~ [[[p52<=1 & 1<=p52] & [p41<=1 & 1<=p41]]]]]]

abstracting: (1<=p41)
states: 6,501,780 (6)
abstracting: (p41<=1)
states: 33,819,621 (7)
abstracting: (1<=p52)
states: 8,454,905 (6)
abstracting: (p52<=1)
states: 33,819,621 (7)
.abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p43<=1)
states: 33,819,621 (7)
abstracting: (1<=p6)
states: 6,501,780 (6)
abstracting: (p6<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.abstracting: (1<=p17)
states: 6,501,780 (6)
abstracting: (p17<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p15)
states: 7,812,500 (6)
abstracting: (p15<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p48)
states: 6,763,924 (6)
abstracting: (p48<=1)
states: 33,819,621 (7)
abstracting: (1<=p47)
states: 6,763,924 (6)
abstracting: (p47<=1)
states: 33,819,621 (7)
abstracting: (1<=p50)
states: 8,454,905 (6)
abstracting: (p50<=1)
states: 33,819,621 (7)
abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p43<=1)
states: 33,819,621 (7)
abstracting: (1<=p6)
states: 6,501,780 (6)
abstracting: (p6<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.abstracting: (1<=p43)
states: 6,501,780 (6)
abstracting: (p43<=1)
states: 33,819,621 (7)
abstracting: (1<=p6)
states: 6,501,780 (6)
abstracting: (p6<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: [EG [A [[p51<=1 & 1<=p51] U ~ [[p32<=1 & 1<=p32]]]] & [EF [[A [[AF [[[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]] | [[p37<=1 & 1<=p37] | [p44<=1 & 1<=p44]]] U AG [[p44<=1 & 1<=p44]]] & [[p1<=1 & 1<=p1] & [p40<=1 & 1<=p40]]]] & A [~ [[[[AF [[[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]]] | A [[p45<=1 & 1<=p45] U [p34<=1 & 1<=p34]]] & ~ [EF [[p40<=1 & 1<=p40]]]] & [[p29<=1 & 1<=p29] & [p40<=1 & 1<=p40]]]] U [[[~ [[[~ [[[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]] & ~ [[[p10<=1 & 1<=p10] & [p35<=1 & 1<=p35]]]] | EF [[[p13<=1 & 1<=p13] & [p35<=1 & 1<=p35]]]]] & ~ [[~ [[p50<=1 & 1<=p50]] & ~ [[p44<=1 & 1<=p44]]]]] & [[p9<=1 & 1<=p9] & [p45<=1 & 1<=p45]]] | [[p27<=1 & 1<=p27] & [p40<=1 & 1<=p40]]]]]]
normalized: [[[~ [EG [~ [[[[p40<=1 & 1<=p40] & [p27<=1 & 1<=p27]] | [[[p45<=1 & 1<=p45] & [p9<=1 & 1<=p9]] & [~ [[~ [[p44<=1 & 1<=p44]] & ~ [[p50<=1 & 1<=p50]]]] & ~ [[E [true U [[p35<=1 & 1<=p35] & [p13<=1 & 1<=p13]]] | [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] & ~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]]]]]]] & ~ [E [~ [[[[p40<=1 & 1<=p40] & [p27<=1 & 1<=p27]] | [[[p45<=1 & 1<=p45] & [p9<=1 & 1<=p9]] & [~ [[~ [[p44<=1 & 1<=p44]] & ~ [[p50<=1 & 1<=p50]]]] & ~ [[E [true U [[p35<=1 & 1<=p35] & [p13<=1 & 1<=p13]]] | [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] & ~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]]]]] U [[[[p40<=1 & 1<=p40] & [p29<=1 & 1<=p29]] & [~ [E [true U [p40<=1 & 1<=p40]]] & [[~ [EG [~ [[p34<=1 & 1<=p34]]]] & ~ [E [~ [[p34<=1 & 1<=p34]] U [~ [[p45<=1 & 1<=p45]] & ~ [[p34<=1 & 1<=p34]]]]]] | ~ [EG [~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]]]]] & ~ [[[[p40<=1 & 1<=p40] & [p27<=1 & 1<=p27]] | [[[p45<=1 & 1<=p45] & [p9<=1 & 1<=p9]] & [~ [[~ [[p44<=1 & 1<=p44]] & ~ [[p50<=1 & 1<=p50]]]] & ~ [[E [true U [[p35<=1 & 1<=p35] & [p13<=1 & 1<=p13]]] | [~ [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]] & ~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]]]]]]]]] & E [true U [[[p40<=1 & 1<=p40] & [p1<=1 & 1<=p1]] & [~ [EG [E [true U ~ [[p44<=1 & 1<=p44]]]]] & ~ [E [E [true U ~ [[p44<=1 & 1<=p44]]] U [~ [[[[p44<=1 & 1<=p44] | [p37<=1 & 1<=p37]] | ~ [EG [~ [[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]]]]]]] & E [true U ~ [[p44<=1 & 1<=p44]]]]]]]]]] & EG [[~ [EG [[p32<=1 & 1<=p32]]] & ~ [E [[p32<=1 & 1<=p32] U [~ [[p51<=1 & 1<=p51]] & [p32<=1 & 1<=p32]]]]]]]

abstracting: (1<=p32)
states: 6,501,780 (6)
abstracting: (p32<=1)
states: 33,819,621 (7)
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p32)
states: 6,501,780 (6)
abstracting: (p32<=1)
states: 33,819,621 (7)
abstracting: (1<=p32)
states: 6,501,780 (6)
abstracting: (p32<=1)
states: 33,819,621 (7)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p37)
states: 6,501,780 (6)
abstracting: (p37<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)

EG iterations: 0
abstracting: (1<=p1)
states: 6,501,780 (6)
abstracting: (p1<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p13)
states: 6,501,780 (6)
abstracting: (p13<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p50)
states: 8,454,905 (6)
abstracting: (p50<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p27)
states: 6,501,780 (6)
abstracting: (p27<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p34)
states: 6,501,780 (6)
abstracting: (p34<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p34)
states: 6,501,780 (6)
abstracting: (p34<=1)
states: 33,819,621 (7)
abstracting: (1<=p34)
states: 6,501,780 (6)
abstracting: (p34<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p29)
states: 6,501,780 (6)
abstracting: (p29<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p13)
states: 6,501,780 (6)
abstracting: (p13<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p50)
states: 8,454,905 (6)
abstracting: (p50<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p27)
states: 6,501,780 (6)
abstracting: (p27<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p13)
states: 6,501,780 (6)
abstracting: (p13<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p50)
states: 8,454,905 (6)
abstracting: (p50<=1)
states: 33,819,621 (7)
abstracting: (1<=p44)
states: 6,501,780 (6)
abstracting: (p44<=1)
states: 33,819,621 (7)
abstracting: (1<=p9)
states: 6,501,780 (6)
abstracting: (p9<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p27)
states: 6,501,780 (6)
abstracting: (p27<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AG [[[[AX [[p33<=1 & 1<=p33]] | ~ [A [[[p11<=1 & 1<=p11] & [p35<=1 & 1<=p35]] U [[p25<=1 & 1<=p25] & [p45<=1 & 1<=p45]]]]] | [AF [[[p33<=0 & 0<=p33] | [p52<=0 & 0<=p52]]] | A [[AX [[p36<=1 & 1<=p36]] & [p40<=1 & 1<=p40]] U [[[[p30<=1 & 1<=p30] & [[p45<=1 & 1<=p45] & [p26<=1 & 1<=p26]]] & [[p40<=1 & 1<=p40] & [[p40<=1 & 1<=p40] & [p46<=1 & 1<=p46]]]] | [[p30<=1 & 1<=p30] & [p45<=1 & 1<=p45]]]]]] | [[[p51<=1 & 1<=p51] | [p39<=1 & 1<=p39]] | [[AF [AX [[[p5<=1 & 1<=p5] & [p35<=1 & 1<=p35]]]] & [EG [[[p10<=1 & 1<=p10] & [p35<=1 & 1<=p35]]] & [[p2<=0 & 0<=p2] | [p40<=0 & 0<=p40]]]] | [[[[p15<=0 & 0<=p15] | [p40<=0 & 0<=p40]] & [[p25<=0 & 0<=p25] | [p45<=0 & 0<=p45]]] | [[p30<=1 & 1<=p30] & [[p45<=1 & 1<=p45] & [[p36<=0 & 0<=p36] | [p52<=0 & 0<=p52]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[p52<=0 & 0<=p52] | [p36<=0 & 0<=p36]] & [p45<=1 & 1<=p45]] & [p30<=1 & 1<=p30]] | [[[p45<=0 & 0<=p45] | [p25<=0 & 0<=p25]] & [[p40<=0 & 0<=p40] | [p15<=0 & 0<=p15]]]] | [[[[p40<=0 & 0<=p40] | [p2<=0 & 0<=p2]] & EG [[[p35<=1 & 1<=p35] & [p10<=1 & 1<=p10]]]] & ~ [EG [EX [~ [[[p35<=1 & 1<=p35] & [p5<=1 & 1<=p5]]]]]]]] | [[p39<=1 & 1<=p39] | [p51<=1 & 1<=p51]]] | [[[~ [EG [~ [[[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]] | [[[[p46<=1 & 1<=p46] & [p40<=1 & 1<=p40]] & [p40<=1 & 1<=p40]] & [[[p26<=1 & 1<=p26] & [p45<=1 & 1<=p45]] & [p30<=1 & 1<=p30]]]]]]] & ~ [E [~ [[[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]] | [[[[p46<=1 & 1<=p46] & [p40<=1 & 1<=p40]] & [p40<=1 & 1<=p40]] & [[[p26<=1 & 1<=p26] & [p45<=1 & 1<=p45]] & [p30<=1 & 1<=p30]]]]] U [~ [[[p40<=1 & 1<=p40] & ~ [EX [~ [[p36<=1 & 1<=p36]]]]]] & ~ [[[[p45<=1 & 1<=p45] & [p30<=1 & 1<=p30]] | [[[[p46<=1 & 1<=p46] & [p40<=1 & 1<=p40]] & [p40<=1 & 1<=p40]] & [[[p26<=1 & 1<=p26] & [p45<=1 & 1<=p45]] & [p30<=1 & 1<=p30]]]]]]]]] | ~ [EG [~ [[[p52<=0 & 0<=p52] | [p33<=0 & 0<=p33]]]]]] | [~ [[~ [EG [~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]] & ~ [E [~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]] U [~ [[[p35<=1 & 1<=p35] & [p11<=1 & 1<=p11]]] & ~ [[[p45<=1 & 1<=p45] & [p25<=1 & 1<=p25]]]]]]]] | ~ [EX [~ [[p33<=1 & 1<=p33]]]]]]]]]]

abstracting: (1<=p33)
states: 6,501,780 (6)
abstracting: (p33<=1)
states: 33,819,621 (7)
.abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p11)
states: 6,501,780 (6)
abstracting: (p11<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p25)
states: 7,812,500 (6)
abstracting: (p25<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (0<=p33)
states: 33,819,621 (7)
abstracting: (p33<=0)
states: 27,317,841 (7)
abstracting: (0<=p52)
states: 33,819,621 (7)
abstracting: (p52<=0)
states: 25,364,716 (7)
.
EG iterations: 1
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p26)
states: 6,501,780 (6)
abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p36)
states: 6,501,780 (6)
abstracting: (p36<=1)
states: 33,819,621 (7)
.abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p26)
states: 6,501,780 (6)
abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (1<=p26)
states: 6,501,780 (6)
abstracting: (p26<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p40)
states: 7,812,500 (6)
abstracting: (p40<=1)
states: 33,819,621 (7)
abstracting: (1<=p46)
states: 6,763,924 (6)
abstracting: (p46<=1)
states: 33,819,621 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
..
EG iterations: 2
abstracting: (1<=p51)
states: 8,454,905 (6)
abstracting: (p51<=1)
states: 33,819,621 (7)
abstracting: (1<=p39)
states: 6,501,780 (6)
abstracting: (p39<=1)
states: 33,819,621 (7)
abstracting: (1<=p5)
states: 7,812,500 (6)
abstracting: (p5<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
..
EG iterations: 1
abstracting: (1<=p10)
states: 7,812,500 (6)
abstracting: (p10<=1)
states: 33,819,621 (7)
abstracting: (1<=p35)
states: 7,812,500 (6)
abstracting: (p35<=1)
states: 33,819,621 (7)
.
EG iterations: 1
abstracting: (0<=p2)
states: 33,819,621 (7)
abstracting: (p2<=0)
states: 27,317,841 (7)
abstracting: (0<=p40)
states: 33,819,621 (7)
abstracting: (p40<=0)
states: 26,007,121 (7)
abstracting: (0<=p15)
states: 33,819,621 (7)
abstracting: (p15<=0)
states: 26,007,121 (7)
abstracting: (0<=p40)
states: 33,819,621 (7)
abstracting: (p40<=0)
states: 26,007,121 (7)
abstracting: (0<=p25)
states: 33,819,621 (7)
abstracting: (p25<=0)
states: 26,007,121 (7)
abstracting: (0<=p45)
states: 33,819,621 (7)
abstracting: (p45<=0)
states: 26,007,121 (7)
abstracting: (1<=p30)
states: 7,812,500 (6)
abstracting: (p30<=1)
states: 33,819,621 (7)
abstracting: (1<=p45)
states: 7,812,500 (6)
abstracting: (p45<=1)
states: 33,819,621 (7)
abstracting: (0<=p36)
states: 33,819,621 (7)
abstracting: (p36<=0)
states: 27,317,841 (7)
abstracting: (0<=p52)
states: 33,819,621 (7)
abstracting: (p52<=0)
states: 25,364,716 (7)
-> the formula is FALSE

FORMULA Raft-PT-03-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

totally nodes used: 304585 (3.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 799298 1803322 2602620
used/not used/entry size/cache size: 2022986 65085878 16 1024MB
basic ops cache: hits/miss/sum: 120040 225076 345116
used/not used/entry size/cache size: 389255 16387961 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: 6544 13311 19855
used/not used/entry size/cache size: 13306 8375302 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 66818863
1 276555
2 12375
3 1008
4 59
5 4
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.943sec


BK_STOP 1679139895342

--------------------
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:22637 (269), effective:1129 (13)

initing FirstDep: 0m 0.000sec


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

iterations count:603 (7), effective:17 (0)

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

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

iterations count:201 (2), effective:5 (0)

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

iterations count:201 (2), effective:5 (0)

iterations count:201 (2), effective:5 (0)

iterations count:831 (9), effective:22 (0)

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

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

iterations count:522 (6), effective:20 (0)

iterations count:522 (6), effective:20 (0)

iterations count:577 (6), effective:19 (0)

iterations count:522 (6), effective:20 (0)

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

iterations count:525 (6), effective:24 (0)

iterations count:455 (5), effective:25 (0)

iterations count:997 (11), effective:39 (0)

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

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

iterations count:527 (6), effective:16 (0)

iterations count:199 (2), effective:5 (0)

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

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

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

iterations count:412 (4), effective:16 (0)

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

iterations count:401 (4), effective:14 (0)

iterations count:328 (3), effective:8 (0)

iterations count:527 (6), effective:16 (0)

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

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

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

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

iterations count:469 (5), effective:15 (0)

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

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

iterations count:474 (5), effective:15 (0)

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

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

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

iterations count:252 (3), effective:7 (0)

iterations count:857 (10), effective:27 (0)

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

iterations count:252 (3), effective:7 (0)

iterations count:857 (10), effective:27 (0)

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

iterations count:252 (3), effective:7 (0)

iterations count:857 (10), effective:27 (0)

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

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

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

iterations count:656 (7), effective:21 (0)

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

iterations count:481 (5), effective:25 (0)

iterations count:512 (6), effective:15 (0)

iterations count:238 (2), effective:5 (0)

iterations count:481 (5), effective:25 (0)

iterations count:481 (5), effective:25 (0)

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

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

iterations count:1072 (12), effective:53 (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="Raft-PT-03"
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 Raft-PT-03, 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 r330-tall-167889203100298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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