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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 121K Mar 31 16:48 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 EisenbergMcGuire-PT-03-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680820237854

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=EisenbergMcGuire-PT-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:30:39] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-04-06 22:30:39] [INFO ] Transformed 117 places.
[2023-04-06 22:30:39] [INFO ] Transformed 216 transitions.
[2023-04-06 22:30:39] [INFO ] Found NUPN structural information;
[2023-04-06 22:30:39] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Support contains 67 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 213
Applied a total of 2 rules in 18 ms. Remains 116 /117 variables (removed 1) and now considering 213/216 (removed 3) transitions.
[2023-04-06 22:30:39] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
// Phase 1: matrix 150 rows 116 cols
[2023-04-06 22:30:39] [INFO ] Computed 10 invariants in 14 ms
[2023-04-06 22:30:39] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-04-06 22:30:39] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:39] [INFO ] Invariant cache hit.
[2023-04-06 22:30:39] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 22:30:39] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-04-06 22:30:40] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:40] [INFO ] Invariant cache hit.
[2023-04-06 22:30:40] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 213/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 601 ms. Remains : 116/117 places, 213/216 transitions.
Support contains 67 out of 116 places after structural reductions.
[2023-04-06 22:30:40] [INFO ] Flatten gal took : 35 ms
[2023-04-06 22:30:40] [INFO ] Flatten gal took : 16 ms
[2023-04-06 22:30:40] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 66 out of 116 places (down from 67) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 75) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 46) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Running SMT prover for 39 properties.
[2023-04-06 22:30:41] [INFO ] Flow matrix only has 150 transitions (discarded 63 similar events)
[2023-04-06 22:30:41] [INFO ] Invariant cache hit.
[2023-04-06 22:30:41] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 22:30:41] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 11 ms returned sat
[2023-04-06 22:30:41] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:36
[2023-04-06 22:30:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-04-06 22:30:42] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2023-04-06 22:30:42] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :33
[2023-04-06 22:30:42] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-04-06 22:30:42] [INFO ] After 282ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :6 sat :33
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 6 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 266 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 146 ms
[2023-04-06 22:30:43] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 22:30:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 22:30:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2023-04-06 22:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-04-06 22:30:44] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-04-06 22:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-04-06 22:30:44] [INFO ] After 1576ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :33
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-04-06 22:30:44] [INFO ] After 2772ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :33
Fused 39 Parikh solutions to 32 different solutions.
Parikh walk visited 0 properties in 302 ms.
Support contains 36 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 115 transition count 212
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 2 place count 115 transition count 191
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 44 place count 94 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 93 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 93 transition count 188
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 88 transition count 183
Applied a total of 56 rules in 33 ms. Remains 88 /116 variables (removed 28) and now considering 183/213 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 88/116 places, 183/213 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 33) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-04-06 22:30:45] [INFO ] Flow matrix only has 120 transitions (discarded 63 similar events)
// Phase 1: matrix 120 rows 88 cols
[2023-04-06 22:30:45] [INFO ] Computed 10 invariants in 7 ms
[2023-04-06 22:30:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-04-06 22:30:45] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:45] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-04-06 22:30:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-04-06 22:30:45] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-06 22:30:45] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-04-06 22:30:45] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-04-06 22:30:45] [INFO ] After 181ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2023-04-06 22:30:45] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-04-06 22:30:46] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-04-06 22:30:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-06 22:30:46] [INFO ] After 1000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-04-06 22:30:46] [INFO ] After 1508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Parikh walk visited 0 properties in 226 ms.
Support contains 36 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 183/183 transitions.
Applied a total of 0 rules in 8 ms. Remains 88 /88 variables (removed 0) and now considering 183/183 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 88/88 places, 183/183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Probably explored full state space saw : 10447 states, properties seen :25
Probabilistic random walk after 41788 steps, saw 10447 distinct states, run finished after 274 ms. (steps per millisecond=152 ) properties seen :25
Explored full state space saw : 10447 states, properties seen :0
Exhaustive walk after 41788 steps, saw 10447 distinct states, run finished after 149 ms. (steps per millisecond=280 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 58 out of 116 places (down from 60) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 113 transition count 180
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 83 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 78 transition count 165
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 72 transition count 159
Applied a total of 88 rules in 32 ms. Remains 72 /116 variables (removed 44) and now considering 159/213 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 72/116 places, 159/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 80 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 80 transition count 169
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 74 transition count 163
Applied a total of 84 rules in 17 ms. Remains 74 /116 variables (removed 42) and now considering 163/213 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 74/116 places, 163/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 6 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 6 place count 113 transition count 180
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 66 place count 83 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 71 place count 78 transition count 165
Iterating global reduction 2 with 5 rules applied. Total rules applied 76 place count 78 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 72 transition count 159
Applied a total of 88 rules in 17 ms. Remains 72 /116 variables (removed 44) and now considering 159/213 (removed 54) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 72/116 places, 159/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 73 transition count 160
Applied a total of 86 rules in 15 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 73/116 places, 160/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 160 transitions.
Finished random walk after 233 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=233 )
FORMULA EisenbergMcGuire-PT-03-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 4 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 204
Applied a total of 6 rules in 3 ms. Remains 113 /116 variables (removed 3) and now considering 204/213 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/116 places, 204/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 210
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 6 place count 113 transition count 181
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 64 place count 84 transition count 181
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 79 transition count 166
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 79 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 73 transition count 160
Applied a total of 86 rules in 13 ms. Remains 73 /116 variables (removed 43) and now considering 160/213 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 73/116 places, 160/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 160 transitions.
Finished random walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
FORMULA EisenbergMcGuire-PT-03-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 3 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 114 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 207
Applied a total of 4 rules in 3 ms. Remains 114 /116 variables (removed 2) and now considering 207/213 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 114/116 places, 207/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 114 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 114 transition count 207
Applied a total of 4 rules in 3 ms. Remains 114 /116 variables (removed 2) and now considering 207/213 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 114/116 places, 207/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 113 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 113 transition count 204
Applied a total of 6 rules in 3 ms. Remains 113 /116 variables (removed 3) and now considering 204/213 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/116 places, 204/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 112 transition count 201
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 112 transition count 201
Applied a total of 8 rules in 3 ms. Remains 112 /116 variables (removed 4) and now considering 201/213 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 112/116 places, 201/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 213/213 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 111 transition count 198
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 111 transition count 198
Applied a total of 10 rules in 3 ms. Remains 111 /116 variables (removed 5) and now considering 198/213 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 111/116 places, 198/213 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 5 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 6 ms
[2023-04-06 22:30:48] [INFO ] Input system was already deterministic with 198 transitions.
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Flatten gal took : 7 ms
[2023-04-06 22:30:48] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-06 22:30:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 213 transitions and 888 arcs took 1 ms.
Total runtime 9381 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: 116 NrTr: 213 NrArc: 888)

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

