fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r226-smll-174903490600047
Last Updated
June 24, 2025

About the Execution of ITS-Tools for StigmergyCommit-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 53302.00 0.00 0.00 TTTFFFTFTTTFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490600047.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 StigmergyCommit-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490600047
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K 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.7K 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 627K 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 StigmergyCommit-PT-04b-ReachabilityFireability-2025-00
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-01
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-02
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-03
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-04
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-05
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-06
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-07
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-08
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-09
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-10
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-11
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-12
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-13
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-14
FORMULA_NAME StigmergyCommit-PT-04b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749062452215

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-04 18:40:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 18:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 18:40:55] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2025-06-04 18:40:55] [INFO ] Transformed 1534 places.
[2025-06-04 18:40:55] [INFO ] Transformed 2136 transitions.
[2025-06-04 18:40:55] [INFO ] Found NUPN structural information;
[2025-06-04 18:40:55] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 741 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (423 resets) in 2182 ms. (18 steps per ms) remains 14/16 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (77 resets) in 2311 ms. (17 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (76 resets) in 477 ms. (83 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (75 resets) in 218 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (78 resets) in 509 ms. (78 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (78 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
[2025-06-04 18:40:57] [INFO ] Flatten gal took : 917 ms
BEST_FIRST walk for 40004 steps (78 resets) in 409 ms. (97 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 169 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (79 resets) in 347 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (77 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (78 resets) in 370 ms. (107 steps per ms) remains 14/14 properties
[2025-06-04 18:40:57] [INFO ] Flatten gal took : 356 ms
BEST_FIRST walk for 40003 steps (76 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (53 resets) in 166 ms. (239 steps per ms) remains 13/14 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (80 resets) in 293 ms. (136 steps per ms) remains 13/13 properties
[2025-06-04 18:40:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9206475436833840150.gal : 179 ms
BEST_FIRST walk for 40003 steps (53 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
[2025-06-04 18:40:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4163249770022411694.prop : 6 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/ReachabilityCardinality9206475436833840150.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4163249770022411694.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
// Phase 1: matrix 2136 rows 1534 cols
[2025-06-04 18:40:58] [INFO ] Computed 6 invariants in 64 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Loading property file /tmp/ReachabilityCardinality4163249770022411694.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2025-04 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1363/1534 variables, 6/177 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1363/1540 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1534 variables, 0/1540 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2136/3670 variables, 1534/3074 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :12 after 17
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :17 after 19
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :19 after 192
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :192 after 999
SDD proceeding with computation,13 properties remain. new max is 1024
SDD size :999 after 1094
SDD proceeding with computation,13 properties remain. new max is 2048
SDD size :1094 after 2372
SDD proceeding with computation,13 properties remain. new max is 4096
SDD size :2372 after 11199
At refinement iteration 6 (INCLUDED_ONLY) 0/3670 variables, 0/3074 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SDD proceeding with computation,13 properties remain. new max is 8192
SDD size :11199 after 1.10618e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3670/3670 variables, and 3074 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5053 ms.
Refiners :[Domain max(s): 1534/1534 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1534/1534 constraints, PredecessorRefiner: 13/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1365/1534 variables, 6/175 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1534 variables, 1365/1540 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,13 properties remain. new max is 16384
SDD size :1.10618e+06 after 1.10518e+07
[2025-06-04 18:41:05] [INFO ] Deduced a trap composed of 396 places in 892 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:06] [INFO ] Deduced a trap composed of 397 places in 1074 ms of which 46 ms to minimize.
SDD proceeding with computation,13 properties remain. new max is 32768
SDD size :1.10518e+07 after 1.58702e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:08] [INFO ] Deduced a trap composed of 396 places in 1425 ms of which 539 ms to minimize.
SMT process timed out in 10782ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 169 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1132 edges and 1534 vertex of which 69 / 1534 are part of one of the 11 SCC in 12 ms
Free SCC test removed 58 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Graph (complete) has 2202 edges and 1476 vertex of which 1468 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.21 ms
Discarding 8 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 787 transitions
Trivial Post-agglo rules discarded 787 transitions
Performed 787 trivial Post agglomeration. Transition count delta: 787
Iterating post reduction 0 with 791 rules applied. Total rules applied 793 place count 1468 transition count 1267
Reduce places removed 787 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 794 rules applied. Total rules applied 1587 place count 681 transition count 1260
Reduce places removed 3 places and 0 transitions.
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Iterating post reduction 2 with 116 rules applied. Total rules applied 1703 place count 678 transition count 1147
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 114 rules applied. Total rules applied 1817 place count 565 transition count 1146
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 1817 place count 565 transition count 1064
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 1981 place count 483 transition count 1064
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 2062 place count 402 transition count 983
Iterating global reduction 4 with 81 rules applied. Total rules applied 2143 place count 402 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2146 place count 402 transition count 980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2146 place count 402 transition count 979
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2148 place count 401 transition count 979
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2156 place count 393 transition count 971
Iterating global reduction 5 with 8 rules applied. Total rules applied 2164 place count 393 transition count 971
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 2192 place count 379 transition count 957
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2195 place count 376 transition count 954
Iterating global reduction 5 with 3 rules applied. Total rules applied 2198 place count 376 transition count 954
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2201 place count 373 transition count 951
Iterating global reduction 5 with 3 rules applied. Total rules applied 2204 place count 373 transition count 951
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2205 place count 372 transition count 950
Iterating global reduction 5 with 1 rules applied. Total rules applied 2206 place count 372 transition count 950
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 2222 place count 364 transition count 953
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2224 place count 364 transition count 951
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 2238 place count 364 transition count 937
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 2252 place count 350 transition count 937
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2253 place count 350 transition count 936
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2254 place count 350 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2255 place count 349 transition count 935
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 2258 place count 349 transition count 935
Applied a total of 2258 rules in 649 ms. Remains 349 /1534 variables (removed 1185) and now considering 935/2136 (removed 1201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 661 ms. Remains : 349/1534 places, 935/2136 transitions.
RANDOM walk for 40000 steps (1854 resets) in 510 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (288 resets) in 318 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (313 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (295 resets) in 88 ms. (449 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (303 resets) in 237 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (308 resets) in 346 ms. (115 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (297 resets) in 139 ms. (285 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (297 resets) in 333 ms. (119 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (290 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (297 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (304 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (305 resets) in 315 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (222 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 325660 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :2 out of 12
Probabilistic random walk after 325660 steps, saw 76674 distinct states, run finished after 3011 ms. (steps per millisecond=108 ) properties seen :2
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 935 rows 349 cols
[2025-06-04 18:41:13] [INFO ] Computed 6 invariants in 23 ms
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/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,13 properties remain. new max is 65536
SDD size :1.58702e+07 after 9.37797e+08
At refinement iteration 1 (OVERLAPS) 192/349 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 935/1284 variables, 349/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1284 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/1284 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1284/1284 variables, and 355 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1980 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 10/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 192/349 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:16] [INFO ] Deduced a trap composed of 92 places in 354 ms of which 18 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2025-06 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:16] [INFO ] Deduced a trap composed of 86 places in 323 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:17] [INFO ] Deduced a trap composed of 93 places in 407 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:17] [INFO ] Deduced a trap composed of 76 places in 390 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:17] [INFO ] Deduced a trap composed of 87 places in 316 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:18] [INFO ] Deduced a trap composed of 91 places in 280 ms of which 7 ms to minimize.
Problem StigmergyCommit-PT-04b-ReachabilityFireability-2025-15 is UNSAT
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 6/12 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:18] [INFO ] Deduced a trap composed of 82 places in 280 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:19] [INFO ] Deduced a trap composed of 87 places in 339 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:19] [INFO ] Deduced a trap composed of 110 places in 324 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:19] [INFO ] Deduced a trap composed of 110 places in 397 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:20] [INFO ] Deduced a trap composed of 89 places in 363 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:20] [INFO ] Deduced a trap composed of 78 places in 361 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:21] [INFO ] Deduced a trap composed of 90 places in 393 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 7/19 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:21] [INFO ] Deduced a trap composed of 96 places in 391 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:22] [INFO ] Deduced a trap composed of 89 places in 393 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 1/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 935/1284 variables, 349/370 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1284 variables, 3/373 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1284 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1284 variables, 0/373 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1284/1284 variables, and 373 constraints, problems are : Problem set: 2 solved, 8 unsolved in 9680 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 10/3 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11736ms problems are : Problem set: 2 solved, 8 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 1172 ms.
Support contains 86 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 935/935 transitions.
Graph (trivial) has 157 edges and 349 vertex of which 6 / 349 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 917 edges and 346 vertex of which 345 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 345 transition count 871
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 63 rules applied. Total rules applied 123 place count 288 transition count 865
Reduce places removed 1 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 19 rules applied. Total rules applied 142 place count 287 transition count 847
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 162 place count 269 transition count 845
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 162 place count 269 transition count 829
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 194 place count 253 transition count 829
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 201 place count 246 transition count 808
Iterating global reduction 4 with 7 rules applied. Total rules applied 208 place count 246 transition count 808
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 209 place count 246 transition count 807
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 211 place count 244 transition count 805
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 244 transition count 805
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 215 place count 242 transition count 803
Iterating global reduction 5 with 2 rules applied. Total rules applied 217 place count 242 transition count 803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 218 place count 241 transition count 802
Iterating global reduction 5 with 1 rules applied. Total rules applied 219 place count 241 transition count 802
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 222 place count 241 transition count 799
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 240 place count 232 transition count 790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 242 place count 232 transition count 788
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 245 place count 229 transition count 785
Iterating global reduction 7 with 3 rules applied. Total rules applied 248 place count 229 transition count 785
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 249 place count 228 transition count 784
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 228 transition count 784
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 251 place count 228 transition count 783
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 253 place count 227 transition count 792
Free-agglomeration rule applied 25 times.
Iterating global reduction 8 with 25 rules applied. Total rules applied 278 place count 227 transition count 767
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 8 with 25 rules applied. Total rules applied 303 place count 202 transition count 767
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 327 place count 202 transition count 743
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 329 place count 201 transition count 756
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 334 place count 201 transition count 756
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 335 place count 201 transition count 755
Applied a total of 335 rules in 253 ms. Remains 201 /349 variables (removed 148) and now considering 755/935 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 201/349 places, 755/935 transitions.
RANDOM walk for 40000 steps (2190 resets) in 1066 ms. (37 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (349 resets) in 324 ms. (123 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (363 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (352 resets) in 219 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (354 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 377060 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 4
Probabilistic random walk after 377060 steps, saw 91712 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 755 rows 201 cols
[2025-06-04 18:41:30] [INFO ] Computed 6 invariants in 9 ms
[2025-06-04 18:41:30] [INFO ] State equation strengthened by 16 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/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 115/201 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 755/956 variables, 201/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/956 variables, 16/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/956 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/956 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 956/956 variables, and 223 constraints, problems are : Problem set: 0 solved, 4 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 201/201 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 115/201 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:31] [INFO ] Deduced a trap composed of 76 places in 296 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:31] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:31] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:32] [INFO ] Deduced a trap composed of 33 places in 299 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:32] [INFO ] Deduced a trap composed of 38 places in 258 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 755/956 variables, 201/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/956 variables, 16/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/956 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:33] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:33] [INFO ] Deduced a trap composed of 59 places in 364 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:34] [INFO ] Deduced a trap composed of 78 places in 347 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:34] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/956 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:35] [INFO ] Deduced a trap composed of 57 places in 384 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:35] [INFO ] Deduced a trap composed of 42 places in 330 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:35] [INFO ] Deduced a trap composed of 54 places in 236 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/956 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/956 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:36] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:36] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 10 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/956 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:37] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/956 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/956 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/956 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 956/956 variables, and 240 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6733 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 201/201 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7395ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-10 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 240 ms.
Support contains 58 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 755/755 transitions.
Graph (trivial) has 49 edges and 201 vertex of which 2 / 201 are part of one of the 1 SCC in 1 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 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 200 transition count 737
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 30 rules applied. Total rules applied 47 place count 184 transition count 723
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 60 place count 172 transition count 722
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 172 transition count 718
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 168 transition count 718
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 71 place count 165 transition count 635
Iterating global reduction 3 with 3 rules applied. Total rules applied 74 place count 165 transition count 635
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 165 transition count 633
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 163 transition count 631
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 163 transition count 629
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 84 place count 161 transition count 627
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 161 transition count 627
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 101 place count 161 transition count 612
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 106 place count 161 transition count 607
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 111 place count 156 transition count 607
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 115 place count 152 transition count 603
Iterating global reduction 6 with 4 rules applied. Total rules applied 119 place count 152 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 152 transition count 603
Applied a total of 120 rules in 146 ms. Remains 152 /201 variables (removed 49) and now considering 603/755 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 152/201 places, 603/755 transitions.
RANDOM walk for 40000 steps (1404 resets) in 409 ms. (97 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (211 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (218 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 617711 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 2
Probabilistic random walk after 617711 steps, saw 134863 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
// Phase 1: matrix 603 rows 152 cols
[2025-06-04 18:41:41] [INFO ] Computed 6 invariants in 10 ms
[2025-06-04 18:41:41] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/152 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 603/755 variables, 152/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 220/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:42] [INFO ] Deduced a trap composed of 22 places in 359 ms of which 24 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/755 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/755 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 379 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 152/152 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 93/151 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:42] [INFO ] Deduced a trap composed of 45 places in 260 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:43] [INFO ] Deduced a trap composed of 42 places in 268 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:43] [INFO ] Deduced a trap composed of 43 places in 283 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/152 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 603/755 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 220/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:44] [INFO ] Deduced a trap composed of 58 places in 232 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 18:41:44] [INFO ] Deduced a trap composed of 39 places in 601 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/755 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/755 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/755 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 385 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2514 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 152/152 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3683ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 81 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 603/603 transitions.
Graph (trivial) has 112 edges and 152 vertex of which 4 / 152 are part of one of the 2 SCC in 1 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 150 transition count 551
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 102 transition count 551
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 97 place count 102 transition count 548
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 103 place count 99 transition count 548
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 120 place count 82 transition count 214
Iterating global reduction 2 with 17 rules applied. Total rules applied 137 place count 82 transition count 214
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 145 place count 82 transition count 206
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 78 transition count 202
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 78 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 76 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 76 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 76 transition count 199
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
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 174 place count 68 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 179 place count 68 transition count 185
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 188 place count 59 transition count 176
Iterating global reduction 5 with 9 rules applied. Total rules applied 197 place count 59 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 198 place count 59 transition count 175
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 203 place count 54 transition count 170
Iterating global reduction 6 with 5 rules applied. Total rules applied 208 place count 54 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 211 place count 54 transition count 167
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 214 place count 51 transition count 163
Iterating global reduction 7 with 3 rules applied. Total rules applied 217 place count 51 transition count 163
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 227 place count 51 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 229 place count 50 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 231 place count 50 transition count 165
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 232 place count 49 transition count 163
Iterating global reduction 8 with 1 rules applied. Total rules applied 233 place count 49 transition count 163
Free-agglomeration rule applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 254 place count 49 transition count 142
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 8 with 76 rules applied. Total rules applied 330 place count 28 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 342 place count 28 transition count 75
Applied a total of 342 rules in 180 ms. Remains 28 /152 variables (removed 124) and now considering 75/603 (removed 528) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 28/152 places, 75/603 transitions.
RANDOM walk for 541 steps (0 resets) in 25 ms. (20 steps per ms) remains 0/1 properties
FORMULA StigmergyCommit-PT-04b-ReachabilityFireability-2025-02 TRUE 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 50754 ms.

BK_STOP 1749062505517

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="StigmergyCommit-PT-04b"
export BK_EXAMINATION="ReachabilityFireability"
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 StigmergyCommit-PT-04b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r226-smll-174903490600047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04b.tgz
mv StigmergyCommit-PT-04b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;