Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200374.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is ASLink-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200374
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.0K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 921K Mar 3 18:30 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 ASLink-PT-06b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-06b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779479654944

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 19:54:16] [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]
[2026-05-22 19:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:54:17] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2026-05-22 19:54:17] [INFO ] Transformed 2826 places.
[2026-05-22 19:54:17] [INFO ] Transformed 3513 transitions.
[2026-05-22 19:54:17] [INFO ] Found NUPN structural information;
[2026-05-22 19:54:17] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (67 resets) in 2042 ms. (19 steps per ms) remains 7/12 properties
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 413 ms. (96 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 7/7 properties
[2026-05-22 19:54:18] [INFO ] Flatten gal took : 463 ms
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
[2026-05-22 19:54:19] [INFO ] Flatten gal took : 282 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4900853470153373951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2693598159383733330.kers'
[2026-05-22 19:54:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17202533454658675005.gal : 125 ms
[2026-05-22 19:54:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality674657749651898875.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17202533454658675005.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality674657749651898875.prop' '--nowitness' '--gen-order' 'FOLLOW'
[2026-05-22 19:54:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4900853470153373951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2693598159383733330.kers]

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Culled 0 columns in 3 ms.
// Phase 1: matrix 3513 rows 2826 cols 10709 entries
Finished phase 1 with 1910 SingleSign rule and 639 generalized
[2026-05-22 19:54:19] [INFO ] Computed 277 invariants in 30 ms
Computed 277 P flows in 32 ms.
Exported basis to /tmp/petrispot-output-2693598159383733330.kers
Total runtime 35 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality674657749651898875.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1140/1271 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1271 variables, 1140/1328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1271 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 60/1331 variables, 4/1332 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 60/1392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1331 variables, 0/1392 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1426/2757 variables, 192/1584 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2757 variables, 1426/3010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2757 variables, 0/3010 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 69/2826 variables, 24/3034 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2826 variables, 69/3103 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2826/6339 variables, and 3103 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5034 ms.
Refiners :[Domain max(s): 2826/2826 constraints, Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 216/216 constraints, State Equation: 0/2826 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 10
At refinement iteration 2 (OVERLAPS) 1140/1271 variables, 57/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :18 after 290
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :290 after 390
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :390 after 803
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :803 after 26854
At refinement iteration 3 (INCLUDED_ONLY) 0/1271 variables, 1140/1328 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :26854 after 109776
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :109776 after 898971
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :898971 after 1.46003e+11
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.8811e+11
At refinement iteration 4 (INCLUDED_ONLY) 0/1271 variables, 1/1329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1271 variables, 0/1329 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 60/1331 variables, 4/1333 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1331 variables, 60/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1331 variables, 0/1393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-06b-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 1426/2757 variables, 192/1585 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2757 variables, 1426/3011 constraints. Problems are: Problem set: 1 solved, 6 unsolved
SMT process timed out in 11033ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 72 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 602 rules applied. Total rules applied 602 place count 2826 transition count 2911
Reduce places removed 602 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 632 rules applied. Total rules applied 1234 place count 2224 transition count 2881
Reduce places removed 8 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 28 rules applied. Total rules applied 1262 place count 2216 transition count 2861
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1282 place count 2196 transition count 2861
Performed 628 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 628 Pre rules applied. Total rules applied 1282 place count 2196 transition count 2233
Deduced a syphon composed of 628 places in 5 ms
Ensure Unique test removed 55 places
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 4 with 1311 rules applied. Total rules applied 2593 place count 1513 transition count 2233
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 45 rules applied. Total rules applied 2638 place count 1502 transition count 2199
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 36 rules applied. Total rules applied 2674 place count 1468 transition count 2197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2676 place count 1466 transition count 2197
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2676 place count 1466 transition count 2177
Deduced a syphon composed of 20 places in 12 ms
Ensure Unique test removed 16 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 2732 place count 1430 transition count 2177
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2734 place count 1429 transition count 2176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2735 place count 1428 transition count 2176
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 17 Pre rules applied. Total rules applied 2735 place count 1428 transition count 2159
Deduced a syphon composed of 17 places in 12 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 34 rules applied. Total rules applied 2769 place count 1411 transition count 2159
Discarding 81 places :
Symmetric choice reduction at 9 with 81 rule applications. Total rules 2850 place count 1330 transition count 2078
Iterating global reduction 9 with 81 rules applied. Total rules applied 2931 place count 1330 transition count 2078
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2932 place count 1330 transition count 2077
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 23 Pre rules applied. Total rules applied 2932 place count 1330 transition count 2054
Deduced a syphon composed of 23 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 10 with 47 rules applied. Total rules applied 2979 place count 1306 transition count 2054
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2979 place count 1306 transition count 2053
Deduced a syphon composed of 1 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 2982 place count 1304 transition count 2053
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 2988 place count 1298 transition count 2014
Iterating global reduction 10 with 6 rules applied. Total rules applied 2994 place count 1298 transition count 2014
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 2994 place count 1298 transition count 2010
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3002 place count 1294 transition count 2010
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3003 place count 1293 transition count 2002
Iterating global reduction 10 with 1 rules applied. Total rules applied 3004 place count 1293 transition count 2002
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 10 with 338 rules applied. Total rules applied 3342 place count 1123 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3343 place count 1122 transition count 1833
Ensure Unique test removed 1 places
Iterating global reduction 10 with 2 rules applied. Total rules applied 3345 place count 1121 transition count 1833
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3346 place count 1120 transition count 1832
Iterating global reduction 10 with 1 rules applied. Total rules applied 3347 place count 1120 transition count 1832
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3348 place count 1120 transition count 1831
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3350 place count 1119 transition count 1840
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 3359 place count 1119 transition count 1831
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 3368 place count 1110 transition count 1831
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 3379 place count 1110 transition count 1820
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 12 with 11 rules applied. Total rules applied 3390 place count 1099 transition count 1820
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3391 place count 1099 transition count 1820
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3392 place count 1098 transition count 1819
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 6 rules applied. Total rules applied 3398 place count 1093 transition count 1818
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3399 place count 1092 transition count 1818
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 7 Pre rules applied. Total rules applied 3399 place count 1092 transition count 1811
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 15 with 14 rules applied. Total rules applied 3413 place count 1085 transition count 1811
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 15 with 3 rules applied. Total rules applied 3416 place count 1082 transition count 1811
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 16 with 14 rules applied. Total rules applied 3430 place count 1075 transition count 1804
Discarding 3 places :
Symmetric choice reduction at 16 with 3 rule applications. Total rules 3433 place count 1072 transition count 1801
Iterating global reduction 16 with 3 rules applied. Total rules applied 3436 place count 1072 transition count 1801
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3438 place count 1072 transition count 1799
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 3440 place count 1070 transition count 1799
Applied a total of 3440 rules in 1700 ms. Remains 1070 /2826 variables (removed 1756) and now considering 1799/3513 (removed 1714) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1711 ms. Remains : 1070/2826 places, 1799/3513 transitions.
RANDOM walk for 40000 steps (359 resets) in 785 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 253 ms. (157 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (51 resets) in 291 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (54 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 160 ms. (248 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2388331346163776506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6485958239710897669.kers'
[2026-05-22 19:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2388331346163776506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6485958239710897669.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 1 ms.
// Phase 1: matrix 1799 rows 1060 cols 6932 entries
Finished phase 1 with 278 SingleSign rule and 611 generalized
[2026-05-22 19:54:32] [INFO ] Computed 181 invariants in 15 ms
Computed 181 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6485958239710897669.kers
Total runtime 17 ms.
[2026-05-22 19:54:32] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 310/361 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 122/483 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/485 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 445/930 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 48/978 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/978 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/981 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 85/1066 variables, 29/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1066 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/1068 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1068 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1070 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1070 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1799/2869 variables, 1070/1251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2869 variables, 14/1265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2869 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/2869 variables, 0/1265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2869/2869 variables, and 1265 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3632 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 1070/1070 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 310/361 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 122/483 variables, 18/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/485 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 445/930 variables, 84/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/930 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/930 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 48/978 variables, 15/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/981 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/981 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 85/1066 variables, 29/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1066 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/1068 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1068 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1068 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2/1070 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1070 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1799/2869 variables, 1070/1260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2869 variables, 14/1274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2869 variables, 4/1278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2869 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 0/2869 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2869/2869 variables, and 1278 constraints, problems are : Problem set: 0 solved, 5 unsolved in 17119 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 114/114 constraints, State Equation: 1070/1070 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20822ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 26222 ms.
Support contains 51 out of 1070 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1070/1070 places, 1799/1799 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1070 transition count 1793
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 1063 transition count 1793
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 13 place count 1063 transition count 1781
Deduced a syphon composed of 12 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 39 place count 1049 transition count 1781
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 1048 transition count 1781
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 40 place count 1048 transition count 1780
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 1047 transition count 1780
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 57 place count 1039 transition count 1773
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 60 place count 1036 transition count 1770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 1035 transition count 1770
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 1035 transition count 1769
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 1034 transition count 1769
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 1033 transition count 1769
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 68 place count 1031 transition count 1767
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 69 place count 1030 transition count 1766
Iterating global reduction 5 with 1 rules applied. Total rules applied 70 place count 1030 transition count 1766
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 71 place count 1030 transition count 1765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 1029 transition count 1765
Applied a total of 72 rules in 317 ms. Remains 1029 /1070 variables (removed 41) and now considering 1765/1799 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 1029/1070 places, 1765/1799 transitions.
RANDOM walk for 40000 steps (403 resets) in 306 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (59 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (56 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (60 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (59 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 129788 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 5
Probabilistic random walk after 129788 steps, saw 29405 distinct states, run finished after 3016 ms. (steps per millisecond=43 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6096249229008092297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1238319828416430853.kers'
[2026-05-22 19:55:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6096249229008092297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1238319828416430853.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1765 rows 1016 cols 6828 entries
Finished phase 1 with 239 SingleSign rule and 616 generalized
[2026-05-22 19:55:23] [INFO ] Computed 174 invariants in 17 ms
Computed 174 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-1238319828416430853.kers
Total runtime 20 ms.
[2026-05-22 19:55:23] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 300/351 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/411 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/412 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 454/866 variables, 76/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 72/938 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/941 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/941 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 88/1029 variables, 34/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1029 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1765/2794 variables, 1029/1203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2794 variables, 4/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2794 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2794 variables, 0/1207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2794/2794 variables, and 1207 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2545 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 1029/1029 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 300/351 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/351 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 60/411 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/412 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 454/866 variables, 76/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 72/938 variables, 21/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/941 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/941 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 88/1029 variables, 34/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1029 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1029 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1765/2794 variables, 1029/1206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2794 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2794 variables, 4/1214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2794 variables, 1/1215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2794 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/2794 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2794/2794 variables, and 1215 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18378 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 1029/1029 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20973ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 15613 ms.
Support contains 50 out of 1029 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1029/1029 places, 1765/1765 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1028 transition count 1764
Applied a total of 2 rules in 79 ms. Remains 1028 /1029 variables (removed 1) and now considering 1764/1765 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1028/1029 places, 1764/1765 transitions.
RANDOM walk for 40000 steps (371 resets) in 393 ms. (101 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (55 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 222 ms. (179 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (59 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (55 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 196866 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 196866 steps, saw 53562 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-557261525024645566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8416599998101040302.kers'
[2026-05-22 19:56:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-557261525024645566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8416599998101040302.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1764 rows 1015 cols 6826 entries
Finished phase 1 with 238 SingleSign rule and 616 generalized
[2026-05-22 19:56:03] [INFO ] Computed 174 invariants in 15 ms
Computed 174 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-8416599998101040302.kers
Total runtime 25 ms.
[2026-05-22 19:56:03] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/350 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/410 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/411 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 454/865 variables, 76/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 72/937 variables, 21/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/937 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/940 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 88/1028 variables, 34/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1764/2792 variables, 1028/1202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2792 variables, 4/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2792 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2792 variables, 0/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2792/2792 variables, and 1206 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2541 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 1028/1028 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/350 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 60/410 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/411 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 454/865 variables, 76/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/865 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 72/937 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/937 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/940 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/940 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 88/1028 variables, 34/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1028 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1028 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1764/2792 variables, 1028/1206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2792 variables, 4/1210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2792 variables, 3/1213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2792 variables, 0/1213 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2792 variables, 1/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2792 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2792 variables, 0/1214 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2792/2792 variables, and 1214 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10664 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 110/110 constraints, State Equation: 1028/1028 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13279ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 7872 ms.
Support contains 50 out of 1028 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 1764/1764 transitions.
Applied a total of 0 rules in 41 ms. Remains 1028 /1028 variables (removed 0) and now considering 1764/1764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1028/1028 places, 1764/1764 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1028/1028 places, 1764/1764 transitions.
Applied a total of 0 rules in 68 ms. Remains 1028 /1028 variables (removed 0) and now considering 1764/1764 (removed 0) transitions.
[2026-05-22 19:56:24] [INFO ] Invariant cache hit.
[2026-05-22 19:56:26] [INFO ] Implicit Places using invariants in 1833 ms returned [1, 18, 19, 31, 48, 66, 142, 145, 150, 160, 161, 163, 180, 198, 256, 286, 307, 329, 348, 404, 414, 426, 432, 433, 445, 446, 448, 551, 567, 571, 572, 583, 584, 585, 587, 606, 624, 704, 718, 719, 721, 738, 756, 823, 839, 844, 857, 858, 859, 892, 894, 898, 916, 917, 918, 919, 932, 938, 944, 950, 956, 962, 968, 974, 980, 986, 992]
[2026-05-22 19:56:26] [INFO ] Actually due to overlaps returned [892, 859, 48, 163, 180, 329, 448, 606, 738, 898, 31, 587, 721, 160, 307, 445, 584, 718, 857, 916, 161, 446, 585, 719, 858, 894, 917, 1, 19, 286, 432, 433, 571, 572, 704, 839, 66, 198, 348, 583, 624, 756, 918, 962, 980, 992, 18, 142, 256, 426, 551, 823, 844, 919, 932, 938, 944, 950, 956, 968, 974, 986]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 1845 ms to find 62 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 966/1028 places, 1764/1764 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 95 rules applied. Total rules applied 95 place count 962 transition count 1673
Reduce places removed 91 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 99 rules applied. Total rules applied 194 place count 871 transition count 1665
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 202 place count 863 transition count 1665
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 202 place count 863 transition count 1636
Deduced a syphon composed of 29 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 261 place count 833 transition count 1636
Discarding 5 places :
Implicit places reduction removed 5 places
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 3 with 12 rules applied. Total rules applied 273 place count 828 transition count 1629
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 280 place count 821 transition count 1629
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 296 place count 805 transition count 1613
Iterating global reduction 5 with 16 rules applied. Total rules applied 312 place count 805 transition count 1613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 314 place count 805 transition count 1611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 314 place count 805 transition count 1610
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 316 place count 804 transition count 1610
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 321 place count 799 transition count 1601
Iterating global reduction 6 with 5 rules applied. Total rules applied 326 place count 799 transition count 1601
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 328 place count 797 transition count 1599
Iterating global reduction 6 with 2 rules applied. Total rules applied 330 place count 797 transition count 1599
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 331 place count 797 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 332 place count 796 transition count 1596
Iterating global reduction 7 with 1 rules applied. Total rules applied 333 place count 796 transition count 1596
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 431 place count 747 transition count 1547
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 435 place count 745 transition count 1548
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 436 place count 745 transition count 1547
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 744 transition count 1547
Free-agglomeration rule (complex) applied 27 times.
Iterating global reduction 8 with 27 rules applied. Total rules applied 464 place count 744 transition count 1520
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 492 place count 716 transition count 1520
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 495 place count 716 transition count 1517
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 508 place count 716 transition count 1517
Applied a total of 508 rules in 407 ms. Remains 716 /966 variables (removed 250) and now considering 1517/1764 (removed 247) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6163589320388538714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8780239415940411470.kers'
[2026-05-22 19:56:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6163589320388538714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8780239415940411470.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1517 rows 713 cols 6134 entries
Finished phase 1 with 219 SingleSign rule and 396 generalized
[2026-05-22 19:56:26] [INFO ] Computed 101 invariants in 10 ms
Computed 101 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8780239415940411470.kers
Total runtime 13 ms.
[2026-05-22 19:56:27] [INFO ] Implicit Places using invariants in 698 ms returned [95, 102, 105, 113, 117, 118, 179, 202, 205, 208, 215, 222, 329, 331, 337, 398, 419, 436, 441, 442, 518, 524, 527, 529, 532, 539, 540, 612, 624, 631]
[2026-05-22 19:56:27] [INFO ] Actually due to overlaps returned [117, 222, 337, 441, 539, 118, 442, 540, 95, 202, 208, 331, 524, 529, 102, 105, 113, 179, 215, 398, 419, 436, 518, 532, 612, 624, 631]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 701 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 689/1028 places, 1517/1764 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 676 transition count 1504
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 676 transition count 1504
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 672 transition count 1500
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 672 transition count 1498
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 43 place count 672 transition count 1491
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 50 place count 665 transition count 1491
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 665 transition count 1490
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 664 transition count 1490
Applied a total of 52 rules in 157 ms. Remains 664 /689 variables (removed 25) and now considering 1490/1517 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1953625835975884957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-489557839010901794.kers'
[2026-05-22 19:56:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1953625835975884957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-489557839010901794.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 1490 rows 661 cols 5923 entries
Finished phase 1 with 220 SingleSign rule and 370 generalized
[2026-05-22 19:56:27] [INFO ] Computed 74 invariants in 10 ms
Computed 74 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-489557839010901794.kers
Total runtime 13 ms.
[2026-05-22 19:56:28] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-22 19:56:28] [INFO ] Invariant cache hit.
[2026-05-22 19:56:28] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 19:56:32] [INFO ] Implicit Places using invariants and state equation in 4329 ms returned []
Implicit Place search using SMT with State Equation took 4787 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 664/1028 places, 1490/1764 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7978 ms. Remains : 664/1028 places, 1490/1764 transitions.
RANDOM walk for 40000 steps (474 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (76 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (78 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (81 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (74 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 181370 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 181370 steps, saw 51750 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2026-05-22 19:56:35] [INFO ] Invariant cache hit.
[2026-05-22 19:56:35] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 379/429 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 219/648 variables, 43/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 16/664 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1490/2154 variables, 664/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2154 variables, 4/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2154 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2154 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2154/2154 variables, and 742 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 664/664 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 379/429 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 219/648 variables, 43/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16/664 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/664 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1490/2154 variables, 664/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2154 variables, 4/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2154 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2154 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2154 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2154/2154 variables, and 751 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6308 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 664/664 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7777ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14232 ms.
Support contains 49 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1490/1490 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 664 transition count 1489
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 663 transition count 1489
Applied a total of 2 rules in 32 ms. Remains 663 /664 variables (removed 1) and now considering 1489/1490 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 663/664 places, 1489/1490 transitions.
RANDOM walk for 40000 steps (477 resets) in 278 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (84 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (82 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 191554 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 191554 steps, saw 54516 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14725965716504058099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12941628715509704290.kers'
[2026-05-22 19:57:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14725965716504058099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12941628715509704290.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 2 ms.
// Phase 1: matrix 1489 rows 660 cols 5921 entries
Finished phase 1 with 219 SingleSign rule and 370 generalized
[2026-05-22 19:57:00] [INFO ] Computed 74 invariants in 30 ms
Computed 74 P flows in 31 ms.
Exported basis to /tmp/petrispot-output-12941628715509704290.kers
Total runtime 34 ms.
[2026-05-22 19:57:00] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 375/424 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/428 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 219/647 variables, 43/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 16/663 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1489/2152 variables, 663/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2152 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2152 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/2152 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2152/2152 variables, and 741 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1548 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 663/663 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 375/424 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/428 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 219/647 variables, 43/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 16/663 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1489/2152 variables, 663/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2152 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2152 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2152 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/2152 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2152/2152 variables, and 749 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4387 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 663/663 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5994ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5381 ms.
Support contains 49 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1489/1489 transitions.
Applied a total of 0 rules in 25 ms. Remains 663 /663 variables (removed 0) and now considering 1489/1489 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 663/663 places, 1489/1489 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1489/1489 transitions.
Applied a total of 0 rules in 25 ms. Remains 663 /663 variables (removed 0) and now considering 1489/1489 (removed 0) transitions.
[2026-05-22 19:57:12] [INFO ] Invariant cache hit.
[2026-05-22 19:57:12] [INFO ] Implicit Places using invariants in 501 ms returned []
[2026-05-22 19:57:12] [INFO ] Invariant cache hit.
[2026-05-22 19:57:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 19:57:18] [INFO ] Implicit Places using invariants and state equation in 6003 ms returned []
Implicit Place search using SMT with State Equation took 6507 ms to find 0 implicit places.
[2026-05-22 19:57:18] [INFO ] Redundant transitions in 98 ms returned []
Running 1456 sub problems to find dead transitions.
[2026-05-22 19:57:19] [INFO ] Invariant cache hit.
[2026-05-22 19:57:19] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 42/66 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/2152 variables, and 68 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 24/31 constraints, Generalized P Invariants (flows): 42/43 constraints, State Equation: 0/663 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 42/66 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/2152 variables, and 70 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 24/31 constraints, Generalized P Invariants (flows): 42/43 constraints, State Equation: 0/663 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60689ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67361 ms. Remains : 663/663 places, 1489/1489 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 3592 edges and 663 vertex of which 662 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 662 transition count 1485
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 658 transition count 1485
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 13 place count 656 transition count 1483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 656 transition count 1482
Applied a total of 14 rules in 60 ms. Remains 656 /663 variables (removed 7) and now considering 1482/1489 (removed 7) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7287710249763749462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14107738184331333349.kers'
[2026-05-22 19:58:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7287710249763749462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14107738184331333349.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 1482 rows 652 cols 5874 entries
Finished phase 1 with 226 SingleSign rule and 357 generalized
[2026-05-22 19:58:19] [INFO ] Computed 73 invariants in 10 ms
Computed 73 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-14107738184331333349.kers
Total runtime 11 ms.
[2026-05-22 19:58:19] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 19:58:20] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2026-05-22 19:58:20] [INFO ] [Nat]Absence check using 31 positive and 42 generalized place invariants in 49 ms returned sat
[2026-05-22 19:58:21] [INFO ] After 1094ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 19:58:24] [INFO ] After 4727ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:58:25] [INFO ] After 5415ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 118 ms
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 65 ms
[2026-05-22 19:58:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6831409331158898681.gal : 15 ms
[2026-05-22 19:58:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8292484517941399038.prop : 0 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6831409331158898681.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8292484517941399038.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8292484517941399038.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 22
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :22 after 99
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :99 after 460
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :460 after 74064
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :74064 after 3.63177e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :3.63177e+09 after 3.76483e+09
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :3.76483e+09 after 3.76486e+09
Invariant property ASLink-PT-06b-ReachabilityCardinality-2024-13 does not hold.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3.76486e+09 after 2.15106e+10
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.15106e+10 after 2.15258e+10
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.15258e+10 after 1.87943e+11
Detected timeout of ITS tools.
[2026-05-22 19:58:40] [INFO ] Flatten gal took : 51 ms
[2026-05-22 19:58:40] [INFO ] Applying decomposition
[2026-05-22 19:58:40] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15996223924529713469.txt' '-o' '/tmp/graph15996223924529713469.bin' '-w' '/tmp/graph15996223924529713469.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15996223924529713469.bin' '-l' '-1' '-v' '-w' '/tmp/graph15996223924529713469.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:58:41] [INFO ] Decomposing Gal with order
[2026-05-22 19:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:58:41] [INFO ] Removed a total of 2832 redundant transitions.
[2026-05-22 19:58:41] [INFO ] Flatten gal took : 184 ms
[2026-05-22 19:58:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 52 ms.
[2026-05-22 19:58:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2126772873497727470.gal : 18 ms
[2026-05-22 19:58:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3255445184729402145.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2126772873497727470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3255445184729402145.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3255445184729402145.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 66
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :66 after 242
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :242 after 330
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :330 after 3.22987e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.22987e+06 after 1.8673e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.8673e+10 after 1.27626e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.27626e+11 after 1.62175e+12
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.62175e+12 after 2.56747e+14
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.56747e+14 after 3.39819e+15
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 36875 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 19:58:56] [INFO ] Flatten gal took : 75 ms
[2026-05-22 19:58:56] [INFO ] Applying decomposition
[2026-05-22 19:58:56] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8810510587173797181.txt' '-o' '/tmp/graph8810510587173797181.bin' '-w' '/tmp/graph8810510587173797181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8810510587173797181.bin' '-l' '-1' '-v' '-w' '/tmp/graph8810510587173797181.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:58:57] [INFO ] Decomposing Gal with order
[2026-05-22 19:58:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:58:57] [INFO ] Removed a total of 2565 redundant transitions.
[2026-05-22 19:58:57] [INFO ] Flatten gal took : 147 ms
[2026-05-22 19:58:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 99 ms.
[2026-05-22 19:58:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9278178830809326501.gal : 58 ms
[2026-05-22 19:58:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1071673532525736183.prop : 0 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9278178830809326501.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1071673532525736183.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1071673532525736183.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 497844
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :497844 after 4.0222e+22
Detected timeout of ITS tools.
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 98 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1277021773327016462
[2026-05-22 20:28:58] [INFO ] Computing symmetric may disable matrix : 1489 transitions.
[2026-05-22 20:28:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:28:58] [INFO ] Computing symmetric may enable matrix : 1489 transitions.
[2026-05-22 20:28:58] [INFO ] Applying decomposition
[2026-05-22 20:28:58] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 56 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12290131515663031601.txt' '-o' '/tmp/graph12290131515663031601.bin' '-w' '/tmp/graph12290131515663031601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12290131515663031601.bin' '-l' '-1' '-v' '-w' '/tmp/graph12290131515663031601.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:28:58] [INFO ] Decomposing Gal with order
[2026-05-22 20:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:28:58] [INFO ] Removed a total of 2751 redundant transitions.
[2026-05-22 20:28:58] [INFO ] Flatten gal took : 69 ms
[2026-05-22 20:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 18 ms.
[2026-05-22 20:28:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality595964503398810967.gal : 10 ms
[2026-05-22 20:28:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8549638890838829246.prop : 0 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality595964503398810967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8549638890838829246.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
[2026-05-22 20:28:58] [INFO ] Computing Do-Not-Accords matrix : 1489 transitions.
Loading property file /tmp/ReachabilityCardinality8549638890838829246.prop.
[2026-05-22 20:28:58] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 9
[2026-05-22 20:28:58] [INFO ] Built C files in 573ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1277021773327016462
Running compilation step : cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 1056
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1056 after 4.83254e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4.83254e+09 after 1.12759e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.12759e+10 after 1.26183e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.26183e+10 after 1.26183e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.26183e+10 after 2.0404e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :2.0404e+10 after 2.32901e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.32901e+10 after 3.75193e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :3.75193e+10 after 5.50372e+10
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :5.50372e+10 after 1.48533e+11
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :1.48533e+11 after 7.07139e+11
Compilation finished in 6104 ms.
Running link step : cd /tmp/ltsmin1277021773327016462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality202402==true'
Invariant property ASLink-PT-06b-ReachabilityCardinality-2024-13 does not hold.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ASLink-PT-06b-ReachabilityCardinality-2024-02 is true.
FORMULA ASLink-PT-06b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.22356e+20 after 3.25442e+20
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality202402==true'
Running LTSmin : cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality202412==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality202412==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin1277021773327016462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'ASLinkPT06bReachabilityCardinality202412==true'

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="ASLink-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-5973"
echo " Executing tool itstools"
echo " Input is ASLink-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 r002-oct2-177944366200374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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