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

About the Execution of Marcie+red for RefineWMG-PT-010011

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5615.831 12701.00 17287.00 338.50 TFTTFFFFTFTTTFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r330-tall-167889203400586.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 RefineWMG-PT-010011, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400586
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 15:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 15:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 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 RefineWMG-PT-010011-CTLFireability-00
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-01
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-02
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-03
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-04
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-05
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-06
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-07
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-08
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-09
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-10
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-11
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-12
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-13
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-14
FORMULA_NAME RefineWMG-PT-010011-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679170249108

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=RefineWMG-PT-010011
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:10:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:10:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:10:50] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-18 20:10:50] [INFO ] Transformed 54 places.
[2023-03-18 20:10:50] [INFO ] Transformed 43 transitions.
[2023-03-18 20:10:50] [INFO ] Parsed PT model containing 54 places and 43 transitions and 128 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 52 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:10:50] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-18 20:10:51] [INFO ] Dead Transitions using invariants and state equation in 378 ms found 0 transitions.
[2023-03-18 20:10:51] [INFO ] Invariant cache hit.
[2023-03-18 20:10:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:10:51] [INFO ] Invariant cache hit.
[2023-03-18 20:10:51] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-18 20:10:51] [INFO ] Invariant cache hit.
[2023-03-18 20:10:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 529 ms. Remains : 54/54 places, 43/43 transitions.
Support contains 52 out of 54 places after structural reductions.
[2023-03-18 20:10:51] [INFO ] Flatten gal took : 21 ms
[2023-03-18 20:10:51] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:10:51] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 69) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:10:51] [INFO ] Invariant cache hit.
[2023-03-18 20:10:51] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-18 20:10:51] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 20:10:51] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2023-03-18 20:10:51] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 20:10:51] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-18 20:10:51] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 106 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-18 20:10:51] [INFO ] Flatten gal took : 23 ms
[2023-03-18 20:10:51] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 22 edges and 54 vertex of which 14 / 54 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 40 transition count 30
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 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 31 place count 24 transition count 22
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 24 transition count 18
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 20 transition count 18
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 20 transition count 17
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 19 transition count 17
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 3 with 2 rules applied. Total rules applied 43 place count 18 transition count 16
Applied a total of 43 rules in 12 ms. Remains 18 /54 variables (removed 36) and now considering 16/43 (removed 27) transitions.
// Phase 1: matrix 16 rows 18 cols
[2023-03-18 20:10:52] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 18/54 places, 16/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2023-03-18 20:10:52] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:52] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:10:52] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:10:52] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:52] [INFO ] Invariant cache hit.
[2023-03-18 20:10:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 0 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:53] [INFO ] Invariant cache hit.
[2023-03-18 20:10:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:53] [INFO ] Invariant cache hit.
[2023-03-18 20:10:53] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2023-03-18 20:10:53] [INFO ] Invariant cache hit.
[2023-03-18 20:10:53] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 54/54 places, 43/43 transitions.
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 10 ms
[2023-03-18 20:10:53] [INFO ] Input system was already deterministic with 43 transitions.
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:10:53] [INFO ] Flatten gal took : 6 ms
[2023-03-18 20:10:53] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-18 20:10:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 43 transitions and 128 arcs took 0 ms.
Total runtime 2778 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: 54 NrTr: 43 NrArc: 128)

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

net check time: 0m 0.000sec

init dd package: 0m 2.715sec


RS generation: 0m 0.161sec


-> reachability set: #nodes 1994 (2.0e+03) #states 732,033,467,997,890,689,728,774,144 (26)



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

checking: EX [1<=p28]
normalized: EX [1<=p28]

abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
.-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: EX [AG [EF [[1<=p41 & [1<=p42 & 1<=p44]]]]]
normalized: EX [~ [E [true U ~ [E [true U [[1<=p42 & 1<=p44] & 1<=p41]]]]]]

abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
.-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: A [[1<=p31 & [1<=p32 & 1<=p34]] U [~ [AF [~ [E [1<=p37 U 1<=p20]]]] | [1<=p21 & [1<=p22 & 1<=p24]]]]
normalized: [~ [EG [~ [[[[1<=p22 & 1<=p24] & 1<=p21] | EG [E [1<=p37 U 1<=p20]]]]]] & ~ [E [~ [[[[1<=p22 & 1<=p24] & 1<=p21] | EG [E [1<=p37 U 1<=p20]]]] U [~ [[[1<=p32 & 1<=p34] & 1<=p31]] & ~ [[[[1<=p22 & 1<=p24] & 1<=p21] | EG [E [1<=p37 U 1<=p20]]]]]]]]

abstracting: (1<=p20)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p31)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p34)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p20)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p20)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: ~ [E [EX [[~ [[[1<=p28 & 1<=p43] | 1<=p40]] | E [[[1<=p26 & [1<=p27 & 1<=p29]] | 1<=p42] U p38<=0]]] U 1<=p25]]
normalized: ~ [E [EX [[E [[1<=p42 | [1<=p26 & [1<=p27 & 1<=p29]]] U p38<=0] | ~ [[1<=p40 | [1<=p28 & 1<=p43]]]]] U 1<=p25]]

abstracting: (1<=p25)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p43)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p40)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p38<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
.-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: EX [[EF [1<=p35] | [[A [EG [[1<=p18 & 1<=p32]] U ~ [[p42<=0 | 1<=p7]]] & AF [AG [AX [[1<=p41 & [1<=p42 & 1<=p44]]]]]] | [AF [AG [5<=p4]] & AG [1<=p30]]]]]
normalized: EX [[[[~ [E [true U ~ [1<=p30]]] & ~ [EG [E [true U ~ [5<=p4]]]]] | [~ [EG [E [true U EX [~ [[1<=p41 & [1<=p42 & 1<=p44]]]]]]] & [~ [EG [[p42<=0 | 1<=p7]]] & ~ [E [[p42<=0 | 1<=p7] U [~ [EG [[1<=p18 & 1<=p32]]] & [p42<=0 | 1<=p7]]]]]]] | E [true U 1<=p35]]]

abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p42<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p42<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p42<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 0
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)

EG iterations: 0
abstracting: (1<=p30)
states: 671,030,678,998,066,465,584,709,632 (26)
.-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.168sec

checking: EF [[AG [E [AF [1<=p18] U [[[1<=p17 | 1<=p45] & 1<=p21] & [1<=p22 & [1<=p24 & 1<=p10]]]]] | [[EX [EG [1<=p12]] & EF [[1<=p15 | 1<=p35]]] & [1<=p20 & 1<=p18]]]]
normalized: E [true U [[[1<=p20 & 1<=p18] & [E [true U [1<=p15 | 1<=p35]] & EX [EG [1<=p12]]]] | ~ [E [true U ~ [E [~ [EG [~ [1<=p18]]] U [[1<=p22 & [1<=p24 & 1<=p10]] & [1<=p21 & [1<=p17 | 1<=p45]]]]]]]]]

abstracting: (1<=p45)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p17)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p10)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p12)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
.abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p15)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p20)
states: 671,030,678,998,066,465,584,709,632 (26)
-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.288sec

checking: [[AG [EF [EX [[p16<=0 | [p17<=0 | p19<=0]]]]] | EX [AG [1<=p7]]] | [[A [EX [[1<=p17 | 5<=p4]] U 1<=p22] & EF [1<=p10]] | [EG [[[p46<=0 | p47<=0] | [p49<=0 | p3<=2]]] & AX [EG [AX [1<=p48]]]]]]
normalized: [[[~ [EX [~ [EG [~ [EX [~ [1<=p48]]]]]]] & EG [[[p49<=0 | p3<=2] | [p46<=0 | p47<=0]]]] | [E [true U 1<=p10] & [~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [EX [[1<=p17 | 5<=p4]]] & ~ [1<=p22]]]]]]] | [EX [~ [E [true U ~ [1<=p7]]]] | ~ [E [true U ~ [E [true U EX [[p16<=0 | [p17<=0 | p19<=0]]]]]]]]]

