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

About the Execution of Marcie+red for StigmergyElection-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10300.283 3600000.00 3655839.00 86237.80 ?F??FFTF?TT????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650500610.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-05b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500610
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 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 428K 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-05b-CTLFireability-00
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-01
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-02
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-03
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-04
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-05
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-06
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-07
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-08
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-09
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-10
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-11
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-12
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-13
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-14
FORMULA_NAME StigmergyElection-PT-05b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679556563974

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-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 07:29:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:29:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:29:28] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2023-03-23 07:29:28] [INFO ] Transformed 699 places.
[2023-03-23 07:29:28] [INFO ] Transformed 1266 transitions.
[2023-03-23 07:29:28] [INFO ] Found NUPN structural information;
[2023-03-23 07:29:28] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 449 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 112 out of 699 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 76 place count 623 transition count 1190
Iterating global reduction 0 with 76 rules applied. Total rules applied 152 place count 623 transition count 1190
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 189 place count 586 transition count 1153
Iterating global reduction 0 with 37 rules applied. Total rules applied 226 place count 586 transition count 1153
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 236 place count 576 transition count 1143
Iterating global reduction 0 with 10 rules applied. Total rules applied 246 place count 576 transition count 1143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 249 place count 573 transition count 1140
Iterating global reduction 0 with 3 rules applied. Total rules applied 252 place count 573 transition count 1140
Applied a total of 252 rules in 251 ms. Remains 573 /699 variables (removed 126) and now considering 1140/1266 (removed 126) transitions.
// Phase 1: matrix 1140 rows 573 cols
[2023-03-23 07:29:29] [INFO ] Computed 6 place invariants in 65 ms
[2023-03-23 07:29:30] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-23 07:29:30] [INFO ] Invariant cache hit.
[2023-03-23 07:29:31] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
[2023-03-23 07:29:31] [INFO ] Invariant cache hit.
[2023-03-23 07:29:33] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 573/699 places, 1140/1266 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4224 ms. Remains : 573/699 places, 1140/1266 transitions.
Support contains 112 out of 573 places after structural reductions.
[2023-03-23 07:29:33] [INFO ] Flatten gal took : 300 ms
[2023-03-23 07:29:34] [INFO ] Flatten gal took : 133 ms
[2023-03-23 07:29:34] [INFO ] Input system was already deterministic with 1140 transitions.
Support contains 111 out of 573 places (down from 112) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 97) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 68) 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 68) 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 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 68) 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 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) 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 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) 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 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 68) seen :0
Running SMT prover for 68 properties.
[2023-03-23 07:29:35] [INFO ] Invariant cache hit.
[2023-03-23 07:29:38] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2023-03-23 07:29:38] [INFO ] After 1553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:68
[2023-03-23 07:29:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 15 ms returned sat
[2023-03-23 07:29:46] [INFO ] After 6403ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :59
[2023-03-23 07:29:49] [INFO ] Deduced a trap composed of 172 places in 366 ms of which 8 ms to minimize.
[2023-03-23 07:29:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2023-03-23 07:29:50] [INFO ] Deduced a trap composed of 174 places in 587 ms of which 2 ms to minimize.
[2023-03-23 07:29:51] [INFO ] Deduced a trap composed of 170 places in 557 ms of which 2 ms to minimize.
[2023-03-23 07:29:51] [INFO ] Deduced a trap composed of 169 places in 329 ms of which 2 ms to minimize.
[2023-03-23 07:29:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1657 ms
[2023-03-23 07:29:56] [INFO ] After 15608ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :59
Attempting to minimize the solution found.
Minimization took 5473 ms.
[2023-03-23 07:30:01] [INFO ] After 23542ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :59
Fused 68 Parikh solutions to 59 different solutions.
Parikh walk visited 17 properties in 1089 ms.
Support contains 63 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 478 edges and 573 vertex of which 39 / 573 are part of one of the 8 SCC in 7 ms
Free SCC test removed 31 places
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (complete) has 1118 edges and 542 vertex of which 538 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 282 transitions
Trivial Post-agglo rules discarded 282 transitions
Performed 282 trivial Post agglomeration. Transition count delta: 282
Iterating post reduction 0 with 285 rules applied. Total rules applied 287 place count 538 transition count 813
Reduce places removed 282 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 297 rules applied. Total rules applied 584 place count 256 transition count 798
Reduce places removed 8 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 2 with 41 rules applied. Total rules applied 625 place count 248 transition count 765
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 35 rules applied. Total rules applied 660 place count 215 transition count 763
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 661 place count 214 transition count 763
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 661 place count 214 transition count 739
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 709 place count 190 transition count 739
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 715 place count 184 transition count 733
Iterating global reduction 5 with 6 rules applied. Total rules applied 721 place count 184 transition count 733
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 773 place count 158 transition count 707
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 776 place count 158 transition count 704
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 780 place count 154 transition count 700
Iterating global reduction 6 with 4 rules applied. Total rules applied 784 place count 154 transition count 700
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 788 place count 152 transition count 698
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 810 place count 141 transition count 699
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 811 place count 141 transition count 698
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 815 place count 141 transition count 694
Free-agglomeration rule applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 830 place count 141 transition count 679
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 845 place count 126 transition count 679
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 848 place count 126 transition count 679
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 849 place count 126 transition count 678
Applied a total of 849 rules in 330 ms. Remains 126 /573 variables (removed 447) and now considering 678/1140 (removed 462) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 126/573 places, 678/1140 transitions.
Incomplete random walk after 10000 steps, including 774 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :2
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 39) seen :0
Interrupted probabilistic random walk after 237795 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{29=1}
Probabilistic random walk after 237795 steps, saw 56666 distinct states, run finished after 3005 ms. (steps per millisecond=79 ) properties seen :1
Running SMT prover for 38 properties.
// Phase 1: matrix 678 rows 126 cols
[2023-03-23 07:30:06] [INFO ] Computed 5 place invariants in 17 ms
[2023-03-23 07:30:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-23 07:30:08] [INFO ] After 939ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7 real:31
[2023-03-23 07:30:08] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 07:30:08] [INFO ] After 487ms SMT Verify possible using 31 Read/Feed constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-23 07:30:08] [INFO ] After 1684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:38
[2023-03-23 07:30:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-23 07:30:10] [INFO ] After 1856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :38
[2023-03-23 07:30:12] [INFO ] After 1258ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :38
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 38 places in 220 ms of which 0 ms to minimize.
[2023-03-23 07:30:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 547 ms
[2023-03-23 07:30:13] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 1 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 1 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Deduced a trap composed of 29 places in 261 ms of which 0 ms to minimize.
[2023-03-23 07:30:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 981 ms
[2023-03-23 07:30:16] [INFO ] After 5122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :38
Attempting to minimize the solution found.
Minimization took 1799 ms.
[2023-03-23 07:30:17] [INFO ] After 9172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :38
Parikh walk visited 14 properties in 228 ms.
Support contains 47 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 678/678 transitions.
Graph (trivial) has 25 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 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 4 place count 123 transition count 668
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 120 transition count 666
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 118 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 118 transition count 664
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 116 transition count 664
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 19 place count 112 transition count 646
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 112 transition count 646
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 107 transition count 641
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 107 transition count 639
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 36 place count 106 transition count 638
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 106 transition count 638
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 43 place count 103 transition count 646
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 103 transition count 645
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 53 place count 103 transition count 636
Applied a total of 53 rules in 146 ms. Remains 103 /126 variables (removed 23) and now considering 636/678 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 103/126 places, 636/678 transitions.
Incomplete random walk after 10000 steps, including 744 resets, run finished after 590 ms. (steps per millisecond=16 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 636 rows 103 cols
[2023-03-23 07:30:19] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-23 07:30:19] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 07:30:20] [INFO ] After 777ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2023-03-23 07:30:20] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-23 07:30:20] [INFO ] After 709ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-23 07:30:20] [INFO ] After 1658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-23 07:30:20] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-23 07:30:21] [INFO ] After 799ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-23 07:30:22] [INFO ] After 885ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-23 07:30:23] [INFO ] After 2083ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 835 ms.
[2023-03-23 07:30:24] [INFO ] After 3896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 10 properties in 58 ms.
Support contains 21 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 636/636 transitions.
Graph (trivial) has 58 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 482 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 98 transition count 616
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 87 transition count 616
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 87 transition count 614
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 85 transition count 614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 81 transition count 450
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 81 transition count 450
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 81 transition count 448
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 80 transition count 446
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 80 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 49 place count 76 transition count 442
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 52 place count 76 transition count 439
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 75 transition count 438
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 75 transition count 438
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 75 transition count 437
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 83 place count 75 transition count 409
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 112 place count 47 transition count 408
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 117 place count 42 transition count 403
Iterating global reduction 5 with 5 rules applied. Total rules applied 122 place count 42 transition count 403
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 126 place count 42 transition count 399
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 157 place count 42 transition count 368
Applied a total of 157 rules in 237 ms. Remains 42 /103 variables (removed 61) and now considering 368/636 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 42/103 places, 368/636 transitions.
Finished random walk after 3541 steps, including 317 resets, run visited all 9 properties in 183 ms. (steps per millisecond=19 )
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA StigmergyElection-PT-05b-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 07:30:25] [INFO ] Flatten gal took : 106 ms
[2023-03-23 07:30:25] [INFO ] Flatten gal took : 125 ms
[2023-03-23 07:30:25] [INFO ] Input system was already deterministic with 1140 transitions.
Support contains 96 out of 573 places (down from 98) after GAL structural reductions.
Computed a total of 80 stabilizing places and 85 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 545 edges and 573 vertex of which 91 / 573 are part of one of the 15 SCC in 3 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 308 place count 496 transition count 746
Reduce places removed 307 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 317 rules applied. Total rules applied 625 place count 189 transition count 736
Reduce places removed 5 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 24 rules applied. Total rules applied 649 place count 184 transition count 717
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 668 place count 165 transition count 717
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 668 place count 165 transition count 699
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 704 place count 147 transition count 699
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 718 place count 133 transition count 683
Iterating global reduction 4 with 14 rules applied. Total rules applied 732 place count 133 transition count 683
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 732 place count 133 transition count 682
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 734 place count 132 transition count 682
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 736 place count 130 transition count 678
Iterating global reduction 4 with 2 rules applied. Total rules applied 738 place count 130 transition count 678
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 740 place count 128 transition count 674
Iterating global reduction 4 with 2 rules applied. Total rules applied 742 place count 128 transition count 674
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 784 place count 107 transition count 653
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 795 place count 96 transition count 426
Iterating global reduction 4 with 11 rules applied. Total rules applied 806 place count 96 transition count 426
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 809 place count 96 transition count 423
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 812 place count 93 transition count 417
Iterating global reduction 5 with 3 rules applied. Total rules applied 815 place count 93 transition count 417
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 818 place count 90 transition count 411
Iterating global reduction 5 with 3 rules applied. Total rules applied 821 place count 90 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 823 place count 89 transition count 410
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 824 place count 88 transition count 405
Iterating global reduction 5 with 1 rules applied. Total rules applied 825 place count 88 transition count 405
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 826 place count 88 transition count 404
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 831 place count 88 transition count 399
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 841 place count 83 transition count 394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 842 place count 82 transition count 393
Applied a total of 842 rules in 234 ms. Remains 82 /573 variables (removed 491) and now considering 393/1140 (removed 747) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 234 ms. Remains : 82/573 places, 393/1140 transitions.
[2023-03-23 07:30:25] [INFO ] Flatten gal took : 55 ms
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 34 ms
[2023-03-23 07:30:26] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 551 edges and 573 vertex of which 81 / 573 are part of one of the 14 SCC in 1 ms
Free SCC test removed 67 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 322 place count 505 transition count 743
Reduce places removed 321 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 334 rules applied. Total rules applied 656 place count 184 transition count 730
Reduce places removed 7 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 25 rules applied. Total rules applied 681 place count 177 transition count 712
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 699 place count 159 transition count 712
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 699 place count 159 transition count 695
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 733 place count 142 transition count 695
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 745 place count 130 transition count 682
Iterating global reduction 4 with 12 rules applied. Total rules applied 757 place count 130 transition count 682
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 757 place count 130 transition count 681
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 759 place count 129 transition count 681
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 760 place count 128 transition count 600
Iterating global reduction 4 with 1 rules applied. Total rules applied 761 place count 128 transition count 600
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 762 place count 128 transition count 599
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 806 place count 106 transition count 577
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 818 place count 94 transition count 436
Iterating global reduction 5 with 12 rules applied. Total rules applied 830 place count 94 transition count 436
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 834 place count 94 transition count 432
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 837 place count 91 transition count 426
Iterating global reduction 6 with 3 rules applied. Total rules applied 840 place count 91 transition count 426
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 842 place count 89 transition count 422
Iterating global reduction 6 with 2 rules applied. Total rules applied 844 place count 89 transition count 422
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 846 place count 88 transition count 421
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 847 place count 87 transition count 414
Iterating global reduction 6 with 1 rules applied. Total rules applied 848 place count 87 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 849 place count 87 transition count 413
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 856 place count 87 transition count 406
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 870 place count 80 transition count 399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 871 place count 79 transition count 398
Applied a total of 871 rules in 104 ms. Remains 79 /573 variables (removed 494) and now considering 398/1140 (removed 742) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 79/573 places, 398/1140 transitions.
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 29 ms
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 31 ms
[2023-03-23 07:30:26] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 555 transition count 1122
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 555 transition count 1122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 550 transition count 1117
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 550 transition count 1117
Applied a total of 46 rules in 40 ms. Remains 550 /573 variables (removed 23) and now considering 1117/1140 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 550/573 places, 1117/1140 transitions.
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 40 ms
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 44 ms
[2023-03-23 07:30:26] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 557 transition count 1124
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 557 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 552 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 552 transition count 1119
Applied a total of 42 rules in 38 ms. Remains 552 /573 variables (removed 21) and now considering 1119/1140 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 552/573 places, 1119/1140 transitions.
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 38 ms
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 44 ms
[2023-03-23 07:30:26] [INFO ] Input system was already deterministic with 1119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 556 transition count 1123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 556 transition count 1123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 551 transition count 1118
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 551 transition count 1118
Applied a total of 44 rules in 46 ms. Remains 551 /573 variables (removed 22) and now considering 1118/1140 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 551/573 places, 1118/1140 transitions.
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 42 ms
[2023-03-23 07:30:26] [INFO ] Flatten gal took : 43 ms
[2023-03-23 07:30:27] [INFO ] Input system was already deterministic with 1118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 555 transition count 1122
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 555 transition count 1122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 550 transition count 1117
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 550 transition count 1117
Applied a total of 46 rules in 40 ms. Remains 550 /573 variables (removed 23) and now considering 1117/1140 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 550/573 places, 1117/1140 transitions.
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 39 ms
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 42 ms
[2023-03-23 07:30:27] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 585 edges and 573 vertex of which 91 / 573 are part of one of the 15 SCC in 2 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 340 place count 496 transition count 714
Reduce places removed 339 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 349 rules applied. Total rules applied 689 place count 157 transition count 704
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 695 place count 152 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 696 place count 151 transition count 703
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 696 place count 151 transition count 685
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 732 place count 133 transition count 685
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 745 place count 120 transition count 670
Iterating global reduction 4 with 13 rules applied. Total rules applied 758 place count 120 transition count 670
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 758 place count 120 transition count 668
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 762 place count 118 transition count 668
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 764 place count 116 transition count 585
Iterating global reduction 4 with 2 rules applied. Total rules applied 766 place count 116 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 767 place count 116 transition count 584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 768 place count 115 transition count 582
Iterating global reduction 5 with 1 rules applied. Total rules applied 769 place count 115 transition count 582
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 813 place count 93 transition count 560
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 831 place count 75 transition count 206
Iterating global reduction 5 with 18 rules applied. Total rules applied 849 place count 75 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 857 place count 75 transition count 198
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 861 place count 71 transition count 190
Iterating global reduction 6 with 4 rules applied. Total rules applied 865 place count 71 transition count 190
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 868 place count 68 transition count 184
Iterating global reduction 6 with 3 rules applied. Total rules applied 871 place count 68 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 873 place count 67 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 874 place count 66 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 875 place count 66 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 876 place count 66 transition count 177
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 881 place count 66 transition count 172
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 891 place count 61 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 892 place count 60 transition count 166
Applied a total of 892 rules in 79 ms. Remains 60 /573 variables (removed 513) and now considering 166/1140 (removed 974) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 60/573 places, 166/1140 transitions.
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 7 ms
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 7 ms
[2023-03-23 07:30:27] [INFO ] Input system was already deterministic with 166 transitions.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA StigmergyElection-PT-05b-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 557 transition count 1124
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 557 transition count 1124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 552 transition count 1119
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 552 transition count 1119
Applied a total of 42 rules in 45 ms. Remains 552 /573 variables (removed 21) and now considering 1119/1140 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 552/573 places, 1119/1140 transitions.
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 34 ms
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 37 ms
[2023-03-23 07:30:27] [INFO ] Input system was already deterministic with 1119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 554 transition count 1121
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 554 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 549 transition count 1116
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 549 transition count 1116
Applied a total of 48 rules in 39 ms. Remains 549 /573 variables (removed 24) and now considering 1116/1140 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 549/573 places, 1116/1140 transitions.
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 33 ms
[2023-03-23 07:30:27] [INFO ] Flatten gal took : 55 ms
[2023-03-23 07:30:27] [INFO ] Input system was already deterministic with 1116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 585 edges and 573 vertex of which 91 / 573 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 340 place count 496 transition count 714
Reduce places removed 339 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 349 rules applied. Total rules applied 689 place count 157 transition count 704
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 695 place count 152 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 696 place count 151 transition count 703
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 696 place count 151 transition count 685
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 732 place count 133 transition count 685
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 745 place count 120 transition count 670
Iterating global reduction 4 with 13 rules applied. Total rules applied 758 place count 120 transition count 670
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 758 place count 120 transition count 668
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 762 place count 118 transition count 668
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 764 place count 116 transition count 585
Iterating global reduction 4 with 2 rules applied. Total rules applied 766 place count 116 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 767 place count 116 transition count 584
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 768 place count 115 transition count 582
Iterating global reduction 5 with 1 rules applied. Total rules applied 769 place count 115 transition count 582
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 813 place count 93 transition count 560
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 831 place count 75 transition count 206
Iterating global reduction 5 with 18 rules applied. Total rules applied 849 place count 75 transition count 206
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 858 place count 75 transition count 197
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 862 place count 71 transition count 189
Iterating global reduction 6 with 4 rules applied. Total rules applied 866 place count 71 transition count 189
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 869 place count 68 transition count 183
Iterating global reduction 6 with 3 rules applied. Total rules applied 872 place count 68 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 874 place count 67 transition count 182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 875 place count 66 transition count 177
Iterating global reduction 6 with 1 rules applied. Total rules applied 876 place count 66 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 877 place count 66 transition count 176
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 882 place count 66 transition count 171
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 892 place count 61 transition count 166
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 893 place count 60 transition count 165
Applied a total of 893 rules in 77 ms. Remains 60 /573 variables (removed 513) and now considering 165/1140 (removed 975) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 60/573 places, 165/1140 transitions.
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 7 ms
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 8 ms
[2023-03-23 07:30:28] [INFO ] Input system was already deterministic with 165 transitions.
Finished random walk after 70 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
FORMULA StigmergyElection-PT-05b-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 566 edges and 573 vertex of which 91 / 573 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 321 place count 496 transition count 733
Reduce places removed 320 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 330 rules applied. Total rules applied 651 place count 176 transition count 723
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 657 place count 171 transition count 722
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 658 place count 170 transition count 722
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 658 place count 170 transition count 704
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 694 place count 152 transition count 704
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 707 place count 139 transition count 689
Iterating global reduction 4 with 13 rules applied. Total rules applied 720 place count 139 transition count 689
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 720 place count 139 transition count 687
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 724 place count 137 transition count 687
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 726 place count 135 transition count 604
Iterating global reduction 4 with 2 rules applied. Total rules applied 728 place count 135 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 729 place count 135 transition count 603
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 730 place count 134 transition count 601
Iterating global reduction 5 with 1 rules applied. Total rules applied 731 place count 134 transition count 601
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 775 place count 112 transition count 579
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 785 place count 102 transition count 485
Iterating global reduction 5 with 10 rules applied. Total rules applied 795 place count 102 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 796 place count 102 transition count 484
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 800 place count 98 transition count 476
Iterating global reduction 6 with 4 rules applied. Total rules applied 804 place count 98 transition count 476
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 807 place count 95 transition count 470
Iterating global reduction 6 with 3 rules applied. Total rules applied 810 place count 95 transition count 470
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 812 place count 94 transition count 469
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 813 place count 93 transition count 464
Iterating global reduction 6 with 1 rules applied. Total rules applied 814 place count 93 transition count 464
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 819 place count 93 transition count 459
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 829 place count 88 transition count 454
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 830 place count 87 transition count 453
Applied a total of 830 rules in 140 ms. Remains 87 /573 variables (removed 486) and now considering 453/1140 (removed 687) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 140 ms. Remains : 87/573 places, 453/1140 transitions.
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 25 ms
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 25 ms
[2023-03-23 07:30:28] [INFO ] Input system was already deterministic with 453 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Graph (trivial) has 577 edges and 573 vertex of which 91 / 573 are part of one of the 15 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 334 place count 496 transition count 720
Reduce places removed 333 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 343 rules applied. Total rules applied 677 place count 163 transition count 710
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 683 place count 158 transition count 709
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 684 place count 157 transition count 709
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 684 place count 157 transition count 691
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 720 place count 139 transition count 691
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 732 place count 127 transition count 677
Iterating global reduction 4 with 12 rules applied. Total rules applied 744 place count 127 transition count 677
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 744 place count 127 transition count 676
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 746 place count 126 transition count 676
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 748 place count 124 transition count 593
Iterating global reduction 4 with 2 rules applied. Total rules applied 750 place count 124 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 751 place count 124 transition count 592
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 752 place count 123 transition count 590
Iterating global reduction 5 with 1 rules applied. Total rules applied 753 place count 123 transition count 590
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 799 place count 100 transition count 567
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 812 place count 87 transition count 359
Iterating global reduction 5 with 13 rules applied. Total rules applied 825 place count 87 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 829 place count 87 transition count 355
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 833 place count 83 transition count 347
Iterating global reduction 6 with 4 rules applied. Total rules applied 837 place count 83 transition count 347
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 840 place count 80 transition count 341
Iterating global reduction 6 with 3 rules applied. Total rules applied 843 place count 80 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 845 place count 79 transition count 340
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 846 place count 78 transition count 335
Iterating global reduction 6 with 1 rules applied. Total rules applied 847 place count 78 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 848 place count 78 transition count 334
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 853 place count 78 transition count 329
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 863 place count 73 transition count 324
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 864 place count 72 transition count 323
Applied a total of 864 rules in 97 ms. Remains 72 /573 variables (removed 501) and now considering 323/1140 (removed 817) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 72/573 places, 323/1140 transitions.
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 16 ms
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 18 ms
[2023-03-23 07:30:28] [INFO ] Input system was already deterministic with 323 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 556 transition count 1123
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 556 transition count 1123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 552 transition count 1119
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 552 transition count 1119
Applied a total of 42 rules in 45 ms. Remains 552 /573 variables (removed 21) and now considering 1119/1140 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 552/573 places, 1119/1140 transitions.
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 39 ms
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 43 ms
[2023-03-23 07:30:28] [INFO ] Input system was already deterministic with 1119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 555 transition count 1122
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 555 transition count 1122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 550 transition count 1117
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 550 transition count 1117
Applied a total of 46 rules in 37 ms. Remains 550 /573 variables (removed 23) and now considering 1117/1140 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 550/573 places, 1117/1140 transitions.
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 34 ms
[2023-03-23 07:30:28] [INFO ] Flatten gal took : 37 ms
[2023-03-23 07:30:28] [INFO ] Input system was already deterministic with 1117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 573/573 places, 1140/1140 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 554 transition count 1121
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 554 transition count 1121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 549 transition count 1116
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 549 transition count 1116
Applied a total of 48 rules in 36 ms. Remains 549 /573 variables (removed 24) and now considering 1116/1140 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 549/573 places, 1116/1140 transitions.
[2023-03-23 07:30:29] [INFO ] Flatten gal took : 34 ms
[2023-03-23 07:30:29] [INFO ] Flatten gal took : 37 ms
[2023-03-23 07:30:29] [INFO ] Input system was already deterministic with 1116 transitions.
[2023-03-23 07:30:29] [INFO ] Flatten gal took : 38 ms
[2023-03-23 07:30:29] [INFO ] Flatten gal took : 39 ms
[2023-03-23 07:30:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2023-03-23 07:30:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 573 places, 1140 transitions and 6489 arcs took 10 ms.
Total runtime 61731 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: 573 NrTr: 1140 NrArc: 6489)

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

