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.r458-smll-167912650500570.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 StigmergyElection-PT-03a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500570
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 16:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679548804247

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=StigmergyElection-PT-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:20:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 05:20:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:20:07] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-23 05:20:07] [INFO ] Transformed 44 places.
[2023-03-23 05:20:07] [INFO ] Transformed 118 transitions.
[2023-03-23 05:20:07] [INFO ] Found NUPN structural information;
[2023-03-23 05:20:07] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyElection-PT-03a-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 43 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 43 transition count 72
Applied a total of 2 rules in 31 ms. Remains 43 /44 variables (removed 1) and now considering 72/73 (removed 1) transitions.
[2023-03-23 05:20:07] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
// Phase 1: matrix 64 rows 43 cols
[2023-03-23 05:20:07] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-23 05:20:08] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-23 05:20:08] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2023-03-23 05:20:08] [INFO ] Invariant cache hit.
[2023-03-23 05:20:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 05:20:08] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-23 05:20:08] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2023-03-23 05:20:08] [INFO ] Invariant cache hit.
[2023-03-23 05:20:08] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/44 places, 72/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 43/44 places, 72/73 transitions.
Support contains 37 out of 43 places after structural reductions.
[2023-03-23 05:20:08] [INFO ] Flatten gal took : 46 ms
[2023-03-23 05:20:08] [INFO ] Flatten gal took : 20 ms
[2023-03-23 05:20:09] [INFO ] Input system was already deterministic with 72 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 998 ms. (steps per millisecond=10 ) properties (out of 58) seen :50
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 153 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-23 05:20:10] [INFO ] Flow matrix only has 64 transitions (discarded 8 similar events)
[2023-03-23 05:20:10] [INFO ] Invariant cache hit.
[2023-03-23 05:20:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 05:20:11] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:1
[2023-03-23 05:20:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 05:20:11] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 16 ms.
Successfully simplified 8 atomic propositions for a total of 15 simplifications.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 72 transitions.
Support contains 34 out of 43 places (down from 36) after GAL structural reductions.
Computed a total of 8 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 65
Applied a total of 8 rules in 9 ms. Remains 39 /43 variables (removed 4) and now considering 65/72 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 39/43 places, 65/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 71
Applied a total of 2 rules in 4 ms. Remains 42 /43 variables (removed 1) and now considering 71/72 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 42/43 places, 71/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 69
Applied a total of 4 rules in 5 ms. Remains 41 /43 variables (removed 2) and now considering 69/72 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 41/43 places, 69/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 41 transition count 59
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 29 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 25 place count 29 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 23 transition count 53
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 40 place count 20 transition count 48
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 20 transition count 48
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 18 transition count 44
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 18 transition count 44
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 18 transition count 41
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 62 place count 18 transition count 29
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 68 place count 15 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 15 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 15 transition count 25
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 12 transition count 22
Applied a total of 73 rules in 41 ms. Remains 12 /43 variables (removed 31) and now considering 22/72 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 12/43 places, 22/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 2 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 22 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
FORMULA StigmergyElection-PT-03a-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 43 transition count 68
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 39 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 36 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 36 transition count 63
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 36 transition count 60
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 23 place count 33 transition count 57
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 33 transition count 57
Applied a total of 24 rules in 22 ms. Remains 33 /43 variables (removed 10) and now considering 57/72 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 33/43 places, 57/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 36 transition count 59
Applied a total of 14 rules in 6 ms. Remains 36 /43 variables (removed 7) and now considering 59/72 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 36/43 places, 59/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 36 transition count 59
Applied a total of 14 rules in 5 ms. Remains 36 /43 variables (removed 7) and now considering 59/72 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 36/43 places, 59/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 40 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 67
Applied a total of 6 rules in 4 ms. Remains 40 /43 variables (removed 3) and now considering 67/72 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 40/43 places, 67/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 65
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 37 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 37 transition count 61
Applied a total of 12 rules in 5 ms. Remains 37 /43 variables (removed 6) and now considering 61/72 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 37/43 places, 61/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 39 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 39 transition count 65
Applied a total of 8 rules in 5 ms. Remains 39 /43 variables (removed 4) and now considering 65/72 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 39/43 places, 65/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 40 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 40 transition count 67
Applied a total of 6 rules in 3 ms. Remains 40 /43 variables (removed 3) and now considering 67/72 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/43 places, 67/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 39 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 65
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 36 transition count 59
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 36 transition count 59
Applied a total of 14 rules in 3 ms. Remains 36 /43 variables (removed 7) and now considering 59/72 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/43 places, 59/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 37 transition count 60
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 37 transition count 60
Applied a total of 12 rules in 3 ms. Remains 37 /43 variables (removed 6) and now considering 60/72 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 37/43 places, 60/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:20:11] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 38 transition count 63
Applied a total of 10 rules in 3 ms. Remains 38 /43 variables (removed 5) and now considering 63/72 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 38/43 places, 63/72 transitions.
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:20:11] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:20:12] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 72/72 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 38 transition count 63
Applied a total of 10 rules in 3 ms. Remains 38 /43 variables (removed 5) and now considering 63/72 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 38/43 places, 63/72 transitions.
[2023-03-23 05:20:12] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:20:12] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:20:12] [INFO ] Input system was already deterministic with 63 transitions.
[2023-03-23 05:20:12] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:12] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:20:12] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-23 05:20:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 43 places, 72 transitions and 243 arcs took 1 ms.
Total runtime 4739 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: 43 NrTr: 72 NrArc: 243)

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

