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-167912650600686.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650600686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 16:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 16:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 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 50M 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-10a-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679601965606

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 20:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 20:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:06:11] [INFO ] Load time of PNML (sax parser for PT used): 2836 ms
[2023-03-23 20:06:11] [INFO ] Transformed 142 places.
[2023-03-23 20:06:11] [INFO ] Transformed 50162 transitions.
[2023-03-23 20:06:11] [INFO ] Found NUPN structural information;
[2023-03-23 20:06:11] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 3249 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 1712 ms. (steps per millisecond=5 ) properties (out of 13) seen :9
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 20:06:15] [INFO ] Flow matrix only has 2208 transitions (discarded 30 similar events)
// Phase 1: matrix 2208 rows 142 cols
[2023-03-23 20:06:15] [INFO ] Computed 11 place invariants in 47 ms
[2023-03-23 20:06:16] [INFO ] After 404ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 20:06:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-23 20:06:17] [INFO ] After 873ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-23 20:06:17] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2023-03-23 20:06:18] [INFO ] After 623ms SMT Verify possible using 2095 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2023-03-23 20:06:19] [INFO ] Deduced a trap composed of 12 places in 983 ms of which 12 ms to minimize.
[2023-03-23 20:06:20] [INFO ] Deduced a trap composed of 13 places in 1117 ms of which 1 ms to minimize.
[2023-03-23 20:06:21] [INFO ] Deduced a trap composed of 12 places in 866 ms of which 2 ms to minimize.
[2023-03-23 20:06:21] [INFO ] Deduced a trap composed of 13 places in 613 ms of which 1 ms to minimize.
[2023-03-23 20:06:22] [INFO ] Deduced a trap composed of 12 places in 506 ms of which 1 ms to minimize.
[2023-03-23 20:06:23] [INFO ] Deduced a trap composed of 13 places in 476 ms of which 1 ms to minimize.
[2023-03-23 20:06:23] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-23 20:06:24] [INFO ] Deduced a trap composed of 13 places in 478 ms of which 1 ms to minimize.
[2023-03-23 20:06:24] [INFO ] Deduced a trap composed of 12 places in 398 ms of which 1 ms to minimize.
[2023-03-23 20:06:25] [INFO ] Deduced a trap composed of 12 places in 557 ms of which 1 ms to minimize.
[2023-03-23 20:06:25] [INFO ] Deduced a trap composed of 12 places in 568 ms of which 1 ms to minimize.
[2023-03-23 20:06:26] [INFO ] Deduced a trap composed of 13 places in 520 ms of which 1 ms to minimize.
[2023-03-23 20:06:27] [INFO ] Deduced a trap composed of 12 places in 612 ms of which 1 ms to minimize.
[2023-03-23 20:06:27] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-23 20:06:28] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 0 ms to minimize.
[2023-03-23 20:06:28] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2023-03-23 20:06:29] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 1 ms to minimize.
[2023-03-23 20:06:29] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2023-03-23 20:06:29] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2023-03-23 20:06:29] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 11581 ms
[2023-03-23 20:06:30] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-23 20:06:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-23 20:06:30] [INFO ] After 12702ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-23 20:06:30] [INFO ] After 14132ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 42 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Graph (complete) has 501 edges and 142 vertex of which 136 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.37 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 136 transition count 2195
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 14 rules applied. Total rules applied 52 place count 130 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 59 place count 128 transition count 2182
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 69 place count 123 transition count 2177
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 69 place count 123 transition count 2164
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 95 place count 110 transition count 2164
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 105 place count 100 transition count 2154
Iterating global reduction 4 with 10 rules applied. Total rules applied 115 place count 100 transition count 2154
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 119 place count 96 transition count 2148
Iterating global reduction 4 with 4 rules applied. Total rules applied 123 place count 96 transition count 2148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 96 transition count 2147
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 125 place count 95 transition count 2146
Iterating global reduction 5 with 1 rules applied. Total rules applied 126 place count 95 transition count 2146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 95 transition count 2145
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 141 place count 88 transition count 2138
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 145 place count 84 transition count 2134
Iterating global reduction 6 with 4 rules applied. Total rules applied 149 place count 84 transition count 2134
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 157 place count 84 transition count 2126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 161 place count 82 transition count 2124
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 82 transition count 2124
Applied a total of 163 rules in 2776 ms. Remains 82 /142 variables (removed 60) and now considering 2124/2238 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2778 ms. Remains : 82/142 places, 2124/2238 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1657 ms. (steps per millisecond=6 ) properties (out of 2) seen :1
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2124 rows 82 cols
[2023-03-23 20:06:34] [INFO ] Computed 11 place invariants in 25 ms
[2023-03-23 20:06:34] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 20:06:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-23 20:06:35] [INFO ] After 618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 20:06:36] [INFO ] State equation strengthened by 2086 read => feed constraints.
[2023-03-23 20:06:37] [INFO ] After 408ms SMT Verify possible using 2086 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 20:06:38] [INFO ] Deduced a trap composed of 5 places in 994 ms of which 1 ms to minimize.
[2023-03-23 20:06:38] [INFO ] Deduced a trap composed of 7 places in 662 ms of which 1 ms to minimize.
[2023-03-23 20:06:39] [INFO ] Deduced a trap composed of 5 places in 751 ms of which 0 ms to minimize.
[2023-03-23 20:06:40] [INFO ] Deduced a trap composed of 5 places in 648 ms of which 1 ms to minimize.
[2023-03-23 20:06:41] [INFO ] Deduced a trap composed of 10 places in 555 ms of which 1 ms to minimize.
[2023-03-23 20:06:41] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 1 ms to minimize.
[2023-03-23 20:06:42] [INFO ] Deduced a trap composed of 6 places in 633 ms of which 0 ms to minimize.
[2023-03-23 20:06:43] [INFO ] Deduced a trap composed of 8 places in 643 ms of which 1 ms to minimize.
[2023-03-23 20:06:43] [INFO ] Deduced a trap composed of 8 places in 576 ms of which 1 ms to minimize.
[2023-03-23 20:06:44] [INFO ] Deduced a trap composed of 8 places in 444 ms of which 0 ms to minimize.
[2023-03-23 20:06:44] [INFO ] Deduced a trap composed of 7 places in 398 ms of which 1 ms to minimize.
[2023-03-23 20:06:45] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 0 ms to minimize.
[2023-03-23 20:06:45] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 2 ms to minimize.
[2023-03-23 20:06:45] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 6 ms to minimize.
[2023-03-23 20:06:45] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 2 ms to minimize.
[2023-03-23 20:06:46] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 8853 ms
[2023-03-23 20:06:46] [INFO ] After 9334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-23 20:06:46] [INFO ] After 11227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=9 )
FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
All properties solved without resorting to model-checking.
Total runtime 37672 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyElection_PT_10a
(NrP: 142 NrTr: 50162 NrArc: 999212)

