MCC'2025- Execution of r167-tall-174881266100081

About the Execution of 2024-gold for PolyORBNT-PT-S05J30

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15687.480	2879982.00	3223133.00	7919.10	1 1 4 4 1 1 5 3 1 ? 1 1 1 1 1 1	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r167-tall-174881266100081.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 gold2024
Input is PolyORBNT-PT-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266100081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 31K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 198K 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 13K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 364K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 PolyORBNT-PT-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748898437142

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:07:18] [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 21:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:07:18] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2025-06-02 21:07:18] [INFO ] Transformed 489 places.
[2025-06-02 21:07:18] [INFO ] Transformed 1400 transitions.
[2025-06-02 21:07:18] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 5, 3, 1, 0, 1, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 5, 3, 1, 0, 1, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 21:07:18] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2025-06-02 21:07:18] [INFO ] Computed 82 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 5, 3, 1, 0, 1, 0, 0, 0, 0, 1] Max Struct:[80, 80, 171, 892, 156, 80, 109, 3, 44, 320, 99, 1, 1, 80, 80, 9]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (676 resets) in 87 ms. (113 steps per ms)
FORMULA PolyORBNT-PT-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130011 steps (2056 resets) in 350 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 4, 4, 1, 1, 5, 1, 3, 1, 1, 1, 1] Max Struct:[80, 80, 171, 892, 156, 80, 109, 44, 320, 99, 80, 80, 9]
[2025-06-02 21:07:19] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
[2025-06-02 21:07:19] [INFO ] Invariant cache hit.
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 46 ms returned unsat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 30 ms returned unsat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 22 ms returned sat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 37 ms returned unsat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2025-06-02 21:07:19] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned unsat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned unsat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned unsat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 18 ms returned unsat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 6 ms returned unsat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-06-02 21:07:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:07:20] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2025-06-02 21:07:20] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 32 ms returned sat
[2025-06-02 21:07:21] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2025-06-02 21:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:07:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 42 ms returned sat
[2025-06-02 21:07:21] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 75 ms.
[2025-06-02 21:07:22] [INFO ] Deduced a trap composed of 264 places in 246 ms of which 29 ms to minimize.
[2025-06-02 21:07:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2025-06-02 21:07:22] [INFO ] Added : 21 causal constraints over 5 iterations in 869 ms. Result :sat
Minimization took 729 ms.
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 21 ms returned unsat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:07:23] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 23 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 4, 4, 1, 1, 5, 1, 3, 1, 1, 1, 1] Max Struct:[1, 1, 4, 4, 1, 1, 5, 1, 320, 1, 1, 1, 1]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[320]
Support contains 1 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 77 place count 448 transition count 674
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 147 place count 413 transition count 674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 412 transition count 673
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 412 transition count 673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 410 transition count 671
Applied a total of 153 rules in 172 ms. Remains 410 /489 variables (removed 79) and now considering 671/745 (removed 74) transitions.
Running 665 sub problems to find dead transitions.
[2025-06-02 21:07:23] [INFO ] Flow matrix only has 667 transitions (discarded 4 similar events)
// Phase 1: matrix 667 rows 410 cols
[2025-06-02 21:07:23] [INFO ] Computed 77 invariants in 22 ms
[2025-06-02 21:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/410 variables, 5/77 constraints. Problems are: Problem set: 95 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/410 variables, 0/77 constraints. Problems are: Problem set: 95 solved, 570 unsolved
At refinement iteration 5 (OVERLAPS) 667/1077 variables, 410/487 constraints. Problems are: Problem set: 95 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 1/488 constraints. Problems are: Problem set: 95 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 488 constraints, problems are : Problem set: 95 solved, 570 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 95 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 95 solved, 570 unsolved
[2025-06-02 21:07:47] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 1/73 constraints. Problems are: Problem set: 95 solved, 570 unsolved
[2025-06-02 21:07:53] [INFO ] Deduced a trap composed of 203 places in 182 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 1/74 constraints. Problems are: Problem set: 95 solved, 570 unsolved
[2025-06-02 21:07:59] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 1/75 constraints. Problems are: Problem set: 95 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/1077 variables, and 75 constraints, problems are : Problem set: 95 solved, 570 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/665 constraints, Known Traps: 3/3 constraints]
After SMT, in 41355ms problems are : Problem set: 95 solved, 570 unsolved
Search for dead transitions found 95 dead transitions in 41380ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 410/489 places, 576/745 transitions.
Applied a total of 0 rules in 59 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41631 ms. Remains : 410/489 places, 576/745 transitions.
[2025-06-02 21:08:05] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
// Phase 1: matrix 572 rows 410 cols
[2025-06-02 21:08:05] [INFO ] Computed 77 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[320]
RANDOM walk for 1000000 steps (52125 resets) in 4247 ms. (235 steps per ms)
BEST_FIRST walk for 1000001 steps (5556 resets) in 1001 ms. (998 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[320]
[2025-06-02 21:08:10] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:08:10] [INFO ] Invariant cache hit.
[2025-06-02 21:08:10] [INFO ] [Real]Absence check using 58 positive place invariants in 20 ms returned sat
[2025-06-02 21:08:10] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 12 ms returned sat
[2025-06-02 21:08:10] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2025-06-02 21:08:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:08:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:08:10] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 14 ms returned sat
[2025-06-02 21:08:11] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-06-02 21:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:08:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2025-06-02 21:08:11] [INFO ] Deduced a trap composed of 113 places in 751 ms of which 9 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 3 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 3 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 128 places in 145 ms of which 3 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 143 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:12] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:08:13] [INFO ] Deduced a trap composed of 128 places in 160 ms of which 2 ms to minimize.
[2025-06-02 21:08:13] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:08:13] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:08:13] [INFO ] Deduced a trap composed of 116 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:08:13] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:08:14] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:08:14] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:08:14] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 3 ms to minimize.
[2025-06-02 21:08:14] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 2 ms to minimize.
[2025-06-02 21:08:14] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:08:15] [INFO ] Deduced a trap composed of 119 places in 153 ms of which 3 ms to minimize.
[2025-06-02 21:08:15] [INFO ] Deduced a trap composed of 116 places in 172 ms of which 3 ms to minimize.
[2025-06-02 21:08:15] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:08:15] [INFO ] Deduced a trap composed of 146 places in 225 ms of which 5 ms to minimize.
[2025-06-02 21:08:16] [INFO ] Deduced a trap composed of 116 places in 250 ms of which 4 ms to minimize.
[2025-06-02 21:08:16] [INFO ] Deduced a trap composed of 128 places in 152 ms of which 2 ms to minimize.
[2025-06-02 21:08:16] [INFO ] Deduced a trap composed of 116 places in 148 ms of which 2 ms to minimize.
[2025-06-02 21:08:16] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:08:16] [INFO ] Deduced a trap composed of 116 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:08:17] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:08:17] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:08:18] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 2 ms to minimize.
[2025-06-02 21:08:18] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 2 ms to minimize.
[2025-06-02 21:08:20] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 11 ms to minimize.
[2025-06-02 21:08:20] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 3 ms to minimize.
[2025-06-02 21:08:21] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:08:21] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:08:22] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:08:23] [INFO ] Deduced a trap composed of 135 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:28] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 17150 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[320]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[320]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 18 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 16 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2025-06-02 21:08:28] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:08:28] [INFO ] Invariant cache hit.
[2025-06-02 21:08:28] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-02 21:08:28] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:08:28] [INFO ] Invariant cache hit.
[2025-06-02 21:08:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:08:32] [INFO ] Implicit Places using invariants and state equation in 3408 ms returned []
Implicit Place search using SMT with State Equation took 3906 ms to find 0 implicit places.
[2025-06-02 21:08:32] [INFO ] Redundant transitions in 36 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-02 21:08:32] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:08:32] [INFO ] Invariant cache hit.
[2025-06-02 21:08:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:08:36] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:08:37] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:08:38] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 5 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:08:39] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:08:40] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:08:40] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:08:40] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:08:41] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:08:42] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:08:43] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:08:43] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:08:43] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:08:43] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:43] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:08:49] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:08:49] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:08:49] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:08:50] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2025-06-02 21:08:50] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:08:51] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:08:52] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:08:53] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:08:54] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:08:55] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:55] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:08:55] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 108 places in 144 ms of which 4 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:08:57] [INFO ] Deduced a trap composed of 111 places in 150 ms of which 3 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:08:58] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:08:59] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 3 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:00] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 157 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 85/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:09:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 4 ms to minimize.
[2025-06-02 21:09:13] [INFO ] Deduced a trap composed of 130 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:09:16] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:09:19] [INFO ] Deduced a trap composed of 164 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:09:19] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:20] [INFO ] Deduced a trap composed of 139 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:09:22] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:09:22] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:23] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:24] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 154 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 152 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 152 places in 147 ms of which 3 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:09:27] [INFO ] Deduced a trap composed of 156 places in 143 ms of which 3 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 156 places in 151 ms of which 3 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 150 places in 174 ms of which 2 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 162 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:09:28] [INFO ] Deduced a trap composed of 166 places in 148 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 177 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 105/105 constraints]
After SMT, in 60619ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64596 ms. Remains : 410/410 places, 576/576 transitions.
RANDOM walk for 40000 steps (2070 resets) in 1129 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (224 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (217 resets) in 195 ms. (204 steps per ms) remains 2/2 properties
[2025-06-02 21:09:33] [INFO ] Flatten gal took : 172 ms
[2025-06-02 21:09:33] [INFO ] Flatten gal took : 67 ms
[2025-06-02 21:09:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8938863341129093841.gal : 21 ms
[2025-06-02 21:09:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2715168202444763373.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8938863341129093841.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2715168202444763373.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2715168202444763373.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 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 91
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :91 after 1901
Interrupted probabilistic random walk after 244208 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 2
Probabilistic random walk after 244208 steps, saw 73191 distinct states, run finished after 3011 ms. (steps per millisecond=81 ) properties seen :0
[2025-06-02 21:09:36] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:09:36] [INFO ] Invariant cache hit.
[2025-06-02 21:09:36] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 572/981 variables, 409/486 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 1/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/982 variables, 1/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/982 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 488 constraints, problems are : Problem set: 1 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:09:37] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 149 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 125 places in 195 ms of which 2 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:09:38] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 138 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 140 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:09:39] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 149 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:09:40] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 3 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 132 places in 146 ms of which 4 ms to minimize.
SDD size :1901 after 149300
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:41] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:09:42] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
SMT process timed out in 5548ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-02 21:09:42] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:09:42] [INFO ] Invariant cache hit.
[2025-06-02 21:09:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:09:46] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:09:47] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:09:48] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:09:49] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:09:50] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:09:51] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:09:52] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 2 ms to minimize.
[2025-06-02 21:09:53] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:09:53] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:09:53] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:09:53] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:09:59] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:10:00] [INFO ] Deduced a trap composed of 98 places in 154 ms of which 2 ms to minimize.
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:10:01] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:10:02] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 20738ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 20746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20771 ms. Remains : 410/410 places, 576/576 transitions.
RANDOM walk for 40000 steps (2099 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (210 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 308285 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :0 out of 1
Probabilistic random walk after 308285 steps, saw 92343 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
[2025-06-02 21:10:05] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:10:05] [INFO ] Invariant cache hit.
[2025-06-02 21:10:05] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 572/981 variables, 409/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/982 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/982 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:06] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:10:06] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:10:06] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:10:06] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 149 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 138 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:10:07] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 151 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:10:08] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 132 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 149 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 146 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:09] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 139 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:10:10] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 133 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:11] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:12] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 5 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:13] [INFO ] Deduced a trap composed of 134 places in 122 ms of which 3 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 140 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:14] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 140 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:10:15] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 119 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:16] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 140 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:10:17] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:10:18] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:18] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:10:18] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:10:18] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:18] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:10:19] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:10:19] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:10:19] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:10:19] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:10:19] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 147 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:10:20] [INFO ] Deduced a trap composed of 138 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:10:21] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:10:21] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:21] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:10:21] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 2 ms to minimize.
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:10:22] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:23] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:10:23] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:23] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:23] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:10:23] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:10:24] [INFO ] Flatten gal took : 50 ms
[2025-06-02 21:10:24] [INFO ] Applying decomposition
[2025-06-02 21:10:24] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5908618207682746576.txt' '-o' '/tmp/graph5908618207682746576.bin' '-w' '/tmp/graph5908618207682746576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5908618207682746576.bin' '-l' '-1' '-v' '-w' '/tmp/graph5908618207682746576.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:10:24] [INFO ] Decomposing Gal with order
[2025-06-02 21:10:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:10:24] [INFO ] Removed a total of 634 redundant transitions.
[2025-06-02 21:10:24] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 2 ms to minimize.
[2025-06-02 21:10:24] [INFO ] Flatten gal took : 141 ms
[2025-06-02 21:10:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 22 ms.
[2025-06-02 21:10:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5468710294717951285.gal : 13 ms
[2025-06-02 21:10:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11968497481202967121.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5468710294717951285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11968497481202967121.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11968497481202967121.prop.
[2025-06-02 21:10:24] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 396
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :396 after 414
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :414 after 464
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :464 after 626
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :626 after 654
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :654 after 654
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :654 after 654
Solver is answering 'unknown', stopping.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :654 after 1050
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1050 after 1986
After SMT solving in domain Int declared 409/982 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27383 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 108/108 constraints]
After SMT, in 27761ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 17 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2025-06-02 21:10:33] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:10:33] [INFO ] Invariant cache hit.
[2025-06-02 21:10:34] [INFO ] Implicit Places using invariants in 465 ms returned []
[2025-06-02 21:10:34] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:10:34] [INFO ] Invariant cache hit.
[2025-06-02 21:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:10:37] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned []
Implicit Place search using SMT with State Equation took 3950 ms to find 0 implicit places.
[2025-06-02 21:10:37] [INFO ] Redundant transitions in 6 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-02 21:10:37] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:10:37] [INFO ] Invariant cache hit.
[2025-06-02 21:10:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 7 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:42] [INFO ] Deduced a trap composed of 134 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:10:43] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:44] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:45] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:45] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:10:45] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:45] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1986 after 166032
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:10:46] [INFO ] Deduced a trap composed of 128 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:10:47] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:10:48] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 4 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:49] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:10:55] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 3 ms to minimize.
[2025-06-02 21:10:55] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:55] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:56] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 2 ms to minimize.
[2025-06-02 21:10:56] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:10:57] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:10:57] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:10:58] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 3 ms to minimize.
[2025-06-02 21:10:58] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:10:58] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 114 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:10:59] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 143 places in 144 ms of which 2 ms to minimize.
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:00] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:11:01] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:01] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:11:01] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:03] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:04] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:11:04] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:04] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:11:04] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:11:05] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:11:05] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:11:05] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:05] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:11:05] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:06] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:07] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 157 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 85/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:11:13] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:11:19] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:11:19] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:22] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:11:25] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:11:26] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:28] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:11:29] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 160 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 152 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:33] [INFO ] Deduced a trap composed of 156 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:34] [INFO ] Deduced a trap composed of 156 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:11:34] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:34] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:11:34] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 177 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 105/105 constraints]
After SMT, in 60716ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64702 ms. Remains : 410/410 places, 576/576 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[320]
Starting property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[320]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[320]
[2025-06-02 21:11:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:11:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[320]
RANDOM walk for 10000 steps (521 resets) in 46 ms. (212 steps per ms)
BEST_FIRST walk for 10001 steps (52 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[320]
[2025-06-02 21:11:38] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:11:38] [INFO ] Invariant cache hit.
[2025-06-02 21:11:38] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:38] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 12 ms returned sat
[2025-06-02 21:11:38] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2025-06-02 21:11:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:11:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 10 ms returned sat
[2025-06-02 21:11:38] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 13 ms returned sat
[2025-06-02 21:11:39] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2025-06-02 21:11:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:11:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 32 ms returned sat
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:11:39] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 135 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 140 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:40] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:11:41] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:11:41] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:11:41] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:11:41] [INFO ] Deduced a trap composed of 137 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:11:41] [INFO ] Deduced a trap composed of 137 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 139 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 146 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:11:42] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:11:43] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:11:43] [INFO ] Deduced a trap composed of 116 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:11:43] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:43] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:11:43] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 4649 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[320]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[320]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 14 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-02 21:11:43] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:11:43] [INFO ] Invariant cache hit.
[2025-06-02 21:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:11:48] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:11:48] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:11:48] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:11:49] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:11:50] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:11:51] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:11:51] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:11:51] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:51] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:11:52] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:52] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:11:52] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:11:52] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:11:52] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:11:53] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:11:54] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:11:55] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:01] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:01] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:12:01] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 5 ms to minimize.
[2025-06-02 21:12:02] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2025-06-02 21:12:02] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:12:03] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:04] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 20739ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 20744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20761 ms. Remains : 410/410 places, 576/576 transitions.
[2025-06-02 21:12:04] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:12:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[320]
RANDOM walk for 1000000 steps (52104 resets) in 4188 ms. (238 steps per ms)
BEST_FIRST walk for 1000000 steps (5652 resets) in 1043 ms. (957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[320]
[2025-06-02 21:12:09] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:12:09] [INFO ] Invariant cache hit.
[2025-06-02 21:12:09] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2025-06-02 21:12:09] [INFO ] [Real]Absence check using 58 positive and 19 generalized place invariants in 12 ms returned sat
[2025-06-02 21:12:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 21:12:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:12:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 12 ms returned sat
[2025-06-02 21:12:10] [INFO ] [Nat]Absence check using 58 positive and 19 generalized place invariants in 18 ms returned sat
[2025-06-02 21:12:10] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-06-02 21:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:12:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 3 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:10] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:11] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:12] [INFO ] Deduced a trap composed of 140 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:12] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:12:12] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:12:12] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:12:12] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:12:13] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:12:14] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:12:14] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:12:14] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:14] [INFO ] Deduced a trap composed of 116 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:14] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:12:15] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:15] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:12:15] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:16] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 2 ms to minimize.
[2025-06-02 21:12:16] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:18] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:12:18] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:12:19] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:12:19] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:20] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:12:21] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:21] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:12:21] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:12:26] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 15913 ms
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[320]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[320]
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 13 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2025-06-02 21:12:26] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:12:26] [INFO ] Invariant cache hit.
[2025-06-02 21:12:26] [INFO ] Implicit Places using invariants in 478 ms returned []
[2025-06-02 21:12:26] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:12:26] [INFO ] Invariant cache hit.
[2025-06-02 21:12:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:12:30] [INFO ] Implicit Places using invariants and state equation in 3375 ms returned []
Implicit Place search using SMT with State Equation took 3855 ms to find 0 implicit places.
[2025-06-02 21:12:30] [INFO ] Redundant transitions in 9 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-02 21:12:30] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:12:30] [INFO ] Invariant cache hit.
[2025-06-02 21:12:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:34] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 143 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 134 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 143 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:12:35] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 125 places in 193 ms of which 2 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:36] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:37] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:38] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:12:38] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:38] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:39] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:40] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:41] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:41] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:41] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:12:41] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:47] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:12:47] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:47] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:12:48] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
[2025-06-02 21:12:48] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:49] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:49] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:12:50] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:50] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 3 ms to minimize.
[2025-06-02 21:12:50] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:50] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:51] [INFO ] Deduced a trap composed of 112 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:12:52] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:12:53] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:12:53] [INFO ] Deduced a trap composed of 134 places in 134 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 2 ms to minimize.
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 2 ms to minimize.
[2025-06-02 21:12:55] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:12:56] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:12:56] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:12:56] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:56] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:12:57] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:57] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:12:57] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 4 ms to minimize.
[2025-06-02 21:12:57] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:12:57] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:12:58] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:12:58] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 3 ms to minimize.
[2025-06-02 21:12:58] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:12:58] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:12:58] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 157 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 85/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:13:06] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2025-06-02 21:13:12] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:13:12] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 3 ms to minimize.
[2025-06-02 21:13:14] [INFO ] Deduced a trap composed of 166 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:17] [INFO ] Deduced a trap composed of 164 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:13:18] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:13:19] [INFO ] Deduced a trap composed of 139 places in 119 ms of which 2 ms to minimize.
[2025-06-02 21:13:20] [INFO ] Deduced a trap composed of 137 places in 117 ms of which 2 ms to minimize.
[2025-06-02 21:13:21] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 3 ms to minimize.
[2025-06-02 21:13:21] [INFO ] Deduced a trap composed of 131 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:13:22] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:13:25] [INFO ] Deduced a trap composed of 160 places in 116 ms of which 3 ms to minimize.
[2025-06-02 21:13:25] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 166 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 158 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:13:26] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:13:27] [INFO ] Deduced a trap composed of 160 places in 127 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 177 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 105/105 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60666ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64553 ms. Remains : 410/410 places, 576/576 transitions.
[2025-06-02 21:13:31] [INFO ] Flatten gal took : 63 ms
RANDOM walk for 40002 steps (2059 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
[2025-06-02 21:13:31] [INFO ] Flatten gal took : 57 ms
[2025-06-02 21:13:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13553268625282783735.gal : 18 ms
[2025-06-02 21:13:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6580624997696577519.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13553268625282783735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6580624997696577519.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (215 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (214 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6580624997696577519.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 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 32
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :32 after 91
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :91 after 1901
Interrupted probabilistic random walk after 252660 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 252660 steps, saw 75744 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2025-06-02 21:13:34] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:13:34] [INFO ] Invariant cache hit.
[2025-06-02 21:13:34] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 572/981 variables, 409/486 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 1/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/982 variables, 1/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/982 variables, 0/488 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 488 constraints, problems are : Problem set: 1 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:13:34] [INFO ] Deduced a trap composed of 141 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:13:34] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 149 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:13:35] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 138 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:13:36] [INFO ] Deduced a trap composed of 151 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 149 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:13:37] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 138 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 135 places in 119 ms of which 3 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:13:38] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 133 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:13:39] [INFO ] Deduced a trap composed of 141 places in 122 ms of which 2 ms to minimize.
SMT process timed out in 5464ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Running 570 sub problems to find dead transitions.
[2025-06-02 21:13:39] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:13:39] [INFO ] Invariant cache hit.
[2025-06-02 21:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1901 after 149300
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:13:44] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 3 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 3 ms to minimize.
[2025-06-02 21:13:45] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:46] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:13:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:13:47] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 106 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:48] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:13:49] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:13:50] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:13:51] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:13:56] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:13:56] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:13:57] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:13:58] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2025-06-02 21:13:58] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:13:59] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:13:59] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:13:59] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:14:00] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:14:00] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:14:00] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 2 ms to minimize.
SMT process timed out in 20671ms, After SMT, problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 20676ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20691 ms. Remains : 410/410 places, 576/576 transitions.
RANDOM walk for 40000 steps (2100 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (235 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310650 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 310650 steps, saw 93005 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2025-06-02 21:14:03] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:14:03] [INFO ] Invariant cache hit.
[2025-06-02 21:14:03] [INFO ] State equation strengthened by 1 read => feed constraints.
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 572/981 variables, 409/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/981 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/981 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/982 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/982 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 982/982 variables, and 488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 410/410 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 171/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 213/385 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/409 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 149 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:14:04] [INFO ] Deduced a trap composed of 118 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:05] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 138 places in 120 ms of which 3 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 151 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/409 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:14:06] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 149 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 3 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 135 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:14:07] [INFO ] Deduced a trap composed of 139 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 129 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:08] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/409 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:09] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:10] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:11] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:11] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 3 ms to minimize.
[2025-06-02 21:14:11] [INFO ] Deduced a trap composed of 147 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:11] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:12] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 141 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 138 places in 124 ms of which 4 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 3 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:14:13] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 118 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:14] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 140 places in 131 ms of which 3 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:15] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:16] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:16] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:14:16] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:14:16] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:14:16] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:17] [INFO ] Deduced a trap composed of 131 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:14:17] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:14:17] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:17] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:14:17] [INFO ] Deduced a trap composed of 147 places in 122 ms of which 2 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 2 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 143 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:14:18] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:14:19] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 2 ms to minimize.
[2025-06-02 21:14:19] [INFO ] Deduced a trap composed of 133 places in 119 ms of which 3 ms to minimize.
[2025-06-02 21:14:19] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:14:19] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 146 places in 125 ms of which 3 ms to minimize.
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:14:20] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:14:21] [INFO ] Deduced a trap composed of 140 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:14:21] [INFO ] Flatten gal took : 28 ms
[2025-06-02 21:14:21] [INFO ] Applying decomposition
[2025-06-02 21:14:21] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10184736575575429298.txt' '-o' '/tmp/graph10184736575575429298.bin' '-w' '/tmp/graph10184736575575429298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10184736575575429298.bin' '-l' '-1' '-v' '-w' '/tmp/graph10184736575575429298.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:14:21] [INFO ] Decomposing Gal with order
[2025-06-02 21:14:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:14:21] [INFO ] Removed a total of 697 redundant transitions.
[2025-06-02 21:14:21] [INFO ] Flatten gal took : 103 ms
[2025-06-02 21:14:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 21 ms.
[2025-06-02 21:14:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1634617605514393587.gal : 8 ms
[2025-06-02 21:14:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2929875778081890775.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1634617605514393587.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2929875778081890775.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2929875778081890775.prop.
[2025-06-02 21:14:21] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:14:21] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/982 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25820 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 108/108 constraints]
After SMT, in 26201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 410/410 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 576/576 transitions.
Applied a total of 0 rules in 12 ms. Remains 410 /410 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2025-06-02 21:14:29] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:14:29] [INFO ] Invariant cache hit.
[2025-06-02 21:14:30] [INFO ] Implicit Places using invariants in 468 ms returned []
[2025-06-02 21:14:30] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:14:30] [INFO ] Invariant cache hit.
[2025-06-02 21:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 21:14:33] [INFO ] Implicit Places using invariants and state equation in 3428 ms returned []
Implicit Place search using SMT with State Equation took 3898 ms to find 0 implicit places.
[2025-06-02 21:14:33] [INFO ] Redundant transitions in 8 ms returned []
Running 570 sub problems to find dead transitions.
[2025-06-02 21:14:33] [INFO ] Flow matrix only has 572 transitions (discarded 4 similar events)
[2025-06-02 21:14:33] [INFO ] Invariant cache hit.
[2025-06-02 21:14:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:14:38] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:14:38] [INFO ] Deduced a trap composed of 143 places in 182 ms of which 2 ms to minimize.
[2025-06-02 21:14:38] [INFO ] Deduced a trap composed of 134 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:38] [INFO ] Deduced a trap composed of 143 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:14:38] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 128 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 131 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:39] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:14:40] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:14:41] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:14:41] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 3 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 2 ms to minimize.
[2025-06-02 21:14:42] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 13 ms to minimize.
[2025-06-02 21:14:43] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:44] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:14:44] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2025-06-02 21:14:44] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:44] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 3 ms to minimize.
[2025-06-02 21:14:44] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:14:45] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:14:50] [INFO ] Deduced a trap composed of 134 places in 140 ms of which 2 ms to minimize.
[2025-06-02 21:14:51] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2025-06-02 21:14:51] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:14:52] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 2 ms to minimize.
[2025-06-02 21:14:52] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:14:53] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:14:53] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 2 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 110 places in 133 ms of which 3 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:54] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 2 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:14:55] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2025-06-02 21:14:56] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:14:56] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:14:56] [INFO ] Deduced a trap composed of 123 places in 202 ms of which 2 ms to minimize.
[2025-06-02 21:14:56] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:14:56] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:14:58] [INFO ] Deduced a trap composed of 108 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 2 ms to minimize.
[2025-06-02 21:14:59] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:15:00] [INFO ] Deduced a trap composed of 122 places in 135 ms of which 2 ms to minimize.
[2025-06-02 21:15:00] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:15:00] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:15:00] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:15:01] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:15:01] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:15:01] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:15:01] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 2 ms to minimize.
[2025-06-02 21:15:01] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:15:02] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2025-06-02 21:15:02] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-06-02 21:15:02] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 405/982 variables, and 157 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 85/85 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 85/157 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2025-06-02 21:15:09] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:15:15] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
[2025-06-02 21:15:15] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 2 ms to minimize.
[2025-06-02 21:15:17] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 2 ms to minimize.
[2025-06-02 21:15:20] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:15:21] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:15:22] [INFO ] Deduced a trap composed of 139 places in 128 ms of which 2 ms to minimize.
[2025-06-02 21:15:23] [INFO ] Deduced a trap composed of 137 places in 129 ms of which 3 ms to minimize.
[2025-06-02 21:15:24] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 3 ms to minimize.
[2025-06-02 21:15:24] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 2 ms to minimize.
[2025-06-02 21:15:25] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:15:28] [INFO ] Deduced a trap composed of 160 places in 120 ms of which 2 ms to minimize.
[2025-06-02 21:15:28] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 152 places in 137 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 150 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:15:29] [INFO ] Deduced a trap composed of 164 places in 121 ms of which 2 ms to minimize.
[2025-06-02 21:15:30] [INFO ] Deduced a trap composed of 160 places in 138 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 405/982 variables, and 177 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 14/19 constraints, State Equation: 0/410 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/570 constraints, Known Traps: 105/105 constraints]
After SMT, in 60719ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60726ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64650 ms. Remains : 410/410 places, 576/576 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[320]
Ending property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-09 in 235801 ms.
[2025-06-02 21:15:34] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:15:34] [INFO ] Applying decomposition
[2025-06-02 21:15:34] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3964257198811900673.txt' '-o' '/tmp/graph3964257198811900673.bin' '-w' '/tmp/graph3964257198811900673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3964257198811900673.bin' '-l' '-1' '-v' '-w' '/tmp/graph3964257198811900673.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:15:34] [INFO ] Decomposing Gal with order
[2025-06-02 21:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:15:34] [INFO ] Removed a total of 544 redundant transitions.
[2025-06-02 21:15:34] [INFO ] Flatten gal took : 72 ms
[2025-06-02 21:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 253 labels/synchronizations in 17 ms.
[2025-06-02 21:15:34] [INFO ] Time to serialize gal into /tmp/UpperBounds8978444376411825640.gal : 9 ms
[2025-06-02 21:15:34] [INFO ] Time to serialize properties into /tmp/UpperBounds13710210649759249521.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8978444376411825640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13710210649759249521.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13710210649759249521.prop.
Detected timeout of ITS tools.
[2025-06-02 21:38:20] [INFO ] Flatten gal took : 22 ms
[2025-06-02 21:38:20] [INFO ] Time to serialize gal into /tmp/UpperBounds3740345190982297065.gal : 5 ms
[2025-06-02 21:38:20] [INFO ] Time to serialize properties into /tmp/UpperBounds2536326830814391201.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3740345190982297065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2536326830814391201.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds2536326830814391201.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:46:33] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:46:33] [INFO ] Input system was already deterministic with 576 transitions.
[2025-06-02 21:46:33] [INFO ] Transformed 410 places.
[2025-06-02 21:46:33] [INFO ] Transformed 576 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:47:03] [INFO ] Time to serialize gal into /tmp/UpperBounds18386606603809071108.gal : 3 ms
[2025-06-02 21:47:03] [INFO ] Time to serialize properties into /tmp/UpperBounds17975671023841514588.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18386606603809071108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17975671023841514588.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17975671023841514588.prop.
ITS-tools command line returned an error code 137
Total runtime 2878628 ms.

BK_STOP 1748901317124

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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 gold2024"
echo " Input is PolyORBNT-PT-S05J30, 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 r167-tall-174881266100081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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