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-167912650500577.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-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500577
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 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 117K 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-03b-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679548998673

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:23:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 05:23:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:23:22] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-23 05:23:22] [INFO ] Transformed 427 places.
[2023-03-23 05:23:22] [INFO ] Transformed 518 transitions.
[2023-03-23 05:23:22] [INFO ] Found NUPN structural information;
[2023-03-23 05:23:22] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
FORMULA StigmergyElection-PT-03b-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 427 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 427/427 places, 518/518 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 382 transition count 473
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 382 transition count 473
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 105 place count 367 transition count 458
Iterating global reduction 0 with 15 rules applied. Total rules applied 120 place count 367 transition count 458
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 122 place count 365 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 124 place count 365 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 125 place count 364 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 126 place count 364 transition count 455
Applied a total of 126 rules in 191 ms. Remains 364 /427 variables (removed 63) and now considering 455/518 (removed 63) transitions.
// Phase 1: matrix 455 rows 364 cols
[2023-03-23 05:23:23] [INFO ] Computed 4 place invariants in 38 ms
[2023-03-23 05:23:23] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-23 05:23:23] [INFO ] Invariant cache hit.
[2023-03-23 05:23:24] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-23 05:23:24] [INFO ] Invariant cache hit.
[2023-03-23 05:23:24] [INFO ] Dead Transitions using invariants and state equation in 555 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 364/427 places, 455/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1869 ms. Remains : 364/427 places, 455/518 transitions.
Support contains 79 out of 364 places after structural reductions.
[2023-03-23 05:23:24] [INFO ] Flatten gal took : 97 ms
[2023-03-23 05:23:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-03b-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:23:24] [INFO ] Flatten gal took : 41 ms
[2023-03-23 05:23:25] [INFO ] Input system was already deterministic with 455 transitions.
Support contains 76 out of 364 places (down from 79) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 175 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 49) seen :30
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-23 05:23:26] [INFO ] Invariant cache hit.
[2023-03-23 05:23:26] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2023-03-23 05:23:27] [INFO ] After 260ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:18
[2023-03-23 05:23:27] [INFO ] Deduced a trap composed of 177 places in 815 ms of which 11 ms to minimize.
[2023-03-23 05:23:28] [INFO ] Deduced a trap composed of 171 places in 266 ms of which 2 ms to minimize.
[2023-03-23 05:23:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1232 ms
[2023-03-23 05:23:28] [INFO ] After 1520ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-23 05:23:28] [INFO ] After 1942ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-23 05:23:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 5 ms returned sat
[2023-03-23 05:23:29] [INFO ] After 626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-23 05:23:29] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 2 ms to minimize.
[2023-03-23 05:23:30] [INFO ] Deduced a trap composed of 172 places in 269 ms of which 3 ms to minimize.
[2023-03-23 05:23:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 562 ms
[2023-03-23 05:23:30] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 1 ms to minimize.
[2023-03-23 05:23:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-23 05:23:30] [INFO ] Deduced a trap composed of 171 places in 198 ms of which 1 ms to minimize.
[2023-03-23 05:23:30] [INFO ] Deduced a trap composed of 172 places in 153 ms of which 1 ms to minimize.
[2023-03-23 05:23:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 427 ms
[2023-03-23 05:23:31] [INFO ] Deduced a trap composed of 171 places in 165 ms of which 2 ms to minimize.
[2023-03-23 05:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2023-03-23 05:23:31] [INFO ] Deduced a trap composed of 172 places in 132 ms of which 0 ms to minimize.
[2023-03-23 05:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-03-23 05:23:31] [INFO ] Deduced a trap composed of 174 places in 130 ms of which 1 ms to minimize.
[2023-03-23 05:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-23 05:23:32] [INFO ] Deduced a trap composed of 172 places in 122 ms of which 1 ms to minimize.
[2023-03-23 05:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-23 05:23:32] [INFO ] After 3243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-03-23 05:23:32] [INFO ] After 4180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 6 properties in 218 ms.
Support contains 21 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 331 edges and 364 vertex of which 42 / 364 are part of one of the 7 SCC in 5 ms
Free SCC test removed 35 places
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 541 edges and 329 vertex of which 328 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 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 328 transition count 211
Reduce places removed 199 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 203 rules applied. Total rules applied 405 place count 129 transition count 207
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 9 rules applied. Total rules applied 414 place count 127 transition count 200
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 422 place count 120 transition count 199
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 422 place count 120 transition count 185
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 450 place count 106 transition count 185
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 454 place count 102 transition count 181
Iterating global reduction 4 with 4 rules applied. Total rules applied 458 place count 102 transition count 181
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 460 place count 100 transition count 171
Iterating global reduction 4 with 2 rules applied. Total rules applied 462 place count 100 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 463 place count 100 transition count 170
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 489 place count 87 transition count 157
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 492 place count 87 transition count 154
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 498 place count 81 transition count 122
Iterating global reduction 6 with 6 rules applied. Total rules applied 504 place count 81 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 507 place count 81 transition count 119
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 517 place count 76 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
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 527 place count 71 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 529 place count 71 transition count 118
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 531 place count 71 transition count 116
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 549 place count 71 transition count 98
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 567 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 569 place count 51 transition count 96
Iterating global reduction 9 with 2 rules applied. Total rules applied 571 place count 51 transition count 96
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 574 place count 51 transition count 93
Applied a total of 574 rules in 99 ms. Remains 51 /364 variables (removed 313) and now considering 93/455 (removed 362) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 51/364 places, 93/455 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 93 rows 51 cols
[2023-03-23 05:23:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-23 05:23:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 05:23:34] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-23 05:23:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-23 05:23:34] [INFO ] After 9ms SMT Verify possible using 35 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-23 05:23:34] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-23 05:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-23 05:23:34] [INFO ] After 65ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:23:34] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 05:23:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 05:23:34] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 05:23:34] [INFO ] After 21ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 05:23:34] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-23 05:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-23 05:23:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-23 05:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 05:23:34] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-23 05:23:34] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 2 ms.
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 27 ms
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 30 ms
[2023-03-23 05:23:34] [INFO ] Input system was already deterministic with 455 transitions.
Computed a total of 47 stabilizing places and 50 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 347 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 347 transition count 438
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 339 transition count 430
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 339 transition count 430
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 337 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 337 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 336 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 336 transition count 427
Applied a total of 56 rules in 38 ms. Remains 336 /364 variables (removed 28) and now considering 427/455 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 336/364 places, 427/455 transitions.
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 23 ms
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 24 ms
[2023-03-23 05:23:34] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 358 edges and 364 vertex of which 55 / 364 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 212 transitions
Trivial Post-agglo rules discarded 212 transitions
Performed 212 trivial Post agglomeration. Transition count delta: 212
Iterating post reduction 0 with 212 rules applied. Total rules applied 213 place count 317 transition count 191
Reduce places removed 212 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 218 rules applied. Total rules applied 431 place count 105 transition count 185
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 438 place count 102 transition count 181
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 442 place count 98 transition count 181
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 442 place count 98 transition count 170
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 464 place count 87 transition count 170
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 471 place count 80 transition count 163
Iterating global reduction 4 with 7 rules applied. Total rules applied 478 place count 80 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 478 place count 80 transition count 162
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 480 place count 79 transition count 162
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 483 place count 76 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 486 place count 76 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 488 place count 76 transition count 141
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 5 with 14 rules applied. Total rules applied 502 place count 69 transition count 134
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 508 place count 63 transition count 111
Iterating global reduction 5 with 6 rules applied. Total rules applied 514 place count 63 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 518 place count 63 transition count 107
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 519 place count 62 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 520 place count 62 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 521 place count 61 transition count 103
Iterating global reduction 6 with 1 rules applied. Total rules applied 522 place count 61 transition count 103
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 524 place count 60 transition count 102
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 525 place count 59 transition count 97
Iterating global reduction 6 with 1 rules applied. Total rules applied 526 place count 59 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 527 place count 59 transition count 96
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 530 place count 59 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 536 place count 56 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 537 place count 55 transition count 89
Applied a total of 537 rules in 57 ms. Remains 55 /364 variables (removed 309) and now considering 89/455 (removed 366) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 55/364 places, 89/455 transitions.
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:23:34] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 368 edges and 364 vertex of which 56 / 364 are part of one of the 9 SCC in 1 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 222 place count 316 transition count 180
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 227 rules applied. Total rules applied 449 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 453 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 454 place count 91 transition count 173
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 454 place count 91 transition count 162
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 476 place count 80 transition count 162
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 485 place count 71 transition count 152
Iterating global reduction 4 with 9 rules applied. Total rules applied 494 place count 71 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 494 place count 71 transition count 150
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 498 place count 69 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 502 place count 65 transition count 129
Iterating global reduction 4 with 4 rules applied. Total rules applied 506 place count 65 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 508 place count 65 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 509 place count 64 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 510 place count 64 transition count 125
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 522 place count 58 transition count 119
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 530 place count 50 transition count 93
Iterating global reduction 5 with 8 rules applied. Total rules applied 538 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 541 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 543 place count 48 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 545 place count 48 transition count 86
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 547 place count 46 transition count 82
Iterating global reduction 6 with 2 rules applied. Total rules applied 549 place count 46 transition count 82
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 551 place count 45 transition count 81
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 44 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 554 place count 44 transition count 77
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 557 place count 44 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 563 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 564 place count 40 transition count 70
Applied a total of 564 rules in 57 ms. Remains 40 /364 variables (removed 324) and now considering 70/455 (removed 385) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 40/364 places, 70/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 346 transition count 437
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 346 transition count 437
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 338 transition count 429
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 335 transition count 426
Applied a total of 58 rules in 35 ms. Remains 335 /364 variables (removed 29) and now considering 426/455 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 335/364 places, 426/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 20 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 20 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 348 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 348 transition count 439
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 341 transition count 432
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 338 transition count 429
Applied a total of 52 rules in 41 ms. Remains 338 /364 variables (removed 26) and now considering 429/455 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 338/364 places, 429/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 18 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 19 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 348 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 348 transition count 439
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 341 transition count 432
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 338 transition count 429
Applied a total of 52 rules in 37 ms. Remains 338 /364 variables (removed 26) and now considering 429/455 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 338/364 places, 429/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 17 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 348 transition count 439
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 348 transition count 439
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 341 transition count 432
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 341 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 339 transition count 430
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 339 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 338 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 338 transition count 429
Applied a total of 52 rules in 40 ms. Remains 338 /364 variables (removed 26) and now considering 429/455 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 338/364 places, 429/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 429 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 349 transition count 440
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 349 transition count 440
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 343 transition count 434
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 343 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 342 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 342 transition count 433
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 341 transition count 432
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 341 transition count 432
Applied a total of 46 rules in 33 ms. Remains 341 /364 variables (removed 23) and now considering 432/455 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 341/364 places, 432/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 34 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 85 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 346 transition count 437
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 346 transition count 437
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 338 transition count 429
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 335 transition count 426
Applied a total of 58 rules in 32 ms. Remains 335 /364 variables (removed 29) and now considering 426/455 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 335/364 places, 426/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 364 edges and 364 vertex of which 54 / 364 are part of one of the 9 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 221 place count 318 transition count 184
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 225 rules applied. Total rules applied 446 place count 98 transition count 179
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 449 place count 96 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 450 place count 95 transition count 178
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 450 place count 95 transition count 167
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 472 place count 84 transition count 167
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 480 place count 76 transition count 159
Iterating global reduction 4 with 8 rules applied. Total rules applied 488 place count 76 transition count 159
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 488 place count 76 transition count 157
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 492 place count 74 transition count 157
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 495 place count 71 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 498 place count 71 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 500 place count 71 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 512 place count 65 transition count 130
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 519 place count 58 transition count 106
Iterating global reduction 5 with 7 rules applied. Total rules applied 526 place count 58 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 530 place count 58 transition count 102
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 531 place count 57 transition count 100
Iterating global reduction 6 with 1 rules applied. Total rules applied 532 place count 57 transition count 100
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 534 place count 56 transition count 99
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 535 place count 55 transition count 93
Iterating global reduction 6 with 1 rules applied. Total rules applied 536 place count 55 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 537 place count 55 transition count 92
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 541 place count 55 transition count 88
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 7 with 8 rules applied. Total rules applied 549 place count 51 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 550 place count 50 transition count 83
Applied a total of 550 rules in 42 ms. Remains 50 /364 variables (removed 314) and now considering 83/455 (removed 372) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 50/364 places, 83/455 transitions.
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:23:35] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:23:35] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 347 transition count 438
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 347 transition count 438
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 340 transition count 431
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 340 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 338 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 338 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 337 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 337 transition count 428
Applied a total of 54 rules in 32 ms. Remains 337 /364 variables (removed 27) and now considering 428/455 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 337/364 places, 428/455 transitions.
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:23:36] [INFO ] Input system was already deterministic with 428 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 346 transition count 437
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 346 transition count 437
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 338 transition count 429
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 338 transition count 429
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 336 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 336 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 335 transition count 426
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 335 transition count 426
Applied a total of 58 rules in 38 ms. Remains 335 /364 variables (removed 29) and now considering 426/455 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 335/364 places, 426/455 transitions.
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 16 ms
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 05:23:36] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 368 edges and 364 vertex of which 53 / 364 are part of one of the 8 SCC in 1 ms
Free SCC test removed 45 places
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 223 transitions
Trivial Post-agglo rules discarded 223 transitions
Performed 223 trivial Post agglomeration. Transition count delta: 223
Iterating post reduction 0 with 223 rules applied. Total rules applied 224 place count 318 transition count 180
Reduce places removed 223 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 229 rules applied. Total rules applied 453 place count 95 transition count 174
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 457 place count 92 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 458 place count 91 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 458 place count 91 transition count 161
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 482 place count 79 transition count 161
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 490 place count 71 transition count 152
Iterating global reduction 4 with 8 rules applied. Total rules applied 498 place count 71 transition count 152
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 498 place count 71 transition count 150
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 502 place count 69 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 506 place count 65 transition count 129
Iterating global reduction 4 with 4 rules applied. Total rules applied 510 place count 65 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 512 place count 65 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 513 place count 64 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 514 place count 64 transition count 125
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 526 place count 58 transition count 119
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 534 place count 50 transition count 93
Iterating global reduction 5 with 8 rules applied. Total rules applied 542 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 545 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 547 place count 48 transition count 86
Iterating global reduction 6 with 2 rules applied. Total rules applied 549 place count 48 transition count 86
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 551 place count 46 transition count 82
Iterating global reduction 6 with 2 rules applied. Total rules applied 553 place count 46 transition count 82
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 555 place count 45 transition count 81
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 44 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 558 place count 44 transition count 77
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 561 place count 44 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 567 place count 41 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 568 place count 40 transition count 70
Applied a total of 568 rules in 35 ms. Remains 40 /364 variables (removed 324) and now considering 70/455 (removed 385) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 40/364 places, 70/455 transitions.
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:23:36] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 364/364 places, 455/455 transitions.
Graph (trivial) has 365 edges and 364 vertex of which 47 / 364 are part of one of the 8 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 324 transition count 185
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 234 rules applied. Total rules applied 461 place count 98 transition count 177
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 467 place count 94 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 469 place count 92 transition count 175
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 469 place count 92 transition count 163
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 493 place count 80 transition count 163
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 501 place count 72 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 509 place count 72 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 509 place count 72 transition count 153
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 511 place count 71 transition count 153
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 515 place count 67 transition count 132
Iterating global reduction 4 with 4 rules applied. Total rules applied 519 place count 67 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 521 place count 67 transition count 130
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 522 place count 66 transition count 128
Iterating global reduction 5 with 1 rules applied. Total rules applied 523 place count 66 transition count 128
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 5 with 14 rules applied. Total rules applied 537 place count 59 transition count 121
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 542 place count 54 transition count 100
Iterating global reduction 5 with 5 rules applied. Total rules applied 547 place count 54 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 551 place count 54 transition count 96
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 553 place count 53 transition count 95
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 52 transition count 90
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 52 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 556 place count 52 transition count 89
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 560 place count 52 transition count 85
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 7 with 8 rules applied. Total rules applied 568 place count 48 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 569 place count 47 transition count 80
Applied a total of 569 rules in 31 ms. Remains 47 /364 variables (removed 317) and now considering 80/455 (removed 375) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 47/364 places, 80/455 transitions.
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:23:36] [INFO ] Input system was already deterministic with 80 transitions.
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 05:23:36] [INFO ] Flatten gal took : 14 ms
[2023-03-23 05:23:36] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-23 05:23:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 364 places, 455 transitions and 1197 arcs took 3 ms.
Total runtime 14034 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 364 NrTr: 455 NrArc: 1197)

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