parse formulas
formulas created successfully
place and transition orderings generation:0m27.517sec

net check time: 0m 0.157sec

init dd package: 0m 3.336sec


RS generation: 0m53.496sec


-> reachability set: #nodes 230207 (2.3e+05) #states 10,873,289 (7)



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

checking: AG [~ [1<=p15]]
normalized: ~ [E [true U 1<=p15]]

abstracting: (1<=p15)
states: 1,953,125 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.147sec

checking: EF [1<=p104]
normalized: E [true U 1<=p104]

abstracting: (1<=p104)
states: 262,144 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.993sec

checking: EF [1<=p122]
normalized: E [true U 1<=p122]

abstracting: (1<=p122)
states: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.662sec

checking: AG [~ [[~ [p8<=0] | 1<=p90]]]
normalized: ~ [E [true U [1<=p90 | ~ [p8<=0]]]]

abstracting: (p8<=0)
states: 10,873,288 (7)
abstracting: (1<=p90)
states: 262,144 (5)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.971sec

checking: AG [[p73<=1 | p98<=p84]]
normalized: ~ [E [true U ~ [[p73<=1 | p98<=p84]]]]

abstracting: (p98<=p84)
states: 10,860,167 (7)
abstracting: (p73<=1)
states: 10,873,289 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.394sec

checking: AG [[p51<=1 | ~ [[~ [p76<=p26] | 1<=p21]]]]
normalized: ~ [E [true U ~ [[p51<=1 | ~ [[1<=p21 | ~ [p76<=p26]]]]]]]

abstracting: (p76<=p26)
states: 10,676,681 (7)
abstracting: (1<=p21)
states: 262,144 (5)
abstracting: (p51<=1)
states: 10,873,289 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.430sec

checking: EF [[[1<=p101 | 1<=p89] & p101<=p128]]
normalized: E [true U [p101<=p128 & [1<=p101 | 1<=p89]]]

abstracting: (1<=p89)
states: 262,144 (5)
abstracting: (1<=p101)
states: 1,953,125 (6)
abstracting: (p101<=p128)
states: 9,310,789 (6)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.939sec

checking: AG [[~ [[1<=p137 | ~ [[p119<=p17 | 1<=p60]]]] & p25<=1]]
normalized: ~ [E [true U ~ [[~ [[~ [[p119<=p17 | 1<=p60]] | 1<=p137]] & p25<=1]]]]

abstracting: (p25<=1)
states: 10,873,289 (7)
abstracting: (1<=p137)
states: 1
abstracting: (1<=p60)
states: 1,953,125 (6)
abstracting: (p119<=p17)
states: 10,611,145 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.862sec

checking: AG [[[p5<=1 | [p106<=0 | [[[[[[1<=p32 | p44<=0] | 1<=p4] | [~ [1<=p125] & [p30<=0 & p73<=p85]]] & [p14<=1 & ~ [p62<=p90]]] | p128<=p48] & [~ [[[p12<=p130 & p83<=1] & ~ [1<=p80]]] | ~ [p109<=1]]]]] & p33<=p37]]
normalized: ~ [E [true U ~ [[p33<=p37 & [p5<=1 | [p106<=0 | [[~ [p109<=1] | ~ [[~ [1<=p80] & [p12<=p130 & p83<=1]]]] & [p128<=p48 | [[p14<=1 & ~ [p62<=p90]] & [[[p30<=0 & p73<=p85] & ~ [1<=p125]] | [1<=p4 | [1<=p32 | p44<=0]]]]]]]]]]]]

