About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05
| 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 | 1 1 1 1 ? 1 ? 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524300309.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 MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524300309
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 16K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K 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 23K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748934318062
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-03 07:05:20] [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-03 07:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 07:05:21] [INFO ] Load time of PNML (sax parser for PT used): 526 ms
[2025-06-03 07:05:21] [INFO ] Transformed 4914 places.
[2025-06-03 07:05:21] [INFO ] Transformed 6913 transitions.
[2025-06-03 07:05:21] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 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, +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, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-03 07:05:21] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2025-06-03 07:05:22] [INFO ] Computed 535 invariants in 674 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 17, 17, 51, 1, 17, 1, 51, 51, 17, 17, 17, 17, 51, 51, 17]
RANDOM walk for 10000 steps (192 resets) in 188 ms. (52 steps per ms)
BEST_FIRST walk for 160010 steps (800 resets) in 794 ms. (201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1] Max Struct:[17, 17, 17, 51, 1, 17, 1, 51, 51, 17, 17, 17, 17, 51, 51, 17]
[2025-06-03 07:05:23] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2025-06-03 07:05:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:24] [INFO ] [Real]Absence check using 48 positive place invariants in 129 ms returned sat
[2025-06-03 07:05:24] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 78 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:25] [INFO ] [Real]Absence check using 48 positive place invariants in 99 ms returned sat
[2025-06-03 07:05:26] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 70 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:27] [INFO ] [Real]Absence check using 48 positive place invariants in 96 ms returned sat
[2025-06-03 07:05:27] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 66 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:28] [INFO ] [Real]Absence check using 48 positive place invariants in 102 ms returned sat
[2025-06-03 07:05:28] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 336 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:29] [INFO ] [Real]Absence check using 48 positive place invariants in 98 ms returned sat
[2025-06-03 07:05:29] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 266 ms returned sat
[2025-06-03 07:05:33] [INFO ] [Real]Absence check using state equation in 3627 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:34] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2025-06-03 07:05:34] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 68 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:35] [INFO ] [Real]Absence check using 48 positive place invariants in 99 ms returned sat
[2025-06-03 07:05:36] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 280 ms returned sat
[2025-06-03 07:05:39] [INFO ] [Real]Absence check using state equation in 3642 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:40] [INFO ] [Real]Absence check using 48 positive place invariants in 95 ms returned sat
[2025-06-03 07:05:41] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 215 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:42] [INFO ] [Real]Absence check using 48 positive place invariants in 97 ms returned sat
[2025-06-03 07:05:42] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 258 ms returned sat
[2025-06-03 07:05:46] [INFO ] [Real]Absence check using state equation in 3686 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:47] [INFO ] [Real]Absence check using 48 positive place invariants in 91 ms returned sat
[2025-06-03 07:05:47] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 63 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:48] [INFO ] [Real]Absence check using 48 positive place invariants in 92 ms returned sat
[2025-06-03 07:05:48] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 86 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:49] [INFO ] [Real]Absence check using 48 positive place invariants in 96 ms returned sat
[2025-06-03 07:05:49] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 68 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:50] [INFO ] [Real]Absence check using 48 positive place invariants in 89 ms returned sat
[2025-06-03 07:05:50] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 66 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:51] [INFO ] [Real]Absence check using 48 positive place invariants in 92 ms returned sat
[2025-06-03 07:05:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 196 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:52] [INFO ] [Real]Absence check using 48 positive place invariants in 90 ms returned sat
[2025-06-03 07:05:52] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 114 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:05:53] [INFO ] [Real]Absence check using 48 positive place invariants in 90 ms returned sat
[2025-06-03 07:05:53] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 64 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 51, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 51]
Support contains 3 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.24 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1359 transitions
Trivial Post-agglo rules discarded 1359 transitions
Performed 1359 trivial Post agglomeration. Transition count delta: 1359
Iterating post reduction 0 with 1359 rules applied. Total rules applied 1360 place count 4884 transition count 5554
Reduce places removed 1359 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1360 rules applied. Total rules applied 2720 place count 3525 transition count 5553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2721 place count 3524 transition count 5553
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2721 place count 3524 transition count 5383
Deduced a syphon composed of 170 places in 20 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3061 place count 3354 transition count 5383
Discarding 1189 places :
Symmetric choice reduction at 3 with 1189 rule applications. Total rules 4250 place count 2165 transition count 4194
Iterating global reduction 3 with 1189 rules applied. Total rules applied 5439 place count 2165 transition count 4194
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 5439 place count 2165 transition count 4185
Deduced a syphon composed of 9 places in 8 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 5457 place count 2156 transition count 4185
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 5694 place count 1919 transition count 3000
Iterating global reduction 3 with 237 rules applied. Total rules applied 5931 place count 1919 transition count 3000
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5965 place count 1902 transition count 2983
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 6126 place count 1902 transition count 3770
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 6287 place count 1741 transition count 3770
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 6304 place count 1741 transition count 3770
Applied a total of 6304 rules in 2928 ms. Remains 1741 /4914 variables (removed 3173) and now considering 3770/6913 (removed 3143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2942 ms. Remains : 1741/4914 places, 3770/6913 transitions.
[2025-06-03 07:05:56] [INFO ] Flow matrix only has 3372 transitions (discarded 398 similar events)
// Phase 1: matrix 3372 rows 1741 cols
[2025-06-03 07:05:56] [INFO ] Computed 505 invariants in 154 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
RANDOM walk for 1000000 steps (31860 resets) in 18944 ms. (52 steps per ms)
BEST_FIRST walk for 3000002 steps (17006 resets) in 12123 ms. (247 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 2]
[2025-06-03 07:06:27] [INFO ] Flow matrix only has 3372 transitions (discarded 398 similar events)
[2025-06-03 07:06:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:06:28] [INFO ] [Real]Absence check using 33 positive place invariants in 48 ms returned sat
[2025-06-03 07:06:28] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 123 ms returned sat
[2025-06-03 07:06:29] [INFO ] [Real]Absence check using state equation in 1675 ms returned sat
[2025-06-03 07:06:30] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:06:31] [INFO ] [Real]Added 1906 Read/Feed constraints in 878 ms returned sat
[2025-06-03 07:06:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:06:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 70 ms returned sat
[2025-06-03 07:06:31] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 190 ms returned sat
[2025-06-03 07:06:33] [INFO ] [Nat]Absence check using state equation in 1663 ms returned sat
[2025-06-03 07:06:36] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2929 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:06:40] [INFO ] Deduced a trap composed of 181 places in 4102 ms of which 667 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:06:44] [INFO ] Deduced a trap composed of 77 places in 3414 ms of which 261 ms to minimize.
[2025-06-03 07:06:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 8065 ms
[2025-06-03 07:06:45] [INFO ] Computed and/alt/rep : 1575/3614/1575 causal constraints (skipped 1780 transitions) in 552 ms.
[2025-06-03 07:06:48] [INFO ] Added : 26 causal constraints over 7 iterations in 3941 ms. Result :sat
Minimization took 6587 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:06:55] [INFO ] [Real]Absence check using 33 positive place invariants in 78 ms returned sat
[2025-06-03 07:06:55] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 223 ms returned sat
[2025-06-03 07:06:57] [INFO ] [Real]Absence check using state equation in 1915 ms returned sat
[2025-06-03 07: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-03 07:06:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 53 ms returned sat
[2025-06-03 07:06:58] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 192 ms returned sat
[2025-06-03 07:07:00] [INFO ] [Nat]Absence check using state equation in 2054 ms returned sat
[2025-06-03 07:07:03] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2888 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:07:05] [INFO ] Deduced a trap composed of 149 places in 2390 ms of which 353 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:07:09] [INFO ] Deduced a trap composed of 79 places in 2969 ms of which 231 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:07:11] [INFO ] Deduced a trap composed of 79 places in 2481 ms of which 234 ms to minimize.
[2025-06-03 07:07:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 8396 ms
[2025-06-03 07:07:12] [INFO ] Computed and/alt/rep : 1575/3614/1575 causal constraints (skipped 1780 transitions) in 1144 ms.
[2025-06-03 07:07:14] [INFO ] Added : 15 causal constraints over 3 iterations in 2418 ms. Result :sat
Minimization took 6539 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:07:21] [INFO ] [Real]Absence check using 33 positive place invariants in 70 ms returned sat
[2025-06-03 07:07:21] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 102 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1741 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1741/1741 places, 3770/3770 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1741 transition count 3769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1740 transition count 3769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 1739 transition count 3768
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 1739 transition count 3768
Applied a total of 4 rules in 585 ms. Remains 1739 /1741 variables (removed 2) and now considering 3768/3770 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 1739/1741 places, 3768/3770 transitions.
[2025-06-03 07:07:21] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2025-06-03 07:07:21] [INFO ] Computed 505 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31862 resets) in 18590 ms. (53 steps per ms)
BEST_FIRST walk for 2000002 steps (11339 resets) in 8269 ms. (241 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-03 07:07:48] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2025-06-03 07:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:07:49] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2025-06-03 07:07:49] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 135 ms returned sat
[2025-06-03 07:07:50] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2025-06-03 07:07:50] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:07:51] [INFO ] [Real]Added 1906 Read/Feed constraints in 619 ms returned sat
[2025-06-03 07: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-03 07:07:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2025-06-03 07:07:52] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 132 ms returned sat
[2025-06-03 07:07:53] [INFO ] [Nat]Absence check using state equation in 1484 ms returned sat
[2025-06-03 07:07:56] [INFO ] [Nat]Added 1906 Read/Feed constraints in 3328 ms returned sat
[2025-06-03 07:07:57] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 291 ms.
[2025-06-03 07:07:59] [INFO ] Added : 17 causal constraints over 4 iterations in 2158 ms. Result :sat
Minimization took 5249 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:08:04] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2025-06-03 07:08:04] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 214 ms returned sat
[2025-06-03 07:08:06] [INFO ] [Real]Absence check using state equation in 1705 ms returned sat
[2025-06-03 07:08:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:08:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-03 07:08:07] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 141 ms returned sat
[2025-06-03 07:08:08] [INFO ] [Nat]Absence check using state equation in 1560 ms returned sat
[2025-06-03 07:08:11] [INFO ] [Nat]Added 1906 Read/Feed constraints in 2530 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:08:13] [INFO ] Deduced a trap composed of 149 places in 2419 ms of which 371 ms to minimize.
[2025-06-03 07:08:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2679 ms
[2025-06-03 07:08:14] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 291 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:08:18] [INFO ] Deduced a trap composed of 77 places in 2880 ms of which 248 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:08:21] [INFO ] Deduced a trap composed of 77 places in 2869 ms of which 263 ms to minimize.
[2025-06-03 07:08:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6365 ms
[2025-06-03 07:08:22] [INFO ] Added : 18 causal constraints over 4 iterations in 8514 ms. Result :sat
Minimization took 5222 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 147 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 1739/1739 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 137 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2025-06-03 07:08:28] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2025-06-03 07:08:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:08:34] [INFO ] Implicit Places using invariants in 6665 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 449, 450, 451, 452, 453, 454, 460, 464, 466, 468, 470, 472, 485, 491, 493, 494, 495, 496, 497, 498, 500, 502, 504, 506, 510, 516, 523, 529, 530, 531, 532, 533, 534, 538, 540, 542, 544, 546, 548, 561, 567, 569, 570, 571, 572, 573, 574, 576, 578, 580, 582, 584, 588, 593, 597, 598, 599, 600, 601, 602, 604, 606, 608, 610, 612, 614, 627, 633, 635, 636, 637, 638, 639, 640, 642, 644, 646, 648, 650, 652, 655, 657, 658, 659, 660, 661, 662, 664, 666, 668, 670, 672, 674, 687, 693, 695, 696, 697, 698, 699, 700, 702, 704, 706, 708, 710, 712, 714, 716, 717, 718, 719, 720, 721, 723, 725, 727, 729, 731, 733, 746, 748, 751, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 781, 783, 785, 787, 789, 791, 804, 810, 812, 813, 814, 815, 816, 817, 819, 821, 823, 825, 827, 829, 831, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 863, 869, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 890, 893, 894, 895, 896, 897, 898, 900, 902, 904, 906, 908, 910, 923, 929, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 952, 957, 958, 959, 960, 961, 962, 966, 968, 970, 972, 974, 976, 989, 995, 997, 998, 999, 1000, 1001, 1002, 1004, 1006, 1008, 1010, 1012, 1016, 1022, 1029, 1030, 1031, 1032, 1033, 1034, 1040, 1044, 1046, 1048, 1050, 1052, 1065, 1071, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1082, 1084, 1086, 1090, 1096, 1104, 1113, 1114, 1115, 1116, 1117, 1118, 1126, 1132, 1136, 1138, 1140, 1142, 1155, 1161, 1163, 1164, 1165, 1166, 1167, 1168, 1170, 1172, 1174, 1178, 1184, 1192, 1202, 1213, 1214, 1215, 1216, 1217, 1218, 1228, 1236, 1242, 1246, 1248, 1250, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1290, 1298, 1308, 1320, 1333, 1334, 1335, 1336, 1337, 1338, 1350, 1360, 1368, 1374, 1378, 1380, 1393, 1395, 1398, 1400, 1401, 1402, 1403, 1404, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1461, 1476, 1477, 1478, 1479, 1480, 1481, 1495, 1507, 1517, 1525, 1531, 1535, 1548]
[2025-06-03 07:08:34] [INFO ] Actually due to overlaps returned [157, 287, 395, 485, 561, 627, 687, 746, 804, 863, 923, 989, 1065, 1155, 1263, 1393, 1548, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 403, 404, 405, 406, 407, 449, 450, 451, 452, 453, 493, 494, 495, 496, 497, 529, 530, 531, 532, 533, 569, 570, 571, 572, 573, 597, 598, 599, 600, 601, 635, 636, 637, 638, 639, 657, 658, 659, 660, 661, 695, 696, 697, 698, 699, 716, 717, 718, 719, 720, 748, 753, 754, 755, 756, 757, 774, 775, 776, 777, 778, 812, 813, 814, 815, 816, 833, 834, 835, 836, 837, 871, 872, 873, 874, 875, 893, 894, 895, 896, 897, 931, 932, 933, 934, 935, 957, 958, 959, 960, 961, 997, 998, 999, 1000, 1001, 1029, 1030, 1031, 1032, 1033, 1073, 1074, 1075, 1076, 1077, 1113, 1114, 1115, 1116, 1117, 1163, 1164, 1165, 1166, 1167, 1213, 1214, 1215, 1216, 1217, 1271, 1272, 1273, 1274, 1275, 1333, 1334, 1335, 1336, 1337, 1395, 1400, 1401, 1402, 1403, 1404, 1476, 1477, 1478, 1479, 1480]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 6680 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1549/1739 places, 3768/3768 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1389 transition count 3608
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1389 transition count 3608
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1229 transition count 3448
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1229 transition count 3448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1229 transition count 3445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1226 transition count 3445
Applied a total of 646 rules in 538 ms. Remains 1226 /1549 variables (removed 323) and now considering 3445/3768 (removed 323) transitions.
[2025-06-03 07:08:35] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 1226 cols
[2025-06-03 07:08:35] [INFO ] Computed 315 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:08:40] [INFO ] Implicit Places using invariants in 5149 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 328, 332, 334, 336, 338, 346, 348, 350, 352, 354, 358, 364, 372, 381, 389, 395, 399, 401, 403, 405, 407, 415, 417, 419, 421, 423, 425, 429, 435, 442, 448, 452, 454, 456, 458, 460, 462, 470, 472, 474, 476, 478, 480, 482, 486, 491, 495, 497, 499, 501, 503, 505, 507, 515, 517, 519, 521, 523, 525, 527, 529, 532, 534, 536, 538, 540, 542, 544, 546, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 665, 667, 669, 671, 673, 675, 677, 679, 681, 684, 686, 688, 690, 692, 694, 696, 704, 706, 708, 710, 712, 714, 716, 718, 722, 727, 731, 733, 735, 737, 739, 741, 749, 751, 753, 755, 757, 759, 761, 765, 771, 778, 784, 788, 790, 792, 794, 796, 804, 806, 808, 810, 812, 814, 818, 824, 832, 841, 849, 855, 859, 861, 863, 865, 873, 875, 877, 879, 881, 885, 891, 899, 909, 920, 930, 938, 944, 948, 950, 952, 960, 962, 964, 966, 970, 976, 984, 994, 1006, 1019, 1031, 1041, 1049, 1055, 1059, 1061, 1067, 1069, 1071, 1075, 1081, 1089, 1099, 1111, 1125, 1140, 1154, 1166, 1176, 1184, 1190, 1194]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 5164 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1739 places, 3445/3768 transitions.
Applied a total of 0 rules in 138 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12675 ms. Remains : 954/1739 places, 3445/3768 transitions.
[2025-06-03 07:08:40] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2025-06-03 07:08:40] [INFO ] Computed 43 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (34081 resets) in 18555 ms. (53 steps per ms)
BEST_FIRST walk for 2000002 steps (8056 resets) in 5717 ms. (349 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-03 07:09:04] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:09:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:09:05] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-03 07:09:05] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-03 07:09:06] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2025-06-03 07:09:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:09:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-03 07:09:06] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2025-06-03 07:09:07] [INFO ] [Nat]Absence check using state equation in 1046 ms returned sat
[2025-06-03 07:09:07] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:09:09] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1547 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:10] [INFO ] Deduced a trap composed of 174 places in 1077 ms of which 196 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:12] [INFO ] Deduced a trap composed of 69 places in 1465 ms of which 106 ms to minimize.
[2025-06-03 07:09:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2890 ms
[2025-06-03 07:09:12] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 297 ms.
[2025-06-03 07:09:15] [INFO ] Added : 23 causal constraints over 7 iterations in 3478 ms. Result :sat
Minimization took 5311 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:09:21] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-03 07:09:21] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:09:22] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2025-06-03 07:09:22] [INFO ] [Real]Added 1906 Read/Feed constraints in 482 ms returned sat
[2025-06-03 07:09:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:09:23] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-03 07:09:23] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:09:24] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2025-06-03 07:09:26] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1808 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:27] [INFO ] Deduced a trap composed of 45 places in 1238 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:28] [INFO ] Deduced a trap composed of 146 places in 1138 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:30] [INFO ] Deduced a trap composed of 51 places in 1214 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:09:31] [INFO ] Deduced a trap composed of 45 places in 1235 ms of which 107 ms to minimize.
[2025-06-03 07:09:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5380 ms
[2025-06-03 07:09:31] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 274 ms.
[2025-06-03 07:09:32] [INFO ] Added : 15 causal constraints over 3 iterations in 1312 ms. Result :sat
Minimization took 5345 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 114 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 108 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2025-06-03 07:09:38] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:09:40] [INFO ] Implicit Places using invariants in 1928 ms returned []
[2025-06-03 07:09:40] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:09:41] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:10:12] [INFO ] Performed 417/954 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 07:10:42] [INFO ] Performed 926/954 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 07:10:49] [INFO ] Implicit Places using invariants and state equation in 69159 ms returned []
Implicit Place search using SMT with State Equation took 71094 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:10:49] [INFO ] Redundant transitions in 353 ms returned []
Running 3383 sub problems to find dead transitions.
[2025-06-03 07:10:50] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:10:50] [INFO ] Invariant cache hit.
[2025-06-03 07:10:50] [INFO ] State equation strengthened by 1906 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
(s582 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 0.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 1.0)
(s417 0.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 0.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 0.0)
(s481 0.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 0.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 1.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 1.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 35859ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 35946ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107561 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1360 resets) in 3016 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 350 ms. (113 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (159 resets) in 355 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (159 resets) in 357 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 505 ms. (79 steps per ms) remains 4/4 properties
[2025-06-03 07:11:27] [INFO ] Flatten gal took : 777 ms
[2025-06-03 07:11:27] [INFO ] Flatten gal took : 221 ms
[2025-06-03 07:11:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7134483190416477543.gal : 109 ms
[2025-06-03 07:11:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11608463874694721968.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/ReachabilityCardinality7134483190416477543.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11608463874694721968.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/ReachabilityCardinality11608463874694721968.prop.
Interrupted probabilistic random walk after 48643 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 4
Probabilistic random walk after 48643 steps, saw 20380 distinct states, run finished after 3006 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-03 07:11:30] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:11:30] [INFO ] Invariant cache hit.
[2025-06-03 07:11:30] [INFO ] State equation strengthened by 1906 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:32] [INFO ] Deduced a trap composed of 85 places in 1202 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :37 after 72
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :72 after 74
[2025-06-03 07:11:33] [INFO ] Deduced a trap composed of 85 places in 982 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :148 after 151
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :151 after 282
[2025-06-03 07:11:34] [INFO ] Deduced a trap composed of 68 places in 1023 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :282 after 430
[2025-06-03 07:11:35] [INFO ] Deduced a trap composed of 69 places in 1250 ms of which 80 ms to minimize.
SMT process timed out in 5471ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 116 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 954/954 places, 3445/3445 transitions.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :430 after 696
RANDOM walk for 40000 steps (1360 resets) in 1672 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (158 resets) in 226 ms. (176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (158 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (160 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :696 after 1208
Interrupted probabilistic random walk after 52370 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 4
Probabilistic random walk after 52370 steps, saw 21921 distinct states, run finished after 3001 ms. (steps per millisecond=17 ) properties seen :0
[2025-06-03 07:11:39] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:11:39] [INFO ] Invariant cache hit.
[2025-06-03 07:11:39] [INFO ] State equation strengthened by 1906 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:41] [INFO ] Deduced a trap composed of 85 places in 1243 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:42] [INFO ] Deduced a trap composed of 85 places in 1227 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:43] [INFO ] Deduced a trap composed of 68 places in 1215 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1208 after 2256
[2025-06-03 07:11:45] [INFO ] Deduced a trap composed of 69 places in 1301 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:46] [INFO ] Deduced a trap composed of 99 places in 1182 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:47] [INFO ] Deduced a trap composed of 68 places in 1209 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:48] [INFO ] Deduced a trap composed of 99 places in 1115 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:50] [INFO ] Deduced a trap composed of 68 places in 1041 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:51] [INFO ] Deduced a trap composed of 139 places in 1138 ms of which 173 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3047/4001 variables, 954/1006 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4001 variables, 1906/2912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4001 variables, 0/2912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/4001 variables, 0/2912 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 2912 constraints, problems are : Problem set: 0 solved, 4 unsolved in 15658 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 954/954 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:56] [INFO ] Deduced a trap composed of 117 places in 1015 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:57] [INFO ] Deduced a trap composed of 117 places in 986 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2256 after 5133
[2025-06-03 07:11:58] [INFO ] Deduced a trap composed of 165 places in 1108 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:11:59] [INFO ] Deduced a trap composed of 69 places in 987 ms of which 97 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/916 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:01] [INFO ] Deduced a trap composed of 5 places in 1154 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:02] [INFO ] Deduced a trap composed of 27 places in 983 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:03] [INFO ] Deduced a trap composed of 46 places in 895 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:04] [INFO ] Deduced a trap composed of 46 places in 1061 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:05] [INFO ] Deduced a trap composed of 71 places in 1010 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:06] [INFO ] Deduced a trap composed of 62 places in 1054 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:07] [INFO ] Deduced a trap composed of 62 places in 1128 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:08] [INFO ] Deduced a trap composed of 75 places in 1162 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:10] [INFO ] Deduced a trap composed of 75 places in 1149 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:11] [INFO ] Deduced a trap composed of 85 places in 1022 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:12] [INFO ] Deduced a trap composed of 85 places in 1081 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:13] [INFO ] Deduced a trap composed of 92 places in 1145 ms of which 139 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:14] [INFO ] Deduced a trap composed of 94 places in 1099 ms of which 146 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:15] [INFO ] Deduced a trap composed of 92 places in 1148 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:16] [INFO ] Deduced a trap composed of 94 places in 1072 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:18] [INFO ] Deduced a trap composed of 27 places in 1089 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 07:12:18] [INFO ] Flatten gal took : 162 ms
[2025-06-03 07:12:18] [INFO ] Applying decomposition
[2025-06-03 07:12:18] [INFO ] Flatten gal took : 154 ms
[2025-06-03 07:12:19] [INFO ] Deduced a trap composed of 57 places in 1059 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 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/graph3341779101314511926.txt' '-o' '/tmp/graph3341779101314511926.bin' '-w' '/tmp/graph3341779101314511926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3341779101314511926.bin' '-l' '-1' '-v' '-w' '/tmp/graph3341779101314511926.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:12:19] [INFO ] Decomposing Gal with order
[2025-06-03 07:12:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:12:20] [INFO ] Deduced a trap composed of 46 places in 1167 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:20] [INFO ] Removed a total of 5811 redundant transitions.
[2025-06-03 07:12:21] [INFO ] Flatten gal took : 1420 ms
[2025-06-03 07:12:21] [INFO ] Deduced a trap composed of 88 places in 1078 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 3049 labels/synchronizations in 337 ms.
[2025-06-03 07:12:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9671030916973126989.gal : 50 ms
[2025-06-03 07:12:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16437005471629129986.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/ReachabilityCardinality9671030916973126989.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16437005471629129986.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
[2025-06-03 07:12:22] [INFO ] Deduced a trap composed of 75 places in 973 ms of which 161 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality16437005471629129986.prop.
[2025-06-03 07:12:23] [INFO ] Deduced a trap composed of 90 places in 1033 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:24] [INFO ] Deduced a trap composed of 85 places in 1182 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:25] [INFO ] Deduced a trap composed of 106 places in 1204 ms of which 161 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:27] [INFO ] Deduced a trap composed of 95 places in 1124 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:28] [INFO ] Deduced a trap composed of 85 places in 1126 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:29] [INFO ] Deduced a trap composed of 97 places in 1113 ms of which 152 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:30] [INFO ] Deduced a trap composed of 101 places in 1123 ms of which 157 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:31] [INFO ] Deduced a trap composed of 101 places in 1108 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:33] [INFO ] Deduced a trap composed of 103 places in 1208 ms of which 160 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:34] [INFO ] Deduced a trap composed of 92 places in 1811 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:36] [INFO ] Deduced a trap composed of 94 places in 1069 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:37] [INFO ] Deduced a trap composed of 92 places in 1080 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:38] [INFO ] Deduced a trap composed of 94 places in 1043 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:39] [INFO ] Deduced a trap composed of 94 places in 1081 ms of which 140 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:12:41] [INFO ] Deduced a trap composed of 94 places in 1752 ms of which 144 ms to minimize.
SMT process timed out in 61455ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 171 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 173 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2025-06-03 07:12:41] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:12:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:12:43] [INFO ] Implicit Places using invariants in 1881 ms returned []
[2025-06-03 07:12:43] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:12:44] [INFO ] State equation strengthened by 1906 read => feed constraints.
Detected timeout of ITS tools.
[2025-06-03 07:13:15] [INFO ] Performed 408/954 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 07:13:45] [INFO ] Performed 831/954 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 07:13:55] [INFO ] Implicit Places using invariants and state equation in 72421 ms returned []
Implicit Place search using SMT with State Equation took 74303 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:13:56] [INFO ] Redundant transitions in 242 ms returned []
Running 3383 sub problems to find dead transitions.
[2025-06-03 07:13:56] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:13:56] [INFO ] Invariant cache hit.
[2025-06-03 07:13:56] [INFO ] State equation strengthened by 1906 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 34689ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 34712ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109477 ms. Remains : 954/954 places, 3445/3445 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:14:30] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:14:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (340 resets) in 313 ms. (31 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 46 ms. (212 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:14:31] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:14:31] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2025-06-03 07:14:31] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2025-06-03 07:14:32] [INFO ] [Real]Absence check using state equation in 1332 ms returned sat
[2025-06-03 07:14:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:14:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-03 07:14:33] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 7 ms returned sat
[2025-06-03 07:14:34] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2025-06-03 07:14:34] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:14:35] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 07:14:35] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1165 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 160 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 952/954 places, 3439/3443 transitions.
[2025-06-03 07:14:35] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2025-06-03 07:14:35] [INFO ] Computed 43 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34072 resets) in 18160 ms. (55 steps per ms)
BEST_FIRST walk for 1000001 steps (4026 resets) in 2771 ms. (360 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:14:56] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:14:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:14:57] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-03 07:14:57] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:14:58] [INFO ] [Real]Absence check using state equation in 1249 ms returned sat
[2025-06-03 07:14:58] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-03 07:14:59] [INFO ] [Real]Added 1903 Read/Feed constraints in 685 ms returned sat
[2025-06-03 07:14:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:14:59] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2025-06-03 07:14:59] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 8 ms returned sat
[2025-06-03 07:15:00] [INFO ] [Nat]Absence check using state equation in 1249 ms returned sat
[2025-06-03 07:15:02] [INFO ] [Nat]Added 1903 Read/Feed constraints in 1766 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:15:03] [INFO ] Deduced a trap composed of 45 places in 1261 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:15:05] [INFO ] Deduced a trap composed of 174 places in 1130 ms of which 203 ms to minimize.
[2025-06-03 07:15:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2729 ms
[2025-06-03 07:15:05] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 315 ms.
[2025-06-03 07:15:09] [INFO ] Added : 30 causal constraints over 11 iterations in 4125 ms. Result :sat
Minimization took 5017 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 196 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 157 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-03 07:15:14] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:15:17] [INFO ] Implicit Places using invariants in 2492 ms returned []
[2025-06-03 07:15:17] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:15:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:15:18] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-03 07:15:48] [INFO ] Performed 514/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 07:16:18] [INFO ] Implicit Places using invariants and state equation in 61655 ms returned []
Implicit Place search using SMT with State Equation took 64152 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:16:18] [INFO ] Redundant transitions in 183 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-03 07:16:18] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:16:18] [INFO ] Invariant cache hit.
[2025-06-03 07:16:19] [INFO ] State equation strengthened by 1903 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 34215ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 34228ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98734 ms. Remains : 952/952 places, 3439/3439 transitions.
[2025-06-03 07:16:53] [INFO ] Flatten gal took : 338 ms
RANDOM walk for 40000 steps (1360 resets) in 1995 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
[2025-06-03 07:16:53] [INFO ] Flatten gal took : 364 ms
BEST_FIRST walk for 40004 steps (158 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2025-06-03 07:16:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8292781214498845452.gal : 40 ms
[2025-06-03 07:16:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality80612949759080324.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/ReachabilityCardinality8292781214498845452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality80612949759080324.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 ...326
Loading property file /tmp/ReachabilityCardinality80612949759080324.prop.
Interrupted probabilistic random walk after 55695 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 55695 steps, saw 23303 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 07:16:56] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:16:57] [INFO ] Invariant cache hit.
[2025-06-03 07:16:57] [INFO ] State equation strengthened by 1903 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:16:58] [INFO ] Deduced a trap composed of 69 places in 1061 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 71
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :71 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
[2025-06-03 07:16:59] [INFO ] Deduced a trap composed of 117 places in 1107 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
[2025-06-03 07:17:00] [INFO ] Deduced a trap composed of 99 places in 1075 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
[2025-06-03 07:17:01] [INFO ] Deduced a trap composed of 165 places in 1219 ms of which 187 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 712
[2025-06-03 07:17:03] [INFO ] Deduced a trap composed of 117 places in 1159 ms of which 141 ms to minimize.
SMT process timed out in 6031ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 104 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1092 ms. (36 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (162 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :712 after 1212
Interrupted probabilistic random walk after 56314 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56314 steps, saw 23563 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 07:17:06] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:17:06] [INFO ] Invariant cache hit.
[2025-06-03 07:17:06] [INFO ] State equation strengthened by 1903 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:07] [INFO ] Deduced a trap composed of 69 places in 1042 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:09] [INFO ] Deduced a trap composed of 117 places in 1136 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:10] [INFO ] Deduced a trap composed of 99 places in 1019 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1212 after 2206
[2025-06-03 07:17:11] [INFO ] Deduced a trap composed of 165 places in 1153 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:12] [INFO ] Deduced a trap composed of 117 places in 1087 ms of which 141 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:13] [INFO ] Deduced a trap composed of 68 places in 1216 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:14] [INFO ] Deduced a trap composed of 68 places in 1154 ms of which 93 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/1002 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2905 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2905 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10579 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:18] [INFO ] Deduced a trap composed of 85 places in 1026 ms of which 95 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:19] [INFO ] Deduced a trap composed of 5 places in 1297 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:21] [INFO ] Deduced a trap composed of 27 places in 1164 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:22] [INFO ] Deduced a trap composed of 46 places in 1205 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:23] [INFO ] Deduced a trap composed of 51 places in 1353 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2206 after 5102
[2025-06-03 07:17:24] [INFO ] Deduced a trap composed of 52 places in 1087 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:25] [INFO ] Deduced a trap composed of 52 places in 1052 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:27] [INFO ] Deduced a trap composed of 52 places in 1061 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:28] [INFO ] Deduced a trap composed of 52 places in 1047 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:29] [INFO ] Deduced a trap composed of 52 places in 1045 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:30] [INFO ] Deduced a trap composed of 46 places in 1032 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:31] [INFO ] Deduced a trap composed of 51 places in 1085 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:32] [INFO ] Deduced a trap composed of 52 places in 979 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:33] [INFO ] Deduced a trap composed of 52 places in 1194 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:34] [INFO ] Deduced a trap composed of 52 places in 1190 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:36] [INFO ] Deduced a trap composed of 51 places in 1258 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:37] [INFO ] Deduced a trap composed of 50 places in 1114 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:38] [INFO ] Deduced a trap composed of 51 places in 1133 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:39] [INFO ] Deduced a trap composed of 62 places in 1041 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:40] [INFO ] Deduced a trap composed of 52 places in 1159 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:41] [INFO ] Deduced a trap composed of 51 places in 1065 ms of which 96 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:42] [INFO ] Deduced a trap composed of 54 places in 1053 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:43] [INFO ] Deduced a trap composed of 46 places in 1124 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 07:17:44] [INFO ] Flatten gal took : 118 ms
[2025-06-03 07:17:44] [INFO ] Applying decomposition
[2025-06-03 07:17:44] [INFO ] Flatten gal took : 128 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/graph11022225817822380083.txt' '-o' '/tmp/graph11022225817822380083.bin' '-w' '/tmp/graph11022225817822380083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11022225817822380083.bin' '-l' '-1' '-v' '-w' '/tmp/graph11022225817822380083.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:17:44] [INFO ] Decomposing Gal with order
[2025-06-03 07:17:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:17:44] [INFO ] Deduced a trap composed of 53 places in 983 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:45] [INFO ] Removed a total of 5807 redundant transitions.
[2025-06-03 07:17:45] [INFO ] Flatten gal took : 606 ms
[2025-06-03 07:17:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2278 labels/synchronizations in 167 ms.
[2025-06-03 07:17:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16723025349809437988.gal : 32 ms
[2025-06-03 07:17:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7275026239036980279.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/ReachabilityCardinality16723025349809437988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7275026239036980279.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
[2025-06-03 07:17:45] [INFO ] Deduced a trap composed of 51 places in 1046 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality7275026239036980279.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :40 after 62
[2025-06-03 07:17:47] [INFO ] Deduced a trap composed of 56 places in 1084 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:48] [INFO ] Deduced a trap composed of 54 places in 1145 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :62 after 271
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :271 after 391
[2025-06-03 07:17:49] [INFO ] Deduced a trap composed of 54 places in 1137 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:50] [INFO ] Deduced a trap composed of 46 places in 1103 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:51] [INFO ] Deduced a trap composed of 58 places in 1069 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:52] [INFO ] Deduced a trap composed of 27 places in 1079 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:53] [INFO ] Deduced a trap composed of 55 places in 1080 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:54] [INFO ] Deduced a trap composed of 52 places in 1064 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:56] [INFO ] Deduced a trap composed of 59 places in 1096 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:57] [INFO ] Deduced a trap composed of 46 places in 1127 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:58] [INFO ] Deduced a trap composed of 53 places in 1062 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:17:59] [INFO ] Deduced a trap composed of 46 places in 1178 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:18:00] [INFO ] Deduced a trap composed of 56 places in 1181 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:18:01] [INFO ] Deduced a trap composed of 45 places in 1214 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:18:03] [INFO ] Deduced a trap composed of 46 places in 1272 ms of which 93 ms to minimize.
SMT process timed out in 56630ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 127 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 105 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-03 07:18:03] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:18:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:18:05] [INFO ] Implicit Places using invariants in 1769 ms returned []
[2025-06-03 07:18:05] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:18:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:18:06] [INFO ] State equation strengthened by 1903 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :391 after 1434
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1434 after 4086
Detected timeout of ITS tools.
[2025-06-03 07:18:36] [INFO ] Performed 501/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 07:19:06] [INFO ] Implicit Places using invariants and state equation in 61156 ms returned []
Implicit Place search using SMT with State Equation took 62929 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:19:06] [INFO ] Redundant transitions in 182 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-03 07:19:06] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:19:06] [INFO ] Invariant cache hit.
[2025-06-03 07:19:06] [INFO ] State equation strengthened by 1903 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 34521ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 34529ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97762 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 310219 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:19:41] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2025-06-03 07:19:41] [INFO ] Computed 43 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (340 resets) in 284 ms. (35 steps per ms)
BEST_FIRST walk for 10001 steps (41 resets) in 47 ms. (208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:19:41] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2025-06-03 07:19:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:19:41] [INFO ] [Real]Absence check using 31 positive place invariants in 39 ms returned sat
[2025-06-03 07:19:41] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2025-06-03 07:19:43] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2025-06-03 07:19:43] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2025-06-03 07:19:43] [INFO ] [Real]Added 1906 Read/Feed constraints in 514 ms returned sat
[2025-06-03 07:19:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 07:19:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-03 07:19:44] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:19:45] [INFO ] [Nat]Absence check using state equation in 1203 ms returned sat
[2025-06-03 07:19:45] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 07:19:46] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1168 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 111 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 952/954 places, 3439/3443 transitions.
[2025-06-03 07:19:46] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2025-06-03 07:19:46] [INFO ] Computed 43 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34070 resets) in 17607 ms. (56 steps per ms)
BEST_FIRST walk for 1000001 steps (4031 resets) in 2813 ms. (355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 07:20:06] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:20:07] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-03 07:20:07] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:20:08] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2025-06-03 07:20:08] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-03 07:20:09] [INFO ] [Real]Added 1903 Read/Feed constraints in 689 ms returned sat
[2025-06-03 07:20:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 07:20:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 28 ms returned sat
[2025-06-03 07:20:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2025-06-03 07:20:10] [INFO ] [Nat]Absence check using state equation in 1285 ms returned sat
[2025-06-03 07:20:12] [INFO ] [Nat]Added 1903 Read/Feed constraints in 2013 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:20:14] [INFO ] Deduced a trap composed of 146 places in 1298 ms of which 186 ms to minimize.
[2025-06-03 07:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1537 ms
[2025-06-03 07:20:14] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 276 ms.
[2025-06-03 07:20:16] [INFO ] Added : 14 causal constraints over 3 iterations in 1633 ms. Result :sat
Minimization took 5086 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 100 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 119 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-03 07:20:21] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:20:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:20:23] [INFO ] Implicit Places using invariants in 1955 ms returned []
[2025-06-03 07:20:23] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:20:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:20:24] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-03 07:20:54] [INFO ] Performed 472/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 07:21:24] [INFO ] Performed 947/952 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 07:21:25] [INFO ] Implicit Places using invariants and state equation in 62253 ms returned []
Implicit Place search using SMT with State Equation took 64214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:21:25] [INFO ] Redundant transitions in 183 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-03 07:21:25] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:21:25] [INFO ] Invariant cache hit.
[2025-06-03 07:21:25] [INFO ] State equation strengthened by 1903 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 34241ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 34249ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98786 ms. Remains : 952/952 places, 3439/3439 transitions.
[2025-06-03 07:22:00] [INFO ] Flatten gal took : 125 ms
[2025-06-03 07:22:00] [INFO ] Flatten gal took : 329 ms
RANDOM walk for 40000 steps (1361 resets) in 1773 ms. (22 steps per ms) remains 2/2 properties
[2025-06-03 07:22:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11232459387576640570.gal : 67 ms
[2025-06-03 07:22:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15318364581820578314.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/ReachabilityCardinality11232459387576640570.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15318364581820578314.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
BEST_FIRST walk for 40004 steps (159 resets) in 331 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 369 ms. (108 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality15318364581820578314.prop.
Interrupted probabilistic random walk after 56158 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 56158 steps, saw 23490 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 07:22:03] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:22:03] [INFO ] Invariant cache hit.
[2025-06-03 07:22:03] [INFO ] State equation strengthened by 1903 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:05] [INFO ] Deduced a trap composed of 139 places in 1253 ms of which 119 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 31
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :31 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3560 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 700
[2025-06-03 07:22:08] [INFO ] Deduced a trap composed of 139 places in 1194 ms of which 170 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:09] [INFO ] Deduced a trap composed of 75 places in 936 ms of which 100 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :700 after 1153
[2025-06-03 07:22:11] [INFO ] Deduced a trap composed of 5 places in 1357 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:12] [INFO ] Deduced a trap composed of 27 places in 1192 ms of which 68 ms to minimize.
SMT process timed out in 8665ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 103 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1362 resets) in 1132 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (158 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 232 ms. (171 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 55286 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 2
Probabilistic random walk after 55286 steps, saw 23147 distinct states, run finished after 3001 ms. (steps per millisecond=18 ) properties seen :0
[2025-06-03 07:22:16] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:22:16] [INFO ] Invariant cache hit.
[2025-06-03 07:22:16] [INFO ] State equation strengthened by 1903 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1153 after 2199
[2025-06-03 07:22:17] [INFO ] Deduced a trap composed of 139 places in 1074 ms of which 116 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3559 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:20] [INFO ] Deduced a trap composed of 139 places in 1046 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:21] [INFO ] Deduced a trap composed of 75 places in 1031 ms of which 99 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:23] [INFO ] Deduced a trap composed of 5 places in 1201 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:24] [INFO ] Deduced a trap composed of 27 places in 1162 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:25] [INFO ] Deduced a trap composed of 46 places in 1236 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:26] [INFO ] Deduced a trap composed of 46 places in 1142 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:28] [INFO ] Deduced a trap composed of 53 places in 1134 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:29] [INFO ] Deduced a trap composed of 54 places in 1089 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2199 after 4998
[2025-06-03 07:22:30] [INFO ] Deduced a trap composed of 54 places in 1085 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:31] [INFO ] Deduced a trap composed of 54 places in 1095 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:32] [INFO ] Deduced a trap composed of 54 places in 1098 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:33] [INFO ] Deduced a trap composed of 54 places in 1265 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:35] [INFO ] Deduced a trap composed of 54 places in 1442 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:36] [INFO ] Deduced a trap composed of 54 places in 1379 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:37] [INFO ] Deduced a trap composed of 54 places in 1270 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:39] [INFO ] Deduced a trap composed of 54 places in 1153 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:40] [INFO ] Deduced a trap composed of 54 places in 1092 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:41] [INFO ] Deduced a trap composed of 54 places in 1070 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:42] [INFO ] Deduced a trap composed of 54 places in 1056 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:43] [INFO ] Deduced a trap composed of 54 places in 1000 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:44] [INFO ] Deduced a trap composed of 54 places in 1077 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:45] [INFO ] Deduced a trap composed of 71 places in 901 ms of which 111 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:46] [INFO ] Deduced a trap composed of 51 places in 1045 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:47] [INFO ] Deduced a trap composed of 51 places in 1075 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:48] [INFO ] Deduced a trap composed of 51 places in 1046 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:49] [INFO ] Deduced a trap composed of 56 places in 1067 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-03 07:22:50] [INFO ] Flatten gal took : 182 ms
[2025-06-03 07:22:50] [INFO ] Applying decomposition
[2025-06-03 07:22:50] [INFO ] Deduced a trap composed of 51 places in 1156 ms of which 129 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:51] [INFO ] Flatten gal took : 110 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/graph9707545135073913729.txt' '-o' '/tmp/graph9707545135073913729.bin' '-w' '/tmp/graph9707545135073913729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9707545135073913729.bin' '-l' '-1' '-v' '-w' '/tmp/graph9707545135073913729.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:22:51] [INFO ] Decomposing Gal with order
[2025-06-03 07:22:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:22:52] [INFO ] Removed a total of 5804 redundant transitions.
[2025-06-03 07:22:52] [INFO ] Deduced a trap composed of 54 places in 1091 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:52] [INFO ] Flatten gal took : 821 ms
[2025-06-03 07:22:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2079 labels/synchronizations in 153 ms.
[2025-06-03 07:22:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4243287893347750967.gal : 29 ms
[2025-06-03 07:22:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16784695714698512383.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/ReachabilityCardinality4243287893347750967.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16784695714698512383.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
[2025-06-03 07:22:53] [INFO ] Deduced a trap composed of 46 places in 1033 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality16784695714698512383.prop.
[2025-06-03 07:22:54] [INFO ] Deduced a trap composed of 55 places in 1004 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:55] [INFO ] Deduced a trap composed of 54 places in 1017 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:56] [INFO ] Deduced a trap composed of 64 places in 1086 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:57] [INFO ] Deduced a trap composed of 54 places in 1060 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:58] [INFO ] Deduced a trap composed of 64 places in 1129 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:22:59] [INFO ] Deduced a trap composed of 55 places in 1123 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:23:00] [INFO ] Deduced a trap composed of 64 places in 1107 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:23:02] [INFO ] Deduced a trap composed of 64 places in 1245 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:23:03] [INFO ] Deduced a trap composed of 46 places in 1248 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 07:23:04] [INFO ] Deduced a trap composed of 46 places in 1225 ms of which 93 ms to minimize.
SMT process timed out in 48592ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 100 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 100 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2025-06-03 07:23:04] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:23:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:23:06] [INFO ] Implicit Places using invariants in 1815 ms returned []
[2025-06-03 07:23:06] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:23:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 07:23:07] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2025-06-03 07:23:38] [INFO ] Performed 461/952 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-03 07:24:08] [INFO ] Performed 950/952 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 07:24:08] [INFO ] Implicit Places using invariants and state equation in 62229 ms returned []
Implicit Place search using SMT with State Equation took 64059 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 07:24:09] [INFO ] Redundant transitions in 185 ms returned []
Running 3377 sub problems to find dead transitions.
[2025-06-03 07:24:09] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2025-06-03 07:24:09] [INFO ] Invariant cache hit.
[2025-06-03 07:24:09] [INFO ] State equation strengthened by 1903 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 34927ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 34937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99297 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 in 302928 ms.
[2025-06-03 07:24:44] [INFO ] Flatten gal took : 104 ms
[2025-06-03 07:24:44] [INFO ] Applying decomposition
[2025-06-03 07:24:44] [INFO ] Flatten gal took : 110 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/graph9569002392302300154.txt' '-o' '/tmp/graph9569002392302300154.bin' '-w' '/tmp/graph9569002392302300154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9569002392302300154.bin' '-l' '-1' '-v' '-w' '/tmp/graph9569002392302300154.weights' '-q' '0' '-e' '0.001'
[2025-06-03 07:24:44] [INFO ] Decomposing Gal with order
[2025-06-03 07:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 07:24:45] [INFO ] Removed a total of 5815 redundant transitions.
[2025-06-03 07:24:45] [INFO ] Flatten gal took : 510 ms
[2025-06-03 07:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2988 labels/synchronizations in 177 ms.
[2025-06-03 07:24:45] [INFO ] Time to serialize gal into /tmp/UpperBounds3094141983871433418.gal : 32 ms
[2025-06-03 07:24:45] [INFO ] Time to serialize properties into /tmp/UpperBounds13490192247306852345.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/UpperBounds3094141983871433418.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13490192247306852345.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/UpperBounds13490192247306852345.prop.
ITS-tools command line returned an error code 137
[2025-06-03 07:43:15] [INFO ] Flatten gal took : 1412 ms
[2025-06-03 07:43:16] [INFO ] Time to serialize gal into /tmp/UpperBounds13320289082245068314.gal : 266 ms
[2025-06-03 07:43:16] [INFO ] Time to serialize properties into /tmp/UpperBounds17212921194249284579.prop : 18 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/UpperBounds13320289082245068314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17212921194249284579.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 ...306
Loading property file /tmp/UpperBounds17212921194249284579.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="MultiCrashLeafsetExtension-PT-S16C05"
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 MultiCrashLeafsetExtension-PT-S16C05, 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 r128-smll-174876524300309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 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 '
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 ;