net check time: 0m 0.001sec

init dd package: 0m 3.551sec


RS generation: 2m 5.187sec


-> reachability set: #nodes 63309 (6.3e+04) #states 65,711,622,523 (10)



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

checking: EX [EG [[p325<=0 & 0<=p325]]]
normalized: EX [EG [[p325<=0 & 0<=p325]]]

abstracting: (0<=p325)
states: 65,711,622,523 (10)
abstracting: (p325<=0)
states: 65,398,816,267 (10)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA StigmergyElection-PT-05b-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.727sec

checking: EX [EG [[[[p45<=0 & 0<=p45] | [p133<=0 & 0<=p133]] | [[p244<=0 & 0<=p244] | [[p381<=0 & 0<=p381] | [p478<=0 & 0<=p478]]]]]]
normalized: EX [EG [[[[[p478<=0 & 0<=p478] | [p381<=0 & 0<=p381]] | [p244<=0 & 0<=p244]] | [[p133<=0 & 0<=p133] | [p45<=0 & 0<=p45]]]]]

abstracting: (0<=p45)
states: 65,711,622,523 (10)
abstracting: (p45<=0)
states: 64,825,342,275 (10)
abstracting: (0<=p133)
states: 65,711,622,523 (10)
abstracting: (p133<=0)
states: 64,834,826,239 (10)
abstracting: (0<=p244)
states: 65,711,622,523 (10)
abstracting: (p244<=0)
states: 64,847,018,335 (10)
abstracting: (0<=p381)
states: 65,711,622,523 (10)
abstracting: (p381<=0)
states: 64,832,812,339 (10)
abstracting: (0<=p478)
states: 65,711,622,523 (10)
abstracting: (p478<=0)
states: 64,832,545,779 (10)
...........................................
EG iterations: 43
.-> the formula is TRUE