net check time: 0m 0.000sec

init dd package: 0m 3.449sec


RS generation: 0m 8.943sec


-> reachability set: #nodes 12431 (1.2e+04) #states 12,514,211 (7)



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

checking: EG [[[p311<=0 & 0<=p311] | [p211<=1 & 1<=p211]]]
normalized: EG [[[p311<=0 & 0<=p311] | [p211<=1 & 1<=p211]]]

abstracting: (1<=p211)
states: 72,618 (4)
abstracting: (p211<=1)
states: 12,514,211 (7)
abstracting: (0<=p311)
states: 12,514,211 (7)
abstracting: (p311<=0)
states: 12,360,412 (7)
.......................................................................
EG iterations: 71
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.740sec

checking: EX [AF [[[p340<=1 & 1<=p340] | EX [EG [[p46<=0 & 0<=p46]]]]]]
normalized: EX [~ [EG [~ [[EX [EG [[p46<=0 & 0<=p46]]] | [p340<=1 & 1<=p340]]]]]]

abstracting: (1<=p340)
states: 69,178 (4)
abstracting: (p340<=1)
states: 12,514,211 (7)
abstracting: (0<=p46)
states: 12,514,211 (7)
abstracting: (p46<=0)
states: 12,361,499 (7)
....................................................................
EG iterations: 68
...............................................................
EG iterations: 62
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.831sec

