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-177944366200375.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200375
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779479924740

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
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
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 19:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:58:46] [INFO ] Load time of PNML (sax parser for PT used): 394 ms
[2026-05-22 19:58:46] [INFO ] Transformed 2826 places.
[2026-05-22 19:58:46] [INFO ] Transformed 3513 transitions.
[2026-05-22 19:58:46] [INFO ] Found NUPN structural information;
[2026-05-22 19:58:46] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (68 resets) in 1735 ms. (23 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 799 ms. (50 steps per ms) remains 10/10 properties
[2026-05-22 19:58:47] [INFO ] Flatten gal took : 413 ms
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 10/10 properties
[2026-05-22 19:58:47] [INFO ] Flatten gal took : 204 ms
BEST_FIRST walk for 40002 steps (8 resets) in 567 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
[2026-05-22 19:58:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12945084277082833253.gal : 128 ms
[2026-05-22 19:58:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16116332241701451206.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/ReachabilityCardinality12945084277082833253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16116332241701451206.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 ...330
BEST_FIRST walk for 40002 steps (9 resets) in 346 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 363 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
Loading property file /tmp/ReachabilityCardinality16116332241701451206.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 9/10 properties
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14998794355071258147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8095044873429424419.kers'
[2026-05-22 19:58:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14998794355071258147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8095044873429424419.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3513 rows 2826 cols 10709 entries
Finished phase 1 with 1910 SingleSign rule and 639 generalized
[2026-05-22 19:58:48] [INFO ] Computed 277 invariants in 38 ms
Computed 277 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-8095044873429424419.kers
Total runtime 42 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1129/1369 variables, 61/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1369 variables, 1129/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 0/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1403/2772 variables, 194/1624 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :18 after 290
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :290 after 390
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :390 after 803
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :803 after 26854
At refinement iteration 6 (INCLUDED_ONLY) 0/2772 variables, 1403/3027 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :26854 after 109776
After SMT solving in domain Real declared 2772/6339 variables, and 3027 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5051 ms.
Refiners :[Domain max(s): 2772/2826 constraints, Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 194/216 constraints, State Equation: 0/2826 constraints, PredecessorRefiner: 9/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :109776 after 898971
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1129/1369 variables, 61/301 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :898971 after 1.46003e+11
At refinement iteration 3 (INCLUDED_ONLY) 0/1369 variables, 1129/1430 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1.46003e+11 after 5.8811e+11
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :5.8811e+11 after 5.11327e+17
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 2/1432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1369 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1403/2772 variables, 194/1626 constraints. Problems are: Problem set: 0 solved, 9 unsolved
SMT process timed out in 10339ms, After SMT, problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 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 511 transitions
Trivial Post-agglo rules discarded 511 transitions
Performed 511 trivial Post agglomeration. Transition count delta: 511
Iterating post reduction 0 with 511 rules applied. Total rules applied 511 place count 2826 transition count 3002
Reduce places removed 511 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 521 rules applied. Total rules applied 1032 place count 2315 transition count 2992
Reduce places removed 2 places and 0 transitions.
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Iterating post reduction 2 with 42 rules applied. Total rules applied 1074 place count 2313 transition count 2952
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 51 rules applied. Total rules applied 1125 place count 2273 transition count 2941
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1127 place count 2271 transition count 2941
Performed 599 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 599 Pre rules applied. Total rules applied 1127 place count 2271 transition count 2342
Deduced a syphon composed of 599 places in 6 ms
Ensure Unique test removed 50 places
Reduce places removed 649 places and 0 transitions.
Iterating global reduction 5 with 1248 rules applied. Total rules applied 2375 place count 1622 transition count 2342
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 23 rules applied. Total rules applied 2398 place count 1615 transition count 2326
Reduce places removed 16 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 6 with 30 rules applied. Total rules applied 2428 place count 1599 transition count 2312
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 2442 place count 1585 transition count 2312
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 2442 place count 1585 transition count 2291
Deduced a syphon composed of 21 places in 6 ms
Ensure Unique test removed 19 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 61 rules applied. Total rules applied 2503 place count 1545 transition count 2291
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 19 Pre rules applied. Total rules applied 2503 place count 1545 transition count 2272
Deduced a syphon composed of 19 places in 15 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2541 place count 1526 transition count 2272
Discarding 89 places :
Symmetric choice reduction at 8 with 89 rule applications. Total rules 2630 place count 1437 transition count 2183
Iterating global reduction 8 with 89 rules applied. Total rules applied 2719 place count 1437 transition count 2183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 2722 place count 1437 transition count 2180
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 16 Pre rules applied. Total rules applied 2722 place count 1437 transition count 2164
Deduced a syphon composed of 16 places in 32 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 9 with 33 rules applied. Total rules applied 2755 place count 1420 transition count 2164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2755 place count 1420 transition count 2163
Deduced a syphon composed of 1 places in 37 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2758 place count 1418 transition count 2163
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 2761 place count 1415 transition count 2145
Iterating global reduction 9 with 3 rules applied. Total rules applied 2764 place count 1415 transition count 2145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 2764 place count 1415 transition count 2143
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 2768 place count 1413 transition count 2143
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 9 with 302 rules applied. Total rules applied 3070 place count 1261 transition count 1993
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 9 with 1 rules applied. Total rules applied 3071 place count 1260 transition count 1993
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 3071 place count 1260 transition count 1992
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 3073 place count 1259 transition count 1992
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3075 place count 1257 transition count 1990
Ensure Unique test removed 1 places
Iterating global reduction 10 with 3 rules applied. Total rules applied 3078 place count 1256 transition count 1990
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 3079 place count 1255 transition count 1989
Iterating global reduction 10 with 1 rules applied. Total rules applied 3080 place count 1255 transition count 1989
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 10 with 2 rules applied. Total rules applied 3082 place count 1255 transition count 1987
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3083 place count 1254 transition count 1987
Free-agglomeration rule applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3091 place count 1254 transition count 1979
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3099 place count 1246 transition count 1979
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 13 with 6 rules applied. Total rules applied 3105 place count 1246 transition count 1973
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3111 place count 1240 transition count 1973
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 14 with 6 rules applied. Total rules applied 3117 place count 1240 transition count 1973
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 3118 place count 1239 transition count 1972
Applied a total of 3118 rules in 1520 ms. Remains 1239 /2826 variables (removed 1587) and now considering 1972/3513 (removed 1541) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1541 ms. Remains : 1239/2826 places, 1972/3513 transitions.
RANDOM walk for 40000 steps (237 resets) in 611 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 330 ms. (120 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (33 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (32 resets) in 273 ms. (145 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (28 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (34 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 171365 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 9
Probabilistic random walk after 171365 steps, saw 38632 distinct states, run finished after 3007 ms. (steps per millisecond=56 ) 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-2636103780585569015.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17481018261682157146.kers'
[2026-05-22 19:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2636103780585569015.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17481018261682157146.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 1972 rows 1237 cols 7465 entries
Finished phase 1 with 358 SingleSign rule and 686 generalized
[2026-05-22 19:59:04] [INFO ] Computed 195 invariants in 18 ms
Computed 195 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-17481018261682157146.kers
Total runtime 20 ms.
[2026-05-22 19:59:04] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 493/733 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/733 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 496/1229 variables, 133/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1229 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/1239 variables, 9/195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1239 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1972/3211 variables, 1239/1434 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3211 variables, 19/1453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3211 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/3211 variables, 0/1453 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3211/3211 variables, and 1453 constraints, problems are : Problem set: 0 solved, 9 unsolved in 7716 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 142/142 constraints, State Equation: 1239/1239 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 9/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 493/733 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/733 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/733 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 496/1229 variables, 133/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 10/1239 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1239 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-06b-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 1972/3211 variables, 1239/1444 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem ASLink-PT-06b-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-06b-ReachabilityFireability-2024-11 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/3211 variables, 19/1463 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3211 variables, 3/1466 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3211 variables, 1/1467 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3211 variables, 1/1468 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3211/3211 variables, and 1468 constraints, problems are : Problem set: 4 solved, 5 unsolved in 45041 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 142/142 constraints, State Equation: 1239/1239 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52868ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 1239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1239/1239 places, 1972/1972 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1239 transition count 1949
Reduce places removed 23 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 1216 transition count 1946
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 1212 transition count 1944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 1211 transition count 1944
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 56 place count 1211 transition count 1876
Deduced a syphon composed of 68 places in 4 ms
Ensure Unique test removed 4 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 196 place count 1139 transition count 1876
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 4 with 1 rules applied. Total rules applied 197 place count 1139 transition count 1875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 198 place count 1138 transition count 1875
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 202 place count 1134 transition count 1853
Iterating global reduction 6 with 4 rules applied. Total rules applied 206 place count 1134 transition count 1853
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 206 place count 1134 transition count 1851
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 210 place count 1132 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 211 place count 1131 transition count 1843
Iterating global reduction 6 with 1 rules applied. Total rules applied 212 place count 1131 transition count 1843
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 252 place count 1111 transition count 1823
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 1111 transition count 1821
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 256 place count 1109 transition count 1821
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 259 place count 1109 transition count 1821
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 261 place count 1107 transition count 1819
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 12 rules applied. Total rules applied 273 place count 1098 transition count 1816
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 276 place count 1095 transition count 1816
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 276 place count 1095 transition count 1801
Deduced a syphon composed of 15 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 307 place count 1079 transition count 1801
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 9 with 5 rules applied. Total rules applied 312 place count 1074 transition count 1801
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 312 place count 1074 transition count 1800
Deduced a syphon composed of 1 places in 22 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 314 place count 1073 transition count 1800
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 334 place count 1063 transition count 1790
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 336 place count 1061 transition count 1788
Iterating global reduction 10 with 2 rules applied. Total rules applied 338 place count 1061 transition count 1788
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 339 place count 1060 transition count 1787
Iterating global reduction 10 with 1 rules applied. Total rules applied 340 place count 1060 transition count 1787
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 341 place count 1060 transition count 1786
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 343 place count 1060 transition count 1784
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 345 place count 1058 transition count 1784
Applied a total of 345 rules in 608 ms. Remains 1058 /1239 variables (removed 181) and now considering 1784/1972 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 609 ms. Remains : 1058/1239 places, 1784/1972 transitions.
RANDOM walk for 40000 steps (358 resets) in 397 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (56 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (50 resets) in 185 ms. (215 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (57 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 239297 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 5
Probabilistic random walk after 239297 steps, saw 50344 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) 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-1847132976675072355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10050882094604536311.kers'
[2026-05-22 20:00:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1847132976675072355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10050882094604536311.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 1 ms.
// Phase 1: matrix 1784 rows 1045 cols 6868 entries
Finished phase 1 with 221 SingleSign rule and 662 generalized
[2026-05-22 20:00:01] [INFO ] Computed 175 invariants in 16 ms
Computed 175 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-10050882094604536311.kers
Total runtime 18 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/433 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 47/480 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/483 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/484 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 476/960 variables, 81/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 37/997 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/998 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/998 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 57/1055 variables, 35/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1055 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 3/1058 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1058 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1784/2842 variables, 1058/1233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2842 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2842 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2842/2842 variables, and 1233 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3406 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 116/116 constraints, State Equation: 1058/1058 constraints, PredecessorRefiner: 5/3 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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/433 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 47/480 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/483 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/484 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 476/960 variables, 81/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/960 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 37/997 variables, 14/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/997 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/998 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/998 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/998 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/998 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 57/1055 variables, 35/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1055 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1055 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1055 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1055 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 3/1058 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1058 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 1784/2842 variables, 1058/1238 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2842 variables, 3/1241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2842 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/2842 variables, 0/1241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2842/2842 variables, and 1241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 28131 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 116/116 constraints, State Equation: 1058/1058 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31597ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 17089 ms.
Support contains 98 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 1784/1784 transitions.
Applied a total of 0 rules in 42 ms. Remains 1058 /1058 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1058/1058 places, 1784/1784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 1784/1784 transitions.
Applied a total of 0 rules in 41 ms. Remains 1058 /1058 variables (removed 0) and now considering 1784/1784 (removed 0) transitions.
[2026-05-22 20:00:49] [INFO ] Invariant cache hit.
[2026-05-22 20:00:50] [INFO ] Implicit Places using invariants in 959 ms returned [1, 21, 22, 34, 52, 70, 159, 163, 174, 175, 176, 177, 203, 221, 243, 306, 323, 324, 325, 326, 328, 349, 368, 445, 452, 456, 457, 473, 476, 495, 593, 594, 606, 609, 628, 647, 709, 722, 726, 727, 738, 739, 741, 759, 777, 819, 859, 863, 864, 867, 879, 880, 881, 882, 916, 918, 921, 942, 944, 945, 959, 965, 971, 977, 983, 989, 995, 1001, 1007, 1013, 1019]
[2026-05-22 20:00:50] [INFO ] Actually due to overlaps returned [916, 882, 34, 52, 203, 328, 349, 495, 628, 741, 759, 921, 476, 609, 176, 325, 738, 880, 177, 326, 473, 606, 739, 881, 918, 942, 1, 21, 175, 306, 323, 456, 457, 593, 594, 726, 727, 863, 864, 70, 368, 647, 777, 879, 944, 989, 1007, 1019, 22, 163, 174, 221, 243, 324, 445, 867, 945, 959, 965, 971, 977, 983, 995, 1001, 1013]
Discarding 65 places :
Implicit Place search using SMT only with invariants took 972 ms to find 65 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 993/1058 places, 1784/1784 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 987 transition count 1703
Reduce places removed 81 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 113 rules applied. Total rules applied 200 place count 906 transition count 1671
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 232 place count 874 transition count 1671
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 232 place count 874 transition count 1649
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 276 place count 852 transition count 1649
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 290 place count 838 transition count 1635
Iterating global reduction 3 with 14 rules applied. Total rules applied 304 place count 838 transition count 1635
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 304 place count 838 transition count 1633
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 308 place count 836 transition count 1633
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 311 place count 833 transition count 1630
Iterating global reduction 3 with 3 rules applied. Total rules applied 314 place count 833 transition count 1630
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 317 place count 830 transition count 1627
Iterating global reduction 3 with 3 rules applied. Total rules applied 320 place count 830 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 321 place count 829 transition count 1626
Iterating global reduction 3 with 1 rules applied. Total rules applied 322 place count 829 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 323 place count 828 transition count 1625
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 828 transition count 1625
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 420 place count 780 transition count 1577
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 424 place count 776 transition count 1573
Iterating global reduction 3 with 4 rules applied. Total rules applied 428 place count 776 transition count 1573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 431 place count 776 transition count 1570
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 432 place count 775 transition count 1569
Iterating global reduction 4 with 1 rules applied. Total rules applied 433 place count 775 transition count 1569
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 434 place count 775 transition count 1568
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 5 with 25 rules applied. Total rules applied 459 place count 775 transition count 1543
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 5 with 25 rules applied. Total rules applied 484 place count 750 transition count 1543
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 499 place count 750 transition count 1543
Applied a total of 499 rules in 299 ms. Remains 750 /993 variables (removed 243) and now considering 1543/1784 (removed 241) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11646017362982882878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3343908591178545034.kers'
[2026-05-22 20:00:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11646017362982882878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3343908591178545034.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1543 rows 749 cols 6076 entries
Finished phase 1 with 222 SingleSign rule and 424 generalized
[2026-05-22 20:00:51] [INFO ] Computed 104 invariants in 17 ms
Computed 104 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-3343908591178545034.kers
Total runtime 18 ms.
[2026-05-22 20:00:51] [INFO ] Implicit Places using invariants in 505 ms returned [82, 103, 109, 112, 114, 214, 220, 223, 226, 240, 244, 303, 340, 355, 450, 460, 461, 519, 538, 551, 556, 557, 613, 632, 638, 641, 643, 732, 735, 738, 741, 746, 749]
[2026-05-22 20:00:51] [INFO ] Actually due to overlaps returned [460, 556, 244, 461, 557, 355, 109, 114, 214, 220, 226, 632, 638, 643, 82, 103, 240, 303, 340, 450, 519, 538, 551, 613, 732, 738, 741, 746, 749]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 513 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 721/1058 places, 1543/1784 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 721 transition count 1542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 720 transition count 1542
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 709 transition count 1531
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 709 transition count 1531
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 705 transition count 1527
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 705 transition count 1527
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 705 transition count 1525
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 50 place count 697 transition count 1517
Free-agglomeration rule applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 60 place count 697 transition count 1507
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 70 place count 687 transition count 1507
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 687 transition count 1505
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 685 transition count 1505
Applied a total of 74 rules in 240 ms. Remains 685 /721 variables (removed 36) and now considering 1505/1543 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1043951529623967404.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-877112925718314421.kers'
[2026-05-22 20:00:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1043951529623967404.kers, --Pflows, --basisKERS=/tmp/petrispot-output-877112925718314421.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1505 rows 684 cols 5891 entries
Finished phase 1 with 202 SingleSign rule and 408 generalized
[2026-05-22 20:00:51] [INFO ] Computed 75 invariants in 16 ms
Computed 75 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-877112925718314421.kers
Total runtime 18 ms.
[2026-05-22 20:00:52] [INFO ] Implicit Places using invariants in 414 ms returned [678]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 416 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 684/1058 places, 1505/1784 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 683 transition count 1504
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 683 transition count 1504
Applied a total of 2 rules in 40 ms. Remains 683 /684 variables (removed 1) and now considering 1504/1505 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15020947117383106352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12620557424157070056.kers'
[2026-05-22 20:00:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15020947117383106352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12620557424157070056.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1504 rows 682 cols 5885 entries
Finished phase 1 with 201 SingleSign rule and 408 generalized
[2026-05-22 20:00:52] [INFO ] Computed 74 invariants in 34 ms
Computed 74 P flows in 34 ms.
Exported basis to /tmp/petrispot-output-12620557424157070056.kers
Total runtime 36 ms.
[2026-05-22 20:00:53] [INFO ] Implicit Places using invariants in 682 ms returned []
[2026-05-22 20:00:53] [INFO ] Invariant cache hit.
[2026-05-22 20:00:54] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 2138 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 683/1058 places, 1504/1784 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4661 ms. Remains : 683/1058 places, 1504/1784 transitions.
RANDOM walk for 40000 steps (455 resets) in 269 ms. (148 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (86 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (87 resets) in 144 ms. (275 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (88 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (82 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (91 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 125131 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 5
Probabilistic random walk after 125131 steps, saw 61947 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2026-05-22 20:00:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 237/335 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/352 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 318/670 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/671 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/683 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/683 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1504/2187 variables, 683/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2187 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/2187 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2187/2187 variables, and 757 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 683/683 constraints, PredecessorRefiner: 5/3 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/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 237/335 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 17/352 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 318/670 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/670 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/670 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/671 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/683 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/683 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1504/2187 variables, 683/762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2187 variables, 3/765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2187 variables, 1/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2187 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2187 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2187/2187 variables, and 766 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13782 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 683/683 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15824ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 23607 ms.
Support contains 85 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 1504/1504 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 683 transition count 1503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 682 transition count 1503
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 2 place count 682 transition count 1494
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 20 place count 673 transition count 1494
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 672 transition count 1493
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 672 transition count 1492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 671 transition count 1492
Applied a total of 24 rules in 64 ms. Remains 671 /683 variables (removed 12) and now considering 1492/1504 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 671/683 places, 1492/1504 transitions.
RANDOM walk for 40000 steps (505 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (89 resets) in 226 ms. (176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (84 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (91 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 284903 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 3
Probabilistic random walk after 284903 steps, saw 89425 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) 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-9551722976133091027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15453428935304527189.kers'
[2026-05-22 20:01:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9551722976133091027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15453428935304527189.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 1492 rows 670 cols 5861 entries
Finished phase 1 with 186 SingleSign rule and 411 generalized
[2026-05-22 20:01:40] [INFO ] Computed 74 invariants in 32 ms
Computed 74 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-15453428935304527189.kers
Total runtime 35 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 237/322 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/339 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 319/658 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/659 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 12/671 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1492/2163 variables, 671/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2163 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/2163 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2163/2163 variables, and 745 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1133 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 3/1 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/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 237/322 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 17/339 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 319/658 variables, 50/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/659 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 12/671 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1492/2163 variables, 671/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2163 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2163 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/2163 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2163/2163 variables, and 748 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4072 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5294ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1555 ms.
Support contains 85 out of 671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 1492/1492 transitions.
Applied a total of 0 rules in 20 ms. Remains 671 /671 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 671/671 places, 1492/1492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 1492/1492 transitions.
Applied a total of 0 rules in 26 ms. Remains 671 /671 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
[2026-05-22 20:01:47] [INFO ] Invariant cache hit.
[2026-05-22 20:01:48] [INFO ] Implicit Places using invariants in 850 ms returned []
[2026-05-22 20:01:48] [INFO ] Invariant cache hit.
[2026-05-22 20:01:50] [INFO ] Implicit Places using invariants and state equation in 1737 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2026-05-22 20:01:50] [INFO ] Redundant transitions in 118 ms returned []
Running 1462 sub problems to find dead transitions.
[2026-05-22 20:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/2163 variables, and 60 constraints, problems are : Problem set: 0 solved, 1462 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 9/21 constraints, Generalized P Invariants (flows): 51/53 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 1462/1462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/666 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/666 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 1462 unsolved
SMT process timed out in 60552ms, After SMT, problems are : Problem set: 0 solved, 1462 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63335 ms. Remains : 671/671 places, 1492/1492 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 21 ms. Remains 671 /671 variables (removed 0) and now considering 1492/1492 (removed 0) transitions.
Running SMT prover for 3 properties.
[2026-05-22 20:02:50] [INFO ] Invariant cache hit.
[2026-05-22 20:02:50] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 20:02:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2026-05-22 20:02:51] [INFO ] [Nat]Absence check using 21 positive and 53 generalized place invariants in 15 ms returned sat
[2026-05-22 20:02:52] [INFO ] After 1055ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 20:02:54] [INFO ] After 3468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 20:02:56] [INFO ] After 5568ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-22 20:02:56] [INFO ] Flatten gal took : 63 ms
[2026-05-22 20:02:56] [INFO ] Flatten gal took : 47 ms
[2026-05-22 20:02:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8083336255027038876.gal : 20 ms
[2026-05-22 20:02:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16282076948086015739.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/ReachabilityCardinality8083336255027038876.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16282076948086015739.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 ...329
Loading property file /tmp/ReachabilityCardinality16282076948086015739.prop.
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 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :9 after 31
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :31 after 70
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :70 after 350
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :350 after 75544
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :75544 after 8.50025e+08
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :8.50025e+08 after 1.04134e+09
Detected timeout of ITS tools.
[2026-05-22 20:03:11] [INFO ] Flatten gal took : 102 ms
[2026-05-22 20:03:11] [INFO ] Applying decomposition
[2026-05-22 20:03:11] [INFO ] Flatten gal took : 58 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/graph6968599274189387617.txt' '-o' '/tmp/graph6968599274189387617.bin' '-w' '/tmp/graph6968599274189387617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6968599274189387617.bin' '-l' '-1' '-v' '-w' '/tmp/graph6968599274189387617.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:03:12] [INFO ] Decomposing Gal with order
[2026-05-22 20:03:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:03:12] [INFO ] Removed a total of 2680 redundant transitions.
[2026-05-22 20:03:13] [INFO ] Flatten gal took : 507 ms
[2026-05-22 20:03:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 58 ms.
[2026-05-22 20:03:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15679383781312095050.gal : 18 ms
[2026-05-22 20:03:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10718675985721853518.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/ReachabilityCardinality15679383781312095050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10718675985721853518.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 ...309
Loading property file /tmp/ReachabilityCardinality10718675985721853518.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 525
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :525 after 10792
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :10792 after 1.75277e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.75277e+09 after 2.66209e+09
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.66209e+09 after 8.11807e+09
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :8.11807e+09 after 1.14391e+10
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :1.14391e+10 after 1.59857e+10
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :1.59857e+10 after 2.26673e+10
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :2.26673e+10 after 4.76014e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :4.76014e+10 after 1.56154e+11
Reachability property ASLink-PT-06b-ReachabilityFireability-2024-08 is true.
Reachability property ASLink-PT-06b-ReachabilityFireability-2024-02 is true.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.49611e+18 after 8.00557e+18
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 37413 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 20:03:28] [INFO ] Flatten gal took : 59 ms
[2026-05-22 20:03:28] [INFO ] Applying decomposition
[2026-05-22 20:03:28] [INFO ] Flatten gal took : 59 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/graph316998777781129299.txt' '-o' '/tmp/graph316998777781129299.bin' '-w' '/tmp/graph316998777781129299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph316998777781129299.bin' '-l' '-1' '-v' '-w' '/tmp/graph316998777781129299.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:03:28] [INFO ] Decomposing Gal with order
[2026-05-22 20:03:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:03:29] [INFO ] Removed a total of 2566 redundant transitions.
[2026-05-22 20:03:29] [INFO ] Flatten gal took : 158 ms
[2026-05-22 20:03:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 57 ms.
[2026-05-22 20:03:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10614751747374526949.gal : 25 ms
[2026-05-22 20:03:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8793071932066292559.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/ReachabilityCardinality10614751747374526949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8793071932066292559.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 ...308
Loading property file /tmp/ReachabilityCardinality8793071932066292559.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 3.0169e+08
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :3.0169e+08 after 1.39635e+21
Detected timeout of ITS tools.
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 27 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11915102435694696688
[2026-05-22 20:33:29] [INFO ] Applying decomposition
[2026-05-22 20:33:29] [INFO ] Computing symmetric may disable matrix : 1492 transitions.
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 30 ms
[2026-05-22 20:33:29] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 20:33:29] [INFO ] Computing symmetric may enable matrix : 1492 transitions.
[2026-05-22 20:33:29] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2901173850700705186.txt' '-o' '/tmp/graph2901173850700705186.bin' '-w' '/tmp/graph2901173850700705186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2901173850700705186.bin' '-l' '-1' '-v' '-w' '/tmp/graph2901173850700705186.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:33:29] [INFO ] Decomposing Gal with order
[2026-05-22 20:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:33:29] [INFO ] Removed a total of 2687 redundant transitions.
[2026-05-22 20:33:29] [INFO ] Flatten gal took : 98 ms
[2026-05-22 20:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 151 labels/synchronizations in 17 ms.
[2026-05-22 20:33:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11703973646007026680.gal : 21 ms
[2026-05-22 20:33:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability15636532973809939956.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/ReachabilityFireability11703973646007026680.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability15636532973809939956.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 ...309
Loading property file /tmp/ReachabilityFireability15636532973809939956.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 700
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :700 after 1.31787e+07
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1.31787e+07 after 1.6078e+09
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1.6078e+09 after 2.41829e+09
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2.41829e+09 after 5.937e+09
[2026-05-22 20:33:29] [INFO ] Computing Do-Not-Accords matrix : 1492 transitions.
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :5.937e+09 after 7.97311e+09
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :7.97311e+09 after 9.51501e+09
[2026-05-22 20:33:30] [INFO ] Computation of Completed DNA matrix. took 51 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :9.51501e+09 after 1.32512e+10
[2026-05-22 20:33:30] [INFO ] Built C files in 641ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11915102435694696688
Running compilation step : cd /tmp/ltsmin11915102435694696688;'/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 4096
SDD size :1.32512e+10 after 2.72206e+10
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :2.72206e+10 after 7.70756e+10
Compilation finished in 6182 ms.
Running link step : cd /tmp/ltsmin11915102435694696688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin11915102435694696688;'/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' 'ASLinkPT06bReachabilityFireability202402==true'
Reachability property ASLink-PT-06b-ReachabilityFireability-2024-08 is true.
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4.38312e+18 after 4.4632e+18
Reachability property ASLink-PT-06b-ReachabilityFireability-2024-02 is true.
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.04147e+20 after 1.34472e+20
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.34472e+20 after 1.39361e+20
Invariant property ASLink-PT-06b-ReachabilityFireability-2024-13 does not hold.
FORMULA ASLink-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.95305e+21,357.381,2234972,9913,11575,3.15944e+06,1.00327e+06,2119,6.79186e+06,585,1.12373e+07,0
Total reachable state count : 6953047293469883376640

Verifying 3 reachability properties.
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11915102435694696688;'/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' 'ASLinkPT06bReachabilityFireability202402==true'
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2490365 ms.

BK_STOP 1779482416583

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is ASLink-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-oct2-177944366200375"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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