net check time: 0m 0.000sec

init dd package: 0m 2.736sec


RS generation: 0m 1.334sec


-> reachability set: #nodes 12368 (1.2e+04) #states 30,213 (4)



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

checking: EX [[p23<=0 & 0<=p23]]
normalized: EX [[p23<=0 & 0<=p23]]

abstracting: (0<=p23)
states: 30,213 (4)
abstracting: (p23<=0)
states: 29,178 (4)
.-> the formula is TRUE

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

MC time: 0m 0.363sec

checking: EG [EF [[[p4<=1 & 1<=p4] & [p98<=1 & 1<=p98]]]]
normalized: EG [E [true U [[p4<=1 & 1<=p4] & [p98<=1 & 1<=p98]]]]

abstracting: (1<=p98)
states: 401
abstracting: (p98<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)

EG iterations: 0
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.431sec

checking: AF [AG [EF [[[[p11<=1 & 1<=p11] & [p83<=1 & 1<=p83]] & [1<=p2 & p2<=1]]]]]
normalized: ~ [EG [E [true U ~ [E [true U [[1<=p2 & p2<=1] & [[p83<=1 & 1<=p83] & [p11<=1 & 1<=p11]]]]]]]]

abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p83)
states: 1,178 (3)
abstracting: (p83<=1)
states: 30,213 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.539sec

checking: AG [E [~ [[[1<=p99 & p99<=1] & [p8<=1 & 1<=p8]]] U AG [[[p1<=1 & 1<=p1] & [p35<=1 & 1<=p35]]]]]
normalized: ~ [E [true U ~ [E [~ [[[p8<=1 & 1<=p8] & [1<=p99 & p99<=1]]] U ~ [E [true U ~ [[[p1<=1 & 1<=p1] & [p35<=1 & 1<=p35]]]]]]]]]

abstracting: (1<=p35)
states: 1,281 (3)
abstracting: (p35<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (p99<=1)
states: 30,213 (4)
abstracting: (1<=p99)
states: 100
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EX [[AF [AG [[[p9<=0 & 0<=p9] | [p28<=0 & 0<=p28]]]] | [[p1<=1 & 1<=p1] & [p35<=1 & 1<=p35]]]]
normalized: EX [[[[p35<=1 & 1<=p35] & [p1<=1 & 1<=p1]] | ~ [EG [E [true U ~ [[[p28<=0 & 0<=p28] | [p9<=0 & 0<=p9]]]]]]]]

abstracting: (0<=p9)
states: 30,213 (4)
abstracting: (p9<=0)
states: 28,506 (4)
abstracting: (0<=p28)
states: 30,213 (4)
abstracting: (p28<=0)
states: 28,855 (4)

EG iterations: 0
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p35)
states: 1,281 (3)
abstracting: (p35<=1)
states: 30,213 (4)
.-> the formula is FALSE

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

MC time: 0m 0.387sec