checking: EX [EF [[[p222<=0 & 0<=p222] & [p71<=1 & 1<=p71]]]]
normalized: EX [E [true U [[p71<=1 & 1<=p71] & [p222<=0 & 0<=p222]]]]

abstracting: (0<=p222)
states: 12,514,211 (7)
abstracting: (p222<=0)
states: 12,445,047 (7)
abstracting: (1<=p71)
states: 152,712 (5)
abstracting: (p71<=1)
states: 12,514,211 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.547sec

checking: EG [[[p86<=0 & 0<=p86] | [p267<=1 & 1<=p267]]]
normalized: EG [[[p267<=1 & 1<=p267] | [p86<=0 & 0<=p86]]]

abstracting: (0<=p86)
states: 12,514,211 (7)
abstracting: (p86<=0)
states: 12,442,559 (7)
abstracting: (1<=p267)
states: 153,799 (5)
abstracting: (p267<=1)
states: 12,514,211 (7)
................................................
EG iterations: 48
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.333sec

checking: AF [[EF [EG [[p56<=0 & 0<=p56]]] | [[p128<=0 & 0<=p128] & [p90<=1 & 1<=p90]]]]
normalized: ~ [EG [~ [[E [true U EG [[p56<=0 & 0<=p56]]] | [[p90<=1 & 1<=p90] & [p128<=0 & 0<=p128]]]]]]

