About the Execution of Marcie+red for StigmergyElection-PT-03a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.155 | 15385.00 | 19428.00 | 1637.40 | FTTFFFTFTTFTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650500569.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyElection-PT-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500569
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 16:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 31K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679548776808
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-03a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 05:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:19:41] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-23 05:19:41] [INFO ] Transformed 44 places.
[2023-03-23 05:19:41] [INFO ] Transformed 118 transitions.
[2023-03-23 05:19:41] [INFO ] Found NUPN structural information;
[2023-03-23 05:19:41] [INFO ] Parsed PT model containing 44 places and 118 transitions and 467 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA StigmergyElection-PT-03a-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Applied a total of 0 rules in 15 ms. Remains 44 /44 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2023-03-23 05:19:41] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
// Phase 1: matrix 64 rows 44 cols
[2023-03-23 05:19:41] [INFO ] Computed 4 place invariants in 7 ms
[2023-03-23 05:19:41] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-23 05:19:41] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2023-03-23 05:19:41] [INFO ] Invariant cache hit.
[2023-03-23 05:19:41] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 05:19:41] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-23 05:19:41] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2023-03-23 05:19:41] [INFO ] Invariant cache hit.
[2023-03-23 05:19:41] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 44/44 places, 73/73 transitions.
Support contains 44 out of 44 places after structural reductions.
[2023-03-23 05:19:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 05:19:42] [INFO ] Flatten gal took : 46 ms
FORMULA StigmergyElection-PT-03a-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 05:19:42] [INFO ] Flatten gal took : 19 ms
[2023-03-23 05:19:42] [INFO ] Input system was already deterministic with 73 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 76) seen :73
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 05:19:43] [INFO ] Flow matrix only has 64 transitions (discarded 9 similar events)
[2023-03-23 05:19:43] [INFO ] Invariant cache hit.
[2023-03-23 05:19:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 05:19:43] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2
[2023-03-23 05:19:43] [INFO ] State equation strengthened by 28 read => feed constraints.
[2023-03-23 05:19:43] [INFO ] After 28ms SMT Verify possible using 28 Read/Feed constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 05:19:43] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-23 05:19:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-23 05:19:43] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-23 05:19:43] [INFO ] After 25ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-23 05:19:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 9 ms to minimize.
[2023-03-23 05:19:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2023-03-23 05:19:43] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :0
[2023-03-23 05:19:43] [INFO ] After 269ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 3 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-23 05:19:43] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:19:43] [INFO ] Flatten gal took : 12 ms
[2023-03-23 05:19:43] [INFO ] Input system was already deterministic with 73 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 69
Applied a total of 6 rules in 9 ms. Remains 41 /44 variables (removed 3) and now considering 69/73 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 41/44 places, 69/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 62
Applied a total of 12 rules in 7 ms. Remains 38 /44 variables (removed 6) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 38/44 places, 62/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 40 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 40 transition count 66
Applied a total of 8 rules in 7 ms. Remains 40 /44 variables (removed 4) and now considering 66/73 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 40/44 places, 66/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 15 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 41 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 41 transition count 68
Applied a total of 6 rules in 5 ms. Remains 41 /44 variables (removed 3) and now considering 68/73 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 41/44 places, 68/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Applied a total of 0 rules in 1 ms. Remains 44 /44 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/44 places, 73/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 42 transition count 63
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 33 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 31 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 23 place count 31 transition count 56
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 33 place count 26 transition count 56
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 37 place count 22 transition count 50
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 22 transition count 50
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 21 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 21 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 21 transition count 47
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 59 place count 21 transition count 32
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 4 with 6 rules applied. Total rules applied 65 place count 18 transition count 29
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 18 transition count 29
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 15 transition count 26
Applied a total of 70 rules in 36 ms. Remains 15 /44 variables (removed 29) and now considering 26/73 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 15/44 places, 26/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 3 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 66
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 62
Applied a total of 12 rules in 4 ms. Remains 38 /44 variables (removed 6) and now considering 62/73 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 38/44 places, 62/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 44 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 39 transition count 68
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 34 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 34 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 32 transition count 56
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 32 transition count 56
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 30 transition count 54
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 30 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 30 transition count 51
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 1 with 6 rules applied. Total rules applied 37 place count 27 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 24 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 24 transition count 45
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 24 transition count 41
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 1 with 6 rules applied. Total rules applied 53 place count 21 transition count 38
Applied a total of 53 rules in 24 ms. Remains 21 /44 variables (removed 23) and now considering 38/73 (removed 35) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 21/44 places, 38/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 4 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 38 transition count 63
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 63
Applied a total of 12 rules in 5 ms. Remains 38 /44 variables (removed 6) and now considering 63/73 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 38/44 places, 63/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 39 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 39 transition count 65
Applied a total of 10 rules in 4 ms. Remains 39 /44 variables (removed 5) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/44 places, 65/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 44 transition count 70
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 41 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 38 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 38 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 37 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 37 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 35 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 34 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 34 transition count 61
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 34 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 33 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 31 transition count 55
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 31 transition count 55
Applied a total of 32 rules in 29 ms. Remains 31 /44 variables (removed 13) and now considering 55/73 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 31/44 places, 55/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 41 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 41 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 40 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 40 transition count 67
Applied a total of 8 rules in 4 ms. Remains 40 /44 variables (removed 4) and now considering 67/73 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/44 places, 67/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 42 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 42 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 41 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 41 transition count 67
Applied a total of 6 rules in 4 ms. Remains 41 /44 variables (removed 3) and now considering 67/73 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 41/44 places, 67/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 5 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 73/73 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 40 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 40 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 39 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 39 transition count 65
Applied a total of 10 rules in 3 ms. Remains 39 /44 variables (removed 5) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 39/44 places, 65/73 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 6 ms
[2023-03-23 05:19:44] [INFO ] Input system was already deterministic with 65 transitions.
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 8 ms
[2023-03-23 05:19:44] [INFO ] Flatten gal took : 7 ms
[2023-03-23 05:19:44] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-23 05:19:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 44 places, 73 transitions and 245 arcs took 1 ms.
Total runtime 3776 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: 44 NrTr: 73 NrArc: 245)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.294sec
RS generation: 0m 0.014sec
-> reachability set: #nodes 542 (5.4e+02) #states 227
starting MCC model checker
--------------------------
checking: [AG [[p6<=1 & 1<=p6]] | EG [AG [EF [[p28<=1 & 1<=p28]]]]]
normalized: [~ [E [true U ~ [[p6<=1 & 1<=p6]]]] | EG [~ [E [true U ~ [E [true U [p28<=1 & 1<=p28]]]]]]]
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 227
-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: [AG [EF [[[p39<=1 & 1<=p39] & EG [[[p29<=0 & 0<=p29] & [p20<=1 & 1<=p20]]]]]] & AF [[p10<=1 & 1<=p10]]]
normalized: [~ [E [true U ~ [E [true U [EG [[[p20<=1 & 1<=p20] & [p29<=0 & 0<=p29]]] & [p39<=1 & 1<=p39]]]]]] & ~ [EG [~ [[p10<=1 & 1<=p10]]]]]
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p39)
states: 1
abstracting: (p39<=1)
states: 227
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
..
EG iterations: 2
-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [EX [[[[p35<=0 & 0<=p35] | [p12<=1 & 1<=p12]] & [[p22<=0 & 0<=p22] | [[[p3<=0 & 0<=p3] & [p34<=1 & 1<=p34]] | [[p23<=0 & 0<=p23] & [p31<=0 & 0<=p31]]]]]]]
normalized: ~ [EG [~ [EX [[[[[[p31<=0 & 0<=p31] & [p23<=0 & 0<=p23]] | [[p34<=1 & 1<=p34] & [p3<=0 & 0<=p3]]] | [p22<=0 & 0<=p22]] & [[p12<=1 & 1<=p12] | [p35<=0 & 0<=p35]]]]]]]
abstracting: (0<=p35)
states: 227
abstracting: (p35<=0)
states: 211
abstracting: (1<=p12)
states: 56
abstracting: (p12<=1)
states: 227
abstracting: (0<=p22)
states: 227
abstracting: (p22<=0)
states: 226
abstracting: (0<=p3)
states: 227
abstracting: (p3<=0)
states: 202
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (0<=p31)
states: 227
abstracting: (p31<=0)
states: 202
..
EG iterations: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [[[EX [[p15<=0 & 0<=p15]] | [p12<=0 & 0<=p12]] | [[p11<=1 & 1<=p11] | [[p38<=0 & 0<=p38] & [[p41<=1 & 1<=p41] & [[p28<=0 & 0<=p28] | [p37<=1 & 1<=p37]]]]]]]
normalized: EX [[[[[[[p37<=1 & 1<=p37] | [p28<=0 & 0<=p28]] & [p41<=1 & 1<=p41]] & [p38<=0 & 0<=p38]] | [p11<=1 & 1<=p11]] | [[p12<=0 & 0<=p12] | EX [[p15<=0 & 0<=p15]]]]]
abstracting: (0<=p15)
states: 227
abstracting: (p15<=0)
states: 202
.abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (0<=p38)
states: 227
abstracting: (p38<=0)
states: 226
abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
.-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EG [[AX [[p16<=0 & 0<=p16]] & [[p13<=0 & 0<=p13] & [[p34<=0 & 0<=p34] | [[[p15<=0 & 0<=p15] & [p31<=1 & 1<=p31]] | [[p4<=0 & 0<=p4] & [p19<=1 & 1<=p19]]]]]]]
normalized: EG [[[[[[[p19<=1 & 1<=p19] & [p4<=0 & 0<=p4]] | [[p31<=1 & 1<=p31] & [p15<=0 & 0<=p15]]] | [p34<=0 & 0<=p34]] & [p13<=0 & 0<=p13]] & ~ [EX [~ [[p16<=0 & 0<=p16]]]]]]
abstracting: (0<=p16)
states: 227
abstracting: (p16<=0)
states: 202
.abstracting: (0<=p13)
states: 227
abstracting: (p13<=0)
states: 218
abstracting: (0<=p34)
states: 227
abstracting: (p34<=0)
states: 211
abstracting: (0<=p15)
states: 227
abstracting: (p15<=0)
states: 202
abstracting: (1<=p31)
states: 25
abstracting: (p31<=1)
states: 227
abstracting: (0<=p4)
states: 227
abstracting: (p4<=0)
states: 202
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
.......
EG iterations: 7
-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AG [AX [[EX [[1<=p17 & p17<=1]] & [E [[[p35<=0 & 0<=p35] | [p17<=1 & 1<=p17]] U [p34<=0 & 0<=p34]] & [[p40<=0 & 0<=p40] | [[p35<=1 & 1<=p35] | [[p1<=1 & 1<=p1] & [p15<=1 & 1<=p15]]]]]]]]
normalized: ~ [E [true U EX [~ [[[[[[[p15<=1 & 1<=p15] & [p1<=1 & 1<=p1]] | [p35<=1 & 1<=p35]] | [p40<=0 & 0<=p40]] & E [[[p17<=1 & 1<=p17] | [p35<=0 & 0<=p35]] U [p34<=0 & 0<=p34]]] & EX [[1<=p17 & p17<=1]]]]]]]
abstracting: (p17<=1)
states: 227
abstracting: (1<=p17)
states: 25
.abstracting: (0<=p34)
states: 227
abstracting: (p34<=0)
states: 211
abstracting: (0<=p35)
states: 227
abstracting: (p35<=0)
states: 211
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p40)
states: 227
abstracting: (p40<=0)
states: 171
abstracting: (1<=p35)
states: 16
abstracting: (p35<=1)
states: 227
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
.-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: EF [[AG [A [EF [[[p23<=0 & 0<=p23] | [p0<=1 & 1<=p0]]] U [[p24<=0 & 0<=p24] | [p22<=1 & 1<=p22]]]] | [E [EG [[[p2<=0 & 0<=p2] | [p10<=1 & 1<=p10]]] U ~ [AG [[p15<=0 & 0<=p15]]]] | [AG [EF [[p16<=0 & 0<=p16]]] & AX [[p37<=0 & 0<=p37]]]]]]
normalized: E [true U [[[~ [EX [~ [[p37<=0 & 0<=p37]]]] & ~ [E [true U ~ [E [true U [p16<=0 & 0<=p16]]]]]] | E [EG [[[p10<=1 & 1<=p10] | [p2<=0 & 0<=p2]]] U E [true U ~ [[p15<=0 & 0<=p15]]]]] | ~ [E [true U ~ [[~ [EG [~ [[[p22<=1 & 1<=p22] | [p24<=0 & 0<=p24]]]]] & ~ [E [~ [[[p22<=1 & 1<=p22] | [p24<=0 & 0<=p24]]] U [~ [E [true U [[p0<=1 & 1<=p0] | [p23<=0 & 0<=p23]]]] & ~ [[[p22<=1 & 1<=p22] | [p24<=0 & 0<=p24]]]]]]]]]]]]
abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p15)
states: 227
abstracting: (p15<=0)
states: 202
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 202
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
...
EG iterations: 3
abstracting: (0<=p16)
states: 227
abstracting: (p16<=0)
states: 202
abstracting: (0<=p37)
states: 227
abstracting: (p37<=0)
states: 226
.-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AF [[[[[[p37<=0 & 0<=p37] & [p38<=1 & 1<=p38]] | E [[[p23<=0 & 0<=p23] | [p24<=1 & 1<=p24]] U [p34<=0 & 0<=p34]]] & EX [[[p38<=0 & 0<=p38] & [p18<=1 & 1<=p18]]]] | EG [~ [E [[p8<=0 & 0<=p8] U [p14<=1 & 1<=p14]]]]]] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | ~ [EG [~ [[EG [~ [E [[p8<=0 & 0<=p8] U [p14<=1 & 1<=p14]]]] | [EX [[[p18<=1 & 1<=p18] & [p38<=0 & 0<=p38]]] & [E [[[p24<=1 & 1<=p24] | [p23<=0 & 0<=p23]] U [p34<=0 & 0<=p34]] | [[p38<=1 & 1<=p38] & [p37<=0 & 0<=p37]]]]]]]]]
abstracting: (0<=p37)
states: 227
abstracting: (p37<=0)
states: 226
abstracting: (1<=p38)
states: 1
abstracting: (p38<=1)
states: 227
abstracting: (0<=p34)
states: 227
abstracting: (p34<=0)
states: 211
abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (1<=p24)
states: 1
abstracting: (p24<=1)
states: 227
abstracting: (0<=p38)
states: 227
abstracting: (p38<=0)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p14)
states: 9
abstracting: (p14<=1)
states: 227
abstracting: (0<=p8)
states: 227
abstracting: (p8<=0)
states: 226
.
EG iterations: 1
.......
EG iterations: 7
abstracting: (1<=0)
states: 0
.-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: [EF [AG [[[p38<=0 & 0<=p38] | [p35<=1 & 1<=p35]]]] & A [[[p5<=0 & 0<=p5] | [p17<=1 & 1<=p17]] U ~ [[[EF [[p19<=1 & 1<=p19]] & AG [[[p31<=0 & 0<=p31] | [p27<=1 & 1<=p27]]]] | [[p28<=0 & 0<=p28] | [p23<=1 & 1<=p23]]]]]]
normalized: [[~ [EG [[[[p23<=1 & 1<=p23] | [p28<=0 & 0<=p28]] | [~ [E [true U ~ [[[p27<=1 & 1<=p27] | [p31<=0 & 0<=p31]]]]] & E [true U [p19<=1 & 1<=p19]]]]]] & ~ [E [[[[p23<=1 & 1<=p23] | [p28<=0 & 0<=p28]] | [~ [E [true U ~ [[[p27<=1 & 1<=p27] | [p31<=0 & 0<=p31]]]]] & E [true U [p19<=1 & 1<=p19]]]] U [~ [[[p17<=1 & 1<=p17] | [p5<=0 & 0<=p5]]] & [[[p23<=1 & 1<=p23] | [p28<=0 & 0<=p28]] | [~ [E [true U ~ [[[p27<=1 & 1<=p27] | [p31<=0 & 0<=p31]]]]] & E [true U [p19<=1 & 1<=p19]]]]]]]] & E [true U ~ [E [true U ~ [[[p35<=1 & 1<=p35] | [p38<=0 & 0<=p38]]]]]]]
abstracting: (0<=p38)
states: 227
abstracting: (p38<=0)
states: 226
abstracting: (1<=p35)
states: 16
abstracting: (p35<=1)
states: 227
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (0<=p31)
states: 227
abstracting: (p31<=0)
states: 202
abstracting: (1<=p27)
states: 9
abstracting: (p27<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
abstracting: (0<=p5)
states: 227
abstracting: (p5<=0)
states: 211
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (0<=p31)
states: 227
abstracting: (p31<=0)
states: 202
abstracting: (1<=p27)
states: 9
abstracting: (p27<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (0<=p31)
states: 227
abstracting: (p31<=0)
states: 202
abstracting: (1<=p27)
states: 9
abstracting: (p27<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
..
EG iterations: 2
-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.047sec
checking: EF [[[p37<=1 & 1<=p37] | [A [EG [~ [[p36<=1 & 1<=p36]]] U [[[p3<=1 & 1<=p3] | [[p7<=0 & 0<=p7] | [p22<=1 & 1<=p22]]] & ~ [EX [[p29<=1 & 1<=p29]]]]] | ~ [E [[~ [[[p8<=0 & 0<=p8] | [p28<=1 & 1<=p28]]] & [[p35<=0 & 0<=p35] | [[p16<=1 & 1<=p16] | [p0<=1 & 1<=p0]]]] U ~ [E [[p17<=1 & 1<=p17] U [p16<=1 & 1<=p16]]]]]]]]
normalized: E [true U [[~ [E [[[[[p0<=1 & 1<=p0] | [p16<=1 & 1<=p16]] | [p35<=0 & 0<=p35]] & ~ [[[p28<=1 & 1<=p28] | [p8<=0 & 0<=p8]]]] U ~ [E [[p17<=1 & 1<=p17] U [p16<=1 & 1<=p16]]]]] | [~ [EG [~ [[~ [EX [[p29<=1 & 1<=p29]]] & [[[p22<=1 & 1<=p22] | [p7<=0 & 0<=p7]] | [p3<=1 & 1<=p3]]]]]] & ~ [E [~ [[~ [EX [[p29<=1 & 1<=p29]]] & [[[p22<=1 & 1<=p22] | [p7<=0 & 0<=p7]] | [p3<=1 & 1<=p3]]]] U [~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [[~ [EX [[p29<=1 & 1<=p29]]] & [[[p22<=1 & 1<=p22] | [p7<=0 & 0<=p7]] | [p3<=1 & 1<=p3]]]]]]]]] | [p37<=1 & 1<=p37]]]
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 211
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p29)
states: 25
abstracting: (p29<=1)
states: 227
.abstracting: (1<=p36)
states: 1
abstracting: (p36<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 211
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p29)
states: 25
abstracting: (p29<=1)
states: 227
.abstracting: (1<=p3)
states: 25
abstracting: (p3<=1)
states: 227
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 211
abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p29)
states: 25
abstracting: (p29<=1)
states: 227
...
EG iterations: 2
abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p8)
states: 227
abstracting: (p8<=0)
states: 226
abstracting: (1<=p28)
states: 9
abstracting: (p28<=1)
states: 227
abstracting: (0<=p35)
states: 227
abstracting: (p35<=0)
states: 211
abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 227
-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.012sec
checking: [AX [EG [A [~ [[[p29<=0 & 0<=p29] | [p31<=1 & 1<=p31]]] U A [[p42<=1 & 1<=p42] U [[p21<=0 & 0<=p21] | [p10<=1 & 1<=p10]]]]]] & A [A [[AF [[p12<=0 & 0<=p12]] | [[EF [[p7<=1 & 1<=p7]] | ~ [[p39<=1 & 1<=p39]]] & AF [[[p6<=0 & 0<=p6] | [p18<=1 & 1<=p18]]]]] U EF [EG [[[p43<=0 & 0<=p43] | [p37<=1 & 1<=p37]]]]] U [EX [[~ [[p11<=1 & 1<=p11]] & [[p30<=0 & 0<=p30] & [[p39<=0 & 0<=p39] | [p18<=1 & 1<=p18]]]]] | [[p24<=0 & 0<=p24] | [p33<=1 & 1<=p33]]]]]
normalized: [[~ [EG [~ [[[[p33<=1 & 1<=p33] | [p24<=0 & 0<=p24]] | EX [[[[[p18<=1 & 1<=p18] | [p39<=0 & 0<=p39]] & [p30<=0 & 0<=p30]] & ~ [[p11<=1 & 1<=p11]]]]]]]] & ~ [E [~ [[[[p33<=1 & 1<=p33] | [p24<=0 & 0<=p24]] | EX [[[[[p18<=1 & 1<=p18] | [p39<=0 & 0<=p39]] & [p30<=0 & 0<=p30]] & ~ [[p11<=1 & 1<=p11]]]]]] U [~ [[[[p33<=1 & 1<=p33] | [p24<=0 & 0<=p24]] | EX [[[[[p18<=1 & 1<=p18] | [p39<=0 & 0<=p39]] & [p30<=0 & 0<=p30]] & ~ [[p11<=1 & 1<=p11]]]]]] & ~ [[~ [EG [~ [E [true U EG [[[p37<=1 & 1<=p37] | [p43<=0 & 0<=p43]]]]]]] & ~ [E [~ [E [true U EG [[[p37<=1 & 1<=p37] | [p43<=0 & 0<=p43]]]]] U [~ [[[~ [EG [~ [[[p18<=1 & 1<=p18] | [p6<=0 & 0<=p6]]]]] & [~ [[p39<=1 & 1<=p39]] | E [true U [p7<=1 & 1<=p7]]]] | ~ [EG [~ [[p12<=0 & 0<=p12]]]]]] & ~ [E [true U EG [[[p37<=1 & 1<=p37] | [p43<=0 & 0<=p43]]]]]]]]]]]]]] & ~ [EX [~ [EG [[~ [EG [~ [[~ [EG [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]]]]] U [[[p31<=1 & 1<=p31] | [p29<=0 & 0<=p29]] & ~ [[~ [EG [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]] U [~ [[p42<=1 & 1<=p42]] & ~ [[[p10<=1 & 1<=p10] | [p21<=0 & 0<=p21]]]]]]]]]]]]]]]]]
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (1<=p31)
states: 25
abstracting: (p31<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
..
EG iterations: 2
..
EG iterations: 2
.
EG iterations: 1
.abstracting: (0<=p43)
states: 227
abstracting: (p43<=0)
states: 1
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p12)
states: 227
abstracting: (p12<=0)
states: 171
.
EG iterations: 1
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 227
abstracting: (1<=p39)
states: 1
abstracting: (p39<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 211
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p43)
states: 227
abstracting: (p43<=0)
states: 1
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p43)
states: 227
abstracting: (p43<=0)
states: 1
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
..
EG iterations: 2
EG iterations: 0
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (0<=p30)
states: 227
abstracting: (p30<=0)
states: 202
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (0<=p30)
states: 227
abstracting: (p30<=0)
states: 202
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
abstracting: (1<=p11)
states: 1
abstracting: (p11<=1)
states: 227
abstracting: (0<=p30)
states: 227
abstracting: (p30<=0)
states: 202
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (0<=p24)
states: 227
abstracting: (p24<=0)
states: 226
abstracting: (1<=p33)
states: 16
abstracting: (p33<=1)
states: 227
.
EG iterations: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: [[~ [E [[p39<=0 & 0<=p39] U [AX [[[[p17<=0 & 0<=p17] | [p9<=1 & 1<=p9]] & [[p6<=0 & 0<=p6] | [p19<=1 & 1<=p19]]]] | [[p41<=1 & 1<=p41] | [p8<=1 & 1<=p8]]]]] & AX [[[p35<=1 & 1<=p35] | [[p21<=0 & 0<=p21] | [p13<=1 & 1<=p13]]]]] & [~ [A [EF [EG [[[p6<=0 & 0<=p6] & [p2<=1 & 1<=p2]]]] U ~ [[AG [[[p23<=0 & 0<=p23] | [p17<=1 & 1<=p17]]] | [[p32<=0 & 0<=p32] | [p1<=1 & 1<=p1]]]]]] & [EG [[[p17<=1 & 1<=p17] & [[p2<=0 & 0<=p2] | [p10<=1 & 1<=p10]]]] | EF [AG [[p26<=1 & 1<=p26]]]]]]
normalized: [[[E [true U ~ [E [true U ~ [[p26<=1 & 1<=p26]]]]] | EG [[[[p10<=1 & 1<=p10] | [p2<=0 & 0<=p2]] & [p17<=1 & 1<=p17]]]] & ~ [[~ [EG [[[[p1<=1 & 1<=p1] | [p32<=0 & 0<=p32]] | ~ [E [true U ~ [[[p17<=1 & 1<=p17] | [p23<=0 & 0<=p23]]]]]]]] & ~ [E [[[[p1<=1 & 1<=p1] | [p32<=0 & 0<=p32]] | ~ [E [true U ~ [[[p17<=1 & 1<=p17] | [p23<=0 & 0<=p23]]]]]] U [~ [E [true U EG [[[p2<=1 & 1<=p2] & [p6<=0 & 0<=p6]]]]] & [[[p1<=1 & 1<=p1] | [p32<=0 & 0<=p32]] | ~ [E [true U ~ [[[p17<=1 & 1<=p17] | [p23<=0 & 0<=p23]]]]]]]]]]]] & [~ [EX [~ [[[[p13<=1 & 1<=p13] | [p21<=0 & 0<=p21]] | [p35<=1 & 1<=p35]]]]] & ~ [E [[p39<=0 & 0<=p39] U [[[p8<=1 & 1<=p8] | [p41<=1 & 1<=p41]] | ~ [EX [~ [[[[p19<=1 & 1<=p19] | [p6<=0 & 0<=p6]] & [[p9<=1 & 1<=p9] | [p17<=0 & 0<=p17]]]]]]]]]]]
abstracting: (0<=p17)
states: 227
abstracting: (p17<=0)
states: 202
abstracting: (1<=p9)
states: 1
abstracting: (p9<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 211
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
.abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
abstracting: (1<=p8)
states: 1
abstracting: (p8<=1)
states: 227
abstracting: (0<=p39)
states: 227
abstracting: (p39<=0)
states: 226
abstracting: (1<=p35)
states: 16
abstracting: (p35<=1)
states: 227
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
abstracting: (1<=p13)
states: 9
abstracting: (p13<=1)
states: 227
.abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p32)
states: 227
abstracting: (p32<=0)
states: 202
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (0<=p6)
states: 227
abstracting: (p6<=0)
states: 211
abstracting: (1<=p2)
states: 25
abstracting: (p2<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p32)
states: 227
abstracting: (p32<=0)
states: 202
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (0<=p23)
states: 227
abstracting: (p23<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p32)
states: 227
abstracting: (p32<=0)
states: 202
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p2)
states: 227
abstracting: (p2<=0)
states: 202
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
...
EG iterations: 3
abstracting: (1<=p26)
states: 56
abstracting: (p26<=1)
states: 227
-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: E [[AG [[EF [[p41<=1 & 1<=p41]] & [[p19<=1 & 1<=p19] | [p32<=0 & 0<=p32]]]] | [~ [E [[p15<=1 & 1<=p15] U [[[p18<=0 & 0<=p18] | [p10<=1 & 1<=p10]] & [p14<=1 & 1<=p14]]]] & [[[p41<=0 & 0<=p41] | [[EG [[p21<=0 & 0<=p21]] & [p25<=0 & 0<=p25]] & [~ [[p23<=1 & 1<=p23]] & [EX [[p32<=1 & 1<=p32]] | [[p1<=1 & 1<=p1] | [p43<=1 & 1<=p43]]]]]] & [~ [[[EF [[p35<=1 & 1<=p35]] | [p7<=0 & 0<=p7]] | [[p40<=1 & 1<=p40] | [p20<=1 & 1<=p20]]]] | ~ [EX [0<=0]]]]]] U AF [[[p43<=1 & 1<=p43] & ~ [AF [[p15<=1 & 1<=p15]]]]]]
normalized: E [[[[[~ [EX [0<=0]] | ~ [[[[p20<=1 & 1<=p20] | [p40<=1 & 1<=p40]] | [[p7<=0 & 0<=p7] | E [true U [p35<=1 & 1<=p35]]]]]] & [[[[[[p43<=1 & 1<=p43] | [p1<=1 & 1<=p1]] | EX [[p32<=1 & 1<=p32]]] & ~ [[p23<=1 & 1<=p23]]] & [[p25<=0 & 0<=p25] & EG [[p21<=0 & 0<=p21]]]] | [p41<=0 & 0<=p41]]] & ~ [E [[p15<=1 & 1<=p15] U [[p14<=1 & 1<=p14] & [[p10<=1 & 1<=p10] | [p18<=0 & 0<=p18]]]]]] | ~ [E [true U ~ [[[[p32<=0 & 0<=p32] | [p19<=1 & 1<=p19]] & E [true U [p41<=1 & 1<=p41]]]]]]] U ~ [EG [~ [[EG [~ [[p15<=1 & 1<=p15]]] & [p43<=1 & 1<=p43]]]]]]
abstracting: (1<=p43)
states: 226
abstracting: (p43<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
.
EG iterations: 1
..
EG iterations: 2
abstracting: (1<=p41)
states: 9
abstracting: (p41<=1)
states: 227
abstracting: (1<=p19)
states: 16
abstracting: (p19<=1)
states: 227
abstracting: (0<=p32)
states: 227
abstracting: (p32<=0)
states: 202
abstracting: (0<=p18)
states: 227
abstracting: (p18<=0)
states: 202
abstracting: (1<=p10)
states: 1
abstracting: (p10<=1)
states: 227
abstracting: (1<=p14)
states: 9
abstracting: (p14<=1)
states: 227
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
abstracting: (0<=p41)
states: 227
abstracting: (p41<=0)
states: 218
abstracting: (0<=p21)
states: 227
abstracting: (p21<=0)
states: 211
.
EG iterations: 1
abstracting: (0<=p25)
states: 227
abstracting: (p25<=0)
states: 226
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
abstracting: (1<=p32)
states: 25
abstracting: (p32<=1)
states: 227
.abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (1<=p43)
states: 226
abstracting: (p43<=1)
states: 227
abstracting: (1<=p35)
states: 16
abstracting: (p35<=1)
states: 227
abstracting: (0<=p7)
states: 227
abstracting: (p7<=0)
states: 211
abstracting: (1<=p40)
states: 56
abstracting: (p40<=1)
states: 227
abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
abstracting: (0<=0)
states: 227
.-> the formula is TRUE
FORMULA StigmergyElection-PT-03a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: E [A [[~ [AG [AF [[[p20<=0 & 0<=p20] | [p15<=1 & 1<=p15]]]]] & [[p8<=0 & 0<=p8] | [p23<=1 & 1<=p23]]] U EG [EF [EX [[p13<=1 & 1<=p13]]]]] U A [[[p17<=1 & 1<=p17] & AF [[[[[p3<=0 & 0<=p3] | [p34<=1 & 1<=p34]] & [p19<=0 & 0<=p19]] | EX [[p42<=1 & 1<=p42]]]]] U [AX [[[[p29<=0 & 0<=p29] | [p20<=1 & 1<=p20]] & [[p28<=0 & 0<=p28] | [p16<=1 & 1<=p16]]]] & [[p22<=1 & 1<=p22] & [[AX [[p18<=1 & 1<=p18]] | EG [[p42<=1 & 1<=p42]]] | [~ [[[p1<=1 & 1<=p1] | [[p25<=0 & 0<=p25] | [p37<=1 & 1<=p37]]]] | [[p0<=0 & 0<=p0] | [p17<=1 & 1<=p17]]]]]]]]
normalized: E [[~ [EG [~ [EG [E [true U EX [[p13<=1 & 1<=p13]]]]]]] & ~ [E [~ [EG [E [true U EX [[p13<=1 & 1<=p13]]]]] U [~ [[[[p23<=1 & 1<=p23] | [p8<=0 & 0<=p8]] & E [true U EG [~ [[[p15<=1 & 1<=p15] | [p20<=0 & 0<=p20]]]]]]] & ~ [EG [E [true U EX [[p13<=1 & 1<=p13]]]]]]]]] U [~ [EG [~ [[[[[[[p17<=1 & 1<=p17] | [p0<=0 & 0<=p0]] | ~ [[[[p37<=1 & 1<=p37] | [p25<=0 & 0<=p25]] | [p1<=1 & 1<=p1]]]] | [EG [[p42<=1 & 1<=p42]] | ~ [EX [~ [[p18<=1 & 1<=p18]]]]]] & [p22<=1 & 1<=p22]] & ~ [EX [~ [[[[p16<=1 & 1<=p16] | [p28<=0 & 0<=p28]] & [[p20<=1 & 1<=p20] | [p29<=0 & 0<=p29]]]]]]]]]] & ~ [E [~ [[[[[[[p17<=1 & 1<=p17] | [p0<=0 & 0<=p0]] | ~ [[[[p37<=1 & 1<=p37] | [p25<=0 & 0<=p25]] | [p1<=1 & 1<=p1]]]] | [EG [[p42<=1 & 1<=p42]] | ~ [EX [~ [[p18<=1 & 1<=p18]]]]]] & [p22<=1 & 1<=p22]] & ~ [EX [~ [[[[p16<=1 & 1<=p16] | [p28<=0 & 0<=p28]] & [[p20<=1 & 1<=p20] | [p29<=0 & 0<=p29]]]]]]]] U [~ [[~ [EG [~ [[EX [[p42<=1 & 1<=p42]] | [[p19<=0 & 0<=p19] & [[p34<=1 & 1<=p34] | [p3<=0 & 0<=p3]]]]]]] & [p17<=1 & 1<=p17]]] & ~ [[[[[[[p17<=1 & 1<=p17] | [p0<=0 & 0<=p0]] | ~ [[[[p37<=1 & 1<=p37] | [p25<=0 & 0<=p25]] | [p1<=1 & 1<=p1]]]] | [EG [[p42<=1 & 1<=p42]] | ~ [EX [~ [[p18<=1 & 1<=p18]]]]]] & [p22<=1 & 1<=p22]] & ~ [EX [~ [[[[p16<=1 & 1<=p16] | [p28<=0 & 0<=p28]] & [[p20<=1 & 1<=p20] | [p29<=0 & 0<=p29]]]]]]]]]]]]]
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
.abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
......
EG iterations: 6
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (0<=p25)
states: 227
abstracting: (p25<=0)
states: 226
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p3)
states: 227
abstracting: (p3<=0)
states: 202
abstracting: (1<=p34)
states: 16
abstracting: (p34<=1)
states: 227
abstracting: (0<=p19)
states: 227
abstracting: (p19<=0)
states: 211
abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
...
EG iterations: 2
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
.abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
......
EG iterations: 6
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (0<=p25)
states: 227
abstracting: (p25<=0)
states: 226
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
abstracting: (0<=p29)
states: 227
abstracting: (p29<=0)
states: 202
abstracting: (1<=p20)
states: 16
abstracting: (p20<=1)
states: 227
abstracting: (0<=p28)
states: 227
abstracting: (p28<=0)
states: 218
abstracting: (1<=p16)
states: 25
abstracting: (p16<=1)
states: 227
.abstracting: (1<=p22)
states: 1
abstracting: (p22<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p42)
states: 9
abstracting: (p42<=1)
states: 227
......
EG iterations: 6
abstracting: (1<=p1)
states: 25
abstracting: (p1<=1)
states: 227
abstracting: (0<=p25)
states: 227
abstracting: (p25<=0)
states: 226
abstracting: (1<=p37)
states: 1
abstracting: (p37<=1)
states: 227
abstracting: (0<=p0)
states: 227
abstracting: (p0<=0)
states: 226
abstracting: (1<=p17)
states: 25
abstracting: (p17<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p13)
states: 9
abstracting: (p13<=1)
states: 227
........
EG iterations: 7
abstracting: (0<=p20)
states: 227
abstracting: (p20<=0)
states: 211
abstracting: (1<=p15)
states: 25
abstracting: (p15<=1)
states: 227
..
EG iterations: 2
abstracting: (0<=p8)
states: 227
abstracting: (p8<=0)
states: 226
abstracting: (1<=p23)
states: 1
abstracting: (p23<=1)
states: 227
abstracting: (1<=p13)
states: 9
abstracting: (p13<=1)
states: 227
........
EG iterations: 7
abstracting: (1<=p13)
states: 9
abstracting: (p13<=1)
states: 227
........
EG iterations: 7
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-03a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
totally nodes used: 71782 (7.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 116749 347547 464296
used/not used/entry size/cache size: 408252 66700612 16 1024MB
basic ops cache: hits/miss/sum: 40872 91187 132059
used/not used/entry size/cache size: 140975 16636241 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: 1599 4565 6164
used/not used/entry size/cache size: 4565 8384043 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 67039528
1 66964
2 2298
3 74
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.166sec
BK_STOP 1679548792193
--------------------
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.000sec
iterations count:1652 (22), effective:71 (0)
initing FirstDep: 0m 0.000sec
iterations count:83 (1), effective:1 (0)
iterations count:84 (1), effective:2 (0)
iterations count:74 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:74 (1), effective:1 (0)
iterations count:101 (1), effective:2 (0)
iterations count:112 (1), effective:1 (0)
iterations count:838 (11), effective:37 (0)
iterations count:73 (1), effective:0 (0)
iterations count:75 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:74 (1), effective:1 (0)
iterations count:83 (1), effective:1 (0)
iterations count:926 (12), effective:37 (0)
iterations count:948 (12), effective:38 (0)
iterations count:869 (11), effective:37 (0)
iterations count:918 (12), effective:37 (0)
iterations count:869 (11), effective:37 (0)
iterations count:918 (12), effective:37 (0)
iterations count:882 (12), effective:35 (0)
iterations count:869 (11), effective:37 (0)
iterations count:918 (12), effective:37 (0)
iterations count:74 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
iterations count:291 (3), effective:8 (0)
iterations count:73 (1), effective:0 (0)
iterations count:73 (1), effective:0 (0)
iterations count:73 (1), effective:0 (0)
iterations count:73 (1), effective:0 (0)
iterations count:870 (11), effective:37 (0)
iterations count:158 (2), effective:5 (0)
iterations count:894 (12), effective:37 (0)
iterations count:949 (13), effective:40 (0)
iterations count:894 (12), effective:37 (0)
iterations count:948 (12), effective:38 (0)
iterations count:894 (12), effective:37 (0)
iterations count:603 (8), effective:25 (0)
iterations count:943 (12), effective:38 (0)
iterations count:84 (1), effective:2 (0)
iterations count:123 (1), effective:3 (0)
iterations count:73 (1), effective:0 (0)
iterations count:870 (11), effective:37 (0)
iterations count:73 (1), effective:0 (0)
iterations count:74 (1), effective:1 (0)
iterations count:83 (1), effective:1 (0)
iterations count:985 (13), effective:39 (0)
iterations count:83 (1), effective:1 (0)
iterations count:948 (12), effective:38 (0)
iterations count:83 (1), effective:1 (0)
iterations count:73 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-03a"
export BK_EXAMINATION="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-03a, 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-167912650500569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03a.tgz
mv StigmergyElection-PT-03a execution
cd execution
if [ "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 '
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 ;