abstracting: (p44<=0)
states: 8,920,164 (6)
abstracting: (1<=p32)
states: 1,953,125 (6)
abstracting: (1<=p4)
states: 1,953,125 (6)
abstracting: (1<=p125)
states: 19,683 (4)
abstracting: (p73<=p85)
states: 9,310,789 (6)
abstracting: (p30<=0)
states: 8,920,164 (6)
abstracting: (p62<=p90)
states: 10,676,681 (7)
abstracting: (p14<=1)
states: 10,873,289 (7)
abstracting: (p128<=p48)
states: 8,920,164 (6)
abstracting: (p83<=1)
states: 10,873,289 (7)
abstracting: (p12<=p130)
states: 9,028,928 (6)
abstracting: (1<=p80)
states: 1
abstracting: (p109<=1)
states: 10,873,289 (7)
abstracting: (p106<=0)
states: 10,873,288 (7)
abstracting: (p5<=1)
states: 10,873,289 (7)
abstracting: (p33<=p37)
states: 10,611,145 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.113sec

checking: EF [[[~ [1<=p6] & [[1<=p25 & 1<=p110] & [[[[[[p26<=0 | p70<=p60] | ~ [p125<=0]] & [~ [1<=p123] & ~ [1<=p94]]] | p99<=p64] | [~ [p13<=p104] & [[[1<=p6 & p25<=p57] & [1<=p54 & 1<=p9]] | p131<=p2]]] & p38<=p4]]] & 1<=p111]]
normalized: E [true U [1<=p111 & [[[p38<=p4 & [[[p131<=p2 | [[1<=p54 & 1<=p9] & [1<=p6 & p25<=p57]]] & ~ [p13<=p104]] | [p99<=p64 | [[~ [1<=p94] & ~ [1<=p123]] & [~ [p125<=0] | [p26<=0 | p70<=p60]]]]]] & [1<=p25 & 1<=p110]] & ~ [1<=p6]]]]

abstracting: (1<=p6)
states: 262,144 (5)
abstracting: (1<=p110)
states: 2,234,986 (6)
abstracting: (1<=p25)
states: 1
abstracting: (p70<=p60)
states: 10,853,606 (7)
abstracting: (p26<=0)
states: 8,638,303 (6)
abstracting: (p125<=0)
states: 10,853,606 (7)
abstracting: (1<=p123)
states: 1
abstracting: (1<=p94)
states: 1
abstracting: (p99<=p64)
states: 8,920,164 (6)
abstracting: (p13<=p104)
states: 10,853,606 (7)
abstracting: (p25<=p57)
states: 10,873,288 (7)
abstracting: (1<=p6)
states: 262,144 (5)
abstracting: (1<=p9)
states: 1
abstracting: (1<=p54)
states: 2,234,986 (6)
abstracting: (p131<=p2)
states: 10,611,145 (7)
abstracting: (p38<=p4)
states: 10,873,288 (7)
abstracting: (1<=p111)
states: 19,683 (4)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.409sec

checking: EF [[1<=p62 & ~ [[[~ [[[1<=p100 | ~ [p95<=0]] | ~ [p42<=p96]]] & [[~ [[~ [p68<=p19] & [p136<=0 | p138<=0]]] | [[p84<=1 | ~ [p124<=p138]] & [[p130<=0 | p118<=1] & [1<=p72 & p131<=p127]]]] | [[[[p119<=1 | p113<=p56] | [1<=p56 & p124<=1]] & 1<=p40] | ~ [[1<=p17 & ~ [p47<=0]]]]]] & [1<=p53 & [~ [[p103<=1 | ~ [p0<=p112]]] | [~ [[1<=p39 | 1<=p26]] & p106<=p90]]]]]]]
normalized: E [true U [1<=p62 & ~ [[[1<=p53 & [[p106<=p90 & ~ [[1<=p39 | 1<=p26]]] | ~ [[p103<=1 | ~ [p0<=p112]]]]] & [[[~ [[1<=p17 & ~ [p47<=0]]] | [1<=p40 & [[1<=p56 & p124<=1] | [p119<=1 | p113<=p56]]]] | [[[[1<=p72 & p131<=p127] & [p130<=0 | p118<=1]] & [p84<=1 | ~ [p124<=p138]]] | ~ [[[p136<=0 | p138<=0] & ~ [p68<=p19]]]]] & ~ [[~ [p42<=p96] | [1<=p100 | ~ [p95<=0]]]]]]]]]