abstracting: (p19<=0)
states: 447,353,785,998,710,977,056,473,088 (26)
abstracting: (p17<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p16<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
abstracting: (1<=p17)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p10)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p47<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p46<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p3<=2)
states: 366,016,733,998,945,344,864,387,072 (26)
abstracting: (p49<=0)
states: 447,353,785,998,710,977,056,473,088 (26)
.
EG iterations: 1
abstracting: (1<=p48)
states: 671,030,678,998,066,465,584,709,632 (26)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.146sec

checking: A [EX [~ [[AG [[1<=p25 | [1<=p31 & [1<=p32 & 1<=p34]]]] & ~ [[~ [[1<=p41 & [1<=p42 & 1<=p44]]] & [1<=p37 & 1<=p33]]]]]] U [AX [1<=p22] & AG [~ [AF [[[1<=p42 & 1<=p26] & [1<=p27 & 1<=p29]]]]]]]
normalized: [~ [EG [~ [[~ [E [true U ~ [EG [~ [[[1<=p27 & 1<=p29] & [1<=p42 & 1<=p26]]]]]]] & ~ [EX [~ [1<=p22]]]]]]] & ~ [E [~ [[~ [E [true U ~ [EG [~ [[[1<=p27 & 1<=p29] & [1<=p42 & 1<=p26]]]]]]] & ~ [EX [~ [1<=p22]]]]] U [~ [EX [~ [[~ [[[1<=p37 & 1<=p33] & ~ [[1<=p41 & [1<=p42 & 1<=p44]]]]] & ~ [E [true U ~ [[1<=p25 | [1<=p31 & [1<=p32 & 1<=p34]]]]]]]]]] & ~ [[~ [E [true U ~ [EG [~ [[[1<=p27 & 1<=p29] & [1<=p42 & 1<=p26]]]]]]] & ~ [EX [~ [1<=p22]]]]]]]]]

abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p34)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p31)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p25)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p33)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.100sec

checking: AX [[E [AX [1<=p32] U [[AF [p8<=0] & [p18<=0 | [[1<=p36 & [1<=p37 & 1<=p39]] | 1<=p43]]] & [[[1<=p21 & [1<=p22 & 1<=p24]] | 1<=p30] & p17<=0]]] & EG [AF [[EF [1<=p45] | [1<=p22 | 1<=p32]]]]]]
normalized: ~ [EX [~ [[EG [~ [EG [~ [[[1<=p22 | 1<=p32] | E [true U 1<=p45]]]]]] & E [~ [EX [~ [1<=p32]]] U [[p17<=0 & [1<=p30 | [1<=p21 & [1<=p22 & 1<=p24]]]] & [[p18<=0 | [1<=p43 | [1<=p36 & [1<=p37 & 1<=p39]]]] & ~ [EG [~ [p8<=0]]]]]]]]]]

abstracting: (p8<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p39)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p36)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p43)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p18<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p30)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p17<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p45)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1

EG iterations: 0
.-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.260sec

