Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K 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 1.4M 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-05b-ReachabilityCardinality-2025-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749068952157

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 20:29:14] [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 20:29:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 20:29:15] [INFO ] Load time of PNML (sax parser for PT used): 646 ms
[2025-06-04 20:29:15] [INFO ] Transformed 1837 places.
[2025-06-04 20:29:15] [INFO ] Transformed 3460 transitions.
[2025-06-04 20:29:15] [INFO ] Found NUPN structural information;
[2025-06-04 20:29:15] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 973 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 45 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (351 resets) in 3202 ms. (12 steps per ms) remains 8/12 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 504 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (56 resets) in 828 ms. (48 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (59 resets) in 566 ms. (70 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (54 resets) in 167 ms. (238 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (60 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (59 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
// Phase 1: matrix 3460 rows 1837 cols
[2025-06-04 20:29:17] [INFO ] Flatten gal took : 1030 ms
[2025-06-04 20:29:18] [INFO ] Computed 7 invariants in 171 ms
Excessive predecessor constraint size, skipping predecessor.
[2025-06-04 20:29:18] [INFO ] Flatten gal took : 431 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 20:29:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8400957619581671624.gal : 192 ms
[2025-06-04 20:29:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13501180503614267066.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/ReachabilityCardinality8400957619581671624.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13501180503614267066.prop' '--nowitness' '--gen-order' 'FOLLOW'
All remaining problems are real, not stopping.

At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
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
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem StigmergyCommit-PT-05b-ReachabilityCardinality-2025-03 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1746/1837 variables, 7/98 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1837 variables, 1746/1844 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Loading property file /tmp/ReachabilityCardinality13501180503614267066.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1837 variables, 0/1844 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 3460/5297 variables, 1837/3681 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/5297 variables, 0/3681 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/5297 variables, 0/3681 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5297/5297 variables, and 3681 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5078 ms.
Refiners :[Domain max(s): 1837/1837 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1837/1837 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1766/1837 variables, 7/78 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1837 variables, 1766/1844 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:28] [INFO ] Deduced a trap composed of 397 places in 3768 ms of which 1680 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :10 after 13
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :13 after 18
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :18 after 20
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :20 after 227
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :227 after 1208
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :1208 after 7003
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :7003 after 7521
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :7521 after 26177
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :26177 after 226610
[2025-06-04 20:29:31] [INFO ] Deduced a trap composed of 397 places in 3326 ms of which 1103 ms to minimize.
SMT process timed out in 13671ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1688 edges and 1837 vertex of which 87 / 1837 are part of one of the 14 SCC in 11 ms
Free SCC test removed 73 places
Drop transitions (Empty/Sink Transition effects.) removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 2767 edges and 1764 vertex of which 1754 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.30 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 1245 transitions
Trivial Post-agglo rules discarded 1245 transitions
Performed 1245 trivial Post agglomeration. Transition count delta: 1245
Iterating post reduction 0 with 1250 rules applied. Total rules applied 1252 place count 1754 transition count 2113
Reduce places removed 1245 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 1267 rules applied. Total rules applied 2519 place count 509 transition count 2091
SDD proceeding with computation,8 properties remain. new max is 16384
Reduce places removed 7 places and 0 transitions.
SDD size :226610 after 4.367e+06
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 2 with 62 rules applied. Total rules applied 2581 place count 502 transition count 2036
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 57 rules applied. Total rules applied 2638 place count 447 transition count 2034
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2639 place count 446 transition count 2034
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 71 Pre rules applied. Total rules applied 2639 place count 446 transition count 1963
Deduced a syphon composed of 71 places in 5 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 2781 place count 375 transition count 1963
Discarding 60 places :
Symmetric choice reduction at 5 with 60 rule applications. Total rules 2841 place count 315 transition count 1903
Iterating global reduction 5 with 60 rules applied. Total rules applied 2901 place count 315 transition count 1903
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2901 place count 315 transition count 1902
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2903 place count 314 transition count 1902
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 2933 place count 284 transition count 605
Iterating global reduction 5 with 30 rules applied. Total rules applied 2963 place count 284 transition count 605
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 2971 place count 284 transition count 597
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2975 place count 280 transition count 593
Iterating global reduction 6 with 4 rules applied. Total rules applied 2979 place count 280 transition count 593
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2982 place count 277 transition count 590
Iterating global reduction 6 with 3 rules applied. Total rules applied 2985 place count 277 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2987 place count 277 transition count 588
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 3043 place count 249 transition count 560
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3049 place count 243 transition count 554
Iterating global reduction 7 with 6 rules applied. Total rules applied 3055 place count 243 transition count 554
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3061 place count 237 transition count 548
Iterating global reduction 7 with 6 rules applied. Total rules applied 3067 place count 237 transition count 548
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 3073 place count 231 transition count 542
Iterating global reduction 7 with 6 rules applied. Total rules applied 3079 place count 231 transition count 542
Performed 4 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 3087 place count 227 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 3093 place count 227 transition count 545
Free-agglomeration rule applied 47 times.
Iterating global reduction 7 with 47 rules applied. Total rules applied 3140 place count 227 transition count 498
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 7 with 47 rules applied. Total rules applied 3187 place count 180 transition count 498
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 8 with 69 rules applied. Total rules applied 3256 place count 180 transition count 429
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3257 place count 180 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3258 place count 179 transition count 428
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 3266 place count 179 transition count 428
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 3270 place count 179 transition count 424
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3271 place count 179 transition count 424
Applied a total of 3271 rules in 812 ms. Remains 179 /1837 variables (removed 1658) and now considering 424/3460 (removed 3036) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 823 ms. Remains : 179/1837 places, 424/3460 transitions.
RANDOM walk for 40000 steps (2016 resets) in 958 ms. (41 steps per ms) remains 5/7 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (273 resets) in 90 ms. (439 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (281 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (264 resets) in 192 ms. (207 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (280 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (275 resets) in 109 ms. (363 steps per ms) remains 5/5 properties
// Phase 1: matrix 424 rows 179 cols
[2025-06-04 20:29:32] [INFO ] Computed 7 invariants in 4 ms
[2025-06-04 20:29:32] [INFO ] State equation strengthened by 204 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 139/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/179 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/603 variables, 179/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 204/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/603 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 390 constraints, problems are : Problem set: 0 solved, 5 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 139/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:33] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:34] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:34] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:34] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:35] [INFO ] Deduced a trap composed of 31 places in 214 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:35] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:35] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:35] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:36] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:36] [INFO ] Deduced a trap composed of 35 places in 195 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:36] [INFO ] Deduced a trap composed of 38 places in 252 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:36] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:36] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:37] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:38] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/179 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:39] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 424/603 variables, 179/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/603 variables, 204/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/603 variables, 5/422 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:39] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/603 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:40] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 22 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/603 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/603 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 424 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7440 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8216ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1064 ms.
Support contains 37 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 424/424 transitions.
Graph (trivial) has 73 edges and 179 vertex of which 8 / 179 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 525 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 173 transition count 394
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 152 transition count 391
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 149 transition count 391
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51 place count 149 transition count 386
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 61 place count 144 transition count 386
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 66 place count 139 transition count 381
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 139 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 139 transition count 380
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 137 transition count 378
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 137 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 137 transition count 372
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 136 transition count 371
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 136 transition count 371
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 98 place count 129 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 100 place count 129 transition count 362
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 104 place count 125 transition count 358
Iterating global reduction 6 with 4 rules applied. Total rules applied 108 place count 125 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 113 place count 125 transition count 353
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 115 place count 123 transition count 351
Iterating global reduction 7 with 2 rules applied. Total rules applied 117 place count 123 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 118 place count 123 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 120 place count 122 transition count 356
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 123 place count 122 transition count 353
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 133 place count 122 transition count 343
Reduce places removed 10 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 145 place count 112 transition count 341
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 148 place count 109 transition count 338
Iterating global reduction 9 with 3 rules applied. Total rules applied 151 place count 109 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 9 with 31 rules applied. Total rules applied 182 place count 109 transition count 307
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 184 place count 109 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 185 place count 109 transition count 306
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 186 place count 109 transition count 305
Applied a total of 186 rules in 126 ms. Remains 109 /179 variables (removed 70) and now considering 305/424 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 109/179 places, 305/424 transitions.
RANDOM walk for 40000 steps (1403 resets) in 389 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (188 resets) in 117 ms. (339 steps per ms) remains 3/5 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (268 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (257 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (250 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
// Phase 1: matrix 305 rows 109 cols
[2025-06-04 20:29:42] [INFO ] Computed 7 invariants in 5 ms
[2025-06-04 20:29:42] [INFO ] State equation strengthened by 194 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/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 305/414 variables, 109/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 194/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 310 constraints, problems are : Problem set: 0 solved, 3 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:43] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 305/414 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 194/323 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 20:29:44] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 327 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 109/109 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2549ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 35 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 305/305 transitions.
Graph (trivial) has 13 edges and 109 vertex of which 4 / 109 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 106 transition count 300
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 105 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 104 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 104 transition count 298
Applied a total of 7 rules in 21 ms. Remains 104 /109 variables (removed 5) and now considering 298/305 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 104/109 places, 298/305 transitions.
RANDOM walk for 40000 steps (1386 resets) in 270 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (265 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (254 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (254 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 620119 steps, run visited all 3 properties in 2052 ms. (steps per millisecond=302 )
Probabilistic random walk after 620119 steps, saw 99163 distinct states, run finished after 2058 ms. (steps per millisecond=301 ) properties seen :3
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 32892 ms.

BK_STOP 1749068987659

--------------------
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-05b"
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-05b, 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-174903490600062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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