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

About the Execution of ITS-Tools for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 88880.00 0.00 0.00 4 4 4 4 4 4 3 4 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K 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 25K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 284K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K 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 2 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748942074501

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-03 09:14:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 09:14:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 09:14:35] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2025-06-03 09:14:35] [INFO ] Transformed 244 places.
[2025-06-03 09:14:35] [INFO ] Transformed 332 transitions.
[2025-06-03 09:14:35] [INFO ] Found NUPN structural information;
[2025-06-03 09:14:35] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 15
FORMULA Peterson-PT-3-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[48, 12, 48, 48, 12, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[48, 12, 48, 48, 12, 1, 1, 1, 1, 1, 1, 1]
[2025-06-03 09:14:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2025-06-03 09:14:35] [INFO ] Computed 15 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[48, 12, 48, 48, 12, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 67 ms. (147 steps per ms)
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 120 ms. (578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 4, 4, 4, 0, 0] Max Struct:[48, 12, 48, 48, 12, 1, 1]
[2025-06-03 09:14:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2025-06-03 09:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:36] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2025-06-03 09:14:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2025-06-03 09:14:36] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-06-03 09:14:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:14:36] [INFO ] [Real]Added 57 Read/Feed constraints in 16 ms returned sat
[2025-06-03 09:14:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2025-06-03 09:14:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 09:14:36] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-06-03 09:14:36] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:36] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:36] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:37] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:37] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:37] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:37] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 6 ms to minimize.
[2025-06-03 09:14:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 544 ms
[2025-06-03 09:14:37] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:38] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:38] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 9 ms to minimize.
[2025-06-03 09:14:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2025-06-03 09:14:38] [INFO ] Added : 118 causal constraints over 24 iterations in 1248 ms. Result :sat
Minimization took 194 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:38] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Real]Added 57 Read/Feed constraints in 8 ms returned sat
[2025-06-03 09:14:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-03 09:14:39] [INFO ] [Nat]Added 57 Read/Feed constraints in 6 ms returned sat
[2025-06-03 09:14:39] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2025-06-03 09:14:39] [INFO ] Added : 15 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 453 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:40] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Real]Added 57 Read/Feed constraints in 5 ms returned sat
[2025-06-03 09:14:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-03 09:14:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2025-06-03 09:14:40] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-06-03 09:14:40] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:40] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 11 ms to minimize.
[2025-06-03 09:14:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 342 ms
[2025-06-03 09:14:41] [INFO ] Added : 117 causal constraints over 25 iterations in 870 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 4, 4, 4, 0, 0] Max Struct:[48, 4, 4, 4, 4, 1, 1]
FORMULA Peterson-PT-3-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0] Max Struct:[48, 1]
Support contains 49 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 244 transition count 297
Reduce places removed 35 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 71 rules applied. Total rules applied 106 place count 209 transition count 261
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 2 with 36 rules applied. Total rules applied 142 place count 173 transition count 261
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 142 place count 173 transition count 237
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 190 place count 149 transition count 237
Applied a total of 190 rules in 47 ms. Remains 149 /244 variables (removed 95) and now considering 237/332 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 149/244 places, 237/332 transitions.
[2025-06-03 09:14:41] [INFO ] Flow matrix only has 213 transitions (discarded 24 similar events)
// Phase 1: matrix 213 rows 149 cols
[2025-06-03 09:14:41] [INFO ] Computed 15 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0] Max Struct:[48, 1]
RANDOM walk for 1000000 steps (2 resets) in 1495 ms. (668 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1446 ms. (1382 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0] Max Struct:[48, 1]
[2025-06-03 09:14:44] [INFO ] Flow matrix only has 213 transitions (discarded 24 similar events)
[2025-06-03 09:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 09:14:44] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:44] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-06-03 09:14:44] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 09:14:44] [INFO ] [Real]Added 57 Read/Feed constraints in 5 ms returned sat
[2025-06-03 09:14:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2025-06-03 09:14:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-03 09:14:44] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-03 09:14:44] [INFO ] [Nat]Added 57 Read/Feed constraints in 7 ms returned sat
[2025-06-03 09:14:44] [INFO ] Computed and/alt/rep : 188/390/188 causal constraints (skipped 21 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:45] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
[2025-06-03 09:14:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2025-06-03 09:14:45] [INFO ] Added : 53 causal constraints over 12 iterations in 371 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0] Max Struct:[4, 1]
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 149 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place TestAlone_1_1_3) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 235/235 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 148 transition count 213
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 127 transition count 213
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 43 place count 127 transition count 186
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 97 place count 100 transition count 186
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 119 place count 89 transition count 175
Applied a total of 119 rules in 15 ms. Remains 89 /149 variables (removed 60) and now considering 175/235 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 89/149 places, 175/235 transitions.
[2025-06-03 09:14:45] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 89 cols
[2025-06-03 09:14:45] [INFO ] Computed 15 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 888 ms. (1124 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 341 ms. (2923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 09:14:46] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:46] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 09:14:46] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 09:14:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 09:14:46] [INFO ] [Real]Added 56 Read/Feed constraints in 4 ms returned sat
[2025-06-03 09:14:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 09:14:46] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-03 09:14:46] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-06-03 09:14:46] [INFO ] [Nat]Added 56 Read/Feed constraints in 5 ms returned sat
[2025-06-03 09:14:46] [INFO ] Computed and/alt/rep : 127/332/127 causal constraints (skipped 20 transitions) in 7 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:46] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:46] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:46] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:46] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:47] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:47] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 4 ms to minimize.
[2025-06-03 09:14:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 572 ms
[2025-06-03 09:14:47] [INFO ] Added : 67 causal constraints over 14 iterations in 754 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 89/89 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-03 09:14:47] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:47] [INFO ] Implicit Places using invariants in 81 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/89 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 97 ms. Remains : 85/89 places, 175/175 transitions.
[2025-06-03 09:14:47] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2025-06-03 09:14:47] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 913 ms. (1094 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 333 ms. (2994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 09:14:48] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:48] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2025-06-03 09:14:48] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-03 09:14:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 09:14:48] [INFO ] [Real]Added 56 Read/Feed constraints in 12 ms returned sat
[2025-06-03 09:14:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:14:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 09:14:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-03 09:14:48] [INFO ] [Nat]Added 56 Read/Feed constraints in 4 ms returned sat
[2025-06-03 09:14:48] [INFO ] Computed and/alt/rep : 127/332/127 causal constraints (skipped 20 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:49] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:49] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:49] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:49] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2025-06-03 09:14:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 344 ms
[2025-06-03 09:14:49] [INFO ] Added : 36 causal constraints over 8 iterations in 453 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-03 09:14:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-03 09:14:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:14:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-03 09:14:49] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:14:49] [INFO ] Redundant transitions in 8 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-03 09:14:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
[2025-06-03 09:14:49] [INFO ] Invariant cache hit.
[2025-06-03 09:14:49] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 18/112 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:53] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
Problem TDEAD100 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 20/135 constraints. Problems are: Problem set: 1 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:54] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:14:55] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 11/146 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (OVERLAPS) 151/236 variables, 85/231 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 56/287 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/236 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 287 constraints, problems are : Problem set: 1 solved, 170 unsolved in 14810 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 10/94 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 46/140 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/141 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/142 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/146 constraints. Problems are: Problem set: 1 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 151/236 variables, 85/232 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 56/288 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 170/458 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/236 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 458 constraints, problems are : Problem set: 1 solved, 170 unsolved in 23942 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 170/171 constraints, Known Traps: 51/51 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38821ms problems are : Problem set: 1 solved, 170 unsolved
Search for dead transitions found 1 dead transitions in 38829ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 85/85 places, 174/175 transitions.
Applied a total of 0 rules in 11 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:15:28] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39106 ms. Remains : 85/85 places, 174/175 transitions.
[2025-06-03 09:15:28] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
// Phase 1: matrix 150 rows 85 cols
[2025-06-03 09:15:28] [INFO ] Computed 11 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 883 ms. (1131 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 345 ms. (2890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-03 09:15:29] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2025-06-03 09:15:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:15:29] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 09:15:29] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-03 09:15:29] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-03 09:15:29] [INFO ] [Real]Added 55 Read/Feed constraints in 4 ms returned sat
[2025-06-03 09:15:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-03 09:15:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-06-03 09:15:29] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-03 09:15:29] [INFO ] [Nat]Added 55 Read/Feed constraints in 5 ms returned sat
[2025-06-03 09:15:29] [INFO ] Computed and/alt/rep : 126/326/126 causal constraints (skipped 20 transitions) in 9 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:30] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:30] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:30] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:30] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:30] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 3 ms to minimize.
[2025-06-03 09:15:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 351 ms
[2025-06-03 09:15:30] [INFO ] Added : 72 causal constraints over 15 iterations in 520 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-06-03 09:15:30] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2025-06-03 09:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:15:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-03 09:15:30] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2025-06-03 09:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 09:15:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-03 09:15:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 09:15:30] [INFO ] Redundant transitions in 2 ms returned []
Running 170 sub problems to find dead transitions.
[2025-06-03 09:15:30] [INFO ] Flow matrix only has 150 transitions (discarded 24 similar events)
[2025-06-03 09:15:30] [INFO ] Invariant cache hit.
[2025-06-03 09:15:30] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:31] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 17/111 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:34] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:35] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 150/235 variables, 85/230 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 55/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (OVERLAPS) 0/235 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 235/235 variables, and 285 constraints, problems are : Problem set: 0 solved, 170 unsolved in 15197 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 45/139 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:47] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 09:15:47] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (OVERLAPS) 150/235 variables, 85/233 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 55/288 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 170/458 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (OVERLAPS) 0/235 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 235/235 variables, and 458 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16637 ms.
Refiners :[Domain max(s): 85/85 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 85/85 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31860ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 31861ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32076 ms. Remains : 85/85 places, 174/174 transitions.
RANDOM walk for 40000 steps (8 resets) in 827 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
[2025-06-03 09:16:02] [INFO ] Flatten gal took : 78 ms
[2025-06-03 09:16:02] [INFO ] Flatten gal took : 38 ms
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
[2025-06-03 09:16:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4805302160021554509.gal : 8 ms
[2025-06-03 09:16:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10116603873324934355.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4805302160021554509.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10116603873324934355.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10116603873324934355.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 173
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :173 after 318
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :318 after 1282
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1282 after 3757
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3757 after 8898
Finished probabilistic random walk after 63343 steps, run visited all 2 properties in 299 ms. (steps per millisecond=211 )
Probabilistic random walk after 63343 steps, saw 12799 distinct states, run finished after 302 ms. (steps per millisecond=209 ) properties seen :2
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 87645 ms.

BK_STOP 1748942163381

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is Peterson-PT-3, 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 r142-tall-174876812900605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 ;