About the Execution of ITS-Tools for JoinFreeModules-PT-5000
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422800485.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 JoinFreeModules-PT-5000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422800485
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M 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 JoinFreeModules-PT-5000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-5000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748855303386
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 09:08:24] [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-02 09:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:08:26] [INFO ] Load time of PNML (sax parser for PT used): 960 ms
[2025-06-02 09:08:26] [INFO ] Transformed 25001 places.
[2025-06-02 09:08:26] [INFO ] Transformed 40001 transitions.
[2025-06-02 09:08:26] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] 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, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 40001 rows 25000 cols
[2025-06-02 09:08:27] [INFO ] Computed 5000 invariants in 341 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 10003 steps (1 resets) in 2249 ms. (4 steps per ms)
BEST_FIRST walk for 160016 steps (0 resets) in 36503 ms. (4 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:09:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 80 are kept as prefixes of interest. Removing 24920 places using SCC suffix rule.37 ms
Discarding 24920 places :
Also discarding 39872 output transitions
Drop transitions (Output transitions of discarded places.) removed 39872 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 179 ms. Remains 80 /25000 variables (removed 24920) and now considering 128/40001 (removed 39873) transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 80 cols
[2025-06-02 09:10:04] [INFO ] Computed 16 invariants in 2 ms
[2025-06-02 09:10:04] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 3522 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 0/208 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 209 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9964 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13541ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13550ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13740 ms. Remains : 80/25000 places, 128/40001 transitions.
[2025-06-02 09:10:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 2, 2, 2, 0, 2, 2, 2, 2, 5000, 2, 1, 5000, 1, 2] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000046 steps (2 resets) in 768 ms. (1300 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 17624 ms. (907 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2815, 3752, 4065, 3441, 3502, 5000, 4250, 4627, 4250, 3502, 5000, 4377, 5001, 5000, 5001, 4706] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:10:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:36] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2025-06-02 09:10:36] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2025-06-02 09:10:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 09:10:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 09:10:36] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:10:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:10:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 09:10:37] [INFO ] Added : 62 causal constraints over 13 iterations in 287 ms. Result :sat
Minimization took 192 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:37] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:10:37] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-02 09:10:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:37] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-06-02 09:10:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 209 ms returned sat
[2025-06-02 09:10:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
[2025-06-02 09:10:37] [INFO ] Added : 46 causal constraints over 10 iterations in 163 ms. Result :sat
Minimization took 170 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:37] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2025-06-02 09:10:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 43 ms returned sat
[2025-06-02 09:10:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 09:10:38] [INFO ] Added : 52 causal constraints over 11 iterations in 353 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:38] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 09:10:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 09:10:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:10:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:10:39] [INFO ] Added : 63 causal constraints over 14 iterations in 238 ms. Result :sat
Minimization took 170 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:39] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 09:10:39] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:10:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:39] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:10:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:10:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:10:39] [INFO ] Added : 74 causal constraints over 16 iterations in 295 ms. Result :sat
Minimization took 186 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:40] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:10:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 113 ms returned sat
[2025-06-02 09:10:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 09:10:40] [INFO ] Added : 83 causal constraints over 19 iterations in 273 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:40] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:10:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 09:10:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 150 ms returned sat
[2025-06-02 09:10:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 09:10:40] [INFO ] Added : 70 causal constraints over 15 iterations in 124 ms. Result :sat
Minimization took 149 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:41] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-02 09:10:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:41] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-06-02 09:10:41] [INFO ] [Nat]Added 16 Read/Feed constraints in 41 ms returned sat
[2025-06-02 09:10:41] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-02 09:10:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2025-06-02 09:10:41] [INFO ] Added : 50 causal constraints over 11 iterations in 283 ms. Result :sat
Minimization took 107 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:41] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:10:41] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-06-02 09:10:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:41] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Nat]Added 16 Read/Feed constraints in 113 ms returned sat
[2025-06-02 09:10:42] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
[2025-06-02 09:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-06-02 09:10:42] [INFO ] Added : 64 causal constraints over 13 iterations in 192 ms. Result :sat
Minimization took 138 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:42] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:10:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:10:42] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:10:42] [INFO ] Added : 60 causal constraints over 13 iterations in 107 ms. Result :sat
Minimization took 162 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:42] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 09:10:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:42] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 116 ms returned sat
[2025-06-02 09:10:43] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:10:43] [INFO ] Added : 52 causal constraints over 11 iterations in 197 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:43] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 09:10:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2025-06-02 09:10:43] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:10:43] [INFO ] Added : 64 causal constraints over 14 iterations in 145 ms. Result :sat
Minimization took 163 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:43] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-02 09:10:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-02 09:10:43] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:10:43] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-02 09:10:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2025-06-02 09:10:44] [INFO ] Added : 58 causal constraints over 12 iterations in 406 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:44] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:44] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 09:10:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:44] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:10:44] [INFO ] [Nat]Added 16 Read/Feed constraints in 172 ms returned sat
[2025-06-02 09:10:44] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:10:44] [INFO ] Added : 58 causal constraints over 12 iterations in 167 ms. Result :sat
Minimization took 31 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:44] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 09:10:44] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:10:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:45] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-02 09:10:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:10:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:10:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2025-06-02 09:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2025-06-02 09:10:45] [INFO ] Added : 61 causal constraints over 14 iterations in 377 ms. Result :sat
Minimization took 30 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:45] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2025-06-02 09:10:45] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:10:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:10:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:10:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:10:45] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:10:45] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:10:45] [INFO ] Added : 68 causal constraints over 15 iterations in 233 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2815, 3752, 4065, 3441, 3502, 5000, 4250, 4627, 4250, 3502, 5000, 4377, 5001, 5000, 5001, 4706] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5002, 5001, 5002, 5002, 5002, 5000, 5002, 5002, 5002, 5002, 5000, 5002, 5001, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2025-06-02 09:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-02 09:17:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:17:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:17:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:17:35] [INFO ] Redundant transitions in 3 ms returned []
Running 96 sub problems to find dead transitions.
[2025-06-02 09:17:35] [INFO ] Invariant cache hit.
[2025-06-02 09:17:35] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/208 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 112 constraints, problems are : Problem set: 0 solved, 96 unsolved in 2857 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/80 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 128/208 variables, 80/96 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 96/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 208 constraints, problems are : Problem set: 0 solved, 96 unsolved in 10552 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 80/80 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13443ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13585 ms. Remains : 80/80 places, 128/128 transitions.
[2025-06-02 09:17:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5002, 5001, 5002, 5002, 5002, 5000, 5002, 5002, 5002, 5002, 5000, 5002, 5001, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001480 steps (2 resets) in 839 ms. (1192 steps per ms)
BEST_FIRST walk for 16000016 steps (32 resets) in 18072 ms. (885 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5002, 5001, 5002, 5002, 5002, 5002, 5002, 5002, 5002, 5002, 5000, 5002, 5001, 5000, 5001, 5002] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:18:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:07] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:07] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 09:18:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:18:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 09:18:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 137 ms returned sat
[2025-06-02 09:18:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:08] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2025-06-02 09:18:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2025-06-02 09:18:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 13 ms returned sat
[2025-06-02 09:18:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:18:08] [INFO ] Added : 64 causal constraints over 13 iterations in 125 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-06-02 09:18:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:18:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:18:09] [INFO ] Added : 69 causal constraints over 17 iterations in 303 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2025-06-02 09:18: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-02 09:18:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:09] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 3 ms to minimize.
[2025-06-02 09:18:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-06-02 09:18: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-02 09:18:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 79 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:09] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-02 09:18:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:18: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-02 09:18:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:18:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 240 ms returned sat
[2025-06-02 09:18:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:18:10] [INFO ] Added : 73 causal constraints over 17 iterations in 160 ms. Result :sat
Minimization took 24 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:10] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:18:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:10] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-02 09:18:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2025-06-02 09:18:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:11] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
[2025-06-02 09:18:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
Minimization took 17 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 154 ms returned sat
[2025-06-02 09:18:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 09:18:11] [INFO ] Added : 49 causal constraints over 10 iterations in 95 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:18:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Nat]Added 16 Read/Feed constraints in 63 ms returned sat
[2025-06-02 09:18:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 09:18:11] [INFO ] Added : 76 causal constraints over 16 iterations in 148 ms. Result :sat
Minimization took 26 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 09:18:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 155 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-02 09:18:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:12] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 119 ms returned sat
[2025-06-02 09:18:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-02 09:18:12] [INFO ] Added : 52 causal constraints over 11 iterations in 206 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-06-02 09:18:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:12] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 09:18:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 172 ms returned sat
[2025-06-02 09:18:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-02 09:18:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:13] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-02 09:18:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 09:18:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:13] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:18:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-02 09:18:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2025-06-02 09:18:13] [INFO ] Added : 58 causal constraints over 12 iterations in 421 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 172 ms returned sat
[2025-06-02 09:18:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:18:14] [INFO ] Added : 58 causal constraints over 12 iterations in 153 ms. Result :sat
Minimization took 32 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:14] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 09:18:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-06-02 09:18:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2025-06-02 09:18:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:15] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-02 09:18:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2025-06-02 09:18:15] [INFO ] Added : 61 causal constraints over 14 iterations in 367 ms. Result :sat
Minimization took 34 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2025-06-02 09:18:15] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-06-02 09:18:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:18:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2025-06-02 09:18:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 09:18:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 115 ms returned sat
[2025-06-02 09:18:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:15] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:18:15] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
[2025-06-02 09:18:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 66 ms
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5002, 5001, 5002, 5002, 5002, 5002, 5002, 5002, 5002, 5002, 5000, 5002, 5001, 5000, 5001, 5002] Max Struct:[5002, 5003, 5003, 5002, 5002, 5003, 5002, 5003, 5003, 5002, 5003, 5002, 5003, 5003, 5003, 5002]
FORMULA JoinFreeModules-PT-5000-UpperBounds-15 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-11 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-09 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-06 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-04 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-03 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-00 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5002, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 9 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 45 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions (Output transitions of discarded places.) removed 56 transitions
Applied a total of 1 rules in 8 ms. Remains 45 /80 variables (removed 35) and now considering 72/128 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 45/80 places, 72/128 transitions.
// Phase 1: matrix 72 rows 45 cols
[2025-06-02 09:21:50] [INFO ] Computed 9 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5002, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000294 steps (2 resets) in 469 ms. (2128 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 5915 ms. (1521 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5002, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:21:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 09:21: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-02 09:21:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-02 09:21:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 09:21:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:21:57] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 09:21:57] [INFO ] Added : 39 causal constraints over 9 iterations in 432 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:57] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 09:21: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-02 09:21:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 09:21:57] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2025-06-02 09:21:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:21:57] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:21:57] [INFO ] Added : 23 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:21:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Nat]Added 9 Read/Feed constraints in 177 ms returned sat
[2025-06-02 09:21:58] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 09:21:58] [INFO ] Added : 41 causal constraints over 9 iterations in 556 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:58] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:21:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:21:58] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:21:58] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
[2025-06-02 09:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2025-06-02 09:21:59] [INFO ] Added : 48 causal constraints over 12 iterations in 114 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-02 09:21: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-02 09:21:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:21:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2025-06-02 09:21:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:21: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-02 09:21:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 98 ms returned sat
[2025-06-02 09:21:59] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 09:21:59] [INFO ] Added : 16 causal constraints over 4 iterations in 30 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 09:21: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-02 09:21:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 09:21:59] [INFO ] Added : 40 causal constraints over 11 iterations in 169 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2025-06-02 09:21: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-02 09:21:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:21:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 83 ms returned sat
[2025-06-02 09:22:00] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:22:00] [INFO ] Added : 41 causal constraints over 9 iterations in 56 ms. Result :sat
Minimization took 22 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:22:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:22:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:22:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:22:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2025-06-02 09:22:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:22:00] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:22:00] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:22:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-02 09:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2025-06-02 09:22:01] [INFO ] Added : 43 causal constraints over 10 iterations in 936 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5002, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5002, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-08 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 40 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 12 ms. Remains 40 /45 variables (removed 5) and now considering 64/72 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 40/45 places, 64/72 transitions.
// Phase 1: matrix 64 rows 40 cols
[2025-06-02 09:23:23] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1000102 steps (2 resets) in 423 ms. (2358 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4746 ms. (1685 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:23:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:28] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-02 09:23:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 09:23:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 72 ms returned sat
[2025-06-02 09:23:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 09:23:29] [INFO ] Added : 28 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 19 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 09:23:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 86 ms returned sat
[2025-06-02 09:23:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 09:23:29] [INFO ] Added : 26 causal constraints over 7 iterations in 47 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 09:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:23:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2025-06-02 09:23:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 09:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 39 ms returned sat
[2025-06-02 09:23:29] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 09:23:30] [INFO ] Added : 41 causal constraints over 9 iterations in 77 ms. Result :sat
Minimization took 18 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2025-06-02 09:23:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:23:30] [INFO ] Added : 36 causal constraints over 10 iterations in 51 ms. Result :sat
Minimization took 16 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-02 09:23:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:23:30] [INFO ] Added : 40 causal constraints over 10 iterations in 50 ms. Result :sat
Minimization took 23 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:23:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-02 09:23:30] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:23:30] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 09:23:30] [INFO ] Added : 32 causal constraints over 9 iterations in 47 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5002, 5002, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5002, 5003, 5002, 5003, 5003, 5003, 5003]
FORMULA JoinFreeModules-PT-5000-UpperBounds-07 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-5000-UpperBounds-02 5002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003]
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 30 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /40 variables (removed 10) and now considering 48/64 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/40 places, 48/64 transitions.
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:24:23] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5001, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003]
RANDOM walk for 1001251 steps (2 resets) in 379 ms. (2634 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3209 ms. (1869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003]
[2025-06-02 09:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:26] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-02 09:24:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:24:26] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:24:26] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:24:27] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 17 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 12 ms returned sat
[2025-06-02 09:24:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:24:27] [INFO ] Added : 20 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 10 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 16 ms returned sat
[2025-06-02 09:24:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:24:27] [INFO ] Added : 17 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 12 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 17 ms returned sat
[2025-06-02 09:24:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 2 ms to minimize.
[2025-06-02 09:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-02 09:24:27] [INFO ] Added : 21 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 14 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 21 ms returned sat
[2025-06-02 09:24:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
[2025-06-02 09:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2025-06-02 09:24:27] [INFO ] Added : 18 causal constraints over 5 iterations in 70 ms. Result :sat
Minimization took 13 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-02 09:24:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:24:27] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2025-06-02 09:24:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:24:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-02 09:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-02 09:24:27] [INFO ] Added : 22 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001, 5002, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003, 5003]
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-06-02 09:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 09:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:25:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:25:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:25:03] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2025-06-02 09:25:03] [INFO ] Invariant cache hit.
[2025-06-02 09:25:03] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 79 constraints, problems are : Problem set: 0 solved, 36 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4338ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 4339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4422 ms. Remains : 30/30 places, 48/48 transitions.
RANDOM walk for 45018 steps (7 resets) in 64 ms. (692 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 12/12 properties
[2025-06-02 09:25:08] [INFO ] Flatten gal took : 63 ms
[2025-06-02 09:25:08] [INFO ] Flatten gal took : 7 ms
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
[2025-06-02 09:25:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2108810056623991785.gal : 9 ms
[2025-06-02 09:25:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1168931933427603464.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/ReachabilityCardinality2108810056623991785.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1168931933427603464.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1168931933427603464.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 353174 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 12
Probabilistic random walk after 353174 steps, saw 309384 distinct states, run finished after 3006 ms. (steps per millisecond=117 ) properties seen :0
[2025-06-02 09:25:11] [INFO ] Invariant cache hit.
[2025-06-02 09:25:11] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 28 ms to minimize.
Problem MAX0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:12] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/41 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/47 constraints. Problems are: Problem set: 5 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/47 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/47 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 47 constraints, problems are : Problem set: 5 solved, 7 unsolved in 873 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/11 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/41 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/47 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/54 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 54 constraints, problems are : Problem set: 5 solved, 7 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1740ms problems are : Problem set: 5 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :11747 after 45500
Parikh walk visited 1 properties in 30000 ms.
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 6 ms. Remains 25 /30 variables (removed 5) and now considering 40/48 (removed 8) transitions.
Running 30 sub problems to find dead transitions.
// Phase 1: matrix 40 rows 25 cols
[2025-06-02 09:25:43] [INFO ] Computed 5 invariants in 0 ms
[2025-06-02 09:25:43] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 30 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 5/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 65 constraints, problems are : Problem set: 0 solved, 30 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1010ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1016 ms. Remains : 25/30 places, 40/48 transitions.
RANDOM walk for 42519 steps (7 resets) in 53 ms. (787 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 260349 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 6
Probabilistic random walk after 260349 steps, saw 224064 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
[2025-06-02 09:25:47] [INFO ] Invariant cache hit.
[2025-06-02 09:25:47] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 35 constraints, problems are : Problem set: 0 solved, 6 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:25:47] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 43 constraints, problems are : Problem set: 0 solved, 6 unsolved in 943 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/25 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Detected timeout of ITS tools.
[2025-06-02 09:25:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 09:25:58] [INFO ] Applying decomposition
[2025-06-02 09:25:58] [INFO ] Flatten gal took : 4 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/graph14864430357181939706.txt' '-o' '/tmp/graph14864430357181939706.bin' '-w' '/tmp/graph14864430357181939706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14864430357181939706.bin' '-l' '-1' '-v' '-w' '/tmp/graph14864430357181939706.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:25:59] [INFO ] Decomposing Gal with order
[2025-06-02 09:25:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:25:59] [INFO ] Flatten gal took : 4 ms
[2025-06-02 09:25:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:25:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9389496085489394204.gal : 2 ms
[2025-06-02 09:25:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15802959985019125771.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9389496085489394204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15802959985019125771.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15802959985019125771.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3104 after 11747
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :11747 after 45500
Parikh walk visited 2 properties in 30001 ms.
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 20 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 20 /25 variables (removed 5) and now considering 32/40 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/25 places, 32/40 transitions.
RANDOM walk for 45643 steps (6 resets) in 15 ms. (2852 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 360902 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 4
Probabilistic random walk after 360902 steps, saw 298946 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 32 rows 20 cols
[2025-06-02 09:26:21] [INFO ] Computed 4 invariants in 0 ms
[2025-06-02 09:26:21] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 28 constraints, problems are : Problem set: 0 solved, 4 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 34 constraints, problems are : Problem set: 0 solved, 4 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 13693 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 32/32 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-02 09:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-02 09:26:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 09:26:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:26:35] [INFO ] Redundant transitions in 0 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-02 09:26:35] [INFO ] Invariant cache hit.
[2025-06-02 09:26:35] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 28 constraints, problems are : Problem set: 0 solved, 24 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 4/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 52 constraints, problems are : Problem set: 0 solved, 24 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 20/20 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 677ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 20/20 places, 32/32 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA JoinFreeModules-PT-5000-UpperBounds-05 5003 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[5001, 5000, 5001, 5000, 5001] Max Struct:[5003, 5003, 5003, 5003, 5003]
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5003]
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:26:36] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5003]
RANDOM walk for 12505 steps (2 resets) in 7 ms. (1563 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[210] Max Struct:[5003]
[2025-06-02 09:26:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:26:36] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 09:26:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:26:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:26:36] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-02 09:26:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:26:36] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2025-06-02 09:26:36] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:26:36] [INFO ] Added : 24 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 104 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[210] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 09:26:44] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 09:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 5/30 places, 8/48 transitions.
[2025-06-02 09:26:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000387 steps (2 resets) in 118 ms. (8406 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 424 ms. (2352 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2025-06-02 09:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:26:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:26:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:26:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:26:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-02 09:26:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:26:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:26:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 09:26:45] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:47] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-02 09:26:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:26:47] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:26:47] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:26:47] [INFO ] Invariant cache hit.
[2025-06-02 09:26:47] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 09:26:47] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 45194 steps (8 resets) in 12 ms. (3476 steps per ms) remains 2/2 properties
[2025-06-02 09:26:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:26:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality621438822630375921.gal : 1 ms
[2025-06-02 09:26:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10249125866980975792.prop : 5 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/ReachabilityCardinality621438822630375921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10249125866980975792.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality10249125866980975792.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1185807 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :0 out of 2
Probabilistic random walk after 1185807 steps, saw 510394 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
[2025-06-02 09:26:50] [INFO ] Invariant cache hit.
[2025-06-02 09:26:50] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:26:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 841 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 09:26:51] [INFO ] Invariant cache hit.
[2025-06-02 09:26:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46649 steps (8 resets) in 9 ms. (4664 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3284707 steps, run timeout after 3001 ms. (steps per millisecond=1094 ) properties seen :0 out of 1
Probabilistic random walk after 3284707 steps, saw 1262006 distinct states, run finished after 3002 ms. (steps per millisecond=1094 ) properties seen :0
[2025-06-02 09:26:54] [INFO ] Invariant cache hit.
[2025-06-02 09:26:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 910 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-02 09:26:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:26:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:26:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:26:55] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:26:55] [INFO ] Invariant cache hit.
[2025-06-02 09:26:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:26:56] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:26:56] [INFO ] Applying decomposition
[2025-06-02 09:26:56] [INFO ] Flatten gal took : 1 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/graph10877702693378507836.txt' '-o' '/tmp/graph10877702693378507836.bin' '-w' '/tmp/graph10877702693378507836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10877702693378507836.bin' '-l' '-1' '-v' '-w' '/tmp/graph10877702693378507836.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:26:56] [INFO ] Decomposing Gal with order
[2025-06-02 09:26:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:26:56] [INFO ] Flatten gal took : 54 ms
[2025-06-02 09:26:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 09:26:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6486239626750921707.gal : 1 ms
[2025-06-02 09:26:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7600995700211395657.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/ReachabilityCardinality6486239626750921707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7600995700211395657.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7600995700211395657.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-01 in 69812 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:27:46] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 4 ms. (2001 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2025-06-02 09:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:27:46] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:27:46] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-02 09:27:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:27:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2025-06-02 09:27:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-06-02 09:27:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:27:46] [INFO ] [Nat]Added 6 Read/Feed constraints in 36 ms returned sat
[2025-06-02 09:27:46] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:27:46] [INFO ] Added : 17 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 09:27:50] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 09:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 183ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 5/30 places, 8/48 transitions.
[2025-06-02 09:27:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1001063 steps (2 resets) in 103 ms. (9625 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2025-06-02 09:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:27:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:27:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:27:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:27: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-02 09:27:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:27:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:27:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:27:51] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
[2025-06-02 09:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2025-06-02 09:27:51] [INFO ] Added : 5 causal constraints over 2 iterations in 36 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:51] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 09:27:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:27:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:27:51] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:27:51] [INFO ] Invariant cache hit.
[2025-06-02 09:27:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 09:27:52] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 46645 steps (7 resets) in 9 ms. (4664 steps per ms) remains 2/2 properties
[2025-06-02 09:27:52] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:27:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14421204676116418449.gal : 0 ms
[2025-06-02 09:27:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8757431048187012010.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/ReachabilityCardinality14421204676116418449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8757431048187012010.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/ReachabilityCardinality8757431048187012010.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1039467 steps, run timeout after 3001 ms. (steps per millisecond=346 ) properties seen :0 out of 2
Probabilistic random walk after 1039467 steps, saw 453144 distinct states, run finished after 3002 ms. (steps per millisecond=346 ) properties seen :0
[2025-06-02 09:27:55] [INFO ] Invariant cache hit.
[2025-06-02 09:27:55] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 09:27:55] [INFO ] Invariant cache hit.
[2025-06-02 09:27:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 44274 steps (7 resets) in 9 ms. (4427 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3341179 steps, run timeout after 3001 ms. (steps per millisecond=1113 ) properties seen :0 out of 1
Probabilistic random walk after 3341179 steps, saw 1281773 distinct states, run finished after 3001 ms. (steps per millisecond=1113 ) properties seen :0
[2025-06-02 09:27:58] [INFO ] Invariant cache hit.
[2025-06-02 09:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:27:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 09:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:27:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:27:58] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:27:58] [INFO ] Invariant cache hit.
[2025-06-02 09:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:27:58] [INFO ] Flatten gal took : 0 ms
[2025-06-02 09:27:58] [INFO ] Applying decomposition
[2025-06-02 09:27:58] [INFO ] Flatten gal took : 1 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/graph7223822850711974952.txt' '-o' '/tmp/graph7223822850711974952.bin' '-w' '/tmp/graph7223822850711974952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7223822850711974952.bin' '-l' '-1' '-v' '-w' '/tmp/graph7223822850711974952.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:27:58] [INFO ] Decomposing Gal with order
[2025-06-02 09:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:27:58] [INFO ] Flatten gal took : 2 ms
[2025-06-02 09:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:27:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13919216087539119155.gal : 0 ms
[2025-06-02 09:27:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15921687633587515567.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/ReachabilityCardinality13919216087539119155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15921687633587515567.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 ...309
Loading property file /tmp/ReachabilityCardinality15921687633587515567.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-10 in 62476 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:28:48] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10004 steps (1 resets) in 4 ms. (2000 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[240] Max Struct:[5003]
[2025-06-02 09:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:28:48] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:28:48] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 09:28:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:28:48] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:28:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-02 09:28:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:28:48] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2025-06-02 09:28:48] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:28:48] [INFO ] Added : 22 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[240] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4997] Max Struct:[5003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 09:28:54] [INFO ] Computed 1 invariants in 0 ms
[2025-06-02 09:28:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 5/30 places, 8/48 transitions.
[2025-06-02 09:28:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4997] Max Struct:[5003]
RANDOM walk for 1000749 steps (2 resets) in 102 ms. (9716 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 663 ms. (1506 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2025-06-02 09:28:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:28:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 09:28:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-02 09:28:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:28:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 09:28:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2025-06-02 09:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:28:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:28:55] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 09:28:55] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 09:28:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:28:56] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:28:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:28:56] [INFO ] Invariant cache hit.
[2025-06-02 09:28:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 09:28:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1000469 steps (2 resets) in 105 ms. (9438 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2025-06-02 09:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:28:57] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:28:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 09:28: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-02 09:28:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 09:28:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:28:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-02 09:28:57] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-02 09:28:57] [INFO ] Added : 5 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:57] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 09:28:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:28:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:28:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:28:57] [INFO ] Invariant cache hit.
[2025-06-02 09:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 09:28:58] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:28:58] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 44145 steps (6 resets) in 12 ms. (3395 steps per ms) remains 2/2 properties
[2025-06-02 09:28:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14785370341546749441.gal : 1 ms
[2025-06-02 09:28:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10625638946417033199.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/ReachabilityCardinality14785370341546749441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10625638946417033199.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10625638946417033199.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 1017877 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :0 out of 2
Probabilistic random walk after 1017877 steps, saw 444772 distinct states, run finished after 3001 ms. (steps per millisecond=339 ) properties seen :0
[2025-06-02 09:29:01] [INFO ] Invariant cache hit.
[2025-06-02 09:29:01] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 834 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 09:29:02] [INFO ] Invariant cache hit.
[2025-06-02 09:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 189ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 42988 steps (8 resets) in 9 ms. (4298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2927408 steps, run timeout after 3001 ms. (steps per millisecond=975 ) properties seen :0 out of 1
Probabilistic random walk after 2927408 steps, saw 1134674 distinct states, run finished after 3001 ms. (steps per millisecond=975 ) properties seen :0
[2025-06-02 09:29:05] [INFO ] Invariant cache hit.
[2025-06-02 09:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 822 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 09:29:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:29:06] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:29:06] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:29:06] [INFO ] Invariant cache hit.
[2025-06-02 09:29:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:29:06] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:29:06] [INFO ] Applying decomposition
[2025-06-02 09:29:06] [INFO ] Flatten gal took : 1 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/graph12036188895163964346.txt' '-o' '/tmp/graph12036188895163964346.bin' '-w' '/tmp/graph12036188895163964346.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12036188895163964346.bin' '-l' '-1' '-v' '-w' '/tmp/graph12036188895163964346.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:29:06] [INFO ] Decomposing Gal with order
[2025-06-02 09:29:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:29:06] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:29:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:29:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17725526591822952156.gal : 1 ms
[2025-06-02 09:29:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8644783049488776800.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/ReachabilityCardinality17725526591822952156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8644783049488776800.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8644783049488776800.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-12 in 67629 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[5000] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[5000] Max Struct:[5003]
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:29:56] [INFO ] Computed 6 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 10005 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2025-06-02 09:29:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:29:56] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:29:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-02 09:29:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:29:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:29:56] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-02 09:29:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:29:56] [INFO ] [Nat]Added 6 Read/Feed constraints in 20 ms returned sat
[2025-06-02 09:29:56] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:29:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
[2025-06-02 09:29:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2025-06-02 09:29:56] [INFO ] Added : 18 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 09:30:01] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 09:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 141ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 5/30 places, 8/48 transitions.
[2025-06-02 09:30:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5000] Max Struct:[5003]
RANDOM walk for 1000232 steps (2 resets) in 102 ms. (9710 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 414 ms. (2409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5000] Max Struct:[5003]
[2025-06-02 09:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:30:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:30:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:30:01] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 09:30:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:30:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:30:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2025-06-02 09:30:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2025-06-02 09:30:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2025-06-02 09:30:01] [INFO ] Added : 5 causal constraints over 2 iterations in 37 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5000] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5000] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-02 09:30:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:30:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:30:01] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:30:01] [INFO ] Invariant cache hit.
[2025-06-02 09:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-02 09:30:02] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:30:02] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:30:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2748398245658254609.gal : 1 ms
[2025-06-02 09:30:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2348248597114617232.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/ReachabilityCardinality2748398245658254609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2348248597114617232.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 45018 steps (7 resets) in 9 ms. (4501 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2348248597114617232.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 772991 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 2
Probabilistic random walk after 772991 steps, saw 353043 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2025-06-02 09:30:05] [INFO ] Invariant cache hit.
[2025-06-02 09:30:05] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 09:30:05] [INFO ] Invariant cache hit.
[2025-06-02 09:30:05] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46402 steps (7 resets) in 10 ms. (4218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3254451 steps, run timeout after 3001 ms. (steps per millisecond=1084 ) properties seen :0 out of 1
Probabilistic random walk after 3254451 steps, saw 1250518 distinct states, run finished after 3002 ms. (steps per millisecond=1084 ) properties seen :0
[2025-06-02 09:30:08] [INFO ] Invariant cache hit.
[2025-06-02 09:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:30:08] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 136ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 09:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:30:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:30:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:30:08] [INFO ] Invariant cache hit.
[2025-06-02 09:30:08] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:30:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:30:08] [INFO ] Applying decomposition
[2025-06-02 09:30:08] [INFO ] Flatten gal took : 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/graph8885337059819073797.txt' '-o' '/tmp/graph8885337059819073797.bin' '-w' '/tmp/graph8885337059819073797.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8885337059819073797.bin' '-l' '-1' '-v' '-w' '/tmp/graph8885337059819073797.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:30:08] [INFO ] Decomposing Gal with order
[2025-06-02 09:30:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:30:08] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:30:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:30:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13328291991759183183.gal : 0 ms
[2025-06-02 09:30:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11181787896564625402.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/ReachabilityCardinality13328291991759183183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11181787896564625402.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 ...309
Loading property file /tmp/ReachabilityCardinality11181787896564625402.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5000] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-13 in 62454 ms.
Starting property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[5003]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[5003]
// Phase 1: matrix 48 rows 30 cols
[2025-06-02 09:30:58] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5003]
RANDOM walk for 10003 steps (1 resets) in 5 ms. (1667 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[240] Max Struct:[5003]
[2025-06-02 09:30:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:30:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-02 09:30:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-02 09:30:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:30:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-02 09:30:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-02 09:30:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-02 09:30:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2025-06-02 09:30:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 09:30:59] [INFO ] Added : 24 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[240] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 09:31:04] [INFO ] Computed 1 invariants in 1 ms
[2025-06-02 09:31:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 5/30 places, 8/48 transitions.
[2025-06-02 09:31:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5001] Max Struct:[5003]
RANDOM walk for 1002509 steps (2 resets) in 121 ms. (8217 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 550 ms. (1814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5001] Max Struct:[5003]
[2025-06-02 09:31:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:31:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-02 09:31:05] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:31:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 09:31:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-02 09:31:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-02 09:31:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:31:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-02 09:31:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-02 09:31:05] [INFO ] Added : 5 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5001] Max Struct:[5003]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5001] Max Struct:[5003]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 09:31:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:31:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:31:06] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:31:06] [INFO ] Invariant cache hit.
[2025-06-02 09:31:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 199 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 46396 steps (6 resets) in 16 ms. (2729 steps per ms) remains 2/2 properties
[2025-06-02 09:31:06] [INFO ] Flatten gal took : 10 ms
[2025-06-02 09:31:06] [INFO ] Flatten gal took : 2 ms
[2025-06-02 09:31:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18404791082295957314.gal : 1 ms
[2025-06-02 09:31:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9075553098475346721.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/ReachabilityCardinality18404791082295957314.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9075553098475346721.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/ReachabilityCardinality9075553098475346721.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 11747
Interrupted probabilistic random walk after 842580 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 2
Probabilistic random walk after 842580 steps, saw 379298 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2025-06-02 09:31:09] [INFO ] Invariant cache hit.
[2025-06-02 09:31:09] [INFO ] State equation strengthened by 1 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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:31:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 886 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running 6 sub problems to find dead transitions.
[2025-06-02 09:31:10] [INFO ] Invariant cache hit.
[2025-06-02 09:31:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 45276 steps (8 resets) in 9 ms. (4527 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2900382 steps, run timeout after 3001 ms. (steps per millisecond=966 ) properties seen :0 out of 1
Probabilistic random walk after 2900382 steps, saw 1125262 distinct states, run finished after 3001 ms. (steps per millisecond=966 ) properties seen :0
[2025-06-02 09:31:13] [INFO ] Invariant cache hit.
[2025-06-02 09:31:13] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 8 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 911 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 7 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-02 09:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-02 09:31:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 09:31:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 09:31:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 09:31:15] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-02 09:31:15] [INFO ] Invariant cache hit.
[2025-06-02 09:31:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 5/5 places, 8/8 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 09:31:15] [INFO ] Flatten gal took : 2 ms
[2025-06-02 09:31:15] [INFO ] Applying decomposition
[2025-06-02 09:31:15] [INFO ] Flatten gal took : 1 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/graph17224254008842930727.txt' '-o' '/tmp/graph17224254008842930727.bin' '-w' '/tmp/graph17224254008842930727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17224254008842930727.bin' '-l' '-1' '-v' '-w' '/tmp/graph17224254008842930727.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:31:15] [INFO ] Decomposing Gal with order
[2025-06-02 09:31:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:31:15] [INFO ] Flatten gal took : 1 ms
[2025-06-02 09:31:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:31:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10345050946420138641.gal : 1 ms
[2025-06-02 09:31:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12412913366488255381.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/ReachabilityCardinality10345050946420138641.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12412913366488255381.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 ...309
Loading property file /tmp/ReachabilityCardinality12412913366488255381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 520
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :520 after 1033
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1033 after 2058
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2058 after 4107
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5001] Max Struct:[5003]
Ending property specific reduction for JoinFreeModules-PT-5000-UpperBounds-14 in 66382 ms.
[2025-06-02 09:32:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 09:32:05] [INFO ] Applying decomposition
[2025-06-02 09:32:05] [INFO ] Flatten gal took : 4 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/graph5976649995415678937.txt' '-o' '/tmp/graph5976649995415678937.bin' '-w' '/tmp/graph5976649995415678937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5976649995415678937.bin' '-l' '-1' '-v' '-w' '/tmp/graph5976649995415678937.weights' '-q' '0' '-e' '0.001'
[2025-06-02 09:32:05] [INFO ] Decomposing Gal with order
[2025-06-02 09:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 09:32:05] [INFO ] Flatten gal took : 3 ms
[2025-06-02 09:32:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 09:32:05] [INFO ] Time to serialize gal into /tmp/UpperBounds5661239344773252825.gal : 1 ms
[2025-06-02 09:32:05] [INFO ] Time to serialize properties into /tmp/UpperBounds6410935478889916737.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/UpperBounds5661239344773252825.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6410935478889916737.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 ...283
Loading property file /tmp/UpperBounds6410935478889916737.prop.
Detected timeout of ITS tools.
[2025-06-02 09:59:58] [INFO ] Flatten gal took : 3 ms
[2025-06-02 09:59:58] [INFO ] Time to serialize gal into /tmp/UpperBounds14738128524059641790.gal : 1 ms
[2025-06-02 09:59:58] [INFO ] Time to serialize properties into /tmp/UpperBounds8770832877072771340.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/UpperBounds14738128524059641790.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8770832877072771340.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds8770832877072771340.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="JoinFreeModules-PT-5000"
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 JoinFreeModules-PT-5000, 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 r114-tall-174876422800485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 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 ;