checking: EF [[AG [AX [[[1<=p6 & [1<=p7 & 1<=p9]] & [1<=p6 & [1<=p7 & 1<=p9]]]]] & [A [AF [E [1<=p45 U 1<=p17]] U ~ [EX [p3<=2]]] & [EF [p23<=0] | [[AX [[1<=p36 & [1<=p37 & 1<=p39]]] & 1<=p13] & [2<=p1 & 2<=p2]]]]]]
normalized: E [true U [[[[[2<=p1 & 2<=p2] & [1<=p13 & ~ [EX [~ [[1<=p36 & [1<=p37 & 1<=p39]]]]]]] | E [true U p23<=0]] & [~ [EG [EX [p3<=2]]] & ~ [E [EX [p3<=2] U [EG [~ [E [1<=p45 U 1<=p17]]] & EX [p3<=2]]]]]] & ~ [E [true U EX [~ [[[1<=p6 & [1<=p7 & 1<=p9]] & [1<=p6 & [1<=p7 & 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p6)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p9)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p6)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (p3<=2)
states: 366,016,733,998,945,344,864,387,072 (26)
.abstracting: (1<=p17)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p45)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (p3<=2)
states: 366,016,733,998,945,344,864,387,072 (26)
.abstracting: (p3<=2)
states: 366,016,733,998,945,344,864,387,072 (26)
.
EG iterations: 0
abstracting: (p23<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p39)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p37)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p36)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p13)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.114sec

checking: [E [[[[AX [p35<=0] & [~ [[[1<=p6 & 1<=p7] & [1<=p9 & 1<=p47]]] & ~ [EF [1<=p8]]]] | EX [[1<=p7 | EF [1<=p28]]]] & AF [EX [EF [1<=p7]]]] U [1<=p6 & [1<=p7 & 1<=p9]]] | AX [AX [~ [A [~ [[1<=p26 & [1<=p27 & 1<=p29]]] U p38<=0]]]]]
normalized: [~ [EX [EX [[~ [EG [~ [p38<=0]]] & ~ [E [~ [p38<=0] U [[1<=p26 & [1<=p27 & 1<=p29]] & ~ [p38<=0]]]]]]]] | E [[~ [EG [~ [EX [E [true U 1<=p7]]]]] & [EX [[1<=p7 | E [true U 1<=p28]]] | [[~ [E [true U 1<=p8]] & ~ [[[1<=p9 & 1<=p47] & [1<=p6 & 1<=p7]]]] & ~ [EX [~ [p35<=0]]]]]] U [1<=p6 & [1<=p7 & 1<=p9]]]]

abstracting: (1<=p9)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p6)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p35<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p6)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p9)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p8)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
..
EG iterations: 1
abstracting: (p38<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p38<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p38<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: EF [[EF [[[[EG [1<=p22] & AX [p42<=0]] | EF [1<=p38]] | [AG [[1<=p46 & [1<=p47 & 1<=p49]]] | E [1<=p5 U [1<=p46 & [1<=p47 & 1<=p49]]]]]] & E [[1<=p42 | ~ [[1<=p23 | [1<=p7 | 1<=p43]]]] U EG [[A [1<=p13 U 1<=p28] & AX [5<=p4]]]]]]
normalized: E [true U [E [[1<=p42 | ~ [[1<=p23 | [1<=p7 | 1<=p43]]]] U EG [[[~ [EG [~ [1<=p28]]] & ~ [E [~ [1<=p28] U [~ [1<=p13] & ~ [1<=p28]]]]] & ~ [EX [~ [5<=p4]]]]]] & E [true U [[E [1<=p5 U [1<=p46 & [1<=p47 & 1<=p49]]] | ~ [E [true U ~ [[1<=p46 & [1<=p47 & 1<=p49]]]]]] | [E [true U 1<=p38] | [~ [EX [~ [p42<=0]]] & EG [1<=p22]]]]]]]

abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (p42<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.abstracting: (1<=p38)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p49)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p46)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p49)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p46)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p5)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
.abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p13)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p43)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: [E [1<=p8 U [1<=p53 | EG [[AG [1<=p47] | [~ [[1<=p26 & [1<=p27 & 1<=p29]]] | p18<=0]]]]] | A [AX [[1<=p5 & [EG [[1<=p21 & [1<=p22 & 1<=p24]]] | [1<=p42 | [1<=p13 & 1<=p15]]]]] U EG [[[[~ [[1<=p0 & [1<=p51 & 1<=p52]]] & p12<=0] | ~ [EF [1<=p32]]] & p23<=0]]]]
normalized: [[~ [EG [~ [EG [[p23<=0 & [~ [E [true U 1<=p32]] | [p12<=0 & ~ [[1<=p0 & [1<=p51 & 1<=p52]]]]]]]]]] & ~ [E [~ [EG [[p23<=0 & [~ [E [true U 1<=p32]] | [p12<=0 & ~ [[1<=p0 & [1<=p51 & 1<=p52]]]]]]]] U [EX [~ [[1<=p5 & [[1<=p42 | [1<=p13 & 1<=p15]] | EG [[1<=p21 & [1<=p22 & 1<=p24]]]]]]] & ~ [EG [[p23<=0 & [~ [E [true U 1<=p32]] | [p12<=0 & ~ [[1<=p0 & [1<=p51 & 1<=p52]]]]]]]]]]]] | E [1<=p8 U [1<=p53 | EG [[[p18<=0 | ~ [[1<=p26 & [1<=p27 & 1<=p29]]]] | ~ [E [true U ~ [1<=p47]]]]]]]]

abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p18<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p53)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p8)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p51)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p0)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (p12<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p23<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p24)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p21)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p15)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p13)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p5)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p51)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p0)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (p12<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p23<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p51)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p0)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (p12<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p23<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA RefineWMG-PT-010011-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.212sec

checking: [E [EX [EF [[AF [[2<=p1 & 2<=p2]] & AG [[1<=p31 & [1<=p32 & 1<=p34]]]]]] U ~ [A [[p10<=0 & [A [1<=p25 U 1<=p42] | EG [1<=p38]]] U [[EF [1<=p28] & [[2<=p1 & 2<=p2] | 1<=p23]] & [1<=p53 & 1<=p27]]]]] & [AG [[EX [[p4<=4 & p7<=0]] | A [5<=p4 U 1<=p22]]] & EF [AX [[p16<=0 | [p17<=0 | p19<=0]]]]]]
normalized: [[E [true U ~ [EX [~ [[p16<=0 | [p17<=0 | p19<=0]]]]]] & ~ [E [true U ~ [[[~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [~ [5<=p4] & ~ [1<=p22]]]]] | EX [[p4<=4 & p7<=0]]]]]]] & E [EX [E [true U [~ [E [true U ~ [[1<=p31 & [1<=p32 & 1<=p34]]]]] & ~ [EG [~ [[2<=p1 & 2<=p2]]]]]]] U ~ [[~ [EG [~ [[[1<=p53 & 1<=p27] & [[1<=p23 | [2<=p1 & 2<=p2]] & E [true U 1<=p28]]]]]] & ~ [E [~ [[[1<=p53 & 1<=p27] & [[1<=p23 | [2<=p1 & 2<=p2]] & E [true U 1<=p28]]]] U [~ [[p10<=0 & [EG [1<=p38] | [~ [EG [~ [1<=p42]]] & ~ [E [~ [1<=p42] U [~ [1<=p25] & ~ [1<=p42]]]]]]]] & ~ [[[1<=p53 & 1<=p27] & [[1<=p23 | [2<=p1 & 2<=p2]] & E [true U 1<=p28]]]]]]]]]]]

abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p53)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p25)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p38)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (p10<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p53)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p28)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p53)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
.
EG iterations: 1
abstracting: (1<=p34)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p31)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (p7<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p4<=4)
states: 730,239,268,321,425,271,371,595,776 (26)
.abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p22)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (p19<=0)
states: 447,353,785,998,710,977,056,473,088 (26)
abstracting: (p17<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (p16<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.346sec

checking: [A [[E [[E [1<=p43 U 1<=p52] & [1<=p23 & [1<=p8 | 1<=p17]]] U EG [[[1<=p16 & [1<=p17 & 1<=p19]] | [1<=p46 & [1<=p47 & 1<=p49]]]]] | ~ [[EX [1<=p10] | [AG [1<=p35] & AX [1<=p35]]]]] U [~ [[1<=p38 & ~ [EX [[2<=p1 & 2<=p2]]]]] & AG [[E [1<=p12 U 1<=p35] | [1<=p30 | p7<=0]]]]] | A [1<=p7 U [1<=p41 & [1<=p42 & 1<=p44]]]]
normalized: [[~ [EG [~ [[1<=p41 & [1<=p42 & 1<=p44]]]]] & ~ [E [~ [[1<=p41 & [1<=p42 & 1<=p44]]] U [~ [1<=p7] & ~ [[1<=p41 & [1<=p42 & 1<=p44]]]]]]] | [~ [EG [~ [[~ [E [true U ~ [[[1<=p30 | p7<=0] | E [1<=p12 U 1<=p35]]]]] & ~ [[1<=p38 & ~ [EX [[2<=p1 & 2<=p2]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[1<=p30 | p7<=0] | E [1<=p12 U 1<=p35]]]]] & ~ [[1<=p38 & ~ [EX [[2<=p1 & 2<=p2]]]]]]] U [~ [[~ [[[~ [EX [~ [1<=p35]]] & ~ [E [true U ~ [1<=p35]]]] | EX [1<=p10]]] | E [[[1<=p23 & [1<=p8 | 1<=p17]] & E [1<=p43 U 1<=p52]] U EG [[[1<=p46 & [1<=p47 & 1<=p49]] | [1<=p16 & [1<=p17 & 1<=p19]]]]]]] & ~ [[~ [E [true U ~ [[[1<=p30 | p7<=0] | E [1<=p12 U 1<=p35]]]]] & ~ [[1<=p38 & ~ [EX [[2<=p1 & 2<=p2]]]]]]]]]]]]

abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
.abstracting: (1<=p38)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p12)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p7<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p30)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p19)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p17)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p16)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p49)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p46)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p43)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p17)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p8)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p10)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
.abstracting: (1<=p38)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p12)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p7<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p30)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
.abstracting: (1<=p38)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p12)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p7<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p30)
states: 671,030,678,998,066,465,584,709,632 (26)

