Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491100270.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491100270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 12M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749172599030

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-06 01:16:41] [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]
[2025-06-06 01:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 01:16:43] [INFO ] Load time of PNML (sax parser for PT used): 1505 ms
[2025-06-06 01:16:43] [INFO ] Transformed 1107 places.
[2025-06-06 01:16:43] [INFO ] Transformed 14564 transitions.
[2025-06-06 01:16:43] [INFO ] Found NUPN structural information;
[2025-06-06 01:16:43] [INFO ] Parsed PT model containing 1107 places and 14564 transitions and 216524 arcs in 1904 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (289 resets) in 4594 ms. (8 steps per ms) remains 9/13 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (37 resets) in 551 ms. (72 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 421 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (36 resets) in 388 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (37 resets) in 422 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 235 ms. (169 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (38 resets) in 840 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 287 ms. (138 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 255 ms. (156 steps per ms) remains 8/9 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (37 resets) in 330 ms. (120 steps per ms) remains 8/8 properties
// Phase 1: matrix 14564 rows 1107 cols
[2025-06-06 01:16:47] [INFO ] Computed 9 invariants in 398 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 01:16:48] [INFO ] Flatten gal took : 3505 ms
At refinement iteration 2 (OVERLAPS) 1039/1107 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1107 variables, 1039/1116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1107 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-06 01:16:50] [INFO ] Flatten gal took : 1702 ms
[2025-06-06 01:16:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6828940199752603250.gal : 327 ms
[2025-06-06 01:16:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5218247400264299129.prop : 2 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6828940199752603250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5218247400264299129.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
SMT process timed out in 6141ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 1107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Graph (trivial) has 1004 edges and 1107 vertex of which 115 / 1107 are part of one of the 19 SCC in 23 ms
Free SCC test removed 96 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Reduce isomorphic transitions removed 122 transitions.
Graph (complete) has 2451 edges and 1011 vertex of which 997 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.135 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 608 rules applied. Total rules applied 610 place count 997 transition count 13827
Reduce places removed 602 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 623 rules applied. Total rules applied 1233 place count 395 transition count 13806
Reduce places removed 10 places and 0 transitions.
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Iterating post reduction 2 with 54 rules applied. Total rules applied 1287 place count 385 transition count 13762
Reduce places removed 44 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 46 rules applied. Total rules applied 1333 place count 341 transition count 13760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1334 place count 340 transition count 13760
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 26 Pre rules applied. Total rules applied 1334 place count 340 transition count 13734
Deduced a syphon composed of 26 places in 11 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 1386 place count 314 transition count 13734
Discarding 49 places :
Symmetric choice reduction at 5 with 49 rule applications. Total rules 1435 place count 265 transition count 13685
Iterating global reduction 5 with 49 rules applied. Total rules applied 1484 place count 265 transition count 13685
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
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 5 with 3 rules applied. Total rules applied 1487 place count 265 transition count 13682
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1488 place count 264 transition count 13682
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 1488 place count 264 transition count 13680
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1492 place count 262 transition count 13680
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 1505 place count 249 transition count 1790
Iterating global reduction 7 with 13 rules applied. Total rules applied 1518 place count 249 transition count 1790
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1523 place count 249 transition count 1785
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 1591 place count 215 transition count 1751
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1592 place count 215 transition count 1750
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1597 place count 210 transition count 1745
Iterating global reduction 9 with 5 rules applied. Total rules applied 1602 place count 210 transition count 1745
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 1620 place count 201 transition count 1748
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1625 place count 201 transition count 1743
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1632 place count 201 transition count 1736
Free-agglomeration rule applied 44 times.
Iterating global reduction 10 with 44 rules applied. Total rules applied 1676 place count 201 transition count 1692
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1720 place count 157 transition count 1692
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 1725 place count 157 transition count 1687
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1728 place count 157 transition count 1687
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1731 place count 157 transition count 1687
Applied a total of 1731 rules in 5914 ms. Remains 157 /1107 variables (removed 950) and now considering 1687/14564 (removed 12877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5933 ms. Remains : 157/1107 places, 1687/14564 transitions.
RANDOM walk for 40000 steps (1501 resets) in 2261 ms. (17 steps per ms) remains 7/8 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (233 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (239 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (235 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (236 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (233 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (240 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (239 resets) in 187 ms. (212 steps per ms) remains 7/7 properties
// Phase 1: matrix 1687 rows 157 cols
[2025-06-06 01:16:59] [INFO ] Computed 8 invariants in 29 ms
[2025-06-06 01:17:00] [INFO ] State equation strengthened by 1250 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 107/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 3/148 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1682/1830 variables, 148/156 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality5218247400264299129.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/1830 variables, 1122/1278 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1830 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/1842 variables, 7/1285 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1842 variables, 128/1413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1842 variables, 0/1413 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 2/1844 variables, 2/1415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1844 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1844 variables, 0/1415 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1844/1844 variables, and 1415 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6350 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1250/1250 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 107/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:07] [INFO ] Deduced a trap composed of 16 places in 917 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:08] [INFO ] Deduced a trap composed of 17 places in 871 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:09] [INFO ] Deduced a trap composed of 24 places in 693 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:10] [INFO ] Deduced a trap composed of 16 places in 768 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:11] [INFO ] Deduced a trap composed of 26 places in 778 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:11] [INFO ] Deduced a trap composed of 20 places in 761 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:12] [INFO ] Deduced a trap composed of 22 places in 668 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:13] [INFO ] Deduced a trap composed of 25 places in 642 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:14] [INFO ] Deduced a trap composed of 19 places in 1005 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:15] [INFO ] Deduced a trap composed of 18 places in 892 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:15] [INFO ] Deduced a trap composed of 22 places in 652 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:16] [INFO ] Deduced a trap composed of 23 places in 713 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:17] [INFO ] Deduced a trap composed of 25 places in 862 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:18] [INFO ] Deduced a trap composed of 32 places in 651 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:18] [INFO ] Deduced a trap composed of 29 places in 633 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:19] [INFO ] Deduced a trap composed of 32 places in 621 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:19] [INFO ] Deduced a trap composed of 33 places in 607 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:20] [INFO ] Deduced a trap composed of 29 places in 633 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:21] [INFO ] Deduced a trap composed of 25 places in 702 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:22] [INFO ] Deduced a trap composed of 27 places in 674 ms of which 19 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:22] [INFO ] Deduced a trap composed of 22 places in 760 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:23] [INFO ] Deduced a trap composed of 23 places in 702 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:24] [INFO ] Deduced a trap composed of 20 places in 1004 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:25] [INFO ] Deduced a trap composed of 21 places in 776 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:26] [INFO ] Deduced a trap composed of 26 places in 665 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:26] [INFO ] Deduced a trap composed of 27 places in 591 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:27] [INFO ] Deduced a trap composed of 26 places in 759 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:28] [INFO ] Deduced a trap composed of 26 places in 760 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:28] [INFO ] Deduced a trap composed of 26 places in 730 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:29] [INFO ] Deduced a trap composed of 22 places in 740 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:30] [INFO ] Deduced a trap composed of 27 places in 586 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:30] [INFO ] Deduced a trap composed of 31 places in 526 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:31] [INFO ] Deduced a trap composed of 32 places in 583 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:31] [INFO ] Deduced a trap composed of 32 places in 566 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:32] [INFO ] Deduced a trap composed of 27 places in 622 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:33] [INFO ] Deduced a trap composed of 23 places in 581 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:33] [INFO ] Deduced a trap composed of 31 places in 487 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:34] [INFO ] Deduced a trap composed of 21 places in 591 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:35] [INFO ] Deduced a trap composed of 27 places in 813 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:35] [INFO ] Deduced a trap composed of 29 places in 599 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:36] [INFO ] Deduced a trap composed of 16 places in 618 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:37] [INFO ] Deduced a trap composed of 25 places in 629 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:37] [INFO ] Deduced a trap composed of 21 places in 595 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:38] [INFO ] Deduced a trap composed of 30 places in 498 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:38] [INFO ] Deduced a trap composed of 30 places in 510 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 3/148 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:39] [INFO ] Deduced a trap composed of 30 places in 787 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:40] [INFO ] Deduced a trap composed of 28 places in 698 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:41] [INFO ] Deduced a trap composed of 30 places in 517 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:41] [INFO ] Deduced a trap composed of 31 places in 532 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:42] [INFO ] Deduced a trap composed of 31 places in 578 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:42] [INFO ] Deduced a trap composed of 31 places in 635 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:43] [INFO ] Deduced a trap composed of 32 places in 549 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:44] [INFO ] Deduced a trap composed of 30 places in 542 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:44] [INFO ] Deduced a trap composed of 27 places in 608 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:45] [INFO ] Deduced a trap composed of 35 places in 552 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1682/1830 variables, 148/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1830 variables, 1122/1333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1830 variables, 4/1337 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 11
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :11 after 19
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :19 after 21
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :21 after 190
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :190 after 5884
At refinement iteration 17 (INCLUDED_ONLY) 0/1830 variables, 0/1337 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5884 after 166191
At refinement iteration 18 (OVERLAPS) 12/1842 variables, 7/1344 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :166191 after 166425
At refinement iteration 19 (INCLUDED_ONLY) 0/1842 variables, 128/1472 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :166425 after 355004
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :355004 after 461197
At refinement iteration 20 (INCLUDED_ONLY) 0/1842 variables, 3/1475 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1842/1844 variables, and 1475 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/157 constraints, ReadFeed: 1250/1250 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52101ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 1687/1687 transitions.
Graph (trivial) has 54 edges and 157 vertex of which 4 / 157 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 155 transition count 1664
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 136 transition count 1662
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 134 transition count 1662
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 134 transition count 1659
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 49 place count 131 transition count 1659
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 128 transition count 1369
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 128 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 127 transition count 1367
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 127 transition count 1367
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 71 place count 120 transition count 1360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 73 place count 120 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 119 transition count 1166
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 119 transition count 1166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 76 place count 119 transition count 1165
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 80 place count 117 transition count 1173
Drop transitions (Redundant composition of simpler transitions.) removed 138 transitions
Redundant transition composition rules discarded 138 transitions
Iterating global reduction 5 with 138 rules applied. Total rules applied 218 place count 117 transition count 1035
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 219 place count 116 transition count 1034
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 116 transition count 1034
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 222 place count 115 transition count 1040
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 230 place count 115 transition count 1032
Free-agglomeration rule applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 240 place count 115 transition count 1022
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 250 place count 105 transition count 1022
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 253 place count 102 transition count 1019
Iterating global reduction 6 with 3 rules applied. Total rules applied 256 place count 102 transition count 1019
Applied a total of 256 rules in 763 ms. Remains 102 /157 variables (removed 55) and now considering 1019/1687 (removed 668) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 765 ms. Remains : 102/157 places, 1019/1687 transitions.
RANDOM walk for 40000 steps (1476 resets) in 746 ms. (53 steps per ms) remains 2/7 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (220 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (224 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
// Phase 1: matrix 1019 rows 102 cols
[2025-06-06 01:17:53] [INFO ] Computed 8 invariants in 6 ms
[2025-06-06 01:17:53] [INFO ] State equation strengthened by 900 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/97 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1015/1112 variables, 97/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 451/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/1121 variables, 5/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1121 variables, 449/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1121 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1121 variables, 0/1010 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1121/1121 variables, and 1010 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 900/900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :461197 after 1.83964e+06
[2025-06-06 01:17:54] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:54] [INFO ] Deduced a trap composed of 13 places in 271 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:55] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:55] [INFO ] Deduced a trap composed of 15 places in 310 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:55] [INFO ] Deduced a trap composed of 13 places in 328 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:56] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:56] [INFO ] Deduced a trap composed of 14 places in 280 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/97 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1015/1112 variables, 97/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 451/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1112 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:57] [INFO ] Deduced a trap composed of 15 places in 513 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:57] [INFO ] Deduced a trap composed of 16 places in 379 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1112 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1112 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/1121 variables, 5/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1121 variables, 449/1020 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1121 variables, 1/1021 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:59] [INFO ] Deduced a trap composed of 11 places in 335 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 01:17:59] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 18 ms to minimize.
Problem StigmergyElection-PT-08b-ReachabilityCardinality-2025-03 is UNSAT
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (INCLUDED_ONLY) 0/1121 variables, 2/1023 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1121 variables, 0/1023 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1121 variables, 0/1023 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1121/1121 variables, and 1023 constraints, problems are : Problem set: 1 solved, 1 unsolved in 6021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 900/900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7154ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 1019/1019 transitions.
Graph (trivial) has 79 edges and 102 vertex of which 17 / 102 are part of one of the 8 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 440 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 92 transition count 977
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 71 transition count 976
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 46 place count 71 transition count 970
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 65 transition count 970
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 69 place count 54 transition count 959
Iterating global reduction 2 with 11 rules applied. Total rules applied 80 place count 54 transition count 959
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 83 place count 51 transition count 954
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 51 transition count 954
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 2 with 20 rules applied. Total rules applied 106 place count 41 transition count 944
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 41 transition count 937
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 124 place count 30 transition count 799
Iterating global reduction 3 with 11 rules applied. Total rules applied 135 place count 30 transition count 799
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 200 place count 30 transition count 734
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 202 place count 29 transition count 740
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 4 with 82 rules applied. Total rules applied 284 place count 29 transition count 658
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 286 place count 28 transition count 660
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 290 place count 28 transition count 656
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 297 place count 28 transition count 649
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 250 transitions.
Iterating post reduction 4 with 257 rules applied. Total rules applied 554 place count 21 transition count 399
Applied a total of 554 rules in 325 ms. Remains 21 /102 variables (removed 81) and now considering 399/1019 (removed 620) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 21/102 places, 399/1019 transitions.
RANDOM walk for 313 steps (0 resets) in 19 ms. (15 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-08b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_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 78953 ms.

BK_STOP 1749172680775

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-08b"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08b, 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 r226-smll-174903491100270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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