About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3224.775 | 1001073.00 | 1064225.00 | 237.50 | 2 2 6 1 1 5 1 1 1 1 1 0 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500245.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-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500245
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K 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 601K 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-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716862305321
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-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:11:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 02:11:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:11:47] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-28 02:11:47] [INFO ] Transformed 536 places.
[2024-05-28 02:11:47] [INFO ] Transformed 1064 transitions.
[2024-05-28 02:11:47] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 02:11:47] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-28 02:11:47] [INFO ] Computed 50 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 798, 276, 192, 1, 36, 35, 552, 41, 41, 1, 3, 1, 1, 46, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 85 ms. (116 steps per ms)
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110005 steps (39 resets) in 394 ms. (278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 6, 1, 5, 1, 1, 1, 1, 0, 1] Max Struct:[+inf, 798, 276, 192, 36, 35, 552, 41, 41, 3, 46]
[2024-05-28 02:11:48] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
[2024-05-28 02:11:48] [INFO ] Invariant cache hit.
[2024-05-28 02:11:48] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-28 02:11:48] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 39 ms returned sat
[2024-05-28 02:11:49] [INFO ] [Real]Absence check using state equation in 1078 ms returned sat
[2024-05-28 02:11:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:11:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-28 02:11:49] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2024-05-28 02:11:51] [INFO ] [Nat]Absence check using state equation in 1698 ms returned sat
[2024-05-28 02:11:51] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:11:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:11:52] [INFO ] [Nat]Added 72 Read/Feed constraints in 952 ms returned sat
[2024-05-28 02:11:52] [INFO ] Deduced a trap composed of 15 places in 362 ms of which 41 ms to minimize.
[2024-05-28 02:11:53] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 4 ms to minimize.
[2024-05-28 02:11:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1313 ms
[2024-05-28 02:11:53] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 113 ms.
[2024-05-28 02:11:54] [INFO ] Added : 20 causal constraints over 4 iterations in 884 ms. Result :unknown
[2024-05-28 02:11:54] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-28 02:11:54] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-28 02:11:55] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-05-28 02:11:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:11:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 02:11:55] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-05-28 02:11:56] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-05-28 02:11:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 292 ms returned sat
[2024-05-28 02:11:56] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 4 ms to minimize.
[2024-05-28 02:11:57] [INFO ] Deduced a trap composed of 263 places in 307 ms of which 4 ms to minimize.
[2024-05-28 02:11:57] [INFO ] Deduced a trap composed of 315 places in 304 ms of which 5 ms to minimize.
[2024-05-28 02:11:57] [INFO ] Deduced a trap composed of 283 places in 289 ms of which 4 ms to minimize.
[2024-05-28 02:11:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1644 ms
[2024-05-28 02:11:58] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 86 ms.
[2024-05-28 02:12:00] [INFO ] Added : 95 causal constraints over 19 iterations in 2282 ms. Result :unknown
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned unsat
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:00] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2024-05-28 02:12:01] [INFO ] [Real]Absence check using state equation in 892 ms returned sat
[2024-05-28 02:12:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 02:12:01] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-05-28 02:12:02] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-28 02:12:02] [INFO ] [Nat]Added 72 Read/Feed constraints in 329 ms returned sat
[2024-05-28 02:12:03] [INFO ] Deduced a trap composed of 126 places in 224 ms of which 3 ms to minimize.
[2024-05-28 02:12:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 316 ms
[2024-05-28 02:12:03] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:03] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:12:03] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:03] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2024-05-28 02:12:04] [INFO ] [Real]Absence check using state equation in 1378 ms returned sat
[2024-05-28 02:12:05] [INFO ] [Real]Added 72 Read/Feed constraints in 188 ms returned sat
[2024-05-28 02:12:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 02:12:05] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-05-28 02:12:06] [INFO ] [Nat]Absence check using state equation in 1409 ms returned sat
[2024-05-28 02:12:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:12:07] [INFO ] [Nat]Added 72 Read/Feed constraints in 891 ms returned sat
[2024-05-28 02:12:07] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 3 ms to minimize.
[2024-05-28 02:12:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 334 ms
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 22 ms returned sat
[2024-05-28 02:12:08] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-28 02:12:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-28 02:12:09] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2024-05-28 02:12:09] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-28 02:12:10] [INFO ] [Nat]Added 72 Read/Feed constraints in 404 ms returned sat
[2024-05-28 02:12:10] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 74 ms.
[2024-05-28 02:12:12] [INFO ] Deduced a trap composed of 296 places in 267 ms of which 4 ms to minimize.
[2024-05-28 02:12:12] [INFO ] Deduced a trap composed of 15 places in 337 ms of which 4 ms to minimize.
[2024-05-28 02:12:13] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1379 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 02:12:14] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 02:12:14] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 26 ms returned sat
[2024-05-28 02:12:15] [INFO ] [Real]Absence check using state equation in 1544 ms returned sat
[2024-05-28 02:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:12:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-28 02:12:15] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-28 02:12:17] [INFO ] [Nat]Absence check using state equation in 1489 ms returned sat
[2024-05-28 02:12:17] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:12:17] [INFO ] [Nat]Added 72 Read/Feed constraints in 639 ms returned sat
[2024-05-28 02:12:18] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 4 ms to minimize.
[2024-05-28 02:12:18] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 4 ms to minimize.
[2024-05-28 02:12:19] [INFO ] Deduced a trap composed of 73 places in 293 ms of which 4 ms to minimize.
[2024-05-28 02:12:19] [INFO ] Deduced a trap composed of 265 places in 297 ms of which 4 ms to minimize.
[2024-05-28 02:12:19] [INFO ] Deduced a trap composed of 273 places in 291 ms of which 5 ms to minimize.
[2024-05-28 02:12:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2023 ms
[2024-05-28 02:12:20] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 87 ms.
[2024-05-28 02:12:20] [INFO ] Added : 15 causal constraints over 3 iterations in 728 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 6, 1, 5, 1, 1, 1, 1, 0, 1] Max Struct:[+inf, 798, 6, 1, 5, 1, 1, 1, 1, 3, 46]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 921
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 487 transition count 921
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 487 transition count 861
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 427 transition count 861
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 298 place count 386 transition count 820
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 304 place count 386 transition count 814
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 310 place count 380 transition count 814
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 380 transition count 814
Applied a total of 311 rules in 213 ms. Remains 380 /536 variables (removed 156) and now considering 814/968 (removed 154) transitions.
Running 812 sub problems to find dead transitions.
[2024-05-28 02:12:21] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
// Phase 1: matrix 802 rows 380 cols
[2024-05-28 02:12:22] [INFO ] Computed 48 invariants in 25 ms
[2024-05-28 02:12:22] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 0 ms to minimize.
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2024-05-28 02:12:28] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:12:29] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:12:31] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 4 ms to minimize.
[2024-05-28 02:12:32] [INFO ] Deduced a trap composed of 115 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:12:34] [INFO ] Deduced a trap composed of 137 places in 208 ms of which 3 ms to minimize.
[2024-05-28 02:12:34] [INFO ] Deduced a trap composed of 119 places in 205 ms of which 3 ms to minimize.
[2024-05-28 02:12:35] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 3 ms to minimize.
[2024-05-28 02:12:35] [INFO ] Deduced a trap composed of 145 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:12:35] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 3 ms to minimize.
[2024-05-28 02:12:35] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 3 ms to minimize.
[2024-05-28 02:12:36] [INFO ] Deduced a trap composed of 103 places in 202 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 812 unsolved
[2024-05-28 02:12:37] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
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 378/1182 variables, and 63 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 33/35 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 812/812 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 812 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 812 unsolved
At refinement iteration 4 (OVERLAPS) 2/380 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 812 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/1182 variables, and 65 constraints, problems are : Problem set: 0 solved, 812 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/380 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/812 constraints, Known Traps: 17/17 constraints]
After SMT, in 41477ms problems are : Problem set: 0 solved, 812 unsolved
Search for dead transitions found 0 dead transitions in 41506ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41741 ms. Remains : 380/536 places, 814/968 transitions.
[2024-05-28 02:13:03] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 02:15:11] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 02:15:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
RANDOM walk for 1000000 steps (489 resets) in 4200 ms. (238 steps per ms)
BEST_FIRST walk for 4000003 steps (562 resets) in 7132 ms. (560 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
[2024-05-28 02:15:22] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 02:15:22] [INFO ] Invariant cache hit.
[2024-05-28 02:15:22] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 02:15:22] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-28 02:15:23] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-05-28 02:15:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:15:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 02:15:23] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 17 ms returned sat
[2024-05-28 02:15:23] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2024-05-28 02:15:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:15:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 924 ms returned sat
[2024-05-28 02:15:25] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 3 ms to minimize.
[2024-05-28 02:15:25] [INFO ] Deduced a trap composed of 145 places in 228 ms of which 5 ms to minimize.
[2024-05-28 02:15:25] [INFO ] Deduced a trap composed of 139 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:15:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 944 ms
[2024-05-28 02:15:25] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 70 ms.
[2024-05-28 02:15:29] [INFO ] Added : 121 causal constraints over 25 iterations in 3269 ms. Result :sat
Minimization took 3627 ms.
[2024-05-28 02:15:32] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:15:32] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 26 ms returned sat
[2024-05-28 02:15:33] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2024-05-28 02:15:33] [INFO ] [Real]Added 72 Read/Feed constraints in 112 ms returned sat
[2024-05-28 02:15:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:15:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:15:33] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 22 ms returned sat
[2024-05-28 02:15:34] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-28 02:15:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 202 ms returned sat
[2024-05-28 02:15:34] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
[2024-05-28 02:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2024-05-28 02:15:35] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 69 ms.
[2024-05-28 02:15:36] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:15:37] [INFO ] Deduced a trap composed of 138 places in 247 ms of which 4 ms to minimize.
[2024-05-28 02:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1473 ms
[2024-05-28 02:15:38] [INFO ] Added : 64 causal constraints over 13 iterations in 3037 ms. Result :sat
Minimization took 3138 ms.
[2024-05-28 02:15:41] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:15:41] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 22 ms returned sat
[2024-05-28 02:15:42] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2024-05-28 02:15:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:15:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:15:42] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 21 ms returned sat
[2024-05-28 02:15:42] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2024-05-28 02:15:46] [INFO ] [Nat]Added 72 Read/Feed constraints in 4028 ms returned sat
[2024-05-28 02:15:47] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 3 ms to minimize.
[2024-05-28 02:15:47] [INFO ] Deduced a trap composed of 114 places in 226 ms of which 3 ms to minimize.
[2024-05-28 02:15:47] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 2 ms to minimize.
[2024-05-28 02:15:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1372 ms
[2024-05-28 02:15:48] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 54 ms.
[2024-05-28 02:15:49] [INFO ] Added : 100 causal constraints over 20 iterations in 1668 ms. Result :sat
Minimization took 2984 ms.
[2024-05-28 02:15:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:15:53] [INFO ] [Real]Absence check using 13 positive and 35 generalized place invariants in 29 ms returned sat
[2024-05-28 02:15:53] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2024-05-28 02:15:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:15:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-28 02:15:53] [INFO ] [Nat]Absence check using 13 positive and 35 generalized place invariants in 13 ms returned sat
[2024-05-28 02:15:54] [INFO ] [Nat]Absence check using state equation in 673 ms returned sat
[2024-05-28 02:15:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 246 ms returned sat
[2024-05-28 02:15:54] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-05-28 02:15:54] [INFO ] Computed and/alt/rep : 464/2052/458 causal constraints (skipped 342 transitions) in 55 ms.
[2024-05-28 02:15:57] [INFO ] Added : 235 causal constraints over 47 iterations in 3266 ms. Result :sat
Minimization took 3795 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 814/814 transitions.
Applied a total of 0 rules in 21 ms. Remains 380 /380 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 380/380 places, 814/814 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 380/380 places, 814/814 transitions.
Applied a total of 0 rules in 20 ms. Remains 380 /380 variables (removed 0) and now considering 814/814 (removed 0) transitions.
[2024-05-28 02:16:04] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
[2024-05-28 02:16:04] [INFO ] Invariant cache hit.
[2024-05-28 02:16:04] [INFO ] Implicit Places using invariants in 485 ms returned [74, 82, 169, 180, 217, 355]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 495 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 374/380 places, 814/814 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 371 transition count 811
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 371 transition count 811
Applied a total of 6 rules in 67 ms. Remains 371 /374 variables (removed 3) and now considering 811/814 (removed 3) transitions.
[2024-05-28 02:16:04] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 02:16:04] [INFO ] Computed 42 invariants in 26 ms
[2024-05-28 02:16:05] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 02:16:05] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:16:05] [INFO ] Invariant cache hit.
[2024-05-28 02:16:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:16:09] [INFO ] Implicit Places using invariants and state equation in 4009 ms returned []
Implicit Place search using SMT with State Equation took 4424 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 371/380 places, 811/814 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5008 ms. Remains : 371/380 places, 811/814 transitions.
[2024-05-28 02:16:09] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 02:16:22] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:16:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
RANDOM walk for 1000000 steps (440 resets) in 3924 ms. (254 steps per ms)
BEST_FIRST walk for 4000002 steps (532 resets) in 6305 ms. (634 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
[2024-05-28 02:16:33] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:16:33] [INFO ] Invariant cache hit.
[2024-05-28 02:16:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:33] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 02:16:33] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2024-05-28 02:16:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:16:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:33] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 02:16:34] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2024-05-28 02:16:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:16:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 398 ms returned sat
[2024-05-28 02:16:35] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:16:35] [INFO ] Deduced a trap composed of 114 places in 230 ms of which 2 ms to minimize.
[2024-05-28 02:16:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 647 ms
[2024-05-28 02:16:35] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 73 ms.
[2024-05-28 02:16:36] [INFO ] Added : 57 causal constraints over 12 iterations in 1130 ms. Result :sat
Minimization took 2350 ms.
[2024-05-28 02:16:39] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:39] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 02:16:39] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2024-05-28 02:16:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:16:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:39] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 02:16:40] [INFO ] [Nat]Absence check using state equation in 1044 ms returned sat
[2024-05-28 02:16:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 109 ms returned sat
[2024-05-28 02:16:41] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 3 ms to minimize.
[2024-05-28 02:16:41] [INFO ] Deduced a trap composed of 123 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:16:41] [INFO ] Deduced a trap composed of 135 places in 196 ms of which 3 ms to minimize.
[2024-05-28 02:16:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 834 ms
[2024-05-28 02:16:41] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 57 ms.
[2024-05-28 02:16:43] [INFO ] Added : 87 causal constraints over 18 iterations in 1906 ms. Result :sat
Minimization took 2806 ms.
[2024-05-28 02:16:46] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:46] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 02:16:46] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-28 02:16:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:16:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:16:47] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 19 ms returned sat
[2024-05-28 02:16:50] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2024-05-28 02:16:50] [INFO ] [Nat]Added 72 Read/Feed constraints in 581 ms returned sat
[2024-05-28 02:16:50] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 56 ms.
[2024-05-28 02:16:51] [INFO ] Deduced a trap composed of 177 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:16:52] [INFO ] Deduced a trap composed of 185 places in 228 ms of which 2 ms to minimize.
[2024-05-28 02:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 5062 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 02:17:32] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 02:17:32] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 20 ms returned sat
[2024-05-28 02:17:32] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2024-05-28 02:17:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:17:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-28 02:17:33] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 29 ms returned sat
[2024-05-28 02:17:34] [INFO ] [Nat]Absence check using state equation in 1003 ms returned sat
[2024-05-28 02:17:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 435 ms returned sat
[2024-05-28 02:17:34] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:17:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-05-28 02:17:34] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 88 ms.
[2024-05-28 02:17:37] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 3 ms to minimize.
[2024-05-28 02:17:37] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:17:37] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 2 ms to minimize.
[2024-05-28 02:17:37] [INFO ] Deduced a trap composed of 124 places in 204 ms of which 2 ms to minimize.
[2024-05-28 02:17:38] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 12 ms to minimize.
[2024-05-28 02:17:38] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:17:39] [INFO ] Deduced a trap composed of 132 places in 245 ms of which 2 ms to minimize.
[2024-05-28 02:17:39] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:17:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3448 ms
[2024-05-28 02:17:40] [INFO ] Added : 197 causal constraints over 40 iterations in 5996 ms. Result :sat
Minimization took 2516 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 0, 1] Max Struct:[+inf, 798, 3, 46]
Support contains 14 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Applied a total of 0 rules in 19 ms. Remains 371 /371 variables (removed 0) and now considering 811/811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 371/371 places, 811/811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Applied a total of 0 rules in 18 ms. Remains 371 /371 variables (removed 0) and now considering 811/811 (removed 0) transitions.
[2024-05-28 02:17:45] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:17:45] [INFO ] Invariant cache hit.
[2024-05-28 02:17:46] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-28 02:17:46] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:17:46] [INFO ] Invariant cache hit.
[2024-05-28 02:17:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:17:49] [INFO ] Implicit Places using invariants and state equation in 3654 ms returned []
Implicit Place search using SMT with State Equation took 4072 ms to find 0 implicit places.
[2024-05-28 02:17:50] [INFO ] Redundant transitions in 83 ms returned []
Running 809 sub problems to find dead transitions.
[2024-05-28 02:17:50] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:17:50] [INFO ] Invariant cache hit.
[2024-05-28 02:17:50] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 02:17:55] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-05-28 02:17:55] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-28 02:17:55] [INFO ] Deduced a trap composed of 48 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:17:56] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-28 02:17:56] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:17:56] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2024-05-28 02:17:56] [INFO ] Deduced a trap composed of 115 places in 239 ms of which 3 ms to minimize.
[2024-05-28 02:17:58] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-28 02:18:00] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:18:00] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 3 ms to minimize.
[2024-05-28 02:18:00] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 3 ms to minimize.
[2024-05-28 02:18:03] [INFO ] Deduced a trap composed of 133 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:18:03] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 3 ms to minimize.
[2024-05-28 02:18:03] [INFO ] Deduced a trap composed of 115 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:18:03] [INFO ] Deduced a trap composed of 142 places in 183 ms of which 3 ms to minimize.
[2024-05-28 02:18:03] [INFO ] Deduced a trap composed of 132 places in 187 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 2 ms to minimize.
[2024-05-28 02:18:11] [INFO ] Deduced a trap composed of 130 places in 221 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 02:18:18] [INFO ] Deduced a trap composed of 119 places in 171 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/1170 variables, and 59 constraints, problems are : Problem set: 0 solved, 809 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/371 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 809/809 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 809 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/369 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/369 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 809 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 809 unsolved
[2024-05-28 02:18:28] [INFO ] Deduced a trap composed of 122 places in 207 ms of which 2 ms to minimize.
[2024-05-28 02:18:32] [INFO ] Deduced a trap composed of 218 places in 175 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 809 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/1170 variables, and 61 constraints, problems are : Problem set: 0 solved, 809 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/27 constraints, State Equation: 0/371 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/809 constraints, Known Traps: 21/21 constraints]
After SMT, in 61216ms problems are : Problem set: 0 solved, 809 unsolved
Search for dead transitions found 0 dead transitions in 61227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65419 ms. Remains : 371/371 places, 811/811 transitions.
[2024-05-28 02:18:51] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
RANDOM walk for 40001 steps (22 resets) in 1173 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (10 resets) in 269 ms. (148 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (10 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 259 ms. (153 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 134680 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 7
Probabilistic random walk after 134680 steps, saw 79635 distinct states, run finished after 3014 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 02:19:08] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:19:08] [INFO ] Invariant cache hit.
[2024-05-28 02:19:08] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 277/291 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MAX3 is UNSAT
At refinement iteration 3 (OVERLAPS) 22/313 variables, 13/25 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 02:19:09] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 1/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 55/368 variables, 15/41 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 0/41 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/369 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 799/1168 variables, 369/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1168 variables, 72/483 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1168 variables, 0/483 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 2/1170 variables, 2/485 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1170 variables, 1/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1170 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1170 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1170/1170 variables, and 486 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2386 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 371/371 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 277/291 variables, 12/12 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/291 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 22/313 variables, 13/26 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 02:19:11] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 2 ms to minimize.
[2024-05-28 02:19:11] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 2/28 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 55/368 variables, 15/43 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-28 02:19:12] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-28 02:19:12] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:19:12] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-28 02:19:12] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:19:12] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 5/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/369 variables, 1/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/49 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 799/1168 variables, 369/418 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1168 variables, 72/490 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem MAX2 is UNSAT
Problem MIN2 is UNSAT
Problem MIN3 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1168 variables, 5/495 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1168 variables, 0/495 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/1170 variables, 2/497 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1170 variables, 1/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1170 variables, 0/498 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1170/1170 variables, and 498 constraints, problems are : Problem set: 5 solved, 2 unsolved in 3989 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 371/371 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 6402ms problems are : Problem set: 5 solved, 2 unsolved
Parikh walk visited 0 properties in 1132 ms.
Support contains 12 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 369 transition count 809
Applied a total of 4 rules in 42 ms. Remains 369 /371 variables (removed 2) and now considering 809/811 (removed 2) transitions.
Running 807 sub problems to find dead transitions.
[2024-05-28 02:19:16] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
// Phase 1: matrix 797 rows 369 cols
[2024-05-28 02:19:16] [INFO ] Computed 42 invariants in 11 ms
[2024-05-28 02:19:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 5 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 2 ms to minimize.
[2024-05-28 02:19:22] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:19:23] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:19:23] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:19:26] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:19:26] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 2 ms to minimize.
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 114 places in 225 ms of which 3 ms to minimize.
[2024-05-28 02:19:27] [INFO ] Deduced a trap composed of 133 places in 227 ms of which 4 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 132 places in 191 ms of which 3 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 143 places in 190 ms of which 2 ms to minimize.
[2024-05-28 02:19:29] [INFO ] Deduced a trap composed of 137 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 135 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:19:30] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 807 unsolved
SMT process timed out in 21476ms, After SMT, problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 21492ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21538 ms. Remains : 369/371 places, 809/811 transitions.
RANDOM walk for 40000 steps (17 resets) in 327 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (12 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 178319 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 178319 steps, saw 103637 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-28 02:19:41] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 02:19:41] [INFO ] Invariant cache hit.
[2024-05-28 02:19:41] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 276/288 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/320 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/367 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 797/1164 variables, 367/408 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1164 variables, 72/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/1166 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1166 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1166 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1166 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1166/1166 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/369 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 276/288 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/320 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 47/367 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 02:19:42] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:19:42] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:19:42] [INFO ] Deduced a trap composed of 48 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 797/1164 variables, 367/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1164 variables, 72/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 2/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 02:19:45] [INFO ] Deduced a trap composed of 147 places in 212 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/1166 variables, 2/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 02:19:45] [INFO ] Deduced a trap composed of 138 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:19:46] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 2/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1166 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1166 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1166/1166 variables, and 491 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4516 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 369/369 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 5538ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 554 ms.
Support contains 12 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 31 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 369/369 places, 809/809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 809/809 transitions.
Applied a total of 0 rules in 25 ms. Remains 369 /369 variables (removed 0) and now considering 809/809 (removed 0) transitions.
[2024-05-28 02:19:47] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 02:19:47] [INFO ] Invariant cache hit.
[2024-05-28 02:19:47] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-28 02:19:47] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 02:19:47] [INFO ] Invariant cache hit.
[2024-05-28 02:19:48] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:19:51] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 3799 ms to find 0 implicit places.
[2024-05-28 02:19:51] [INFO ] Redundant transitions in 22 ms returned []
Running 807 sub problems to find dead transitions.
[2024-05-28 02:19:51] [INFO ] Flow matrix only has 797 transitions (discarded 12 similar events)
[2024-05-28 02:19:51] [INFO ] Invariant cache hit.
[2024-05-28 02:19:51] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 3 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 2 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 47 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:19:57] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:19:58] [INFO ] Deduced a trap composed of 114 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:20:01] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 2 ms to minimize.
[2024-05-28 02:20:01] [INFO ] Deduced a trap composed of 56 places in 220 ms of which 2 ms to minimize.
[2024-05-28 02:20:01] [INFO ] Deduced a trap composed of 136 places in 213 ms of which 3 ms to minimize.
[2024-05-28 02:20:02] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 2 ms to minimize.
[2024-05-28 02:20:02] [INFO ] Deduced a trap composed of 120 places in 211 ms of which 3 ms to minimize.
[2024-05-28 02:20:03] [INFO ] Deduced a trap composed of 132 places in 200 ms of which 3 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 143 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 137 places in 185 ms of which 2 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 3 ms to minimize.
[2024-05-28 02:20:04] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 3 ms to minimize.
[2024-05-28 02:20:05] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/367 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 807 unsolved
[2024-05-28 02:20:09] [INFO ] Deduced a trap composed of 258 places in 198 ms of which 3 ms to minimize.
[2024-05-28 02:20:09] [INFO ] Deduced a trap composed of 237 places in 167 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/367 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 807 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/367 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 807 unsolved
SMT process timed out in 31020ms, After SMT, problems are : Problem set: 0 solved, 807 unsolved
Search for dead transitions found 0 dead transitions in 31028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34886 ms. Remains : 369/369 places, 809/809 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 369 transition count 797
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 24 place count 369 transition count 785
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 369 transition count 779
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 363 transition count 779
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 363 transition count 773
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 357 transition count 773
Applied a total of 48 rules in 73 ms. Remains 357 /369 variables (removed 12) and now considering 773/809 (removed 36) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 773 rows 357 cols
[2024-05-28 02:20:22] [INFO ] Computed 42 invariants in 19 ms
[2024-05-28 02:20:22] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2024-05-28 02:20:22] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-28 02:20:22] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-28 02:20:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-28 02:20:22] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-28 02:20:24] [INFO ] After 1597ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-28 02:20:27] [INFO ] Deduced a trap composed of 147 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:20:28] [INFO ] Deduced a trap composed of 143 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:20:29] [INFO ] Deduced a trap composed of 136 places in 217 ms of which 3 ms to minimize.
[2024-05-28 02:20:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1635 ms
TRAPS : Iteration 1
[2024-05-28 02:20:30] [INFO ] After 8024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-28 02:20:31] [INFO ] After 9207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 9421 ms.
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-11 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[2, 2] Max Struct:[+inf, 798]
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-00
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 02:20:31] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 02:20:31] [INFO ] Computed 42 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (7 resets) in 74 ms. (133 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 28 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 02:20:31] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:20:31] [INFO ] Invariant cache hit.
[2024-05-28 02:20:31] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:20:31] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 02:20:32] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-28 02:20:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:20:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:20:32] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 02:20:33] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2024-05-28 02:20:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:20:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 407 ms returned sat
[2024-05-28 02:20:34] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 3 ms to minimize.
[2024-05-28 02:20:34] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:20:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 717 ms
[2024-05-28 02:20:34] [INFO ] Computed and/alt/rep : 461/2048/455 causal constraints (skipped 342 transitions) in 89 ms.
[2024-05-28 02:20:35] [INFO ] Added : 57 causal constraints over 12 iterations in 1107 ms. Result :sat
Minimization took 575 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 6 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 371 transition count 805
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 365 transition count 805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 363 transition count 803
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 363 transition count 797
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 357 transition count 797
Applied a total of 28 rules in 79 ms. Remains 357 /371 variables (removed 14) and now considering 797/811 (removed 14) transitions.
Running 795 sub problems to find dead transitions.
[2024-05-28 02:20:36] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
// Phase 1: matrix 785 rows 357 cols
[2024-05-28 02:20:36] [INFO ] Computed 42 invariants in 15 ms
[2024-05-28 02:20:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 2 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 2 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-28 02:20:42] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 2 ms to minimize.
[2024-05-28 02:20:45] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-28 02:20:45] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:20:46] [INFO ] Deduced a trap composed of 218 places in 192 ms of which 2 ms to minimize.
[2024-05-28 02:20:47] [INFO ] Deduced a trap composed of 114 places in 188 ms of which 2 ms to minimize.
[2024-05-28 02:20:47] [INFO ] Deduced a trap composed of 133 places in 180 ms of which 3 ms to minimize.
[2024-05-28 02:20:48] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:20:48] [INFO ] Deduced a trap composed of 139 places in 190 ms of which 2 ms to minimize.
[2024-05-28 02:20:48] [INFO ] Deduced a trap composed of 129 places in 197 ms of which 3 ms to minimize.
[2024-05-28 02:20:49] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 02:20:55] [INFO ] Deduced a trap composed of 146 places in 191 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1142 variables, and 57 constraints, problems are : Problem set: 0 solved, 795 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1142 variables, and 57 constraints, problems are : Problem set: 0 solved, 795 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 17/17 constraints]
After SMT, in 41233ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 41247ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41330 ms. Remains : 357/371 places, 797/811 transitions.
[2024-05-28 02:21:17] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 02:23:39] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 02:23:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (542 resets) in 3766 ms. (265 steps per ms)
BEST_FIRST walk for 1000001 steps (229 resets) in 1651 ms. (605 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-28 02:23:44] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 02:23:44] [INFO ] Invariant cache hit.
[2024-05-28 02:23:44] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:23:44] [INFO ] [Real]Absence check using 16 positive and 26 generalized place invariants in 21 ms returned sat
[2024-05-28 02:23:45] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-28 02:23:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:23:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 02:23:45] [INFO ] [Nat]Absence check using 16 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-28 02:23:46] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2024-05-28 02:23:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:23:46] [INFO ] [Nat]Added 72 Read/Feed constraints in 435 ms returned sat
[2024-05-28 02:23:46] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 3 ms to minimize.
[2024-05-28 02:23:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2024-05-28 02:23:46] [INFO ] Computed and/alt/rep : 447/1992/441 causal constraints (skipped 342 transitions) in 61 ms.
[2024-05-28 02:23:48] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:23:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-28 02:23:49] [INFO ] Added : 105 causal constraints over 22 iterations in 2087 ms. Result :sat
Minimization took 4442 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 6 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 33 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 357/357 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 797/797 transitions.
Applied a total of 0 rules in 26 ms. Remains 357 /357 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2024-05-28 02:23:54] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 02:23:54] [INFO ] Invariant cache hit.
[2024-05-28 02:23:54] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-28 02:23:54] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 02:23:54] [INFO ] Invariant cache hit.
[2024-05-28 02:23:55] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:23:58] [INFO ] Implicit Places using invariants and state equation in 3591 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2024-05-28 02:23:58] [INFO ] Redundant transitions in 15 ms returned []
Running 795 sub problems to find dead transitions.
[2024-05-28 02:23:58] [INFO ] Flow matrix only has 785 transitions (discarded 12 similar events)
[2024-05-28 02:23:58] [INFO ] Invariant cache hit.
[2024-05-28 02:23:58] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 2 ms to minimize.
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 46 places in 33 ms of which 1 ms to minimize.
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:24:04] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:24:07] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 3 ms to minimize.
[2024-05-28 02:24:07] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 3 ms to minimize.
[2024-05-28 02:24:09] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-28 02:24:09] [INFO ] Deduced a trap composed of 109 places in 186 ms of which 3 ms to minimize.
[2024-05-28 02:24:10] [INFO ] Deduced a trap composed of 114 places in 195 ms of which 3 ms to minimize.
[2024-05-28 02:24:10] [INFO ] Deduced a trap composed of 120 places in 178 ms of which 3 ms to minimize.
[2024-05-28 02:24:10] [INFO ] Deduced a trap composed of 143 places in 223 ms of which 2 ms to minimize.
[2024-05-28 02:24:10] [INFO ] Deduced a trap composed of 150 places in 190 ms of which 2 ms to minimize.
[2024-05-28 02:24:11] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-28 02:24:11] [INFO ] Deduced a trap composed of 136 places in 181 ms of which 3 ms to minimize.
[2024-05-28 02:24:11] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 02:24:13] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-28 02:24:18] [INFO ] Deduced a trap composed of 133 places in 195 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-28 02:24:26] [INFO ] Deduced a trap composed of 210 places in 194 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 795 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 355/1142 variables, and 60 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 24/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 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 TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/357 variables, 2/62 constraints. Problems are: Problem set: 66 solved, 729 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/1142 variables, and 62 constraints, problems are : Problem set: 66 solved, 729 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/357 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/795 constraints, Known Traps: 20/20 constraints]
After SMT, in 61461ms problems are : Problem set: 66 solved, 729 unsolved
Search for dead transitions found 66 dead transitions in 61473ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/357 places, 731/797 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 355 transition count 719
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 343 transition count 707
Applied a total of 14 rules in 14 ms. Remains 343 /357 variables (removed 14) and now considering 707/731 (removed 24) transitions.
[2024-05-28 02:24:59] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
// Phase 1: matrix 695 rows 343 cols
[2024-05-28 02:25:00] [INFO ] Computed 42 invariants in 17 ms
[2024-05-28 02:25:00] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 02:25:00] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 02:25:00] [INFO ] Invariant cache hit.
[2024-05-28 02:25:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:25:02] [INFO ] Implicit Places using invariants and state equation in 2442 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 343/357 places, 707/797 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 68428 ms. Remains : 343/357 places, 707/797 transitions.
[2024-05-28 02:25:02] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 02:26:26] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 02:26:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (537 resets) in 3557 ms. (281 steps per ms)
BEST_FIRST walk for 1000000 steps (213 resets) in 1525 ms. (655 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 02:26:31] [INFO ] Flow matrix only has 695 transitions (discarded 12 similar events)
[2024-05-28 02:26:31] [INFO ] Invariant cache hit.
[2024-05-28 02:26:31] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-28 02:26:31] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-00 in 359884 ms.
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[798]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[798]
[2024-05-28 02:26:31] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
// Phase 1: matrix 799 rows 371 cols
[2024-05-28 02:26:31] [INFO ] Computed 42 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[798]
RANDOM walk for 10000 steps (4 resets) in 56 ms. (175 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[798]
[2024-05-28 02:26:31] [INFO ] Flow matrix only has 799 transitions (discarded 12 similar events)
[2024-05-28 02:26:31] [INFO ] Invariant cache hit.
[2024-05-28 02:26:31] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:26:31] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-28 02:26:32] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2024-05-28 02:26:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:26:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-28 02:26:32] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-28 02:26:33] [INFO ] [Nat]Absence check using state equation in 993 ms returned sat
[2024-05-28 02:26:33] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:26:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 382 ms returned sat
[2024-05-28 02:26:33] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 2 ms to minimize.
[2024-05-28 02:26:34] [INFO ] Deduced a trap composed of 128 places in 229 ms of which 3 ms to minimize.
[2024-05-28 02:26:34] [INFO ] Deduced a trap composed of 142 places in 231 ms of which 3 ms to minimize.
[2024-05-28 02:26:35] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1472 ms
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[798]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[798]
Support contains 6 out of 371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 371/371 places, 811/811 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 363 transition count 803
Applied a total of 16 rules in 33 ms. Remains 363 /371 variables (removed 8) and now considering 803/811 (removed 8) transitions.
Running 801 sub problems to find dead transitions.
[2024-05-28 02:26:35] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
// Phase 1: matrix 791 rows 363 cols
[2024-05-28 02:26:35] [INFO ] Computed 42 invariants in 23 ms
[2024-05-28 02:26:35] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 2 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 47 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
[2024-05-28 02:26:41] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:26:42] [INFO ] Deduced a trap composed of 155 places in 190 ms of which 3 ms to minimize.
[2024-05-28 02:26:42] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 2 ms to minimize.
[2024-05-28 02:26:43] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:26:43] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2024-05-28 02:26:45] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 2 ms to minimize.
[2024-05-28 02:26:46] [INFO ] Deduced a trap composed of 145 places in 186 ms of which 2 ms to minimize.
[2024-05-28 02:26:47] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 3 ms to minimize.
[2024-05-28 02:26:47] [INFO ] Deduced a trap composed of 142 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 801 unsolved
SMT process timed out in 21301ms, After SMT, problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 21315ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21351 ms. Remains : 363/371 places, 803/811 transitions.
[2024-05-28 02:26:56] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 02:26:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (558 resets) in 3755 ms. (266 steps per ms)
BEST_FIRST walk for 1000001 steps (224 resets) in 1868 ms. (535 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 02:27:02] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 02:27:02] [INFO ] Invariant cache hit.
[2024-05-28 02:27:02] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 02:27:02] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 23 ms returned sat
[2024-05-28 02:27:02] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2024-05-28 02:27:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:27:03] [INFO ] [Real]Added 72 Read/Feed constraints in 107 ms returned sat
[2024-05-28 02:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:27:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-28 02:27:03] [INFO ] [Nat]Absence check using 18 positive and 24 generalized place invariants in 21 ms returned sat
[2024-05-28 02:27:03] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-05-28 02:27:03] [INFO ] [Nat]Added 72 Read/Feed constraints in 240 ms returned sat
[2024-05-28 02:27:04] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 3 ms to minimize.
[2024-05-28 02:27:04] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 2 ms to minimize.
[2024-05-28 02:27:04] [INFO ] Deduced a trap composed of 131 places in 246 ms of which 3 ms to minimize.
[2024-05-28 02:27:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 978 ms
[2024-05-28 02:27:05] [INFO ] Computed and/alt/rep : 417/1920/411 causal constraints (skipped 378 transitions) in 66 ms.
[2024-05-28 02:27:06] [INFO ] Added : 75 causal constraints over 15 iterations in 1880 ms. Result :sat
Minimization took 4591 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[78]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[78]
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 803/803 transitions.
Applied a total of 0 rules in 30 ms. Remains 363 /363 variables (removed 0) and now considering 803/803 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 363/363 places, 803/803 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 363/363 places, 803/803 transitions.
Applied a total of 0 rules in 25 ms. Remains 363 /363 variables (removed 0) and now considering 803/803 (removed 0) transitions.
[2024-05-28 02:27:11] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 02:27:11] [INFO ] Invariant cache hit.
[2024-05-28 02:27:11] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-05-28 02:27:11] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 02:27:11] [INFO ] Invariant cache hit.
[2024-05-28 02:27:12] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:27:16] [INFO ] Implicit Places using invariants and state equation in 4824 ms returned []
Implicit Place search using SMT with State Equation took 5312 ms to find 0 implicit places.
[2024-05-28 02:27:16] [INFO ] Redundant transitions in 22 ms returned []
Running 801 sub problems to find dead transitions.
[2024-05-28 02:27:16] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
[2024-05-28 02:27:16] [INFO ] Invariant cache hit.
[2024-05-28 02:27:16] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-28 02:27:22] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-28 02:27:22] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-28 02:27:22] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:27:22] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 2 ms to minimize.
[2024-05-28 02:27:23] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 2 ms to minimize.
[2024-05-28 02:27:23] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:27:23] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 2 ms to minimize.
[2024-05-28 02:27:23] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:27:23] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2024-05-28 02:27:24] [INFO ] Deduced a trap composed of 114 places in 213 ms of which 3 ms to minimize.
[2024-05-28 02:27:24] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 3 ms to minimize.
[2024-05-28 02:27:24] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 3 ms to minimize.
[2024-05-28 02:27:27] [INFO ] Deduced a trap composed of 135 places in 219 ms of which 3 ms to minimize.
[2024-05-28 02:27:28] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 3 ms to minimize.
[2024-05-28 02:27:29] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
[2024-05-28 02:27:29] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 3 ms to minimize.
[2024-05-28 02:27:29] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Problem TDEAD592 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/363 variables, 10/59 constraints. Problems are: Problem set: 66 solved, 735 unsolved
[2024-05-28 02:27:43] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-05-28 02:27:44] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 2 ms to minimize.
[2024-05-28 02:27:47] [INFO ] Deduced a trap composed of 112 places in 166 ms of which 3 ms to minimize.
[2024-05-28 02:27:47] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1154 variables, and 63 constraints, problems are : Problem set: 66 solved, 735 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 66 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 66 solved, 735 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 14/32 constraints. Problems are: Problem set: 66 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 18/50 constraints. Problems are: Problem set: 66 solved, 735 unsolved
[2024-05-28 02:27:55] [INFO ] Deduced a trap composed of 120 places in 200 ms of which 3 ms to minimize.
[2024-05-28 02:28:01] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 3 ms to minimize.
[2024-05-28 02:28:01] [INFO ] Deduced a trap composed of 154 places in 185 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 3/53 constraints. Problems are: Problem set: 66 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 53 constraints, problems are : Problem set: 66 solved, 735 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 14/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 21/24 constraints]
After SMT, in 61310ms problems are : Problem set: 66 solved, 735 unsolved
Search for dead transitions found 66 dead transitions in 61325ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 363/363 places, 737/803 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 361 transition count 725
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 349 transition count 713
Applied a total of 14 rules in 33 ms. Remains 349 /363 variables (removed 14) and now considering 713/737 (removed 24) transitions.
[2024-05-28 02:28:18] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
// Phase 1: matrix 701 rows 349 cols
[2024-05-28 02:28:18] [INFO ] Computed 42 invariants in 20 ms
[2024-05-28 02:28:18] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-28 02:28:18] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 02:28:18] [INFO ] Invariant cache hit.
[2024-05-28 02:28:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-28 02:28:21] [INFO ] Implicit Places using invariants and state equation in 2790 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 349/363 places, 713/803 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69937 ms. Remains : 349/363 places, 713/803 transitions.
[2024-05-28 02:28:21] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 02:28:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[78]
RANDOM walk for 1000000 steps (500 resets) in 2986 ms. (334 steps per ms)
BEST_FIRST walk for 1000001 steps (240 resets) in 1564 ms. (638 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[78]
[2024-05-28 02:28:25] [INFO ] Flow matrix only has 701 transitions (discarded 12 similar events)
[2024-05-28 02:28:25] [INFO ] Invariant cache hit.
[2024-05-28 02:28:25] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-28 02:28:26] [INFO ] [Real]Absence check using 18 positive and 24 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[2]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-01 in 114418 ms.
[2024-05-28 02:28:26] [INFO ] Flatten gal took : 117 ms
Total runtime 998973 ms.
ITS solved all properties within timeout
BK_STOP 1716863306394
--------------------
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-S02J06T06"
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-S02J06T06, 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-171654445500245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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 '
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 ;