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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.1K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 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.6K Mar 15 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 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 1.3M 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-09b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-09b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779487291245

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-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 22:01:32] [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 22:01:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:01:33] [INFO ] Load time of PNML (sax parser for PT used): 332 ms
[2026-05-22 22:01:33] [INFO ] Transformed 4014 places.
[2026-05-22 22:01:33] [INFO ] Transformed 4932 transitions.
[2026-05-22 22:01:33] [INFO ] Found NUPN structural information;
[2026-05-22 22:01:33] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (52 resets) in 2230 ms. (17 steps per ms) remains 10/16 properties
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 10/10 properties
[2026-05-22 22:01:34] [INFO ] Flatten gal took : 473 ms
BEST_FIRST walk for 40004 steps (8 resets) in 923 ms. (43 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 10/10 properties
[2026-05-22 22:01:34] [INFO ] Flatten gal took : 263 ms
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 10/10 properties
[2026-05-22 22:01:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17334559886397518816.gal : 101 ms
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 10/10 properties
[2026-05-22 22:01:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6260808614755041341.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/ReachabilityCardinality17334559886397518816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6260808614755041341.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
BEST_FIRST walk for 40003 steps (8 resets) in 494 ms. (80 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16531270255842326757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3824944765841095259.kers'
[2026-05-22 22:01:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16531270255842326757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3824944765841095259.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4932 rows 4014 cols 14960 entries
Finished phase 1 with 2728 SingleSign rule and 892 generalized
[2026-05-22 22:01:35] [INFO ] Computed 394 invariants in 39 ms
Computed 394 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-3824944765841095259.kers
Total runtime 44 ms.
Excessive predecessor constraint size, skipping predecessor.
Loading property file /tmp/ReachabilityCardinality6260808614755041341.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1229/1395 variables, 47/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1395 variables, 1229/1442 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1395 variables, 0/1442 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 501/1896 variables, 42/1484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1896 variables, 501/1985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1896 variables, 0/1985 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2037/3933 variables, 274/2259 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3933 variables, 2037/4296 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3933/8946 variables, and 4296 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5063 ms.
Refiners :[Domain max(s): 3933/4014 constraints, Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 274/305 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 10/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1229/1395 variables, 47/213 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1395 variables, 1229/1442 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1395 variables, 1/1443 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1395 variables, 0/1443 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 501/1896 variables, 42/1485 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1896 variables, 501/1986 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1896 variables, 2/1988 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SMT process timed out in 10776ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 166 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 844 place count 4014 transition count 4088
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 876 rules applied. Total rules applied 1720 place count 3170 transition count 4056
Reduce places removed 7 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 2 with 31 rules applied. Total rules applied 1751 place count 3163 transition count 4032
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 29 rules applied. Total rules applied 1780 place count 3139 transition count 4027
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1781 place count 3138 transition count 4027
Performed 880 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 880 Pre rules applied. Total rules applied 1781 place count 3138 transition count 3147
Deduced a syphon composed of 880 places in 11 ms
Ensure Unique test removed 79 places
Reduce places removed 959 places and 0 transitions.
Iterating global reduction 5 with 1839 rules applied. Total rules applied 3620 place count 2179 transition count 3147
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 5 with 62 rules applied. Total rules applied 3682 place count 2167 transition count 3097
Reduce places removed 50 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 6 with 53 rules applied. Total rules applied 3735 place count 2117 transition count 3094
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 3738 place count 2114 transition count 3094
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 27 Pre rules applied. Total rules applied 3738 place count 2114 transition count 3067
Deduced a syphon composed of 27 places in 10 ms
Ensure Unique test removed 26 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 8 with 80 rules applied. Total rules applied 3818 place count 2061 transition count 3067
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 24 Pre rules applied. Total rules applied 3818 place count 2061 transition count 3043
Deduced a syphon composed of 24 places in 23 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 8 with 48 rules applied. Total rules applied 3866 place count 2037 transition count 3043
Discarding 124 places :
Symmetric choice reduction at 8 with 124 rule applications. Total rules 3990 place count 1913 transition count 2919
Iterating global reduction 8 with 124 rules applied. Total rules applied 4114 place count 1913 transition count 2919
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4115 place count 1913 transition count 2918
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 37 Pre rules applied. Total rules applied 4115 place count 1913 transition count 2881
Deduced a syphon composed of 37 places in 24 ms
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 9 with 75 rules applied. Total rules applied 4190 place count 1875 transition count 2881
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 4190 place count 1875 transition count 2880
Deduced a syphon composed of 1 places in 9 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 4193 place count 1873 transition count 2880
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 4202 place count 1864 transition count 2826
Iterating global reduction 9 with 9 rules applied. Total rules applied 4211 place count 1864 transition count 2826
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 4211 place count 1864 transition count 2817
Deduced a syphon composed of 9 places in 9 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 4229 place count 1855 transition count 2817
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 15
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :15 after 21
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :21 after 153
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 241 places and 0 transitions.
Iterating global reduction 9 with 479 rules applied. Total rules applied 4708 place count 1614 transition count 2579
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :153 after 352
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4709 place count 1613 transition count 2578
Ensure Unique test removed 1 places
Iterating global reduction 9 with 2 rules applied. Total rules applied 4711 place count 1612 transition count 2578
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :352 after 960
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 4712 place count 1611 transition count 2577
Iterating global reduction 9 with 1 rules applied. Total rules applied 4713 place count 1611 transition count 2577
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 9 with 2 rules applied. Total rules applied 4715 place count 1611 transition count 2575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4716 place count 1610 transition count 2575
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :960 after 12499
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 4718 place count 1609 transition count 2584
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :12499 after 32460
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 4727 place count 1609 transition count 2575
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 4736 place count 1600 transition count 2575
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :32460 after 625239
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 12 with 9 rules applied. Total rules applied 4745 place count 1600 transition count 2566
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 4754 place count 1591 transition count 2566
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 4756 place count 1591 transition count 2566
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4757 place count 1590 transition count 2565
Reduce places removed 13 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 17 rules applied. Total rules applied 4774 place count 1577 transition count 2561
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 14 with 5 rules applied. Total rules applied 4779 place count 1573 transition count 2560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4780 place count 1572 transition count 2560
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 20 Pre rules applied. Total rules applied 4780 place count 1572 transition count 2540
Deduced a syphon composed of 20 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 16 with 41 rules applied. Total rules applied 4821 place count 1551 transition count 2540
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 16 with 7 rules applied. Total rules applied 4828 place count 1544 transition count 2540
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 4828 place count 1544 transition count 2539
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 4830 place count 1543 transition count 2539
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 4831 place count 1542 transition count 2538
Iterating global reduction 17 with 1 rules applied. Total rules applied 4832 place count 1542 transition count 2538
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 4833 place count 1541 transition count 2537
Iterating global reduction 17 with 1 rules applied. Total rules applied 4834 place count 1541 transition count 2537
SDD proceeding with computation,10 properties remain. new max is 4096
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 5 ms
SDD size :625239 after 7.18249e+10
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 17 with 26 rules applied. Total rules applied 4860 place count 1528 transition count 2524
Discarding 5 places :
Symmetric choice reduction at 17 with 5 rule applications. Total rules 4865 place count 1523 transition count 2519
Iterating global reduction 17 with 5 rules applied. Total rules applied 4870 place count 1523 transition count 2519
Free-agglomeration rule applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 4875 place count 1523 transition count 2514
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 4880 place count 1518 transition count 2514
Applied a total of 4880 rules in 2406 ms. Remains 1518 /4014 variables (removed 2496) and now considering 2514/4932 (removed 2418) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2416 ms. Remains : 1518/4014 places, 2514/4932 transitions.
RANDOM walk for 40000 steps (260 resets) in 828 ms. (48 steps per ms) remains 8/10 properties
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (32 resets) in 349 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (29 resets) in 365 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (28 resets) in 368 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (30 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (30 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (31 resets) in 175 ms. (227 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (29 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18399477722087356469.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16965093822977382028.kers'
[2026-05-22 22:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18399477722087356469.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16965093822977382028.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 1 ms.
// Phase 1: matrix 2514 rows 1499 cols 9620 entries
Finished phase 1 with 393 SingleSign rule and 875 generalized
[2026-05-22 22:01:49] [INFO ] Computed 250 invariants in 27 ms
Computed 250 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-16965093822977382028.kers
Total runtime 29 ms.
SDD proceeding with computation,10 properties remain. new max is 8192
[2026-05-22 22:01:49] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD size :7.18249e+10 after 1.26402e+17
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 594/752 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/752 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 32/784 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/785 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 632/1417 variables, 125/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 39/1456 variables, 19/210 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :1.26402e+17 after 1.14019e+23
At refinement iteration 10 (INCLUDED_ONLY) 0/1456 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/1459 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1459 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 58/1517 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1517 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 1/1518 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1518 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :1.14019e+23 after 8.92423e+34
At refinement iteration 17 (OVERLAPS) 2514/4032 variables, 1518/1768 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4032 variables, 2/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/4032 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/4032 variables, 0/1770 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4032/4032 variables, and 1770 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8397 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 161/161 constraints, State Equation: 1518/1518 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 594/752 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/752 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 32/784 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/785 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/785 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 632/1417 variables, 125/191 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1417 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1417 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 39/1456 variables, 19/211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1456 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1456 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 3/1459 variables, 3/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1459 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 58/1517 variables, 36/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1517 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/1518 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1518 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem ASLink-PT-09b-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09b-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 19 (OVERLAPS) 2514/4032 variables, 1518/1770 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem ASLink-PT-09b-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09b-ReachabilityFireability-2024-11 is UNSAT
At refinement iteration 20 (INCLUDED_ONLY) 0/4032 variables, 2/1772 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4032 variables, 2/1774 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4032 variables, 2/1776 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4032 variables, 0/1776 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/4032 variables, 0/1776 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4032/4032 variables, and 1776 constraints, problems are : Problem set: 3 solved, 5 unsolved in 44481 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 161/161 constraints, State Equation: 1518/1518 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52983ms problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14039 ms.
Support contains 94 out of 1518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1518/1518 places, 2514/2514 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 1518 transition count 2503
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 1507 transition count 2503
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 22 place count 1507 transition count 2466
Deduced a syphon composed of 37 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 99 place count 1467 transition count 2466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 99 place count 1467 transition count 2465
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 1465 transition count 2465
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 115 place count 1458 transition count 2459
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 2 with 2 rules applied. Total rules applied 117 place count 1458 transition count 2457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 119 place count 1456 transition count 2457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 119 place count 1456 transition count 2456
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 1455 transition count 2456
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 1454 transition count 2456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 126 place count 1452 transition count 2454
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 1451 transition count 2453
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 1451 transition count 2453
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 132 place count 1451 transition count 2449
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 136 place count 1447 transition count 2449
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 1447 transition count 2448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 138 place count 1446 transition count 2448
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 139 place count 1446 transition count 2448
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 142 place count 1443 transition count 2445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 143 place count 1442 transition count 2445
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 143 place count 1442 transition count 2444
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 145 place count 1441 transition count 2444
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 146 place count 1440 transition count 2444
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 150 place count 1438 transition count 2442
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 151 place count 1437 transition count 2441
Iterating global reduction 9 with 1 rules applied. Total rules applied 152 place count 1437 transition count 2441
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 153 place count 1437 transition count 2440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 154 place count 1436 transition count 2440
Applied a total of 154 rules in 727 ms. Remains 1436 /1518 variables (removed 82) and now considering 2440/2514 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 1436/1518 places, 2440/2514 transitions.
RANDOM walk for 40000 steps (291 resets) in 493 ms. (80 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (37 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (35 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (36 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (37 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 107160 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 5
Probabilistic random walk after 107160 steps, saw 44619 distinct states, run finished after 3008 ms. (steps per millisecond=35 ) 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-17520144651278944766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11012663173900149783.kers'
[2026-05-22 22:03:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17520144651278944766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11012663173900149783.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 2440 rows 1416 cols 9425 entries
Finished phase 1 with 327 SingleSign rule and 868 generalized
[2026-05-22 22:03:00] [INFO ] Computed 241 invariants in 25 ms
Computed 241 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-11012663173900149783.kers
Total runtime 27 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 495/589 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 73/662 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 54/716 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/717 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 603/1320 variables, 113/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 45/1365 variables, 23/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1365 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1368 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1368 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 67/1435 variables, 39/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1435 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/1436 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1436 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2440/3876 variables, 1436/1677 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3876 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/3876 variables, 0/1677 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3876/3876 variables, and 1677 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3247 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1436/1436 constraints, PredecessorRefiner: 5/2 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/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 495/589 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 73/662 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 54/716 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/717 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 603/1320 variables, 113/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 45/1365 variables, 23/205 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1365 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1365 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 3/1368 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1368 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 67/1435 variables, 39/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1435 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 1/1436 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1436 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 2440/3876 variables, 1436/1685 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3876 variables, 2/1687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3876 variables, 1/1688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3876 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/3876 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3876/3876 variables, and 1688 constraints, problems are : Problem set: 0 solved, 5 unsolved in 25125 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1436/1436 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28452ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 13021 ms.
Support contains 93 out of 1436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1436/1436 places, 2440/2440 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1436 transition count 2439
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1435 transition count 2439
Applied a total of 2 rules in 62 ms. Remains 1435 /1436 variables (removed 1) and now considering 2439/2440 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1435/1436 places, 2439/2440 transitions.
RANDOM walk for 40000 steps (299 resets) in 444 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (34 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (35 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 115449 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 4
Probabilistic random walk after 115449 steps, saw 49817 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) 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-4334187502677725293.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5886879234317414435.kers'
[2026-05-22 22:03:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4334187502677725293.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5886879234317414435.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 2439 rows 1415 cols 9423 entries
Finished phase 1 with 326 SingleSign rule and 868 generalized
[2026-05-22 22:03:45] [INFO ] Computed 241 invariants in 25 ms
Computed 241 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-5886879234317414435.kers
Total runtime 29 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 488/581 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 80/661 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 54/715 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/716 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 603/1319 variables, 113/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1319 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 45/1364 variables, 23/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1364 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/1367 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1367 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 67/1434 variables, 39/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1434 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1435 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1435 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2439/3874 variables, 1435/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3874 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/3874 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3874/3874 variables, and 1676 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3484 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1435/1435 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 488/581 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/581 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 80/661 variables, 16/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 54/715 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/715 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/716 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/716 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 603/1319 variables, 113/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1319 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1319 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 45/1364 variables, 23/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1364 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/1367 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1367 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1367 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 67/1434 variables, 39/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1434 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/1435 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1435 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 2439/3874 variables, 1435/1681 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3874 variables, 1/1682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3874 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/3874 variables, 0/1682 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3874/3874 variables, and 1682 constraints, problems are : Problem set: 0 solved, 4 unsolved in 19615 ms.
Refiners :[Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 1435/1435 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23153ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12219 ms.
Support contains 93 out of 1435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 2439/2439 transitions.
Applied a total of 0 rules in 49 ms. Remains 1435 /1435 variables (removed 0) and now considering 2439/2439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1435/1435 places, 2439/2439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 2439/2439 transitions.
Applied a total of 0 rules in 49 ms. Remains 1435 /1435 variables (removed 0) and now considering 2439/2439 (removed 0) transitions.
[2026-05-22 22:04:21] [INFO ] Invariant cache hit.
[2026-05-22 22:04:23] [INFO ] Implicit Places using invariants in 1983 ms returned [1, 21, 22, 34, 51, 69, 144, 148, 158, 159, 161, 180, 198, 235, 277, 293, 294, 296, 313, 332, 410, 414, 415, 427, 428, 431, 449, 467, 540, 541, 543, 548, 561, 562, 563, 583, 601, 659, 681, 684, 688, 689, 701, 702, 723, 741, 813, 817, 818, 829, 830, 832, 851, 869, 951, 966, 967, 972, 1010, 1087, 1092, 1106, 1107, 1109, 1127, 1146, 1188, 1236, 1240, 1241, 1244, 1256, 1257, 1258, 1259, 1260, 1297, 1299, 1303, 1321, 1322, 1323, 1324, 1337, 1343, 1349, 1355, 1361, 1368, 1374, 1380, 1386, 1392, 1398]
[2026-05-22 22:04:23] [INFO ] Actually due to overlaps returned [1297, 1260, 51, 180, 313, 449, 583, 723, 851, 1109, 1127, 1303, 34, 161, 296, 431, 563, 832, 972, 158, 293, 427, 561, 701, 829, 966, 1106, 1258, 1322, 159, 294, 428, 562, 702, 830, 967, 1107, 1259, 1299, 1321, 1, 21, 277, 414, 415, 548, 688, 689, 817, 818, 951, 1092, 1240, 1241, 1256, 69, 198, 332, 467, 601, 741, 869, 1010, 1146, 1323, 1368, 1386, 1398, 22, 813, 1244, 1257, 1324, 1337, 1343, 1349, 1355, 1361, 1374, 1380, 1392]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 2011 ms to find 81 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1354/1435 places, 2439/2439 transitions.
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 1344 transition count 2297
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 157 rules applied. Total rules applied 309 place count 1202 transition count 2282
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 321 place count 1190 transition count 2282
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 321 place count 1190 transition count 2241
Deduced a syphon composed of 41 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 404 place count 1148 transition count 2241
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 417 place count 1135 transition count 2228
Iterating global reduction 3 with 13 rules applied. Total rules applied 430 place count 1135 transition count 2228
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 430 place count 1135 transition count 2227
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 432 place count 1134 transition count 2227
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 436 place count 1130 transition count 2220
Iterating global reduction 3 with 4 rules applied. Total rules applied 440 place count 1130 transition count 2220
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 442 place count 1128 transition count 2218
Iterating global reduction 3 with 2 rules applied. Total rules applied 444 place count 1128 transition count 2218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 445 place count 1128 transition count 2217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 446 place count 1127 transition count 2215
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 1127 transition count 2215
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 583 place count 1059 transition count 2147
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 589 place count 1053 transition count 2141
Iterating global reduction 4 with 6 rules applied. Total rules applied 595 place count 1053 transition count 2141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 600 place count 1053 transition count 2136
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 601 place count 1052 transition count 2135
Iterating global reduction 5 with 1 rules applied. Total rules applied 602 place count 1052 transition count 2135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 603 place count 1052 transition count 2134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 607 place count 1050 transition count 2136
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 608 place count 1050 transition count 2135
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 6 with 23 rules applied. Total rules applied 631 place count 1050 transition count 2112
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 654 place count 1027 transition count 2112
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 656 place count 1027 transition count 2110
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 7 with 25 rules applied. Total rules applied 681 place count 1027 transition count 2110
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 682 place count 1027 transition count 2110
Applied a total of 682 rules in 739 ms. Remains 1027 /1354 variables (removed 327) and now considering 2110/2439 (removed 329) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5135882729694454481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3255752125627505235.kers'
[2026-05-22 22:04:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5135882729694454481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3255752125627505235.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 2110 rows 1024 cols 8411 entries
Finished phase 1 with 286 SingleSign rule and 592 generalized
[2026-05-22 22:04:23] [INFO ] Computed 149 invariants in 20 ms
Computed 149 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-3255752125627505235.kers
Total runtime 25 ms.
[2026-05-22 22:04:24] [INFO ] Implicit Places using invariants in 782 ms returned [78, 97, 103, 106, 108, 109, 112, 188, 194, 197, 199, 202, 209, 267, 297, 300, 302, 367, 385, 391, 393, 401, 402, 409, 410, 467, 496, 499, 509, 569, 592, 598, 601, 603, 608, 609, 681, 696, 698, 701, 774, 797, 807, 817, 826, 883, 902, 908, 911, 1010, 1013, 1016, 1024]
[2026-05-22 22:04:24] [INFO ] Actually due to overlaps returned [112, 209, 409, 509, 608, 609, 826, 410, 97, 103, 108, 188, 194, 199, 297, 302, 385, 391, 401, 496, 592, 598, 603, 681, 698, 902, 908, 1010, 1013, 1024, 78, 109, 202, 267, 367, 467, 499, 569, 701, 774, 797, 807, 817, 883, 911, 1016]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 790 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 981/1435 places, 2110/2439 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 981 transition count 2106
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 977 transition count 2106
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 34 place count 951 transition count 2078
Iterating global reduction 2 with 26 rules applied. Total rules applied 60 place count 951 transition count 2078
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 951 transition count 2076
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 67 place count 946 transition count 2071
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 946 transition count 2071
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 100 place count 932 transition count 2057
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 119 place count 932 transition count 2038
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 138 place count 913 transition count 2038
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 913 transition count 2034
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 146 place count 909 transition count 2034
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 909 transition count 2034
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 908 transition count 2033
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 908 transition count 2033
Applied a total of 149 rules in 224 ms. Remains 908 /981 variables (removed 73) and now considering 2033/2110 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15895191901400840895.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2519154649307691799.kers'
[2026-05-22 22:04:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15895191901400840895.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2519154649307691799.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 2033 rows 906 cols 8081 entries
Finished phase 1 with 284 SingleSign rule and 521 generalized
[2026-05-22 22:04:24] [INFO ] Computed 103 invariants in 51 ms
Computed 103 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-2519154649307691799.kers
Total runtime 53 ms.
[2026-05-22 22:04:25] [INFO ] Implicit Places using invariants in 910 ms returned [342, 350]
[2026-05-22 22:04:25] [INFO ] Actually due to overlaps returned [350]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 912 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 907/1435 places, 2033/2439 transitions.
Applied a total of 0 rules in 34 ms. Remains 907 /907 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 4773 ms. Remains : 907/1435 places, 2033/2439 transitions.
RANDOM walk for 40000 steps (367 resets) in 311 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (57 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (65 resets) in 131 ms. (303 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (55 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (64 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 221376 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 4
Probabilistic random walk after 221376 steps, saw 40276 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) 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-4119443075677266009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6089709788180602411.kers'
[2026-05-22 22:04:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4119443075677266009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6089709788180602411.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 3 ms.
// Phase 1: matrix 2033 rows 905 cols 8078 entries
Finished phase 1 with 284 SingleSign rule and 521 generalized
[2026-05-22 22:04:29] [INFO ] Computed 102 invariants in 51 ms
Computed 102 P flows in 51 ms.
Exported basis to /tmp/petrispot-output-6089709788180602411.kers
Total runtime 53 ms.
[2026-05-22 22:04:29] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 435/528 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/567 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 340/907 variables, 67/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2033/2940 variables, 907/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2940 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2940 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2940 variables, 0/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2940/2940 variables, and 1011 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2788 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 907/907 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 435/528 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/567 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/567 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 340/907 variables, 67/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/907 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2033/2940 variables, 907/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2940 variables, 2/1011 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2940 variables, 1/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2940 variables, 2/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2940 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2940 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2940/2940 variables, and 1014 constraints, problems are : Problem set: 0 solved, 4 unsolved in 21289 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 907/907 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24174ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 9663 ms.
Support contains 93 out of 907 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 907/907 places, 2033/2033 transitions.
Applied a total of 0 rules in 29 ms. Remains 907 /907 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 907/907 places, 2033/2033 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 907/907 places, 2033/2033 transitions.
Applied a total of 0 rules in 28 ms. Remains 907 /907 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
[2026-05-22 22:05:03] [INFO ] Invariant cache hit.
[2026-05-22 22:05:03] [INFO ] Implicit Places using invariants in 570 ms returned [342]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 572 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 906/907 places, 2033/2033 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 906 transition count 2033
Applied a total of 1 rules in 56 ms. Remains 906 /906 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15379386743429720682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10163237117954504054.kers'
[2026-05-22 22:05:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15379386743429720682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10163237117954504054.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 2033 rows 904 cols 8078 entries
Finished phase 1 with 282 SingleSign rule and 523 generalized
[2026-05-22 22:05:03] [INFO ] Computed 101 invariants in 18 ms
Computed 101 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-10163237117954504054.kers
Total runtime 21 ms.
[2026-05-22 22:05:04] [INFO ] Implicit Places using invariants in 582 ms returned []
[2026-05-22 22:05:04] [INFO ] Invariant cache hit.
[2026-05-22 22:05:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:05:06] [INFO ] Implicit Places using invariants and state equation in 2213 ms returned []
Implicit Place search using SMT with State Equation took 2799 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 906/907 places, 2033/2033 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3455 ms. Remains : 906/907 places, 2033/2033 transitions.
RANDOM walk for 40000 steps (354 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (56 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (64 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (60 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (63 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 241050 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 4
Probabilistic random walk after 241050 steps, saw 43790 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2026-05-22 22:05:09] [INFO ] Invariant cache hit.
[2026-05-22 22:05:09] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 434/527 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/566 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 340/906 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/906 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2033/2939 variables, 906/1007 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2939 variables, 2/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2939 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/2939 variables, 0/1009 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2939/2939 variables, and 1009 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1881 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 906/906 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 434/527 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 39/566 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/566 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/566 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 340/906 variables, 67/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/906 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/906 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2033/2939 variables, 906/1010 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2939 variables, 2/1012 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2939 variables, 1/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2939 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2939 variables, 0/1013 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2939/2939 variables, and 1013 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9531 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 906/906 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11444ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 11329 ms.
Support contains 93 out of 906 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 2033/2033 transitions.
Applied a total of 0 rules in 28 ms. Remains 906 /906 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 906/906 places, 2033/2033 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 906/906 places, 2033/2033 transitions.
Applied a total of 0 rules in 27 ms. Remains 906 /906 variables (removed 0) and now considering 2033/2033 (removed 0) transitions.
[2026-05-22 22:05:32] [INFO ] Invariant cache hit.
[2026-05-22 22:05:33] [INFO ] Implicit Places using invariants in 612 ms returned []
[2026-05-22 22:05:33] [INFO ] Invariant cache hit.
[2026-05-22 22:05:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 22:05:35] [INFO ] Implicit Places using invariants and state equation in 2294 ms returned []
Implicit Place search using SMT with State Equation took 2922 ms to find 0 implicit places.
[2026-05-22 22:05:35] [INFO ] Redundant transitions in 151 ms returned []
Running 1994 sub problems to find dead transitions.
[2026-05-22 22:05:35] [INFO ] Invariant cache hit.
[2026-05-22 22:05:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/902 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1994 unsolved
SMT process timed out in 30751ms, After SMT, problems are : Problem set: 0 solved, 1994 unsolved
Search for dead transitions found 0 dead transitions in 30759ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33892 ms. Remains : 906/906 places, 2033/2033 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 906 transition count 2031
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 904 transition count 2031
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 903 transition count 2030
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 903 transition count 2029
Applied a total of 7 rules in 60 ms. Remains 903 /906 variables (removed 3) and now considering 2029/2033 (removed 4) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8762923614030565379.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3292105776102471304.kers'
[2026-05-22 22:06:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8762923614030565379.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3292105776102471304.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 2029 rows 900 cols 8038 entries
Finished phase 1 with 279 SingleSign rule and 523 generalized
[2026-05-22 22:06:06] [INFO ] Computed 101 invariants in 21 ms
Computed 101 P flows in 21 ms.
Exported basis to /tmp/petrispot-output-3292105776102471304.kers
Total runtime 36 ms.
[2026-05-22 22:06:06] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2026-05-22 22:06:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2026-05-22 22:06:07] [INFO ] [Nat]Absence check using 35 positive and 66 generalized place invariants in 40 ms returned sat
[2026-05-22 22:06:15] [INFO ] After 7933ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-22 22:06:20] [INFO ] After 13105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2026-05-22 22:06:26] [INFO ] After 19822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 20115 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:06:26] [INFO ] Flatten gal took : 120 ms
[2026-05-22 22:06:26] [INFO ] Applying decomposition
[2026-05-22 22:06:26] [INFO ] Flatten gal took : 105 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/graph9150489313825633812.txt' '-o' '/tmp/graph9150489313825633812.bin' '-w' '/tmp/graph9150489313825633812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9150489313825633812.bin' '-l' '-1' '-v' '-w' '/tmp/graph9150489313825633812.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:06:27] [INFO ] Decomposing Gal with order
[2026-05-22 22:06:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:06:28] [INFO ] Removed a total of 3505 redundant transitions.
[2026-05-22 22:06:28] [INFO ] Flatten gal took : 367 ms
[2026-05-22 22:06:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 59 ms.
[2026-05-22 22:06:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12301314202375001835.gal : 62 ms
[2026-05-22 22:06:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15847834629083469602.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/ReachabilityCardinality12301314202375001835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15847834629083469602.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/ReachabilityCardinality15847834629083469602.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2 after 7.83073e+13
Detected timeout of ITS tools.
[2026-05-22 22:36:29] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16762430656021439437
[2026-05-22 22:36:29] [INFO ] Too many transitions (2033) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:36:29] [INFO ] Applying decomposition
[2026-05-22 22:36:29] [INFO ] Flatten gal took : 44 ms
[2026-05-22 22:36:29] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16762430656021439437
Running compilation step : cd /tmp/ltsmin16762430656021439437;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '180' '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'
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/graph11178993912677505399.txt' '-o' '/tmp/graph11178993912677505399.bin' '-w' '/tmp/graph11178993912677505399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11178993912677505399.bin' '-l' '-1' '-v' '-w' '/tmp/graph11178993912677505399.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:36:29] [INFO ] Decomposing Gal with order
[2026-05-22 22:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:36:29] [INFO ] Removed a total of 3805 redundant transitions.
[2026-05-22 22:36:29] [INFO ] Flatten gal took : 80 ms
[2026-05-22 22:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 52 ms.
[2026-05-22 22:36:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7760478529247763561.gal : 12 ms
[2026-05-22 22:36:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9506138684655089217.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/ReachabilityFireability7760478529247763561.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9506138684655089217.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability9506138684655089217.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 35
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :35 after 442464
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :442464 after 2.39952e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.39952e+06 after 3.94543e+09
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3.94543e+09 after 9.46001e+13
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :9.46001e+13 after 5.49845e+14
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :5.49845e+14 after 1.2888e+15
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.2888e+15 after 2.13547e+15
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.13547e+15 after 8.38506e+15
Compilation finished in 5000 ms.
Running link step : cd /tmp/ltsmin16762430656021439437;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16762430656021439437;'/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' 'ASLinkPT09bReachabilityFireability202404==true'
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.38506e+15 after 1.55344e+17
Reachability property ASLink-PT-09b-ReachabilityFireability-2024-08 is true.
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ASLink-PT-09b-ReachabilityFireability-2024-05 is true.
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ASLink-PT-09b-ReachabilityFireability-2024-04 does not hold.
FORMULA ASLink-PT-09b-ReachabilityFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.55344e+17 after 1.68801e+18
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16762430656021439437;'/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' 'ASLinkPT09bReachabilityFireability202404==true'
Running LTSmin : cd /tmp/ltsmin16762430656021439437;'/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' 'ASLinkPT09bReachabilityFireability202409==true'
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.68801e+18 after 1.4689e+19
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin16762430656021439437;'/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' 'ASLinkPT09bReachabilityFireability202409==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin16762430656021439437;'/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' 'ASLinkPT09bReachabilityFireability202409==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-09b"
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-09b, 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-177944366300423"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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