checking: AX [~ [E [EX [EX [[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p82<=1 & 1<=p82]]]]] U ~ [EF [[[p1<=1 & 1<=p1] & [p36<=1 & 1<=p36]]]]]]]
normalized: ~ [EX [E [EX [EX [[[[p82<=1 & 1<=p82] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]]]] U ~ [E [true U [[p36<=1 & 1<=p36] & [p1<=1 & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p36)
states: 1,033 (3)
abstracting: (p36<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p82)
states: 672
abstracting: (p82<=1)
states: 30,213 (4)
...-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.436sec

checking: [EF [EX [EF [[p45<=1 & 1<=p45]]]] & AF [[EX [EF [[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p80<=1 & 1<=p80]]]]] | [[p8<=1 & 1<=p8] & [p93<=1 & 1<=p93]]]]]
normalized: [~ [EG [~ [[[[p93<=1 & 1<=p93] & [p8<=1 & 1<=p8]] | EX [E [true U [[[p80<=1 & 1<=p80] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]]]]]]]] & E [true U EX [E [true U [p45<=1 & 1<=p45]]]]]

abstracting: (1<=p45)
states: 20
abstracting: (p45<=1)
states: 30,213 (4)
.abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p80)
states: 1,165 (3)
abstracting: (p80<=1)
states: 30,213 (4)
.abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p93)
states: 220
abstracting: (p93<=1)
states: 30,213 (4)
.
EG iterations: 1
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.853sec

checking: EX [AX [EF [[AG [[p23<=1 & 1<=p23]] & [E [[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p77<=1 & 1<=p77]]] U [[p0<=1 & 1<=p0] & [[p5<=1 & 1<=p5] & [p78<=1 & 1<=p78]]]] | AX [[p49<=1 & 1<=p49]]]]]]]
normalized: EX [~ [EX [~ [E [true U [[~ [EX [~ [[p49<=1 & 1<=p49]]]] | E [[[[p77<=1 & 1<=p77] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]] U [[[p78<=1 & 1<=p78] & [p5<=1 & 1<=p5]] & [p0<=1 & 1<=p0]]]] & ~ [E [true U ~ [[p23<=1 & 1<=p23]]]]]]]]]]

abstracting: (1<=p23)
states: 1,035 (3)
abstracting: (p23<=1)
states: 30,213 (4)
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p78)
states: 706
abstracting: (p78<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p77)
states: 1,279 (3)
abstracting: (p77<=1)
states: 30,213 (4)
abstracting: (1<=p49)
states: 25
abstracting: (p49<=1)
states: 30,213 (4)
...-> the formula is FALSE

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

MC time: 0m 0.067sec

checking: AF [[[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p79<=1 & 1<=p79]]] | [[AX [AF [[[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] & [p78<=1 & 1<=p78]]]]] & EG [[[p1<=0 & 0<=p1] | [p36<=0 & 0<=p36]]]] & [[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] & [p84<=1 & 1<=p84]]]]]]
normalized: ~ [EG [~ [[[[[[p84<=1 & 1<=p84] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]] & [EG [[[p36<=0 & 0<=p36] | [p1<=0 & 0<=p1]]] & ~ [EX [EG [~ [[[[p78<=1 & 1<=p78] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]]]]]]] | [[[p79<=1 & 1<=p79] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]]]]]]

abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p79)
states: 494
abstracting: (p79<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p78)
states: 706
abstracting: (p78<=1)
states: 30,213 (4)
.
EG iterations: 1
.abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p36)
states: 30,213 (4)
abstracting: (p36<=0)
states: 29,180 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p84)
states: 918
abstracting: (p84<=1)
states: 30,213 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.078sec

checking: EX [EG [[[[p2<=0 & 0<=p2] | [[p9<=0 & 0<=p9] | [p82<=0 & 0<=p82]]] & [[[p22<=1 & 1<=p22] | [[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]]] | [[[p77<=0 & 0<=p77] | [p11<=0 & 0<=p11]] | [[p66<=0 & 0<=p66] | [[[p0<=0 & 0<=p0] | [[p3<=0 & 0<=p3] | [p84<=0 & 0<=p84]]] & [[[p3<=0 & 0<=p3] | [p31<=0 & 0<=p31]] | [[p7<=0 & 0<=p7] | [p93<=0 & 0<=p93]]]]]]]]]]
normalized: EX [EG [[[[[[[[[p93<=0 & 0<=p93] | [p7<=0 & 0<=p7]] | [[p31<=0 & 0<=p31] | [p3<=0 & 0<=p3]]] & [[[p84<=0 & 0<=p84] | [p3<=0 & 0<=p3]] | [p0<=0 & 0<=p0]]] | [p66<=0 & 0<=p66]] | [[p11<=0 & 0<=p11] | [p77<=0 & 0<=p77]]] | [[[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]] | [p22<=1 & 1<=p22]]] & [[[p82<=0 & 0<=p82] | [p9<=0 & 0<=p9]] | [p2<=0 & 0<=p2]]]]]

abstracting: (0<=p2)
states: 30,213 (4)
abstracting: (p2<=0)
states: 19,593 (4)
abstracting: (0<=p9)
states: 30,213 (4)
abstracting: (p9<=0)
states: 28,506 (4)
abstracting: (0<=p82)
states: 30,213 (4)
abstracting: (p82<=0)
states: 29,541 (4)
abstracting: (1<=p22)
states: 1,384 (3)
abstracting: (p22<=1)
states: 30,213 (4)
abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p7)
states: 30,213 (4)
abstracting: (p7<=0)
states: 16,856 (4)
abstracting: (0<=p77)
states: 30,213 (4)
abstracting: (p77<=0)
states: 28,934 (4)
abstracting: (0<=p11)
states: 30,213 (4)
abstracting: (p11<=0)
states: 13,961 (4)
abstracting: (0<=p66)
states: 30,213 (4)
abstracting: (p66<=0)
states: 29,333 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p3)
states: 30,213 (4)
abstracting: (p3<=0)
states: 28,483 (4)
abstracting: (0<=p84)
states: 30,213 (4)
abstracting: (p84<=0)
states: 29,295 (4)
abstracting: (0<=p3)
states: 30,213 (4)
abstracting: (p3<=0)
states: 28,483 (4)
abstracting: (0<=p31)
states: 30,213 (4)
abstracting: (p31<=0)
states: 29,159 (4)
abstracting: (0<=p7)
states: 30,213 (4)
abstracting: (p7<=0)
states: 16,856 (4)
abstracting: (0<=p93)
states: 30,213 (4)
abstracting: (p93<=0)
states: 29,993 (4)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.048sec

