Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100342.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
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 r400-tall-171690532100342
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.4M May 18 16:43 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-2024-00
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyElection-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717011357137

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-29 19:35:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:35:58] [INFO ] Load time of PNML (sax parser for PT used): 360 ms
[2024-05-29 19:35:58] [INFO ] Transformed 971 places.
[2024-05-29 19:35:58] [INFO ] Transformed 5542 transitions.
[2024-05-29 19:35:58] [INFO ] Found NUPN structural information;
[2024-05-29 19:35:58] [INFO ] Parsed PT model containing 971 places and 5542 transitions and 65199 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (324 resets) in 3207 ms. (12 steps per ms) remains 11/14 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (47 resets) in 379 ms. (105 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (51 resets) in 357 ms. (111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (46 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 155 ms. (256 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (45 resets) in 341 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 599 ms. (66 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (47 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (56 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 145 ms. (274 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
[2024-05-29 19:36:00] [INFO ] Flatten gal took : 1348 ms
BEST_FIRST walk for 40004 steps (45 resets) in 156 ms. (254 steps per ms) remains 11/11 properties
// Phase 1: matrix 5542 rows 971 cols
[2024-05-29 19:36:01] [INFO ] Computed 8 invariants in 154 ms
[2024-05-29 19:36:01] [INFO ] Flatten gal took : 515 ms
[2024-05-29 19:36:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4809890237199547374.gal : 195 ms
[2024-05-29 19:36:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1151995810968234559.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4809890237199547374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1151995810968234559.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/971 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality1151995810968234559.prop.
At refinement iteration 5 (OVERLAPS) 5542/6513 variables, 971/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/6513 variables, 0/1950 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6513/6513 variables, and 1950 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4510 ms.
Refiners :[Domain max(s): 971/971 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 971/971 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 868/971 variables, 8/111 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/971 variables, 868/979 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-29 19:36:08] [INFO ] Deduced a trap composed of 189 places in 1947 ms of which 69 ms to minimize.
[2024-05-29 19:36:10] [INFO ] Deduced a trap composed of 190 places in 1746 ms of which 5 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :10 after 20
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :20 after 37
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :37 after 217
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :217 after 3621
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3621 after 11655
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :11655 after 28923
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :28923 after 30712
[2024-05-29 19:36:11] [INFO ] Deduced a trap composed of 191 places in 1724 ms of which 11 ms to minimize.
SMT process timed out in 11015ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 5542/5542 transitions.
Graph (trivial) has 815 edges and 971 vertex of which 90 / 971 are part of one of the 15 SCC in 6 ms
Free SCC test removed 75 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 2004 edges and 896 vertex of which 886 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.35 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 477 rules applied. Total rules applied 479 place count 886 transition count 4965
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 489 rules applied. Total rules applied 968 place count 413 transition count 4949
Reduce places removed 8 places and 0 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Iterating post reduction 2 with 64 rules applied. Total rules applied 1032 place count 405 transition count 4893
Reduce places removed 56 places and 0 transitions.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :30712 after 125602
Iterating post reduction 3 with 56 rules applied. Total rules applied 1088 place count 349 transition count 4893
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1088 place count 349 transition count 4870
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1134 place count 326 transition count 4870
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1169 place count 291 transition count 4835
Iterating global reduction 4 with 35 rules applied. Total rules applied 1204 place count 291 transition count 4835
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1211 place count 284 transition count 1541
Iterating global reduction 4 with 7 rules applied. Total rules applied 1218 place count 284 transition count 1541
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1221 place count 284 transition count 1538
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1263 place count 263 transition count 1517
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1264 place count 263 transition count 1516
Performed 13 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 1290 place count 250 transition count 1518
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 1297 place count 250 transition count 1511
Free-agglomeration rule applied 47 times.
Iterating global reduction 6 with 47 rules applied. Total rules applied 1344 place count 250 transition count 1464
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 6 with 47 rules applied. Total rules applied 1391 place count 203 transition count 1464
Drop transitions (Redundant composition of simpler transitions.) removed 218 transitions
Redundant transition composition rules discarded 218 transitions
Iterating global reduction 7 with 218 rules applied. Total rules applied 1609 place count 203 transition count 1246
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1610 place count 203 transition count 1246
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1611 place count 203 transition count 1246
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :125602 after 1.28179e+07
Applied a total of 1611 rules in 1546 ms. Remains 203 /971 variables (removed 768) and now considering 1246/5542 (removed 4296) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1557 ms. Remains : 203/971 places, 1246/5542 transitions.
RANDOM walk for 40000 steps (1521 resets) in 755 ms. (52 steps per ms) remains 9/10 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (249 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (305 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (253 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (246 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (266 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (250 resets) in 139 ms. (285 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (264 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (264 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (244 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
// Phase 1: matrix 1246 rows 203 cols
[2024-05-29 19:36:14] [INFO ] Computed 6 invariants in 12 ms
[2024-05-29 19:36:14] [INFO ] State equation strengthened by 740 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1238/1411 variables, 173/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1411 variables, 641/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1411 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 37/1448 variables, 29/849 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1448 variables, 99/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1448 variables, 0/948 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1449 variables, 1/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1449 variables, 0/949 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1449/1449 variables, and 949 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 75/173 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-29 19:36:16] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2024-05-29 19:36:16] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 1 ms to minimize.
[2024-05-29 19:36:17] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 1 ms to minimize.
[2024-05-29 19:36:17] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 1 ms to minimize.
[2024-05-29 19:36:17] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2024-05-29 19:36:17] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2024-05-29 19:36:17] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 1 ms to minimize.
[2024-05-29 19:36:18] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 0 ms to minimize.
[2024-05-29 19:36:18] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 19:36:18] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 1 ms to minimize.
[2024-05-29 19:36:18] [INFO ] Deduced a trap composed of 36 places in 151 ms of which 0 ms to minimize.
[2024-05-29 19:36:18] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2024-05-29 19:36:19] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 1 ms to minimize.
[2024-05-29 19:36:19] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 0 ms to minimize.
[2024-05-29 19:36:19] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 15/21 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:19] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2024-05-29 19:36:19] [INFO ] Deduced a trap composed of 36 places in 187 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:20] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 1 ms to minimize.
[2024-05-29 19:36:20] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1238/1411 variables, 173/198 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1411 variables, 641/839 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1411 variables, 1/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1411 variables, 0/840 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 37/1448 variables, 29/869 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1448 variables, 99/968 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1448 variables, 7/975 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:22] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 1 ms to minimize.
[2024-05-29 19:36:23] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1448 variables, 2/977 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:23] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2024-05-29 19:36:24] [INFO ] Deduced a trap composed of 37 places in 269 ms of which 1 ms to minimize.
[2024-05-29 19:36:24] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 1 ms to minimize.
[2024-05-29 19:36:24] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 1 ms to minimize.
[2024-05-29 19:36:25] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 1 ms to minimize.
[2024-05-29 19:36:25] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 1 ms to minimize.
[2024-05-29 19:36:25] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1448 variables, 7/984 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:26] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1448 variables, 1/985 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1448 variables, 0/985 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/1449 variables, 1/986 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-29 19:36:28] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 1 ms to minimize.
Problem StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 is UNSAT
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-29 19:36:28] [INFO ] Deduced a trap composed of 45 places in 282 ms of which 2 ms to minimize.
[2024-05-29 19:36:28] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1449 variables, 3/989 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-29 19:36:29] [INFO ] Deduced a trap composed of 48 places in 282 ms of which 1 ms to minimize.
[2024-05-29 19:36:30] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1449 variables, 2/991 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1449 variables, 0/991 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1449 variables, 0/991 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1449/1449 variables, and 991 constraints, problems are : Problem set: 2 solved, 7 unsolved in 15337 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 203/203 constraints, ReadFeed: 740/740 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 34/34 constraints]
After SMT, in 17575ms problems are : Problem set: 2 solved, 7 unsolved
Parikh walk visited 0 properties in 3749 ms.
Support contains 49 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 1246/1246 transitions.
Graph (trivial) has 94 edges and 203 vertex of which 6 / 203 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 753 edges and 200 vertex of which 199 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 199 transition count 1206
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 166 transition count 1200
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 79 place count 162 transition count 1200
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 79 place count 162 transition count 1191
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 97 place count 153 transition count 1191
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 102 place count 148 transition count 1186
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 148 transition count 1186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 148 transition count 1184
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 125 place count 140 transition count 1176
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 4 with 149 rules applied. Total rules applied 274 place count 140 transition count 1027
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 275 place count 139 transition count 1026
Iterating global reduction 5 with 1 rules applied. Total rules applied 276 place count 139 transition count 1026
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 278 place count 138 transition count 1025
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 280 place count 138 transition count 1023
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 284 place count 136 transition count 1023
Drop transitions (Redundant composition of simpler transitions.) removed 98 transitions
Redundant transition composition rules discarded 98 transitions
Iterating global reduction 6 with 98 rules applied. Total rules applied 382 place count 136 transition count 925
Free-agglomeration rule applied 17 times.
Iterating global reduction 6 with 17 rules applied. Total rules applied 399 place count 136 transition count 908
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 416 place count 119 transition count 908
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 434 place count 119 transition count 890
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 435 place count 119 transition count 890
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 436 place count 118 transition count 889
Applied a total of 436 rules in 448 ms. Remains 118 /203 variables (removed 85) and now considering 889/1246 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 118/203 places, 889/1246 transitions.
RANDOM walk for 40000 steps (1590 resets) in 702 ms. (56 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (226 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (229 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (230 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (231 resets) in 89 ms. (444 steps per ms) remains 6/7 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (259 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (229 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (224 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
// Phase 1: matrix 889 rows 118 cols
[2024-05-29 19:36:36] [INFO ] Computed 6 invariants in 19 ms
[2024-05-29 19:36:36] [INFO ] State equation strengthened by 730 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 865/959 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/959 variables, 391/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/959 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 47/1006 variables, 23/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 339/853 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1006 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/1007 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1007 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1007 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1007 variables, and 854 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1076 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 730/730 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 55/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2024-05-29 19:36:37] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:36:38] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 865/959 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/959 variables, 391/506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/959 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2024-05-29 19:36:39] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/959 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/959 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 47/1006 variables, 23/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1006 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1006 variables, 339/872 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1006 variables, 5/877 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:40] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 1 ms to minimize.
[2024-05-29 19:36:40] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 9 ms to minimize.
[2024-05-29 19:36:40] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 0 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 0 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 0 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:36:41] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1006 variables, 10/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:42] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1006 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1006 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/1007 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 19:36:43] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2024-05-29 19:36:43] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2024-05-29 19:36:43] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2024-05-29 19:36:43] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-29 19:36:43] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2024-05-29 19:36:44] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1007 variables, 6/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1007 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/1007 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1007 variables, and 895 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7351 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 118/118 constraints, ReadFeed: 730/730 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 35/35 constraints]
After SMT, in 8572ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 1443 ms.
Support contains 39 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 889/889 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 118 transition count 885
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 114 transition count 883
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 112 transition count 883
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 112 transition count 881
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 110 transition count 881
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 21 place count 107 transition count 879
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 107 transition count 878
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 5 rules applied. Total rules applied 27 place count 106 transition count 874
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 31 place count 103 transition count 873
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 31 place count 103 transition count 867
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 43 place count 97 transition count 867
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 45 place count 95 transition count 865
Iterating global reduction 6 with 2 rules applied. Total rules applied 47 place count 95 transition count 865
Performed 8 Post agglomeration using F-continuation condition with reduction of 55 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 63 place count 87 transition count 802
Ensure Unique test removed 264 transitions
Reduce isomorphic transitions removed 264 transitions.
Iterating post reduction 6 with 264 rules applied. Total rules applied 327 place count 87 transition count 538
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 7 with 2 rules applied. Total rules applied 329 place count 86 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 7 with 158 rules applied. Total rules applied 487 place count 86 transition count 379
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 493 place count 86 transition count 373
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 499 place count 80 transition count 373
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 8 with 39 rules applied. Total rules applied 538 place count 80 transition count 334
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 540 place count 80 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 541 place count 80 transition count 333
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 542 place count 79 transition count 332
Iterating global reduction 8 with 1 rules applied. Total rules applied 543 place count 79 transition count 332
Applied a total of 543 rules in 143 ms. Remains 79 /118 variables (removed 39) and now considering 332/889 (removed 557) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 79/118 places, 332/889 transitions.
RANDOM walk for 40000 steps (2361 resets) in 202 ms. (197 steps per ms) remains 3/6 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (412 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (418 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (397 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
// Phase 1: matrix 332 rows 79 cols
[2024-05-29 19:36:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-29 19:36:46] [INFO ] State equation strengthened by 246 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 318/380 variables, 62/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 76/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 28/408 variables, 14/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 170/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/411 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/411 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 330 constraints, problems are : Problem set: 0 solved, 3 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/62 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 318/380 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 76/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 28/408 variables, 14/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 170/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-05-29 19:36:47] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/411 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:36:48] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/411 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/411 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 345 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 79/79 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 12/12 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 285 ms.
Support contains 26 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 332/332 transitions.
Graph (trivial) has 29 edges and 79 vertex of which 2 / 79 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 78 transition count 321
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 69 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 68 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 68 transition count 319
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 67 transition count 319
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 25 place count 65 transition count 317
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 65 transition count 317
Performed 4 Post agglomeration using F-continuation condition with reduction of 32 identical transitions.
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 35 place count 61 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 99 place count 61 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 4 with 52 rules applied. Total rules applied 151 place count 61 transition count 165
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 154 place count 61 transition count 162
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 158 place count 58 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 5 with 39 rules applied. Total rules applied 197 place count 58 transition count 122
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 58 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 58 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 200 place count 57 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 201 place count 57 transition count 120
Applied a total of 201 rules in 102 ms. Remains 57 /79 variables (removed 22) and now considering 120/332 (removed 212) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 57/79 places, 120/332 transitions.
RANDOM walk for 40000 steps (3202 resets) in 96 ms. (412 steps per ms) remains 1/3 properties
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (803 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
// Phase 1: matrix 120 rows 57 cols
[2024-05-29 19:36:48] [INFO ] Computed 5 invariants in 1 ms
[2024-05-29 19:36:48] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/158 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 23/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/176 variables, 11/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 37/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/177 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/177 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 122 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/45 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:36:48] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:36:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/158 variables, 45/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/176 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 19:36:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:36:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/176 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/176 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/177 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/177 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 127 constraints, problems are : Problem set: 0 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 485ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 22 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 120/120 transitions.
Graph (trivial) has 14 edges and 57 vertex of which 2 / 57 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 56 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 54 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 53 transition count 115
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 50 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 21 place count 50 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 26 place count 50 transition count 99
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 27 place count 49 transition count 98
Iterating global reduction 4 with 1 rules applied. Total rules applied 28 place count 49 transition count 98
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 49 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 48 transition count 97
Applied a total of 30 rules in 10 ms. Remains 48 /57 variables (removed 9) and now considering 97/120 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 48/57 places, 97/120 transitions.
RANDOM walk for 40000 steps (2335 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (532 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Probably explored full state space saw : 5653 states, properties seen :0
Probabilistic random walk after 31080 steps, saw 5653 distinct states, run finished after 61 ms. (steps per millisecond=509 ) properties seen :0
Explored full state space saw : 5653 states, properties seen :0
Exhaustive walk after 31080 steps, saw 5653 distinct states, run finished after 43 ms. (steps per millisecond=722 ) properties seen :0
FORMULA StigmergyElection-PT-07b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 51052 ms.

BK_STOP 1717011409426

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5568"
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 r400-tall-171690532100342"
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 ;