Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872800342.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyElection-PT-07b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872800342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.4K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 30 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 30 14:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 3.4M May 29 12:20 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-07b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654860238001

Running Version 202205111006
[2022-06-10 11:23:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-10 11:23:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-10 11:24:00] [INFO ] Load time of PNML (sax parser for PT used): 697 ms
[2022-06-10 11:24:00] [INFO ] Transformed 971 places.
[2022-06-10 11:24:00] [INFO ] Transformed 5542 transitions.
[2022-06-10 11:24:00] [INFO ] Found NUPN structural information;
[2022-06-10 11:24:00] [INFO ] Parsed PT model containing 971 places and 5542 transitions in 932 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 81 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 14) seen :2
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 5542 rows 971 cols
[2022-06-10 11:24:03] [INFO ] Computed 8 place invariants in 179 ms
[2022-06-10 11:24:04] [INFO ] After 1003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-10 11:24:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2022-06-10 11:24:11] [INFO ] After 5539ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2022-06-10 11:24:14] [INFO ] Deduced a trap composed of 194 places in 2972 ms of which 8 ms to minimize.
[2022-06-10 11:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3370 ms
[2022-06-10 11:24:17] [INFO ] Deduced a trap composed of 190 places in 3047 ms of which 2 ms to minimize.
[2022-06-10 11:24:20] [INFO ] Deduced a trap composed of 242 places in 2662 ms of which 6 ms to minimize.
[2022-06-10 11:24:23] [INFO ] Deduced a trap composed of 191 places in 2402 ms of which 2 ms to minimize.
[2022-06-10 11:24:26] [INFO ] Deduced a trap composed of 191 places in 2887 ms of which 2 ms to minimize.
[2022-06-10 11:24:28] [INFO ] Deduced a trap composed of 190 places in 2501 ms of which 1 ms to minimize.
[2022-06-10 11:24:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 14456 ms
[2022-06-10 11:24:32] [INFO ] Deduced a trap composed of 193 places in 2894 ms of which 1 ms to minimize.
[2022-06-10 11:24:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-10 11:24:32] [INFO ] After 27910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 11709 ms.
Support contains 156 out of 971 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 714 edges and 971 vertex of which 30 / 971 are part of one of the 7 SCC in 10 ms
Free SCC test removed 23 places
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Graph (complete) has 2069 edges and 948 vertex of which 938 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.54 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 409 rules applied. Total rules applied 411 place count 938 transition count 5097
Reduce places removed 404 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 414 rules applied. Total rules applied 825 place count 534 transition count 5087
Reduce places removed 5 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 2 with 86 rules applied. Total rules applied 911 place count 529 transition count 5006
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 83 rules applied. Total rules applied 994 place count 448 transition count 5004
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 995 place count 447 transition count 5004
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 995 place count 447 transition count 4979
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 1045 place count 422 transition count 4979
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 1086 place count 381 transition count 4938
Iterating global reduction 5 with 41 rules applied. Total rules applied 1127 place count 381 transition count 4938
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 5 with 3 rules applied. Total rules applied 1130 place count 381 transition count 4935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1131 place count 380 transition count 4935
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1131 place count 380 transition count 4934
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1133 place count 379 transition count 4934
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1142 place count 370 transition count 1410
Iterating global reduction 7 with 9 rules applied. Total rules applied 1151 place count 370 transition count 1410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1152 place count 370 transition count 1409
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 1220 place count 336 transition count 1375
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1221 place count 335 transition count 1374
Iterating global reduction 8 with 1 rules applied. Total rules applied 1222 place count 335 transition count 1374
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1232 place count 330 transition count 1375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1233 place count 330 transition count 1374
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1241 place count 330 transition count 1366
Free-agglomeration rule applied 43 times.
Iterating global reduction 9 with 43 rules applied. Total rules applied 1284 place count 330 transition count 1323
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 9 with 43 rules applied. Total rules applied 1327 place count 287 transition count 1323
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 1332 place count 287 transition count 1318
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1334 place count 287 transition count 1318
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1336 place count 287 transition count 1318
Applied a total of 1336 rules in 2168 ms. Remains 287 /971 variables (removed 684) and now considering 1318/5542 (removed 4224) transitions.
Finished structural reductions, in 1 iterations. Remains : 287/971 places, 1318/5542 transitions.
Incomplete random walk after 1000000 steps, including 24475 resets, run finished after 28584 ms. (steps per millisecond=34 ) properties (out of 10) seen :4
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 680402 steps, including 1996 resets, run timeout after 5001 ms. (steps per millisecond=136 ) properties seen 1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 3490 resets, run finished after 4321 ms. (steps per millisecond=231 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 946407 steps, including 3311 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 3473 resets, run finished after 4386 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3460 resets, run finished after 4619 ms. (steps per millisecond=216 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1318 rows 287 cols
[2022-06-10 11:25:38] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-10 11:25:38] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-10 11:25:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-10 11:25:39] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-10 11:25:40] [INFO ] State equation strengthened by 558 read => feed constraints.
[2022-06-10 11:25:40] [INFO ] After 979ms SMT Verify possible using 558 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-06-10 11:25:41] [INFO ] Deduced a trap composed of 52 places in 560 ms of which 2 ms to minimize.
[2022-06-10 11:25:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 684 ms
[2022-06-10 11:25:42] [INFO ] Deduced a trap composed of 42 places in 543 ms of which 2 ms to minimize.
[2022-06-10 11:25:43] [INFO ] Deduced a trap composed of 53 places in 515 ms of which 1 ms to minimize.
[2022-06-10 11:25:44] [INFO ] Deduced a trap composed of 67 places in 491 ms of which 0 ms to minimize.
[2022-06-10 11:25:44] [INFO ] Deduced a trap composed of 44 places in 522 ms of which 1 ms to minimize.
[2022-06-10 11:25:45] [INFO ] Deduced a trap composed of 57 places in 489 ms of which 1 ms to minimize.
[2022-06-10 11:25:45] [INFO ] Deduced a trap composed of 56 places in 478 ms of which 1 ms to minimize.
[2022-06-10 11:25:46] [INFO ] Deduced a trap composed of 53 places in 452 ms of which 1 ms to minimize.
[2022-06-10 11:25:46] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4209 ms
[2022-06-10 11:25:46] [INFO ] After 6840ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 958 ms.
[2022-06-10 11:25:47] [INFO ] After 8964ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 2308 ms.
Support contains 87 out of 287 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 287/287 places, 1318/1318 transitions.
Graph (trivial) has 128 edges and 287 vertex of which 12 / 287 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 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 47 rules applied. Total rules applied 48 place count 279 transition count 1258
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 55 rules applied. Total rules applied 103 place count 232 transition count 1250
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 226 transition count 1249
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 110 place count 226 transition count 1239
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 130 place count 216 transition count 1239
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 133 place count 213 transition count 1236
Iterating global reduction 3 with 3 rules applied. Total rules applied 136 place count 213 transition count 1236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 213 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 212 transition count 1233
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 212 transition count 1233
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 164 place count 200 transition count 1221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 200 transition count 1220
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 167 place count 198 transition count 1218
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 198 transition count 1218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 175 place count 195 transition count 1220
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 195 transition count 1218
Free-agglomeration rule applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 195 place count 195 transition count 1200
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 5 with 18 rules applied. Total rules applied 213 place count 177 transition count 1200
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 6 with 145 rules applied. Total rules applied 358 place count 177 transition count 1055
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 177 transition count 1055
Applied a total of 359 rules in 848 ms. Remains 177 /287 variables (removed 110) and now considering 1055/1318 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 177/287 places, 1055/1318 transitions.
Incomplete random walk after 1000000 steps, including 24437 resets, run finished after 19292 ms. (steps per millisecond=51 ) properties (out of 5) seen :2
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 903596 steps, including 3155 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 3730 resets, run finished after 4618 ms. (steps per millisecond=216 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3478 resets, run finished after 3087 ms. (steps per millisecond=323 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1055 rows 177 cols
[2022-06-10 11:26:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-10 11:26:23] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-10 11:26:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2022-06-10 11:26:23] [INFO ] After 675ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-10 11:26:23] [INFO ] State equation strengthened by 732 read => feed constraints.
[2022-06-10 11:26:24] [INFO ] After 891ms SMT Verify possible using 732 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-10 11:26:25] [INFO ] Deduced a trap composed of 28 places in 398 ms of which 1 ms to minimize.
[2022-06-10 11:26:25] [INFO ] Deduced a trap composed of 25 places in 410 ms of which 1 ms to minimize.
[2022-06-10 11:26:26] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 0 ms to minimize.
[2022-06-10 11:26:26] [INFO ] Deduced a trap composed of 27 places in 403 ms of which 1 ms to minimize.
[2022-06-10 11:26:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1912 ms
[2022-06-10 11:26:27] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2022-06-10 11:26:27] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 1 ms to minimize.
[2022-06-10 11:26:28] [INFO ] Deduced a trap composed of 28 places in 317 ms of which 0 ms to minimize.
[2022-06-10 11:26:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1185 ms
[2022-06-10 11:26:28] [INFO ] After 4516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 603 ms.
[2022-06-10 11:26:28] [INFO ] After 5896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 750 ms.
Support contains 77 out of 177 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 177/177 places, 1055/1055 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 177 transition count 1048
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 170 transition count 1046
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 169 transition count 1046
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 169 transition count 1043
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 166 transition count 1043
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 27 place count 164 transition count 1041
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 164 transition count 1040
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 164 transition count 1038
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 32 place count 162 transition count 1038
Applied a total of 32 rules in 354 ms. Remains 162 /177 variables (removed 15) and now considering 1038/1055 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/177 places, 1038/1055 transitions.
Incomplete random walk after 1000000 steps, including 1283 resets, run finished after 11780 ms. (steps per millisecond=84 ) properties (out of 3) seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3836 resets, run finished after 4691 ms. (steps per millisecond=213 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3976 resets, run finished after 3630 ms. (steps per millisecond=275 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1038 rows 162 cols
[2022-06-10 11:26:50] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-10 11:26:50] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-10 11:26:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-10 11:26:50] [INFO ] After 624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-10 11:26:51] [INFO ] State equation strengthened by 757 read => feed constraints.
[2022-06-10 11:26:51] [INFO ] After 776ms SMT Verify possible using 757 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-10 11:26:52] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2022-06-10 11:26:53] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 0 ms to minimize.
[2022-06-10 11:26:53] [INFO ] Deduced a trap composed of 30 places in 352 ms of which 1 ms to minimize.
[2022-06-10 11:26:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1296 ms
[2022-06-10 11:26:53] [INFO ] After 2483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 496 ms.
[2022-06-10 11:26:54] [INFO ] After 3743ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 310 ms.
Support contains 75 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 1038/1038 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 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 1037
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 161 transition count 1037
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 160 transition count 1036
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 160 transition count 1035
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 160 transition count 1034
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 97 rules applied. Total rules applied 103 place count 159 transition count 938
Applied a total of 103 rules in 265 ms. Remains 159 /162 variables (removed 3) and now considering 938/1038 (removed 100) transitions.
Finished structural reductions, in 1 iterations. Remains : 159/162 places, 938/1038 transitions.
Incomplete random walk after 1000000 steps, including 3874 resets, run finished after 9732 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3905 resets, run finished after 4665 ms. (steps per millisecond=214 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4045 resets, run finished after 3460 ms. (steps per millisecond=289 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 16232808 steps, run timeout after 51001 ms. (steps per millisecond=318 ) properties seen :{1=1}
Probabilistic random walk after 16232808 steps, saw 2340025 distinct states, run finished after 51003 ms. (steps per millisecond=318 ) properties seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 938 rows 159 cols
[2022-06-10 11:28:03] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-10 11:28:03] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:28:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-10 11:28:04] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:28:04] [INFO ] State equation strengthened by 685 read => feed constraints.
[2022-06-10 11:28:04] [INFO ] After 497ms SMT Verify possible using 685 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:28:05] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 1 ms to minimize.
[2022-06-10 11:28:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2022-06-10 11:28:05] [INFO ] After 1106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-06-10 11:28:05] [INFO ] After 1843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 36 ms.
Support contains 46 out of 159 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 159/159 places, 938/938 transitions.
Graph (trivial) has 57 edges and 159 vertex of which 7 / 159 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 155 transition count 915
Reduce places removed 16 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 23 rules applied. Total rules applied 40 place count 139 transition count 908
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 132 transition count 907
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 48 place count 132 transition count 905
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 130 transition count 905
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 72 place count 120 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 120 transition count 892
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 80 place count 115 transition count 887
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 115 transition count 887
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 4 with 2 rules applied. Total rules applied 87 place count 114 transition count 893
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 102 place count 114 transition count 878
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 114 transition count 873
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 149 rules applied. Total rules applied 256 place count 109 transition count 729
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 257 place count 109 transition count 729
Applied a total of 257 rules in 436 ms. Remains 109 /159 variables (removed 50) and now considering 729/938 (removed 209) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/159 places, 729/938 transitions.
Incomplete random walk after 1000000 steps, including 12125 resets, run finished after 2311 ms. (steps per millisecond=432 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5887 resets, run finished after 3418 ms. (steps per millisecond=292 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5709580 steps, run timeout after 15001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 5709580 steps, saw 886703 distinct states, run finished after 15003 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 109 cols
[2022-06-10 11:28:26] [INFO ] Computed 8 place invariants in 4 ms
[2022-06-10 11:28:26] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-10 11:28:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-10 11:28:27] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-10 11:28:27] [INFO ] State equation strengthened by 604 read => feed constraints.
[2022-06-10 11:28:27] [INFO ] After 378ms SMT Verify possible using 604 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-10 11:28:27] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 1 ms to minimize.
[2022-06-10 11:28:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 326 ms
[2022-06-10 11:28:28] [INFO ] After 852ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 160 ms.
[2022-06-10 11:28:28] [INFO ] After 1480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 46 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 729/729 transitions.
Applied a total of 0 rules in 60 ms. Remains 109 /109 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/109 places, 729/729 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 729/729 transitions.
Applied a total of 0 rules in 59 ms. Remains 109 /109 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 109 cols
[2022-06-10 11:28:28] [INFO ] Computed 8 place invariants in 4 ms
[2022-06-10 11:28:28] [INFO ] Implicit Places using invariants in 159 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 108/109 places, 729/729 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 108 transition count 726
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 105 transition count 726
Performed 8 Post agglomeration using F-continuation condition with reduction of 184 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 97 transition count 534
Drop transitions removed 3 transitions
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 166 place count 97 transition count 390
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 168 place count 95 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 170 place count 95 transition count 246
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 1 with 37 rules applied. Total rules applied 207 place count 95 transition count 209
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 208 place count 95 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 209 place count 94 transition count 208
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 94 transition count 208
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 212 place count 94 transition count 207
Applied a total of 212 rules in 62 ms. Remains 94 /108 variables (removed 14) and now considering 207/729 (removed 522) transitions.
// Phase 1: matrix 207 rows 94 cols
[2022-06-10 11:28:28] [INFO ] Computed 7 place invariants in 0 ms
[2022-06-10 11:28:28] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 207 rows 94 cols
[2022-06-10 11:28:28] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-10 11:28:28] [INFO ] State equation strengthened by 97 read => feed constraints.
[2022-06-10 11:28:28] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 94/109 places, 207/729 transitions.
Finished structural reductions, in 2 iterations. Remains : 94/109 places, 207/729 transitions.
Incomplete random walk after 1000000 steps, including 19551 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7520 resets, run finished after 2766 ms. (steps per millisecond=361 ) properties (out of 1) seen :0
Finished probabilistic random walk after 346336 steps, run visited all 1 properties in 450 ms. (steps per millisecond=769 )
Probabilistic random walk after 346336 steps, saw 59134 distinct states, run finished after 451 ms. (steps per millisecond=767 ) properties seen :1
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 273562 ms.

BK_STOP 1654860513443

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-07b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-07b, 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 r294-smll-165463872800342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-07b.tgz
mv StigmergyElection-PT-07b 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 ;