fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r072-tall-174860067700557
Last Updated
June 24, 2025

About the Execution of ITS-Tools for DoubleLock-PT-p2s2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 0 ? 1 ? 1 0 0 ? 1 ? 1 1 1 ? 1 10 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067700557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067700557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 813K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748775904720

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-01 11:05:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 11:05:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:05:06] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2025-06-01 11:05:06] [INFO ] Transformed 184 places.
[2025-06-01 11:05:06] [INFO ] Transformed 1832 transitions.
[2025-06-01 11:05:06] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Deduced a syphon composed of 36 places in 7 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-01 11:05:06] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
// Phase 1: matrix 1225 rows 148 cols
[2025-06-01 11:05:06] [INFO ] Computed 4 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1, +inf, 1, 1, 1, +inf, 1, 10]
RANDOM walk for 10006 steps (103 resets) in 52 ms. (188 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (94 resets) in 71 ms. (694 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 2, 3] Max Struct:[+inf, +inf, 1, +inf, +inf]
[2025-06-01 11:05:06] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2025-06-01 11:05:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:06] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-01 11:05:06] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2025-06-01 11:05:06] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2025-06-01 11:05:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:05:06] [INFO ] [Real]Added 116 Read/Feed constraints in 61 ms returned sat
[2025-06-01 11:05:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-01 11:05:07] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:07] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2025-06-01 11:05:07] [INFO ] [Nat]Added 116 Read/Feed constraints in 144 ms returned sat
[2025-06-01 11:05:07] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 182 ms.
[2025-06-01 11:05:07] [INFO ] Added : 1 causal constraints over 1 iterations in 348 ms. Result :sat
Minimization took 618 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:08] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2025-06-01 11:05:08] [INFO ] [Real]Added 116 Read/Feed constraints in 78 ms returned sat
[2025-06-01 11:05:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:05:08] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:05:08] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2025-06-01 11:05:09] [INFO ] [Nat]Added 116 Read/Feed constraints in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:09] [INFO ] Deduced a trap composed of 51 places in 220 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:09] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:09] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:10] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 21 ms to minimize.
[2025-06-01 11:05:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1039 ms
[2025-06-01 11:05:10] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 84 ms.
[2025-06-01 11:05:10] [INFO ] Added : 0 causal constraints over 0 iterations in 172 ms. Result :sat
Minimization took 608 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:05:10] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Real]Added 116 Read/Feed constraints in 41 ms returned sat
[2025-06-01 11:05:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2025-06-01 11:05:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 128 ms returned sat
[2025-06-01 11:05:11] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 90 ms.
[2025-06-01 11:05:11] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Minimization took 633 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Real]Added 116 Read/Feed constraints in 84 ms returned sat
[2025-06-01 11:05:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:12] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-01 11:05:13] [INFO ] [Nat]Added 116 Read/Feed constraints in 401 ms returned sat
[2025-06-01 11:05:13] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 90 ms.
[2025-06-01 11:05:13] [INFO ] Added : 2 causal constraints over 1 iterations in 233 ms. Result :sat
Minimization took 628 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Real]Added 116 Read/Feed constraints in 40 ms returned sat
[2025-06-01 11:05:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:05:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2025-06-01 11:05:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 108 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:05:15] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 22 ms to minimize.
[2025-06-01 11:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 519 ms
[2025-06-01 11:05:15] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 84 ms.
[2025-06-01 11:05:15] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 621 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 2, 3] Max Struct:[+inf, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 2, 3] Max Struct:[+inf, +inf, 1, +inf, +inf]
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 144 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 143 transition count 1720
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 143 transition count 1720
Applied a total of 19 rules in 102 ms. Remains 143 /148 variables (removed 5) and now considering 1720/1768 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 143/148 places, 1720/1768 transitions.
[2025-06-01 11:05:16] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :[1, 0, 1, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 1, 1, 2, 3] Max Struct:[+inf, +inf, 1, +inf, +inf]
[2025-06-01 11:05:16] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-06-01 11:05:16] [INFO ] Computed 2 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2, 3] Max Struct:[+inf, +inf, 1, +inf, +inf]
FORMULA DoubleLock-PT-p2s2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (10186 resets) in 1436 ms. (695 steps per ms)
BEST_FIRST walk for 4000003 steps (7760 resets) in 2015 ms. (1984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:05:20] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:05:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:20] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2025-06-01 11:05:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:05:20] [INFO ] [Real]Added 116 Read/Feed constraints in 114 ms returned sat
[2025-06-01 11:05:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:21] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2025-06-01 11:05:21] [INFO ] [Nat]Added 116 Read/Feed constraints in 221 ms returned sat
[2025-06-01 11:05:21] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 80 ms.
[2025-06-01 11:05:21] [INFO ] Added : 1 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 1626 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:23] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:23] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-06-01 11:05:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 7 ms returned sat
[2025-06-01 11:05:23] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-06-01 11:05:26] [INFO ] [Nat]Added 116 Read/Feed constraints in 3117 ms returned sat
[2025-06-01 11:05:26] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 86 ms.
[2025-06-01 11:05:26] [INFO ] Added : 0 causal constraints over 0 iterations in 169 ms. Result :sat
Minimization took 1168 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Real]Added 116 Read/Feed constraints in 97 ms returned sat
[2025-06-01 11:05:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:05:28] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:05:29] [INFO ] [Nat]Added 116 Read/Feed constraints in 508 ms returned sat
[2025-06-01 11:05:29] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 78 ms.
[2025-06-01 11:05:29] [INFO ] Added : 2 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 1140 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:05:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:30] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2025-06-01 11:05:30] [INFO ] [Real]Added 116 Read/Feed constraints in 80 ms returned sat
[2025-06-01 11:05:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:05:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:05:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:05:31] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2025-06-01 11:05:31] [INFO ] [Nat]Added 116 Read/Feed constraints in 209 ms returned sat
[2025-06-01 11:05:31] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 83 ms.
[2025-06-01 11:05:31] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 1615 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 52 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 41 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:05:33] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:33] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-01 11:05:33] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:05:34] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:05:35] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:05:35] [INFO ] Redundant transitions in 93 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:05:35] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:05:35] [INFO ] Invariant cache hit.
[2025-06-01 11:05:35] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31380ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31398ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32852 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:06:06] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 159 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :[1, 1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:06:07] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (10205 resets) in 1257 ms. (794 steps per ms)
BEST_FIRST walk for 4000004 steps (7689 resets) in 2083 ms. (1919 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:06:10] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2025-06-01 11:06:10] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-01 11:06:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:06:11] [INFO ] [Real]Added 116 Read/Feed constraints in 111 ms returned sat
[2025-06-01 11:06:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:06:11] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-01 11:06:11] [INFO ] [Nat]Added 116 Read/Feed constraints in 222 ms returned sat
[2025-06-01 11:06:11] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 76 ms.
[2025-06-01 11:06:11] [INFO ] Added : 1 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 1644 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:06:13] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2025-06-01 11:06:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:06:13] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2025-06-01 11:06:14] [INFO ] [Nat]Added 116 Read/Feed constraints in 198 ms returned sat
[2025-06-01 11:06:14] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 74 ms.
[2025-06-01 11:06:14] [INFO ] Added : 0 causal constraints over 0 iterations in 159 ms. Result :sat
Minimization took 1232 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:06:15] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 11:06:15] [INFO ] [Real]Added 116 Read/Feed constraints in 98 ms returned sat
[2025-06-01 11:06:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:06:16] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2025-06-01 11:06:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 516 ms returned sat
[2025-06-01 11:06:16] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 75 ms.
[2025-06-01 11:06:16] [INFO ] Added : 2 causal constraints over 1 iterations in 204 ms. Result :sat
Minimization took 1126 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:06:18] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2025-06-01 11:06:18] [INFO ] [Real]Added 116 Read/Feed constraints in 80 ms returned sat
[2025-06-01 11:06:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:06:18] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2025-06-01 11:06:18] [INFO ] [Nat]Added 116 Read/Feed constraints in 212 ms returned sat
[2025-06-01 11:06:18] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 87 ms.
[2025-06-01 11:06:18] [INFO ] Added : 0 causal constraints over 0 iterations in 156 ms. Result :sat
Minimization took 1621 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:06:21] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:21] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-01 11:06:21] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:06:21] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:06:22] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:06:22] [INFO ] Redundant transitions in 75 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:06:22] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:22] [INFO ] Invariant cache hit.
[2025-06-01 11:06:22] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 30976ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 30980ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32403 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:06:53] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :[1, 1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:06:54] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 4, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000005 steps (10163 resets) in 1209 ms. (826 steps per ms)
BEST_FIRST walk for 4000004 steps (7783 resets) in 1921 ms. (2081 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:06:57] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:06:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:06:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:06:57] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-01 11:06:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:06:57] [INFO ] [Real]Added 116 Read/Feed constraints in 114 ms returned sat
[2025-06-01 11:06:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:06:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:06:57] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:06:57] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2025-06-01 11:06:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 221 ms returned sat
[2025-06-01 11:06:58] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 75 ms.
[2025-06-01 11:06:58] [INFO ] Added : 1 causal constraints over 1 iterations in 197 ms. Result :sat
Minimization took 1628 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:00] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:07:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:00] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 11:07:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:00] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:07:00] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-01 11:07:00] [INFO ] [Nat]Added 116 Read/Feed constraints in 196 ms returned sat
[2025-06-01 11:07:00] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 72 ms.
[2025-06-01 11:07:00] [INFO ] Added : 0 causal constraints over 0 iterations in 145 ms. Result :sat
Minimization took 1210 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:07:02] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-06-01 11:07:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:07:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:02] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:07:02] [INFO ] [Nat]Added 116 Read/Feed constraints in 500 ms returned sat
[2025-06-01 11:07:03] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 72 ms.
[2025-06-01 11:07:03] [INFO ] Added : 2 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 1278 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:04] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:07:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:04] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2025-06-01 11:07:04] [INFO ] [Real]Added 116 Read/Feed constraints in 79 ms returned sat
[2025-06-01 11:07:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:05] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-01 11:07:05] [INFO ] [Nat]Added 116 Read/Feed constraints in 209 ms returned sat
[2025-06-01 11:07:05] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 74 ms.
[2025-06-01 11:07:05] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 1614 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:07:07] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:07:07] [INFO ] Implicit Places using invariants in 148 ms returned []
[2025-06-01 11:07:07] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:07:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:07:09] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:07:09] [INFO ] Redundant transitions in 28 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:07:09] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:09] [INFO ] Invariant cache hit.
[2025-06-01 11:07:09] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31014ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32341 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:07:40] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :[2, 1, 2, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:07:40] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (10287 resets) in 1207 ms. (827 steps per ms)
BEST_FIRST walk for 4000003 steps (7743 resets) in 1952 ms. (2048 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-01 11:07:43] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:44] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-01 11:07:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:07:44] [INFO ] [Real]Added 116 Read/Feed constraints in 109 ms returned sat
[2025-06-01 11:07:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:07:44] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-06-01 11:07:44] [INFO ] [Nat]Added 116 Read/Feed constraints in 219 ms returned sat
[2025-06-01 11:07:44] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 73 ms.
[2025-06-01 11:07:44] [INFO ] Added : 1 causal constraints over 1 iterations in 198 ms. Result :sat
Minimization took 1614 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:07:46] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 11:07:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-01 11:07:46] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2025-06-01 11:07:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 199 ms returned sat
[2025-06-01 11:07:47] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 76 ms.
[2025-06-01 11:07:47] [INFO ] Added : 0 causal constraints over 0 iterations in 147 ms. Result :sat
Minimization took 1206 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:07:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:48] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:07:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:07:48] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-06-01 11:07:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 500 ms returned sat
[2025-06-01 11:07:49] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 74 ms.
[2025-06-01 11:07:49] [INFO ] Added : 2 causal constraints over 1 iterations in 202 ms. Result :sat
Minimization took 1274 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Real]Added 116 Read/Feed constraints in 78 ms returned sat
[2025-06-01 11:07:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:07:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:07:51] [INFO ] [Nat]Added 116 Read/Feed constraints in 215 ms returned sat
[2025-06-01 11:07:51] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 73 ms.
[2025-06-01 11:07:51] [INFO ] Added : 0 causal constraints over 0 iterations in 148 ms. Result :sat
Minimization took 1619 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:07:54] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:07:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-01 11:07:54] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:07:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:07:55] [INFO ] Implicit Places using invariants and state equation in 1121 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:07:55] [INFO ] Redundant transitions in 29 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:07:55] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:07:55] [INFO ] Invariant cache hit.
[2025-06-01 11:07:55] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
(s140 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31002ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31006ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32316 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:08:26] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 2 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 158 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :[1, 1, 1, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 40007 steps (411 resets) in 581 ms. (68 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (79 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (73 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
[2025-06-01 11:08:27] [INFO ] Flatten gal took : 191 ms
[2025-06-01 11:08:27] [INFO ] Flatten gal took : 142 ms
[2025-06-01 11:08:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9264768917657211279.gal : 41 ms
[2025-06-01 11:08:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18420324063434777561.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9264768917657211279.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18420324063434777561.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18420324063434777561.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2693 after 23309
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :23309 after 104643
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :104643 after 773786
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :773786 after 2.79714e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.79714e+06 after 6.83754e+06
Interrupted probabilistic random walk after 219270 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 4
Probabilistic random walk after 219270 steps, saw 151550 distinct states, run finished after 3004 ms. (steps per millisecond=72 ) properties seen :0
[2025-06-01 11:08:30] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:08:30] [INFO ] Invariant cache hit.
[2025-06-01 11:08:30] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1233 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/1247 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 73/1320 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 77/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1233 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1233 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.83754e+06 after 1.49089e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14/1247 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1247 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 73/1320 variables, 66/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 77/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1320 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2878ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 572 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1720/1720 transitions.
RANDOM walk for 40010 steps (399 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (74 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (78 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (73 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (73 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 237802 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 237802 steps, saw 163955 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2025-06-01 11:08:37] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:08:37] [INFO ] Invariant cache hit.
[2025-06-01 11:08:37] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1233 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1233 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 14/1247 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1247 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 73/1320 variables, 66/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 77/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 4 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 211/215 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1018/1233 variables, 72/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1233 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1233 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 14/1247 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1247 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1247 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 73/1320 variables, 66/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 77/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1320 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 265 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2847ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 524 ms.
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:08:40] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-01 11:08:40] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:08:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:08:40] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:08:41] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:08:41] [INFO ] Redundant transitions in 34 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:08:41] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:08:41] [INFO ] Invariant cache hit.
[2025-06-01 11:08:41] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.49089e+07 after 3.10453e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31051ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31057ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32414 ms. Remains : 143/143 places, 1720/1720 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 143 transition count 1177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 543 place count 143 transition count 1167
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 563 place count 133 transition count 1167
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 567 place count 131 transition count 1165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 568 place count 130 transition count 1133
Iterating global reduction 1 with 1 rules applied. Total rules applied 569 place count 130 transition count 1133
Applied a total of 569 rules in 63 ms. Remains 130 /143 variables (removed 13) and now considering 1133/1720 (removed 587) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1133 rows 130 cols
[2025-06-01 11:09:12] [INFO ] Computed 2 invariants in 7 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:09:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 11:09:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:09:13] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:09:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:09:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:09:13] [INFO ] After 296ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-06-01 11:09:13] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-01 11:09:13] [INFO ] After 689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-01 11:09:14] [INFO ] Flatten gal took : 65 ms
[2025-06-01 11:09:14] [INFO ] Flatten gal took : 55 ms
[2025-06-01 11:09:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11992854002350549310.gal : 15 ms
[2025-06-01 11:09:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5051704473882977330.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11992854002350549310.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5051704473882977330.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5051704473882977330.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 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3102 after 71786
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :71786 after 173921
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :173921 after 2.4019e+07
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.4019e+07 after 7.82921e+07
Detected timeout of ITS tools.
[2025-06-01 11:09:17] [INFO ] Flatten gal took : 56 ms
[2025-06-01 11:09:17] [INFO ] Applying decomposition
[2025-06-01 11:09:17] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9268879565069722582.txt' '-o' '/tmp/graph9268879565069722582.bin' '-w' '/tmp/graph9268879565069722582.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9268879565069722582.bin' '-l' '-1' '-v' '-w' '/tmp/graph9268879565069722582.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:18] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:18] [INFO ] Removed a total of 4102 redundant transitions.
[2025-06-01 11:09:18] [INFO ] Flatten gal took : 175 ms
[2025-06-01 11:09:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 193 labels/synchronizations in 67 ms.
[2025-06-01 11:09:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2926225035886712244.gal : 15 ms
[2025-06-01 11:09:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8849703890613902650.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2926225035886712244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8849703890613902650.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8849703890613902650.prop.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :7.82921e+07 after 1.8677e+08
Detected timeout of ITS tools.
[2025-06-01 11:09:29] [INFO ] Flatten gal took : 34 ms
[2025-06-01 11:09:29] [INFO ] Applying decomposition
[2025-06-01 11:09:29] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11139802597033675765.txt' '-o' '/tmp/graph11139802597033675765.bin' '-w' '/tmp/graph11139802597033675765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11139802597033675765.bin' '-l' '-1' '-v' '-w' '/tmp/graph11139802597033675765.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:09:29] [INFO ] Decomposing Gal with order
[2025-06-01 11:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:09:29] [INFO ] Removed a total of 2708 redundant transitions.
[2025-06-01 11:09:29] [INFO ] Flatten gal took : 74 ms
[2025-06-01 11:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 156 labels/synchronizations in 25 ms.
[2025-06-01 11:09:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7209125455810886960.gal : 6 ms
[2025-06-01 11:09:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4570948506010802549.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7209125455810886960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4570948506010802549.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4570948506010802549.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :6 after 16
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :16 after 456
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :456 after 16016
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :16016 after 58058
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :58058 after 407979
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :407979 after 1.07851e+06
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.07851e+06 after 2.31917e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :2.31917e+06 after 6.83783e+06
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :6.83783e+06 after 1.86538e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.86538e+07 after 5.3063e+07
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :5.3063e+07 after 1.74445e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31600 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3, 5, 3] Max Struct:[+inf, +inf, +inf, +inf]
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:09:44] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-06-01 11:09:44] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (103 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:09:44] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:09:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:09:44] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:09:44] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2025-06-01 11:09:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:09:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:09:44] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:09:44] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-06-01 11:09:44] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:09:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 95 ms returned sat
[2025-06-01 11:09:45] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 163 ms.
[2025-06-01 11:09:45] [INFO ] Added : 2 causal constraints over 2 iterations in 333 ms. Result :sat
Minimization took 543 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 28 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:09:46] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:09:46] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10209 resets) in 1264 ms. (790 steps per ms)
BEST_FIRST walk for 1000001 steps (1956 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 11:09:48] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:09:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:09:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2025-06-01 11:09:48] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-06-01 11:09:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:09:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:09:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:09:48] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2025-06-01 11:09:48] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:09:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 225 ms returned sat
[2025-06-01 11:09:49] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 95 ms.
[2025-06-01 11:09:49] [INFO ] Added : 1 causal constraints over 1 iterations in 314 ms. Result :sat
Minimization took 1442 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:09:51] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:09:51] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-01 11:09:51] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:09:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:09:52] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:09:52] [INFO ] Redundant transitions in 29 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:09:52] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:09:52] [INFO ] Invariant cache hit.
[2025-06-01 11:09:52] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31084ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31088ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32497 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:10:23] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 168 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 11:10:24] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:10:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10224 resets) in 1312 ms. (761 steps per ms)
BEST_FIRST walk for 1000001 steps (1970 resets) in 500 ms. (1996 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 11:10:25] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:10:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:10:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:10:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:10:26] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2025-06-01 11:10:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:10:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:10:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:10:26] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2025-06-01 11:10:26] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:10:26] [INFO ] [Nat]Added 116 Read/Feed constraints in 223 ms returned sat
[2025-06-01 11:10:26] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 83 ms.
[2025-06-01 11:10:26] [INFO ] Added : 1 causal constraints over 1 iterations in 300 ms. Result :sat
Minimization took 1363 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:10:28] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:10:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:28] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-01 11:10:28] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:10:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:10:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:10:29] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1329 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:10:29] [INFO ] Redundant transitions in 27 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:10:29] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:10:29] [INFO ] Invariant cache hit.
[2025-06-01 11:10:29] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 31031ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 31035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32423 ms. Remains : 143/143 places, 1720/1720 transitions.
[2025-06-01 11:11:00] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {19=1, 30=1, 195=1, 197=1, 649=1, 652=1, 699=1, 742=1, 761=1, 763=1, 1079=1, 1080=1, 1128=1, 1170=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1, 30=1, 681=1, 682=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40005 steps (414 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (76 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
[2025-06-01 11:11:01] [INFO ] Flatten gal took : 41 ms
[2025-06-01 11:11:01] [INFO ] Flatten gal took : 41 ms
[2025-06-01 11:11:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9848788473885492293.gal : 10 ms
[2025-06-01 11:11:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9125751123987704955.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9848788473885492293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9125751123987704955.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9125751123987704955.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 23309
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :23309 after 104643
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :104643 after 773786
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :773786 after 2.79714e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.79714e+06 after 6.83754e+06
Interrupted probabilistic random walk after 546585 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 546585 steps, saw 370577 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2025-06-01 11:11:04] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:11:04] [INFO ] Invariant cache hit.
[2025-06-01 11:11:04] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1167/1217 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1235 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1235 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1235 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1320 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1167/1217 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1235 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1235 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1235 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1320 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.83754e+06 after 1.49089e+07
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1320 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 680 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 143/143 places, 1720/1720 transitions.
RANDOM walk for 40001 steps (410 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (76 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 549380 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 549380 steps, saw 372447 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2025-06-01 11:11:08] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:11:08] [INFO ] Invariant cache hit.
[2025-06-01 11:11:08] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1167/1217 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 18/1235 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1235 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1235 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/1320 variables, 75/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 82/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1320 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1167/1217 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/1235 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1235 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1235 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/1320 variables, 75/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 82/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1320 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 983ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 22 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 143/143 places, 1720/1720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
[2025-06-01 11:11:09] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:09] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-01 11:11:09] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:11:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:11:10] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:11:11] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:11:11] [INFO ] Redundant transitions in 27 ms returned []
Running 1718 sub problems to find dead transitions.
[2025-06-01 11:11:11] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:11:11] [INFO ] Invariant cache hit.
[2025-06-01 11:11:11] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.49089e+07 after 3.10453e+07
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1177/1320 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1718 unsolved
SMT process timed out in 30962ms, After SMT, problems are : Problem set: 0 solved, 1718 unsolved
Search for dead transitions found 0 dead transitions in 30967ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32332 ms. Remains : 143/143 places, 1720/1720 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 543 transitions
Reduce isomorphic transitions removed 543 transitions.
Iterating post reduction 0 with 543 rules applied. Total rules applied 543 place count 143 transition count 1177
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 543 place count 143 transition count 1167
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 563 place count 133 transition count 1167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 569 place count 130 transition count 1164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 570 place count 129 transition count 1132
Iterating global reduction 1 with 1 rules applied. Total rules applied 571 place count 129 transition count 1132
Applied a total of 571 rules in 38 ms. Remains 129 /143 variables (removed 14) and now considering 1132/1720 (removed 588) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1132 rows 129 cols
[2025-06-01 11:11:42] [INFO ] Computed 2 invariants in 13 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:11:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 11:11:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:11:42] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:11:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:11:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:11:42] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 11:11:42] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:11:42] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:11:42] [INFO ] Flatten gal took : 28 ms
[2025-06-01 11:11:42] [INFO ] Flatten gal took : 29 ms
[2025-06-01 11:11:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16149884770895216600.gal : 13 ms
[2025-06-01 11:11:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5905173606591014400.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16149884770895216600.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5905173606591014400.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5905173606591014400.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 71786
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :71786 after 173921
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :173921 after 2.4019e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.4019e+07 after 7.82921e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :7.82921e+07 after 1.8677e+08
Detected timeout of ITS tools.
[2025-06-01 11:11:51] [INFO ] Flatten gal took : 38 ms
[2025-06-01 11:11:51] [INFO ] Applying decomposition
[2025-06-01 11:11:51] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13078472163197219832.txt' '-o' '/tmp/graph13078472163197219832.bin' '-w' '/tmp/graph13078472163197219832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13078472163197219832.bin' '-l' '-1' '-v' '-w' '/tmp/graph13078472163197219832.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:11:51] [INFO ] Decomposing Gal with order
[2025-06-01 11:11:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:11:51] [INFO ] Removed a total of 4102 redundant transitions.
[2025-06-01 11:11:52] [INFO ] Flatten gal took : 72 ms
[2025-06-01 11:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 40 ms.
[2025-06-01 11:11:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8126913270703570934.gal : 6 ms
[2025-06-01 11:11:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2403793570012917462.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8126913270703570934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2403793570012917462.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2403793570012917462.prop.
Detected timeout of ITS tools.
[2025-06-01 11:11:57] [INFO ] Flatten gal took : 27 ms
[2025-06-01 11:11:57] [INFO ] Applying decomposition
[2025-06-01 11:11:57] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11151564910512037957.txt' '-o' '/tmp/graph11151564910512037957.bin' '-w' '/tmp/graph11151564910512037957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11151564910512037957.bin' '-l' '-1' '-v' '-w' '/tmp/graph11151564910512037957.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:11:57] [INFO ] Decomposing Gal with order
[2025-06-01 11:11:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:11:57] [INFO ] Removed a total of 2739 redundant transitions.
[2025-06-01 11:11:57] [INFO ] Flatten gal took : 54 ms
[2025-06-01 11:11:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 16 ms.
[2025-06-01 11:11:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6964886608682974207.gal : 5 ms
[2025-06-01 11:11:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12288485073283997475.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6964886608682974207.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12288485073283997475.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12288485073283997475.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 588
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :588 after 24024
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24024 after 310845
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31028 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[4] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-01 in 148537 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:12:13] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-06-01 11:12:13] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10007 steps (104 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:12:13] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:12:13] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:12:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:12:13] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2025-06-01 11:12:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:12:13] [INFO ] [Real]Added 116 Read/Feed constraints in 49 ms returned sat
[2025-06-01 11:12:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:12:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-06-01 11:12:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:12:13] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2025-06-01 11:12:13] [INFO ] [Nat]Added 116 Read/Feed constraints in 169 ms returned sat
[2025-06-01 11:12:13] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 81 ms.
[2025-06-01 11:12:13] [INFO ] Added : 0 causal constraints over 0 iterations in 162 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1704
Applied a total of 16 rules in 29 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1720 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 143/143 places, 1704/1720 transitions.
[2025-06-01 11:12:14] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 710=1, 711=1, 1137=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 680=1, 681=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 157 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-01 11:12:15] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2025-06-01 11:12:15] [INFO ] Computed 3 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (10148 resets) in 1291 ms. (773 steps per ms)
BEST_FIRST walk for 1000001 steps (1938 resets) in 500 ms. (1996 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:12:17] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:12:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:12:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:12:17] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2025-06-01 11:12:17] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:12:17] [INFO ] [Real]Added 116 Read/Feed constraints in 78 ms returned sat
[2025-06-01 11:12:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:12:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:12:17] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2025-06-01 11:12:17] [INFO ] [Nat]Added 116 Read/Feed constraints in 202 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:12:17] [INFO ] Deduced a trap composed of 54 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:12:18] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 28 ms to minimize.
[2025-06-01 11:12:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2025-06-01 11:12:18] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 79 ms.
[2025-06-01 11:12:18] [INFO ] Added : 0 causal constraints over 0 iterations in 158 ms. Result :sat
Minimization took 1373 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-01 11:12:19] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:12:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:20] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-06-01 11:12:20] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:20] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:12:21] [INFO ] Implicit Places using invariants and state equation in 892 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:12:21] [INFO ] Redundant transitions in 29 ms returned []
Running 1702 sub problems to find dead transitions.
[2025-06-01 11:12:21] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:12:21] [INFO ] Invariant cache hit.
[2025-06-01 11:12:21] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:12:33] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 4 ms to minimize.
Problem TDEAD1096 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:12:33] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 6 ms to minimize.
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/148 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
SMT process timed out in 30981ms, After SMT, problems are : Problem set: 168 solved, 1534 unsolved
Search for dead transitions found 168 dead transitions in 30984ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) removed 168 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1704 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:12:52] [INFO ] Redundant transitions in 19 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32216 ms. Remains : 143/143 places, 1536/1704 transitions.
[2025-06-01 11:12:52] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 158 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:12:52] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-06-01 11:12:52] [INFO ] Computed 3 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10123 resets) in 1138 ms. (877 steps per ms)
BEST_FIRST walk for 1000001 steps (1964 resets) in 475 ms. (2100 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:12:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:12:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:12:54] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-06-01 11:12:54] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:12:54] [INFO ] [Real]Added 112 Read/Feed constraints in 179 ms returned sat
[2025-06-01 11:12:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:12:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:12:54] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-01 11:12:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 82 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:12:55] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 24 ms to minimize.
[2025-06-01 11:12:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2025-06-01 11:12:55] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 63 ms.
[2025-06-01 11:12:55] [INFO ] Added : 0 causal constraints over 0 iterations in 131 ms. Result :sat
Minimization took 796 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 20 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:12:56] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:56] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-06-01 11:12:56] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:12:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:12:57] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:12:57] [INFO ] Redundant transitions in 26 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:12:57] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:12:57] [INFO ] Invariant cache hit.
[2025-06-01 11:12:57] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60893ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 60896ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62156 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-06-01 11:13:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 162 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:13:58] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:13:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000005 steps (10154 resets) in 1128 ms. (885 steps per ms)
BEST_FIRST walk for 1000001 steps (1971 resets) in 459 ms. (2173 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:14:00] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:14:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:14:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:14:00] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-01 11:14:00] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:14:00] [INFO ] [Real]Added 112 Read/Feed constraints in 182 ms returned sat
[2025-06-01 11:14:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:14:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:14:01] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-01 11:14:01] [INFO ] [Nat]Added 112 Read/Feed constraints in 83 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:14:01] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 23 ms to minimize.
[2025-06-01 11:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2025-06-01 11:14:01] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 64 ms.
[2025-06-01 11:14:01] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 802 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:14:02] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:14:02] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-01 11:14:02] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:14:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:14:02] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:14:03] [INFO ] Implicit Places using invariants and state equation in 988 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:14:03] [INFO ] Redundant transitions in 23 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:14:03] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:14:03] [INFO ] Invariant cache hit.
[2025-06-01 11:14:03] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60967ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 60969ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62228 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-06-01 11:15:04] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:15:05] [INFO ] Flatten gal took : 32 ms
RANDOM walk for 40020 steps (400 resets) in 104 ms. (381 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2025-06-01 11:15:05] [INFO ] Flatten gal took : 32 ms
[2025-06-01 11:15:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15497114257501747768.gal : 6 ms
[2025-06-01 11:15:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5247017962764852064.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15497114257501747768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5247017962764852064.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5247017962764852064.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 593452 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 593452 steps, saw 401940 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2025-06-01 11:15:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:15:08] [INFO ] Invariant cache hit.
[2025-06-01 11:15:08] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:15:09] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:15:09] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40004 steps (395 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (74 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 608756 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 608756 steps, saw 412183 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2025-06-01 11:15:12] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:15:12] [INFO ] Invariant cache hit.
[2025-06-01 11:15:12] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 266 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1032/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:15:13] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:15:13] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:15:14] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:14] [INFO ] Implicit Places using invariants in 298 ms returned []
[2025-06-01 11:15:14] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:15:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:15:15] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:15:15] [INFO ] Redundant transitions in 18 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:15:15] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:15:15] [INFO ] Invariant cache hit.
[2025-06-01 11:15:15] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:15:55] [INFO ] Flatten gal took : 35 ms
[2025-06-01 11:15:55] [INFO ] Applying decomposition
[2025-06-01 11:15:55] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph467299087673821335.txt' '-o' '/tmp/graph467299087673821335.bin' '-w' '/tmp/graph467299087673821335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph467299087673821335.bin' '-l' '-1' '-v' '-w' '/tmp/graph467299087673821335.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:15:55] [INFO ] Decomposing Gal with order
[2025-06-01 11:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:15:55] [INFO ] Removed a total of 3594 redundant transitions.
[2025-06-01 11:15:55] [INFO ] Flatten gal took : 60 ms
[2025-06-01 11:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 181 labels/synchronizations in 39 ms.
[2025-06-01 11:15:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5458657126022665415.gal : 5 ms
[2025-06-01 11:15:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6467090739336743277.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5458657126022665415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6467090739336743277.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6467090739336743277.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61092ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62437 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 541 place count 130 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 129 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 129 transition count 976
Applied a total of 543 rules in 23 ms. Remains 129 /143 variables (removed 14) and now considering 976/1536 (removed 560) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 976 rows 129 cols
[2025-06-01 11:16:16] [INFO ] Computed 3 invariants in 4 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:16:16] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:16:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:16:16] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 11:16:16] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:16:17] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:16:17] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:16:17] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:16:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11128462747728734117.gal : 4 ms
[2025-06-01 11:16:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12507670884250496797.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11128462747728734117.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12507670884250496797.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality12507670884250496797.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 736
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :736 after 6594
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6594 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 105907
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :105907 after 2.03139e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.03139e+06 after 1.58508e+08
Detected timeout of ITS tools.
[2025-06-01 11:16:32] [INFO ] Flatten gal took : 21 ms
[2025-06-01 11:16:32] [INFO ] Applying decomposition
[2025-06-01 11:16:32] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12944735154221034671.txt' '-o' '/tmp/graph12944735154221034671.bin' '-w' '/tmp/graph12944735154221034671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12944735154221034671.bin' '-l' '-1' '-v' '-w' '/tmp/graph12944735154221034671.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:16:32] [INFO ] Decomposing Gal with order
[2025-06-01 11:16:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:16:32] [INFO ] Removed a total of 2247 redundant transitions.
[2025-06-01 11:16:32] [INFO ] Flatten gal took : 51 ms
[2025-06-01 11:16:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 10 ms.
[2025-06-01 11:16:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5214761018643418261.gal : 4 ms
[2025-06-01 11:16:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15787720328954247749.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5214761018643418261.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15787720328954247749.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15787720328954247749.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 232
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :232 after 2519
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2519 after 7888
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7888 after 7941
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7941 after 1.49813e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.49813e+06 after 3.30182e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3.30182e+07 after 3.45281e+07
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30876 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-07 in 274276 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:16:47] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-06-01 11:16:47] [INFO ] Computed 2 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (100 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:16:47] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:16:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:16:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:16:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:16:47] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2025-06-01 11:16:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:16:47] [INFO ] [Real]Added 116 Read/Feed constraints in 55 ms returned sat
[2025-06-01 11:16:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:16:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:16:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-01 11:16:47] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-06-01 11:16:48] [INFO ] [Nat]Added 116 Read/Feed constraints in 259 ms returned sat
[2025-06-01 11:16:48] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 72 ms.
[2025-06-01 11:16:48] [INFO ] Added : 1 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 533 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1704
Applied a total of 16 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1720 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 143/143 places, 1704/1720 transitions.
[2025-06-01 11:16:48] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 710=1, 711=1, 1137=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 680=1, 681=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:16:49] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2025-06-01 11:16:49] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000006 steps (10170 resets) in 1281 ms. (780 steps per ms)
BEST_FIRST walk for 1000001 steps (1945 resets) in 531 ms. (1879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 11:16:51] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:16:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-01 11:16:51] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2025-06-01 11:16:51] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:16:51] [INFO ] [Real]Added 116 Read/Feed constraints in 109 ms returned sat
[2025-06-01 11:16:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:16:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:16:51] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2025-06-01 11:16:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 333 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:16:52] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 15 ms to minimize.
[2025-06-01 11:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2025-06-01 11:16:52] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 88 ms.
[2025-06-01 11:16:52] [INFO ] Added : 1 causal constraints over 1 iterations in 201 ms. Result :sat
Minimization took 1816 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 18 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-01 11:16:54] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:16:54] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-01 11:16:54] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:16:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:16:55] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1093 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:16:55] [INFO ] Redundant transitions in 28 ms returned []
Running 1702 sub problems to find dead transitions.
[2025-06-01 11:16:55] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:16:55] [INFO ] Invariant cache hit.
[2025-06-01 11:16:55] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:17:08] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 5 ms to minimize.
Problem TDEAD1096 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:17:08] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 5 ms to minimize.
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/148 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
SMT process timed out in 31191ms, After SMT, problems are : Problem set: 168 solved, 1534 unsolved
Search for dead transitions found 168 dead transitions in 31193ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) removed 168 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1704 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:17:26] [INFO ] Redundant transitions in 21 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32386 ms. Remains : 143/143 places, 1536/1704 transitions.
[2025-06-01 11:17:26] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 152 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
[2025-06-01 11:17:27] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-06-01 11:17:27] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10181 resets) in 1213 ms. (823 steps per ms)
BEST_FIRST walk for 1000001 steps (1909 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2025-06-01 11:17:29] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:17:29] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:17:29] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-06-01 11:17:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:17:29] [INFO ] [Real]Added 112 Read/Feed constraints in 161 ms returned sat
[2025-06-01 11:17:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:17:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:17:29] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2025-06-01 11:17:29] [INFO ] [Nat]Added 112 Read/Feed constraints in 156 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:17:30] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 14 ms to minimize.
[2025-06-01 11:17:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-06-01 11:17:30] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 78 ms.
[2025-06-01 11:17:30] [INFO ] Added : 1 causal constraints over 1 iterations in 205 ms. Result :sat
Minimization took 1117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 27 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:17:31] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:17:31] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-06-01 11:17:31] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:17:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:17:32] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:17:32] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:17:32] [INFO ] Redundant transitions in 25 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:17:32] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:17:32] [INFO ] Invariant cache hit.
[2025-06-01 11:17:32] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61090ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61093ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62390 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-06-01 11:18:33] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 156 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
[2025-06-01 11:18:34] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:18:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10138 resets) in 1129 ms. (884 steps per ms)
BEST_FIRST walk for 1000001 steps (1892 resets) in 506 ms. (1972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6] Max Struct:[+inf]
[2025-06-01 11:18:36] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:18:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:18:36] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-06-01 11:18:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:18:36] [INFO ] [Real]Added 112 Read/Feed constraints in 167 ms returned sat
[2025-06-01 11:18:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:18:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:18:36] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2025-06-01 11:18:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 157 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:18:37] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 14 ms to minimize.
[2025-06-01 11:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2025-06-01 11:18:37] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 76 ms.
[2025-06-01 11:18:37] [INFO ] Added : 1 causal constraints over 1 iterations in 207 ms. Result :sat
Minimization took 1120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:18:38] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:18:38] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-06-01 11:18:38] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:18:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:18:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:18:39] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:18:39] [INFO ] Redundant transitions in 20 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:18:39] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:18:39] [INFO ] Invariant cache hit.
[2025-06-01 11:18:39] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61058ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62351 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-06-01 11:19:40] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 155 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[6] Max Struct:[+inf]
RANDOM walk for 40003 steps (399 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (78 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2025-06-01 11:19:41] [INFO ] Flatten gal took : 78 ms
[2025-06-01 11:19:41] [INFO ] Flatten gal took : 37 ms
[2025-06-01 11:19:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality350553770339662424.gal : 10 ms
[2025-06-01 11:19:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11720953299108856619.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality350553770339662424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11720953299108856619.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality11720953299108856619.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 591023 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 591023 steps, saw 400314 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2025-06-01 11:19:44] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:19:44] [INFO ] Invariant cache hit.
[2025-06-01 11:19:44] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 77/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 77/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:19:45] [INFO ] Deduced a trap along path composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1126ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 19 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40010 steps (400 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (77 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 592345 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 592345 steps, saw 401199 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2025-06-01 11:19:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:19:48] [INFO ] Invariant cache hit.
[2025-06-01 11:19:48] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1116 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1116 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 77/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 65/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1000/1066 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 35/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1116 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1116 variables, 36/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 48/1164 variables, 40/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 77/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:19:49] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1164 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 260 constraints, problems are : Problem set: 0 solved, 1 unsolved in 693 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1095ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 23 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:19:49] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:19:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:19:50] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-01 11:19:50] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:19:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:19:51] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:19:51] [INFO ] Redundant transitions in 22 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:19:51] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:19:51] [INFO ] Invariant cache hit.
[2025-06-01 11:19:51] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:20:31] [INFO ] Flatten gal took : 30 ms
[2025-06-01 11:20:31] [INFO ] Applying decomposition
[2025-06-01 11:20:31] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12250048175910659335.txt' '-o' '/tmp/graph12250048175910659335.bin' '-w' '/tmp/graph12250048175910659335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12250048175910659335.bin' '-l' '-1' '-v' '-w' '/tmp/graph12250048175910659335.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:20:31] [INFO ] Decomposing Gal with order
[2025-06-01 11:20:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:20:31] [INFO ] Removed a total of 3594 redundant transitions.
[2025-06-01 11:20:31] [INFO ] Flatten gal took : 71 ms
[2025-06-01 11:20:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 21 ms.
[2025-06-01 11:20:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1308605388325030805.gal : 4 ms
[2025-06-01 11:20:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3486424169843309030.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1308605388325030805.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3486424169843309030.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality3486424169843309030.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61132ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62410 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 25 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2025-06-01 11:20:52] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:20:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:20:52] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:20:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-01 11:20:52] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 11:20:52] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:20:52] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:20:52] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:20:52] [INFO ] Flatten gal took : 21 ms
[2025-06-01 11:20:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3887556156224916517.gal : 4 ms
[2025-06-01 11:20:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1132521554718259372.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3887556156224916517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1132521554718259372.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1132521554718259372.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 90892
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90892 after 153095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153095 after 305125
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :305125 after 4.70707e+08
Detected timeout of ITS tools.
[2025-06-01 11:21:07] [INFO ] Flatten gal took : 22 ms
[2025-06-01 11:21:07] [INFO ] Applying decomposition
[2025-06-01 11:21:07] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15830801272909912939.txt' '-o' '/tmp/graph15830801272909912939.bin' '-w' '/tmp/graph15830801272909912939.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15830801272909912939.bin' '-l' '-1' '-v' '-w' '/tmp/graph15830801272909912939.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:21:07] [INFO ] Decomposing Gal with order
[2025-06-01 11:21:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:21:07] [INFO ] Removed a total of 2278 redundant transitions.
[2025-06-01 11:21:07] [INFO ] Flatten gal took : 57 ms
[2025-06-01 11:21:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 8 ms.
[2025-06-01 11:21:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15173671718723914075.gal : 5 ms
[2025-06-01 11:21:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5929867146356752105.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15173671718723914075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5929867146356752105.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5929867146356752105.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 784
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :784 after 2600
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2600 after 7868
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7868 after 7927
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7927 after 1.51289e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.51289e+08 after 1.2026e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.2026e+09 after 2.49037e+10
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30828 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[6] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-09 in 275675 ms.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-01 11:21:23] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
// Phase 1: matrix 1177 rows 143 cols
[2025-06-01 11:21:23] [INFO ] Computed 2 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 steps (104 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (15 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:21:23] [INFO ] Flow matrix only has 1177 transitions (discarded 543 similar events)
[2025-06-01 11:21:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:21:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 11:21:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:21:23] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-06-01 11:21:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:21:23] [INFO ] [Real]Added 116 Read/Feed constraints in 69 ms returned sat
[2025-06-01 11:21:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-01 11:21:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-06-01 11:21:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-01 11:21:23] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-06-01 11:21:23] [INFO ] [Nat]Added 116 Read/Feed constraints in 119 ms returned sat
[2025-06-01 11:21:23] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1027 transitions) in 72 ms.
[2025-06-01 11:21:23] [INFO ] Added : 0 causal constraints over 0 iterations in 143 ms. Result :sat
Minimization took 530 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1720/1720 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 143 transition count 1704
Applied a total of 16 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1720 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 143/143 places, 1704/1720 transitions.
[2025-06-01 11:21:24] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {12=2, 18=1, 29=1, 710=1, 711=1, 1137=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 680=1, 681=1, 1108=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 154 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2025-06-01 11:21:25] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
// Phase 1: matrix 1161 rows 143 cols
[2025-06-01 11:21:25] [INFO ] Computed 3 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10138 resets) in 1202 ms. (831 steps per ms)
BEST_FIRST walk for 1000001 steps (1940 resets) in 534 ms. (1869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:21:26] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:21:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:21:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:21:26] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2025-06-01 11:21:27] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:21:27] [INFO ] [Real]Added 116 Read/Feed constraints in 35 ms returned sat
[2025-06-01 11:21:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:21:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:21:27] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2025-06-01 11:21:27] [INFO ] [Nat]Added 116 Read/Feed constraints in 228 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:21:27] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 12 ms to minimize.
[2025-06-01 11:21:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2025-06-01 11:21:27] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 75 ms.
[2025-06-01 11:21:28] [INFO ] Added : 4 causal constraints over 3 iterations in 304 ms. Result :sat
Minimization took 1304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 17 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2025-06-01 11:21:29] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:21:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:21:29] [INFO ] Implicit Places using invariants in 240 ms returned []
[2025-06-01 11:21:29] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:21:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:21:30] [INFO ] State equation strengthened by 116 read => feed constraints.
[2025-06-01 11:21:30] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:21:30] [INFO ] Redundant transitions in 29 ms returned []
Running 1702 sub problems to find dead transitions.
[2025-06-01 11:21:30] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2025-06-01 11:21:30] [INFO ] Invariant cache hit.
[2025-06-01 11:21:30] [INFO ] State equation strengthened by 116 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:21:44] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 5 ms to minimize.
Problem TDEAD1096 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:21:44] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 6 ms to minimize.
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/148 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
SMT process timed out in 31220ms, After SMT, problems are : Problem set: 168 solved, 1534 unsolved
Search for dead transitions found 168 dead transitions in 31222ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) removed 168 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1704 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:22:02] [INFO ] Redundant transitions in 20 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 32483 ms. Remains : 143/143 places, 1536/1704 transitions.
[2025-06-01 11:22:02] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 153 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:22:02] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
// Phase 1: matrix 1021 rows 143 cols
[2025-06-01 11:22:02] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000008 steps (10156 resets) in 1207 ms. (827 steps per ms)
BEST_FIRST walk for 1000000 steps (1949 resets) in 530 ms. (1883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2025-06-01 11:22:04] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:22:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:22:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:22:04] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2025-06-01 11:22:04] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:22:04] [INFO ] [Real]Added 112 Read/Feed constraints in 42 ms returned sat
[2025-06-01 11:22:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-01 11:22:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:22:04] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2025-06-01 11:22:04] [INFO ] [Nat]Added 112 Read/Feed constraints in 90 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:22:05] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 11:22:05] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 24 ms to minimize.
[2025-06-01 11:22:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2025-06-01 11:22:05] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 60 ms.
[2025-06-01 11:22:05] [INFO ] Added : 0 causal constraints over 0 iterations in 128 ms. Result :sat
Minimization took 843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 16 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:22:06] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:22:06] [INFO ] Implicit Places using invariants in 228 ms returned []
[2025-06-01 11:22:06] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:22:06] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:22:07] [INFO ] Implicit Places using invariants and state equation in 957 ms returned []
Implicit Place search using SMT with State Equation took 1186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:22:07] [INFO ] Redundant transitions in 23 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:22:07] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:22:07] [INFO ] Invariant cache hit.
[2025-06-01 11:22:07] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61061ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61063ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62307 ms. Remains : 143/143 places, 1536/1536 transitions.
[2025-06-01 11:23:08] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {18=1, 29=1, 722=1, 723=1, 1011=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 158 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40010 steps (399 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (75 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2025-06-01 11:23:09] [INFO ] Flatten gal took : 70 ms
[2025-06-01 11:23:09] [INFO ] Flatten gal took : 35 ms
[2025-06-01 11:23:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16434485579343799893.gal : 6 ms
[2025-06-01 11:23:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16306890234766427039.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16434485579343799893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16306890234766427039.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality16306890234766427039.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 601107 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 601107 steps, saw 407063 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-01 11:23:12] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:23:12] [INFO ] Invariant cache hit.
[2025-06-01 11:23:12] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 898ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40000 steps (402 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (77 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 601598 steps, run timeout after 3003 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 601598 steps, saw 407393 distinct states, run finished after 3003 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-01 11:23:16] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:23:16] [INFO ] Invariant cache hit.
[2025-06-01 11:23:16] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 49/1113 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 35/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/1164 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 79/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1023/1064 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1064 variables, 33/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1064 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1064 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/1113 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 35/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 51/1164 variables, 41/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 79/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 862ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 14 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2025-06-01 11:23:17] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:23:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:23:17] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-06-01 11:23:17] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:23:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:23:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 11:23:18] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:23:18] [INFO ] Redundant transitions in 22 ms returned []
Running 1534 sub problems to find dead transitions.
[2025-06-01 11:23:18] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2025-06-01 11:23:18] [INFO ] Invariant cache hit.
[2025-06-01 11:23:18] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Detected timeout of ITS tools.
[2025-06-01 11:23:59] [INFO ] Flatten gal took : 31 ms
[2025-06-01 11:23:59] [INFO ] Applying decomposition
[2025-06-01 11:23:59] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12284842967433707267.txt' '-o' '/tmp/graph12284842967433707267.bin' '-w' '/tmp/graph12284842967433707267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12284842967433707267.bin' '-l' '-1' '-v' '-w' '/tmp/graph12284842967433707267.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:23:59] [INFO ] Decomposing Gal with order
[2025-06-01 11:23:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:23:59] [INFO ] Removed a total of 3594 redundant transitions.
[2025-06-01 11:23:59] [INFO ] Flatten gal took : 54 ms
[2025-06-01 11:23:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 19 ms.
[2025-06-01 11:23:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15748059222637489031.gal : 4 ms
[2025-06-01 11:23:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4530983253419484761.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15748059222637489031.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4530983253419484761.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4530983253419484761.prop.
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1164 variables, 1534/1792 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61105ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61107ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62362 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 515 place count 143 transition count 1010
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 537 place count 132 transition count 1010
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 543 place count 129 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 544 place count 128 transition count 975
Iterating global reduction 1 with 1 rules applied. Total rules applied 545 place count 128 transition count 975
Applied a total of 545 rules in 22 ms. Remains 128 /143 variables (removed 15) and now considering 975/1536 (removed 561) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 975 rows 128 cols
[2025-06-01 11:24:19] [INFO ] Computed 3 invariants in 8 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:24:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:24:19] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-01 11:24:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-01 11:24:19] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 11:24:20] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:24:20] [INFO ] After 296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-01 11:24:20] [INFO ] Flatten gal took : 26 ms
[2025-06-01 11:24:20] [INFO ] Flatten gal took : 30 ms
[2025-06-01 11:24:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4983542970966900216.gal : 6 ms
[2025-06-01 11:24:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12227665687288645455.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4983542970966900216.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12227665687288645455.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12227665687288645455.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 90892
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :90892 after 153095
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :153095 after 305125
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :305125 after 4.70707e+08
Detected timeout of ITS tools.
[2025-06-01 11:24:35] [INFO ] Flatten gal took : 27 ms
[2025-06-01 11:24:35] [INFO ] Applying decomposition
[2025-06-01 11:24:35] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8275719722534728381.txt' '-o' '/tmp/graph8275719722534728381.bin' '-w' '/tmp/graph8275719722534728381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8275719722534728381.bin' '-l' '-1' '-v' '-w' '/tmp/graph8275719722534728381.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:24:35] [INFO ] Decomposing Gal with order
[2025-06-01 11:24:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:24:35] [INFO ] Removed a total of 2245 redundant transitions.
[2025-06-01 11:24:35] [INFO ] Flatten gal took : 35 ms
[2025-06-01 11:24:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 12 ms.
[2025-06-01 11:24:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1853207313212949625.gal : 3 ms
[2025-06-01 11:24:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17072583059348088876.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1853207313212949625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17072583059348088876.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17072583059348088876.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 506
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :506 after 6896
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6896 after 16632
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :16632 after 248893
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :248893 after 455955
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :455955 after 1.50064e+06
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30886 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-13 in 207364 ms.
[2025-06-01 11:24:50] [INFO ] Flatten gal took : 33 ms
[2025-06-01 11:24:50] [INFO ] Applying decomposition
[2025-06-01 11:24:50] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17899430996055871407.txt' '-o' '/tmp/graph17899430996055871407.bin' '-w' '/tmp/graph17899430996055871407.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17899430996055871407.bin' '-l' '-1' '-v' '-w' '/tmp/graph17899430996055871407.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:24:50] [INFO ] Decomposing Gal with order
[2025-06-01 11:24:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:24:50] [INFO ] Removed a total of 4102 redundant transitions.
[2025-06-01 11:24:50] [INFO ] Flatten gal took : 56 ms
[2025-06-01 11:24:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 20 ms.
[2025-06-01 11:24:50] [INFO ] Time to serialize gal into /tmp/UpperBounds14786458794970252316.gal : 5 ms
[2025-06-01 11:24:50] [INFO ] Time to serialize properties into /tmp/UpperBounds5666402767223980663.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14786458794970252316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5666402767223980663.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds5666402767223980663.prop.
Detected timeout of ITS tools.
[2025-06-01 11:51:25] [INFO ] Flatten gal took : 34 ms
[2025-06-01 11:51:25] [INFO ] Time to serialize gal into /tmp/UpperBounds16536289429033717303.gal : 6 ms
[2025-06-01 11:51:25] [INFO ] Time to serialize properties into /tmp/UpperBounds1137753839714993288.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16536289429033717303.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1137753839714993288.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds1137753839714993288.prop.

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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="DoubleLock-PT-p2s2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p2s2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r072-tall-174860067700557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;