abstracting: (p95<=0)
states: 10,873,288 (7)
abstracting: (1<=p100)
states: 1,953,125 (6)
abstracting: (p42<=p96)
states: 10,860,167 (7)
abstracting: (p68<=p19)
states: 8,703,839 (6)
abstracting: (p138<=0)
states: 8,638,303 (6)
abstracting: (p136<=0)
states: 10,873,288 (7)
abstracting: (p124<=p138)
states: 9,101,055 (6)
abstracting: (p84<=1)
states: 10,873,289 (7)
abstracting: (p118<=1)
states: 10,873,289 (7)
abstracting: (p130<=0)
states: 8,920,164 (6)
abstracting: (p131<=p127)
states: 10,611,145 (7)
abstracting: (1<=p72)
states: 1,953,125 (6)
abstracting: (p113<=p56)
states: 8,920,164 (6)
abstracting: (p119<=1)
states: 10,873,289 (7)
abstracting: (p124<=1)
states: 10,873,289 (7)
abstracting: (1<=p56)
states: 19,683 (4)
abstracting: (1<=p40)
states: 2,234,986 (6)
abstracting: (p47<=0)
states: 10,611,145 (7)
abstracting: (1<=p17)
states: 1,953,125 (6)
abstracting: (p0<=p112)
states: 10,873,288 (7)
abstracting: (p103<=1)
states: 10,873,289 (7)
abstracting: (1<=p26)
states: 2,234,986 (6)
abstracting: (1<=p39)
states: 1
abstracting: (p106<=p90)
states: 10,873,288 (7)
abstracting: (1<=p53)
states: 1
abstracting: (1<=p62)
states: 262,144 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.031sec

checking: AG [[[[[p60<=p43 | [p60<=0 | [~ [p14<=p3] & ~ [p31<=p81]]]] & ~ [p88<=1]] & [1<=p45 & [[[[~ [[p53<=0 | 1<=p82]] & [[p38<=p11 & 1<=p98] & p61<=0]] & [[[1<=p2 & 1<=p105] | [p137<=p31 & p29<=1]] & [[p109<=1 & p76<=p90] & [1<=p117 & p36<=p91]]]] & ~ [[~ [[1<=p19 & p10<=p129]] & ~ [1<=p11]]]] | p125<=p120]]] | p113<=1]]
normalized: ~ [E [true U ~ [[p113<=1 | [[1<=p45 & [p125<=p120 | [~ [[~ [1<=p11] & ~ [[1<=p19 & p10<=p129]]]] & [[[[1<=p117 & p36<=p91] & [p109<=1 & p76<=p90]] & [[p137<=p31 & p29<=1] | [1<=p2 & 1<=p105]]] & [[p61<=0 & [p38<=p11 & 1<=p98]] & ~ [[p53<=0 | 1<=p82]]]]]]] & [~ [p88<=1] & [p60<=p43 | [p60<=0 | [~ [p31<=p81] & ~ [p14<=p3]]]]]]]]]]

abstracting: (p14<=p3)
states: 10,853,606 (7)
abstracting: (p31<=p81)
states: 8,920,164 (6)
abstracting: (p60<=0)
states: 8,920,164 (6)
abstracting: (p60<=p43)
states: 9,310,789 (6)
abstracting: (p88<=1)
states: 10,873,289 (7)
abstracting: (1<=p82)
states: 2,234,986 (6)
abstracting: (p53<=0)
states: 10,873,288 (7)
abstracting: (1<=p98)
states: 19,683 (4)
abstracting: (p38<=p11)
states: 10,873,288 (7)
abstracting: (p61<=0)
states: 10,611,145 (7)
abstracting: (1<=p105)
states: 262,144 (5)
abstracting: (1<=p2)
states: 1,953,125 (6)
abstracting: (p29<=1)
states: 10,873,289 (7)
abstracting: (p137<=p31)
states: 10,873,288 (7)
abstracting: (p76<=p90)
states: 10,676,681 (7)
abstracting: (p109<=1)
states: 10,873,289 (7)
abstracting: (p36<=p91)
states: 10,873,288 (7)
abstracting: (1<=p117)
states: 262,144 (5)
abstracting: (p10<=p129)
states: 10,873,288 (7)
abstracting: (1<=p19)
states: 262,144 (5)
abstracting: (1<=p11)
states: 1
abstracting: (p125<=p120)
states: 10,853,606 (7)
abstracting: (1<=p45)
states: 1,953,125 (6)
abstracting: (p113<=1)
states: 10,873,289 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.668sec