FORMULA StigmergyElection-PT-05b-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25.832sec

checking: E [EX [AX [[p129<=1 & 1<=p129]]] U E [~ [AF [[E [[p6<=1 & 1<=p6] U [p459<=1 & 1<=p459]] | EF [[p325<=1 & 1<=p325]]]]] U AG [AX [E [[p166<=1 & 1<=p166] U [p526<=1 & 1<=p526]]]]]]
normalized: E [EX [~ [EX [~ [[p129<=1 & 1<=p129]]]]] U E [EG [~ [[E [true U [p325<=1 & 1<=p325]] | E [[p6<=1 & 1<=p6] U [p459<=1 & 1<=p459]]]]] U ~ [E [true U EX [~ [E [[p166<=1 & 1<=p166] U [p526<=1 & 1<=p526]]]]]]]]

abstracting: (1<=p526)
states: 879,076,744 (8)
abstracting: (p526<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p166)
states: 286,014,960 (8)
abstracting: (p166<=1)
states: 65,711,622,523 (10)
.abstracting: (1<=p459)
states: 336,071,400 (8)
abstracting: (p459<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p6)
states: 345,812,600 (8)
abstracting: (p6<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p325)
states: 312,806,256 (8)
abstracting: (p325<=1)
states: 65,711,622,523 (10)
.
EG iterations: 1
abstracting: (1<=p129)
states: 340,872,420 (8)
abstracting: (p129<=1)
states: 65,711,622,523 (10)
..-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m34.458sec