abstracting: (0<=p128)
states: 12,514,211 (7)
abstracting: (p128<=0)
states: 12,443,637 (7)
abstracting: (1<=p90)
states: 67,620 (4)
abstracting: (p90<=1)
states: 12,514,211 (7)
abstracting: (0<=p56)
states: 12,514,211 (7)
abstracting: (p56<=0)
states: 12,449,475 (7)
.............................................
EG iterations: 45
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.893sec

checking: EF [EG [AG [[[p243<=1 & 1<=p243] & [[p134<=0 & 0<=p134] & [[p6<=0 & 0<=p6] | [p345<=1 & 1<=p345]]]]]]]
normalized: E [true U EG [~ [E [true U ~ [[[[[p345<=1 & 1<=p345] | [p6<=0 & 0<=p6]] & [p134<=0 & 0<=p134]] & [p243<=1 & 1<=p243]]]]]]]

abstracting: (1<=p243)
states: 71,568 (4)
abstracting: (p243<=1)
states: 12,514,211 (7)
abstracting: (0<=p134)
states: 12,514,211 (7)
abstracting: (p134<=0)
states: 12,443,637 (7)
abstracting: (0<=p6)
states: 12,514,211 (7)
abstracting: (p6<=0)
states: 12,442,643 (7)
abstracting: (1<=p345)
states: 69,178 (4)
abstracting: (p345<=1)
states: 12,514,211 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.373sec

checking: [AX [EX [[EG [[p136<=0 & 0<=p136]] & [[p247<=0 & 0<=p247] | [p303<=1 & 1<=p303]]]]] & EF [EX [[[p275<=0 & 0<=p275] | AX [[p147<=0 & 0<=p147]]]]]]
normalized: [E [true U EX [[~ [EX [~ [[p147<=0 & 0<=p147]]]] | [p275<=0 & 0<=p275]]]] & ~ [EX [~ [EX [[[[p303<=1 & 1<=p303] | [p247<=0 & 0<=p247]] & EG [[p136<=0 & 0<=p136]]]]]]]]

abstracting: (0<=p136)
states: 12,514,211 (7)
abstracting: (p136<=0)
states: 12,443,637 (7)
.................................................................
EG iterations: 65
abstracting: (0<=p247)
states: 12,514,211 (7)
abstracting: (p247<=0)
states: 12,442,643 (7)
abstracting: (1<=p303)
states: 153,799 (5)
abstracting: (p303<=1)
states: 12,514,211 (7)
..abstracting: (0<=p275)
states: 12,514,211 (7)
abstracting: (p275<=0)
states: 12,360,412 (7)
abstracting: (0<=p147)
states: 12,514,211 (7)
abstracting: (p147<=0)
states: 12,361,440 (7)
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.042sec

checking: AX [A [~ [[[p331<=1 & 1<=p331] & ~ [[[p77<=0 & 0<=p77] | [p149<=1 & 1<=p149]]]]] U ~ [[[p22<=0 & 0<=p22] | [p213<=1 & 1<=p213]]]]]
normalized: ~ [EX [~ [[~ [E [[[p213<=1 & 1<=p213] | [p22<=0 & 0<=p22]] U [[~ [[[p149<=1 & 1<=p149] | [p77<=0 & 0<=p77]]] & [p331<=1 & 1<=p331]] & [[p213<=1 & 1<=p213] | [p22<=0 & 0<=p22]]]]] & ~ [EG [[[p213<=1 & 1<=p213] | [p22<=0 & 0<=p22]]]]]]]]

abstracting: (0<=p22)
states: 12,514,211 (7)
abstracting: (p22<=0)
states: 12,361,499 (7)
abstracting: (1<=p213)
states: 72,618 (4)
abstracting: (p213<=1)
states: 12,514,211 (7)
.............................................................................
EG iterations: 77
abstracting: (0<=p22)
states: 12,514,211 (7)
abstracting: (p22<=0)
states: 12,361,499 (7)
abstracting: (1<=p213)
states: 72,618 (4)
abstracting: (p213<=1)
states: 12,514,211 (7)
abstracting: (1<=p331)
states: 73,676 (4)
abstracting: (p331<=1)
states: 12,514,211 (7)
abstracting: (0<=p77)
states: 12,514,211 (7)
abstracting: (p77<=0)
states: 12,361,499 (7)
abstracting: (1<=p149)
states: 152,771 (5)
abstracting: (p149<=1)
states: 12,514,211 (7)
abstracting: (0<=p22)
states: 12,514,211 (7)
abstracting: (p22<=0)
states: 12,361,499 (7)
abstracting: (1<=p213)
states: 72,618 (4)
abstracting: (p213<=1)
states: 12,514,211 (7)
.-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.734sec

checking: E [AG [EX [EF [[1<=p297 & p297<=1]]]] U [EF [[[p190<=1 & 1<=p190] | ~ [[~ [[p213<=1 & 1<=p213]] | [[p18<=0 & 0<=p18] & [p191<=1 & 1<=p191]]]]]] | [p314<=1 & 1<=p314]]]
normalized: E [~ [E [true U ~ [EX [E [true U [1<=p297 & p297<=1]]]]]] U [[p314<=1 & 1<=p314] | E [true U [~ [[[[p191<=1 & 1<=p191] & [p18<=0 & 0<=p18]] | ~ [[p213<=1 & 1<=p213]]]] | [p190<=1 & 1<=p190]]]]]