checking: EF [[[p76<=1 & p41<=1] & [[p23<=p52 & [~ [p47<=0] & ~ [[[[[1<=p2 & 1<=p96] & [p82<=0 | 1<=p42]] & [p102<=1 | [p13<=0 & 1<=p117]]] & p87<=0]]]] & [~ [[[[~ [[p53<=0 & p46<=0]] & ~ [[1<=p55 & p129<=1]]] & 1<=p17] & [[p35<=p13 & [[1<=p121 | p118<=p69] & [p37<=p113 | p46<=p49]]] & [~ [[p107<=p111 & 1<=p46]] | [p111<=0 & p121<=1]]]]] & ~ [[~ [[[~ [1<=p108] | [p63<=p39 | p102<=1]] | [[p8<=p93 | p136<=p46] | p51<=1]]] & p64<=p112]]]]]]
normalized: E [true U [[[~ [[p64<=p112 & ~ [[[p51<=1 | [p8<=p93 | p136<=p46]] | [[p63<=p39 | p102<=1] | ~ [1<=p108]]]]]] & ~ [[[[[p111<=0 & p121<=1] | ~ [[p107<=p111 & 1<=p46]]] & [p35<=p13 & [[p37<=p113 | p46<=p49] & [1<=p121 | p118<=p69]]]] & [1<=p17 & [~ [[1<=p55 & p129<=1]] & ~ [[p53<=0 & p46<=0]]]]]]] & [p23<=p52 & [~ [[p87<=0 & [[p102<=1 | [p13<=0 & 1<=p117]] & [[p82<=0 | 1<=p42] & [1<=p2 & 1<=p96]]]]] & ~ [p47<=0]]]] & [p76<=1 & p41<=1]]]

abstracting: (p41<=1)
states: 10,873,289 (7)
abstracting: (p76<=1)
states: 10,873,289 (7)
abstracting: (p47<=0)
states: 10,611,145 (7)
abstracting: (1<=p96)
states: 2,234,986 (6)
abstracting: (1<=p2)
states: 1,953,125 (6)
abstracting: (1<=p42)
states: 19,683 (4)
abstracting: (p82<=0)
states: 8,638,303 (6)
abstracting: (1<=p117)
states: 262,144 (5)
abstracting: (p13<=0)
states: 10,853,606 (7)
abstracting: (p102<=1)
states: 10,873,289 (7)
abstracting: (p87<=0)
states: 8,920,164 (6)
abstracting: (p23<=p52)
states: 10,873,288 (7)
abstracting: (p46<=0)
states: 8,920,164 (6)
abstracting: (p53<=0)
states: 10,873,288 (7)
abstracting: (p129<=1)
states: 10,873,289 (7)
abstracting: (1<=p55)
states: 19,683 (4)
abstracting: (1<=p17)
states: 1,953,125 (6)
abstracting: (p118<=p69)
states: 10,611,145 (7)
abstracting: (1<=p121)
states: 1
abstracting: (p46<=p49)
states: 8,920,164 (6)
abstracting: (p37<=p113)
states: 10,873,288 (7)
abstracting: (p35<=p13)
states: 10,611,145 (7)
abstracting: (1<=p46)
states: 1,953,125 (6)
abstracting: (p107<=p111)
states: 10,873,288 (7)
abstracting: (p121<=1)
states: 10,873,289 (7)
abstracting: (p111<=0)
states: 10,853,606 (7)
abstracting: (1<=p108)
states: 1
abstracting: (p102<=1)
states: 10,873,289 (7)
abstracting: (p63<=p39)
states: 10,611,145 (7)
abstracting: (p136<=p46)
states: 10,873,288 (7)
abstracting: (p8<=p93)
states: 10,873,288 (7)
abstracting: (p51<=1)
states: 10,873,289 (7)
abstracting: (p64<=p112)
states: 10,873,288 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.717sec

checking: EF [[[[[~ [[[[1<=p127 & p132<=0] & [~ [1<=p43] & [p88<=1 | 1<=p110]]] & 1<=p140]] & [p30<=p31 | ~ [[[1<=p72 & p123<=0] & p95<=1]]]] & [[[~ [1<=p50] | p45<=p37] & p99<=1] & [~ [[p4<=0 & p130<=0]] & [p31<=0 | ~ [[p127<=0 | p31<=0]]]]]] | p78<=p15] & [[~ [[[1<=p62 | [~ [1<=p44] | ~ [p140<=p85]]] & 1<=p96]] & [[[1<=p85 & [~ [1<=p111] & [[p138<=p70 | p63<=p107] & ~ [p58<=p88]]]] | ~ [[[[p133<=p138 & 1<=p6] | 1<=p113] | [~ [1<=p96] | p128<=0]]]] & ~ [[~ [[[1<=p106 | p118<=0] & p115<=p87]] | 1<=p135]]]] & p133<=1]]]
normalized: E [true U [[p78<=p15 | [[~ [[1<=p140 & [[[p88<=1 | 1<=p110] & ~ [1<=p43]] & [1<=p127 & p132<=0]]]] & [p30<=p31 | ~ [[p95<=1 & [1<=p72 & p123<=0]]]]] & [[[p31<=0 | ~ [[p127<=0 | p31<=0]]] & ~ [[p4<=0 & p130<=0]]] & [p99<=1 & [p45<=p37 | ~ [1<=p50]]]]]] & [p133<=1 & [[[~ [[[1<=p113 | [p133<=p138 & 1<=p6]] | [p128<=0 | ~ [1<=p96]]]] | [1<=p85 & [[~ [p58<=p88] & [p138<=p70 | p63<=p107]] & ~ [1<=p111]]]] & ~ [[1<=p135 | ~ [[p115<=p87 & [1<=p106 | p118<=0]]]]]] & ~ [[1<=p96 & [1<=p62 | [~ [p140<=p85] | ~ [1<=p44]]]]]]]]]