checking: AG [[EF [EG [~ [A [[[[p70<=1 & 1<=p70] & [p192<=1 & 1<=p192]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p516<=1 & 1<=p516]]]] U [p440<=1 & 1<=p440]]]]] | [AF [[p369<=1 & 1<=p369]] | [p194<=0 & 0<=p194]]]]
normalized: ~ [E [true U ~ [[E [true U EG [~ [[~ [EG [~ [[p440<=1 & 1<=p440]]]] & ~ [E [~ [[p440<=1 & 1<=p440]] U [~ [[[[[p516<=1 & 1<=p516] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p192<=1 & 1<=p192] & [p70<=1 & 1<=p70]]]] & ~ [[p440<=1 & 1<=p440]]]]]]]]] | [[p194<=0 & 0<=p194] | ~ [EG [~ [[p369<=1 & 1<=p369]]]]]]]]]

abstracting: (1<=p369)
states: 336,071,400 (8)
abstracting: (p369<=1)
states: 65,711,622,523 (10)
...
before gc: list nodes free: 179878

after gc: idd nodes used:204903, unused:63795097; list nodes free:292662011
.........................................................
EG iterations: 60
abstracting: (0<=p194)
states: 65,711,622,523 (10)
abstracting: (p194<=0)
states: 64,834,826,239 (10)
abstracting: (1<=p440)
states: 312,807,208 (8)
abstracting: (p440<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p70)
states: 886,280,248 (8)
abstracting: (p70<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p192)
states: 876,796,284 (8)
abstracting: (p192<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p306)
states: 864,604,188 (8)
abstracting: (p306<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p395)
states: 878,810,184 (8)
abstracting: (p395<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p440)
states: 312,807,208 (8)
abstracting: (p440<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p440)
states: 312,807,208 (8)
abstracting: (p440<=1)
states: 65,711,622,523 (10)
..................
before gc: list nodes free: 40217

after gc: idd nodes used:450364, unused:63549636; list nodes free:299928965
..........................
before gc: list nodes free: 335021

after gc: idd nodes used:557994, unused:63442006; list nodes free:303666232
.MC time: 5m22.069sec

checking: E [[1<=p346 & p346<=1] U AF [~ [[~ [[[[[[1<=p545 & p545<=1] & [1<=p433 & p433<=1]] & [1<=p324 & p324<=1]] & [[p209<=1 & 1<=p209] & [1<=p98 & p98<=1]]] | [[[p181<=1 & 1<=p181] & [1<=p81 & p81<=1]] & [[1<=p295 & p295<=1] & [[p516<=1 & 1<=p516] & [1<=p406 & p406<=1]]]]]] | EG [[p234<=1 & 1<=p234]]]]]]
normalized: E [[1<=p346 & p346<=1] U ~ [EG [[EG [[p234<=1 & 1<=p234]] | ~ [[[[[[1<=p406 & p406<=1] & [p516<=1 & 1<=p516]] & [1<=p295 & p295<=1]] & [[1<=p81 & p81<=1] & [p181<=1 & 1<=p181]]] | [[[1<=p98 & p98<=1] & [p209<=1 & 1<=p209]] & [[1<=p324 & p324<=1] & [[1<=p433 & p433<=1] & [1<=p545 & p545<=1]]]]]]]]]]

abstracting: (p545<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p545)
states: 879,076,744 (8)
abstracting: (p433<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p433)
states: 878,810,184 (8)
abstracting: (p324<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p324)
states: 864,604,188 (8)
abstracting: (1<=p209)
states: 876,796,284 (8)
abstracting: (p209<=1)
states: 65,711,622,523 (10)
abstracting: (p98<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p98)
states: 886,280,248 (8)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (p81<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p81)
states: 886,280,248 (8)
abstracting: (p295<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p295)
states: 864,604,188 (8)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
abstracting: (p406<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p406)
states: 878,810,184 (8)
abstracting: (1<=p234)
states: 340,872,420 (8)
abstracting: (p234<=1)
states: 65,711,622,523 (10)
..................................................................
EG iterations: 66
...................................................
EG iterations: 51
abstracting: (p346<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p346)
states: 336,071,400 (8)
-> the formula is FALSE

FORMULA StigmergyElection-PT-05b-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.118sec

checking: A [[EF [[p521<=1 & 1<=p521]] | [AG [[A [[[[p70<=1 & 1<=p70] & [p181<=1 & 1<=p181]] & [[p284<=1 & 1<=p284] & [[p417<=1 & 1<=p417] & [p528<=1 & 1<=p528]]]] U [p46<=1 & 1<=p46]] | AX [[p116<=1 & 1<=p116]]]] & [p520<=1 & 1<=p520]]] U [[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]] & [[p244<=1 & 1<=p244] & [[p381<=1 & 1<=p381] & [p467<=1 & 1<=p467]]]]]
normalized: [~ [EG [~ [[[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]] & [[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p244<=1 & 1<=p244]]]]]] & ~ [E [~ [[[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]] & [[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p244<=1 & 1<=p244]]]] U [~ [[[[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]] & [[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p244<=1 & 1<=p244]]]] & ~ [[E [true U [p521<=1 & 1<=p521]] | [[p520<=1 & 1<=p520] & ~ [E [true U ~ [[~ [EX [~ [[p116<=1 & 1<=p116]]]] | [~ [EG [~ [[p46<=1 & 1<=p46]]]] & ~ [E [~ [[p46<=1 & 1<=p46]] U [~ [[[[[p528<=1 & 1<=p528] & [p417<=1 & 1<=p417]] & [p284<=1 & 1<=p284]] & [[p181<=1 & 1<=p181] & [p70<=1 & 1<=p70]]]] & ~ [[p46<=1 & 1<=p46]]]]]]]]]]]]]]]]]

