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

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

=== Now, execution of the tool begins

BK_START 1779487221281

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 22:00:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 22:00:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:00:23] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2026-05-22 22:00:23] [INFO ] Transformed 4014 places.
[2026-05-22 22:00:23] [INFO ] Transformed 4932 transitions.
[2026-05-22 22:00:23] [INFO ] Found NUPN structural information;
[2026-05-22 22:00:23] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (49 resets) in 1754 ms. (22 steps per ms) remains 9/13 properties
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
[2026-05-22 22:00:24] [INFO ] Flatten gal took : 532 ms
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 333 ms. (119 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
[2026-05-22 22:00:24] [INFO ] Flatten gal took : 250 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4749706595780375221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8253383164191309361.kers'
[2026-05-22 22:00:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4749706595780375221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8253383164191309361.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4932 rows 4014 cols 14960 entries
[2026-05-22 22:00:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1573512882661271163.gal : 97 ms
[2026-05-22 22:00:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12396941287643815636.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/ReachabilityCardinality1573512882661271163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12396941287643815636.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished phase 1 with 2728 SingleSign rule and 892 generalized
[2026-05-22 22:00:24] [INFO ] Computed 394 invariants in 42 ms
Computed 394 P flows in 42 ms.
Exported basis to /tmp/petrispot-output-8253383164191309361.kers
Total runtime 46 ms.

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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 883/946 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Loading property file /tmp/ReachabilityCardinality12396941287643815636.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 883/977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 906/1852 variables, 58/1035 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1852 variables, 906/1941 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1852 variables, 0/1941 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2048/3900 variables, 271/2212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3900 variables, 2048/4260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3900 variables, 0/4260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 114/4014 variables, 34/4294 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4014 variables, 114/4408 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4014/8946 variables, and 4408 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5043 ms.
Refiners :[Domain max(s): 4014/4014 constraints, Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 305/305 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 883/946 variables, 31/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 883/977 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 2/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 906/1852 variables, 58/1037 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1852 variables, 906/1943 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1852 variables, 1/1944 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1852 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2048/3900 variables, 271/2215 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3900 variables, 2048/4263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3900/8946 variables, and 4263 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5014 ms.
Refiners :[Domain max(s): 3900/4014 constraints, Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 271/305 constraints, State Equation: 0/4014 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10304ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 63 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 903 transitions
Trivial Post-agglo rules discarded 903 transitions
Performed 903 trivial Post agglomeration. Transition count delta: 903
Iterating post reduction 0 with 903 rules applied. Total rules applied 903 place count 4014 transition count 4029
Reduce places removed 903 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 942 rules applied. Total rules applied 1845 place count 3111 transition count 3990
Reduce places removed 9 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 20 rules applied. Total rules applied 1865 place count 3102 transition count 3979
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1876 place count 3091 transition count 3979
Performed 909 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 909 Pre rules applied. Total rules applied 1876 place count 3091 transition count 3070
Deduced a syphon composed of 909 places in 9 ms
Ensure Unique test removed 81 places
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 4 with 1899 rules applied. Total rules applied 3775 place count 2101 transition count 3070
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 4 with 62 rules applied. Total rules applied 3837 place count 2086 transition count 3023
Reduce places removed 47 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 5 with 52 rules applied. Total rules applied 3889 place count 2039 transition count 3018
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3894 place count 2034 transition count 3018
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3894 place count 2034 transition count 2986
Deduced a syphon composed of 32 places in 7 ms
Ensure Unique test removed 30 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 7 with 94 rules applied. Total rules applied 3988 place count 1972 transition count 2986
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 28 Pre rules applied. Total rules applied 3988 place count 1972 transition count 2958
Deduced a syphon composed of 28 places in 13 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 4044 place count 1944 transition count 2958
Discarding 125 places :
Symmetric choice reduction at 7 with 125 rule applications. Total rules 4169 place count 1819 transition count 2833
Iterating global reduction 7 with 125 rules applied. Total rules applied 4294 place count 1819 transition count 2833
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4295 place count 1819 transition count 2832
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 39 Pre rules applied. Total rules applied 4295 place count 1819 transition count 2793
Deduced a syphon composed of 39 places in 15 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 8 with 79 rules applied. Total rules applied 4374 place count 1779 transition count 2793
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4374 place count 1779 transition count 2792
Deduced a syphon composed of 1 places in 14 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4377 place count 1777 transition count 2792
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 4387 place count 1767 transition count 2729
Iterating global reduction 8 with 10 rules applied. Total rules applied 4397 place count 1767 transition count 2729
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 4397 place count 1767 transition count 2720
Deduced a syphon composed of 9 places in 12 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 4415 place count 1758 transition count 2720
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4416 place count 1757 transition count 2712
Iterating global reduction 8 with 1 rules applied. Total rules applied 4417 place count 1757 transition count 2712
Performed 229 Post agglomeration using F-continuation condition.Transition count delta: 229
Deduced a syphon composed of 229 places in 8 ms
Ensure Unique test removed 4 places
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 8 with 462 rules applied. Total rules applied 4879 place count 1524 transition count 2483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4881 place count 1523 transition count 2492
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 4882 place count 1523 transition count 2491
Discarding 1 places :
Implicit places reduction removed 1 places
SDD proceeding with computation,9 properties remain. new max is 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4884 place count 1522 transition count 2490
SDD size :10 after 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4885 place count 1521 transition count 2490
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :15 after 21
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :21 after 153
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 4897 place count 1521 transition count 2478
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 4909 place count 1509 transition count 2478
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :153 after 352
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :352 after 960
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4923 place count 1509 transition count 2464
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 4937 place count 1495 transition count 2464
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :960 after 12499
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 4942 place count 1495 transition count 2464
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :12499 after 32460
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4943 place count 1494 transition count 2463
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 9 rules applied. Total rules applied 4952 place count 1487 transition count 2461
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4954 place count 1485 transition count 2461
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 10 Pre rules applied. Total rules applied 4954 place count 1485 transition count 2451
Deduced a syphon composed of 10 places in 9 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 20 rules applied. Total rules applied 4974 place count 1475 transition count 2451
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 4978 place count 1471 transition count 2451
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :32460 after 625239
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 15 with 18 rules applied. Total rules applied 4996 place count 1462 transition count 2442
Discarding 4 places :
Symmetric choice reduction at 15 with 4 rule applications. Total rules 5000 place count 1458 transition count 2438
Iterating global reduction 15 with 4 rules applied. Total rules applied 5004 place count 1458 transition count 2438
Free-agglomeration rule applied 4 times.
Iterating global reduction 15 with 4 rules applied. Total rules applied 5008 place count 1458 transition count 2434
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 5012 place count 1454 transition count 2434
Applied a total of 5012 rules in 2554 ms. Remains 1454 /4014 variables (removed 2560) and now considering 2434/4932 (removed 2498) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2566 ms. Remains : 1454/4014 places, 2434/4932 transitions.
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :625239 after 7.18249e+10
RANDOM walk for 40000 steps (311 resets) in 671 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 207 ms. (192 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 227 ms. (175 steps per ms) remains 8/9 properties
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (30 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (34 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (34 resets) in 159 ms. (250 steps per ms) remains 7/8 properties
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (32 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8286607159760648605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3922048595438218709.kers'
[2026-05-22 22:00:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8286607159760648605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3922048595438218709.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 1 ms.
// Phase 1: matrix 2434 rows 1438 cols 9445 entries
Finished phase 1 with 415 SingleSign rule and 789 generalized
[2026-05-22 22:00:38] [INFO ] Computed 250 invariants in 24 ms
Computed 250 P flows in 25 ms.
Exported basis to /tmp/petrispot-output-3922048595438218709.kers
Total runtime 27 ms.
[2026-05-22 22:00:38] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 374/427 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 189/616 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/616 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 54/670 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :7.18249e+10 after 1.26402e+17
At refinement iteration 6 (INCLUDED_ONLY) 0/670 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 12/682 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 618/1300 variables, 121/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 62/1362 variables, 19/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1362 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 3/1365 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1365 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 87/1452 variables, 33/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :1.26402e+17 after 1.14019e+23
At refinement iteration 16 (INCLUDED_ONLY) 0/1452 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 2433/3885 variables, 1452/1701 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3885 variables, 13/1714 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3885 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (OVERLAPS) 3/3888 variables, 2/1716 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3888 variables, 1/1717 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3888 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/3888 variables, 0/1717 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3888/3888 variables, and 1717 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4239 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 154/154 constraints, State Equation: 1454/1454 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
At refinement iteration 1 (OVERLAPS) 374/427 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD size :1.14019e+23 after 8.92423e+34
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 189/616 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/616 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 54/670 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/670 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 12/682 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 618/1300 variables, 121/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1300 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1300 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 62/1362 variables, 19/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1362 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/1365 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1365 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 87/1452 variables, 33/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1452 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-09b-ReachabilityCardinality-2024-10 is UNSAT
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 19 (OVERLAPS) 2433/3885 variables, 1452/1704 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3885 variables, 13/1717 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3885 variables, 6/1723 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3885 variables, 1/1724 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3885 variables, 0/1724 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 3/3888 variables, 2/1726 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3888 variables, 1/1727 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3888 variables, 0/1727 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/3888 variables, 0/1727 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3888/3888 variables, and 1727 constraints, problems are : Problem set: 1 solved, 6 unsolved in 15070 ms.
Refiners :[Positive P Invariants (semi-flows): 96/96 constraints, Generalized P Invariants (flows): 154/154 constraints, State Equation: 1454/1454 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19380ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10130 ms.
Support contains 36 out of 1454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1454/1454 places, 2434/2434 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1454 transition count 2428
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1448 transition count 2428
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 12 place count 1448 transition count 2412
Deduced a syphon composed of 16 places in 9 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 1428 transition count 2412
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 1 rules applied. Total rules applied 49 place count 1428 transition count 2411
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 51 place count 1426 transition count 2411
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 51 place count 1426 transition count 2409
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 1424 transition count 2409
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 57 place count 1422 transition count 2409
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 8 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 77 place count 1412 transition count 2399
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 79 place count 1410 transition count 2397
Iterating global reduction 5 with 2 rules applied. Total rules applied 81 place count 1410 transition count 2397
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 84 place count 1410 transition count 2394
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 87 place count 1407 transition count 2394
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 88 place count 1407 transition count 2393
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 89 place count 1406 transition count 2393
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 90 place count 1405 transition count 2392
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 94 place count 1402 transition count 2391
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 95 place count 1401 transition count 2391
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 95 place count 1401 transition count 2386
Deduced a syphon composed of 5 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 11 rules applied. Total rules applied 106 place count 1395 transition count 2386
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 108 place count 1393 transition count 2386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 108 place count 1393 transition count 2385
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 110 place count 1392 transition count 2385
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 116 place count 1389 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 117 place count 1388 transition count 2381
Iterating global reduction 10 with 1 rules applied. Total rules applied 118 place count 1388 transition count 2381
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 119 place count 1388 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 120 place count 1387 transition count 2380
Applied a total of 120 rules in 662 ms. Remains 1387 /1454 variables (removed 67) and now considering 2380/2434 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 662 ms. Remains : 1387/1454 places, 2380/2434 transitions.
RANDOM walk for 40000 steps (341 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (32 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (35 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (35 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (34 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 113095 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 113095 steps, saw 28705 distinct states, run finished after 3023 ms. (steps per millisecond=37 ) 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-5137183148187634356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2802702136046336065.kers'
[2026-05-22 22:01:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5137183148187634356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2802702136046336065.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 1 ms.
// Phase 1: matrix 2380 rows 1367 cols 9266 entries
Finished phase 1 with 408 SingleSign rule and 742 generalized
[2026-05-22 22:01:11] [INFO ] Computed 237 invariants in 23 ms
Computed 237 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-2802702136046336065.kers
Total runtime 26 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 195/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 143/374 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 36/410 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 604/1014 variables, 82/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1014 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 197/1211 variables, 43/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1211 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 6/1217 variables, 6/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1217 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 168/1385 variables, 61/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1385 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/1387 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1387 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2380/3767 variables, 1387/1624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3767 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/3767 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3767/3767 variables, and 1624 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3359 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, Generalized P Invariants (flows): 143/143 constraints, State Equation: 1387/1387 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 195/231 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 143/374 variables, 15/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/374 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 36/410 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 604/1014 variables, 82/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1014 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 197/1211 variables, 43/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1211 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 6/1217 variables, 6/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1217 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 168/1385 variables, 61/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1385 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1385 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/1387 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1387 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1387 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 2380/3767 variables, 1387/1627 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3767 variables, 6/1633 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3767 variables, 2/1635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3767 variables, 0/1635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/3767 variables, 0/1635 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3767/3767 variables, and 1635 constraints, problems are : Problem set: 0 solved, 6 unsolved in 14377 ms.
Refiners :[Positive P Invariants (semi-flows): 94/94 constraints, Generalized P Invariants (flows): 143/143 constraints, State Equation: 1387/1387 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17810ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 17879 ms.
Support contains 36 out of 1387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2380/2380 transitions.
Applied a total of 0 rules in 86 ms. Remains 1387 /1387 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 1387/1387 places, 2380/2380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2380/2380 transitions.
Applied a total of 0 rules in 61 ms. Remains 1387 /1387 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
[2026-05-22 22:01:47] [INFO ] Invariant cache hit.
[2026-05-22 22:01:49] [INFO ] Implicit Places using invariants in 1510 ms returned [1, 18, 21, 36, 53, 71, 138, 153, 158, 169, 170, 172, 189, 207, 278, 282, 283, 295, 296, 298, 315, 333, 372, 411, 426, 427, 429, 446, 464, 535, 539, 540, 551, 552, 554, 571, 589, 676, 690, 693, 694, 696, 713, 731, 807, 822, 823, 826, 862, 923, 941, 956, 957, 959, 976, 994, 1068, 1072, 1073, 1088, 1089, 1091, 1108, 1126, 1195, 1199, 1200, 1203, 1214, 1215, 1216, 1249, 1252, 1256, 1274, 1275, 1276, 1278, 1291, 1297, 1303, 1309, 1315, 1321, 1327, 1333, 1339, 1345, 1351]
[2026-05-22 22:01:49] [INFO ] Actually due to overlaps returned [1249, 1216, 36, 53, 189, 315, 446, 554, 571, 713, 976, 1108, 1256, 172, 298, 429, 696, 826, 959, 1091, 169, 295, 426, 551, 693, 822, 956, 1088, 1214, 1274, 18, 170, 296, 427, 552, 694, 823, 957, 1089, 1215, 1252, 1275, 1, 282, 283, 411, 539, 540, 676, 807, 941, 1072, 1073, 1199, 1200, 71, 207, 333, 464, 589, 690, 731, 862, 994, 1126, 1276, 1339, 1351, 21, 138, 1203, 1278, 1291, 1297, 1303, 1309, 1315, 1321, 1327, 1333, 1345]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 1527 ms to find 81 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1306/1387 places, 2380/2380 transitions.
Discarding 7 places :
Implicit places reduction removed 7 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 149 rules applied. Total rules applied 149 place count 1299 transition count 2238
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 157 rules applied. Total rules applied 306 place count 1157 transition count 2223
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 317 place count 1146 transition count 2223
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 317 place count 1146 transition count 2183
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 397 place count 1106 transition count 2183
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 403 place count 1103 transition count 2180
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 406 place count 1100 transition count 2180
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 420 place count 1086 transition count 2166
Iterating global reduction 5 with 14 rules applied. Total rules applied 434 place count 1086 transition count 2166
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 442 place count 1078 transition count 2155
Iterating global reduction 5 with 8 rules applied. Total rules applied 450 place count 1078 transition count 2155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 452 place count 1078 transition count 2153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 452 place count 1078 transition count 2152
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 454 place count 1077 transition count 2152
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 1076 transition count 2151
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 1076 transition count 2151
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 1075 transition count 2149
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 1075 transition count 2149
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 7 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 596 place count 1006 transition count 2080
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 601 place count 1001 transition count 2075
Iterating global reduction 6 with 5 rules applied. Total rules applied 606 place count 1001 transition count 2075
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 610 place count 1001 transition count 2071
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 614 place count 999 transition count 2072
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 651 place count 999 transition count 2035
Ensure Unique test removed 1 places
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 689 place count 961 transition count 2035
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 712 place count 961 transition count 2035
Applied a total of 712 rules in 478 ms. Remains 961 /1306 variables (removed 345) and now considering 2035/2380 (removed 345) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-688299227627012899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7263725184817097489.kers'
[2026-05-22 22:01:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-688299227627012899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7263725184817097489.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 2035 rows 955 cols 8316 entries
Finished phase 1 with 333 SingleSign rule and 483 generalized
[2026-05-22 22:01:49] [INFO ] Computed 145 invariants in 18 ms
Computed 145 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-7263725184817097489.kers
Total runtime 20 ms.
[2026-05-22 22:01:50] [INFO ] Implicit Places using invariants in 952 ms returned [79, 98, 109, 111, 117, 120, 121, 176, 201, 204, 206, 211, 213, 284, 290, 293, 295, 298, 305, 306, 360, 377, 383, 385, 389, 394, 395, 466, 472, 475, 477, 486, 494, 495, 566, 574, 577, 579, 582, 589, 590, 669, 685, 688, 695, 696, 751, 783, 785, 791, 792, 793, 845, 862, 868, 871, 873, 956, 958, 960]
[2026-05-22 22:01:50] [INFO ] Actually due to overlaps returned [120, 211, 305, 394, 494, 589, 695, 792, 121, 213, 306, 495, 590, 696, 793, 395, 98, 111, 201, 206, 284, 290, 295, 377, 383, 389, 466, 472, 477, 566, 574, 579, 785, 862, 868, 873, 79, 117, 176, 298, 360, 486, 582, 669, 685, 688, 751, 791, 845, 956, 958]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 968 ms to find 51 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 910/1387 places, 2035/2380 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 881 transition count 2006
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 881 transition count 2006
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 875 transition count 2000
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 875 transition count 2000
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 874 transition count 1999
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 874 transition count 1999
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 100 place count 860 transition count 1985
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 103 place count 860 transition count 1982
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 124 place count 860 transition count 1961
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 145 place count 839 transition count 1961
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 149 place count 839 transition count 1957
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 153 place count 835 transition count 1957
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 835 transition count 1957
Applied a total of 154 rules in 309 ms. Remains 835 /910 variables (removed 75) and now considering 1957/2035 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5123694537072858369.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1074344993176787029.kers'
[2026-05-22 22:01:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5123694537072858369.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1074344993176787029.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1957 rows 830 cols 7882 entries
Finished phase 1 with 278 SingleSign rule and 463 generalized
[2026-05-22 22:01:51] [INFO ] Computed 94 invariants in 15 ms
Computed 94 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1074344993176787029.kers
Total runtime 17 ms.
[2026-05-22 22:01:51] [INFO ] Implicit Places using invariants in 787 ms returned []
[2026-05-22 22:01:51] [INFO ] Invariant cache hit.
[2026-05-22 22:01:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:01:54] [INFO ] Implicit Places using invariants and state equation in 2751 ms returned []
Implicit Place search using SMT with State Equation took 3544 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 835/1387 places, 1957/2380 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6889 ms. Remains : 835/1387 places, 1957/2380 transitions.
RANDOM walk for 40000 steps (494 resets) in 318 ms. (125 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (50 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (65 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (58 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (68 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 251211 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 6
Probabilistic random walk after 251211 steps, saw 50939 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
[2026-05-22 22:01:57] [INFO ] Invariant cache hit.
[2026-05-22 22:01:57] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 222/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/321 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 423/744 variables, 49/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/744 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 3/747 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/747 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 88/835 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/835 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1957/2792 variables, 835/929 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2792 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2792 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/2792 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2792/2792 variables, and 930 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1989 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 835/835 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 222/258 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 63/321 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 423/744 variables, 49/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/744 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 3/747 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/747 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 88/835 variables, 17/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/835 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 1957/2792 variables, 835/930 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2792 variables, 1/931 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2792 variables, 6/937 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2792 variables, 1/938 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2792 variables, 1/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2792 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/2792 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2792/2792 variables, and 939 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9007 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 835/835 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11024ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 11731 ms.
Support contains 36 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 1957/1957 transitions.
Applied a total of 0 rules in 35 ms. Remains 835 /835 variables (removed 0) and now considering 1957/1957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 835/835 places, 1957/1957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 1957/1957 transitions.
Applied a total of 0 rules in 34 ms. Remains 835 /835 variables (removed 0) and now considering 1957/1957 (removed 0) transitions.
[2026-05-22 22:02:20] [INFO ] Invariant cache hit.
[2026-05-22 22:02:21] [INFO ] Implicit Places using invariants in 706 ms returned []
[2026-05-22 22:02:21] [INFO ] Invariant cache hit.
[2026-05-22 22:02:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 22:02:24] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3403 ms to find 0 implicit places.
[2026-05-22 22:02:24] [INFO ] Redundant transitions in 181 ms returned []
Running 1911 sub problems to find dead transitions.
[2026-05-22 22:02:24] [INFO ] Invariant cache hit.
[2026-05-22 22:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1911 unsolved
SMT process timed out in 30923ms, After SMT, problems are : Problem set: 0 solved, 1911 unsolved
Search for dead transitions found 0 dead transitions in 30938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34603 ms. Remains : 835/835 places, 1957/1957 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 835 transition count 1956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 834 transition count 1956
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 834 transition count 1949
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 827 transition count 1949
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 826 transition count 1948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 826 transition count 1947
Applied a total of 19 rules in 104 ms. Remains 826 /835 variables (removed 9) and now considering 1947/1957 (removed 10) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15124580681996221514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16882839617059988933.kers'
[2026-05-22 22:02:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15124580681996221514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16882839617059988933.kers]
Culling duplicate invariants (modulo rational): removing 7 columns.
Culled 7 columns in 3 ms.
// Phase 1: matrix 1947 rows 819 cols 7801 entries
Finished phase 1 with 271 SingleSign rule and 461 generalized
[2026-05-22 22:02:55] [INFO ] Computed 94 invariants in 45 ms
Computed 94 P flows in 46 ms.
Exported basis to /tmp/petrispot-output-16882839617059988933.kers
Total runtime 47 ms.
[2026-05-22 22:02:55] [INFO ] After 338ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 22:02:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2026-05-22 22:02:56] [INFO ] [Nat]Absence check using 30 positive and 64 generalized place invariants in 83 ms returned sat
[2026-05-22 22:02:57] [INFO ] After 1711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 22:02:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2026-05-22 22:02:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
TRAPS : Iteration 1
[2026-05-22 22:03:01] [INFO ] After 5113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 22:03:02] [INFO ] After 6578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2026-05-22 22:03:02] [INFO ] Flatten gal took : 70 ms
[2026-05-22 22:03:02] [INFO ] Flatten gal took : 59 ms
[2026-05-22 22:03:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16790256980150764165.gal : 27 ms
[2026-05-22 22:03:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14475401654182156202.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/ReachabilityCardinality16790256980150764165.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14475401654182156202.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14475401654182156202.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :6 after 14
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14 after 42
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :42 after 224
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :224 after 150248
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :150248 after 3.25515e+10
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.25515e+10 after 6.68078e+10
Invariant property ASLink-PT-09b-ReachabilityCardinality-2024-09 does not hold.
Reachability property ASLink-PT-09b-ReachabilityCardinality-2024-08 is true.
Detected timeout of ITS tools.
[2026-05-22 22:03:17] [INFO ] Flatten gal took : 48 ms
[2026-05-22 22:03:17] [INFO ] Applying decomposition
[2026-05-22 22:03:17] [INFO ] Flatten gal took : 48 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/graph14315222050792268012.txt' '-o' '/tmp/graph14315222050792268012.bin' '-w' '/tmp/graph14315222050792268012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14315222050792268012.bin' '-l' '-1' '-v' '-w' '/tmp/graph14315222050792268012.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:03:18] [INFO ] Decomposing Gal with order
[2026-05-22 22:03:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:03:18] [INFO ] Removed a total of 3891 redundant transitions.
[2026-05-22 22:03:18] [INFO ] Flatten gal took : 176 ms
[2026-05-22 22:03:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 57 ms.
[2026-05-22 22:03:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15408863364602456392.gal : 17 ms
[2026-05-22 22:03:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality972794894604853423.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/ReachabilityCardinality15408863364602456392.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality972794894604853423.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/ReachabilityCardinality972794894604853423.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 2044
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2044 after 6132
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :6132 after 117824
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :117824 after 1.08326e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.08326e+06 after 2.81791e+13
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2.81791e+13 after 5.34688e+13
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :5.34688e+13 after 1.9368e+16
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 38264 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 22:03:33] [INFO ] Flatten gal took : 102 ms
[2026-05-22 22:03:33] [INFO ] Applying decomposition
[2026-05-22 22:03:33] [INFO ] Flatten gal took : 101 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/graph5380090858901680596.txt' '-o' '/tmp/graph5380090858901680596.bin' '-w' '/tmp/graph5380090858901680596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5380090858901680596.bin' '-l' '-1' '-v' '-w' '/tmp/graph5380090858901680596.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:03:34] [INFO ] Decomposing Gal with order
[2026-05-22 22:03:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:03:35] [INFO ] Removed a total of 3499 redundant transitions.
[2026-05-22 22:03:35] [INFO ] Flatten gal took : 245 ms
[2026-05-22 22:03:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 53 ms.
[2026-05-22 22:03:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4368039866270256856.gal : 47 ms
[2026-05-22 22:03:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3573753728481452424.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/ReachabilityCardinality4368039866270256856.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3573753728481452424.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/ReachabilityCardinality3573753728481452424.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1 after 819481
Detected timeout of ITS tools.
[2026-05-22 22:33:35] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12494471344033246118
[2026-05-22 22:33:35] [INFO ] Too many transitions (1957) to apply POR reductions. Disabling POR matrices.
[2026-05-22 22:33:35] [INFO ] Applying decomposition
[2026-05-22 22:33:35] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12494471344033246118
[2026-05-22 22:33:35] [INFO ] Flatten gal took : 56 ms
Running compilation step : cd /tmp/ltsmin12494471344033246118;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '120' '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/graph967365949507170953.txt' '-o' '/tmp/graph967365949507170953.bin' '-w' '/tmp/graph967365949507170953.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph967365949507170953.bin' '-l' '-1' '-v' '-w' '/tmp/graph967365949507170953.weights' '-q' '0' '-e' '0.001'
[2026-05-22 22:33:35] [INFO ] Decomposing Gal with order
[2026-05-22 22:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 22:33:35] [INFO ] Removed a total of 3794 redundant transitions.
[2026-05-22 22:33:36] [INFO ] Flatten gal took : 80 ms
[2026-05-22 22:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 57 ms.
[2026-05-22 22:33:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2736263831702797898.gal : 15 ms
[2026-05-22 22:33:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6730297227176737645.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/ReachabilityCardinality2736263831702797898.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6730297227176737645.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/ReachabilityCardinality6730297227176737645.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :8 after 1344
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1344 after 58296
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :58296 after 445144
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :2.35301e+12 after 3.21332e+12
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :3.21332e+12 after 3.33744e+12
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.33744e+12 after 6.66235e+13
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6.66235e+13 after 7.03337e+13
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :7.03337e+13 after 9.19438e+13
Compilation finished in 4268 ms.
Running link step : cd /tmp/ltsmin12494471344033246118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202400==true'
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :9.19438e+13 after 1.44544e+16
Invariant property ASLink-PT-09b-ReachabilityCardinality-2024-09 does not hold.
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ASLink-PT-09b-ReachabilityCardinality-2024-08 is true.
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202400==true'
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202406==true'
Invariant property ASLink-PT-09b-ReachabilityCardinality-2024-00 does not hold.
FORMULA ASLink-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :6.69792e+16 after 4.97949e+17
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202406==true'
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202407==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202407==true'
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202415==true'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202415==true'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202406==true'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202406==true'
Running LTSmin : cd /tmp/ltsmin12494471344033246118;'/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' 'ASLinkPT09bReachabilityCardinality202407==true'

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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