abstracting: (1<=p44)
states: 1,953,125 (6)
abstracting: (p140<=p85)
states: 10,853,606 (7)
abstracting: (1<=p62)
states: 262,144 (5)
abstracting: (1<=p96)
states: 2,234,986 (6)
abstracting: (p118<=0)
states: 10,611,145 (7)
abstracting: (1<=p106)
states: 1
abstracting: (p115<=p87)
states: 9,310,789 (6)
abstracting: (1<=p135)
states: 1
abstracting: (1<=p111)
states: 19,683 (4)
abstracting: (p63<=p107)
states: 10,611,145 (7)
abstracting: (p138<=p70)
states: 8,644,864 (6)
abstracting: (p58<=p88)
states: 9,310,789 (6)
abstracting: (1<=p85)
states: 1,953,125 (6)
abstracting: (1<=p96)
states: 2,234,986 (6)
abstracting: (p128<=0)
states: 8,920,164 (6)
abstracting: (1<=p6)
states: 262,144 (5)
abstracting: (p133<=p138)
states: 10,611,145 (7)
abstracting: (1<=p113)
states: 1,953,125 (6)
abstracting: (p133<=1)
states: 10,873,289 (7)
abstracting: (1<=p50)
states: 1
abstracting: (p45<=p37)
states: 8,920,164 (6)
abstracting: (p99<=1)
states: 10,873,289 (7)
abstracting: (p130<=0)
states: 8,920,164 (6)
abstracting: (p4<=0)
states: 8,920,164 (6)
abstracting: (p31<=0)
states: 8,920,164 (6)
abstracting: (p127<=0)
states: 8,920,164 (6)
abstracting: (p31<=0)
states: 8,920,164 (6)
abstracting: (p123<=0)
states: 10,873,288 (7)
abstracting: (1<=p72)
states: 1,953,125 (6)
abstracting: (p95<=1)
states: 10,873,289 (7)
abstracting: (p30<=p31)
states: 8,920,164 (6)
abstracting: (p132<=0)
states: 10,611,145 (7)
abstracting: (1<=p127)
states: 1,953,125 (6)
abstracting: (1<=p43)
states: 1,953,125 (6)
abstracting: (1<=p110)
states: 2,234,986 (6)
abstracting: (p88<=1)
states: 10,873,289 (7)
abstracting: (1<=p140)
states: 19,683 (4)
abstracting: (p78<=p15)
states: 10,873,288 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.743sec

checking: EF [[p74<=p48 & [[~ [[p122<=p28 | ~ [1<=p116]]] & [[p90<=0 | p77<=p40] & [[p27<=0 | [~ [[p87<=0 & 1<=p86]] & ~ [1<=p26]]] | ~ [p4<=1]]]] & [1<=p86 | [[[[[p1<=0 | [1<=p121 | p55<=1]] & [p16<=1 | 1<=p16]] | [[[p27<=p139 & 1<=p12] | p97<=p65] | [~ [1<=p80] & p93<=p50]]] & [[~ [p59<=0] | 1<=p117] | p88<=1]] | ~ [[[[1<=p139 | [1<=p4 | p136<=p110]] & [1<=p67 | [p39<=p80 | p102<=0]]] | [[[p84<=p85 & p109<=p65] & [p68<=1 | p51<=1]] & [[p113<=p45 | p66<=p115] & [p15<=p140 | 1<=p4]]]]]]]]]]
normalized: E [true U [p74<=p48 & [[1<=p86 | [[[[[p93<=p50 & ~ [1<=p80]] | [p97<=p65 | [p27<=p139 & 1<=p12]]] | [[p16<=1 | 1<=p16] & [p1<=0 | [1<=p121 | p55<=1]]]] & [p88<=1 | [1<=p117 | ~ [p59<=0]]]] | ~ [[[[[p15<=p140 | 1<=p4] & [p113<=p45 | p66<=p115]] & [[p68<=1 | p51<=1] & [p84<=p85 & p109<=p65]]] | [[1<=p67 | [p39<=p80 | p102<=0]] & [1<=p139 | [1<=p4 | p136<=p110]]]]]]] & [[[~ [p4<=1] | [p27<=0 | [~ [1<=p26] & ~ [[p87<=0 & 1<=p86]]]]] & [p90<=0 | p77<=p40]] & ~ [[p122<=p28 | ~ [1<=p116]]]]]]]