EG iterations: 0
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p7)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p44)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p42)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p41)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.389sec

checking: E [[[A [~ [[1<=p0 & [1<=p51 & 1<=p52]]] U [AG [1<=p18] | EX [[1<=p26 & [1<=p27 & 1<=p29]]]]] | A [[[1<=p35 & [2<=p1 & 2<=p2]] & [2<=p1 & [2<=p2 & 1<=p8]]] U [5<=p4 | EG [[1<=p26 & [1<=p27 & 1<=p29]]]]]] | [AF [[p38<=0 & [2<=p1 & 2<=p2]]] | [[1<=p23 & AG [AF [1<=p27]]] & [~ [EF [AX [1<=p53]]] & [E [1<=p40 U EF [[1<=p46 & [1<=p47 & 1<=p49]]]] | 1<=p12]]]]] U [~ [[~ [E [p10<=0 U [1<=p50 | [1<=p0 & [1<=p51 & 1<=p52]]]]] & EG [AF [1<=p27]]]] & AG [~ [[1<=p31 & [1<=p32 & 1<=p34]]]]]]
normalized: E [[[[[[1<=p12 | E [1<=p40 U E [true U [1<=p46 & [1<=p47 & 1<=p49]]]]] & ~ [E [true U ~ [EX [~ [1<=p53]]]]]] & [1<=p23 & ~ [E [true U EG [~ [1<=p27]]]]]] | ~ [EG [~ [[p38<=0 & [2<=p1 & 2<=p2]]]]]] | [[~ [EG [~ [[5<=p4 | EG [[1<=p26 & [1<=p27 & 1<=p29]]]]]]] & ~ [E [~ [[5<=p4 | EG [[1<=p26 & [1<=p27 & 1<=p29]]]]] U [~ [[[2<=p1 & [2<=p2 & 1<=p8]] & [1<=p35 & [2<=p1 & 2<=p2]]]] & ~ [[5<=p4 | EG [[1<=p26 & [1<=p27 & 1<=p29]]]]]]]]] | [~ [EG [~ [[EX [[1<=p26 & [1<=p27 & 1<=p29]]] | ~ [E [true U ~ [1<=p18]]]]]]] & ~ [E [~ [[EX [[1<=p26 & [1<=p27 & 1<=p29]]] | ~ [E [true U ~ [1<=p18]]]]] U [[1<=p0 & [1<=p51 & 1<=p52]] & ~ [[EX [[1<=p26 & [1<=p27 & 1<=p29]]] | ~ [E [true U ~ [1<=p18]]]]]]]]]]] U [~ [E [true U [1<=p31 & [1<=p32 & 1<=p34]]]] & ~ [[EG [~ [EG [~ [1<=p27]]]] & ~ [E [p10<=0 U [1<=p50 | [1<=p0 & [1<=p51 & 1<=p52]]]]]]]]]

abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p51)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p0)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p50)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (p10<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p34)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p32)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p31)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p52)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p51)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p0)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p18)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
..
EG iterations: 1
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (1<=p35)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p8)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
abstracting: (1<=p29)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p26)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (5<=p4)
states: 1,794,199,676,465,418,357,178,368 (24)
.
EG iterations: 1
abstracting: (2<=p2)
states: 488,022,311,998,593,793,152,516,096 (26)
abstracting: (2<=p1)
states: 100,475,181,882,063,428,001,988,608 (26)
abstracting: (p38<=0)
states: 61,002,788,999,824,224,144,064,512 (25)
.
EG iterations: 1
abstracting: (1<=p27)
states: 671,030,678,998,066,465,584,709,632 (26)
.
EG iterations: 1
abstracting: (1<=p23)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p53)
states: 671,030,678,998,066,465,584,709,632 (26)
.abstracting: (1<=p49)
states: 284,679,681,999,179,712,672,301,056 (26)
abstracting: (1<=p47)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p46)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p40)
states: 671,030,678,998,066,465,584,709,632 (26)
abstracting: (1<=p12)
states: 671,030,678,998,066,465,584,709,632 (26)
-> the formula is FALSE

FORMULA RefineWMG-PT-010011-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.217sec

totally nodes used: 1976839 (2.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7043514 6938452 13981966
used/not used/entry size/cache size: 8163536 58945328 16 1024MB
basic ops cache: hits/miss/sum: 1970919 1939523 3910442
used/not used/entry size/cache size: 2889856 13887360 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: 68286 68732 137018
used/not used/entry size/cache size: 68466 8320142 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 65163887
1 1920901
2 22703
3 835
4 98
5 64
6 29
7 49
8 10
9 64
>= 10 224

Total processing time: 0m 7.492sec


BK_STOP 1679170261809

--------------------
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:4260 (99), effective:1518 (35)

initing FirstDep: 0m 0.000sec


iterations count:366 (8), effective:116 (2)

iterations count:242 (5), effective:68 (1)

iterations count:242 (5), effective:68 (1)

iterations count:78 (1), effective:7 (0)

iterations count:242 (5), effective:68 (1)

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

iterations count:274 (6), effective:80 (1)

iterations count:338 (7), effective:104 (2)

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

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

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

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

iterations count:310 (7), effective:95 (2)

iterations count:76 (1), effective:22 (0)

iterations count:209 (4), effective:55 (1)

iterations count:251 (5), effective:71 (1)

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

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

iterations count:186 (4), effective:44 (1)

iterations count:272 (6), effective:81 (1)

iterations count:89 (2), effective:18 (0)

iterations count:272 (6), effective:81 (1)

iterations count:272 (6), effective:81 (1)

iterations count:329 (7), effective:106 (2)

iterations count:402 (9), effective:128 (2)

iterations count:63 (1), effective:10 (0)

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

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

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

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

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

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

iterations count:159 (3), effective:32 (0)

iterations count:270 (6), effective:80 (1)

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

iterations count:78 (1), effective:7 (0)

iterations count:398 (9), effective:128 (2)

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

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

iterations count:118 (2), effective:25 (0)

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

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

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

iterations count:53 (1), effective:10 (0)

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

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

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

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

iterations count:252 (5), effective:75 (1)

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

iterations count:78 (1), effective:7 (0)

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

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

iterations count:120 (2), effective:27 (0)

iterations count:132 (3), effective:32 (0)

iterations count:338 (7), effective:104 (2)

iterations count:127 (2), effective:48 (1)

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

iterations count:203 (4), effective:56 (1)

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

iterations count:338 (7), effective:104 (2)

iterations count:127 (2), effective:48 (1)

iterations count:293 (6), effective:83 (1)

iterations count:338 (7), effective:104 (2)

iterations count:127 (2), effective:48 (1)

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

iterations count:117 (2), effective:19 (0)

iterations count:302 (7), effective:92 (2)

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

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

iterations count:228 (5), effective:65 (1)

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

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

iterations count:118 (2), effective:25 (0)

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

iterations count:398 (9), effective:128 (2)

iterations count:43 (1), effective:0 (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="RefineWMG-PT-010011"
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 RefineWMG-PT-010011, 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-167889203400586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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