abstracting: (1<=p46)
states: 886,280,248 (8)
abstracting: (p46<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p70)
states: 886,280,248 (8)
abstracting: (p70<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p284)
states: 864,604,188 (8)
abstracting: (p284<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p417)
states: 878,810,184 (8)
abstracting: (p417<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p528)
states: 879,076,744 (8)
abstracting: (p528<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p46)
states: 886,280,248 (8)
abstracting: (p46<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p46)
states: 886,280,248 (8)
abstracting: (p46<=1)
states: 65,711,622,523 (10)
......
before gc: list nodes free: 10575637

after gc: idd nodes used:457467, unused:63542533; list nodes free:304053935
..........................
before gc: list nodes free: 9395458

after gc: idd nodes used:603879, unused:63396121; list nodes free:303406195
...MC time: 5m13.015sec

checking: AF [[[0<=p135 & p135<=0] & A [[~ [[[[1<=p98 & p98<=1] | [[[[1<=p491 & p491<=1] & [1<=p370 & p370<=1]] & [1<=p255 & p255<=1]] & [[1<=p144 & p144<=1] & [1<=p23 & p23<=1]]]] | [1<=p153 & p153<=1]]] | [[[[1<=p545 & p545<=1] & [1<=p433 & p433<=1]] & [1<=p323 & p323<=1]] & [[1<=p97 & p97<=1] & [p210<=1 & 1<=p210]]]] U [[[[1<=p516 & p516<=1] & [1<=p395 & p395<=1]] & [1<=p295 & p295<=1]] & [[p170<=1 & 1<=p170] & [p81<=1 & 1<=p81]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [[[[p81<=1 & 1<=p81] & [p170<=1 & 1<=p170]] & [[1<=p295 & p295<=1] & [[1<=p395 & p395<=1] & [1<=p516 & p516<=1]]]]]]] & ~ [E [~ [[[[p81<=1 & 1<=p81] & [p170<=1 & 1<=p170]] & [[1<=p295 & p295<=1] & [[1<=p395 & p395<=1] & [1<=p516 & p516<=1]]]]] U [~ [[[[[p210<=1 & 1<=p210] & [1<=p97 & p97<=1]] & [[1<=p323 & p323<=1] & [[1<=p433 & p433<=1] & [1<=p545 & p545<=1]]]] | ~ [[[1<=p153 & p153<=1] | [[[[1<=p23 & p23<=1] & [1<=p144 & p144<=1]] & [[1<=p255 & p255<=1] & [[1<=p370 & p370<=1] & [1<=p491 & p491<=1]]]] | [1<=p98 & p98<=1]]]]]] & ~ [[[[p81<=1 & 1<=p81] & [p170<=1 & 1<=p170]] & [[1<=p295 & p295<=1] & [[1<=p395 & p395<=1] & [1<=p516 & p516<=1]]]]]]]]] & [0<=p135 & p135<=0]]]]]

abstracting: (p135<=0)
states: 64,834,826,239 (10)
abstracting: (0<=p135)
states: 65,711,622,523 (10)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p395<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p395)
states: 878,810,184 (8)
abstracting: (p295<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p295)
states: 864,604,188 (8)
abstracting: (1<=p170)
states: 876,796,284 (8)
abstracting: (p170<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p81)
states: 886,280,248 (8)
abstracting: (p81<=1)
states: 65,711,622,523 (10)
abstracting: (p98<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p98)
states: 886,280,248 (8)
abstracting: (p491<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p491)
states: 879,076,744 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p144<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p144)
states: 876,796,284 (8)
abstracting: (p23<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p23)
states: 886,280,248 (8)
abstracting: (p153<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p153)
states: 876,796,284 (8)
abstracting: (p545<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p545)
states: 879,076,744 (8)
abstracting: (p433<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p433)
states: 878,810,184 (8)
abstracting: (p323<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p323)
states: 864,604,188 (8)
abstracting: (p97<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p97)
states: 886,280,248 (8)
abstracting: (1<=p210)
states: 876,796,284 (8)
abstracting: (p210<=1)
states: 65,711,622,523 (10)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p395<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p395)
states: 878,810,184 (8)
abstracting: (p295<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p295)
states: 864,604,188 (8)
abstracting: (1<=p170)
states: 876,796,284 (8)
abstracting: (p170<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p81)
states: 886,280,248 (8)
abstracting: (p81<=1)
states: 65,711,622,523 (10)
MC time: 4m39.000sec

checking: EF [[A [[[[~ [[p328<=1 & 1<=p328]] | [[[[p81<=1 & 1<=p81] & [p170<=1 & 1<=p170]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p516<=1 & 1<=p516]]]] & [[[p70<=1 & 1<=p70] & [p181<=1 & 1<=p181]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p516<=1 & 1<=p516]]]]]] & ~ [[[p487<=1 & 1<=p487] & [p158<=1 & 1<=p158]]]] | AG [AX [[p99<=1 & 1<=p99]]]] U AF [AX [[[[p81<=1 & 1<=p81] & [p181<=1 & 1<=p181]] & [[p295<=1 & 1<=p295] & [[p406<=1 & 1<=p406] & [p516<=1 & 1<=p516]]]]]]] & EF [[[p100<=0 & 0<=p100] & [p98<=0 & 0<=p98]]]]]
normalized: E [true U [E [true U [[p98<=0 & 0<=p98] & [p100<=0 & 0<=p100]]] & [~ [EG [EG [EX [~ [[[[[p516<=1 & 1<=p516] & [p406<=1 & 1<=p406]] & [p295<=1 & 1<=p295]] & [[p181<=1 & 1<=p181] & [p81<=1 & 1<=p81]]]]]]]] & ~ [E [EG [EX [~ [[[[[p516<=1 & 1<=p516] & [p406<=1 & 1<=p406]] & [p295<=1 & 1<=p295]] & [[p181<=1 & 1<=p181] & [p81<=1 & 1<=p81]]]]]] U [~ [[~ [E [true U EX [~ [[p99<=1 & 1<=p99]]]]] | [~ [[[p158<=1 & 1<=p158] & [p487<=1 & 1<=p487]]] & [[[[[[p516<=1 & 1<=p516] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p181<=1 & 1<=p181] & [p70<=1 & 1<=p70]]] & [[[[p516<=1 & 1<=p516] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p170<=1 & 1<=p170] & [p81<=1 & 1<=p81]]]] | ~ [[p328<=1 & 1<=p328]]]]]] & EG [EX [~ [[[[[p516<=1 & 1<=p516] & [p406<=1 & 1<=p406]] & [p295<=1 & 1<=p295]] & [[p181<=1 & 1<=p181] & [p81<=1 & 1<=p81]]]]]]]]]]]]

abstracting: (1<=p81)
states: 886,280,248 (8)
abstracting: (p81<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p295)
states: 864,604,188 (8)
abstracting: (p295<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p406)
states: 878,810,184 (8)
abstracting: (p406<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p516<=1)
states: 65,711,622,523 (10)

before gc: list nodes free: 13645075

after gc: idd nodes used:393766, unused:63606234; list nodes free:304319409
...............
before gc: list nodes free: 10563623

after gc: idd nodes used:980840, unused:63019160; list nodes free:301750963
MC time: 4m 8.003sec