abstracting: (1<=p190)
states: 152,771 (5)
abstracting: (p190<=1)
states: 12,514,211 (7)
abstracting: (1<=p213)
states: 72,618 (4)
abstracting: (p213<=1)
states: 12,514,211 (7)
abstracting: (0<=p18)
states: 12,514,211 (7)
abstracting: (p18<=0)
states: 12,442,643 (7)
abstracting: (1<=p191)
states: 152,771 (5)
abstracting: (p191<=1)
states: 12,514,211 (7)
abstracting: (1<=p314)
states: 153,799 (5)
abstracting: (p314<=1)
states: 12,514,211 (7)
abstracting: (p297<=1)
states: 12,514,211 (7)
abstracting: (1<=p297)
states: 153,799 (5)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.451sec

checking: ~ [A [[[p95<=1 & 1<=p95] | [[p299<=0 & 0<=p299] | EG [~ [[p340<=1 & 1<=p340]]]]] U [[p6<=1 & 1<=p6] & [EF [[p9<=0 & 0<=p9]] & EF [~ [EF [[[p238<=0 & 0<=p238] | [p145<=1 & 1<=p145]]]]]]]]]
normalized: ~ [[~ [EG [~ [[[E [true U ~ [E [true U [[p145<=1 & 1<=p145] | [p238<=0 & 0<=p238]]]]] & E [true U [p9<=0 & 0<=p9]]] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[E [true U ~ [E [true U [[p145<=1 & 1<=p145] | [p238<=0 & 0<=p238]]]]] & E [true U [p9<=0 & 0<=p9]]] & [p6<=1 & 1<=p6]]] U [~ [[[E [true U ~ [E [true U [[p145<=1 & 1<=p145] | [p238<=0 & 0<=p238]]]]] & E [true U [p9<=0 & 0<=p9]]] & [p6<=1 & 1<=p6]]] & ~ [[[EG [~ [[p340<=1 & 1<=p340]]] | [p299<=0 & 0<=p299]] | [p95<=1 & 1<=p95]]]]]]]]

abstracting: (1<=p95)
states: 67,620 (4)
abstracting: (p95<=1)
states: 12,514,211 (7)
abstracting: (0<=p299)
states: 12,514,211 (7)
abstracting: (p299<=0)
states: 12,360,412 (7)
abstracting: (1<=p340)
states: 69,178 (4)
abstracting: (p340<=1)
states: 12,514,211 (7)
..........................
before gc: list nodes free: 620439

after gc: idd nodes used:85531, unused:63914469; list nodes free:303688169
...........................................
EG iterations: 69
abstracting: (1<=p6)
states: 71,568 (4)
abstracting: (p6<=1)
states: 12,514,211 (7)
abstracting: (0<=p9)
states: 12,514,211 (7)
abstracting: (p9<=0)
states: 12,442,643 (7)
abstracting: (0<=p238)
states: 12,514,211 (7)
abstracting: (p238<=0)
states: 12,442,643 (7)
abstracting: (1<=p145)
states: 152,771 (5)
abstracting: (p145<=1)
states: 12,514,211 (7)
abstracting: (1<=p6)
states: 71,568 (4)
abstracting: (p6<=1)
states: 12,514,211 (7)
abstracting: (0<=p9)
states: 12,514,211 (7)
abstracting: (p9<=0)
states: 12,442,643 (7)
abstracting: (0<=p238)
states: 12,514,211 (7)
abstracting: (p238<=0)
states: 12,442,643 (7)
abstracting: (1<=p145)
states: 152,771 (5)
abstracting: (p145<=1)
states: 12,514,211 (7)
abstracting: (1<=p6)
states: 71,568 (4)
abstracting: (p6<=1)
states: 12,514,211 (7)
abstracting: (0<=p9)
states: 12,514,211 (7)
abstracting: (p9<=0)
states: 12,442,643 (7)
abstracting: (0<=p238)
states: 12,514,211 (7)
abstracting: (p238<=0)
states: 12,442,643 (7)
abstracting: (1<=p145)
states: 152,771 (5)
abstracting: (p145<=1)
states: 12,514,211 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.390sec

checking: [AG [[AX [[p268<=0 & 0<=p268]] | AG [E [[[p173<=0 & 0<=p173] | [p132<=1 & 1<=p132]] U [p98<=0 & 0<=p98]]]]] & ~ [E [AF [[p160<=1 & 1<=p160]] U [[p0<=0 & 0<=p0] | [p195<=1 & 1<=p195]]]]]
normalized: [~ [E [~ [EG [~ [[p160<=1 & 1<=p160]]]] U [[p195<=1 & 1<=p195] | [p0<=0 & 0<=p0]]]] & ~ [E [true U ~ [[~ [E [true U ~ [E [[[p132<=1 & 1<=p132] | [p173<=0 & 0<=p173]] U [p98<=0 & 0<=p98]]]]] | ~ [EX [~ [[p268<=0 & 0<=p268]]]]]]]]]

abstracting: (0<=p268)
states: 12,514,211 (7)
abstracting: (p268<=0)
states: 12,360,412 (7)
.abstracting: (0<=p98)
states: 12,514,211 (7)
abstracting: (p98<=0)
states: 12,442,559 (7)
abstracting: (0<=p173)
states: 12,514,211 (7)
abstracting: (p173<=0)
states: 12,450,427 (7)
abstracting: (1<=p132)
states: 70,574 (4)
abstracting: (p132<=1)
states: 12,514,211 (7)
abstracting: (0<=p0)
states: 12,514,211 (7)
abstracting: (p0<=0)
states: 12,514,210 (7)
abstracting: (1<=p195)
states: 152,771 (5)
abstracting: (p195<=1)
states: 12,514,211 (7)
abstracting: (1<=p160)
states: 73,599 (4)
abstracting: (p160<=1)
states: 12,514,211 (7)
.........................................................
EG iterations: 57
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.653sec