abstracting: (1<=p116)
states: 1,953,125 (6)
abstracting: (p122<=p28)
states: 10,873,288 (7)
abstracting: (p77<=p40)
states: 10,676,681 (7)
abstracting: (p90<=0)
states: 10,611,145 (7)
abstracting: (1<=p86)
states: 1,953,125 (6)
abstracting: (p87<=0)
states: 8,920,164 (6)
abstracting: (1<=p26)
states: 2,234,986 (6)
abstracting: (p27<=0)
states: 10,853,606 (7)
abstracting: (p4<=1)
states: 10,873,289 (7)
abstracting: (p136<=p110)
states: 10,873,289 (7)
abstracting: (1<=p4)
states: 1,953,125 (6)
abstracting: (1<=p139)
states: 19,683 (4)
abstracting: (p102<=0)
states: 8,920,164 (6)
abstracting: (p39<=p80)
states: 10,873,288 (7)
abstracting: (1<=p67)
states: 1
abstracting: (p109<=p65)
states: 10,873,288 (7)
abstracting: (p84<=p85)
states: 10,853,606 (7)
abstracting: (p51<=1)
states: 10,873,289 (7)
abstracting: (p68<=1)
states: 10,873,289 (7)
abstracting: (p66<=p115)
states: 10,873,288 (7)
abstracting: (p113<=p45)
states: 9,310,789 (6)
abstracting: (1<=p4)
states: 1,953,125 (6)
abstracting: (p15<=p140)
states: 8,920,164 (6)
abstracting: (p59<=0)
states: 8,920,164 (6)
abstracting: (1<=p117)
states: 262,144 (5)
abstracting: (p88<=1)
states: 10,873,289 (7)
abstracting: (p55<=1)
states: 10,873,289 (7)
abstracting: (1<=p121)
states: 1
abstracting: (p1<=0)
states: 8,920,164 (6)
abstracting: (1<=p16)
states: 1,953,125 (6)
abstracting: (p16<=1)
states: 10,873,289 (7)
abstracting: (1<=p12)
states: 2,234,986 (6)
abstracting: (p27<=p139)
states: 10,860,167 (7)
abstracting: (p97<=p65)
states: 10,853,606 (7)
abstracting: (1<=p80)
states: 1
abstracting: (p93<=p50)
states: 10,873,288 (7)
abstracting: (1<=p86)
states: 1,953,125 (6)
abstracting: (p74<=p48)
states: 8,920,164 (6)
-> the formula is FALSE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.194sec

checking: EF [[[[~ [[[[[[1<=p70 | p115<=p21] & [p122<=p133 | p83<=p98]] & ~ [[1<=p94 | 1<=p10]]] & [[~ [p101<=0] & ~ [1<=p53]] & [~ [p120<=0] | [1<=p64 | p112<=p50]]]] | 1<=p52]] | ~ [1<=p15]] & ~ [[1<=p91 | [[~ [[p113<=0 | [1<=p55 & p132<=1]]] & p128<=0] & p7<=1]]]] & [[~ [[~ [p117<=p23] & [[[[p60<=p21 & p6<=1] | [p104<=p96 & p8<=1]] & [1<=p105 | [p30<=0 | p74<=0]]] | [p110<=p137 & 1<=p91]]]] | [p57<=p113 | [[[[[p53<=1 & p100<=p118] & ~ [1<=p77]] & [[p10<=p30 | 1<=p19] | [p123<=p19 & 1<=p76]]] | [p31<=p54 & [[p7<=p133 & p3<=1] | [p113<=p69 & p87<=1]]]] | ~ [[[[p1<=0 & p140<=1] | [1<=p109 | p29<=1]] & ~ [1<=p20]]]]]] & 1<=p106]]]
normalized: E [true U [[1<=p106 & [[p57<=p113 | [~ [[~ [1<=p20] & [[1<=p109 | p29<=1] | [p1<=0 & p140<=1]]]] | [[p31<=p54 & [[p113<=p69 & p87<=1] | [p7<=p133 & p3<=1]]] | [[[p123<=p19 & 1<=p76] | [p10<=p30 | 1<=p19]] & [~ [1<=p77] & [p53<=1 & p100<=p118]]]]]] | ~ [[[[p110<=p137 & 1<=p91] | [[1<=p105 | [p30<=0 | p74<=0]] & [[p104<=p96 & p8<=1] | [p60<=p21 & p6<=1]]]] & ~ [p117<=p23]]]]] & [~ [[1<=p91 | [p7<=1 & [p128<=0 & ~ [[p113<=0 | [1<=p55 & p132<=1]]]]]]] & [~ [1<=p15] | ~ [[1<=p52 | [[[[1<=p64 | p112<=p50] | ~ [p120<=0]] & [~ [1<=p53] & ~ [p101<=0]]] & [~ [[1<=p94 | 1<=p10]] & [[p122<=p133 | p83<=p98] & [1<=p70 | p115<=p21]]]]]]]]]]

