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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7430.340 165972.00 177316.00 7532.40 TFFTTTFTTFTFTTFF 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-167912650500582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyElection-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 117K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679550950826

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-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 05:55:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 05:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 05:55:53] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2023-03-23 05:55:53] [INFO ] Transformed 427 places.
[2023-03-23 05:55:53] [INFO ] Transformed 518 transitions.
[2023-03-23 05:55:53] [INFO ] Found NUPN structural information;
[2023-03-23 05:55:53] [INFO ] Parsed PT model containing 427 places and 518 transitions and 1323 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 172 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 13) seen :5
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :1
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :1
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 518 rows 427 cols
[2023-03-23 05:55:56] [INFO ] Computed 4 place invariants in 39 ms
[2023-03-23 05:55:57] [INFO ] After 945ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 05:55:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 58 ms returned sat
[2023-03-23 05:55:58] [INFO ] After 815ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-23 05:56:00] [INFO ] Deduced a trap composed of 190 places in 1510 ms of which 23 ms to minimize.
[2023-03-23 05:56:00] [INFO ] Deduced a trap composed of 190 places in 248 ms of which 1 ms to minimize.
[2023-03-23 05:56:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1927 ms
[2023-03-23 05:56:01] [INFO ] Deduced a trap composed of 189 places in 430 ms of which 25 ms to minimize.
[2023-03-23 05:56:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 464 ms
[2023-03-23 05:56:01] [INFO ] Deduced a trap composed of 190 places in 219 ms of which 3 ms to minimize.
[2023-03-23 05:56:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 306 ms
[2023-03-23 05:56:02] [INFO ] Deduced a trap composed of 190 places in 531 ms of which 2 ms to minimize.
[2023-03-23 05:56:02] [INFO ] Deduced a trap composed of 190 places in 305 ms of which 1 ms to minimize.
[2023-03-23 05:56:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 945 ms
[2023-03-23 05:56:02] [INFO ] After 4754ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-23 05:56:02] [INFO ] After 5794ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 45 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 518/518 transitions.
Graph (trivial) has 342 edges and 427 vertex of which 42 / 427 are part of one of the 7 SCC in 6 ms
Free SCC test removed 35 places
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 603 edges and 392 vertex of which 386 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 193 rules applied. Total rules applied 195 place count 386 transition count 277
Reduce places removed 190 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 196 rules applied. Total rules applied 391 place count 196 transition count 271
Reduce places removed 3 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 32 rules applied. Total rules applied 423 place count 193 transition count 242
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 452 place count 164 transition count 242
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 452 place count 164 transition count 229
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 478 place count 151 transition count 229
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 499 place count 130 transition count 208
Iterating global reduction 4 with 21 rules applied. Total rules applied 520 place count 130 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 523 place count 130 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 524 place count 129 transition count 205
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 529 place count 124 transition count 174
Iterating global reduction 6 with 5 rules applied. Total rules applied 534 place count 124 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 535 place count 124 transition count 173
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 561 place count 111 transition count 160
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 567 place count 108 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 569 place count 108 transition count 159
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 571 place count 108 transition count 157
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 584 place count 108 transition count 144
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 597 place count 95 transition count 144
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 599 place count 95 transition count 142
Applied a total of 599 rules in 215 ms. Remains 95 /427 variables (removed 332) and now considering 142/518 (removed 376) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 221 ms. Remains : 95/427 places, 142/518 transitions.
Finished random walk after 1864 steps, including 72 resets, run visited all 4 properties in 48 ms. (steps per millisecond=38 )
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10022 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_03b
(NrP: 427 NrTr: 518 NrArc: 1323)

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

net check time: 0m 0.000sec

init dd package: 0m 3.443sec


RS generation: 0m20.759sec


-> reachability set: #nodes 15321 (1.5e+04) #states 18,282,252 (7)



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

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

abstracting: (p283<=1)
states: 18,282,252 (7)
-> the formula is TRUE

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

MC time: 0m 0.003sec

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

abstracting: (p23<=1)
states: 18,282,252 (7)
-> the formula is TRUE

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

MC time: 0m 0.007sec

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

abstracting: (1<=p424)
states: 612,507 (5)
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.852sec

checking: EF [~ [p216<=p238]]
normalized: E [true U ~ [p216<=p238]]

abstracting: (p216<=p238)
states: 18,065,149 (7)
-> the formula is TRUE

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

MC time: 0m13.644sec

checking: EF [~ [p355<=p272]]
normalized: E [true U ~ [p355<=p272]]

abstracting: (p355<=p272)
states: 18,066,235 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.121sec

checking: AG [p285<=p353]
normalized: ~ [E [true U ~ [p285<=p353]]]

abstracting: (p285<=p353)
states: 18,193,317 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.158sec

checking: AG [~ [[1<=p37 & [1<=p46 | p111<=0]]]]
normalized: ~ [E [true U [1<=p37 & [1<=p46 | p111<=0]]]]

abstracting: (p111<=0)
states: 18,211,678 (7)
abstracting: (1<=p46)
states: 217,103 (5)
abstracting: (1<=p37)
states: 101,479 (5)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.439sec

checking: AG [[[p377<=p373 & ~ [1<=p233]] | [1<=p74 | ~ [p376<=p350]]]]
normalized: ~ [E [true U ~ [[[1<=p74 | ~ [p376<=p350]] | [p377<=p373 & ~ [1<=p233]]]]]]

abstracting: (1<=p233)
states: 217,103 (5)
abstracting: (p377<=p373)
states: 18,211,678 (7)
abstracting: (p376<=p350)
states: 18,211,678 (7)
abstracting: (1<=p74)
states: 217,103 (5)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.890sec

checking: EF [[[~ [1<=p10] | [p274<=p76 & [p276<=p218 & [p416<=p94 | ~ [p386<=0]]]]] & ~ [[p71<=p371 & p49<=p134]]]]
normalized: E [true U [~ [[p71<=p371 & p49<=p134]] & [[p274<=p76 & [p276<=p218 & [p416<=p94 | ~ [p386<=0]]]] | ~ [1<=p10]]]]

abstracting: (1<=p10)
states: 88,935 (4)
abstracting: (p386<=0)
states: 18,191,198 (7)
abstracting: (p416<=p94)
states: 17,449,660 (7)
abstracting: (p276<=p218)
states: 18,194,472 (7)
abstracting: (p274<=p76)
states: 18,194,472 (7)
abstracting: (p49<=p134)
states: 18,180,773 (7)
abstracting: (p71<=p371)
states: 18,200,112 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.818sec

checking: EF [[~ [[[[[[1<=p19 & p403<=p347] | ~ [p285<=0]] & [p319<=p208 & ~ [p269<=1]]] & [~ [p53<=0] & ~ [[1<=p187 & p18<=p106]]]] | [~ [[1<=p97 & p293<=1]] | [p190<=1 | p248<=0]]]] | 1<=p205]]
normalized: E [true U [1<=p205 | ~ [[[[~ [[1<=p187 & p18<=p106]] & ~ [p53<=0]] & [[p319<=p208 & ~ [p269<=1]] & [~ [p285<=0] | [1<=p19 & p403<=p347]]]] | [~ [[1<=p97 & p293<=1]] | [p190<=1 | p248<=0]]]]]]

abstracting: (p248<=0)
states: 18,191,198 (7)
abstracting: (p190<=1)
states: 18,282,252 (7)
abstracting: (p293<=1)
states: 18,282,252 (7)
abstracting: (1<=p97)
states: 94,684 (4)
abstracting: (p403<=p347)
states: 18,206,786 (7)
abstracting: (1<=p19)
states: 88,935 (4)
abstracting: (p285<=0)
states: 18,193,317 (7)
abstracting: (p269<=1)
states: 18,282,252 (7)
abstracting: (p319<=p208)
states: 18,182,152 (7)
abstracting: (p53<=0)
states: 18,065,149 (7)
abstracting: (p18<=p106)
states: 18,193,317 (7)
abstracting: (1<=p187)
states: 217,103 (5)
abstracting: (1<=p205)
states: 82,140 (4)
-> the formula is TRUE

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

MC time: 0m10.950sec

checking: EF [~ [[[~ [[p416<=1 | p260<=0]] | [[[[[~ [1<=p156] & ~ [p109<=0]] & [~ [p136<=p322] & p2<=0]] | ~ [p18<=1]] & 1<=p143] | [p270<=1 & [[[p74<=p325 | ~ [p424<=p232]] | 1<=p332] | [[~ [1<=p5] | [p6<=p419 | p281<=1]] | [~ [p34<=0] & p112<=p345]]]]]] | p74<=p62]]]
normalized: E [true U ~ [[p74<=p62 | [~ [[p416<=1 | p260<=0]] | [[p270<=1 & [[[[p6<=p419 | p281<=1] | ~ [1<=p5]] | [p112<=p345 & ~ [p34<=0]]] | [1<=p332 | [p74<=p325 | ~ [p424<=p232]]]]] | [1<=p143 & [~ [p18<=1] | [[p2<=0 & ~ [p136<=p322]] & [~ [p109<=0] & ~ [1<=p156]]]]]]]]]]

abstracting: (1<=p156)
states: 88,935 (4)
abstracting: (p109<=0)
states: 18,211,678 (7)
abstracting: (p136<=p322)
states: 18,207,902 (7)
abstracting: (p2<=0)
states: 18,281,180 (7)
abstracting: (p18<=1)
states: 18,282,252 (7)
abstracting: (1<=p143)
states: 88,935 (4)
abstracting: (p424<=p232)
states: 17,672,881 (7)
abstracting: (p74<=p325)
states: 18,066,259 (7)
abstracting: (1<=p332)
states: 82,140 (4)
abstracting: (p34<=0)
states: 18,065,149 (7)
abstracting: (p112<=p345)
states: 18,192,512 (7)
abstracting: (1<=p5)
states: 88,935 (4)
abstracting: (p281<=1)
states: 18,282,252 (7)
abstracting: (p6<=p419)
states: 18,199,246 (7)
abstracting: (p270<=1)
states: 18,282,252 (7)
abstracting: (p260<=0)
states: 18,206,800 (7)
abstracting: (p416<=1)
states: 18,282,252 (7)
abstracting: (p74<=p62)
states: 18,065,149 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.190sec

checking: AG [[[p240<=p265 & [[~ [1<=p147] & [[[~ [1<=p315] | [~ [1<=p314] | ~ [p136<=p218]]] & [[[p342<=0 | p302<=1] & p384<=p391] | [~ [p127<=1] | [p61<=1 | 1<=p349]]]] & ~ [p164<=0]]] | p144<=p422]] & ~ [[[p101<=p142 & [1<=p162 | ~ [p72<=p33]]] & [~ [[1<=p345 & p260<=p277]] & [p172<=p102 | p116<=p56]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[p172<=p102 | p116<=p56] & ~ [[1<=p345 & p260<=p277]]] & [p101<=p142 & [1<=p162 | ~ [p72<=p33]]]]] & [p240<=p265 & [p144<=p422 | [[~ [p164<=0] & [[[[p61<=1 | 1<=p349] | ~ [p127<=1]] | [p384<=p391 & [p342<=0 | p302<=1]]] & [[~ [p136<=p218] | ~ [1<=p314]] | ~ [1<=p315]]]] & ~ [1<=p147]]]]]]]]

abstracting: (1<=p147)
states: 88,935 (4)
abstracting: (1<=p315)
states: 217,119 (5)
abstracting: (1<=p314)
states: 217,119 (5)
abstracting: (p136<=p218)
states: 18,207,902 (7)
abstracting: (p302<=1)
states: 18,282,252 (7)
abstracting: (p342<=0)
states: 18,187,568 (7)
abstracting: (p384<=p391)
states: 18,191,198 (7)
abstracting: (p127<=1)
states: 18,282,252 (7)
abstracting: (1<=p349)
states: 217,119 (5)
abstracting: (p61<=1)
states: 18,282,252 (7)
abstracting: (p164<=0)
states: 18,065,149 (7)
abstracting: (p144<=p422)
states: 18,199,246 (7)
abstracting: (p240<=p265)
states: 18,211,678 (7)
abstracting: (p72<=p33)
states: 18,187,568 (7)
abstracting: (1<=p162)
states: 217,103 (5)
abstracting: (p101<=p142)
states: 18,191,198 (7)
abstracting: (p260<=p277)
states: 18,206,800 (7)
abstracting: (1<=p345)
states: 217,119 (5)
abstracting: (p116<=p56)
states: 18,191,198 (7)
abstracting: (p172<=p102)
states: 18,180,773 (7)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.143sec

checking: AG [[[[[1<=p337 | p330<=1] & [p135<=p286 | [[p62<=1 & ~ [[1<=p382 & p197<=p417]]] | [[[[p414<=1 | p279<=p295] & [p282<=1 & p407<=p324]] | [1<=p129 & [p30<=1 | p60<=p256]]] | p409<=0]]]] & p123<=1] | ~ [[~ [[1<=p230 & [p118<=0 & [~ [p400<=1] & p327<=p181]]]] | [[[[[1<=p371 & p418<=1] & [p405<=1 | 1<=p37]] | [p77<=1 & p296<=p51]] & [p374<=p52 | 1<=p122]] | p143<=0]]]]]
normalized: ~ [E [true U ~ [[[p123<=1 & [[p135<=p286 | [[p409<=0 | [[1<=p129 & [p30<=1 | p60<=p256]] | [[p282<=1 & p407<=p324] & [p414<=1 | p279<=p295]]]] | [p62<=1 & ~ [[1<=p382 & p197<=p417]]]]] & [1<=p337 | p330<=1]]] | ~ [[[p143<=0 | [[[p77<=1 & p296<=p51] | [[p405<=1 | 1<=p37] & [1<=p371 & p418<=1]]] & [p374<=p52 | 1<=p122]]] | ~ [[1<=p230 & [p118<=0 & [p327<=p181 & ~ [p400<=1]]]]]]]]]]]

abstracting: (p400<=1)
states: 18,282,252 (7)
abstracting: (p327<=p181)
states: 18,201,222 (7)
abstracting: (p118<=0)
states: 18,191,198 (7)
abstracting: (1<=p230)
states: 217,103 (5)
abstracting: (1<=p122)
states: 75,902 (4)
abstracting: (p374<=p52)
states: 18,192,512 (7)
abstracting: (p418<=1)
states: 18,282,252 (7)
abstracting: (1<=p371)
states: 91,054 (4)
abstracting: (1<=p37)
states: 101,479 (5)
abstracting: (p405<=1)
states: 18,282,252 (7)
abstracting: (p296<=p51)
states: 18,067,454 (7)
abstracting: (p77<=1)
states: 18,282,252 (7)
abstracting: (p143<=0)
states: 18,193,317 (7)
abstracting: (p330<=1)
states: 18,282,252 (7)
abstracting: (1<=p337)
states: 82,140 (4)
abstracting: (p197<=p417)
states: 18,205,588 (7)
abstracting: (1<=p382)
states: 91,054 (4)
abstracting: (p62<=1)
states: 18,282,252 (7)
abstracting: (p279<=p295)
states: 18,193,317 (7)
abstracting: (p414<=1)
states: 18,282,252 (7)
abstracting: (p407<=p324)
states: 18,206,786 (7)
abstracting: (p282<=1)
states: 18,282,252 (7)
abstracting: (p60<=p256)
states: 18,201,222 (7)
abstracting: (p30<=1)
states: 18,282,252 (7)
abstracting: (1<=p129)
states: 75,452 (4)
abstracting: (p409<=0)
states: 17,439,567 (7)
abstracting: (p135<=p286)
states: 18,206,800 (7)
abstracting: (p123<=1)
states: 18,282,252 (7)
-> the formula is TRUE

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

MC time: 0m 0.197sec

checking: AG [[[[~ [[~ [p62<=p395] | [~ [[p165<=p28 | p383<=p356]] | [[1<=p136 | p276<=p241] | [p15<=p96 | p370<=0]]]]] & p384<=p9] | [[[~ [[~ [[p38<=1 | 1<=p72]] & 1<=p189]] | ~ [[[[1<=p365 & 1<=p422] | 1<=p189] | [p290<=p48 & [p426<=p283 | p188<=p247]]]]] | [[[~ [[p416<=1 & p150<=0]] | [~ [1<=p198] | ~ [p332<=p222]]] | [~ [p304<=p304] | ~ [p228<=p241]]] | p222<=0]] & [[p269<=0 & [[[p42<=0 & [p240<=0 | p83<=0]] & [~ [p203<=0] & [p182<=0 & p221<=0]]] & 1<=p36]] | p25<=0]]] & ~ [1<=p250]]]
normalized: ~ [E [true U ~ [[~ [1<=p250] & [[[p25<=0 | [p269<=0 & [1<=p36 & [[[p182<=0 & p221<=0] & ~ [p203<=0]] & [p42<=0 & [p240<=0 | p83<=0]]]]]] & [[p222<=0 | [[~ [p228<=p241] | ~ [p304<=p304]] | [[~ [p332<=p222] | ~ [1<=p198]] | ~ [[p416<=1 & p150<=0]]]]] | [~ [[[p290<=p48 & [p426<=p283 | p188<=p247]] | [1<=p189 | [1<=p365 & 1<=p422]]]] | ~ [[1<=p189 & ~ [[p38<=1 | 1<=p72]]]]]]] | [p384<=p9 & ~ [[[[[p15<=p96 | p370<=0] | [1<=p136 | p276<=p241]] | ~ [[p165<=p28 | p383<=p356]]] | ~ [p62<=p395]]]]]]]]]

abstracting: (p62<=p395)
states: 18,200,112 (7)
abstracting: (p383<=p356)
states: 18,191,198 (7)
abstracting: (p165<=p28)
states: 18,067,470 (7)
abstracting: (p276<=p241)
states: 18,193,317 (7)
abstracting: (1<=p136)
states: 75,452 (4)
abstracting: (p370<=0)
states: 18,065,133 (7)
abstracting: (p15<=p96)
states: 18,193,317 (7)
abstracting: (p384<=p9)
states: 18,191,198 (7)
abstracting: (1<=p72)
states: 94,684 (4)
abstracting: (p38<=1)
states: 18,282,252 (7)
abstracting: (1<=p189)
states: 82,140 (4)
abstracting: (1<=p422)
states: 1,126,423 (6)
abstracting: (1<=p365)
states: 217,119 (5)
abstracting: (1<=p189)
states: 82,140 (4)
abstracting: (p188<=p247)
states: 18,065,149 (7)
abstracting: (p426<=p283)
states: 17,776,199 (7)
abstracting: (p290<=p48)
states: 18,194,472 (7)
abstracting: (p150<=0)
states: 18,193,317 (7)
abstracting: (p416<=1)
states: 18,282,252 (7)
abstracting: (1<=p198)
states: 82,140 (4)
abstracting: (p332<=p222)
states: 18,201,222 (7)
abstracting: (p304<=p304)
states: 18,282,252 (7)
abstracting: (p228<=p241)
states: 18,065,149 (7)
abstracting: (p222<=0)
states: 18,065,149 (7)
abstracting: (p83<=0)
states: 18,065,149 (7)
abstracting: (p240<=0)
states: 18,211,678 (7)
abstracting: (p42<=0)
states: 18,065,149 (7)
abstracting: (p203<=0)
states: 18,200,112 (7)
abstracting: (p221<=0)
states: 18,065,149 (7)
abstracting: (p182<=0)
states: 18,065,149 (7)
abstracting: (1<=p36)
states: 217,103 (5)
abstracting: (p269<=0)
states: 18,206,800 (7)
abstracting: (p25<=0)
states: 18,180,773 (7)
abstracting: (1<=p250)
states: 91,054 (4)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.330sec

checking: AG [[[[[[[[[[p99<=p165 | p48<=p153] & [p349<=0 | p202<=1]] | p84<=0] & [[~ [p393<=0] & [1<=p376 & p35<=1]] & [[p243<=p389 & p177<=1] | ~ [p375<=0]]]] | p176<=p338] & [[1<=p57 & [[~ [p100<=0] & ~ [p164<=1]] & ~ [p248<=p242]]] & [[[~ [p163<=0] & [p140<=0 | p89<=p279]] & [~ [p29<=0] & [p309<=0 & 1<=p30]]] & p421<=1]]] | ~ [[[~ [1<=p136] & [[p136<=p29 & 1<=p399] | ~ [p14<=1]]] & p53<=p87]]] | p110<=0] & [[~ [[~ [[[p274<=p50 | [p321<=0 & 1<=p345]] | [[p277<=1 | p67<=0] & ~ [1<=p206]]]] & [p147<=1 | p199<=p418]]] | 1<=p162] & ~ [[1<=p71 & ~ [[p186<=1 & [[1<=p362 | [1<=p258 | p205<=p168]] & p391<=p170]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[1<=p71 & ~ [[p186<=1 & [p391<=p170 & [1<=p362 | [1<=p258 | p205<=p168]]]]]]] & [1<=p162 | ~ [[[p147<=1 | p199<=p418] & ~ [[[~ [1<=p206] & [p277<=1 | p67<=0]] | [p274<=p50 | [p321<=0 & 1<=p345]]]]]]]] & [p110<=0 | [~ [[p53<=p87 & [[~ [p14<=1] | [p136<=p29 & 1<=p399]] & ~ [1<=p136]]]] | [[[p421<=1 & [[[p309<=0 & 1<=p30] & ~ [p29<=0]] & [[p140<=0 | p89<=p279] & ~ [p163<=0]]]] & [1<=p57 & [~ [p248<=p242] & [~ [p164<=1] & ~ [p100<=0]]]]] & [p176<=p338 | [[[~ [p375<=0] | [p243<=p389 & p177<=1]] & [[1<=p376 & p35<=1] & ~ [p393<=0]]] & [p84<=0 | [[p349<=0 | p202<=1] & [p99<=p165 | p48<=p153]]]]]]]]]]]]

abstracting: (p48<=p153)
states: 18,066,304 (7)
abstracting: (p99<=p165)
states: 18,067,470 (7)
abstracting: (p202<=1)
states: 18,282,252 (7)
abstracting: (p349<=0)
states: 18,065,133 (7)
abstracting: (p84<=0)
states: 18,187,568 (7)
abstracting: (p393<=0)
states: 18,206,786 (7)
abstracting: (p35<=1)
states: 18,282,252 (7)
abstracting: (1<=p376)
states: 70,574 (4)
abstracting: (p177<=1)
states: 18,282,252 (7)
abstracting: (p243<=p389)
states: 18,212,672 (7)
abstracting: (p375<=0)
states: 18,211,678 (7)
abstracting: (p176<=p338)
states: 18,066,259 (7)
abstracting: (p100<=0)
states: 18,065,149 (7)
abstracting: (p164<=1)
states: 18,282,252 (7)
abstracting: (p248<=p242)
states: 18,191,198 (7)
abstracting: (1<=p57)
states: 82,140 (4)
abstracting: (p163<=0)
states: 18,065,149 (7)
abstracting: (p89<=p279)
states: 18,066,304 (7)
abstracting: (p140<=0)
states: 18,193,317 (7)
abstracting: (p29<=0)
states: 18,065,149 (7)
abstracting: (1<=p30)
states: 217,103 (5)
abstracting: (p309<=0)
states: 18,065,133 (7)
abstracting: (p421<=1)
states: 18,282,252 (7)
abstracting: (1<=p136)
states: 75,452 (4)
abstracting: (1<=p399)
states: 75,466 (4)
abstracting: (p136<=p29)
states: 18,206,800 (7)
abstracting: (p14<=1)
states: 18,282,252 (7)
abstracting: (p53<=p87)
states: 18,065,149 (7)
abstracting: (p110<=0)
states: 18,211,678 (7)
abstracting: (1<=p345)
states: 217,119 (5)
abstracting: (p321<=0)
states: 18,065,133 (7)
abstracting: (p274<=p50)
states: 18,194,472 (7)
abstracting: (p67<=0)
states: 18,200,112 (7)
abstracting: (p277<=1)
states: 18,282,252 (7)
abstracting: (1<=p206)
states: 82,140 (4)
abstracting: (p199<=p418)
states: 18,205,588 (7)
abstracting: (p147<=1)
states: 18,282,252 (7)
abstracting: (1<=p162)
states: 217,103 (5)
abstracting: (p205<=p168)
states: 18,200,112 (7)
abstracting: (1<=p258)
states: 75,452 (4)
abstracting: (1<=p362)
states: 217,119 (5)
abstracting: (p391<=p170)
states: 18,067,454 (7)
abstracting: (p186<=1)
states: 18,282,252 (7)
abstracting: (1<=p71)
states: 82,140 (4)
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.394sec

checking: AG [[[p200<=1 & [[[[[~ [p398<=p39] | p64<=p417] | [[[1<=p70 & 1<=p231] & [p50<=1 | p191<=p151]] | [p134<=1 & ~ [1<=p27]]]] & ~ [[[p77<=p349 | p379<=0] & [[1<=p78 | 1<=p281] & ~ [p146<=p84]]]]] & [p68<=1 | ~ [[p185<=1 & p25<=0]]]] & [[p285<=p169 | p395<=0] | [[[1<=p34 | [[1<=p367 & p133<=1] & ~ [p374<=1]]] | [[[p219<=0 & p38<=0] & [p287<=0 | p108<=p417]] | p318<=1]] & [1<=p99 | 1<=p194]]]]] | [[[[[~ [[p394<=p369 & p108<=0]] & [p337<=1 | 1<=p348]] & ~ [[1<=p306 & [p60<=p227 | p375<=p194]]]] & ~ [[[[p87<=1 | [1<=p96 & p319<=1]] | ~ [[1<=p126 | p193<=p196]]] | [1<=p273 & [~ [p306<=0] | [p213<=p354 & 1<=p177]]]]]] | ~ [1<=p253]] & p328<=p15]]]
normalized: ~ [E [true U ~ [[[p328<=p15 & [~ [1<=p253] | [~ [[[1<=p273 & [[p213<=p354 & 1<=p177] | ~ [p306<=0]]] | [~ [[1<=p126 | p193<=p196]] | [p87<=1 | [1<=p96 & p319<=1]]]]] & [~ [[1<=p306 & [p60<=p227 | p375<=p194]]] & [[p337<=1 | 1<=p348] & ~ [[p394<=p369 & p108<=0]]]]]]] | [p200<=1 & [[[[1<=p99 | 1<=p194] & [[p318<=1 | [[p287<=0 | p108<=p417] & [p219<=0 & p38<=0]]] | [1<=p34 | [~ [p374<=1] & [1<=p367 & p133<=1]]]]] | [p285<=p169 | p395<=0]] & [[p68<=1 | ~ [[p185<=1 & p25<=0]]] & [~ [[[~ [p146<=p84] & [1<=p78 | 1<=p281]] & [p77<=p349 | p379<=0]]] & [[[p134<=1 & ~ [1<=p27]] | [[p50<=1 | p191<=p151] & [1<=p70 & 1<=p231]]] | [p64<=p417 | ~ [p398<=p39]]]]]]]]]]]

abstracting: (p398<=p39)
states: 18,207,888 (7)
abstracting: (p64<=p417)
states: 18,205,588 (7)
abstracting: (1<=p231)
states: 94,684 (4)
abstracting: (1<=p70)
states: 82,140 (4)
abstracting: (p191<=p151)
states: 18,200,112 (7)
abstracting: (p50<=1)
states: 18,282,252 (7)
abstracting: (1<=p27)
states: 217,103 (5)
abstracting: (p134<=1)
states: 18,282,252 (7)
abstracting: (p379<=0)
states: 18,211,678 (7)
abstracting: (p77<=p349)
states: 18,067,470 (7)
abstracting: (1<=p281)
states: 88,935 (4)
abstracting: (1<=p78)
states: 217,103 (5)
abstracting: (p146<=p84)
states: 18,193,317 (7)
abstracting: (p25<=0)
states: 18,180,773 (7)
abstracting: (p185<=1)
states: 18,282,252 (7)
abstracting: (p68<=1)
states: 18,282,252 (7)
abstracting: (p395<=0)
states: 18,206,786 (7)
abstracting: (p285<=p169)
states: 18,194,472 (7)
abstracting: (p133<=1)
states: 18,282,252 (7)
abstracting: (1<=p367)
states: 94,684 (4)
abstracting: (p374<=1)
states: 18,282,252 (7)
abstracting: (1<=p34)
states: 217,103 (5)
abstracting: (p38<=0)
states: 18,065,149 (7)
abstracting: (p219<=0)
states: 18,187,568 (7)
abstracting: (p108<=p417)
states: 18,211,678 (7)
abstracting: (p287<=0)
states: 18,193,317 (7)
abstracting: (p318<=1)
states: 18,282,252 (7)
abstracting: (1<=p194)
states: 82,140 (4)
abstracting: (1<=p99)
states: 217,103 (5)
abstracting: (p200<=1)
states: 18,282,252 (7)
abstracting: (p108<=0)
states: 18,211,678 (7)
abstracting: (p394<=p369)
states: 18,215,584 (7)
abstracting: (1<=p348)
states: 217,119 (5)
abstracting: (p337<=1)
states: 18,282,252 (7)
abstracting: (p375<=p194)
states: 18,211,678 (7)
abstracting: (p60<=p227)
states: 18,201,222 (7)
abstracting: (1<=p306)
states: 217,119 (5)
abstracting: (p319<=1)
states: 18,282,252 (7)
abstracting: (1<=p96)
states: 94,684 (4)
abstracting: (p87<=1)
states: 18,282,252 (7)
abstracting: (p193<=p196)
states: 18,200,112 (7)
abstracting: (1<=p126)
states: 75,452 (4)
abstracting: (p306<=0)
states: 18,065,133 (7)
abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (p213<=p354)
states: 18,066,483 (7)
abstracting: (1<=p273)
states: 75,466 (4)
abstracting: (1<=p253)
states: 91,054 (4)
abstracting: (p328<=p15)
states: 18,200,112 (7)
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.306sec

totally nodes used: 27940908 (2.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 123409397 309147091 432556488
used/not used/entry size/cache size: 66563315 545549 16 1024MB
basic ops cache: hits/miss/sum: 14738393 28497562 43235955
used/not used/entry size/cache size: 15871641 905575 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: 148448 346067 494515
used/not used/entry size/cache size: 339780 8048828 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 45721235
1 16156413
2 4135634
3 901926
4 165091
5 24786
6 3346
7 393
8 32
9 8
>= 10 0

Total processing time: 2m31.961sec


BK_STOP 1679551116798

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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.007sec

12387 14814 15602 18423
iterations count:441039 (851), effective:12673 (24)

initing FirstDep: 0m 0.002sec

28855 29462
iterations count:230359 (444), effective:6769 (13)
26030
iterations count:182117 (351), effective:5881 (11)
24330
iterations count:150098 (289), effective:4944 (9)
21706 24932
iterations count:227965 (440), effective:7394 (14)
17788 25807
iterations count:249664 (481), effective:8199 (15)
22483 26649
iterations count:205666 (397), effective:6630 (12)
20818 27613
iterations count:236208 (456), effective:7952 (15)
22549 26628
iterations count:237866 (459), effective:7787 (15)
26384
iterations count:168199 (324), effective:5697 (10)
20720 21053
iterations count:228423 (440), effective:7641 (14)
23068 25835
iterations count:253277 (488), effective:8080 (15)

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "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 ;