checking: AX [E [E [AX [EF [[[p311<=0 & 0<=p311] | [p362<=1 & 1<=p362]]]] U [~ [[p312<=1 & 1<=p312]] & [[p198<=0 & 0<=p198] | [p27<=1 & 1<=p27]]]] U E [[EX [[[p180<=0 & 0<=p180] | [p43<=1 & 1<=p43]]] & [p228<=1 & 1<=p228]] U E [EF [[[p188<=0 & 0<=p188] | [p106<=1 & 1<=p106]]] U [p81<=1 & 1<=p81]]]]]
normalized: ~ [EX [~ [E [E [~ [EX [~ [E [true U [[p362<=1 & 1<=p362] | [p311<=0 & 0<=p311]]]]]] U [[[p27<=1 & 1<=p27] | [p198<=0 & 0<=p198]] & ~ [[p312<=1 & 1<=p312]]]] U E [[[p228<=1 & 1<=p228] & EX [[[p43<=1 & 1<=p43] | [p180<=0 & 0<=p180]]]] U E [E [true U [[p106<=1 & 1<=p106] | [p188<=0 & 0<=p188]]] U [p81<=1 & 1<=p81]]]]]]]

abstracting: (1<=p81)
states: 152,712 (5)
abstracting: (p81<=1)
states: 12,514,211 (7)
abstracting: (0<=p188)
states: 12,514,211 (7)
abstracting: (p188<=0)
states: 12,361,440 (7)
abstracting: (1<=p106)
states: 69,164 (4)
abstracting: (p106<=1)
states: 12,514,211 (7)
abstracting: (0<=p180)
states: 12,514,211 (7)
abstracting: (p180<=0)
states: 12,361,440 (7)
abstracting: (1<=p43)
states: 152,712 (5)
abstracting: (p43<=1)
states: 12,514,211 (7)
.abstracting: (1<=p228)
states: 69,164 (4)
abstracting: (p228<=1)
states: 12,514,211 (7)
abstracting: (1<=p312)
states: 153,799 (5)
abstracting: (p312<=1)
states: 12,514,211 (7)
abstracting: (0<=p198)
states: 12,514,211 (7)
abstracting: (p198<=0)
states: 12,447,402 (7)
abstracting: (1<=p27)
states: 152,712 (5)
abstracting: (p27<=1)
states: 12,514,211 (7)
abstracting: (0<=p311)
states: 12,514,211 (7)
abstracting: (p311<=0)
states: 12,360,412 (7)
abstracting: (1<=p362)
states: 538,415 (5)
abstracting: (p362<=1)
states: 12,514,211 (7)
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.937sec

checking: A [[AG [[A [[p285<=1 & 1<=p285] U [[p150<=0 & 0<=p150] | [p230<=1 & 1<=p230]]] | EX [[p203<=1 & 1<=p203]]]] & EG [~ [[[p181<=1 & 1<=p181] | [[p20<=0 & 0<=p20] | A [[p64<=1 & 1<=p64] U [p221<=1 & 1<=p221]]]]]]] U EX [AG [~ [[~ [[[p77<=0 & 0<=p77] | [p36<=1 & 1<=p36]]] | A [[[p287<=0 & 0<=p287] | [p196<=1 & 1<=p196]] U [p153<=1 & 1<=p153]]]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U [[~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[[p196<=1 & 1<=p196] | [p287<=0 & 0<=p287]]] & ~ [[p153<=1 & 1<=p153]]]]]] | ~ [[[p36<=1 & 1<=p36] | [p77<=0 & 0<=p77]]]]]]]]]] & ~ [E [~ [EX [~ [E [true U [[~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[[p196<=1 & 1<=p196] | [p287<=0 & 0<=p287]]] & ~ [[p153<=1 & 1<=p153]]]]]] | ~ [[[p36<=1 & 1<=p36] | [p77<=0 & 0<=p77]]]]]]]] U [~ [[EG [~ [[[[~ [EG [~ [[p221<=1 & 1<=p221]]]] & ~ [E [~ [[p221<=1 & 1<=p221]] U [~ [[p64<=1 & 1<=p64]] & ~ [[p221<=1 & 1<=p221]]]]]] | [p20<=0 & 0<=p20]] | [p181<=1 & 1<=p181]]]] & ~ [E [true U ~ [[EX [[p203<=1 & 1<=p203]] | [~ [EG [~ [[[p230<=1 & 1<=p230] | [p150<=0 & 0<=p150]]]]] & ~ [E [~ [[[p230<=1 & 1<=p230] | [p150<=0 & 0<=p150]]] U [~ [[p285<=1 & 1<=p285]] & ~ [[[p230<=1 & 1<=p230] | [p150<=0 & 0<=p150]]]]]]]]]]]]] & ~ [EX [~ [E [true U [[~ [EG [~ [[p153<=1 & 1<=p153]]]] & ~ [E [~ [[p153<=1 & 1<=p153]] U [~ [[[p196<=1 & 1<=p196] | [p287<=0 & 0<=p287]]] & ~ [[p153<=1 & 1<=p153]]]]]] | ~ [[[p36<=1 & 1<=p36] | [p77<=0 & 0<=p77]]]]]]]]]]]]

