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.r457-smll-167912649500615.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 ltsminxred
Input is StigmergyElection-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649500615
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 26 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 428K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679543798230

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 03:56:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 03:56:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 03:56:41] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-23 03:56:41] [INFO ] Transformed 699 places.
[2023-03-23 03:56:41] [INFO ] Transformed 1266 transitions.
[2023-03-23 03:56:41] [INFO ] Found NUPN structural information;
[2023-03-23 03:56:41] [INFO ] Parsed PT model containing 699 places and 1266 transitions and 6741 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 112 resets, run finished after 735 ms. (steps per millisecond=13 ) properties (out of 16) seen :3
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1266 rows 699 cols
[2023-03-23 03:56:43] [INFO ] Computed 6 place invariants in 65 ms
[2023-03-23 03:56:45] [INFO ] [Real]Absence check using 6 positive place invariants in 14 ms returned sat
[2023-03-23 03:56:45] [INFO ] After 814ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:11
[2023-03-23 03:56:46] [INFO ] After 1161ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:11
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-23 03:56:46] [INFO ] After 2174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:11
[2023-03-23 03:56:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2023-03-23 03:56:50] [INFO ] After 2944ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :11
[2023-03-23 03:56:51] [INFO ] Deduced a trap composed of 191 places in 447 ms of which 2 ms to minimize.
[2023-03-23 03:56:52] [INFO ] Deduced a trap composed of 191 places in 395 ms of which 1 ms to minimize.
[2023-03-23 03:56:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1095 ms
[2023-03-23 03:56:53] [INFO ] After 6721ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :11
Attempting to minimize the solution found.
Minimization took 2226 ms.
[2023-03-23 03:56:56] [INFO ] After 9571ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :11
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 11 different solutions.
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 105 ms.
Support contains 75 out of 699 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 531 edges and 699 vertex of which 86 / 699 are part of one of the 12 SCC in 6 ms
Free SCC test removed 74 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1194 edges and 625 vertex of which 621 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 306 rules applied. Total rules applied 308 place count 621 transition count 866
Reduce places removed 304 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 314 rules applied. Total rules applied 622 place count 317 transition count 856
Reduce places removed 5 places and 0 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Iterating post reduction 2 with 51 rules applied. Total rules applied 673 place count 312 transition count 810
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 719 place count 266 transition count 810
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 719 place count 266 transition count 776
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 787 place count 232 transition count 776
Discarding 52 places :
Symmetric choice reduction at 4 with 52 rule applications. Total rules 839 place count 180 transition count 724
Iterating global reduction 4 with 52 rules applied. Total rules applied 891 place count 180 transition count 724
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 896 place count 180 transition count 719
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 900 place count 176 transition count 715
Iterating global reduction 5 with 4 rules applied. Total rules applied 904 place count 176 transition count 715
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 924 place count 166 transition count 705
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 925 place count 165 transition count 704
Iterating global reduction 5 with 1 rules applied. Total rules applied 926 place count 165 transition count 704
Performed 9 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 944 place count 156 transition count 710
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 949 place count 156 transition count 705
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 951 place count 156 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 953 place count 154 transition count 703
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 957 place count 154 transition count 703
Applied a total of 957 rules in 324 ms. Remains 154 /699 variables (removed 545) and now considering 703/1266 (removed 563) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 154/699 places, 703/1266 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 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 70 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 495111 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{4=1, 5=1}
Probabilistic random walk after 495111 steps, saw 108813 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :2
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
// Phase 1: matrix 703 rows 154 cols
[2023-03-23 03:57:00] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-23 03:57:00] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 03:57:00] [INFO ] After 262ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-23 03:57:00] [INFO ] After 323ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-23 03:57:00] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:4
[2023-03-23 03:57:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 03:57:01] [INFO ] After 737ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 03:57:02] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 507 ms.
[2023-03-23 03:57:02] [INFO ] After 1945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
Support contains 12 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 703/703 transitions.
Graph (trivial) has 123 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 586 edges and 147 vertex of which 144 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 144 transition count 639
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 99 place count 97 transition count 639
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 99 place count 97 transition count 634
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 109 place count 92 transition count 634
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 79 transition count 349
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 79 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 140 place count 79 transition count 344
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 140 place count 79 transition count 340
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 148 place count 75 transition count 340
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 75 transition count 339
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 70 transition count 323
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 70 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 70 transition count 322
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 168 place count 66 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 169 place count 66 transition count 317
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 173 place count 62 transition count 298
Iterating global reduction 6 with 4 rules applied. Total rules applied 177 place count 62 transition count 298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 178 place count 62 transition count 297
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 186 place count 62 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 188 place count 61 transition count 295
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 196 place count 61 transition count 287
Free-agglomeration rule applied 30 times.
Iterating global reduction 7 with 30 rules applied. Total rules applied 226 place count 61 transition count 257
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 257 place count 31 transition count 256
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 262 place count 26 transition count 251
Iterating global reduction 8 with 5 rules applied. Total rules applied 267 place count 26 transition count 251
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 298 place count 26 transition count 220
Applied a total of 298 rules in 134 ms. Remains 26 /154 variables (removed 128) and now considering 220/703 (removed 483) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 26/154 places, 220/703 transitions.
Finished random walk after 1749 steps, including 0 resets, run visited all 4 properties in 27 ms. (steps per millisecond=64 )
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21721 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/474/inv_0_ --invariant=/tmp/474/inv_1_ --invariant=/tmp/474/inv_2_ --invariant=/tmp/474/inv_3_ --invariant=/tmp/474/inv_4_ --invariant=/tmp/474/inv_5_ --invariant=/tmp/474/inv_6_ --invariant=/tmp/474/inv_7_ --invariant=/tmp/474/inv_8_ --invariant=/tmp/474/inv_9_ --invariant=/tmp/474/inv_10_ --invariant=/tmp/474/inv_11_ --invariant=/tmp/474/inv_12_ --invariant=/tmp/474/inv_13_ --invariant=/tmp/474/inv_14_ --invariant=/tmp/474/inv_15_ --inv-par
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679543904099

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-00
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_0_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_1_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-02
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_2_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-03
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_3_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-04
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_4_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_5_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_6_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_7_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-08
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_8_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-09
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_9_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-10
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_10_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-11
rfs formula type AG
rfs formula formula --invariant=/tmp/474/inv_11_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-12
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_12_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_13_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_14_
rfs formula name StigmergyElection-PT-05b-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/474/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 699 places, 1266 transitions and 6741 arcs
pnml2lts-sym: Petri net StigmergyElection-PT-05b analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1266->1266 groups
pnml2lts-sym: Regrouping took 1.000 real 0.990 user 0.010 sys
pnml2lts-sym: state vector length is 699; there are 1266 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_11_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/474/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 7514703 group checks and 0 next state calls
pnml2lts-sym: reachability took 78.390 real 312.500 user 0.640 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.110 user 0.000 sys
pnml2lts-sym: state space has 113197703280 states, 158244 nodes
pnml2lts-sym: group_next: 11375 nodes total
pnml2lts-sym: group_explored: 6736 nodes, 18132 short vectors total
pnml2lts-sym: max token count: 1

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyElection-PT-05b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649500615"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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