checking: [EF [EG [[[~ [A [[p303<=1 & 1<=p303] U [[[p34<=1 & 1<=p34] & [p133<=1 & 1<=p133]] & [[p255<=1 & 1<=p255] & [[p370<=1 & 1<=p370] & [p467<=1 & 1<=p467]]]]]] & [[p562<=1 & 1<=p562] & [p59<=1 & 1<=p59]]] & [[[p181<=1 & 1<=p181] & [p306<=1 & 1<=p306]] & [[p406<=1 & 1<=p406] & [p505<=1 & 1<=p505]]]]]] & ~ [E [[EF [[p307<=1 & 1<=p307]] | [[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]] & [[p266<=1 & 1<=p266] & [[p370<=1 & 1<=p370] & [p467<=1 & 1<=p467]]]]] U ~ [EG [AF [[[[p59<=1 & 1<=p59] & [p170<=1 & 1<=p170]] & [[p295<=1 & 1<=p295] & [[p417<=1 & 1<=p417] & [p516<=1 & 1<=p516]]]]]]]]]]
normalized: [~ [E [[[[[[p467<=1 & 1<=p467] & [p370<=1 & 1<=p370]] & [p266<=1 & 1<=p266]] & [[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]]] | E [true U [p307<=1 & 1<=p307]]] U ~ [EG [~ [EG [~ [[[[[p516<=1 & 1<=p516] & [p417<=1 & 1<=p417]] & [p295<=1 & 1<=p295]] & [[p170<=1 & 1<=p170] & [p59<=1 & 1<=p59]]]]]]]]]] & E [true U EG [[[[[p505<=1 & 1<=p505] & [p406<=1 & 1<=p406]] & [[p306<=1 & 1<=p306] & [p181<=1 & 1<=p181]]] & [[[p59<=1 & 1<=p59] & [p562<=1 & 1<=p562]] & ~ [[~ [EG [~ [[[[[p467<=1 & 1<=p467] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p34<=1 & 1<=p34]]]]]] & ~ [E [~ [[[[[p467<=1 & 1<=p467] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p34<=1 & 1<=p34]]]] U [~ [[p303<=1 & 1<=p303]] & ~ [[[[[p467<=1 & 1<=p467] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p34<=1 & 1<=p34]]]]]]]]]]]]]]

abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p303)
states: 864,604,188 (8)
abstracting: (p303<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
...........................................................
EG iterations: 59
abstracting: (1<=p562)
states: 4,693,687,323 (9)
abstracting: (p562<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p59)
states: 886,280,248 (8)
abstracting: (p59<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p306)
states: 864,604,188 (8)
abstracting: (p306<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p406)
states: 878,810,184 (8)
abstracting: (p406<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p505)
states: 879,076,744 (8)
abstracting: (p505<=1)
states: 65,711,622,523 (10)
..
EG iterations: 2
abstracting: (1<=p59)
states: 886,280,248 (8)
abstracting: (p59<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p170)
states: 876,796,284 (8)
abstracting: (p170<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p295)
states: 864,604,188 (8)
abstracting: (p295<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p417)
states: 878,810,184 (8)
abstracting: (p417<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
...................................................
EG iterations: 51
....................................................
EG iterations: 52
abstracting: (1<=p307)
states: 864,604,188 (8)
abstracting: (p307<=1)
states: 65,711,622,523 (10)
MC time: 3m39.999sec

checking: [AX [[AF [[p72<=0 & 0<=p72]] & [AF [E [[[[p70<=1 & 1<=p70] & [p192<=1 & 1<=p192]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p505<=1 & 1<=p505]]]] U [p455<=1 & 1<=p455]]] & EF [[p324<=0 & 0<=p324]]]]] & AF [[[[[AG [[[p283<=0 & 0<=p283] | [p567<=0 & 0<=p567]]] | [EG [[[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]] & [[p266<=1 & 1<=p266] & [[p370<=1 & 1<=p370] & [p491<=1 & 1<=p491]]]]] & AX [[p489<=1 & 1<=p489]]]] | [[p59<=0 & 0<=p59] | [p170<=0 & 0<=p170]]] | [[[p295<=0 & 0<=p295] | [p417<=0 & 0<=p417]] | [[p505<=0 & 0<=p505] | [[p21<=1 & 1<=p21] & [p114<=1 & 1<=p114]]]]] & [AF [[[p419<=0 & 0<=p419] & AG [[[[p59<=1 & 1<=p59] & [p192<=1 & 1<=p192]] & [[p295<=1 & 1<=p295] & [[p406<=1 & 1<=p406] & [p528<=1 & 1<=p528]]]]]]] & EG [[p300<=1 & 1<=p300]]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [[~ [E [true U ~ [[[[[p528<=1 & 1<=p528] & [p406<=1 & 1<=p406]] & [p295<=1 & 1<=p295]] & [[p192<=1 & 1<=p192] & [p59<=1 & 1<=p59]]]]]] & [p419<=0 & 0<=p419]]]]] & EG [[p300<=1 & 1<=p300]]] & [[[[[p114<=1 & 1<=p114] & [p21<=1 & 1<=p21]] | [p505<=0 & 0<=p505]] | [[p417<=0 & 0<=p417] | [p295<=0 & 0<=p295]]] | [[[p170<=0 & 0<=p170] | [p59<=0 & 0<=p59]] | [[~ [EX [~ [[p489<=1 & 1<=p489]]]] & EG [[[[[p491<=1 & 1<=p491] & [p370<=1 & 1<=p370]] & [p266<=1 & 1<=p266]] & [[p144<=1 & 1<=p144] & [p34<=1 & 1<=p34]]]]] | ~ [E [true U ~ [[[p567<=0 & 0<=p567] | [p283<=0 & 0<=p283]]]]]]]]]]]] & ~ [EX [~ [[[E [true U [p324<=0 & 0<=p324]] & ~ [EG [~ [E [[[[[p505<=1 & 1<=p505] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p192<=1 & 1<=p192] & [p70<=1 & 1<=p70]]] U [p455<=1 & 1<=p455]]]]]] & ~ [EG [~ [[p72<=0 & 0<=p72]]]]]]]]]

abstracting: (0<=p72)
states: 65,711,622,523 (10)
abstracting: (p72<=0)
states: 64,825,342,275 (10)
.........
before gc: list nodes free: 11376866

after gc: idd nodes used:574817, unused:63425183; list nodes free:303536645
.........................MC time: 3m16.001sec

checking: [A [[[[A [[[[p255<=1 & 1<=p255] & [[p370<=1 & 1<=p370] & [p491<=1 & 1<=p491]]] & [[p45<=1 & 1<=p45] & [p144<=1 & 1<=p144]]] U E [[p314<=1 & 1<=p314] U [p278<=1 & 1<=p278]]] & AX [AF [[[[p34<=1 & 1<=p34] & [p155<=1 & 1<=p155]] & [[p244<=1 & 1<=p244] & [[p358<=1 & 1<=p358] & [p478<=1 & 1<=p478]]]]]]] & [[p59<=1 & 1<=p59] & [p192<=1 & 1<=p192]]] & [[[p284<=1 & 1<=p284] & [p406<=1 & 1<=p406]] & [[p528<=1 & 1<=p528] & ~ [[p29<=1 & 1<=p29]]]]] U A [EF [[[[p34<=1 & 1<=p34] & [p155<=1 & 1<=p155]] & [[p244<=1 & 1<=p244] & [[p358<=1 & 1<=p358] & [p478<=1 & 1<=p478]]]]] U EF [[[[p34<=1 & 1<=p34] & [[p155<=1 & 1<=p155] & [p255<=1 & 1<=p255]]] & [[p358<=1 & 1<=p358] & [[p491<=1 & 1<=p491] & ~ [[p465<=1 & 1<=p465]]]]]]]] | EF [[[[p45<=1 & 1<=p45] & [p133<=1 & 1<=p133]] & [[p255<=1 & 1<=p255] & [[p370<=1 & 1<=p370] & [p478<=1 & 1<=p478]]]]]]
normalized: [E [true U [[[[p478<=1 & 1<=p478] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p45<=1 & 1<=p45]]]] | [~ [EG [~ [[~ [EG [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]] & ~ [E [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]] U [~ [E [true U [[[[p478<=1 & 1<=p478] & [p358<=1 & 1<=p358]] & [p244<=1 & 1<=p244]] & [[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]]]]] & ~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]] & ~ [E [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]] U [~ [E [true U [[[[p478<=1 & 1<=p478] & [p358<=1 & 1<=p358]] & [p244<=1 & 1<=p244]] & [[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]]]]] & ~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]]]]] U [~ [[[[~ [[p29<=1 & 1<=p29]] & [p528<=1 & 1<=p528]] & [[p406<=1 & 1<=p406] & [p284<=1 & 1<=p284]]] & [[[p192<=1 & 1<=p192] & [p59<=1 & 1<=p59]] & [~ [EX [EG [~ [[[[[p478<=1 & 1<=p478] & [p358<=1 & 1<=p358]] & [p244<=1 & 1<=p244]] & [[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]]]]]]] & [~ [EG [~ [E [[p314<=1 & 1<=p314] U [p278<=1 & 1<=p278]]]]] & ~ [E [~ [E [[p314<=1 & 1<=p314] U [p278<=1 & 1<=p278]]] U [~ [[[[p144<=1 & 1<=p144] & [p45<=1 & 1<=p45]] & [[[p491<=1 & 1<=p491] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]]]] & ~ [E [[p314<=1 & 1<=p314] U [p278<=1 & 1<=p278]]]]]]]]]]] & ~ [[~ [EG [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]] & ~ [E [~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]] U [~ [E [true U [[[[p478<=1 & 1<=p478] & [p358<=1 & 1<=p358]] & [p244<=1 & 1<=p244]] & [[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]]]]] & ~ [E [true U [[[~ [[p465<=1 & 1<=p465]] & [p491<=1 & 1<=p491]] & [p358<=1 & 1<=p358]] & [[[p255<=1 & 1<=p255] & [p155<=1 & 1<=p155]] & [p34<=1 & 1<=p34]]]]]]]]]]]]]]]

abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p358)
states: 878,810,184 (8)
abstracting: (p358<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p491)
states: 879,076,744 (8)
abstracting: (p491<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p465)
states: 336,071,400 (8)
abstracting: (p465<=1)
states: 65,711,622,523 (10)
MC time: 2m54.006sec

checking: [A [[[[[EF [[p211<=1 & 1<=p211]] & EX [[[[p34<=1 & 1<=p34] & [p155<=1 & 1<=p155]] & [[p266<=1 & 1<=p266] & [[p381<=1 & 1<=p381] & [p491<=1 & 1<=p491]]]]]] & EG [[[[p45<=1 & 1<=p45] & [p133<=1 & 1<=p133]] & [[p244<=1 & 1<=p244] & [[p370<=1 & 1<=p370] & [p478<=1 & 1<=p478]]]]]] | EX [~ [E [[p569<=1 & 1<=p569] U [p66<=1 & 1<=p66]]]]] | [~ [[[[p96<=1 & 1<=p96] & [p391<=1 & 1<=p391]] | [[[p70<=1 & 1<=p70] & [p170<=1 & 1<=p170]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p505<=1 & 1<=p505]]]]]] | [[[[p23<=1 & 1<=p23] & [p133<=1 & 1<=p133]] & [[p255<=1 & 1<=p255] & [[p358<=1 & 1<=p358] & [p467<=1 & 1<=p467]]]] | [[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]] & [[p255<=1 & 1<=p255] & [[p381<=1 & 1<=p381] & [p478<=1 & 1<=p478]]]]]]] U [[AX [1<=0] & [[p34<=1 & 1<=p34] & [p155<=1 & 1<=p155]]] & [[p255<=1 & 1<=p255] & [[p381<=1 & 1<=p381] & [p467<=1 & 1<=p467]]]]] | E [[[[p45<=1 & 1<=p45] & [p133<=1 & 1<=p133]] & [[p255<=1 & 1<=p255] & [[p358<=1 & 1<=p358] & [p467<=1 & 1<=p467]]]] U AG [[p102<=1 & 1<=p102]]]]
normalized: [[~ [EG [~ [[[[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p255<=1 & 1<=p255]] & [[[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]] & ~ [EX [~ [1<=0]]]]]]]] & ~ [E [~ [[[[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p255<=1 & 1<=p255]] & [[[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]] & ~ [EX [~ [1<=0]]]]]] U [~ [[[[[[[p34<=1 & 1<=p34] & [p144<=1 & 1<=p144]] & [[[p478<=1 & 1<=p478] & [p381<=1 & 1<=p381]] & [p255<=1 & 1<=p255]]] | [[[[p467<=1 & 1<=p467] & [p358<=1 & 1<=p358]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p23<=1 & 1<=p23]]]] | ~ [[[[[[p505<=1 & 1<=p505] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p170<=1 & 1<=p170] & [p70<=1 & 1<=p70]]] | [[p391<=1 & 1<=p391] & [p96<=1 & 1<=p96]]]]] | [EX [~ [E [[p569<=1 & 1<=p569] U [p66<=1 & 1<=p66]]]] | [EG [[[[[p478<=1 & 1<=p478] & [p370<=1 & 1<=p370]] & [p244<=1 & 1<=p244]] & [[p133<=1 & 1<=p133] & [p45<=1 & 1<=p45]]]] & [EX [[[[[p491<=1 & 1<=p491] & [p381<=1 & 1<=p381]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]]]] & E [true U [p211<=1 & 1<=p211]]]]]]] & ~ [[[[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p255<=1 & 1<=p255]] & [[[p155<=1 & 1<=p155] & [p34<=1 & 1<=p34]] & ~ [EX [~ [1<=0]]]]]]]]]] | E [[[[[p467<=1 & 1<=p467] & [p358<=1 & 1<=p358]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p45<=1 & 1<=p45]]] U ~ [E [true U ~ [[p102<=1 & 1<=p102]]]]]]

abstracting: (1<=p102)
states: 312,740,568 (8)
abstracting: (p102<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p358)
states: 878,810,184 (8)
abstracting: (p358<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
abstracting: (1<=0)
states: 0

before gc: list nodes free: 16370336

after gc: idd nodes used:532617, unused:63467383; list nodes free:303655033
.abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p211)
states: 312,740,568 (8)
abstracting: (p211<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p34)
states: 886,280,248 (8)
abstracting: (p34<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p266)
states: 864,604,188 (8)
abstracting: (p266<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p491)
states: 879,076,744 (8)
abstracting: (p491<=1)
states: 65,711,622,523 (10)
.abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p244)
states: 864,604,188 (8)
abstracting: (p244<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p478)
states: 879,076,744 (8)
abstracting: (p478<=1)
states: 65,711,622,523 (10)
..........
EG iterations: 10
abstracting: (1<=p66)
states: 886,280,248 (8)
abstracting: (p66<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p569)
states: 4,693,687,323 (9)
abstracting: (p569<=1)
states: 65,711,622,523 (10)
MC time: 2m34.000sec

