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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 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 255K 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-04-CTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680820395789

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-04
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 22:33:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 22:33:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 22:33:17] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-04-06 22:33:17] [INFO ] Transformed 196 places.
[2023-04-06 22:33:17] [INFO ] Transformed 448 transitions.
[2023-04-06 22:33:17] [INFO ] Found NUPN structural information;
[2023-04-06 22:33:17] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 7 ms.
Support contains 82 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 193 transition count 436
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 436
Applied a total of 6 rules in 30 ms. Remains 193 /196 variables (removed 3) and now considering 436/448 (removed 12) transitions.
[2023-04-06 22:33:17] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
// Phase 1: matrix 272 rows 193 cols
[2023-04-06 22:33:17] [INFO ] Computed 13 invariants in 19 ms
[2023-04-06 22:33:17] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-04-06 22:33:17] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-06 22:33:17] [INFO ] Invariant cache hit.
[2023-04-06 22:33:17] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-04-06 22:33:18] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-04-06 22:33:18] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-06 22:33:18] [INFO ] Invariant cache hit.
[2023-04-06 22:33:18] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/196 places, 436/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 ms. Remains : 193/196 places, 436/448 transitions.
Support contains 82 out of 193 places after structural reductions.
[2023-04-06 22:33:18] [INFO ] Flatten gal took : 68 ms
[2023-04-06 22:33:18] [INFO ] Flatten gal took : 31 ms
[2023-04-06 22:33:18] [INFO ] Input system was already deterministic with 436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 71) seen :22
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 49) 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 49) 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 49) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 47) 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 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 :2
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 6 ms. (steps per millisecond=166 ) 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 6 ms. (steps per millisecond=166 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 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 7 ms. (steps per millisecond=143 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Running SMT prover for 44 properties.
[2023-04-06 22:33:19] [INFO ] Flow matrix only has 272 transitions (discarded 164 similar events)
[2023-04-06 22:33:19] [INFO ] Invariant cache hit.
[2023-04-06 22:33:19] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:33:19] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:33:20] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2023-04-06 22:33:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-06 22:33:20] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-06 22:33:20] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2023-04-06 22:33:20] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-04-06 22:33:21] [INFO ] After 594ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :44
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 6 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 2 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:33:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 0 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2023-04-06 22:33:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-04-06 22:33:23] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2023-04-06 22:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 22:33:23] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2023-04-06 22:33:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 22:33:23] [INFO ] After 2628ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :43
Attempting to minimize the solution found.
Minimization took 693 ms.
[2023-04-06 22:33:24] [INFO ] After 4235ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :43
Fused 44 Parikh solutions to 43 different solutions.
Parikh walk visited 0 properties in 796 ms.
Support contains 52 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 436/436 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 0 place count 193 transition count 399
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 0 with 74 rules applied. Total rules applied 74 place count 156 transition count 399
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 80 place count 150 transition count 375
Iterating global reduction 0 with 6 rules applied. Total rules applied 86 place count 150 transition count 375
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 110 place count 138 transition count 363
Applied a total of 110 rules in 56 ms. Remains 138 /193 variables (removed 55) and now considering 363/436 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 138/193 places, 363/436 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 43) 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 43) 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 43) 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 43) 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 43) 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 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 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 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 :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 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 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 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 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 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 5 ms. (steps per millisecond=200 ) 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 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 16 ms. (steps per millisecond=62 ) properties (out of 42) 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 42) 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 42) 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 42) 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 42) seen :0
Interrupted probabilistic random walk after 488050 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{0=1, 1=1, 3=1, 4=1, 7=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 28=1, 29=1, 30=1, 32=1, 33=1, 34=1, 35=1, 36=1, 38=1, 39=1, 40=1, 41=1}
Probabilistic random walk after 488050 steps, saw 102667 distinct states, run finished after 3002 ms. (steps per millisecond=162 ) properties seen :35
Running SMT prover for 7 properties.
[2023-04-06 22:33:28] [INFO ] Flow matrix only has 199 transitions (discarded 164 similar events)
// Phase 1: matrix 199 rows 138 cols
[2023-04-06 22:33:28] [INFO ] Computed 13 invariants in 2 ms
[2023-04-06 22:33:28] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:33:28] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:33:28] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-04-06 22:33:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-06 22:33:28] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-06 22:33:28] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-04-06 22:33:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-04-06 22:33:28] [INFO ] After 76ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-04-06 22:33:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 160 ms
[2023-04-06 22:33:29] [INFO ] After 639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-06 22:33:29] [INFO ] After 885ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 46 ms.
Support contains 17 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 363/363 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 138 transition count 346
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 121 transition count 346
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 118 transition count 334
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 118 transition count 334
Applied a total of 40 rules in 27 ms. Remains 118 /138 variables (removed 20) and now considering 334/363 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 118/138 places, 334/363 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Probably explored full state space saw : 150297 states, properties seen :6
Probabilistic random walk after 751485 steps, saw 150297 distinct states, run finished after 2857 ms. (steps per millisecond=263 ) properties seen :6
Explored full state space saw : 150297 states, properties seen :0
Exhaustive walk after 751485 steps, saw 150297 distinct states, run finished after 1368 ms. (steps per millisecond=549 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 42 ms
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 20 ms
[2023-04-06 22:33:34] [INFO ] Input system was already deterministic with 436 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 12 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 15 ms
[2023-04-06 22:33:34] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 27 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:34] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:34] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 646138 steps, run visited all 1 properties in 1316 ms. (steps per millisecond=490 )
Probabilistic random walk after 646138 steps, saw 130507 distinct states, run finished after 1316 ms. (steps per millisecond=490 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 186 transition count 408
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 186 transition count 408
Applied a total of 14 rules in 5 ms. Remains 186 /193 variables (removed 7) and now considering 408/436 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 186/193 places, 408/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 408 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 23 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36177 steps, run visited all 1 properties in 78 ms. (steps per millisecond=463 )
Probabilistic random walk after 36177 steps, saw 9626 distinct states, run finished after 79 ms. (steps per millisecond=457 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 5 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 188 transition count 416
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 188 transition count 416
Applied a total of 10 rules in 6 ms. Remains 188 /193 variables (removed 5) and now considering 416/436 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 188/193 places, 416/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 416 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 6 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 187 transition count 412
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 187 transition count 412
Applied a total of 12 rules in 5 ms. Remains 187 /193 variables (removed 6) and now considering 412/436 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 187/193 places, 412/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 6 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 22 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 11 ms
[2023-04-06 22:33:36] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 158193 steps, run visited all 1 properties in 315 ms. (steps per millisecond=502 )
Probabilistic random walk after 158193 steps, saw 34593 distinct states, run finished after 316 ms. (steps per millisecond=500 ) properties seen :1
FORMULA EisenbergMcGuire-PT-04-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Parikh walk visited 0 properties in 0 ms.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 184 transition count 400
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 184 transition count 400
Applied a total of 18 rules in 3 ms. Remains 184 /193 variables (removed 9) and now considering 400/436 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 184/193 places, 400/436 transitions.
[2023-04-06 22:33:36] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 185 transition count 404
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 185 transition count 404
Applied a total of 16 rules in 3 ms. Remains 185 /193 variables (removed 8) and now considering 404/436 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 185/193 places, 404/436 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 10 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 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 193 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 190 transition count 433
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 190 transition count 382
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 139 transition count 382
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 117 place count 130 transition count 346
Iterating global reduction 2 with 9 rules applied. Total rules applied 126 place count 130 transition count 346
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 148 place count 119 transition count 335
Applied a total of 148 rules in 16 ms. Remains 119 /193 variables (removed 74) and now considering 335/436 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 119/193 places, 335/436 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 189 transition count 383
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 140 transition count 383
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 115 place count 131 transition count 347
Iterating global reduction 2 with 9 rules applied. Total rules applied 124 place count 131 transition count 347
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 146 place count 120 transition count 336
Applied a total of 146 rules in 16 ms. Remains 120 /193 variables (removed 73) and now considering 336/436 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 120/193 places, 336/436 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 9 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 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 193 transition count 433
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 190 transition count 433
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 6 place count 190 transition count 381
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 110 place count 138 transition count 381
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 118 place count 130 transition count 349
Iterating global reduction 2 with 8 rules applied. Total rules applied 126 place count 130 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 150 place count 118 transition count 337
Applied a total of 150 rules in 16 ms. Remains 118 /193 variables (removed 75) and now considering 337/436 (removed 99) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 118/193 places, 337/436 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 193/193 places, 436/436 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 193 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 189 transition count 432
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 189 transition count 380
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 137 transition count 380
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 121 place count 128 transition count 344
Iterating global reduction 2 with 9 rules applied. Total rules applied 130 place count 128 transition count 344
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 154 place count 116 transition count 332
Applied a total of 154 rules in 16 ms. Remains 116 /193 variables (removed 77) and now considering 332/436 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 116/193 places, 332/436 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 8 ms
[2023-04-06 22:33:37] [INFO ] Input system was already deterministic with 332 transitions.
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 37 ms
[2023-04-06 22:33:37] [INFO ] Flatten gal took : 12 ms
[2023-04-06 22:33:37] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 20 ms.
[2023-04-06 22:33:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 436 transitions and 1904 arcs took 5 ms.
Total runtime 20117 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: 193 NrTr: 436 NrArc: 1904)

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

net check time: 0m 0.000sec

init dd package: 0m 2.726sec


RS generation: 0m46.108sec


-> reachability set: #nodes 170198 (1.7e+05) #states 1,616,316 (6)



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

checking: EF [AG [A [[[p6<=1 & 1<=p6] & [p165<=1 & 1<=p165]] U [[p13<=1 & 1<=p13] & [p164<=1 & 1<=p164]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [E [~ [[[p164<=1 & 1<=p164] & [p13<=1 & 1<=p13]]] U [~ [[[p165<=1 & 1<=p165] & [p6<=1 & 1<=p6]]] & ~ [[[p164<=1 & 1<=p164] & [p13<=1 & 1<=p13]]]]]] & ~ [EG [~ [[[p164<=1 & 1<=p164] & [p13<=1 & 1<=p13]]]]]]]]]]

abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p164)
states: 11,724 (4)
abstracting: (p164<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p164)
states: 11,724 (4)
abstracting: (p164<=1)
states: 1,616,316 (6)
abstracting: (1<=p6)
states: 718,262 (5)
abstracting: (p6<=1)
states: 1,616,316 (6)
abstracting: (1<=p165)
states: 15,992 (4)
abstracting: (p165<=1)
states: 1,616,316 (6)
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p164)
states: 11,724 (4)
abstracting: (p164<=1)
states: 1,616,316 (6)
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.202sec