checking: A [[[[A [[[p7<=1 & 1<=p7] & [p51<=1 & 1<=p51]] U [[[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p85<=1 & 1<=p85] & [[p1<=1 & 1<=p1] & [p34<=1 & 1<=p34]]]] | ~ [[[p4<=1 & 1<=p4] & [p60<=1 & 1<=p60]]]] & [AG [[[p8<=1 & 1<=p8] & [p57<=1 & 1<=p57]]] | [[p21<=1 & 1<=p21] | [p72<=1 & 1<=p72]]]]] & [p0<=1 & 1<=p0]] & [[p3<=1 & 1<=p3] & [p84<=1 & 1<=p84]]] | [EX [AF [[[[p9<=1 & 1<=p9] & [p97<=1 & 1<=p97]] | [p72<=1 & 1<=p72]]]] & ~ [AF [[[p0<=1 & 1<=p0] & [[p4<=1 & 1<=p4] & [p84<=1 & 1<=p84]]]]]]] U AF [[A [EG [[[p2<=1 & 1<=p2] & [p15<=1 & 1<=p15]]] U EF [[[p2<=1 & 1<=p2] & [p34<=1 & 1<=p34]]]] | [EX [~ [[[p8<=1 & 1<=p8] & [p13<=1 & 1<=p13]]]] & [p38<=1 & 1<=p38]]]]]
normalized: [~ [EG [EG [~ [[[[p38<=1 & 1<=p38] & EX [~ [[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]]]]] | [~ [EG [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]] & ~ [E [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]] U [~ [EG [[[p15<=1 & 1<=p15] & [p2<=1 & 1<=p2]]]] & ~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]]]]]]]]] & ~ [E [EG [~ [[[[p38<=1 & 1<=p38] & EX [~ [[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]]]]] | [~ [EG [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]] & ~ [E [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]] U [~ [EG [[[p15<=1 & 1<=p15] & [p2<=1 & 1<=p2]]]] & ~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]]]]]]] U [~ [[[EG [~ [[[[p84<=1 & 1<=p84] & [p4<=1 & 1<=p4]] & [p0<=1 & 1<=p0]]]] & EX [~ [EG [~ [[[p72<=1 & 1<=p72] | [[p97<=1 & 1<=p97] & [p9<=1 & 1<=p9]]]]]]]] | [[[p84<=1 & 1<=p84] & [p3<=1 & 1<=p3]] & [[p0<=1 & 1<=p0] & [~ [EG [~ [[[[[p72<=1 & 1<=p72] | [p21<=1 & 1<=p21]] | ~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p8<=1 & 1<=p8]]]]]] & [~ [[[p60<=1 & 1<=p60] & [p4<=1 & 1<=p4]]] | [[[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] & [p85<=1 & 1<=p85]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]] & ~ [E [~ [[[[[p72<=1 & 1<=p72] | [p21<=1 & 1<=p21]] | ~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p8<=1 & 1<=p8]]]]]] & [~ [[[p60<=1 & 1<=p60] & [p4<=1 & 1<=p4]]] | [[[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] & [p85<=1 & 1<=p85]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] U [~ [[[p51<=1 & 1<=p51] & [p7<=1 & 1<=p7]]] & ~ [[[[[p72<=1 & 1<=p72] | [p21<=1 & 1<=p21]] | ~ [E [true U ~ [[[p57<=1 & 1<=p57] & [p8<=1 & 1<=p8]]]]]] & [~ [[[p60<=1 & 1<=p60] & [p4<=1 & 1<=p4]]] | [[[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] & [p85<=1 & 1<=p85]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]]]]]] & EG [~ [[[[p38<=1 & 1<=p38] & EX [~ [[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]]]]] | [~ [EG [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]] & ~ [E [~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]] U [~ [EG [[[p15<=1 & 1<=p15] & [p2<=1 & 1<=p2]]]] & ~ [E [true U [[p34<=1 & 1<=p34] & [p2<=1 & 1<=p2]]]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p13)
states: 3,131 (3)
abstracting: (p13<=1)
states: 30,213 (4)
.abstracting: (1<=p38)
states: 750
abstracting: (p38<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p6)
states: 1,710 (3)
abstracting: (p6<=1)
states: 30,213 (4)
abstracting: (1<=p85)
states: 880
abstracting: (p85<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p60)
states: 1,448 (3)
abstracting: (p60<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p57)
states: 1,503 (3)
abstracting: (p57<=1)
states: 30,213 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
abstracting: (1<=p72)
states: 1,041 (3)
abstracting: (p72<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p51)
states: 1,384 (3)
abstracting: (p51<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p6)
states: 1,710 (3)
abstracting: (p6<=1)
states: 30,213 (4)
abstracting: (1<=p85)
states: 880
abstracting: (p85<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p60)
states: 1,448 (3)
abstracting: (p60<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p57)
states: 1,503 (3)
abstracting: (p57<=1)
states: 30,213 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
abstracting: (1<=p72)
states: 1,041 (3)
abstracting: (p72<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p6)
states: 1,710 (3)
abstracting: (p6<=1)
states: 30,213 (4)
abstracting: (1<=p85)
states: 880
abstracting: (p85<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p60)
states: 1,448 (3)
abstracting: (p60<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p57)
states: 1,503 (3)
abstracting: (p57<=1)
states: 30,213 (4)
abstracting: (1<=p21)
states: 1,297 (3)
abstracting: (p21<=1)
states: 30,213 (4)
abstracting: (1<=p72)
states: 1,041 (3)
abstracting: (p72<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p3)
states: 1,730 (3)
abstracting: (p3<=1)
states: 30,213 (4)
abstracting: (1<=p84)
states: 918
abstracting: (p84<=1)
states: 30,213 (4)
abstracting: (1<=p9)
states: 1,707 (3)
abstracting: (p9<=1)
states: 30,213 (4)
abstracting: (1<=p97)
states: 306
abstracting: (p97<=1)
states: 30,213 (4)
abstracting: (1<=p72)
states: 1,041 (3)
abstracting: (p72<=1)
states: 30,213 (4)
.
EG iterations: 1
.abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p84)
states: 918
abstracting: (p84<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p13)
states: 3,131 (3)
abstracting: (p13<=1)
states: 30,213 (4)
.abstracting: (1<=p38)
states: 750
abstracting: (p38<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p13)
states: 3,131 (3)
abstracting: (p13<=1)
states: 30,213 (4)
.abstracting: (1<=p38)
states: 750
abstracting: (p38<=1)
states: 30,213 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.334sec

checking: EF [[AG [[p54<=1 & 1<=p54]] & [E [[[[p113<=1 & 1<=p113] | [[p7<=1 & 1<=p7] & [p51<=1 & 1<=p51]]] & ~ [[[p2<=1 & 1<=p2] & [[p9<=1 & 1<=p9] & [p82<=1 & 1<=p82]]]]] U ~ [A [[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p78<=1 & 1<=p78]]] U [[p7<=1 & 1<=p7] & [p27<=1 & 1<=p27]]]]] & [[[EX [[[p1<=0 & 0<=p1] | [p15<=0 & 0<=p15]]] | EX [[[[p0<=0 & 0<=p0] | [p87<=0 & 0<=p87]] & [[p0<=0 & 0<=p0] | [p101<=0 & 0<=p101]]]]] | [[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]]] | [[[p83<=0 & 0<=p83] | [p0<=0 & 0<=p0]] | [[p35<=0 & 0<=p35] | [[[p2<=0 & 0<=p2] | [[p10<=0 & 0<=p10] | [p77<=0 & 0<=p77]]] & [[[p1<=0 & 0<=p1] | [p8<=0 & 0<=p8]] | [[p79<=0 & 0<=p79] | [p37<=0 & 0<=p37]]]]]]]]]]
normalized: E [true U [[[[[[[[[p37<=0 & 0<=p37] | [p79<=0 & 0<=p79]] | [[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]]] & [[[p77<=0 & 0<=p77] | [p10<=0 & 0<=p10]] | [p2<=0 & 0<=p2]]] | [p35<=0 & 0<=p35]] | [[p0<=0 & 0<=p0] | [p83<=0 & 0<=p83]]] | [[[p8<=0 & 0<=p8] | [p1<=0 & 0<=p1]] | [EX [[[[p101<=0 & 0<=p101] | [p0<=0 & 0<=p0]] & [[p87<=0 & 0<=p87] | [p0<=0 & 0<=p0]]]] | EX [[[p15<=0 & 0<=p15] | [p1<=0 & 0<=p1]]]]]] & E [[~ [[[[p82<=1 & 1<=p82] & [p9<=1 & 1<=p9]] & [p2<=1 & 1<=p2]]] & [[[p51<=1 & 1<=p51] & [p7<=1 & 1<=p7]] | [p113<=1 & 1<=p113]]] U ~ [[~ [EG [~ [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]]] & ~ [E [~ [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]] U [~ [[[[p78<=1 & 1<=p78] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]]] & ~ [[[p27<=1 & 1<=p27] & [p7<=1 & 1<=p7]]]]]]]]]] & ~ [E [true U ~ [[p54<=1 & 1<=p54]]]]]]

abstracting: (1<=p54)
states: 1,448 (3)
abstracting: (p54<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p27)
states: 1,065 (3)
abstracting: (p27<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p11)
states: 16,252 (4)
abstracting: (p11<=1)
states: 30,213 (4)
abstracting: (1<=p78)
states: 706
abstracting: (p78<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p27)
states: 1,065 (3)
abstracting: (p27<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p27)
states: 1,065 (3)
abstracting: (p27<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p113)
states: 220
abstracting: (p113<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p51)
states: 1,384 (3)
abstracting: (p51<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p9)
states: 1,707 (3)
abstracting: (p9<=1)
states: 30,213 (4)
abstracting: (1<=p82)
states: 672
abstracting: (p82<=1)
states: 30,213 (4)
abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p15)
states: 30,213 (4)
abstracting: (p15<=0)
states: 28,302 (4)
.abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p87)
states: 30,213 (4)
abstracting: (p87<=0)
states: 29,608 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p101)
states: 30,213 (4)
abstracting: (p101<=0)
states: 30,193 (4)
.abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p8)
states: 30,213 (4)
abstracting: (p8<=0)
states: 15,067 (4)
abstracting: (0<=p83)
states: 30,213 (4)
abstracting: (p83<=0)
states: 29,035 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p35)
states: 30,213 (4)
abstracting: (p35<=0)
states: 28,932 (4)
abstracting: (0<=p2)
states: 30,213 (4)
abstracting: (p2<=0)
states: 19,593 (4)
abstracting: (0<=p10)
states: 30,213 (4)
abstracting: (p10<=0)
states: 17,959 (4)
abstracting: (0<=p77)
states: 30,213 (4)
abstracting: (p77<=0)
states: 28,934 (4)
abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p8)
states: 30,213 (4)
abstracting: (p8<=0)
states: 15,067 (4)
abstracting: (0<=p79)
states: 30,213 (4)
abstracting: (p79<=0)
states: 29,719 (4)
abstracting: (0<=p37)
states: 30,213 (4)
abstracting: (p37<=0)
states: 28,932 (4)
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.439sec

checking: E [[AX [EF [[[[p74<=1 & 1<=p74] & [p0<=1 & 1<=p0]] & [[p4<=1 & 1<=p4] & [[p81<=1 & 1<=p81] & ~ [[[p0<=1 & 1<=p0] & [p15<=1 & 1<=p15]]]]]]]] & E [E [[[[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] & [p82<=1 & 1<=p82]]] | [[p1<=1 & 1<=p1] & [p16<=1 & 1<=p16]]] U [[[p0<=1 & 1<=p0] & [[p3<=1 & 1<=p3] & [p85<=1 & 1<=p85]]] | [[p7<=1 & 1<=p7] & [p65<=1 & 1<=p65]]]] U EG [~ [[[p0<=1 & 1<=p0] & [[p4<=1 & 1<=p4] & [p83<=1 & 1<=p83]]]]]]] U [~ [E [~ [AX [[[p0<=1 & 1<=p0] & [[p4<=1 & 1<=p4] & [p82<=1 & 1<=p82]]]]] U AX [AX [[[p0<=1 & 1<=p0] & [p16<=1 & 1<=p16]]]]]] & ~ [[AG [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p83<=1 & 1<=p83]]]] | [[[p0<=1 & 1<=p0] & [p102<=1 & 1<=p102]] | AF [[p49<=1 & 1<=p49]]]]]]]
normalized: E [[E [E [[[[p16<=1 & 1<=p16] & [p1<=1 & 1<=p1]] | [[[p82<=1 & 1<=p82] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]] U [[[p65<=1 & 1<=p65] & [p7<=1 & 1<=p7]] | [[[p85<=1 & 1<=p85] & [p3<=1 & 1<=p3]] & [p0<=1 & 1<=p0]]]] U EG [~ [[[[p83<=1 & 1<=p83] & [p4<=1 & 1<=p4]] & [p0<=1 & 1<=p0]]]]] & ~ [EX [~ [E [true U [[[~ [[[p15<=1 & 1<=p15] & [p0<=1 & 1<=p0]]] & [p81<=1 & 1<=p81]] & [p4<=1 & 1<=p4]] & [[p0<=1 & 1<=p0] & [p74<=1 & 1<=p74]]]]]]]] U [~ [[[~ [EG [~ [[p49<=1 & 1<=p49]]]] | [[p102<=1 & 1<=p102] & [p0<=1 & 1<=p0]]] | ~ [E [true U ~ [[[[p83<=1 & 1<=p83] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [EX [~ [[[[p82<=1 & 1<=p82] & [p4<=1 & 1<=p4]] & [p0<=1 & 1<=p0]]]] U ~ [EX [EX [~ [[[p16<=1 & 1<=p16] & [p0<=1 & 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p16)
states: 1,860 (3)
abstracting: (p16<=1)
states: 30,213 (4)
..abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p82)
states: 672
abstracting: (p82<=1)
states: 30,213 (4)
.abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p83)
states: 1,178 (3)
abstracting: (p83<=1)
states: 30,213 (4)
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p102)
states: 205
abstracting: (p102<=1)
states: 30,213 (4)
abstracting: (1<=p49)
states: 25
abstracting: (p49<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p74)
states: 1,142 (3)
abstracting: (p74<=1)
states: 30,213 (4)
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p81)
states: 892
abstracting: (p81<=1)
states: 30,213 (4)
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
.abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p4)
states: 13,838 (4)
abstracting: (p4<=1)
states: 30,213 (4)
abstracting: (1<=p83)
states: 1,178 (3)
abstracting: (p83<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p3)
states: 1,730 (3)
abstracting: (p3<=1)
states: 30,213 (4)
abstracting: (1<=p85)
states: 880
abstracting: (p85<=1)
states: 30,213 (4)
abstracting: (1<=p7)
states: 13,357 (4)
abstracting: (p7<=1)
states: 30,213 (4)
abstracting: (1<=p65)
states: 1,142 (3)
abstracting: (p65<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p8)
states: 15,146 (4)
abstracting: (p8<=1)
states: 30,213 (4)
abstracting: (1<=p82)
states: 672
abstracting: (p82<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p16)
states: 1,860 (3)
abstracting: (p16<=1)
states: 30,213 (4)
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-03-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.759sec

checking: [AG [[[~ [E [[[p10<=1 & 1<=p10] & [p94<=1 & 1<=p94]] U [[p10<=1 & 1<=p10] & [p30<=1 & 1<=p30]]]] | EG [[[p0<=0 & 0<=p0] | [[p5<=0 & 0<=p5] | [p78<=0 & 0<=p78]]]]] | [EX [[[p5<=0 & 0<=p5] | [p98<=0 & 0<=p98]]] | [~ [A [[[p6<=1 & 1<=p6] & [p57<=1 & 1<=p57]] U [[p5<=1 & 1<=p5] & [p31<=1 & 1<=p31]]]] | [[p0<=1 & 1<=p0] & [[p5<=1 & 1<=p5] & [p81<=1 & 1<=p81]]]]]]] & [EF [[[AX [[[p2<=1 & 1<=p2] & [[p9<=1 & 1<=p9] & [p80<=1 & 1<=p80]]]] & EF [[[p2<=1 & 1<=p2] & [[p10<=1 & 1<=p10] & [p82<=1 & 1<=p82]]]]] & [[[p0<=0 & 0<=p0] | [p15<=0 & 0<=p15]] & [[[[p0<=1 & 1<=p0] & [p35<=1 & 1<=p35]] | [[p1<=1 & 1<=p1] & [p34<=1 & 1<=p34]]] & [[p2<=0 & 0<=p2] | [[p9<=0 & 0<=p9] | [p79<=0 & 0<=p79]]]]]]] | [EX [[[[p1<=0 & 0<=p1] | [[p8<=0 & 0<=p8] | [p84<=0 & 0<=p84]]] & [[p1<=0 & 0<=p1] | [[p8<=0 & 0<=p8] | [p82<=0 & 0<=p82]]]]] | E [[[p10<=1 & 1<=p10] & [p30<=1 & 1<=p30]] U E [AX [EX [[[p10<=1 & 1<=p10] & [p52<=1 & 1<=p52]]]] U [~ [[[p0<=1 & 1<=p0] & [[p15<=1 & 1<=p15] & [p54<=1 & 1<=p54]]]] | AF [[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]]]]]]]]]
normalized: [[[E [[[p30<=1 & 1<=p30] & [p10<=1 & 1<=p10]] U E [~ [EX [~ [EX [[[p52<=1 & 1<=p52] & [p10<=1 & 1<=p10]]]]]] U [~ [EG [~ [[[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]]] | ~ [[[[p54<=1 & 1<=p54] & [p15<=1 & 1<=p15]] & [p0<=1 & 1<=p0]]]]]] | EX [[[[[p82<=0 & 0<=p82] | [p8<=0 & 0<=p8]] | [p1<=0 & 0<=p1]] & [[[p84<=0 & 0<=p84] | [p8<=0 & 0<=p8]] | [p1<=0 & 0<=p1]]]]] | E [true U [[[[[[p79<=0 & 0<=p79] | [p9<=0 & 0<=p9]] | [p2<=0 & 0<=p2]] & [[[p34<=1 & 1<=p34] & [p1<=1 & 1<=p1]] | [[p35<=1 & 1<=p35] & [p0<=1 & 1<=p0]]]] & [[p15<=0 & 0<=p15] | [p0<=0 & 0<=p0]]] & [E [true U [[[p82<=1 & 1<=p82] & [p10<=1 & 1<=p10]] & [p2<=1 & 1<=p2]]] & ~ [EX [~ [[[[p80<=1 & 1<=p80] & [p9<=1 & 1<=p9]] & [p2<=1 & 1<=p2]]]]]]]]] & ~ [E [true U ~ [[[[[[[p81<=1 & 1<=p81] & [p5<=1 & 1<=p5]] & [p0<=1 & 1<=p0]] | ~ [[~ [EG [~ [[[p31<=1 & 1<=p31] & [p5<=1 & 1<=p5]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] & [p5<=1 & 1<=p5]]] U [~ [[[p57<=1 & 1<=p57] & [p6<=1 & 1<=p6]]] & ~ [[[p31<=1 & 1<=p31] & [p5<=1 & 1<=p5]]]]]]]]] | EX [[[p98<=0 & 0<=p98] | [p5<=0 & 0<=p5]]]] | [EG [[[[p78<=0 & 0<=p78] | [p5<=0 & 0<=p5]] | [p0<=0 & 0<=p0]]] | ~ [E [[[p94<=1 & 1<=p94] & [p10<=1 & 1<=p10]] U [[p30<=1 & 1<=p30] & [p10<=1 & 1<=p10]]]]]]]]]]

abstracting: (1<=p10)
states: 12,254 (4)
abstracting: (p10<=1)
states: 30,213 (4)
abstracting: (1<=p30)
states: 1,035 (3)
abstracting: (p30<=1)
states: 30,213 (4)
abstracting: (1<=p10)
states: 12,254 (4)
abstracting: (p10<=1)
states: 30,213 (4)
abstracting: (1<=p94)
states: 75
abstracting: (p94<=1)
states: 30,213 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p5)
states: 30,213 (4)
abstracting: (p5<=0)
states: 15,568 (4)
abstracting: (0<=p78)
states: 30,213 (4)
abstracting: (p78<=0)
states: 29,507 (4)
.
EG iterations: 1
abstracting: (0<=p5)
states: 30,213 (4)
abstracting: (p5<=0)
states: 15,568 (4)
abstracting: (0<=p98)
states: 30,213 (4)
abstracting: (p98<=0)
states: 29,812 (4)
.abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p31)
states: 1,054 (3)
abstracting: (p31<=1)
states: 30,213 (4)
abstracting: (1<=p6)
states: 1,710 (3)
abstracting: (p6<=1)
states: 30,213 (4)
abstracting: (1<=p57)
states: 1,503 (3)
abstracting: (p57<=1)
states: 30,213 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p31)
states: 1,054 (3)
abstracting: (p31<=1)
states: 30,213 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p31)
states: 1,054 (3)
abstracting: (p31<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p81)
states: 892
abstracting: (p81<=1)
states: 30,213 (4)
abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p9)
states: 1,707 (3)
abstracting: (p9<=1)
states: 30,213 (4)
abstracting: (1<=p80)
states: 1,165 (3)
abstracting: (p80<=1)
states: 30,213 (4)
.abstracting: (1<=p2)
states: 10,620 (4)
abstracting: (p2<=1)
states: 30,213 (4)
abstracting: (1<=p10)
states: 12,254 (4)
abstracting: (p10<=1)
states: 30,213 (4)
abstracting: (1<=p82)
states: 672
abstracting: (p82<=1)
states: 30,213 (4)
abstracting: (0<=p0)
states: 30,213 (4)
abstracting: (p0<=0)
states: 20,796 (4)
abstracting: (0<=p15)
states: 30,213 (4)
abstracting: (p15<=0)
states: 28,302 (4)
abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p35)
states: 1,281 (3)
abstracting: (p35<=1)
states: 30,213 (4)
abstracting: (1<=p1)
states: 10,176 (4)
abstracting: (p1<=1)
states: 30,213 (4)
abstracting: (1<=p34)
states: 1,342 (3)
abstracting: (p34<=1)
states: 30,213 (4)
abstracting: (0<=p2)
states: 30,213 (4)
abstracting: (p2<=0)
states: 19,593 (4)
abstracting: (0<=p9)
states: 30,213 (4)
abstracting: (p9<=0)
states: 28,506 (4)
abstracting: (0<=p79)
states: 30,213 (4)
abstracting: (p79<=0)
states: 29,719 (4)
abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p8)
states: 30,213 (4)
abstracting: (p8<=0)
states: 15,067 (4)
abstracting: (0<=p84)
states: 30,213 (4)
abstracting: (p84<=0)
states: 29,295 (4)
abstracting: (0<=p1)
states: 30,213 (4)
abstracting: (p1<=0)
states: 20,037 (4)
abstracting: (0<=p8)
states: 30,213 (4)
abstracting: (p8<=0)
states: 15,067 (4)
abstracting: (0<=p82)
states: 30,213 (4)
abstracting: (p82<=0)
states: 29,541 (4)
.abstracting: (1<=p0)
states: 9,417 (3)
abstracting: (p0<=1)
states: 30,213 (4)
abstracting: (1<=p15)
states: 1,911 (3)
abstracting: (p15<=1)
states: 30,213 (4)
abstracting: (1<=p54)
states: 1,448 (3)
abstracting: (p54<=1)
states: 30,213 (4)
abstracting: (1<=p5)
states: 14,645 (4)
abstracting: (p5<=1)
states: 30,213 (4)
abstracting: (1<=p12)
states: 3,205 (3)
abstracting: (p12<=1)
states: 30,213 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 12,254 (4)
abstracting: (p10<=1)
states: 30,213 (4)
abstracting: (1<=p52)
states: 1,341 (3)
abstracting: (p52<=1)
states: 30,213 (4)
..abstracting: (1<=p10)
states: 12,254 (4)
abstracting: (p10<=1)
states: 30,213 (4)
abstracting: (1<=p30)
states: 1,035 (3)
abstracting: (p30<=1)
states: 30,213 (4)
-> the formula is TRUE

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

MC time: 0m 0.732sec

totally nodes used: 2792163 (2.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7147753 24072281 31220034
used/not used/entry size/cache size: 21930729 45178135 16 1024MB
basic ops cache: hits/miss/sum: 1437991 2988852 4426843
used/not used/entry size/cache size: 4311905 12465311 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: 16440 89329 105769
used/not used/entry size/cache size: 88912 8299696 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 64655562
1 2166309
2 241819
3 39215
4 5286
5 613
6 58
7 2
8 0
9 0
>= 10 0

Total processing time: 0m14.193sec


BK_STOP 1680820264688

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:54834 (257), effective:1213 (5)

initing FirstDep: 0m 0.000sec


iterations count:35431 (166), effective:835 (3)

iterations count:37158 (174), effective:859 (4)

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

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

iterations count:34788 (163), effective:820 (3)

iterations count:37008 (173), effective:873 (4)

iterations count:36060 (169), effective:844 (3)

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

iterations count:38727 (181), effective:886 (4)

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

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

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

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

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

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

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

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

iterations count:34552 (162), effective:814 (3)

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

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

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

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

iterations count:38197 (179), effective:894 (4)

iterations count:1064 (4), effective:21 (0)

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

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

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

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

iterations count:39943 (187), effective:917 (4)

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

iterations count:213 (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="EisenbergMcGuire-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 EisenbergMcGuire-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 r522-tall-167987247100218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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