About the Execution of ITS-Tools for StigmergyCommit-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 48664.00 | 0.00 | 0.00 | FTFTTTFFFFFFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490700078.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-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903490700078
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.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 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 3.7M 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-06b-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749079997372
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 23:33:20] [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-04 23:33:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 23:33:21] [INFO ] Load time of PNML (sax parser for PT used): 858 ms
[2025-06-04 23:33:21] [INFO ] Transformed 2140 places.
[2025-06-04 23:33:21] [INFO ] Transformed 6760 transitions.
[2025-06-04 23:33:21] [INFO ] Found NUPN structural information;
[2025-06-04 23:33:21] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 1752 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (305 resets) in 3590 ms. (11 steps per ms) remains 11/14 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (47 resets) in 1909 ms. (20 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 471 ms. (84 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (47 resets) in 309 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (43 resets) in 167 ms. (238 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 319 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (46 resets) in 255 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (44 resets) in 265 ms. (150 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (45 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (42 resets) in 184 ms. (216 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (48 resets) in 343 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (44 resets) in 314 ms. (126 steps per ms) remains 11/11 properties
// Phase 1: matrix 6760 rows 2140 cols
[2025-06-04 23:33:26] [INFO ] Computed 8 invariants in 369 ms
[2025-06-04 23:33:27] [INFO ] Flatten gal took : 2068 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 23:33:27] [INFO ] Flatten gal took : 630 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2025-06-04 23:33:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13846609282313326440.gal : 362 ms
[2025-06-04 23:33:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6281632211250991308.prop : 3 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/ReachabilityCardinality13846609282313326440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6281632211250991308.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 ...329
Problem StigmergyCommit-PT-06b-ReachabilityCardinality-2025-02 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2026/2140 variables, 8/122 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2026/2148 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality6281632211250991308.prop.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8900/8900 variables, and 4288 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5087 ms.
Refiners :[Domain max(s): 2140/2140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2140/2140 constraints, PredecessorRefiner: 11/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem StigmergyCommit-PT-06b-ReachabilityCardinality-2025-01 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2037/2140 variables, 8/111 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2037/2148 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:38] [INFO ] Deduced a trap composed of 397 places in 5177 ms of which 1181 ms to minimize.
SMT process timed out in 12426ms, After SMT, problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 2000 edges and 2140 vertex of which 108 / 2140 are part of one of the 16 SCC in 13 ms
Free SCC test removed 92 places
Drop transitions (Empty/Sink Transition effects.) removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Graph (complete) has 3369 edges and 2048 vertex of which 2038 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.47 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1493 transitions
Trivial Post-agglo rules discarded 1493 transitions
Performed 1493 trivial Post agglomeration. Transition count delta: 1493
Iterating post reduction 0 with 1498 rules applied. Total rules applied 1500 place count 2038 transition count 5140
Reduce places removed 1493 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 1531 rules applied. Total rules applied 3031 place count 545 transition count 5102
Reduce places removed 15 places and 0 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Iterating post reduction 2 with 63 rules applied. Total rules applied 3094 place count 530 transition count 5054
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 3 with 48 rules applied. Total rules applied 3142 place count 482 transition count 5054
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 3142 place count 482 transition count 4981
Deduced a syphon composed of 73 places in 4 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 3288 place count 409 transition count 4981
Discarding 74 places :
Symmetric choice reduction at 4 with 74 rule applications. Total rules 3362 place count 335 transition count 4907
Iterating global reduction 4 with 74 rules applied. Total rules applied 3436 place count 335 transition count 4907
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 3471 place count 300 transition count 818
Iterating global reduction 4 with 35 rules applied. Total rules applied 3506 place count 300 transition count 818
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 3517 place count 300 transition count 807
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 3523 place count 294 transition count 801
Iterating global reduction 5 with 6 rules applied. Total rules applied 3529 place count 294 transition count 801
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 3535 place count 288 transition count 795
Iterating global reduction 5 with 6 rules applied. Total rules applied 3541 place count 288 transition count 795
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3544 place count 288 transition count 792
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 3602 place count 259 transition count 763
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3603 place count 259 transition count 762
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3610 place count 252 transition count 755
Iterating global reduction 7 with 7 rules applied. Total rules applied 3617 place count 252 transition count 755
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3623 place count 246 transition count 749
Iterating global reduction 7 with 6 rules applied. Total rules applied 3629 place count 246 transition count 749
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3635 place count 240 transition count 743
Iterating global reduction 7 with 6 rules applied. Total rules applied 3641 place count 240 transition count 743
Performed 7 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 3655 place count 233 transition count 761
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 3657 place count 233 transition count 759
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 3664 place count 233 transition count 752
Free-agglomeration rule applied 54 times.
Iterating global reduction 8 with 54 rules applied. Total rules applied 3718 place count 233 transition count 698
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 8 with 54 rules applied. Total rules applied 3772 place count 179 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 9 with 132 rules applied. Total rules applied 3904 place count 179 transition count 566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3906 place count 179 transition count 564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3908 place count 177 transition count 564
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 3916 place count 177 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3917 place count 177 transition count 563
Applied a total of 3917 rules in 1435 ms. Remains 177 /2140 variables (removed 1963) and now considering 563/6760 (removed 6197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1449 ms. Remains : 177/2140 places, 563/6760 transitions.
RANDOM walk for 40000 steps (853 resets) in 2085 ms. (19 steps per ms) remains 7/9 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (158 resets) in 140 ms. (283 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (153 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (153 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (157 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (154 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (147 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (151 resets) in 173 ms. (229 steps per ms) remains 7/7 properties
// Phase 1: matrix 563 rows 177 cols
[2025-06-04 23:33:41] [INFO ] Computed 8 invariants in 5 ms
[2025-06-04 23:33:41] [INFO ] State equation strengthened by 320 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 122/177 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 563/740 variables, 177/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 320/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/740 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/740 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 740/740 variables, and 505 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 177/177 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 7/6 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/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 122/177 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:42] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:43] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:43] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:43] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:43] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:44] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:44] [INFO ] Deduced a trap composed of 30 places in 195 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:44] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:44] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:44] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:45] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:45] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:45] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:45] [INFO ] Deduced a trap composed of 28 places in 195 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:45] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 30 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 24 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:46] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:47] [INFO ] Deduced a trap composed of 28 places in 208 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:47] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 563/740 variables, 177/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 320/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/740 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 740/740 variables, and 534 constraints, problems are : Problem set: 0 solved, 7 unsolved in 7126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 177/177 constraints, ReadFeed: 320/320 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8315ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1563 ms.
Support contains 55 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 563/563 transitions.
Graph (trivial) has 30 edges and 177 vertex of which 2 / 177 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 176 transition count 553
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 168 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 17 place count 168 transition count 552
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 167 transition count 552
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 31 place count 161 transition count 546
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 2 with 65 rules applied. Total rules applied 96 place count 161 transition count 481
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 159 transition count 479
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 159 transition count 479
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 157 transition count 477
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 157 transition count 477
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 114 place count 157 transition count 467
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 157 transition count 464
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 120 place count 154 transition count 464
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 154 transition count 464
Applied a total of 121 rules in 174 ms. Remains 154 /177 variables (removed 23) and now considering 464/563 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 154/177 places, 464/563 transitions.
RANDOM walk for 40000 steps (945 resets) in 321 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (180 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (181 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (171 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (179 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (180 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (168 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (180 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 492221 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :1 out of 7
Probabilistic random walk after 492221 steps, saw 84518 distinct states, run finished after 3021 ms. (steps per millisecond=162 ) properties seen :1
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 464 rows 154 cols
[2025-06-04 23:33:54] [INFO ] Computed 8 invariants in 3 ms
[2025-06-04 23:33:54] [INFO ] State equation strengthened by 265 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/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 100/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 464/618 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/618 variables, 265/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/618 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 618/618 variables, and 427 constraints, problems are : Problem set: 0 solved, 6 unsolved in 804 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 100/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:55] [INFO ] Deduced a trap composed of 21 places in 260 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:56] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:56] [INFO ] Deduced a trap composed of 26 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:56] [INFO ] Deduced a trap composed of 27 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:56] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:56] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:57] [INFO ] Deduced a trap composed of 22 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:58] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:58] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:33:58] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 464/618 variables, 154/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/618 variables, 265/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/618 variables, 5/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/618 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/618 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 618/618 variables, and 447 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5002 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 6/5 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5859ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 895 ms.
Support contains 19 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 464/464 transitions.
Graph (trivial) has 80 edges and 154 vertex of which 14 / 154 are part of one of the 5 SCC in 0 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 513 edges and 145 vertex of which 143 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 143 transition count 421
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 118 transition count 419
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 116 transition count 419
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 116 transition count 418
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 115 transition count 418
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 65 place count 110 transition count 413
Iterating global reduction 3 with 5 rules applied. Total rules applied 70 place count 110 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 110 transition count 412
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 73 place count 108 transition count 410
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 108 transition count 410
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 107 transition count 409
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 107 transition count 409
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 97 place count 97 transition count 399
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 97 transition count 396
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 114 place count 83 transition count 382
Iterating global reduction 5 with 14 rules applied. Total rules applied 128 place count 83 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 131 place count 83 transition count 379
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 82 transition count 378
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 82 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 139 place count 82 transition count 372
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 149 place count 82 transition count 362
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 155 place count 82 transition count 356
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 162 place count 76 transition count 355
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 165 place count 76 transition count 352
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 170 place count 76 transition count 352
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 172 place count 76 transition count 350
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 173 place count 75 transition count 348
Iterating global reduction 8 with 1 rules applied. Total rules applied 174 place count 75 transition count 348
Applied a total of 174 rules in 208 ms. Remains 75 /154 variables (removed 79) and now considering 348/464 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 75/154 places, 348/464 transitions.
RANDOM walk for 40000 steps (1401 resets) in 327 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (219 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (207 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :14 after 20
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :20 after 22
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :22 after 228
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :228 after 4439
Interrupted probabilistic random walk after 1155016 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :1 out of 2
Probabilistic random walk after 1155016 steps, saw 161820 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :1
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 348 rows 75 cols
[2025-06-04 23:34:04] [INFO ] Computed 8 invariants in 9 ms
[2025-06-04 23:34:04] [INFO ] State equation strengthened by 286 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/75 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 348/423 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 286/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/75 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:34:05] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:34:05] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 23:34:05] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 348/423 variables, 75/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 286/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/423 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 52 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
FORMULA StigmergyCommit-PT-06b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
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 45832 ms.
BK_STOP 1749080046036
--------------------
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="StigmergyCommit-PT-06b"
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 StigmergyCommit-PT-06b, 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-174903490700078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-06b.tgz
mv StigmergyCommit-PT-06b 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 '
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 ;