checking: AX [AG [EF [[[[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] & [p132<=1 & 1<=p132]]] | [[p2<=1 & 1<=p2] & [[p12<=1 & 1<=p12] & [p137<=1 & 1<=p137]]]]]]]
normalized: ~ [EX [E [true U ~ [E [true U [[[[p137<=1 & 1<=p137] & [p12<=1 & 1<=p12]] & [p2<=1 & 1<=p2]] | [[[p132<=1 & 1<=p132] & [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p8)
states: 799,903 (5)
abstracting: (p8<=1)
states: 1,616,316 (6)
abstracting: (1<=p132)
states: 14,910 (4)
abstracting: (p132<=1)
states: 1,616,316 (6)
abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p12)
states: 773,322 (5)
abstracting: (p12<=1)
states: 1,616,316 (6)
abstracting: (1<=p137)
states: 49,890 (4)
abstracting: (p137<=1)
states: 1,616,316 (6)
.-> the formula is TRUE

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

MC time: 0m28.751sec

checking: EF [EX [E [[AX [[[[p14<=1 & 1<=p14] & [p132<=1 & 1<=p132]] & [p3<=1 & 1<=p3]]] | [[p3<=1 & 1<=p3] & [[p14<=1 & 1<=p14] & [p139<=1 & 1<=p139]]]] U AX [[[p0<=1 & 1<=p0] & [p149<=1 & 1<=p149]]]]]]
normalized: E [true U EX [E [[[[[p139<=1 & 1<=p139] & [p14<=1 & 1<=p14]] & [p3<=1 & 1<=p3]] | ~ [EX [~ [[[p3<=1 & 1<=p3] & [[p132<=1 & 1<=p132] & [p14<=1 & 1<=p14]]]]]]] U ~ [EX [~ [[[p149<=1 & 1<=p149] & [p0<=1 & 1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p149)
states: 5,495 (3)
abstracting: (p149<=1)
states: 1,616,316 (6)
.abstracting: (1<=p14)
states: 673,465 (5)
abstracting: (p14<=1)
states: 1,616,316 (6)
abstracting: (1<=p132)
states: 14,910 (4)
abstracting: (p132<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
.abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p14)
states: 673,465 (5)
abstracting: (p14<=1)
states: 1,616,316 (6)
abstracting: (1<=p139)
states: 34,838 (4)
abstracting: (p139<=1)
states: 1,616,316 (6)
.-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.436sec

checking: AF [[[p69<=1 & 1<=p69] | EF [~ [E [[[[p13<=1 & 1<=p13] & [p156<=1 & 1<=p156]] | [[p3<=1 & 1<=p3] & [[p14<=1 & 1<=p14] & [p136<=1 & 1<=p136]]]] U ~ [[[p3<=1 & 1<=p3] & [[p15<=1 & 1<=p15] & [p130<=1 & 1<=p130]]]]]]]]]
normalized: ~ [EG [~ [[E [true U ~ [E [[[[[p136<=1 & 1<=p136] & [p14<=1 & 1<=p14]] & [p3<=1 & 1<=p3]] | [[p156<=1 & 1<=p156] & [p13<=1 & 1<=p13]]] U ~ [[[[p130<=1 & 1<=p130] & [p15<=1 & 1<=p15]] & [p3<=1 & 1<=p3]]]]]] | [p69<=1 & 1<=p69]]]]]

abstracting: (1<=p69)
states: 28,404 (4)
abstracting: (p69<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p15)
states: 861,979 (5)
abstracting: (p15<=1)
states: 1,616,316 (6)
abstracting: (1<=p130)
states: 36,392 (4)
abstracting: (p130<=1)
states: 1,616,316 (6)
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p156)
states: 450
abstracting: (p156<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p14)
states: 673,465 (5)
abstracting: (p14<=1)
states: 1,616,316 (6)
abstracting: (1<=p136)
states: 21,405 (4)
abstracting: (p136<=1)
states: 1,616,316 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m20.965sec

checking: EF [[AF [E [[~ [[[p7<=1 & 1<=p7] & [p109<=1 & 1<=p109]]] | EG [[p115<=1 & 1<=p115]]] U AF [[[p7<=1 & 1<=p7] & [p162<=1 & 1<=p162]]]]] & EF [[[EF [[p63<=0 & 0<=p63]] & [p1<=1 & 1<=p1]] & [[p7<=1 & 1<=p7] & [p130<=1 & 1<=p130]]]]]]
normalized: E [true U [E [true U [[[p130<=1 & 1<=p130] & [p7<=1 & 1<=p7]] & [[p1<=1 & 1<=p1] & E [true U [p63<=0 & 0<=p63]]]]] & ~ [EG [~ [E [[EG [[p115<=1 & 1<=p115]] | ~ [[[p109<=1 & 1<=p109] & [p7<=1 & 1<=p7]]]] U ~ [EG [~ [[[p162<=1 & 1<=p162] & [p7<=1 & 1<=p7]]]]]]]]]]]

abstracting: (1<=p7)
states: 80,651 (4)
abstracting: (p7<=1)
states: 1,616,316 (6)
abstracting: (1<=p162)
states: 480
abstracting: (p162<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p7)
states: 80,651 (4)
abstracting: (p7<=1)
states: 1,616,316 (6)
abstracting: (1<=p109)
states: 56,262 (4)
abstracting: (p109<=1)
states: 1,616,316 (6)
abstracting: (1<=p115)
states: 26,719 (4)
abstracting: (p115<=1)
states: 1,616,316 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p63)
states: 1,616,316 (6)
abstracting: (p63<=0)
states: 1,562,705 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p7)
states: 80,651 (4)
abstracting: (p7<=1)
states: 1,616,316 (6)
abstracting: (1<=p130)
states: 36,392 (4)
abstracting: (p130<=1)
states: 1,616,316 (6)
-> the formula is TRUE

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

MC time: 0m22.072sec

checking: AG [[[[p2<=0 & 0<=p2] | [[p12<=0 & 0<=p12] | [p136<=0 & 0<=p136]]] & [~ [E [[[p1<=1 & 1<=p1] & [p57<=1 & 1<=p57]] U AG [[[p0<=1 & 1<=p0] & [p169<=1 & 1<=p169]]]]] | [[p2<=0 & 0<=p2] | [p57<=0 & 0<=p57]]]]]
normalized: ~ [E [true U ~ [[[[[p57<=0 & 0<=p57] | [p2<=0 & 0<=p2]] | ~ [E [[[p57<=1 & 1<=p57] & [p1<=1 & 1<=p1]] U ~ [E [true U ~ [[[p169<=1 & 1<=p169] & [p0<=1 & 1<=p0]]]]]]]] & [[[p136<=0 & 0<=p136] | [p12<=0 & 0<=p12]] | [p2<=0 & 0<=p2]]]]]]

abstracting: (0<=p2)
states: 1,616,316 (6)
abstracting: (p2<=0)
states: 1,208,329 (6)
abstracting: (0<=p12)
states: 1,616,316 (6)
abstracting: (p12<=0)
states: 842,994 (5)
abstracting: (0<=p136)
states: 1,616,316 (6)
abstracting: (p136<=0)
states: 1,594,911 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p169)
states: 100
abstracting: (p169<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p57)
states: 48,911 (4)
abstracting: (p57<=1)
states: 1,616,316 (6)
abstracting: (0<=p2)
states: 1,616,316 (6)
abstracting: (p2<=0)
states: 1,208,329 (6)
abstracting: (0<=p57)
states: 1,616,316 (6)
abstracting: (p57<=0)
states: 1,567,405 (6)
-> the formula is FALSE

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

MC time: 0m14.169sec

checking: AG [EF [[[EX [AX [[[p3<=0 & 0<=p3] | [[p13<=0 & 0<=p13] | [p140<=0 & 0<=p140]]]]] | EF [[[p0<=1 & 1<=p0] & [[p4<=1 & 1<=p4] & [p144<=1 & 1<=p144]]]]] | [[[p2<=1 & 1<=p2] & [[p10<=1 & 1<=p10] & [p141<=1 & 1<=p141]]] | [[p11<=1 & 1<=p11] & [p110<=1 & 1<=p110]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[p110<=1 & 1<=p110] & [p11<=1 & 1<=p11]] | [[[p141<=1 & 1<=p141] & [p10<=1 & 1<=p10]] & [p2<=1 & 1<=p2]]] | [E [true U [[[p144<=1 & 1<=p144] & [p4<=1 & 1<=p4]] & [p0<=1 & 1<=p0]]] | EX [~ [EX [~ [[[[p140<=0 & 0<=p140] | [p13<=0 & 0<=p13]] | [p3<=0 & 0<=p3]]]]]]]]]]]]

abstracting: (0<=p3)
states: 1,616,316 (6)
abstracting: (p3<=0)
states: 1,171,435 (6)
abstracting: (0<=p13)
states: 1,616,316 (6)
abstracting: (p13<=0)
states: 1,535,444 (6)
abstracting: (0<=p140)
states: 1,616,316 (6)
abstracting: (p140<=0)
states: 1,586,627 (6)
..abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p144)
states: 40,008 (4)
abstracting: (p144<=1)
states: 1,616,316 (6)
abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p10)
states: 79,029 (4)
abstracting: (p10<=1)
states: 1,616,316 (6)
abstracting: (1<=p141)
states: 51,845 (4)
abstracting: (p141<=1)
states: 1,616,316 (6)
abstracting: (1<=p11)
states: 763,965 (5)
abstracting: (p11<=1)
states: 1,616,316 (6)
abstracting: (1<=p110)
states: 48,563 (4)
abstracting: (p110<=1)
states: 1,616,316 (6)
-> the formula is TRUE

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

MC time: 0m 7.943sec

checking: [EF [[EG [[[p14<=1 & 1<=p14] & [p88<=1 & 1<=p88]]] & [E [~ [EF [[p78<=1 & 1<=p78]]] U A [[[p1<=1 & 1<=p1] & [[p9<=1 & 1<=p9] & [p142<=1 & 1<=p142]]] U [p71<=1 & 1<=p71]]] & EG [[[p1<=1 & 1<=p1] & [[p7<=1 & 1<=p7] & [p140<=1 & 1<=p140]]]]]]] | [AG [~ [[p113<=1 & 1<=p113]]] & [AX [[[p0<=1 & 1<=p0] & [p57<=1 & 1<=p57]]] & EG [[AX [[p27<=1 & 1<=p27]] | AX [[[p0<=1 & 1<=p0] & [p60<=1 & 1<=p60]]]]]]]]
normalized: [[[EG [[~ [EX [~ [[[p60<=1 & 1<=p60] & [p0<=1 & 1<=p0]]]]] | ~ [EX [~ [[p27<=1 & 1<=p27]]]]]] & ~ [EX [~ [[[p57<=1 & 1<=p57] & [p0<=1 & 1<=p0]]]]]] & ~ [E [true U [p113<=1 & 1<=p113]]]] | E [true U [[EG [[[[p140<=1 & 1<=p140] & [p7<=1 & 1<=p7]] & [p1<=1 & 1<=p1]]] & E [~ [E [true U [p78<=1 & 1<=p78]]] U [~ [EG [~ [[p71<=1 & 1<=p71]]]] & ~ [E [~ [[p71<=1 & 1<=p71]] U [~ [[[[p142<=1 & 1<=p142] & [p9<=1 & 1<=p9]] & [p1<=1 & 1<=p1]]] & ~ [[p71<=1 & 1<=p71]]]]]]]] & EG [[[p88<=1 & 1<=p88] & [p14<=1 & 1<=p14]]]]]]

abstracting: (1<=p14)
states: 673,465 (5)
abstracting: (p14<=1)
states: 1,616,316 (6)
abstracting: (1<=p88)
states: 60,311 (4)
abstracting: (p88<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p71)
states: 37,752 (4)
abstracting: (p71<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p9)
states: 735,762 (5)
abstracting: (p9<=1)
states: 1,616,316 (6)
abstracting: (1<=p142)
states: 44,650 (4)
abstracting: (p142<=1)
states: 1,616,316 (6)
abstracting: (1<=p71)
states: 37,752 (4)
abstracting: (p71<=1)
states: 1,616,316 (6)
abstracting: (1<=p71)
states: 37,752 (4)
abstracting: (p71<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p78)
states: 525
abstracting: (p78<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p7)
states: 80,651 (4)
abstracting: (p7<=1)
states: 1,616,316 (6)
abstracting: (1<=p140)
states: 29,689 (4)
abstracting: (p140<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p113)
states: 72,871 (4)
abstracting: (p113<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p57)
states: 48,911 (4)
abstracting: (p57<=1)
states: 1,616,316 (6)
.abstracting: (1<=p27)
states: 63,225 (4)
abstracting: (p27<=1)
states: 1,616,316 (6)
.abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p60)
states: 49,832 (4)
abstracting: (p60<=1)
states: 1,616,316 (6)
..
EG iterations: 1
-> the formula is FALSE

FORMULA EisenbergMcGuire-PT-04-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m58.847sec

checking: AX [[EF [EG [AG [[[p13<=1 & 1<=p13] & [p160<=1 & 1<=p160]]]]] & [[p73<=0 & 0<=p73] | [EG [[[[p9<=0 & 0<=p9] | [p50<=0 & 0<=p50]] | [[p0<=0 & 0<=p0] | [p146<=0 & 0<=p146]]]] | [[[p0<=1 & 1<=p0] & [p6<=1 & 1<=p6]] & [[p132<=1 & 1<=p132] & [[AX [[[p1<=0 & 0<=p1] | [[p8<=0 & 0<=p8] | [p143<=0 & 0<=p143]]]] | [p7<=0 & 0<=p7]] | [[p47<=0 & 0<=p47] | [[p15<=0 & 0<=p15] | [p96<=0 & 0<=p96]]]]]]]]]]
normalized: ~ [EX [~ [[[[[[[[[[p96<=0 & 0<=p96] | [p15<=0 & 0<=p15]] | [p47<=0 & 0<=p47]] | [[p7<=0 & 0<=p7] | ~ [EX [~ [[[[p143<=0 & 0<=p143] | [p8<=0 & 0<=p8]] | [p1<=0 & 0<=p1]]]]]]] & [p132<=1 & 1<=p132]] & [[p6<=1 & 1<=p6] & [p0<=1 & 1<=p0]]] | EG [[[[p146<=0 & 0<=p146] | [p0<=0 & 0<=p0]] | [[p50<=0 & 0<=p50] | [p9<=0 & 0<=p9]]]]] | [p73<=0 & 0<=p73]] & E [true U EG [~ [E [true U ~ [[[p160<=1 & 1<=p160] & [p13<=1 & 1<=p13]]]]]]]]]]]

abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p160)
states: 2,070 (3)
abstracting: (p160<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (0<=p73)
states: 1,616,316 (6)
abstracting: (p73<=0)
states: 1,614,685 (6)
abstracting: (0<=p9)
states: 1,616,316 (6)
abstracting: (p9<=0)
states: 880,554 (5)
abstracting: (0<=p50)
states: 1,616,316 (6)
abstracting: (p50<=0)
states: 1,566,069 (6)
abstracting: (0<=p0)
states: 1,616,316 (6)
abstracting: (p0<=0)
states: 1,247,851 (6)
abstracting: (0<=p146)
states: 1,616,316 (6)
abstracting: (p146<=0)
states: 1,599,760 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p6)
states: 718,262 (5)
abstracting: (p6<=1)
states: 1,616,316 (6)
abstracting: (1<=p132)
states: 14,910 (4)
abstracting: (p132<=1)
states: 1,616,316 (6)
abstracting: (0<=p1)
states: 1,616,316 (6)
abstracting: (p1<=0)
states: 1,221,333 (6)
abstracting: (0<=p8)
states: 1,616,316 (6)
abstracting: (p8<=0)
states: 816,413 (5)
abstracting: (0<=p143)
states: 1,616,316 (6)
abstracting: (p143<=0)
states: 1,579,277 (6)
.abstracting: (0<=p7)
states: 1,616,316 (6)
abstracting: (p7<=0)
states: 1,535,665 (6)
abstracting: (0<=p47)
states: 1,616,316 (6)
abstracting: (p47<=0)
states: 1,561,562 (6)
abstracting: (0<=p15)
states: 1,616,316 (6)
abstracting: (p15<=0)
states: 754,337 (5)
abstracting: (0<=p96)
states: 1,616,316 (6)
abstracting: (p96<=0)
states: 1,589,597 (6)
.-> the formula is FALSE

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

MC time: 0m 1.771sec

checking: ~ [E [[~ [E [[~ [[[p2<=1 & 1<=p2] & [[p10<=1 & 1<=p10] & [p136<=1 & 1<=p136]]]] & [[p11<=1 & 1<=p11] & [p167<=1 & 1<=p167]]] U [~ [[[p0<=1 & 1<=p0] & [[p6<=1 & 1<=p6] & [p132<=1 & 1<=p132]]]] | EX [[[p1<=1 & 1<=p1] & [p176<=1 & 1<=p176]]]]]] | EG [~ [[[p3<=1 & 1<=p3] & [[p14<=1 & 1<=p14] & [p130<=1 & 1<=p130]]]]]] U EG [[[EG [AG [[[p9<=1 & 1<=p9] & [p158<=1 & 1<=p158]]]] & [p2<=1 & 1<=p2]] & [[p11<=1 & 1<=p11] & [p129<=1 & 1<=p129]]]]]]
normalized: ~ [E [[EG [~ [[[[p130<=1 & 1<=p130] & [p14<=1 & 1<=p14]] & [p3<=1 & 1<=p3]]]] | ~ [E [[[[p167<=1 & 1<=p167] & [p11<=1 & 1<=p11]] & ~ [[[[p136<=1 & 1<=p136] & [p10<=1 & 1<=p10]] & [p2<=1 & 1<=p2]]]] U [EX [[[p176<=1 & 1<=p176] & [p1<=1 & 1<=p1]]] | ~ [[[[p132<=1 & 1<=p132] & [p6<=1 & 1<=p6]] & [p0<=1 & 1<=p0]]]]]]] U EG [[[[p129<=1 & 1<=p129] & [p11<=1 & 1<=p11]] & [[p2<=1 & 1<=p2] & EG [~ [E [true U ~ [[[p158<=1 & 1<=p158] & [p9<=1 & 1<=p9]]]]]]]]]]]

abstracting: (1<=p9)
states: 735,762 (5)
abstracting: (p9<=1)
states: 1,616,316 (6)
abstracting: (1<=p158)
states: 125
abstracting: (p158<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p11)
states: 763,965 (5)
abstracting: (p11<=1)
states: 1,616,316 (6)
abstracting: (1<=p129)
states: 59,512 (4)
abstracting: (p129<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p6)
states: 718,262 (5)
abstracting: (p6<=1)
states: 1,616,316 (6)
abstracting: (1<=p132)
states: 14,910 (4)
abstracting: (p132<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p176)
states: 1,965 (3)
abstracting: (p176<=1)
states: 1,616,316 (6)
.abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p10)
states: 79,029 (4)
abstracting: (p10<=1)
states: 1,616,316 (6)
abstracting: (1<=p136)
states: 21,405 (4)
abstracting: (p136<=1)
states: 1,616,316 (6)
abstracting: (1<=p11)
states: 763,965 (5)
abstracting: (p11<=1)
states: 1,616,316 (6)
abstracting: (1<=p167)
states: 650
abstracting: (p167<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p14)
states: 673,465 (5)
abstracting: (p14<=1)
states: 1,616,316 (6)
abstracting: (1<=p130)
states: 36,392 (4)
abstracting: (p130<=1)
states: 1,616,316 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.047sec

checking: [AG [[EG [[[AF [[[p15<=1 & 1<=p15] & [p42<=1 & 1<=p42]]] | E [[[p4<=1 & 1<=p4] & [p108<=1 & 1<=p108]] U [[p2<=1 & 1<=p2] & [p179<=1 & 1<=p179]]]] | [[[p9<=1 & 1<=p9] & [p158<=1 & 1<=p158]] | [[p3<=1 & 1<=p3] & [p55<=1 & 1<=p55]]]]] & A [~ [[[[p35<=1 & 1<=p35] & [[p4<=1 & 1<=p4] & [p98<=1 & 1<=p98]]] | EX [[[p1<=1 & 1<=p1] & [p59<=1 & 1<=p59]]]]] U AF [~ [[p114<=1 & 1<=p114]]]]]] | AG [EF [[[[p14<=0 & 0<=p14] | [p45<=0 & 0<=p45]] | [[p3<=0 & 0<=p3] | [p58<=0 & 0<=p58]]]]]]
normalized: [~ [E [true U ~ [E [true U [[[p58<=0 & 0<=p58] | [p3<=0 & 0<=p3]] | [[p45<=0 & 0<=p45] | [p14<=0 & 0<=p14]]]]]]] | ~ [E [true U ~ [[[~ [EG [EG [[p114<=1 & 1<=p114]]]] & ~ [E [EG [[p114<=1 & 1<=p114]] U [[EX [[[p59<=1 & 1<=p59] & [p1<=1 & 1<=p1]]] | [[[p98<=1 & 1<=p98] & [p4<=1 & 1<=p4]] & [p35<=1 & 1<=p35]]] & EG [[p114<=1 & 1<=p114]]]]]] & EG [[[[[p55<=1 & 1<=p55] & [p3<=1 & 1<=p3]] | [[p158<=1 & 1<=p158] & [p9<=1 & 1<=p9]]] | [E [[[p108<=1 & 1<=p108] & [p4<=1 & 1<=p4]] U [[p179<=1 & 1<=p179] & [p2<=1 & 1<=p2]]] | ~ [EG [~ [[[p42<=1 & 1<=p42] & [p15<=1 & 1<=p15]]]]]]]]]]]]]

abstracting: (1<=p15)
states: 861,979 (5)
abstracting: (p15<=1)
states: 1,616,316 (6)
abstracting: (1<=p42)
states: 63,225 (4)
abstracting: (p42<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p179)
states: 100
abstracting: (p179<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p108)
states: 62,426 (4)
abstracting: (p108<=1)
states: 1,616,316 (6)
abstracting: (1<=p9)
states: 735,762 (5)
abstracting: (p9<=1)
states: 1,616,316 (6)
abstracting: (1<=p158)
states: 125
abstracting: (p158<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p55)
states: 45,213 (4)
abstracting: (p55<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p114)
states: 46,067 (4)
abstracting: (p114<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p35)
states: 43,979 (4)
abstracting: (p35<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p98)
states: 68,316 (4)
abstracting: (p98<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p59)
states: 43,946 (4)
abstracting: (p59<=1)
states: 1,616,316 (6)
.abstracting: (1<=p114)
states: 46,067 (4)
abstracting: (p114<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (1<=p114)
states: 46,067 (4)
abstracting: (p114<=1)
states: 1,616,316 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p14)
states: 1,616,316 (6)
abstracting: (p14<=0)
states: 942,851 (5)
abstracting: (0<=p45)
states: 1,616,316 (6)
abstracting: (p45<=0)
states: 1,564,640 (6)
abstracting: (0<=p3)
states: 1,616,316 (6)
abstracting: (p3<=0)
states: 1,171,435 (6)
abstracting: (0<=p58)
states: 1,616,316 (6)
abstracting: (p58<=0)
states: 1,562,593 (6)
-> the formula is TRUE

FORMULA EisenbergMcGuire-PT-04-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.206sec

checking: [AF [[[[[p1<=1 & 1<=p1] & [[p9<=1 & 1<=p9] & [p138<=1 & 1<=p138]]] | ~ [A [[[p2<=1 & 1<=p2] & [[p11<=1 & 1<=p11] & [p132<=1 & 1<=p132]]] U [[p13<=1 & 1<=p13] & [p160<=1 & 1<=p160]]]]] | [[EF [[[p7<=0 & 0<=p7] | [p109<=0 & 0<=p109]]] & AX [[[p5<=0 & 0<=p5] | [p98<=0 & 0<=p98]]]] | [~ [E [[[p0<=1 & 1<=p0] & [p56<=1 & 1<=p56]] U [[p1<=1 & 1<=p1] & [p147<=1 & 1<=p147]]]] & AF [[p64<=0 & 0<=p64]]]]]] & AG [[[p2<=0 & 0<=p2] | [[p11<=0 & 0<=p11] | [p142<=0 & 0<=p142]]]]]
normalized: [~ [E [true U ~ [[[[p142<=0 & 0<=p142] | [p11<=0 & 0<=p11]] | [p2<=0 & 0<=p2]]]]] & ~ [EG [~ [[[[~ [EG [~ [[p64<=0 & 0<=p64]]]] & ~ [E [[[p56<=1 & 1<=p56] & [p0<=1 & 1<=p0]] U [[p147<=1 & 1<=p147] & [p1<=1 & 1<=p1]]]]] | [~ [EX [~ [[[p98<=0 & 0<=p98] | [p5<=0 & 0<=p5]]]]] & E [true U [[p109<=0 & 0<=p109] | [p7<=0 & 0<=p7]]]]] | [~ [[~ [EG [~ [[[p160<=1 & 1<=p160] & [p13<=1 & 1<=p13]]]]] & ~ [E [~ [[[p160<=1 & 1<=p160] & [p13<=1 & 1<=p13]]] U [~ [[[[p132<=1 & 1<=p132] & [p11<=1 & 1<=p11]] & [p2<=1 & 1<=p2]]] & ~ [[[p160<=1 & 1<=p160] & [p13<=1 & 1<=p13]]]]]]]] | [[[p138<=1 & 1<=p138] & [p9<=1 & 1<=p9]] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p9)
states: 735,762 (5)
abstracting: (p9<=1)
states: 1,616,316 (6)
abstracting: (1<=p138)
states: 41,869 (4)
abstracting: (p138<=1)
states: 1,616,316 (6)
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p160)
states: 2,070 (3)
abstracting: (p160<=1)
states: 1,616,316 (6)
abstracting: (1<=p2)
states: 407,987 (5)
abstracting: (p2<=1)
states: 1,616,316 (6)
abstracting: (1<=p11)
states: 763,965 (5)
abstracting: (p11<=1)
states: 1,616,316 (6)
abstracting: (1<=p132)
states: 14,910 (4)
abstracting: (p132<=1)
states: 1,616,316 (6)
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p160)
states: 2,070 (3)
abstracting: (p160<=1)
states: 1,616,316 (6)
abstracting: (1<=p13)
states: 80,872 (4)
abstracting: (p13<=1)
states: 1,616,316 (6)
abstracting: (1<=p160)
states: 2,070 (3)
abstracting: (p160<=1)
states: 1,616,316 (6)
.
EG iterations: 1
abstracting: (0<=p7)
states: 1,616,316 (6)
abstracting: (p7<=0)
states: 1,535,665 (6)
abstracting: (0<=p109)
states: 1,616,316 (6)
abstracting: (p109<=0)
states: 1,560,054 (6)
abstracting: (0<=p5)
states: 1,616,316 (6)
abstracting: (p5<=0)
states: 803,419 (5)
abstracting: (0<=p98)
states: 1,616,316 (6)
abstracting: (p98<=0)
states: 1,548,000 (6)
.abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p147)
states: 24,158 (4)
abstracting: (p147<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p56)
states: 51,249 (4)
abstracting: (p56<=1)
states: 1,616,316 (6)
abstracting: (0<=p64)
states: 1,616,316 (6)
abstracting: (p64<=0)
states: 1,565,763 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p2)
states: 1,616,316 (6)
abstracting: (p2<=0)
states: 1,208,329 (6)
abstracting: (0<=p11)
states: 1,616,316 (6)
abstracting: (p11<=0)
states: 852,351 (5)
abstracting: (0<=p142)
states: 1,616,316 (6)
abstracting: (p142<=0)
states: 1,571,666 (6)
-> the formula is FALSE

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

MC time: 0m33.070sec

checking: A [EF [[[p3<=1 & 1<=p3] & [[p52<=1 & 1<=p52] & [[[p1<=1 & 1<=p1] & [[p9<=1 & 1<=p9] & [p137<=1 & 1<=p137]]] | [AX [[[p0<=1 & 1<=p0] & [[p5<=1 & 1<=p5] & [p144<=1 & 1<=p144]]]] & [~ [[[p15<=1 & 1<=p15] & [p111<=1 & 1<=p111]]] | [[[p0<=1 & 1<=p0] & [p54<=1 & 1<=p54]] & [[p4<=1 & 1<=p4] & [p46<=1 & 1<=p46]]]]]]]]] U [AG [E [[[p4<=1 & 1<=p4] & [p161<=1 & 1<=p161]] U ~ [[[[p1<=1 & 1<=p1] & [p21<=1 & 1<=p21]] | [[p3<=1 & 1<=p3] & [p20<=1 & 1<=p20]]]]]] & ~ [AX [[[~ [[[p5<=1 & 1<=p5] & [p49<=1 & 1<=p49]]] | ~ [[p26<=1 & 1<=p26]]] & [[p0<=1 & 1<=p0] & [p145<=1 & 1<=p145]]]]]]]
normalized: [~ [EG [~ [[EX [~ [[[[p145<=1 & 1<=p145] & [p0<=1 & 1<=p0]] & [~ [[p26<=1 & 1<=p26]] | ~ [[[p49<=1 & 1<=p49] & [p5<=1 & 1<=p5]]]]]]] & ~ [E [true U ~ [E [[[p161<=1 & 1<=p161] & [p4<=1 & 1<=p4]] U ~ [[[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]] | [[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]]]]]]]]] & ~ [E [~ [[EX [~ [[[[p145<=1 & 1<=p145] & [p0<=1 & 1<=p0]] & [~ [[p26<=1 & 1<=p26]] | ~ [[[p49<=1 & 1<=p49] & [p5<=1 & 1<=p5]]]]]]] & ~ [E [true U ~ [E [[[p161<=1 & 1<=p161] & [p4<=1 & 1<=p4]] U ~ [[[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]] | [[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]]]]]]] U [~ [E [true U [[[[[[[[p46<=1 & 1<=p46] & [p4<=1 & 1<=p4]] & [[p54<=1 & 1<=p54] & [p0<=1 & 1<=p0]]] | ~ [[[p111<=1 & 1<=p111] & [p15<=1 & 1<=p15]]]] & ~ [EX [~ [[[[p144<=1 & 1<=p144] & [p5<=1 & 1<=p5]] & [p0<=1 & 1<=p0]]]]]] | [[[p137<=1 & 1<=p137] & [p9<=1 & 1<=p9]] & [p1<=1 & 1<=p1]]] & [p52<=1 & 1<=p52]] & [p3<=1 & 1<=p3]]]] & ~ [[EX [~ [[[[p145<=1 & 1<=p145] & [p0<=1 & 1<=p0]] & [~ [[p26<=1 & 1<=p26]] | ~ [[[p49<=1 & 1<=p49] & [p5<=1 & 1<=p5]]]]]]] & ~ [E [true U ~ [E [[[p161<=1 & 1<=p161] & [p4<=1 & 1<=p4]] U ~ [[[[p20<=1 & 1<=p20] & [p3<=1 & 1<=p3]] | [[p21<=1 & 1<=p21] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p21)
states: 90,256 (4)
abstracting: (p21<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p20)
states: 96,814 (4)
abstracting: (p20<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p161)
states: 2,174 (3)
abstracting: (p161<=1)
states: 1,616,316 (6)
abstracting: (1<=p5)
states: 812,897 (5)
abstracting: (p5<=1)
states: 1,616,316 (6)
abstracting: (1<=p49)
states: 44,957 (4)
abstracting: (p49<=1)
states: 1,616,316 (6)
abstracting: (1<=p26)
states: 54,934 (4)
abstracting: (p26<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p145)
states: 10,270 (4)
abstracting: (p145<=1)
states: 1,616,316 (6)
.abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p52)
states: 47,693 (4)
abstracting: (p52<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p9)
states: 735,762 (5)
abstracting: (p9<=1)
states: 1,616,316 (6)
abstracting: (1<=p137)
states: 49,890 (4)
abstracting: (p137<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p5)
states: 812,897 (5)
abstracting: (p5<=1)
states: 1,616,316 (6)
abstracting: (1<=p144)
states: 40,008 (4)
abstracting: (p144<=1)
states: 1,616,316 (6)
.abstracting: (1<=p15)
states: 861,979 (5)
abstracting: (p15<=1)
states: 1,616,316 (6)
abstracting: (1<=p111)
states: 40,008 (4)
abstracting: (p111<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p54)
states: 56,175 (4)
abstracting: (p54<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p46)
states: 49,373 (4)
abstracting: (p46<=1)
states: 1,616,316 (6)
abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p21)
states: 90,256 (4)
abstracting: (p21<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p20)
states: 96,814 (4)
abstracting: (p20<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p161)
states: 2,174 (3)
abstracting: (p161<=1)
states: 1,616,316 (6)
abstracting: (1<=p5)
states: 812,897 (5)
abstracting: (p5<=1)
states: 1,616,316 (6)
abstracting: (1<=p49)
states: 44,957 (4)
abstracting: (p49<=1)
states: 1,616,316 (6)
abstracting: (1<=p26)
states: 54,934 (4)
abstracting: (p26<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p145)
states: 10,270 (4)
abstracting: (p145<=1)
states: 1,616,316 (6)
.abstracting: (1<=p1)
states: 394,983 (5)
abstracting: (p1<=1)
states: 1,616,316 (6)
abstracting: (1<=p21)
states: 90,256 (4)
abstracting: (p21<=1)
states: 1,616,316 (6)
abstracting: (1<=p3)
states: 444,881 (5)
abstracting: (p3<=1)
states: 1,616,316 (6)
abstracting: (1<=p20)
states: 96,814 (4)
abstracting: (p20<=1)
states: 1,616,316 (6)
abstracting: (1<=p4)
states: 85,157 (4)
abstracting: (p4<=1)
states: 1,616,316 (6)
abstracting: (1<=p161)
states: 2,174 (3)
abstracting: (p161<=1)
states: 1,616,316 (6)
abstracting: (1<=p5)
states: 812,897 (5)
abstracting: (p5<=1)
states: 1,616,316 (6)
abstracting: (1<=p49)
states: 44,957 (4)
abstracting: (p49<=1)
states: 1,616,316 (6)
abstracting: (1<=p26)
states: 54,934 (4)
abstracting: (p26<=1)
states: 1,616,316 (6)
abstracting: (1<=p0)
states: 368,465 (5)
abstracting: (p0<=1)
states: 1,616,316 (6)
abstracting: (1<=p145)
states: 10,270 (4)
abstracting: (p145<=1)
states: 1,616,316 (6)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m37.340sec

totally nodes used: 54536956 (5.5e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 171522582 888772998 1060295580
used/not used/entry size/cache size: 67107858 1006 16 1024MB
basic ops cache: hits/miss/sum: 20936301 69959843 90896144
used/not used/entry size/cache size: 16740575 36641 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: 165137 1249574 1414711
used/not used/entry size/cache size: 1161980 7226628 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 31071619
1 22564321
2 9583652
3 2972040
4 734391
5 151100
6 26838
7 4196
8 620
9 83
>= 10 4

Total processing time: 5m14.223sec


BK_STOP 1680820732659

--------------------
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

45323 80247 107908 132833 162156 168935
iterations count:653302 (1498), effective:6545 (15)

initing FirstDep: 0m 0.000sec


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

iterations count:752 (1), effective:1 (0)
92063 147464
iterations count:278340 (638), effective:3117 (7)

iterations count:436 (1), effective:0 (0)
61797 101308 165613
iterations count:312240 (716), effective:3482 (7)
66255 121885
iterations count:281686 (646), effective:3200 (7)

iterations count:438 (1), effective:1 (0)
42673 110938
iterations count:280676 (643), effective:3153 (7)

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

iterations count:479 (1), effective:1 (0)
48378 109472 173586
iterations count:304147 (697), effective:3397 (7)
42332 109749
iterations count:284256 (651), effective:3204 (7)

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

iterations count:473 (1), effective:1 (0)
48754 121001
iterations count:275236 (631), effective:3088 (7)

iterations count:436 (1), effective:0 (0)
154155
iterations count:157161 (360), effective:1752 (4)

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

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

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

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

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

iterations count:1594 (3), effective:11 (0)

iterations count:912 (2), effective:2 (0)

iterations count:1790 (4), effective:17 (0)

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

iterations count:436 (1), effective:0 (0)
72564 133866
iterations count:294716 (675), effective:3371 (7)

iterations count:436 (1), effective:0 (0)
139709
iterations count:164361 (376), effective:1943 (4)

iterations count:436 (1), effective:0 (0)
139709
iterations count:164361 (376), effective:1943 (4)

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

iterations count:436 (1), effective:0 (0)
139709
iterations count:164361 (376), effective:1943 (4)

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-04"
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-04, 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-167987247100226"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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