abstracting: (0<=p77)
states: 12,514,211 (7)
abstracting: (p77<=0)
states: 12,361,499 (7)
abstracting: (1<=p36)
states: 152,712 (5)
abstracting: (p36<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (0<=p287)
states: 12,514,211 (7)
abstracting: (p287<=0)
states: 12,450,427 (7)
abstracting: (1<=p196)
states: 152,771 (5)
abstracting: (p196<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
.........................................................................
EG iterations: 73
.abstracting: (0<=p150)
states: 12,514,211 (7)
abstracting: (p150<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
abstracting: (1<=p285)
states: 63,784 (4)
abstracting: (p285<=1)
states: 12,514,211 (7)
abstracting: (0<=p150)
states: 12,514,211 (7)
abstracting: (p150<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
abstracting: (0<=p150)
states: 12,514,211 (7)
abstracting: (p150<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
....................................................................
EG iterations: 68
abstracting: (1<=p203)
states: 72,618 (4)
abstracting: (p203<=1)
states: 12,514,211 (7)
.abstracting: (1<=p181)
states: 152,771 (5)
abstracting: (p181<=1)
states: 12,514,211 (7)
abstracting: (0<=p20)
states: 12,514,211 (7)
abstracting: (p20<=0)
states: 12,442,643 (7)
abstracting: (1<=p221)
states: 69,164 (4)
abstracting: (p221<=1)
states: 12,514,211 (7)
abstracting: (1<=p64)
states: 152,712 (5)
abstracting: (p64<=1)
states: 12,514,211 (7)
abstracting: (1<=p221)
states: 69,164 (4)
abstracting: (p221<=1)
states: 12,514,211 (7)
abstracting: (1<=p221)
states: 69,164 (4)
abstracting: (p221<=1)
states: 12,514,211 (7)
........................................................................
EG iterations: 72
......................................
EG iterations: 38
abstracting: (0<=p77)
states: 12,514,211 (7)
abstracting: (p77<=0)
states: 12,361,499 (7)
abstracting: (1<=p36)
states: 152,712 (5)
abstracting: (p36<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (0<=p287)
states: 12,514,211 (7)
abstracting: (p287<=0)
states: 12,450,427 (7)
abstracting: (1<=p196)
states: 152,771 (5)
abstracting: (p196<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
.........................................................................
EG iterations: 73
.abstracting: (0<=p77)
states: 12,514,211 (7)
abstracting: (p77<=0)
states: 12,361,499 (7)
abstracting: (1<=p36)
states: 152,712 (5)
abstracting: (p36<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (0<=p287)
states: 12,514,211 (7)
abstracting: (p287<=0)
states: 12,450,427 (7)
abstracting: (1<=p196)
states: 152,771 (5)
abstracting: (p196<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
abstracting: (1<=p153)
states: 152,771 (5)
abstracting: (p153<=1)
states: 12,514,211 (7)
.........................................................................
EG iterations: 73
......................................
before gc: list nodes free: 418

after gc: idd nodes used:230180, unused:63769820; list nodes free:305138482
.....................
EG iterations: 58
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m26.895sec

checking: A [[p56<=1 & 1<=p56] U [EF [~ [E [[[p187<=0 & 0<=p187] | [[p57<=1 & 1<=p57] | [p321<=1 & 1<=p321]]] U EF [[[p111<=0 & 0<=p111] | [p347<=1 & 1<=p347]]]]]] & [~ [[EG [[p54<=1 & 1<=p54]] & ~ [EG [[p85<=1 & 1<=p85]]]]] | [~ [[[[p219<=0 & 0<=p219] | [p106<=1 & 1<=p106]] & [[p119<=1 & 1<=p119] & ~ [[p249<=1 & 1<=p249]]]]] & [EF [[[p162<=0 & 0<=p162] | [p230<=1 & 1<=p230]]] | ~ [AX [[p343<=0 & 0<=p343]]]]]]]]
normalized: [~ [EG [~ [[[~ [[~ [EG [[p85<=1 & 1<=p85]]] & EG [[p54<=1 & 1<=p54]]]] | [[EX [~ [[p343<=0 & 0<=p343]]] | E [true U [[p230<=1 & 1<=p230] | [p162<=0 & 0<=p162]]]] & ~ [[[~ [[p249<=1 & 1<=p249]] & [p119<=1 & 1<=p119]] & [[p106<=1 & 1<=p106] | [p219<=0 & 0<=p219]]]]]] & E [true U ~ [E [[[[p321<=1 & 1<=p321] | [p57<=1 & 1<=p57]] | [p187<=0 & 0<=p187]] U E [true U [[p347<=1 & 1<=p347] | [p111<=0 & 0<=p111]]]]]]]]]] & ~ [E [~ [[[~ [[~ [EG [[p85<=1 & 1<=p85]]] & EG [[p54<=1 & 1<=p54]]]] | [[EX [~ [[p343<=0 & 0<=p343]]] | E [true U [[p230<=1 & 1<=p230] | [p162<=0 & 0<=p162]]]] & ~ [[[~ [[p249<=1 & 1<=p249]] & [p119<=1 & 1<=p119]] & [[p106<=1 & 1<=p106] | [p219<=0 & 0<=p219]]]]]] & E [true U ~ [E [[[[p321<=1 & 1<=p321] | [p57<=1 & 1<=p57]] | [p187<=0 & 0<=p187]] U E [true U [[p347<=1 & 1<=p347] | [p111<=0 & 0<=p111]]]]]]]] U [~ [[[~ [[~ [EG [[p85<=1 & 1<=p85]]] & EG [[p54<=1 & 1<=p54]]]] | [[EX [~ [[p343<=0 & 0<=p343]]] | E [true U [[p230<=1 & 1<=p230] | [p162<=0 & 0<=p162]]]] & ~ [[[~ [[p249<=1 & 1<=p249]] & [p119<=1 & 1<=p119]] & [[p106<=1 & 1<=p106] | [p219<=0 & 0<=p219]]]]]] & E [true U ~ [E [[[[p321<=1 & 1<=p321] | [p57<=1 & 1<=p57]] | [p187<=0 & 0<=p187]] U E [true U [[p347<=1 & 1<=p347] | [p111<=0 & 0<=p111]]]]]]]] & ~ [[p56<=1 & 1<=p56]]]]]]

abstracting: (1<=p56)
states: 64,736 (4)
abstracting: (p56<=1)
states: 12,514,211 (7)
abstracting: (0<=p111)
states: 12,514,211 (7)
abstracting: (p111<=0)
states: 12,445,047 (7)
abstracting: (1<=p347)
states: 69,178 (4)
abstracting: (p347<=1)
states: 12,514,211 (7)
abstracting: (0<=p187)
states: 12,514,211 (7)
abstracting: (p187<=0)
states: 12,361,440 (7)
abstracting: (1<=p57)
states: 64,736 (4)
abstracting: (p57<=1)
states: 12,514,211 (7)
abstracting: (1<=p321)
states: 69,580 (4)
abstracting: (p321<=1)
states: 12,514,211 (7)
abstracting: (0<=p219)
states: 12,514,211 (7)
abstracting: (p219<=0)
states: 12,444,851 (7)
abstracting: (1<=p106)
states: 69,164 (4)
abstracting: (p106<=1)
states: 12,514,211 (7)
abstracting: (1<=p119)
states: 69,164 (4)
abstracting: (p119<=1)
states: 12,514,211 (7)
abstracting: (1<=p249)
states: 71,568 (4)
abstracting: (p249<=1)
states: 12,514,211 (7)
abstracting: (0<=p162)
states: 12,514,211 (7)
abstracting: (p162<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
abstracting: (0<=p343)
states: 12,514,211 (7)
abstracting: (p343<=0)
states: 12,445,033 (7)
.abstracting: (1<=p54)
states: 64,736 (4)
abstracting: (p54<=1)
states: 12,514,211 (7)
........................................
EG iterations: 40
abstracting: (1<=p85)
states: 152,712 (5)
abstracting: (p85<=1)
states: 12,514,211 (7)
....................................................................
EG iterations: 68
abstracting: (0<=p111)
states: 12,514,211 (7)
abstracting: (p111<=0)
states: 12,445,047 (7)
abstracting: (1<=p347)
states: 69,178 (4)
abstracting: (p347<=1)
states: 12,514,211 (7)
abstracting: (0<=p187)
states: 12,514,211 (7)
abstracting: (p187<=0)
states: 12,361,440 (7)
abstracting: (1<=p57)
states: 64,736 (4)
abstracting: (p57<=1)
states: 12,514,211 (7)
abstracting: (1<=p321)
states: 69,580 (4)
abstracting: (p321<=1)
states: 12,514,211 (7)
abstracting: (0<=p219)
states: 12,514,211 (7)
abstracting: (p219<=0)
states: 12,444,851 (7)
abstracting: (1<=p106)
states: 69,164 (4)
abstracting: (p106<=1)
states: 12,514,211 (7)
abstracting: (1<=p119)
states: 69,164 (4)
abstracting: (p119<=1)
states: 12,514,211 (7)
abstracting: (1<=p249)
states: 71,568 (4)
abstracting: (p249<=1)
states: 12,514,211 (7)
abstracting: (0<=p162)
states: 12,514,211 (7)
abstracting: (p162<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
abstracting: (0<=p343)
states: 12,514,211 (7)
abstracting: (p343<=0)
states: 12,445,033 (7)
.abstracting: (1<=p54)
states: 64,736 (4)
abstracting: (p54<=1)
states: 12,514,211 (7)
........................................
EG iterations: 40
abstracting: (1<=p85)
states: 152,712 (5)
abstracting: (p85<=1)
states: 12,514,211 (7)
....................................................................
EG iterations: 68
abstracting: (0<=p111)
states: 12,514,211 (7)
abstracting: (p111<=0)
states: 12,445,047 (7)
abstracting: (1<=p347)
states: 69,178 (4)
abstracting: (p347<=1)
states: 12,514,211 (7)
abstracting: (0<=p187)
states: 12,514,211 (7)
abstracting: (p187<=0)
states: 12,361,440 (7)
abstracting: (1<=p57)
states: 64,736 (4)
abstracting: (p57<=1)
states: 12,514,211 (7)
abstracting: (1<=p321)
states: 69,580 (4)
abstracting: (p321<=1)
states: 12,514,211 (7)
abstracting: (0<=p219)
states: 12,514,211 (7)
abstracting: (p219<=0)
states: 12,444,851 (7)
abstracting: (1<=p106)
states: 69,164 (4)
abstracting: (p106<=1)
states: 12,514,211 (7)
abstracting: (1<=p119)
states: 69,164 (4)
abstracting: (p119<=1)
states: 12,514,211 (7)
abstracting: (1<=p249)
states: 71,568 (4)
abstracting: (p249<=1)
states: 12,514,211 (7)
abstracting: (0<=p162)
states: 12,514,211 (7)
abstracting: (p162<=0)
states: 12,361,440 (7)
abstracting: (1<=p230)
states: 69,164 (4)
abstracting: (p230<=1)
states: 12,514,211 (7)
abstracting: (0<=p343)
states: 12,514,211 (7)
abstracting: (p343<=0)
states: 12,445,033 (7)
.abstracting: (1<=p54)
states: 64,736 (4)
abstracting: (p54<=1)
states: 12,514,211 (7)
........................................
EG iterations: 40
abstracting: (1<=p85)
states: 152,712 (5)
abstracting: (p85<=1)
states: 12,514,211 (7)
....................................................................
EG iterations: 68

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.317sec

totally nodes used: 139222458 (1.4e+08)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 254917229 629336421 884253650
used/not used/entry size/cache size: 40409262 26699602 16 1024MB
basic ops cache: hits/miss/sum: 10570609 24050052 34620661
used/not used/entry size/cache size: 2577897 14199319 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 62797 161693 224490
used/not used/entry size/cache size: 33664 8354944 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 57351507
1 8263436
2 1248858
3 208762
4 31434
5 4268
6 542
7 54
8 2
9 1
>= 10 0

Total processing time: 5m52.699sec


BK_STOP 1679549378060

--------------------
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 CTLCardinality -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.001sec

11876
iterations count:119484 (262), effective:5135 (11)

initing FirstDep: 0m 0.001sec

20532
iterations count:132366 (290), effective:3903 (8)

iterations count:499 (1), effective:9 (0)

iterations count:523 (1), effective:19 (0)

iterations count:455 (1), effective:0 (0)
19685
iterations count:175621 (385), effective:4806 (10)
18656
iterations count:138137 (303), effective:3732 (8)
20148
iterations count:140256 (308), effective:4234 (9)

iterations count:36905 (81), effective:1563 (3)

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

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

iterations count:2357 (5), effective:43 (0)

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

iterations count:2357 (5), effective:43 (0)

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

iterations count:2357 (5), effective:43 (0)

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

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

iterations count:521 (1), effective:14 (0)
20539
iterations count:132351 (290), effective:3894 (8)

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

iterations count:865 (1), effective:32 (0)

iterations count:475 (1), effective:8 (0)

iterations count:455 (1), effective:0 (0)
20354
iterations count:180414 (396), effective:5085 (11)

iterations count:83756 (184), effective:2412 (5)

iterations count:462 (1), effective:1 (0)
19509
iterations count:137168 (301), effective:3695 (8)

iterations count:457 (1), effective:1 (0)
20354
iterations count:180414 (396), effective:5085 (11)

iterations count:83756 (184), effective:2412 (5)

iterations count:456 (1), effective:1 (0)
20354
iterations count:180414 (396), effective:5085 (11)

iterations count:83756 (184), effective:2412 (5)

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

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

iterations count:21864 (48), effective:553 (1)

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

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

iterations count:21864 (48), effective:553 (1)

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

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

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

iterations count:21864 (48), effective:553 (1)

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-03b"
export BK_EXAMINATION="CTLCardinality"
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-03b, examination is CTLCardinality"
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-167912650500577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;