checking: E [E [~ [[AX [1<=0] | AF [~ [[p20<=1 & 1<=p20]]]]] U EG [[A [[p484<=1 & 1<=p484] U [[[p45<=1 & 1<=p45] & [p155<=1 & 1<=p155]] & [[p266<=1 & 1<=p266] & [[p358<=1 & 1<=p358] & [p491<=1 & 1<=p491]]]]] | [EG [[p318<=1 & 1<=p318]] & [p324<=1 & 1<=p324]]]]] U [AF [[[[[p59<=1 & 1<=p59] & [p181<=1 & 1<=p181]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p505<=1 & 1<=p505]]]] | [[[p269<=1 & 1<=p269] & [[p45<=1 & 1<=p45] & [p133<=1 & 1<=p133]]] & [[p255<=1 & 1<=p255] & [[p381<=1 & 1<=p381] & [p467<=1 & 1<=p467]]]]]] & [[EX [[[p197<=1 & 1<=p197] | A [[p199<=1 & 1<=p199] U [p431<=1 & 1<=p431]]]] | ~ [[A [[[[p81<=1 & 1<=p81] & [p181<=1 & 1<=p181]] & [[p284<=1 & 1<=p284] & [[p406<=1 & 1<=p406] & [p505<=1 & 1<=p505]]]] U [[[p45<=1 & 1<=p45] & [p155<=1 & 1<=p155]] & [[p266<=1 & 1<=p266] & [[p381<=1 & 1<=p381] & [p478<=1 & 1<=p478]]]]] | EX [[p123<=1 & 1<=p123]]]]] & [~ [[[[p465<=1 & 1<=p465] | [[p73<=1 & 1<=p73] | [p474<=1 & 1<=p474]]] & E [[p479<=1 & 1<=p479] U [p114<=1 & 1<=p114]]]] | [[p435<=1 & 1<=p435] & [~ [A [[p199<=1 & 1<=p199] U [p184<=1 & 1<=p184]]] | EF [[[[p45<=1 & 1<=p45] & [p133<=1 & 1<=p133]] & [[p255<=1 & 1<=p255] & [[p370<=1 & 1<=p370] & [p491<=1 & 1<=p491]]]]]]]]]]]
normalized: E [E [~ [[~ [EG [[p20<=1 & 1<=p20]]] | ~ [EX [~ [1<=0]]]]] U EG [[[[p324<=1 & 1<=p324] & EG [[p318<=1 & 1<=p318]]] | [~ [EG [~ [[[[[p491<=1 & 1<=p491] & [p358<=1 & 1<=p358]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]]]] & ~ [E [~ [[[[[p491<=1 & 1<=p491] & [p358<=1 & 1<=p358]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]] U [~ [[p484<=1 & 1<=p484]] & ~ [[[[[p491<=1 & 1<=p491] & [p358<=1 & 1<=p358]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]]]]]]]]] U [[[[[~ [[~ [E [~ [[p184<=1 & 1<=p184]] U [~ [[p199<=1 & 1<=p199]] & ~ [[p184<=1 & 1<=p184]]]]] & ~ [EG [~ [[p184<=1 & 1<=p184]]]]]] | E [true U [[[[p491<=1 & 1<=p491] & [p370<=1 & 1<=p370]] & [p255<=1 & 1<=p255]] & [[p133<=1 & 1<=p133] & [p45<=1 & 1<=p45]]]]] & [p435<=1 & 1<=p435]] | ~ [[E [[p479<=1 & 1<=p479] U [p114<=1 & 1<=p114]] & [[[p474<=1 & 1<=p474] | [p73<=1 & 1<=p73]] | [p465<=1 & 1<=p465]]]]] & [~ [[EX [[p123<=1 & 1<=p123]] | [~ [EG [~ [[[[[p478<=1 & 1<=p478] & [p381<=1 & 1<=p381]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]]]] & ~ [E [~ [[[[[p478<=1 & 1<=p478] & [p381<=1 & 1<=p381]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]] U [~ [[[[[p505<=1 & 1<=p505] & [p406<=1 & 1<=p406]] & [p284<=1 & 1<=p284]] & [[p181<=1 & 1<=p181] & [p81<=1 & 1<=p81]]]] & ~ [[[[[p478<=1 & 1<=p478] & [p381<=1 & 1<=p381]] & [p266<=1 & 1<=p266]] & [[p155<=1 & 1<=p155] & [p45<=1 & 1<=p45]]]]]]]]]] | EX [[[~ [EG [~ [[p431<=1 & 1<=p431]]]] & ~ [E [~ [[p431<=1 & 1<=p431]] U [~ [[p199<=1 & 1<=p199]] & ~ [[p431<=1 & 1<=p431]]]]]] | [p197<=1 & 1<=p197]]]]] & ~ [EG [~ [[[[[[p467<=1 & 1<=p467] & [p381<=1 & 1<=p381]] & [p255<=1 & 1<=p255]] & [[[p133<=1 & 1<=p133] & [p45<=1 & 1<=p45]] & [p269<=1 & 1<=p269]]] | [[[[p505<=1 & 1<=p505] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p181<=1 & 1<=p181] & [p59<=1 & 1<=p59]]]]]]]]]

abstracting: (1<=p59)
states: 886,280,248 (8)
abstracting: (p59<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p306)
states: 864,604,188 (8)
abstracting: (p306<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p395)
states: 878,810,184 (8)
abstracting: (p395<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p505)
states: 879,076,744 (8)
abstracting: (p505<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p269)
states: 273,757,176 (8)
abstracting: (p269<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p467)
states: 879,076,744 (8)
abstracting: (p467<=1)
states: 65,711,622,523 (10)
...................................................
EG iterations: 51
abstracting: (1<=p197)
states: 317,339,694 (8)
abstracting: (p197<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p431)
states: 317,339,694 (8)
abstracting: (p431<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p199)
states: 317,339,694 (8)
abstracting: (p199<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p431)
states: 317,339,694 (8)
abstracting: (p431<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p431)
states: 317,339,694 (8)
abstracting: (p431<=1)
states: 65,711,622,523 (10)
.
EG iterations: 1
.abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p266)
states: 864,604,188 (8)
abstracting: (p266<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p478)
states: 879,076,744 (8)
abstracting: (p478<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p81)
states: 886,280,248 (8)
abstracting: (p81<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p181)
states: 876,796,284 (8)
abstracting: (p181<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p284)
states: 864,604,188 (8)
abstracting: (p284<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p406)
states: 878,810,184 (8)
abstracting: (p406<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p505)
states: 879,076,744 (8)
abstracting: (p505<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p266)
states: 864,604,188 (8)
abstracting: (p266<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p478)
states: 879,076,744 (8)
abstracting: (p478<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p155)
states: 876,796,284 (8)
abstracting: (p155<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p266)
states: 864,604,188 (8)
abstracting: (p266<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p381)
states: 878,810,184 (8)
abstracting: (p381<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p478)
states: 879,076,744 (8)
abstracting: (p478<=1)
states: 65,711,622,523 (10)
...........................
EG iterations: 27
abstracting: (1<=p123)
states: 340,872,420 (8)
abstracting: (p123<=1)
states: 65,711,622,523 (10)
.abstracting: (1<=p465)
states: 336,071,400 (8)
abstracting: (p465<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p73)
states: 886,280,248 (8)
abstracting: (p73<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p474)
states: 879,076,744 (8)
abstracting: (p474<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p114)
states: 312,740,568 (8)
abstracting: (p114<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p479)
states: 879,076,744 (8)
abstracting: (p479<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p435)
states: 312,807,208 (8)
abstracting: (p435<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p45)
states: 886,280,248 (8)
abstracting: (p45<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p133)
states: 876,796,284 (8)
abstracting: (p133<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p255)
states: 864,604,188 (8)
abstracting: (p255<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p370)
states: 878,810,184 (8)
abstracting: (p370<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p491)
states: 879,076,744 (8)
abstracting: (p491<=1)
states: 65,711,622,523 (10)
MC time: 2m17.004sec

checking: AG [[EF [EG [~ [A [[[[p70<=1 & 1<=p70] & [p192<=1 & 1<=p192]] & [[p306<=1 & 1<=p306] & [[p395<=1 & 1<=p395] & [p516<=1 & 1<=p516]]]] U [p440<=1 & 1<=p440]]]]] | [AF [[p369<=1 & 1<=p369]] | [p194<=0 & 0<=p194]]]]
normalized: ~ [E [true U ~ [[E [true U EG [~ [[~ [EG [~ [[p440<=1 & 1<=p440]]]] & ~ [E [~ [[p440<=1 & 1<=p440]] U [~ [[[[[p516<=1 & 1<=p516] & [p395<=1 & 1<=p395]] & [p306<=1 & 1<=p306]] & [[p192<=1 & 1<=p192] & [p70<=1 & 1<=p70]]]] & ~ [[p440<=1 & 1<=p440]]]]]]]]] | [[p194<=0 & 0<=p194] | ~ [EG [~ [[p369<=1 & 1<=p369]]]]]]]]]

abstracting: (1<=p369)
states: 336,071,400 (8)
abstracting: (p369<=1)
states: 65,711,622,523 (10)
........................
before gc: list nodes free: 11247995

after gc: idd nodes used:681763, unused:63318237; list nodes free:303007736
....................................
EG iterations: 60
abstracting: (0<=p194)
states: 65,711,622,523 (10)
abstracting: (p194<=0)
states: 64,834,826,239 (10)
abstracting: (1<=p440)
states: 312,807,208 (8)
abstracting: (p440<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p70)
states: 886,280,248 (8)
abstracting: (p70<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p192)
states: 876,796,284 (8)
abstracting: (p192<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p306)
states: 864,604,188 (8)
abstracting: (p306<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p395)
states: 878,810,184 (8)
abstracting: (p395<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p516)
states: 879,076,744 (8)
abstracting: (p516<=1)
states: 65,711,622,523 (10)
abstracting: (1<=p440)
states: 312,807,208 (8)
abstracting: (p440<=1)
states: 65,711,622,523 (10)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5846548 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097884 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.017sec

36718 51409 54552 61272 65298 66213 69910 68077 74253 68220 68196
iterations count:1161055 (1018), effective:29662 (26)

initing FirstDep: 0m 0.022sec


iterations count:4814 (4), effective:44 (0)

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

iterations count:2978 (2), effective:26 (0)

iterations count:1497 (1), effective:20 (0)
54509 59859 56927 69239 70690 71237 71027 69172 67582
iterations count:992983 (871), effective:19069 (16)

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

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

net_ddint.h:600: Timeout: after 321 sec


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

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

net_ddint.h:600: Timeout: after 312 sec

106952 102499 102535 111347 116179 123523 122083 126941 123007 122342
sat_reach.icc:155: Timeout: after 278 sec


net_ddint.h:600: Timeout: after 247 sec


iterations count:1142 (1), effective:1 (0)
78782 78929 76754 85220
sat_reach.icc:155: Timeout: after 219 sec


net_ddint.h:600: Timeout: after 195 sec

115814 121623 119849 124136 128003 132360 130846
sat_reach.icc:155: Timeout: after 173 sec


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

iterations count:1497 (1), effective:21 (0)
78789 94194
sat_reach.icc:155: Timeout: after 153 sec


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

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

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

sat_reach.icc:155: Timeout: after 136 sec


iterations count:1424 (1), effective:1 (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-05b"
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-05b, 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-167912650500610"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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