net check time: 0m 0.000sec

init dd package: 0m 3.994sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 522 (5.2e+02) #states 227



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

checking: EG [AX [1<=0]]
normalized: EG [~ [EX [~ [1<=0]]]]

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

FORMULA StigmergyElection-PT-03a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AX [AF [[[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]]]
normalized: ~ [EX [EG [~ [[[[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]] | [p12<=0 & 0<=p12]]]]]]

abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
.
EG iterations: 1
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[AX [[[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]] & [p31<=1 & 1<=p31]]]
normalized: ~ [EG [~ [[[p31<=1 & 1<=p31] & ~ [EX [~ [[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [p12<=0 & 0<=p12]]]]]]]]]

abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
.abstracting: (1<=p31)
states: 25
abstracting: (p31<=1)
states: 227
..
EG iterations: 2
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [AF [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & EG [EX [[p29<=0 & 0<=p29]]]]
normalized: [EG [EX [[p29<=0 & 0<=p29]]] & ~ [EG [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]

abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
........
EG iterations: 8
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
.
EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AX [[EF [[EF [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] | ~ [A [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] U [[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]]]] | AX [AF [EG [[p6<=1 & 1<=p6]]]]]]
normalized: ~ [EX [~ [[~ [EX [EG [~ [EG [[p6<=1 & 1<=p6]]]]]] | E [true U [~ [[~ [EG [~ [[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]]]] & ~ [E [~ [[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]] U [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]]]]]]] | E [true U [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]]

abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p21)
states: 16
abstracting: (p21<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p21)
states: 16
abstracting: (p21<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p21)
states: 16
abstracting: (p21<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 227
..
EG iterations: 2
.
EG iterations: 1
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[E [[EX [[[p27<=1 & 1<=p27] & [p42<=1 & 1<=p42]]] & [p41<=1 & 1<=p41]] U EX [EX [[p8<=1 & 1<=p8]]]] & [EG [[[p37<=1 & 1<=p37] & [p42<=1 & 1<=p42]]] & [AG [[[p32<=1 & 1<=p32] & [p42<=1 & 1<=p42]]] | [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]]]
normalized: E [true U [E [[[p41<=1 & 1<=p41] & EX [[[p42<=1 & 1<=p42] & [p27<=1 & 1<=p27]]]] U EX [EX [[p8<=1 & 1<=p8]]]] & [[[[[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]] & [p12<=1 & 1<=p12]] | ~ [E [true U ~ [[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]]]]]] & EG [[[p42<=1 & 1<=p42] & [p37<=1 & 1<=p37]]]]]]

abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p32)
states: 25
abstracting: (p32<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p8)
states: 1
abstracting: (p8<=1)
states: 227
..abstracting: (1<=p27)
states: 9
abstracting: (p27<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EX [[[EG [EX [[p30<=0 & 0<=p30]]] & AF [[[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] | [[p6<=0 & 0<=p6] & [[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]]]]] & [EG [AF [[p33<=0 & 0<=p33]]] & [AG [[p5<=1 & 1<=p5]] & [[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]]]]]
normalized: EX [[[[[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [p12<=0 & 0<=p12]] & ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]] & EG [~ [EG [~ [[p33<=0 & 0<=p33]]]]]] & [~ [EG [~ [[[[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [p12<=0 & 0<=p12]] & [p6<=0 & 0<=p6]] | [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]] & EG [EX [[p30<=0 & 0<=p30]]]]]]

abstracting: (0<=p30)
states: 227
abstracting: (p30<=0)
states: 202
...
EG iterations: 2
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 211
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
..
EG iterations: 2
abstracting: (0<=p33)
states: 227
abstracting: (p33<=0)
states: 211
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
.-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: [AX [AG [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]] | EG [[[EG [[[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]] | [[p31<=0 & 0<=p31] & [[p33<=0 & 0<=p33] & [[[p29<=0 & 0<=p29] | [p12<=0 & 0<=p12]] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]]]] & EF [AG [[p3<=0 & 0<=p3]]]]]]
normalized: [EG [[E [true U ~ [E [true U ~ [[p3<=0 & 0<=p3]]]]] & [[[[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [[p12<=0 & 0<=p12] | [p29<=0 & 0<=p29]]] & [p33<=0 & 0<=p33]] & [p31<=0 & 0<=p31]] | EG [[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [p12<=0 & 0<=p12]]]]]] | ~ [EX [E [true U ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
........
EG iterations: 8
abstracting: (0<=p31)
states: 227
abstracting: (p31<=0)
states: 202
abstracting: (0<=p33)
states: 227
abstracting: (p33<=0)
states: 211
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
abstracting: (0<=p3)
states: 227
abstracting: (p3<=0)
states: 202

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: A [~ [[AX [EG [EF [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]] & [[[p19<=1 & 1<=p19] | EG [[p3<=1 & 1<=p3]]] & [p19<=1 & 1<=p19]]]] U A [[AF [[[p18<=1 & 1<=p18] & [p42<=1 & 1<=p42]]] & EX [~ [[[p30<=1 & 1<=p30] | [p1<=1 & 1<=p1]]]]] U EG [[[p33<=1 & 1<=p33] | [[p28<=1 & 1<=p28] & [[p3<=1 & 1<=p3] & [[p33<=1 & 1<=p33] | [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]]]]]]
normalized: [~ [EG [~ [[~ [EG [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]] & ~ [E [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]] U [~ [[EX [~ [[[p1<=1 & 1<=p1] | [p30<=1 & 1<=p30]]]] & ~ [EG [~ [[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]]]]]]] & ~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]] & ~ [E [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]] U [~ [[EX [~ [[[p1<=1 & 1<=p1] | [p30<=1 & 1<=p30]]]] & ~ [EG [~ [[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]]]]]]] & ~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]]]]] U [[[[p19<=1 & 1<=p19] & [EG [[p3<=1 & 1<=p3]] | [p19<=1 & 1<=p19]]] & ~ [EX [~ [EG [E [true U [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]] & ~ [[~ [EG [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]] & ~ [E [~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]] U [~ [[EX [~ [[[p1<=1 & 1<=p1] | [p30<=1 & 1<=p30]]]] & ~ [EG [~ [[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]]]]]]] & ~ [EG [[[[[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [p33<=1 & 1<=p33]] & [p3<=1 & 1<=p3]] & [p28<=1 & 1<=p28]] | [p33<=1 & 1<=p33]]]]]]]]]]]]]

abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
.abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
.abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
.abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
.abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: A [~ [AX [AX [AG [[p17<=1 & 1<=p17]]]]] U AG [[[AG [[p1<=1 & 1<=p1]] & [~ [EF [[p30<=1 & 1<=p30]]] & A [[[p19<=1 & 1<=p19] | [p0<=1 & 1<=p0]] U AX [[p3<=1 & 1<=p3]]]]] | [[AG [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & [AF [[p30<=1 & 1<=p30]] & EG [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]] & [[[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]] & [[p32<=1 & 1<=p32] & [p42<=1 & 1<=p42]]]]]]]
normalized: [~ [EG [E [true U ~ [[[[[~ [EG [EX [~ [[p3<=1 & 1<=p3]]]]] & ~ [E [EX [~ [[p3<=1 & 1<=p3]]] U [~ [[[p0<=1 & 1<=p0] | [p19<=1 & 1<=p19]]] & EX [~ [[p3<=1 & 1<=p3]]]]]]] & ~ [E [true U [p30<=1 & 1<=p30]]]] & ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]] | [[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]]] & [[EG [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [EG [~ [[p30<=1 & 1<=p30]]]]] & ~ [E [true U ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]]]]] & ~ [E [E [true U ~ [[[[[~ [EG [EX [~ [[p3<=1 & 1<=p3]]]]] & ~ [E [EX [~ [[p3<=1 & 1<=p3]]] U [~ [[[p0<=1 & 1<=p0] | [p19<=1 & 1<=p19]]] & EX [~ [[p3<=1 & 1<=p3]]]]]]] & ~ [E [true U [p30<=1 & 1<=p30]]]] & ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]] | [[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]]] & [[EG [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [EG [~ [[p30<=1 & 1<=p30]]]]] & ~ [E [true U ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]]] U [E [true U ~ [[[[[~ [EG [EX [~ [[p3<=1 & 1<=p3]]]]] & ~ [E [EX [~ [[p3<=1 & 1<=p3]]] U [~ [[[p0<=1 & 1<=p0] | [p19<=1 & 1<=p19]]] & EX [~ [[p3<=1 & 1<=p3]]]]]]] & ~ [E [true U [p30<=1 & 1<=p30]]]] & ~ [E [true U ~ [[p1<=1 & 1<=p1]]]]] | [[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]]] & [[EG [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [EG [~ [[p30<=1 & 1<=p30]]]]] & ~ [E [true U ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]]] & ~ [EX [EX [E [true U ~ [[p17<=1 & 1<=p17]]]]]]]]]]

abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
..abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
...
EG iterations: 3
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
abstracting: (1<=p32)
states: 25
abstracting: (p32<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
..
EG iterations: 1
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
...
EG iterations: 3
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
abstracting: (1<=p32)
states: 25
abstracting: (p32<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
..
EG iterations: 1
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
...
EG iterations: 3
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
abstracting: (1<=p32)
states: 25
abstracting: (p32<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p30)
states: 25
abstracting: (p30<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
.abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
..
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: EX [E [[EX [EF [[p28<=1 & 1<=p28]]] | [EF [[p16<=1 & 1<=p16]] & [EF [[p6<=1 & 1<=p6]] & EF [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]]] U [[p19<=1 & 1<=p19] | [AG [[p17<=1 & 1<=p17]] & [~ [A [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] U [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]] & [~ [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] | [[[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]] & [[p39<=1 & 1<=p39] & [p15<=1 & 1<=p15]]]]]]]]]
normalized: EX [E [[[[E [true U [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & E [true U [p6<=1 & 1<=p6]]] & E [true U [p16<=1 & 1<=p16]]] | EX [E [true U [p28<=1 & 1<=p28]]]] U [[[[[[[p15<=1 & 1<=p15] & [p39<=1 & 1<=p39]] & [[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]]] | ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]] & ~ [[~ [EG [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] U [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]] & ~ [E [true U ~ [[p17<=1 & 1<=p17]]]]] | [p19<=1 & 1<=p19]]]]

abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
........
EG iterations: 8
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
.abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [A [~ [A [[~ [[p28<=1 & 1<=p28]] | [AG [[p5<=1 & 1<=p5]] | EG [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]] U [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]] U A [[p5<=1 & 1<=p5] U EG [E [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] U [p34<=1 & 1<=p34]]]]] | AG [E [~ [[EG [[p41<=1 & 1<=p41]] | ~ [[[p24<=1 & 1<=p24] & [p42<=1 & 1<=p42]]]]] U EG [[[[[p20<=1 & 1<=p20] & [p12<=1 & 1<=p12]] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] | [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]]]]
normalized: [[~ [EG [~ [[~ [EG [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]] & ~ [E [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]] U [~ [[p5<=1 & 1<=p5]] & ~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]] & ~ [E [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]] U [~ [[p5<=1 & 1<=p5]] & ~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]]]]] U [[~ [EG [~ [[[[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]] & [p12<=1 & 1<=p12]]]]] & ~ [E [~ [[[[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]] & [p12<=1 & 1<=p12]]] U [~ [[[[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]] & [p12<=1 & 1<=p12]]] & ~ [[[EG [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] | ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]] | ~ [[p28<=1 & 1<=p28]]]]]]]] & ~ [[~ [EG [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]] & ~ [E [~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]] U [~ [[p5<=1 & 1<=p5]] & ~ [EG [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p34<=1 & 1<=p34]]]]]]]]]]]]] | ~ [E [true U ~ [E [~ [[~ [[[p42<=1 & 1<=p42] & [p24<=1 & 1<=p24]]] | EG [[p41<=1 & 1<=p41]]]] U EG [[[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [[p12<=1 & 1<=p12] & [p20<=1 & 1<=p20]]]]]]]]]]

abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
......
EG iterations: 6
abstracting: (1<=p24)
states: 1
abstracting: (p24<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
........
EG iterations: 8
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AF [[[[EX [[[1<=p18 & p18<=1] & [p42<=1 & 1<=p42]]] & [[p12<=1 & 1<=p12] & [p26<=1 & 1<=p26]]] & [[p39<=1 & 1<=p39] & [[[[p2<=1 & 1<=p2] | [[p17<=1 & 1<=p17] | [p12<=0 & 0<=p12]]] | [[p26<=0 & 0<=p26] | [[p39<=0 & 0<=p39] | [AX [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & [[p12<=0 & 0<=p12] | [[p26<=0 & 0<=p26] | [p39<=0 & 0<=p39]]]]]]] & [AG [[p28<=1 & 1<=p28]] | E [[p29<=1 & 1<=p29] U [[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]]]]]]] | [[EG [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & ~ [E [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] U [p28<=1 & 1<=p28]]]] & [[p6<=0 & 0<=p6] & [EX [[[p4<=0 & 0<=p4] | [p42<=0 & 0<=p42]]] & ~ [A [[[[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]] & [p12<=1 & 1<=p12]] U [p28<=1 & 1<=p28]]]]]]]]
normalized: ~ [EG [~ [[[[[~ [[~ [EG [~ [[p28<=1 & 1<=p28]]]] & ~ [E [~ [[p28<=1 & 1<=p28]] U [~ [[[p12<=1 & 1<=p12] & [[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]]]] & ~ [[p28<=1 & 1<=p28]]]]]]] & EX [[[p42<=0 & 0<=p42] | [p4<=0 & 0<=p4]]]] & [p6<=0 & 0<=p6]] & [~ [E [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] U [p28<=1 & 1<=p28]]] & EG [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]] | [[[[E [[p29<=1 & 1<=p29] U [[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]]] | ~ [E [true U ~ [[p28<=1 & 1<=p28]]]]] & [[[[[[[p39<=0 & 0<=p39] | [p26<=0 & 0<=p26]] | [p12<=0 & 0<=p12]] & ~ [EX [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]] | [p39<=0 & 0<=p39]] | [p26<=0 & 0<=p26]] | [[[p12<=0 & 0<=p12] | [p17<=1 & 1<=p17]] | [p2<=1 & 1<=p2]]]] & [p39<=1 & 1<=p39]] & [[[p26<=1 & 1<=p26] & [p12<=1 & 1<=p12]] & EX [[[p42<=1 & 1<=p42] & [1<=p18 & p18<=1]]]]]]]]]

abstracting: (p18<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p2)
states: 25
abstracting: (p2<=1)
states: 227
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (0<=p26)
states: 227
abstracting: (p26<=0)
states: 171
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 171
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p35)
states: 16
abstracting: (p35<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p29)
states: 25
abstracting: (p29<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 211
abstracting: (0<=p4)
states: 227
abstracting: (p4<=0)
states: 202
abstracting: (0<=p42)
states: 227
abstracting: (p42<=0)
states: 1
.abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
..
EG iterations: 2
........
EG iterations: 8
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [E [A [[EG [AF [[p1<=1 & 1<=p1]]] & [AG [[p5<=1 & 1<=p5]] | AF [[[p21<=1 & 1<=p21] & [p42<=1 & 1<=p42]]]]] U [[~ [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & [p12<=1 & 1<=p12]] & [[p26<=1 & 1<=p26] & [[p39<=1 & 1<=p39] & ~ [[p1<=1 & 1<=p1]]]]]] U [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] | [[[[[p37<=1 & 1<=p37] & [p42<=1 & 1<=p42]] | [[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]] & [E [[[p18<=1 & 1<=p18] & [p42<=1 & 1<=p42]] U [p11<=1 & 1<=p11]] | ~ [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]]]]] & [~ [EX [[[p10<=1 & 1<=p10] & [p42<=1 & 1<=p42]]]] & [[~ [A [[[p12<=1 & 1<=p12] & [[p26<=1 & 1<=p26] & [p39<=1 & 1<=p39]]] U [p11<=1 & 1<=p11]]] & EF [[p23<=1 & 1<=p23]]] | [[[p33<=1 & 1<=p33] & EG [[p41<=1 & 1<=p41]]] | [EG [[[p37<=1 & 1<=p37] & [p42<=1 & 1<=p42]]] & [[p17<=1 & 1<=p17] | [p1<=1 & 1<=p1]]]]]]]]]]
normalized: ~ [E [[~ [EG [~ [[[[~ [[p1<=1 & 1<=p1]] & [p39<=1 & 1<=p39]] & [p26<=1 & 1<=p26]] & [[p12<=1 & 1<=p12] & ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]] & ~ [E [~ [[[[~ [[p1<=1 & 1<=p1]] & [p39<=1 & 1<=p39]] & [p26<=1 & 1<=p26]] & [[p12<=1 & 1<=p12] & ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]] U [~ [[[~ [EG [~ [[[p42<=1 & 1<=p42] & [p21<=1 & 1<=p21]]]]] | ~ [E [true U ~ [[p5<=1 & 1<=p5]]]]] & EG [~ [EG [~ [[p1<=1 & 1<=p1]]]]]]] & ~ [[[[~ [[p1<=1 & 1<=p1]] & [p39<=1 & 1<=p39]] & [p26<=1 & 1<=p26]] & [[p12<=1 & 1<=p12] & ~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]]]]]] U [[[[[[[[p1<=1 & 1<=p1] | [p17<=1 & 1<=p17]] & EG [[[p42<=1 & 1<=p42] & [p37<=1 & 1<=p37]]]] | [EG [[p41<=1 & 1<=p41]] & [p33<=1 & 1<=p33]]] | [E [true U [p23<=1 & 1<=p23]] & ~ [[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] & ~ [[p11<=1 & 1<=p11]]]]]]]]] & ~ [EX [[[p42<=1 & 1<=p42] & [p10<=1 & 1<=p10]]]]] & [[~ [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]] | E [[[p42<=1 & 1<=p42] & [p18<=1 & 1<=p18]] U [p11<=1 & 1<=p11]]] & [[[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]] | [[p42<=1 & 1<=p42] & [p37<=1 & 1<=p37]]]]] | [[[p39<=1 & 1<=p39] & [p26<=1 & 1<=p26]] & [p12<=1 & 1<=p12]]]]]

abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
......
EG iterations: 6
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
..
EG iterations: 2
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 227
abstracting: (1<=p21)
states: 16
abstracting: (p21<=1)
states: 227
abstracting: (1<=p42)
states: 226
abstracting: (p42<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
abstracting: (1<=p39)
states: 56
abstracting: (p39<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

totally nodes used: 59746 (6.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 108948 283722 392670
used/not used/entry size/cache size: 337746 66771118 16 1024MB
basic ops cache: hits/miss/sum: 31572 66009 97581
used/not used/entry size/cache size: 102746 16674470 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: 1332 2671 4003
used/not used/entry size/cache size: 2671 8385937 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 67050788
1 56463
2 1560
3 49
4 4
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.098sec


BK_STOP 1679548819542

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:1620 (22), effective:71 (0)

initing FirstDep: 0m 0.000sec


iterations count:876 (12), effective:37 (0)

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

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

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

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

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

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

iterations count:900 (12), effective:37 (0)

iterations count:927 (12), effective:38 (0)

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

iterations count:876 (12), effective:37 (0)

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

iterations count:834 (11), effective:36 (0)

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

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

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

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

iterations count:874 (12), effective:37 (0)

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

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

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

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

iterations count:874 (12), effective:37 (0)

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

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

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

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

iterations count:874 (12), effective:37 (0)

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

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

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

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

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

iterations count:861 (11), effective:37 (0)

iterations count:891 (12), effective:37 (0)

iterations count:876 (12), effective:37 (0)

iterations count:851 (11), effective:37 (0)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:855 (11), effective:32 (0)

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

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

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

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

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

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

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

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

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

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

iterations count:876 (12), effective:37 (0)

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-03a"
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 StigmergyElection-PT-03a, 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 r458-smll-167912650500570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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