abstracting: (p115<=p21)
states: 8,920,164 (6)
abstracting: (1<=p70)
states: 19,683 (4)
abstracting: (p83<=p98)
states: 10,860,167 (7)
abstracting: (p122<=p133)
states: 10,873,288 (7)
abstracting: (1<=p10)
states: 1
abstracting: (1<=p94)
states: 1
abstracting: (p101<=0)
states: 8,920,164 (6)
abstracting: (1<=p53)
states: 1
abstracting: (p120<=0)
states: 10,873,288 (7)
abstracting: (p112<=p50)
states: 10,853,606 (7)
abstracting: (1<=p64)
states: 1
abstracting: (1<=p52)
states: 1
abstracting: (1<=p15)
states: 1,953,125 (6)
abstracting: (p132<=1)
states: 10,873,289 (7)
abstracting: (1<=p55)
states: 19,683 (4)
abstracting: (p113<=0)
states: 8,920,164 (6)
abstracting: (p128<=0)
states: 8,920,164 (6)
abstracting: (p7<=1)
states: 10,873,289 (7)
abstracting: (1<=p91)
states: 262,144 (5)
abstracting: (p117<=p23)
states: 10,611,145 (7)
abstracting: (p6<=1)
states: 10,873,289 (7)
abstracting: (p60<=p21)
states: 8,920,164 (6)
abstracting: (p8<=1)
states: 10,873,289 (7)
abstracting: (p104<=p96)
states: 10,676,681 (7)
abstracting: (p74<=0)
states: 8,920,164 (6)
abstracting: (p30<=0)
states: 8,920,164 (6)
abstracting: (1<=p105)
states: 262,144 (5)
abstracting: (1<=p91)
states: 262,144 (5)
abstracting: (p110<=p137)
states: 8,638,304 (6)
abstracting: (p100<=p118)
states: 8,920,164 (6)
abstracting: (p53<=1)
states: 10,873,289 (7)
abstracting: (1<=p77)
states: 262,144 (5)
abstracting: (1<=p19)
states: 262,144 (5)
abstracting: (p10<=p30)
states: 10,873,288 (7)
abstracting: (1<=p76)
states: 262,144 (5)
abstracting: (p123<=p19)
states: 10,873,288 (7)
abstracting: (p3<=1)
states: 10,873,289 (7)
abstracting: (p7<=p133)
states: 10,676,681 (7)
abstracting: (p87<=1)
states: 10,873,289 (7)
abstracting: (p113<=p69)
states: 8,920,164 (6)
abstracting: (p31<=p54)
states: 9,310,789 (6)
abstracting: (p140<=1)
states: 10,873,289 (7)
abstracting: (p1<=0)
states: 8,920,164 (6)
abstracting: (p29<=1)
states: 10,873,289 (7)
abstracting: (1<=p109)
states: 1
abstracting: (1<=p20)
states: 262,144 (5)
abstracting: (p57<=p113)
states: 9,310,789 (6)
abstracting: (1<=p106)
states: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.374sec

totally nodes used: 19370010 (1.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 52752104 200943781 253695885
used/not used/entry size/cache size: 63331150 3777714 16 1024MB
basic ops cache: hits/miss/sum: 19744143 60659730 80403873
used/not used/entry size/cache size: 16578027 199189 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: 750016 2638802 3388818
used/not used/entry size/cache size: 2260794 6127814 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 52137974
1 11506751
2 2698793
3 621959
4 120721
5 19553
6 2686
7 391
8 31
9 4
>= 10 1

Total processing time: 3m46.911sec


BK_STOP 1679602234554

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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.407sec

165328 165419 165555 165748 165847 166005 166087 166158 166314 166538 166827 167025 167313 167399 167634 167940 168176 168184 168541 168758 168776 169065 169066 169251 169541 169590 170110 170714 170738 171251 171263 171891 171936 172380 172887 172904 173375 173380 173888 173926 174438 174497 175048 175575 175598 176221 176261 176788 176828 177382 177420 177970 177996 178594 178673 179123 179184 179681 179772 180241 180268 180761 180810 181319 181380 181841 181882 182397 182402 182329 182353 182452 183525 183614 184734 184846 185904 185940 187136 187162 188297 188321 188393 189479 189545 190703 190713 191802 191819 191938 192898 192937 193970 194007 195113 195131 195117 196066 196111 197209 197226 197261 198230 198271 199374 199379 199362 199484 199528 199815 201627 201775 203793 203836 204137 205979 206015 206249 208139 208305 210344 210368 210488 212494 212540 212904 214838 214864 214928 216710 216797 218904 218917 218980 221032 221047 221248 223360 223378 223388 225160 225175 225408 227488 227505 227564 229488 229503 229644 231817 231822 231805 231408
iterations count:15383642 (306), effective:1784 (0)

initing FirstDep: 0m 0.415sec

218940 222664 225587
iterations count:351055 (6), effective:121 (0)
235237 238702 234546
iterations count:382245 (7), effective:121 (0)
218940 222664 225587
iterations count:351244 (7), effective:121 (0)
237873 238929 235058
iterations count:351186 (7), effective:121 (0)
230207 230207 230207
iterations count:351222 (7), effective:124 (0)
225289 227267 230207
iterations count:325842 (6), effective:120 (0)
230218 230207 230207
iterations count:379708 (7), effective:121 (0)
238131 241440 236082
iterations count:377401 (7), effective:121 (0)
230709 231106 230462
iterations count:376783 (7), effective:121 (0)
218940 222664 225587
iterations count:352149 (7), effective:137 (0)
218940 222664 225587
iterations count:351274 (7), effective:122 (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-10a"
export BK_EXAMINATION="ReachabilityCardinality"
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-10a, examination is ReachabilityCardinality"
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-167912650600686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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