Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500229.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 17K Apr 11 16:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 11 16:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 11 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 539K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 717K May 18 16:43 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

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

=== Now, execution of the tool begins

BK_START 1716859820760

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 01:30:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 01:30:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:30:22] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-28 01:30:22] [INFO ] Transformed 614 places.
[2024-05-28 01:30:22] [INFO ] Transformed 1242 transitions.
[2024-05-28 01:30:22] [INFO ] Parsed PT model containing 614 places and 1242 transitions and 5732 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 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, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 01:30:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
// Phase 1: matrix 1098 rows 614 cols
[2024-05-28 01:30:22] [INFO ] Computed 50 invariants in 63 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 10, 0, 0, 1] Max Struct:[8, 8, 3, 1, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 98 ms. (101 steps per ms)
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 140005 steps (34 resets) in 484 ms. (288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[8, 8, 3, 24, +inf, 6, +inf, +inf, +inf, 8, 4, 202, +inf, +inf]
[2024-05-28 01:30:22] [INFO ] Flow matrix only has 1098 transitions (discarded 16 similar events)
[2024-05-28 01:30:22] [INFO ] Invariant cache hit.
[2024-05-28 01:30:23] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned unsat
[2024-05-28 01:30:23] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned unsat
[2024-05-28 01:30:23] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-05-28 01:30:23] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-28 01:30:24] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2024-05-28 01:30:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:30:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 01:30:24] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-28 01:30:25] [INFO ] [Nat]Absence check using state equation in 1251 ms returned sat
[2024-05-28 01:30:25] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:30:26] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 01:30:26] [INFO ] [Nat]Added 96 Read/Feed constraints in 1015 ms returned unknown
[2024-05-28 01:30:26] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 01:30:26] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 16 ms returned sat
[2024-05-28 01:30:27] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-28 01:30:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:30:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 01:30:27] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 15 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Nat]Absence check using state equation in 1585 ms returned unknown
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 11 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 9 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 7 ms returned unsat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 01:30:29] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 16 ms returned sat
[2024-05-28 01:30:30] [INFO ] [Real]Absence check using state equation in 715 ms returned sat
[2024-05-28 01:30:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:30:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 01:30:30] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 15 ms returned sat
[2024-05-28 01:30:31] [INFO ] [Nat]Absence check using state equation in 1339 ms returned unknown
[2024-05-28 01:30:31] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 01:30:31] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 12 ms returned unsat
[2024-05-28 01:30:32] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 01:30:32] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 20 ms returned sat
[2024-05-28 01:30:32] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2024-05-28 01:30:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:30:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 24 ms returned sat
[2024-05-28 01:30:32] [INFO ] [Nat]Absence check using 16 positive and 34 generalized place invariants in 21 ms returned sat
[2024-05-28 01:30:34] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2024-05-28 01:30:34] [INFO ] [Nat]Added 96 Read/Feed constraints in 486 ms returned sat
[2024-05-28 01:30:35] [INFO ] Deduced a trap composed of 19 places in 377 ms of which 31 ms to minimize.
[2024-05-28 01:30:35] [INFO ] Deduced a trap composed of 277 places in 377 ms of which 5 ms to minimize.
[2024-05-28 01:30:35] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:30:36] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-28 01:30:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1339 ms
[2024-05-28 01:30:36] [INFO ] Computed and/alt/rep : 728/2582/720 causal constraints (skipped 376 transitions) in 77 ms.
[2024-05-28 01:30:37] [INFO ] Added : 15 causal constraints over 3 iterations in 1250 ms. Result :unknown
[2024-05-28 01:30:37] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 01:30:37] [INFO ] [Real]Absence check using 16 positive and 34 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 0, 10, 2, 1] Max Struct:[1, 1, 3, 24, 1, 2, 1, 1, 1, 1, 4, 10, +inf, 1]
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1114/1114 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 612 transition count 1044
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 542 transition count 1043
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 541 transition count 1043
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 144 place count 541 transition count 979
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 272 place count 477 transition count 979
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 400 place count 413 transition count 915
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 416 place count 413 transition count 899
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 432 place count 397 transition count 899
Applied a total of 432 rules in 263 ms. Remains 397 /614 variables (removed 217) and now considering 899/1114 (removed 215) transitions.
Running 897 sub problems to find dead transitions.
[2024-05-28 01:30:37] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
// Phase 1: matrix 883 rows 397 cols
[2024-05-28 01:30:37] [INFO ] Computed 48 invariants in 24 ms
[2024-05-28 01:30:37] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 0 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 0 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-28 01:30:45] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 3 ms to minimize.
[2024-05-28 01:30:46] [INFO ] Deduced a trap composed of 65 places in 212 ms of which 2 ms to minimize.
[2024-05-28 01:30:46] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-28 01:30:46] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:30:47] [INFO ] Deduced a trap composed of 134 places in 158 ms of which 3 ms to minimize.
[2024-05-28 01:30:48] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:30:48] [INFO ] Deduced a trap composed of 240 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:30:50] [INFO ] Deduced a trap composed of 219 places in 162 ms of which 3 ms to minimize.
[2024-05-28 01:30:51] [INFO ] Deduced a trap composed of 206 places in 127 ms of which 2 ms to minimize.
[2024-05-28 01:30:51] [INFO ] Deduced a trap composed of 133 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:30:51] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 3 ms to minimize.
[2024-05-28 01:30:52] [INFO ] Deduced a trap composed of 169 places in 158 ms of which 2 ms to minimize.
[2024-05-28 01:30:53] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-05-28 01:30:54] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-28 01:30:59] [INFO ] Deduced a trap composed of 177 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:30:59] [INFO ] Deduced a trap composed of 242 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 395/1280 variables, and 69 constraints, problems are : Problem set: 0 solved, 897 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/397 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 897/897 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 897 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 897 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 23/69 constraints. Problems are: Problem set: 0 solved, 897 unsolved
[2024-05-28 01:31:10] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 3 ms to minimize.
[2024-05-28 01:31:11] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 2 ms to minimize.
[2024-05-28 01:31:11] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 2 ms to minimize.
[2024-05-28 01:31:11] [INFO ] Deduced a trap composed of 147 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:31:11] [INFO ] Deduced a trap composed of 162 places in 154 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 897 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/1280 variables, and 74 constraints, problems are : Problem set: 0 solved, 897 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 32/34 constraints, State Equation: 0/397 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/897 constraints, Known Traps: 28/28 constraints]
After SMT, in 42051ms problems are : Problem set: 0 solved, 897 unsolved
Search for dead transitions found 0 dead transitions in 42079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42364 ms. Remains : 397/614 places, 899/1114 transitions.
[2024-05-28 01:31:19] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 01:44:58] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 01:44:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (434 resets) in 5243 ms. (190 steps per ms)
BEST_FIRST walk for 4000004 steps (777 resets) in 8832 ms. (452 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-05-28 01:45:12] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 01:45:12] [INFO ] Invariant cache hit.
[2024-05-28 01:45:12] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 01:45:12] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-28 01:45:12] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2024-05-28 01:45:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:45:12] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:45:12] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned sat
[2024-05-28 01:45:13] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2024-05-28 01:45:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:45:14] [INFO ] [Nat]Added 96 Read/Feed constraints in 1231 ms returned sat
[2024-05-28 01:45:14] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 96 ms.
[2024-05-28 01:45:14] [INFO ] Added : 20 causal constraints over 4 iterations in 537 ms. Result :sat
Minimization took 4352 ms.
[2024-05-28 01:45:19] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:45:19] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 14 ms returned sat
[2024-05-28 01:45:19] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2024-05-28 01:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:45:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:45:20] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 11 ms returned sat
[2024-05-28 01:45:25] [INFO ] [Nat]Absence check using state equation in 5231 ms returned sat
[2024-05-28 01:45:25] [INFO ] [Nat]Added 96 Read/Feed constraints in 93 ms returned sat
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 7 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:45:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 443 ms
[2024-05-28 01:45:25] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 57 ms.
[2024-05-28 01:45:30] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:45:30] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-28 01:45:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 244 ms
[2024-05-28 01:45:30] [INFO ] Added : 245 causal constraints over 52 iterations in 4920 ms. Result :sat
Minimization took 4550 ms.
[2024-05-28 01:45:35] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:45:35] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 13 ms returned sat
[2024-05-28 01:45:36] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2024-05-28 01:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:45:36] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:45:36] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 17 ms returned sat
[2024-05-28 01:45:47] [INFO ] [Nat]Absence check using state equation in 10835 ms returned unknown
[2024-05-28 01:45:47] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:45:47] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 16 ms returned sat
[2024-05-28 01:45:47] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2024-05-28 01:45:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:45:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:45:47] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 12 ms returned sat
[2024-05-28 01:45:49] [INFO ] [Nat]Absence check using state equation in 1842 ms returned sat
[2024-05-28 01:45:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 341 ms returned sat
[2024-05-28 01:45:50] [INFO ] Computed and/alt/rep : 368/1302/360 causal constraints (skipped 521 transitions) in 64 ms.
[2024-05-28 01:45:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:45:51] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:45:51] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:45:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2024-05-28 01:45:51] [INFO ] Added : 87 causal constraints over 18 iterations in 1801 ms. Result :sat
Minimization took 4162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 21 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 397/397 places, 899/899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 899/899 transitions.
Applied a total of 0 rules in 21 ms. Remains 397 /397 variables (removed 0) and now considering 899/899 (removed 0) transitions.
[2024-05-28 01:45:57] [INFO ] Flow matrix only has 883 transitions (discarded 16 similar events)
[2024-05-28 01:45:57] [INFO ] Invariant cache hit.
[2024-05-28 01:45:57] [INFO ] Implicit Places using invariants in 582 ms returned [71, 117, 189, 197, 269, 312, 335, 342]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 586 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 389/397 places, 899/899 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 383 transition count 893
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 383 transition count 893
Applied a total of 12 rules in 31 ms. Remains 383 /389 variables (removed 6) and now considering 893/899 (removed 6) transitions.
[2024-05-28 01:45:57] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 01:45:57] [INFO ] Computed 40 invariants in 16 ms
[2024-05-28 01:45:58] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-28 01:45:58] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:45:58] [INFO ] Invariant cache hit.
[2024-05-28 01:45:58] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:46:02] [INFO ] Implicit Places using invariants and state equation in 3934 ms returned []
Implicit Place search using SMT with State Equation took 4368 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 383/397 places, 893/899 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5006 ms. Remains : 383/397 places, 893/899 transitions.
[2024-05-28 01:46:02] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 01:46:14] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:46:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
RANDOM walk for 1000000 steps (434 resets) in 4371 ms. (228 steps per ms)
BEST_FIRST walk for 4000003 steps (709 resets) in 8018 ms. (498 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
[2024-05-28 01:46:26] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:46:26] [INFO ] Invariant cache hit.
[2024-05-28 01:46:26] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:46:26] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2024-05-28 01:46:27] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2024-05-28 01:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:46:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:46:27] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 18 ms returned sat
[2024-05-28 01:46:32] [INFO ] [Nat]Absence check using state equation in 5628 ms returned sat
[2024-05-28 01:46:32] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:46:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 327 ms returned sat
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 1 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:46:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 487 ms
[2024-05-28 01:46:33] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 83 ms.
[2024-05-28 01:46:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2024-05-28 01:46:34] [INFO ] Added : 80 causal constraints over 16 iterations in 1102 ms. Result :sat
Minimization took 3176 ms.
[2024-05-28 01:46:38] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:46:38] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-28 01:46:38] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-05-28 01:46:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:46:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 01:46:38] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-28 01:46:41] [INFO ] [Nat]Absence check using state equation in 2530 ms returned sat
[2024-05-28 01:46:41] [INFO ] [Nat]Added 96 Read/Feed constraints in 484 ms returned sat
[2024-05-28 01:46:42] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 2 ms to minimize.
[2024-05-28 01:46:42] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-28 01:46:42] [INFO ] Deduced a trap composed of 184 places in 251 ms of which 4 ms to minimize.
[2024-05-28 01:46:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 898 ms
[2024-05-28 01:46:42] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 64 ms.
[2024-05-28 01:46:43] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 3 ms to minimize.
[2024-05-28 01:46:44] [INFO ] Deduced a trap composed of 168 places in 251 ms of which 3 ms to minimize.
[2024-05-28 01:46:44] [INFO ] Deduced a trap composed of 133 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:46:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1643 ms
[2024-05-28 01:46:45] [INFO ] Added : 58 causal constraints over 12 iterations in 2696 ms. Result :sat
Minimization took 3431 ms.
[2024-05-28 01:46:48] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-28 01:46:48] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 23 ms returned sat
[2024-05-28 01:46:49] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2024-05-28 01:46:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:46:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:46:49] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-28 01:46:50] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2024-05-28 01:46:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 279 ms returned sat
[2024-05-28 01:46:50] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 86 ms.
[2024-05-28 01:46:52] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-05-28 01:46:52] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:46:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2024-05-28 01:46:52] [INFO ] Added : 72 causal constraints over 15 iterations in 2035 ms. Result :sat
Minimization took 3162 ms.
[2024-05-28 01:46:56] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:46:56] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 13 ms returned sat
[2024-05-28 01:46:56] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-28 01:46:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:46:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:46:56] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-28 01:46:58] [INFO ] [Nat]Absence check using state equation in 1774 ms returned sat
[2024-05-28 01:46:58] [INFO ] [Nat]Added 96 Read/Feed constraints in 457 ms returned sat
[2024-05-28 01:46:59] [INFO ] Deduced a trap composed of 155 places in 235 ms of which 3 ms to minimize.
[2024-05-28 01:46:59] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 3 ms to minimize.
[2024-05-28 01:46:59] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 3 ms to minimize.
[2024-05-28 01:46:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 916 ms
[2024-05-28 01:46:59] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 57 ms.
[2024-05-28 01:47:00] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 2 ms to minimize.
[2024-05-28 01:47:01] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:47:01] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:47:01] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:47:01] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-28 01:47:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 584 ms
[2024-05-28 01:47:01] [INFO ] Added : 87 causal constraints over 19 iterations in 1805 ms. Result :sat
Minimization took 3124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2] Max Struct:[3, 24, 4, +inf]
Support contains 11 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 22 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 21 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 01:47:07] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:47:07] [INFO ] Invariant cache hit.
[2024-05-28 01:47:08] [INFO ] Implicit Places using invariants in 528 ms returned []
[2024-05-28 01:47:08] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:47:08] [INFO ] Invariant cache hit.
[2024-05-28 01:47:08] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:47:12] [INFO ] Implicit Places using invariants and state equation in 4111 ms returned []
Implicit Place search using SMT with State Equation took 4643 ms to find 0 implicit places.
[2024-05-28 01:47:12] [INFO ] Redundant transitions in 54 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 01:47:12] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:47:12] [INFO ] Invariant cache hit.
[2024-05-28 01:47:12] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:47:18] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-28 01:47:18] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:47:18] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:47:18] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 0 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 3 ms to minimize.
[2024-05-28 01:47:19] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:47:20] [INFO ] Deduced a trap composed of 134 places in 172 ms of which 3 ms to minimize.
[2024-05-28 01:47:20] [INFO ] Deduced a trap composed of 231 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:47:24] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:47:25] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 2 ms to minimize.
[2024-05-28 01:47:25] [INFO ] Deduced a trap composed of 147 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:47:25] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:47:26] [INFO ] Deduced a trap composed of 174 places in 181 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:47:26] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-28 01:47:32] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 3 ms to minimize.
[2024-05-28 01:47:32] [INFO ] Deduced a trap composed of 181 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:47:32] [INFO ] Deduced a trap composed of 199 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:47:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-28 01:47:51] [INFO ] Deduced a trap composed of 163 places in 230 ms of which 3 ms to minimize.
[2024-05-28 01:47:51] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:47:51] [INFO ] Deduced a trap composed of 163 places in 196 ms of which 2 ms to minimize.
[2024-05-28 01:47:51] [INFO ] Deduced a trap composed of 167 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:47:52] [INFO ] Deduced a trap composed of 199 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:47:52] [INFO ] Deduced a trap composed of 157 places in 162 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 61605ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61616ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66343 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 01:48:13] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (18 resets) in 1035 ms. (38 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 450 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (10 resets) in 326 ms. (122 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 301 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 181 ms. (219 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (9 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 152122 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 7
Probabilistic random walk after 152122 steps, saw 96726 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-28 01:48:30] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:48:30] [INFO ] Invariant cache hit.
[2024-05-28 01:48:30] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-28 01:48:30] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 3 ms to minimize.
[2024-05-28 01:48:30] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 2 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 157 places in 173 ms of which 2 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 01:48:31] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 3 ms to minimize.
[2024-05-28 01:48:32] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 9/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 877/1258 variables, 381/429 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 96/525 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/525 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/1260 variables, 2/527 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 1/528 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1260 variables, 0/528 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 528 constraints, problems are : Problem set: 1 solved, 6 unsolved in 4186 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 9/47 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-28 01:48:34] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 877/1258 variables, 381/430 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 96/526 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 6/532 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1260 variables, and 532 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 381/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 10/10 constraints]
After SMT, in 9211ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 34 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running 891 sub problems to find dead transitions.
[2024-05-28 01:48:39] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:48:39] [INFO ] Invariant cache hit.
[2024-05-28 01:48:39] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 3 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:48:46] [INFO ] Deduced a trap composed of 66 places in 217 ms of which 3 ms to minimize.
[2024-05-28 01:48:47] [INFO ] Deduced a trap composed of 145 places in 198 ms of which 2 ms to minimize.
[2024-05-28 01:48:47] [INFO ] Deduced a trap composed of 134 places in 192 ms of which 2 ms to minimize.
[2024-05-28 01:48:48] [INFO ] Deduced a trap composed of 231 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:48:51] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 3 ms to minimize.
[2024-05-28 01:48:51] [INFO ] Deduced a trap composed of 166 places in 154 ms of which 2 ms to minimize.
[2024-05-28 01:48:52] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 2 ms to minimize.
[2024-05-28 01:48:52] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-28 01:48:52] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 3 ms to minimize.
[2024-05-28 01:48:52] [INFO ] Deduced a trap composed of 180 places in 187 ms of which 3 ms to minimize.
[2024-05-28 01:48:53] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:48:53] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-05-28 01:48:59] [INFO ] Deduced a trap composed of 181 places in 208 ms of which 5 ms to minimize.
[2024-05-28 01:48:59] [INFO ] Deduced a trap composed of 181 places in 187 ms of which 3 ms to minimize.
[2024-05-28 01:48:59] [INFO ] Deduced a trap composed of 199 places in 159 ms of which 3 ms to minimize.
(s227 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 7.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 10.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 2.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 9.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:49:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-28 01:49:07] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 3 ms to minimize.
[2024-05-28 01:49:07] [INFO ] Deduced a trap composed of 172 places in 194 ms of which 3 ms to minimize.
[2024-05-28 01:49:08] [INFO ] Deduced a trap composed of 163 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:49:08] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:49:08] [INFO ] Deduced a trap composed of 199 places in 186 ms of which 3 ms to minimize.
[2024-05-28 01:49:08] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 41561ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 41576ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41614 ms. Remains : 383/383 places, 893/893 transitions.
RANDOM walk for 40000 steps (22 resets) in 460 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 399 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 167509 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 6
Probabilistic random walk after 167509 steps, saw 105790 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 01:49:24] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:49:24] [INFO ] Invariant cache hit.
[2024-05-28 01:49:24] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 01:49:24] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 2 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 1 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-28 01:49:25] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 877/1258 variables, 381/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 96/523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 2/1260 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/1260 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 526 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2398 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 209/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 01:49:27] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 877/1258 variables, 381/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 96/524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 6/530 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1258 variables, 0/530 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1260 variables, 2/532 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1260 variables, 1/533 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-28 01:49:35] [INFO ] Deduced a trap composed of 199 places in 252 ms of which 2 ms to minimize.
[2024-05-28 01:49:35] [INFO ] Deduced a trap composed of 157 places in 182 ms of which 3 ms to minimize.
[2024-05-28 01:49:35] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1260 variables, 3/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1260 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/1260 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 536 constraints, problems are : Problem set: 2 solved, 4 unsolved in 9510 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 11919ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 26373 ms.
Support contains 10 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 383/383 places, 893/893 transitions.
RANDOM walk for 40000 steps (26 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (10 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (12 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (12 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 172809 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 172809 steps, saw 108981 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-28 01:50:06] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:50:06] [INFO ] Invariant cache hit.
[2024-05-28 01:50:06] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 877/1258 variables, 381/420 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1258 variables, 96/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 01:50:07] [INFO ] Deduced a trap composed of 148 places in 233 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/1260 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1260 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 520 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 210/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 3 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 2 ms to minimize.
[2024-05-28 01:50:08] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:50:09] [INFO ] Deduced a trap composed of 157 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:50:09] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:50:09] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/381 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 877/1258 variables, 381/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 96/525 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 4/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1258 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/1260 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1260 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 01:50:43] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 2 ms to minimize.
[2024-05-28 01:50:43] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 2 ms to minimize.
[2024-05-28 01:50:44] [INFO ] Deduced a trap composed of 149 places in 239 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1260 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1260 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 535 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 76601ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 15 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 14 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 01:51:22] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:51:22] [INFO ] Invariant cache hit.
[2024-05-28 01:51:23] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-28 01:51:23] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:51:23] [INFO ] Invariant cache hit.
[2024-05-28 01:51:24] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:51:27] [INFO ] Implicit Places using invariants and state equation in 3933 ms returned []
Implicit Place search using SMT with State Equation took 4410 ms to find 0 implicit places.
[2024-05-28 01:51:27] [INFO ] Redundant transitions in 14 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 01:51:27] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:51:27] [INFO ] Invariant cache hit.
[2024-05-28 01:51:27] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 1 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 3 ms to minimize.
[2024-05-28 01:51:34] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2024-05-28 01:51:35] [INFO ] Deduced a trap composed of 145 places in 215 ms of which 4 ms to minimize.
[2024-05-28 01:51:35] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 3 ms to minimize.
[2024-05-28 01:51:36] [INFO ] Deduced a trap composed of 231 places in 165 ms of which 3 ms to minimize.
[2024-05-28 01:51:39] [INFO ] Deduced a trap composed of 145 places in 203 ms of which 2 ms to minimize.
[2024-05-28 01:51:40] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 2 ms to minimize.
[2024-05-28 01:51:40] [INFO ] Deduced a trap composed of 139 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:51:40] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 3 ms to minimize.
[2024-05-28 01:51:41] [INFO ] Deduced a trap composed of 147 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:51:41] [INFO ] Deduced a trap composed of 180 places in 181 ms of which 2 ms to minimize.
[2024-05-28 01:51:41] [INFO ] Deduced a trap composed of 174 places in 181 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:51:42] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-28 01:51:47] [INFO ] Deduced a trap composed of 181 places in 204 ms of which 2 ms to minimize.
[2024-05-28 01:51:47] [INFO ] Deduced a trap composed of 181 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:51:48] [INFO ] Deduced a trap composed of 199 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:52:01] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-28 01:52:05] [INFO ] Deduced a trap composed of 163 places in 178 ms of which 3 ms to minimize.
[2024-05-28 01:52:05] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 2 ms to minimize.
[2024-05-28 01:52:06] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:52:06] [INFO ] Deduced a trap composed of 167 places in 156 ms of which 3 ms to minimize.
[2024-05-28 01:52:06] [INFO ] Deduced a trap composed of 199 places in 182 ms of which 2 ms to minimize.
[2024-05-28 01:52:06] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 61563ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66015 ms. Remains : 383/383 places, 893/893 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-02 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 2] Max Struct:[24, 4, +inf]
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[24]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[24]
[2024-05-28 01:52:28] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:52:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[24]
RANDOM walk for 10000 steps (6 resets) in 43 ms. (227 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[24]
[2024-05-28 01:52:28] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:52:28] [INFO ] Invariant cache hit.
[2024-05-28 01:52:28] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:52:29] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 01:52:29] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-05-28 01:52:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:52:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:52:29] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2024-05-28 01:52:30] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2024-05-28 01:52:30] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:52:30] [INFO ] [Nat]Added 96 Read/Feed constraints in 318 ms returned sat
[2024-05-28 01:52:31] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 4 ms to minimize.
[2024-05-28 01:52:31] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:52:31] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 2 ms to minimize.
[2024-05-28 01:52:31] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:52:31] [INFO ] Deduced a trap composed of 238 places in 191 ms of which 3 ms to minimize.
[2024-05-28 01:52:32] [INFO ] Deduced a trap composed of 178 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:52:32] [INFO ] Deduced a trap composed of 39 places in 165 ms of which 2 ms to minimize.
[2024-05-28 01:52:32] [INFO ] Deduced a trap composed of 198 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:52:32] [INFO ] Deduced a trap composed of 147 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:52:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1853 ms
[2024-05-28 01:52:32] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 51 ms.
[2024-05-28 01:52:33] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-28 01:52:33] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:52:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2024-05-28 01:52:33] [INFO ] Added : 27 causal constraints over 6 iterations in 749 ms. Result :sat
Minimization took 582 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[24]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[24]
Support contains 8 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 892
Applied a total of 2 rules in 40 ms. Remains 382 /383 variables (removed 1) and now considering 892/893 (removed 1) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 01:52:34] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-05-28 01:52:34] [INFO ] Computed 40 invariants in 11 ms
[2024-05-28 01:52:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:52:40] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-28 01:52:41] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:52:42] [INFO ] Deduced a trap composed of 134 places in 184 ms of which 3 ms to minimize.
[2024-05-28 01:52:43] [INFO ] Deduced a trap composed of 144 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:52:43] [INFO ] Deduced a trap composed of 218 places in 160 ms of which 2 ms to minimize.
[2024-05-28 01:52:46] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 3 ms to minimize.
[2024-05-28 01:52:47] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 3 ms to minimize.
[2024-05-28 01:52:47] [INFO ] Deduced a trap composed of 161 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:52:47] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 2 ms to minimize.
[2024-05-28 01:52:48] [INFO ] Deduced a trap composed of 153 places in 201 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 56 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:52:58] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 57 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 19/19 constraints]
After SMT, in 41491ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 41500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41542 ms. Remains : 382/383 places, 892/893 transitions.
[2024-05-28 01:53:15] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:53:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[24]
RANDOM walk for 1000000 steps (432 resets) in 4272 ms. (234 steps per ms)
BEST_FIRST walk for 1000000 steps (177 resets) in 2185 ms. (457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[24]
[2024-05-28 01:53:22] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:53:22] [INFO ] Invariant cache hit.
[2024-05-28 01:53:22] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:53:22] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-28 01:53:22] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-05-28 01:53:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:53:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 01:53:22] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-28 01:53:23] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2024-05-28 01:53:23] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:53:23] [INFO ] [Nat]Added 96 Read/Feed constraints in 321 ms returned sat
[2024-05-28 01:53:23] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 526 transitions) in 59 ms.
[2024-05-28 01:53:24] [INFO ] Added : 47 causal constraints over 10 iterations in 1113 ms. Result :sat
Minimization took 3624 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[24]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[24]
Support contains 8 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 18 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 17 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 01:53:28] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:53:28] [INFO ] Invariant cache hit.
[2024-05-28 01:53:29] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-28 01:53:29] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:53:29] [INFO ] Invariant cache hit.
[2024-05-28 01:53:29] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:53:34] [INFO ] Implicit Places using invariants and state equation in 5017 ms returned []
Implicit Place search using SMT with State Equation took 5480 ms to find 0 implicit places.
[2024-05-28 01:53:34] [INFO ] Redundant transitions in 28 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 01:53:34] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:53:34] [INFO ] Invariant cache hit.
[2024-05-28 01:53:34] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 1 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-28 01:53:41] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-28 01:53:42] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:53:42] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 2 ms to minimize.
[2024-05-28 01:53:43] [INFO ] Deduced a trap composed of 218 places in 178 ms of which 2 ms to minimize.
[2024-05-28 01:53:46] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:53:46] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 3 ms to minimize.
[2024-05-28 01:53:46] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 2 ms to minimize.
[2024-05-28 01:53:46] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-28 01:53:47] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 2 ms to minimize.
[2024-05-28 01:53:47] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:53:48] [INFO ] Deduced a trap composed of 156 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:53:48] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:53:55] [INFO ] Deduced a trap composed of 158 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:53:55] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 60 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/382 variables, 2/62 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-05-28 01:54:33] [INFO ] Deduced a trap composed of 131 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:54:34] [INFO ] Deduced a trap composed of 146 places in 237 ms of which 3 ms to minimize.
[2024-05-28 01:54:35] [INFO ] Deduced a trap composed of 79 places in 241 ms of which 3 ms to minimize.
[2024-05-28 01:54:35] [INFO ] Deduced a trap composed of 47 places in 201 ms of which 3 ms to minimize.
[2024-05-28 01:54:36] [INFO ] Deduced a trap composed of 147 places in 214 ms of which 3 ms to minimize.
SMT process timed out in 62030ms, After SMT, problems are : Problem set: 88 solved, 802 unsolved
Search for dead transitions found 88 dead transitions in 62046ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/382 places, 804/892 transitions.
Reduce places removed 2 places and 16 transitions.
Graph (complete) has 2376 edges and 380 vertex of which 8 are kept as prefixes of interest. Removing 372 places using SCC suffix rule.2 ms
Discarding 372 places :
Also discarding 780 output transitions
Drop transitions (Output transitions of discarded places.) removed 780 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 8
Reduce places removed 0 places and 8 transitions.
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 8 /382 variables (removed 374) and now considering 0/804 (removed 804) transitions.
[2024-05-28 01:54:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 01:54:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 01:54:36] [INFO ] Invariant cache hit.
[2024-05-28 01:54:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 8/382 places, 0/892 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 67635 ms. Remains : 8/382 places, 0/892 transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-04 in 127414 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-11
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:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2024-05-28 01:54:36] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 01:54:36] [INFO ] Computed 40 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (3 resets) in 52 ms. (188 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 01:54:36] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:54:36] [INFO ] Invariant cache hit.
[2024-05-28 01:54:36] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:54:36] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 01:54:37] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2024-05-28 01:54:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:54:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:54:37] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-28 01:54:38] [INFO ] [Nat]Absence check using state equation in 925 ms returned sat
[2024-05-28 01:54:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:54:38] [INFO ] [Nat]Added 96 Read/Feed constraints in 374 ms returned sat
[2024-05-28 01:54:38] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 66 ms.
[2024-05-28 01:54:40] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-28 01:54:40] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-05-28 01:54:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2024-05-28 01:54:40] [INFO ] Added : 72 causal constraints over 15 iterations in 2387 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 383 transition count 892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 892
Applied a total of 2 rules in 60 ms. Remains 382 /383 variables (removed 1) and now considering 892/893 (removed 1) transitions.
Running 890 sub problems to find dead transitions.
[2024-05-28 01:54:41] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
// Phase 1: matrix 876 rows 382 cols
[2024-05-28 01:54:41] [INFO ] Computed 40 invariants in 11 ms
[2024-05-28 01:54:41] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:54:48] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-05-28 01:54:49] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 3 ms to minimize.
[2024-05-28 01:54:50] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 2 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 144 places in 198 ms of which 3 ms to minimize.
[2024-05-28 01:54:51] [INFO ] Deduced a trap composed of 218 places in 139 ms of which 2 ms to minimize.
[2024-05-28 01:54:54] [INFO ] Deduced a trap composed of 164 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:54:54] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:54:54] [INFO ] Deduced a trap composed of 161 places in 144 ms of which 2 ms to minimize.
[2024-05-28 01:54:55] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 2 ms to minimize.
[2024-05-28 01:54:55] [INFO ] Deduced a trap composed of 153 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:55:03] [INFO ] Deduced a trap composed of 167 places in 164 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 57 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 19/57 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:55:06] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1258 variables, and 58 constraints, problems are : Problem set: 0 solved, 890 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 20/20 constraints]
After SMT, in 41877ms problems are : Problem set: 0 solved, 890 unsolved
Search for dead transitions found 0 dead transitions in 41891ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41957 ms. Remains : 382/383 places, 892/893 transitions.
[2024-05-28 01:55:23] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:55:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (450 resets) in 4208 ms. (237 steps per ms)
BEST_FIRST walk for 1000000 steps (172 resets) in 1819 ms. (549 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2024-05-28 01:55:29] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:55:29] [INFO ] Invariant cache hit.
[2024-05-28 01:55:29] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:55:29] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 01:55:30] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2024-05-28 01:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:55:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-28 01:55:30] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 19 ms returned sat
[2024-05-28 01:55:36] [INFO ] [Nat]Absence check using state equation in 6129 ms returned sat
[2024-05-28 01:55:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:55:36] [INFO ] [Nat]Added 96 Read/Feed constraints in 401 ms returned sat
[2024-05-28 01:55:37] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-05-28 01:55:37] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 2 ms to minimize.
[2024-05-28 01:55:37] [INFO ] Deduced a trap composed of 167 places in 236 ms of which 3 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 194 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 3 ms to minimize.
[2024-05-28 01:55:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1955 ms
[2024-05-28 01:55:38] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 526 transitions) in 48 ms.
[2024-05-28 01:55:40] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-28 01:55:40] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:55:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 266 ms
[2024-05-28 01:55:40] [INFO ] Added : 69 causal constraints over 14 iterations in 2104 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 63 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 382/382 places, 892/892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 892/892 transitions.
Applied a total of 0 rules in 14 ms. Remains 382 /382 variables (removed 0) and now considering 892/892 (removed 0) transitions.
[2024-05-28 01:55:45] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:55:45] [INFO ] Invariant cache hit.
[2024-05-28 01:55:45] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-28 01:55:45] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:55:45] [INFO ] Invariant cache hit.
[2024-05-28 01:55:46] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:55:50] [INFO ] Implicit Places using invariants and state equation in 4849 ms returned []
Implicit Place search using SMT with State Equation took 5318 ms to find 0 implicit places.
[2024-05-28 01:55:50] [INFO ] Redundant transitions in 10 ms returned []
Running 890 sub problems to find dead transitions.
[2024-05-28 01:55:50] [INFO ] Flow matrix only has 876 transitions (discarded 16 similar events)
[2024-05-28 01:55:50] [INFO ] Invariant cache hit.
[2024-05-28 01:55:50] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 39 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 24 ms of which 0 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
[2024-05-28 01:55:57] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-05-28 01:55:58] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 3 ms to minimize.
[2024-05-28 01:55:58] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:55:59] [INFO ] Deduced a trap composed of 218 places in 194 ms of which 3 ms to minimize.
[2024-05-28 01:56:02] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 2 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 149 places in 185 ms of which 5 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 149 places in 191 ms of which 3 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 2 ms to minimize.
[2024-05-28 01:56:03] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 2 ms to minimize.
[2024-05-28 01:56:04] [INFO ] Deduced a trap composed of 126 places in 204 ms of which 3 ms to minimize.
[2024-05-28 01:56:04] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 01:56:05] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 890 unsolved
[2024-05-28 01:56:11] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 2 ms to minimize.
[2024-05-28 01:56:11] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 380/1258 variables, and 60 constraints, problems are : Problem set: 0 solved, 890 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 890/890 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 890 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/380 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 890 unsolved
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/382 variables, 2/62 constraints. Problems are: Problem set: 88 solved, 802 unsolved
[2024-05-28 01:56:51] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/1258 variables, and 63 constraints, problems are : Problem set: 88 solved, 802 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/382 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/890 constraints, Known Traps: 23/23 constraints]
After SMT, in 61434ms problems are : Problem set: 88 solved, 802 unsolved
Search for dead transitions found 88 dead transitions in 61442ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 382/382 places, 804/892 transitions.
Reduce places removed 2 places and 16 transitions.
Graph (complete) has 2376 edges and 380 vertex of which 1 are kept as prefixes of interest. Removing 379 places using SCC suffix rule.1 ms
Discarding 379 places :
Also discarding 787 output transitions
Drop transitions (Output transitions of discarded places.) removed 787 transitions
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1 transition count 1
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 1 /382 variables (removed 381) and now considering 0/804 (removed 804) transitions.
[2024-05-28 01:56:52] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 01:56:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 01:56:52] [INFO ] Invariant cache hit.
[2024-05-28 01:56:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/382 places, 0/892 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 66845 ms. Remains : 1/382 places, 0/892 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-11 in 135982 ms.
Starting property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-28 01:56:52] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
// Phase 1: matrix 877 rows 383 cols
[2024-05-28 01:56:52] [INFO ] Computed 40 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (5 resets) in 64 ms. (153 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 01:56:52] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:56:52] [INFO ] Invariant cache hit.
[2024-05-28 01:56:52] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:56:52] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-28 01:56:52] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-28 01:56:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:56:52] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-28 01:56:52] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 16 ms returned sat
[2024-05-28 01:56:54] [INFO ] [Nat]Absence check using state equation in 1751 ms returned sat
[2024-05-28 01:56:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:56:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 01:56:55] [INFO ] [Nat]Added 96 Read/Feed constraints in 608 ms returned sat
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 184 places in 259 ms of which 2 ms to minimize.
[2024-05-28 01:56:55] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-28 01:56:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 800 ms
[2024-05-28 01:56:56] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 69 ms.
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-28 01:56:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:56:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-05-28 01:56:57] [INFO ] Added : 60 causal constraints over 13 iterations in 1412 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 33 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running 891 sub problems to find dead transitions.
[2024-05-28 01:56:57] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:56:57] [INFO ] Invariant cache hit.
[2024-05-28 01:56:57] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 39 places in 26 ms of which 0 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-28 01:57:05] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:57:06] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-05-28 01:57:06] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 2 ms to minimize.
[2024-05-28 01:57:07] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 2 ms to minimize.
[2024-05-28 01:57:07] [INFO ] Deduced a trap composed of 231 places in 205 ms of which 2 ms to minimize.
[2024-05-28 01:57:10] [INFO ] Deduced a trap composed of 145 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:57:11] [INFO ] Deduced a trap composed of 166 places in 227 ms of which 2 ms to minimize.
[2024-05-28 01:57:11] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 3 ms to minimize.
[2024-05-28 01:57:11] [INFO ] Deduced a trap composed of 123 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:57:12] [INFO ] Deduced a trap composed of 147 places in 215 ms of which 3 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 180 places in 251 ms of which 3 ms to minimize.
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 174 places in 206 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:57:13] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 1 ms to minimize.
[2024-05-28 01:57:19] [INFO ] Deduced a trap composed of 181 places in 211 ms of which 3 ms to minimize.
SMT process timed out in 21906ms, After SMT, problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 21917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21953 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 01:57:19] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 01:57:31] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:57:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (434 resets) in 4909 ms. (203 steps per ms)
BEST_FIRST walk for 1000001 steps (160 resets) in 2080 ms. (480 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 01:57:38] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:57:38] [INFO ] Invariant cache hit.
[2024-05-28 01:57:38] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-28 01:57:38] [INFO ] [Real]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-28 01:57:39] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2024-05-28 01:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:57:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2024-05-28 01:57:39] [INFO ] [Nat]Absence check using 14 positive and 26 generalized place invariants in 12 ms returned sat
[2024-05-28 01:57:40] [INFO ] [Nat]Absence check using state equation in 1641 ms returned sat
[2024-05-28 01:57:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:57:41] [INFO ] [Nat]Added 96 Read/Feed constraints in 454 ms returned sat
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 155 places in 217 ms of which 2 ms to minimize.
[2024-05-28 01:57:41] [INFO ] Deduced a trap composed of 19 places in 229 ms of which 2 ms to minimize.
[2024-05-28 01:57:42] [INFO ] Deduced a trap composed of 169 places in 184 ms of which 2 ms to minimize.
[2024-05-28 01:57:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 873 ms
[2024-05-28 01:57:42] [INFO ] Computed and/alt/rep : 356/1241/348 causal constraints (skipped 527 transitions) in 56 ms.
[2024-05-28 01:57:43] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-28 01:57:43] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 01:57:43] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:57:43] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 01:57:43] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-28 01:57:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 761 ms
[2024-05-28 01:57:44] [INFO ] Added : 87 causal constraints over 19 iterations in 1939 ms. Result :sat
Minimization took 3351 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 12 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 13 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 01:57:48] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:57:48] [INFO ] Invariant cache hit.
[2024-05-28 01:57:48] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-28 01:57:48] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:57:48] [INFO ] Invariant cache hit.
[2024-05-28 01:57:49] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 01:57:52] [INFO ] Implicit Places using invariants and state equation in 4232 ms returned []
Implicit Place search using SMT with State Equation took 4605 ms to find 0 implicit places.
[2024-05-28 01:57:52] [INFO ] Redundant transitions in 10 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 01:57:52] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:57:52] [INFO ] Invariant cache hit.
[2024-05-28 01:57:52] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2024-05-28 01:58:00] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 0 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 66 places in 175 ms of which 3 ms to minimize.
[2024-05-28 01:58:01] [INFO ] Deduced a trap composed of 145 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 134 places in 213 ms of which 3 ms to minimize.
[2024-05-28 01:58:02] [INFO ] Deduced a trap composed of 231 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:58:06] [INFO ] Deduced a trap composed of 145 places in 211 ms of which 3 ms to minimize.
[2024-05-28 01:58:07] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 3 ms to minimize.
[2024-05-28 01:58:07] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 3 ms to minimize.
[2024-05-28 01:58:07] [INFO ] Deduced a trap composed of 123 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:58:08] [INFO ] Deduced a trap composed of 147 places in 206 ms of which 3 ms to minimize.
[2024-05-28 01:58:08] [INFO ] Deduced a trap composed of 180 places in 190 ms of which 2 ms to minimize.
[2024-05-28 01:58:08] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:58:09] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-28 01:58:15] [INFO ] Deduced a trap composed of 181 places in 239 ms of which 2 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 181 places in 206 ms of which 2 ms to minimize.
[2024-05-28 01:58:16] [INFO ] Deduced a trap composed of 199 places in 204 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:58:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-28 01:58:31] [INFO ] Deduced a trap composed of 163 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:31] [INFO ] Deduced a trap composed of 172 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:58:31] [INFO ] Deduced a trap composed of 163 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:58:31] [INFO ] Deduced a trap composed of 167 places in 158 ms of which 2 ms to minimize.
[2024-05-28 01:58:32] [INFO ] Deduced a trap composed of 199 places in 172 ms of which 2 ms to minimize.
[2024-05-28 01:58:32] [INFO ] Deduced a trap composed of 157 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 61819ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61827ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66465 ms. Remains : 383/383 places, 893/893 transitions.
[2024-05-28 01:58:54] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40000 steps (18 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 245300 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 1
Probabilistic random walk after 245300 steps, saw 151780 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-28 01:59:09] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:59:09] [INFO ] Invariant cache hit.
[2024-05-28 01:59:09] [INFO ] State equation strengthened by 96 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) 219/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1258/1260 variables, and 420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 381/383 constraints, ReadFeed: 0/96 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) 219/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:59:10] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-28 01:59:11] [INFO ] Deduced a trap composed of 148 places in 162 ms of which 2 ms to minimize.
[2024-05-28 01:59:12] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 2 ms to minimize.
[2024-05-28 01:59:12] [INFO ] Deduced a trap composed of 161 places in 154 ms of which 3 ms to minimize.
[2024-05-28 01:59:12] [INFO ] Deduced a trap composed of 175 places in 155 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1258/1260 variables, and 430 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2784 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 381/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 3545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 272 ms.
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 17 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running 891 sub problems to find dead transitions.
[2024-05-28 01:59:13] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:59:13] [INFO ] Invariant cache hit.
[2024-05-28 01:59:13] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 2 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
[2024-05-28 01:59:20] [INFO ] Deduced a trap composed of 66 places in 220 ms of which 3 ms to minimize.
[2024-05-28 01:59:21] [INFO ] Deduced a trap composed of 145 places in 216 ms of which 2 ms to minimize.
[2024-05-28 01:59:21] [INFO ] Deduced a trap composed of 134 places in 204 ms of which 2 ms to minimize.
[2024-05-28 01:59:22] [INFO ] Deduced a trap composed of 231 places in 170 ms of which 3 ms to minimize.
[2024-05-28 01:59:25] [INFO ] Deduced a trap composed of 145 places in 201 ms of which 2 ms to minimize.
[2024-05-28 01:59:26] [INFO ] Deduced a trap composed of 166 places in 178 ms of which 3 ms to minimize.
[2024-05-28 01:59:26] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 2 ms to minimize.
[2024-05-28 01:59:26] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 2 ms to minimize.
[2024-05-28 01:59:26] [INFO ] Deduced a trap composed of 147 places in 151 ms of which 2 ms to minimize.
[2024-05-28 01:59:27] [INFO ] Deduced a trap composed of 180 places in 206 ms of which 3 ms to minimize.
[2024-05-28 01:59:27] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:59:27] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2024-05-28 01:59:33] [INFO ] Deduced a trap composed of 181 places in 193 ms of which 2 ms to minimize.
[2024-05-28 01:59:33] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 2 ms to minimize.
[2024-05-28 01:59:33] [INFO ] Deduced a trap composed of 199 places in 159 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 01:59:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-28 01:59:42] [INFO ] Deduced a trap composed of 163 places in 207 ms of which 2 ms to minimize.
[2024-05-28 01:59:42] [INFO ] Deduced a trap composed of 172 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:59:43] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:59:43] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 2 ms to minimize.
[2024-05-28 01:59:43] [INFO ] Deduced a trap composed of 199 places in 176 ms of which 2 ms to minimize.
[2024-05-28 01:59:43] [INFO ] Deduced a trap composed of 157 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 41583ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 41592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41611 ms. Remains : 383/383 places, 893/893 transitions.
RANDOM walk for 40000 steps (17 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254467 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254467 steps, saw 157192 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-28 01:59:58] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 01:59:58] [INFO ] Invariant cache hit.
[2024-05-28 01:59:58] [INFO ] State equation strengthened by 96 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) 219/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/381 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 877/1258 variables, 381/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1258 variables, 96/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1260 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1260 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1260 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1260 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1260/1260 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 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) 219/220 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/283 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/291 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 89/380 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 01:59:59] [INFO ] Deduced a trap composed of 38 places in 192 ms of which 3 ms to minimize.
[2024-05-28 01:59:59] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 38 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 3 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 148 places in 157 ms of which 2 ms to minimize.
[2024-05-28 02:00:00] [INFO ] Deduced a trap composed of 132 places in 184 ms of which 2 ms to minimize.
[2024-05-28 02:00:01] [INFO ] Deduced a trap composed of 161 places in 167 ms of which 2 ms to minimize.
[2024-05-28 02:00:01] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/381 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 877/1258 variables, 381/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1258 variables, 96/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1258 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1258 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1260 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1260 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1260 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1260 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1260/1260 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3362 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 383/383 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 4201ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 17 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 383/383 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 383/383 places, 893/893 transitions.
Applied a total of 0 rules in 17 ms. Remains 383 /383 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-28 02:00:02] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 02:00:02] [INFO ] Invariant cache hit.
[2024-05-28 02:00:03] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-28 02:00:03] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 02:00:03] [INFO ] Invariant cache hit.
[2024-05-28 02:00:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:00:07] [INFO ] Implicit Places using invariants and state equation in 4084 ms returned []
Implicit Place search using SMT with State Equation took 4462 ms to find 0 implicit places.
[2024-05-28 02:00:07] [INFO ] Redundant transitions in 10 ms returned []
Running 891 sub problems to find dead transitions.
[2024-05-28 02:00:07] [INFO ] Flow matrix only has 877 transitions (discarded 16 similar events)
[2024-05-28 02:00:07] [INFO ] Invariant cache hit.
[2024-05-28 02:00:07] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 02:00:13] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 39 places in 29 ms of which 0 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 1 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 39 places in 25 ms of which 0 ms to minimize.
[2024-05-28 02:00:14] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 2 ms to minimize.
[2024-05-28 02:00:15] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 2 ms to minimize.
[2024-05-28 02:00:15] [INFO ] Deduced a trap composed of 134 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:00:15] [INFO ] Deduced a trap composed of 231 places in 165 ms of which 2 ms to minimize.
[2024-05-28 02:00:19] [INFO ] Deduced a trap composed of 145 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:00:19] [INFO ] Deduced a trap composed of 166 places in 156 ms of which 3 ms to minimize.
[2024-05-28 02:00:19] [INFO ] Deduced a trap composed of 139 places in 224 ms of which 2 ms to minimize.
[2024-05-28 02:00:19] [INFO ] Deduced a trap composed of 123 places in 175 ms of which 2 ms to minimize.
[2024-05-28 02:00:20] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 3 ms to minimize.
[2024-05-28 02:00:20] [INFO ] Deduced a trap composed of 180 places in 170 ms of which 5 ms to minimize.
[2024-05-28 02:00:20] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 02:00:21] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-28 02:00:26] [INFO ] Deduced a trap composed of 181 places in 210 ms of which 2 ms to minimize.
[2024-05-28 02:00:27] [INFO ] Deduced a trap composed of 181 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:00:27] [INFO ] Deduced a trap composed of 199 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/1260 variables, and 61 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 891/891 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 891 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/381 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 891 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 891 unsolved
[2024-05-28 02:00:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 2 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 172 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 163 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 2 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 199 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:00:46] [INFO ] Deduced a trap composed of 157 places in 170 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 891 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1260 variables, and 68 constraints, problems are : Problem set: 0 solved, 891 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/383 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/891 constraints, Known Traps: 31/31 constraints]
After SMT, in 61804ms problems are : Problem set: 0 solved, 891 unsolved
Search for dead transitions found 0 dead transitions in 61812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66312 ms. Remains : 383/383 places, 893/893 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for PolyORBLF-PT-S02J04T08-UpperBounds-13 in 256837 ms.
[2024-05-28 02:01:09] [INFO ] Flatten gal took : 148 ms
[2024-05-28 02:01:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-28 02:01:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 383 places, 893 transitions and 4655 arcs took 9 ms.
Total runtime 1847508 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J04T08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/422/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 383
TRANSITIONS: 893
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.000s]


SAVING FILE /home/mcc/execution/422/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2369
MODEL NAME: /home/mcc/execution/422/model
383 places, 893 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PolyORBLF-PT-S02J04T08-UpperBounds-13 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716862531660

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="PolyORBLF-PT-S02J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S02J04T08, 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 r289-tajo-171654445500229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T08.tgz
mv PolyORBLF-PT-S02J04T08 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;