About the Execution of GreatSPN+red for CANInsertWithFailure-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10344.071 | 3600000.00 | 8608911.00 | 3209.30 | ? ? ? ? 1 ? 1 ? 1 ? ? ? 1 1 ? 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503800101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is CANInsertWithFailure-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 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 CANInsertWithFailure-PT-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716386023011
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 13:53:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 13:53:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:53:44] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-22 13:53:44] [INFO ] Transformed 324 places.
[2024-05-22 13:53:44] [INFO ] Transformed 660 transitions.
[2024-05-22 13:53:44] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 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, 0, 0, 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]
// Phase 1: matrix 660 rows 324 cols
[2024-05-22 13:53:44] [INFO ] Computed 13 invariants in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 1, 10, 10, 10, 10, 10, 10, 10, 1, 1, 10, 10]
RANDOM walk for 10000 steps (49 resets) in 45 ms. (217 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130009 steps (71 resets) in 109 ms. (1181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-22 13:53:44] [INFO ] Invariant cache hit.
[2024-05-22 13:53:44] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-22 13:53:44] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 13:53:45] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-22 13:53:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-22 13:53:45] [INFO ] [Real]Added 190 Read/Feed constraints in 22 ms returned sat
[2024-05-22 13:53:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:45] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:45] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-22 13:53:45] [INFO ] [Nat]Added 190 Read/Feed constraints in 48 ms returned sat
[2024-05-22 13:53:45] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 42 ms.
[2024-05-22 13:53:45] [INFO ] Added : 47 causal constraints over 10 iterations in 482 ms. Result :sat
Minimization took 505 ms.
[2024-05-22 13:53:46] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Real]Added 190 Read/Feed constraints in 22 ms returned sat
[2024-05-22 13:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-22 13:53:46] [INFO ] [Nat]Added 190 Read/Feed constraints in 73 ms returned sat
[2024-05-22 13:53:47] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 45 ms.
[2024-05-22 13:53:47] [INFO ] Added : 39 causal constraints over 8 iterations in 365 ms. Result :sat
Minimization took 501 ms.
[2024-05-22 13:53:47] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:47] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:48] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-22 13:53:48] [INFO ] [Real]Added 190 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:53:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:48] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 13:53:48] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-22 13:53:48] [INFO ] [Nat]Added 190 Read/Feed constraints in 81 ms returned sat
[2024-05-22 13:53:48] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 43 ms.
[2024-05-22 13:53:48] [INFO ] Added : 46 causal constraints over 10 iterations in 425 ms. Result :sat
Minimization took 504 ms.
[2024-05-22 13:53:49] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Real]Added 190 Read/Feed constraints in 20 ms returned sat
[2024-05-22 13:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-22 13:53:49] [INFO ] [Nat]Added 190 Read/Feed constraints in 88 ms returned sat
[2024-05-22 13:53:50] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 39 ms.
[2024-05-22 13:53:50] [INFO ] Added : 47 causal constraints over 10 iterations in 377 ms. Result :sat
Minimization took 500 ms.
[2024-05-22 13:53:50] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:50] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 13:53:51] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-22 13:53:51] [INFO ] [Real]Added 190 Read/Feed constraints in 24 ms returned sat
[2024-05-22 13:53:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:51] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 13:53:51] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 13:53:51] [INFO ] [Nat]Added 190 Read/Feed constraints in 53 ms returned sat
[2024-05-22 13:53:51] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 38 ms.
[2024-05-22 13:53:51] [INFO ] Added : 36 causal constraints over 8 iterations in 332 ms. Result :sat
Minimization took 504 ms.
[2024-05-22 13:53:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-22 13:53:52] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Real]Added 190 Read/Feed constraints in 18 ms returned sat
[2024-05-22 13:53:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-22 13:53:52] [INFO ] [Nat]Added 190 Read/Feed constraints in 57 ms returned sat
[2024-05-22 13:53:52] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 40 ms.
[2024-05-22 13:53:53] [INFO ] Added : 55 causal constraints over 11 iterations in 449 ms. Result :sat
Minimization took 501 ms.
[2024-05-22 13:53:53] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:53] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-22 13:53:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:53] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:54] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-22 13:53:54] [INFO ] [Real]Added 190 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:54] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:54] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-22 13:53:54] [INFO ] [Nat]Added 190 Read/Feed constraints in 52 ms returned sat
[2024-05-22 13:53:54] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 36 ms.
[2024-05-22 13:53:54] [INFO ] Added : 38 causal constraints over 8 iterations in 321 ms. Result :sat
Minimization took 501 ms.
[2024-05-22 13:53:55] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Real]Added 190 Read/Feed constraints in 19 ms returned sat
[2024-05-22 13:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-22 13:53:55] [INFO ] [Nat]Added 190 Read/Feed constraints in 45 ms returned sat
[2024-05-22 13:53:55] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 38 ms.
[2024-05-22 13:53:55] [INFO ] Added : 29 causal constraints over 6 iterations in 259 ms. Result :sat
Minimization took 501 ms.
[2024-05-22 13:53:56] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Real]Added 190 Read/Feed constraints in 17 ms returned sat
[2024-05-22 13:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-22 13:53:56] [INFO ] [Nat]Added 190 Read/Feed constraints in 51 ms returned sat
[2024-05-22 13:53:56] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 42 ms.
[2024-05-22 13:53:57] [INFO ] Added : 46 causal constraints over 10 iterations in 380 ms. Result :sat
Minimization took 503 ms.
[2024-05-22 13:53:57] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:57] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:57] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-22 13:53:57] [INFO ] [Real]Added 190 Read/Feed constraints in 19 ms returned sat
[2024-05-22 13:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:53:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-22 13:53:58] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:53:58] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-22 13:53:58] [INFO ] [Nat]Added 190 Read/Feed constraints in 58 ms returned sat
[2024-05-22 13:53:58] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 41 ms.
[2024-05-22 13:53:58] [INFO ] Added : 36 causal constraints over 8 iterations in 325 ms. Result :sat
Minimization took 504 ms.
[2024-05-22 13:53:59] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 13:53:59] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 1, 10, 1, 10, 10, 10, 10, 1]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 315 place count 166 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 2 with 69 rules applied. Total rules applied 384 place count 166 transition count 434
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 2 with 111 rules applied. Total rules applied 495 place count 166 transition count 434
Applied a total of 495 rules in 112 ms. Remains 166 /324 variables (removed 158) and now considering 434/660 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 166/324 places, 434/660 transitions.
// Phase 1: matrix 434 rows 166 cols
[2024-05-22 13:53:59] [INFO ] Computed 12 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (19884 resets) in 2557 ms. (390 steps per ms)
BEST_FIRST walk for 10000008 steps (19487 resets) in 5283 ms. (1892 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-22 13:54:07] [INFO ] Invariant cache hit.
[2024-05-22 13:54:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 13:54:07] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-22 13:54:07] [INFO ] [Real]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-22 13:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Nat]Added 387 Read/Feed constraints in 32 ms returned sat
[2024-05-22 13:54:07] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 30 ms.
[2024-05-22 13:54:07] [INFO ] Added : 7 causal constraints over 2 iterations in 104 ms. Result :sat
Minimization took 278 ms.
[2024-05-22 13:54:07] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 13:54:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Real]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Added 387 Read/Feed constraints in 33 ms returned sat
[2024-05-22 13:54:08] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 28 ms.
[2024-05-22 13:54:08] [INFO ] Added : 6 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 287 ms.
[2024-05-22 13:54:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Real]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-22 13:54:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 13:54:08] [INFO ] [Nat]Added 387 Read/Feed constraints in 33 ms returned sat
[2024-05-22 13:54:08] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 27 ms.
[2024-05-22 13:54:09] [INFO ] Added : 10 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 279 ms.
[2024-05-22 13:54:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Real]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:54:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-22 13:54:09] [INFO ] [Nat]Added 387 Read/Feed constraints in 31 ms returned sat
[2024-05-22 13:54:09] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 23 ms.
[2024-05-22 13:54:09] [INFO ] Added : 7 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 288 ms.
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Nat]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-22 13:54:10] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 25 ms.
[2024-05-22 13:54:10] [INFO ] Added : 11 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 292 ms.
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:10] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Real]Added 387 Read/Feed constraints in 37 ms returned sat
[2024-05-22 13:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-22 13:54:11] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 26 ms.
[2024-05-22 13:54:11] [INFO ] Added : 6 causal constraints over 2 iterations in 110 ms. Result :sat
Minimization took 285 ms.
[2024-05-22 13:54:11] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Real]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-22 13:54:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 13:54:11] [INFO ] [Nat]Added 387 Read/Feed constraints in 38 ms returned sat
[2024-05-22 13:54:11] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 26 ms.
[2024-05-22 13:54:12] [INFO ] Added : 12 causal constraints over 3 iterations in 135 ms. Result :sat
Minimization took 291 ms.
[2024-05-22 13:54:12] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Real]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-22 13:54:12] [INFO ] [Nat]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:54:12] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 28 ms.
[2024-05-22 13:54:12] [INFO ] Added : 6 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 287 ms.
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:54:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Nat]Added 387 Read/Feed constraints in 34 ms returned sat
[2024-05-22 13:54:13] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 25 ms.
[2024-05-22 13:54:13] [INFO ] Added : 6 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 257 ms.
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-22 13:54:13] [INFO ] [Real]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-22 13:54:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:54:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-22 13:54:14] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 13:54:14] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-22 13:54:14] [INFO ] [Nat]Added 387 Read/Feed constraints in 31 ms returned sat
[2024-05-22 13:54:14] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-22 13:54:14] [INFO ] Added : 5 causal constraints over 1 iterations in 72 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 24 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 166/166 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-22 13:54:14] [INFO ] Invariant cache hit.
[2024-05-22 13:54:14] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 13:54:14] [INFO ] Invariant cache hit.
[2024-05-22 13:54:14] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-22 13:54:15] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-22 13:54:15] [INFO ] Redundant transitions in 24 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-22 13:54:15] [INFO ] Invariant cache hit.
[2024-05-22 13:54:15] [INFO ] State equation strengthened by 387 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 11 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:17] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:18] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 0 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:54:19] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:21] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 13:54:22] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 13:54:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:24] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 13:54:24] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:54:24] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 13:54:24] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 13:54:25] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 13:54:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:54:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-22 13:54:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 13:54:29] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 13:54:29] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 13:54:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 13:54:29] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 16/128 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 13:54:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 13:54:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 13:54:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 13:54:31] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 13:54:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 10 (OVERLAPS) 434/599 variables, 165/298 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 387/685 constraints. Problems are: Problem set: 9 solved, 415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 599/600 variables, and 685 constraints, problems are : Problem set: 9 solved, 415 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/166 constraints, ReadFeed: 387/387 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 121/121 constraints]
Escalating to Integer solving :Problem set: 9 solved, 415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 121/133 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/133 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 4 (OVERLAPS) 434/599 variables, 165/298 constraints. Problems are: Problem set: 9 solved, 415 unsolved
Problem TDEAD158 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 387/685 constraints. Problems are: Problem set: 10 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 414/1099 constraints. Problems are: Problem set: 10 solved, 414 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/599 variables, 0/1099 constraints. Problems are: Problem set: 10 solved, 414 unsolved
At refinement iteration 8 (OVERLAPS) 1/600 variables, 1/1100 constraints. Problems are: Problem set: 10 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 1100 constraints, problems are : Problem set: 10 solved, 414 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 166/166 constraints, ReadFeed: 387/387 constraints, PredecessorRefiner: 414/424 constraints, Known Traps: 121/121 constraints]
After SMT, in 60240ms problems are : Problem set: 10 solved, 414 unsolved
Search for dead transitions found 10 dead transitions in 60260ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 424/434 transitions.
Graph (complete) has 732 edges and 166 vertex of which 165 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 158 transition count 410
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 158 transition count 410
Applied a total of 15 rules in 16 ms. Remains 158 /166 variables (removed 8) and now considering 410/424 (removed 14) transitions.
// Phase 1: matrix 410 rows 158 cols
[2024-05-22 13:55:15] [INFO ] Computed 11 invariants in 5 ms
[2024-05-22 13:55:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-22 13:55:15] [INFO ] Invariant cache hit.
[2024-05-22 13:55:15] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-22 13:55:16] [INFO ] Implicit Places using invariants and state equation in 680 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 783 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/166 places, 410/434 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 408
Applied a total of 4 rules in 15 ms. Remains 155 /157 variables (removed 2) and now considering 408/410 (removed 2) transitions.
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 13:55:16] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 13:55:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 13:55:16] [INFO ] Invariant cache hit.
[2024-05-22 13:55:16] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 13:55:17] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/166 places, 408/434 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62464 ms. Remains : 155/166 places, 408/434 transitions.
[2024-05-22 13:55:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (20133 resets) in 2261 ms. (442 steps per ms)
BEST_FIRST walk for 10000008 steps (19628 resets) in 5023 ms. (1990 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-22 13:55:24] [INFO ] Invariant cache hit.
[2024-05-22 13:55:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:24] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 13:55:24] [INFO ] [Real]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:55:24] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-22 13:55:24] [INFO ] Added : 7 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 192 ms.
[2024-05-22 13:55:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:24] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:55:25] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-22 13:55:25] [INFO ] Added : 9 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 192 ms.
[2024-05-22 13:55:25] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Real]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 13:55:25] [INFO ] [Nat]Added 361 Read/Feed constraints in 39 ms returned sat
[2024-05-22 13:55:25] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-22 13:55:25] [INFO ] Added : 13 causal constraints over 3 iterations in 104 ms. Result :sat
Minimization took 191 ms.
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Added 361 Read/Feed constraints in 33 ms returned sat
[2024-05-22 13:55:26] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-22 13:55:26] [INFO ] Added : 9 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 172 ms.
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:55:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 13:55:26] [INFO ] [Nat]Added 361 Read/Feed constraints in 37 ms returned sat
[2024-05-22 13:55:27] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 18 ms.
[2024-05-22 13:55:27] [INFO ] Added : 5 causal constraints over 1 iterations in 71 ms. Result :sat
Minimization took 178 ms.
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Real]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:55:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:55:27] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-22 13:55:27] [INFO ] Added : 8 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 200 ms.
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:27] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Real]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 13:55:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-22 13:55:28] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-22 13:55:28] [INFO ] Added : 11 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 167 ms.
[2024-05-22 13:55:28] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Real]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:55:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 13:55:28] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:55:28] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-22 13:55:28] [INFO ] Added : 6 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 179 ms.
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:55:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:55:29] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-22 13:55:29] [INFO ] Added : 6 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 175 ms.
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:55:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 13:55:29] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-22 13:55:29] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-22 13:55:30] [INFO ] Added : 7 causal constraints over 2 iterations in 96 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 8 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-22 13:55:30] [INFO ] Invariant cache hit.
[2024-05-22 13:55:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 13:55:30] [INFO ] Invariant cache hit.
[2024-05-22 13:55:30] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 13:55:30] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
[2024-05-22 13:55:30] [INFO ] Redundant transitions in 10 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-22 13:55:30] [INFO ] Invariant cache hit.
[2024-05-22 13:55:30] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 21099 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 51221ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 51227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51845 ms. Remains : 155/155 places, 408/408 transitions.
RANDOM walk for 40000 steps (805 resets) in 1616 ms. (24 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 722225 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 20
Probabilistic random walk after 722225 steps, saw 94995 distinct states, run finished after 3016 ms. (steps per millisecond=239 ) properties seen :0
[2024-05-22 13:56:25] [INFO ] Invariant cache hit.
[2024-05-22 13:56:25] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 10 solved, 10 unsolved in 4409 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 10 solved, 10 unsolved in 2148 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 6577ms problems are : Problem set: 10 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 623 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 13 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 155/155 places, 408/408 transitions.
RANDOM walk for 40000 steps (809 resets) in 372 ms. (107 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (80 resets) in 62 ms. (634 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (74 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 68 ms. (579 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (81 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (79 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 758309 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :0 out of 10
Probabilistic random walk after 758309 steps, saw 99264 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :0
[2024-05-22 13:56:36] [INFO ] Invariant cache hit.
[2024-05-22 13:56:36] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1595 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2720ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 855 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 9 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-22 13:56:40] [INFO ] Invariant cache hit.
[2024-05-22 13:56:40] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 13:56:40] [INFO ] Invariant cache hit.
[2024-05-22 13:56:40] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 13:56:40] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-22 13:56:40] [INFO ] Redundant transitions in 5 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-22 13:56:40] [INFO ] Invariant cache hit.
[2024-05-22 13:56:40] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 29775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 21237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 51130ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 51135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51817 ms. Remains : 155/155 places, 408/408 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 314 edges and 155 vertex of which 103 / 155 are part of one of the 3 SCC in 3 ms
Free SCC test removed 100 places
Drop transitions (Empty/Sink Transition effects.) removed 240 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 329 transitions.
Graph (complete) has 134 edges and 55 vertex of which 25 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 25 transition count 49
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 17 transition count 41
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 17 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 16 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 16 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 16 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 14 transition count 36
Applied a total of 45 rules in 14 ms. Remains 14 /155 variables (removed 141) and now considering 36/408 (removed 372) transitions.
Running SMT prover for 10 properties.
[2024-05-22 13:57:31] [INFO ] Flow matrix only has 34 transitions (discarded 2 similar events)
// Phase 1: matrix 34 rows 14 cols
[2024-05-22 13:57:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 13:57:32] [INFO ] After 39ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
TRAPS : Iteration 0
[2024-05-22 13:57:32] [INFO ] After 49ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 13:57:32] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 13:57:32] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-22 13:57:32] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-22 13:57:32] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 241 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 13:57:32] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (205 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 13:57:32] [INFO ] Invariant cache hit.
[2024-05-22 13:57:32] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:57:32] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:57:32] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 13:57:32] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 13:57:32] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:57:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:57:32] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:57:32] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-22 13:57:32] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 13:57:32] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-22 13:57:32] [INFO ] Added : 7 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 190 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 38 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 13:57:32] [INFO ] Computed 10 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20506 resets) in 2169 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (1977 resets) in 502 ms. (1988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 13:57:35] [INFO ] Invariant cache hit.
[2024-05-22 13:57:35] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 13:57:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:57:35] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 13:57:35] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 13:57:35] [INFO ] [Real]Added 374 Read/Feed constraints in 32 ms returned sat
[2024-05-22 13:57:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:57:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:57:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 13:57:35] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 13:57:35] [INFO ] [Nat]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-22 13:57:35] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 22 ms.
[2024-05-22 13:57:35] [INFO ] Added : 4 causal constraints over 1 iterations in 63 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 7 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 13:57:36] [INFO ] Invariant cache hit.
[2024-05-22 13:57:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 13:57:36] [INFO ] Invariant cache hit.
[2024-05-22 13:57:36] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 13:57:36] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-22 13:57:36] [INFO ] Redundant transitions in 4 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 13:57:36] [INFO ] Invariant cache hit.
[2024-05-22 13:57:36] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 26047 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 56146ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 56150ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 25 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-22 13:58:33] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 13:58:33] [INFO ] Implicit Places using invariants in 93 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 22 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-22 13:58:33] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 13:58:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 13:58:33] [INFO ] Invariant cache hit.
[2024-05-22 13:58:33] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 13:58:33] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57506 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-22 13:58:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22544 resets) in 2164 ms. (461 steps per ms)
BEST_FIRST walk for 1000001 steps (2100 resets) in 503 ms. (1984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 13:58:36] [INFO ] Invariant cache hit.
[2024-05-22 13:58:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:58:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:58:36] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-22 13:58:36] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 13:58:36] [INFO ] [Real]Added 362 Read/Feed constraints in 27 ms returned sat
[2024-05-22 13:58:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:58:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 13:58:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 13:58:36] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 13:58:36] [INFO ] [Nat]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-22 13:58:36] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 23 ms.
[2024-05-22 13:58:36] [INFO ] Added : 4 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 13:58:36] [INFO ] Invariant cache hit.
[2024-05-22 13:58:37] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 13:58:37] [INFO ] Invariant cache hit.
[2024-05-22 13:58:37] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 13:58:37] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2024-05-22 13:58:37] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 13:58:37] [INFO ] Invariant cache hit.
[2024-05-22 13:58:37] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 13:58:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 13:58:40] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 29198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25206 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54496ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55089 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (903 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (86 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1086715 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :0 out of 2
Probabilistic random walk after 1086715 steps, saw 131970 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
[2024-05-22 13:59:35] [INFO ] Invariant cache hit.
[2024-05-22 13:59:35] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 13:59:35] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-22 13:59:35] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-22 13:59:35] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/504 variables, 64/250 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 231/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 485ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (899 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1765857 steps, run timeout after 3001 ms. (steps per millisecond=588 ) properties seen :0 out of 1
Probabilistic random walk after 1765857 steps, saw 214422 distinct states, run finished after 3001 ms. (steps per millisecond=588 ) properties seen :0
[2024-05-22 13:59:38] [INFO ] Invariant cache hit.
[2024-05-22 13:59:38] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 268/504 variables, 64/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 231/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 354ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 13:59:39] [INFO ] Invariant cache hit.
[2024-05-22 13:59:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 13:59:39] [INFO ] Invariant cache hit.
[2024-05-22 13:59:39] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 13:59:39] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-22 13:59:39] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 13:59:39] [INFO ] Invariant cache hit.
[2024-05-22 13:59:39] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 13:59:41] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 13:59:42] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24829 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54931ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54936ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55514 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 4 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 7 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:00:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 14:00:34] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:00:34] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:00:34] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:00:34] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 56 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00 in 182438 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:00:34] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (200 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:00:34] [INFO ] Invariant cache hit.
[2024-05-22 14:00:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:00:34] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:00:34] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-22 14:00:34] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:00:34] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-22 14:00:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:00:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:00:34] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:00:34] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:00:34] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:00:35] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-22 14:00:35] [INFO ] Added : 9 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 192 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 27 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 14:00:35] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20500 resets) in 2180 ms. (458 steps per ms)
BEST_FIRST walk for 1000001 steps (1960 resets) in 503 ms. (1984 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:00:38] [INFO ] Invariant cache hit.
[2024-05-22 14:00:38] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:00:38] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:00:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:00:38] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:00:38] [INFO ] [Real]Added 374 Read/Feed constraints in 27 ms returned sat
[2024-05-22 14:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:00:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:00:38] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:00:38] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:00:38] [INFO ] [Nat]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-22 14:00:38] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 23 ms.
[2024-05-22 14:00:38] [INFO ] Added : 5 causal constraints over 1 iterations in 64 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 14:00:38] [INFO ] Invariant cache hit.
[2024-05-22 14:00:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 14:00:38] [INFO ] Invariant cache hit.
[2024-05-22 14:00:38] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:00:39] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-22 14:00:39] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 14:00:39] [INFO ] Invariant cache hit.
[2024-05-22 14:00:39] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29663 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 24787 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 54552ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 54557ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 707 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 7 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-22 14:01:33] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 14:01:34] [INFO ] Implicit Places using invariants in 100 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 13 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-22 14:01:34] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 14:01:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 14:01:34] [INFO ] Invariant cache hit.
[2024-05-22 14:01:34] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:01:34] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55963 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-22 14:01:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22622 resets) in 2246 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (2078 resets) in 510 ms. (1956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:01:37] [INFO ] Invariant cache hit.
[2024-05-22 14:01:37] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-22 14:01:37] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:01:37] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:01:37] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:01:37] [INFO ] [Real]Added 362 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:01:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:01:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:01:37] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:01:37] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:01:37] [INFO ] [Nat]Added 362 Read/Feed constraints in 31 ms returned sat
[2024-05-22 14:01:37] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 23 ms.
[2024-05-22 14:01:37] [INFO ] Added : 7 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:01:38] [INFO ] Invariant cache hit.
[2024-05-22 14:01:38] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 14:01:38] [INFO ] Invariant cache hit.
[2024-05-22 14:01:38] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:01:38] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-22 14:01:38] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:01:38] [INFO ] Invariant cache hit.
[2024-05-22 14:01:38] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:01:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:01:41] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25131 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 55256ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55263ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55918 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (908 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1210863 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 2
Probabilistic random walk after 1210863 steps, saw 147619 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :0
[2024-05-22 14:02:37] [INFO ] Invariant cache hit.
[2024-05-22 14:02:37] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 178 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (902 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (78 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1666326 steps, run timeout after 3001 ms. (steps per millisecond=555 ) properties seen :0 out of 1
Probabilistic random walk after 1666326 steps, saw 202137 distinct states, run finished after 3001 ms. (steps per millisecond=555 ) properties seen :0
[2024-05-22 14:02:40] [INFO ] Invariant cache hit.
[2024-05-22 14:02:40] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 368ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:02:40] [INFO ] Invariant cache hit.
[2024-05-22 14:02:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 14:02:40] [INFO ] Invariant cache hit.
[2024-05-22 14:02:41] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:02:41] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-05-22 14:02:41] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:02:41] [INFO ] Invariant cache hit.
[2024-05-22 14:02:41] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:02:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:02:44] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54803ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55423 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 98 edges and 43 vertex of which 13 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 13 transition count 16
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 6 transition count 9
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 4 transition count 7
Applied a total of 38 rules in 6 ms. Remains 4 /147 variables (removed 143) and now considering 7/399 (removed 392) transitions.
Running SMT prover for 1 properties.
[2024-05-22 14:03:36] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-22 14:03:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 14:03:36] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:03:36] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:03:36] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:03:36] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 65 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-01 in 181702 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:03:36] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (198 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:03:36] [INFO ] Invariant cache hit.
[2024-05-22 14:03:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:03:36] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:03:36] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-22 14:03:36] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:03:36] [INFO ] [Real]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:03:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:03:36] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:03:36] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 14:03:36] [INFO ] [Nat]Added 361 Read/Feed constraints in 38 ms returned sat
[2024-05-22 14:03:36] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-22 14:03:36] [INFO ] Added : 13 causal constraints over 3 iterations in 123 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 16 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 14:03:37] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20389 resets) in 2174 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (2011 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:03:39] [INFO ] Invariant cache hit.
[2024-05-22 14:03:39] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:03:39] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:03:39] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 14:03:39] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:03:39] [INFO ] [Real]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-22 14:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:03:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:03:39] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:03:39] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:03:40] [INFO ] [Nat]Added 374 Read/Feed constraints in 33 ms returned sat
[2024-05-22 14:03:40] [INFO ] Computed and/alt/rep : 260/715/260 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-22 14:03:40] [INFO ] Added : 8 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 14:03:40] [INFO ] Invariant cache hit.
[2024-05-22 14:03:40] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 14:03:40] [INFO ] Invariant cache hit.
[2024-05-22 14:03:40] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:03:41] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-22 14:03:41] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 14:03:41] [INFO ] Invariant cache hit.
[2024-05-22 14:03:41] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 393/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 928 constraints, problems are : Problem set: 1 solved, 393 unsolved in 26685 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 393/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 56795ms problems are : Problem set: 1 solved, 393 unsolved
Search for dead transitions found 1 dead transitions in 56801ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 403/404 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 401
Applied a total of 2 rules in 6 ms. Remains 150 /151 variables (removed 1) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-22 14:04:37] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 14:04:38] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-22 14:04:38] [INFO ] Invariant cache hit.
[2024-05-22 14:04:38] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-22 14:04:38] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 150/151 places, 401/404 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 58113 ms. Remains : 150/151 places, 401/404 transitions.
[2024-05-22 14:04:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20466 resets) in 2128 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (2010 resets) in 499 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:04:41] [INFO ] Invariant cache hit.
[2024-05-22 14:04:41] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:04:41] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:04:41] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:04:41] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-22 14:04:41] [INFO ] [Real]Added 372 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:04:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:04:41] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:04:41] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:04:41] [INFO ] [Nat]Added 372 Read/Feed constraints in 34 ms returned sat
[2024-05-22 14:04:41] [INFO ] Computed and/alt/rep : 255/665/255 causal constraints (skipped 136 transitions) in 23 ms.
[2024-05-22 14:04:41] [INFO ] Added : 5 causal constraints over 1 iterations in 74 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-22 14:04:41] [INFO ] Invariant cache hit.
[2024-05-22 14:04:41] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 14:04:41] [INFO ] Invariant cache hit.
[2024-05-22 14:04:41] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-22 14:04:42] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-05-22 14:04:42] [INFO ] Redundant transitions in 5 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-22 14:04:42] [INFO ] Invariant cache hit.
[2024-05-22 14:04:42] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 29114 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18840 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 48056ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 48061ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48707 ms. Remains : 150/150 places, 401/401 transitions.
RANDOM walk for 40000 steps (811 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (77 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (78 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1122598 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :0 out of 2
Probabilistic random walk after 1122598 steps, saw 143032 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
[2024-05-22 14:05:33] [INFO ] Invariant cache hit.
[2024-05-22 14:05:33] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 1 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 1 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 407ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 150/150 places, 401/401 transitions.
RANDOM walk for 40000 steps (816 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1675161 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1675161 steps, saw 214275 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-05-22 14:05:37] [INFO ] Invariant cache hit.
[2024-05-22 14:05:37] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 377ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-22 14:05:37] [INFO ] Invariant cache hit.
[2024-05-22 14:05:37] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 14:05:37] [INFO ] Invariant cache hit.
[2024-05-22 14:05:37] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-22 14:05:38] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-22 14:05:38] [INFO ] Redundant transitions in 3 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-22 14:05:38] [INFO ] Invariant cache hit.
[2024-05-22 14:05:38] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 29038 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18611 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 47739ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 47745ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48366 ms. Remains : 150/150 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 343 edges and 150 vertex of which 108 / 150 are part of one of the 3 SCC in 1 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 102 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 27 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 13 transition count 14
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 4 transition count 5
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 3 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 2 transition count 2
Applied a total of 51 rules in 5 ms. Remains 2 /150 variables (removed 148) and now considering 2/401 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-05-22 14:06:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 14:06:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 14:06:25] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:06:25] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:06:25] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 41 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 169469 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:06:25] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (201 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:06:25] [INFO ] Invariant cache hit.
[2024-05-22 14:06:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:06:25] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:06:25] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:06:25] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:06:25] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-22 14:06:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:06:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:06:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:06:26] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 14:06:26] [INFO ] [Nat]Added 361 Read/Feed constraints in 43 ms returned sat
[2024-05-22 14:06:26] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-22 14:06:26] [INFO ] Added : 9 causal constraints over 2 iterations in 126 ms. Result :sat
Minimization took 177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 14 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 14:06:26] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20429 resets) in 2177 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (1961 resets) in 497 ms. (2008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:06:29] [INFO ] Invariant cache hit.
[2024-05-22 14:06:29] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-05-22 14:06:29] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:06:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:06:29] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:06:29] [INFO ] [Real]Added 374 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:06:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:06:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:06:29] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:06:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 14:06:29] [INFO ] [Nat]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:06:29] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-22 14:06:29] [INFO ] Added : 6 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 237 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 14:06:29] [INFO ] Invariant cache hit.
[2024-05-22 14:06:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-22 14:06:29] [INFO ] Invariant cache hit.
[2024-05-22 14:06:30] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:06:30] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-05-22 14:06:30] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 14:06:30] [INFO ] Invariant cache hit.
[2024-05-22 14:06:30] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 26599 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 56721ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 56726ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 17 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-22 14:07:27] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 14:07:27] [INFO ] Implicit Places using invariants in 107 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-22 14:07:27] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 14:07:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 14:07:27] [INFO ] Invariant cache hit.
[2024-05-22 14:07:27] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:07:27] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58102 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-22 14:07:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22565 resets) in 2227 ms. (448 steps per ms)
BEST_FIRST walk for 1000001 steps (2098 resets) in 491 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:07:30] [INFO ] Invariant cache hit.
[2024-05-22 14:07:30] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:07:30] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:07:30] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:07:30] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:07:30] [INFO ] [Real]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:07:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:07:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:07:30] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:07:30] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:07:30] [INFO ] [Nat]Added 362 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:07:30] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-22 14:07:31] [INFO ] Added : 5 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:07:31] [INFO ] Invariant cache hit.
[2024-05-22 14:07:31] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 14:07:31] [INFO ] Invariant cache hit.
[2024-05-22 14:07:31] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:07:31] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-22 14:07:31] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:07:31] [INFO ] Invariant cache hit.
[2024-05-22 14:07:31] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:07:33] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:07:35] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24807 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54919ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54925ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55486 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (903 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1176933 steps, run timeout after 3001 ms. (steps per millisecond=392 ) properties seen :0 out of 2
Probabilistic random walk after 1176933 steps, saw 144099 distinct states, run finished after 3002 ms. (steps per millisecond=392 ) properties seen :0
[2024-05-22 14:08:29] [INFO ] Invariant cache hit.
[2024-05-22 14:08:29] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:08:29] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 316/490 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 276/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 56/546 variables, 49/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 7/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 14:08:30] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 316/490 variables, 64/190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 276/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 56/546 variables, 49/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 7/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 493ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (902 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1738548 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :0 out of 1
Probabilistic random walk after 1738548 steps, saw 210648 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
[2024-05-22 14:08:33] [INFO ] Invariant cache hit.
[2024-05-22 14:08:33] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 316/490 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 276/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/546 variables, 49/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:08:33] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-22 14:08:33] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-22 14:08:33] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 316/490 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 276/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 56/546 variables, 49/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 8 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:08:33] [INFO ] Invariant cache hit.
[2024-05-22 14:08:33] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 14:08:33] [INFO ] Invariant cache hit.
[2024-05-22 14:08:34] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:08:34] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 14:08:34] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:08:34] [INFO ] Invariant cache hit.
[2024-05-22 14:08:34] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:08:36] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:08:37] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25810 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 55905ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55909ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56469 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 353 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 4 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:09:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 14:09:30] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:09:30] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:09:30] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:09:30] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 46 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03 in 184522 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:09:30] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (203 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:09:30] [INFO ] Invariant cache hit.
[2024-05-22 14:09:30] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:09:30] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:09:30] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 14:09:30] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:09:30] [INFO ] [Real]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-22 14:09:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:09:30] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:09:30] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:09:30] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-22 14:09:30] [INFO ] [Nat]Added 361 Read/Feed constraints in 32 ms returned sat
[2024-05-22 14:09:30] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-22 14:09:30] [INFO ] Added : 5 causal constraints over 1 iterations in 72 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 23 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 14:09:30] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20457 resets) in 2089 ms. (478 steps per ms)
BEST_FIRST walk for 1000000 steps (1945 resets) in 492 ms. (2028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:09:33] [INFO ] Invariant cache hit.
[2024-05-22 14:09:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:09:33] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:09:33] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:09:33] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:09:33] [INFO ] [Real]Added 374 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:09:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:09:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:09:33] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:09:33] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 14:09:33] [INFO ] [Nat]Added 374 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:09:33] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 23 ms.
[2024-05-22 14:09:33] [INFO ] Added : 3 causal constraints over 1 iterations in 69 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 14:09:34] [INFO ] Invariant cache hit.
[2024-05-22 14:09:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 14:09:34] [INFO ] Invariant cache hit.
[2024-05-22 14:09:34] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:09:34] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-22 14:09:34] [INFO ] Redundant transitions in 4 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 14:09:34] [INFO ] Invariant cache hit.
[2024-05-22 14:09:34] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55704ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55711ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 12 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-22 14:10:30] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 14:10:30] [INFO ] Implicit Places using invariants in 100 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-22 14:10:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 14:10:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 14:10:30] [INFO ] Invariant cache hit.
[2024-05-22 14:10:30] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:10:31] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 57393 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-22 14:10:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22542 resets) in 2171 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (2074 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:10:34] [INFO ] Invariant cache hit.
[2024-05-22 14:10:34] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-22 14:10:34] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:10:34] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:10:34] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:10:34] [INFO ] [Real]Added 362 Read/Feed constraints in 53 ms returned sat
[2024-05-22 14:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:10:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:10:34] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:10:34] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-22 14:10:34] [INFO ] [Nat]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-22 14:10:34] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 26 ms.
[2024-05-22 14:10:34] [INFO ] Added : 3 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:10:34] [INFO ] Invariant cache hit.
[2024-05-22 14:10:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 14:10:34] [INFO ] Invariant cache hit.
[2024-05-22 14:10:35] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:10:35] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2024-05-22 14:10:35] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:10:35] [INFO ] Invariant cache hit.
[2024-05-22 14:10:35] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:10:37] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25284 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 55417ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56069 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (906 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1190823 steps, run timeout after 3001 ms. (steps per millisecond=396 ) properties seen :0 out of 2
Probabilistic random walk after 1190823 steps, saw 145447 distinct states, run finished after 3001 ms. (steps per millisecond=396 ) properties seen :0
[2024-05-22 14:11:34] [INFO ] Invariant cache hit.
[2024-05-22 14:11:34] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:11:34] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 2 ms to minimize.
[2024-05-22 14:11:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 272/504 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 234/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 480ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (900 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1592467 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :0 out of 1
Probabilistic random walk after 1592467 steps, saw 194327 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
[2024-05-22 14:11:37] [INFO ] Invariant cache hit.
[2024-05-22 14:11:37] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 272/504 variables, 65/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 234/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:11:37] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-22 14:11:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:11:38] [INFO ] Invariant cache hit.
[2024-05-22 14:11:38] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 14:11:38] [INFO ] Invariant cache hit.
[2024-05-22 14:11:38] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:11:38] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-05-22 14:11:38] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:11:38] [INFO ] Invariant cache hit.
[2024-05-22 14:11:38] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:11:40] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24981 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 55105ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55736 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 4 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:12:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 14:12:33] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:12:33] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:12:33] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:12:33] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 57 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05 in 183486 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:12:33] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (204 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:12:33] [INFO ] Invariant cache hit.
[2024-05-22 14:12:33] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:12:33] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:12:33] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 14:12:33] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:12:34] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-22 14:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:12:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:12:34] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:12:34] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 14:12:34] [INFO ] [Nat]Added 361 Read/Feed constraints in 37 ms returned sat
[2024-05-22 14:12:34] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 18 ms.
[2024-05-22 14:12:34] [INFO ] Added : 8 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 152 transition count 405
Applied a total of 12 rules in 11 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-22 14:12:34] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20530 resets) in 2089 ms. (478 steps per ms)
BEST_FIRST walk for 1000001 steps (2019 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:12:37] [INFO ] Invariant cache hit.
[2024-05-22 14:12:37] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:12:37] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:12:37] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 14:12:37] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:12:37] [INFO ] [Real]Added 373 Read/Feed constraints in 31 ms returned sat
[2024-05-22 14:12:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:12:37] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:12:37] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:12:37] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 14:12:37] [INFO ] [Nat]Added 373 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:12:37] [INFO ] Computed and/alt/rep : 261/715/261 causal constraints (skipped 134 transitions) in 19 ms.
[2024-05-22 14:12:37] [INFO ] Added : 8 causal constraints over 2 iterations in 87 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-22 14:12:37] [INFO ] Invariant cache hit.
[2024-05-22 14:12:37] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 14:12:37] [INFO ] Invariant cache hit.
[2024-05-22 14:12:37] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:12:38] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-22 14:12:38] [INFO ] Redundant transitions in 2 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-22 14:12:38] [INFO ] Invariant cache hit.
[2024-05-22 14:12:38] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 27991 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 58086ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 58090ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58766 ms. Remains : 152/152 places, 405/405 transitions.
RANDOM walk for 40000 steps (820 resets) in 213 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (78 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 613492 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 2
Probabilistic random walk after 613492 steps, saw 79633 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-22 14:13:39] [INFO ] Invariant cache hit.
[2024-05-22 14:13:39] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 1 solved, 1 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
RANDOM walk for 40000 steps (827 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (80 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1639284 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :0 out of 1
Probabilistic random walk after 1639284 steps, saw 209406 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
[2024-05-22 14:13:43] [INFO ] Invariant cache hit.
[2024-05-22 14:13:43] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-22 14:13:43] [INFO ] Invariant cache hit.
[2024-05-22 14:13:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 14:13:43] [INFO ] Invariant cache hit.
[2024-05-22 14:13:43] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:13:44] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-05-22 14:13:44] [INFO ] Redundant transitions in 2 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-22 14:13:44] [INFO ] Invariant cache hit.
[2024-05-22 14:13:44] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 29051 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 59170ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 59175ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59840 ms. Remains : 152/152 places, 405/405 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 345 edges and 152 vertex of which 109 / 152 are part of one of the 3 SCC in 0 ms
Free SCC test removed 106 places
Drop transitions (Empty/Sink Transition effects.) removed 263 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 356 transitions.
Graph (complete) has 106 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 16 transition count 20
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 8 transition count 12
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 5 transition count 9
Applied a total of 42 rules in 7 ms. Remains 5 /152 variables (removed 147) and now considering 9/405 (removed 396) transitions.
Running SMT prover for 1 properties.
[2024-05-22 14:14:43] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-22 14:14:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 14:14:43] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:14:43] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:14:43] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:14:43] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 87 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 129717 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:14:43] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (202 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:14:43] [INFO ] Invariant cache hit.
[2024-05-22 14:14:43] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:14:43] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:14:43] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-22 14:14:43] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:14:43] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-22 14:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:14:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:14:43] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:14:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:14:43] [INFO ] [Nat]Added 361 Read/Feed constraints in 32 ms returned sat
[2024-05-22 14:14:43] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-22 14:14:43] [INFO ] Added : 11 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 25 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-22 14:14:44] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20425 resets) in 2186 ms. (457 steps per ms)
BEST_FIRST walk for 1000000 steps (1973 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:14:46] [INFO ] Invariant cache hit.
[2024-05-22 14:14:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:14:46] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:14:47] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:14:47] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:14:47] [INFO ] [Real]Added 373 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:14:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:14:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:14:47] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:14:47] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:14:47] [INFO ] [Nat]Added 373 Read/Feed constraints in 33 ms returned sat
[2024-05-22 14:14:47] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 22 ms.
[2024-05-22 14:14:47] [INFO ] Added : 6 causal constraints over 2 iterations in 82 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-22 14:14:47] [INFO ] Invariant cache hit.
[2024-05-22 14:14:47] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 14:14:47] [INFO ] Invariant cache hit.
[2024-05-22 14:14:47] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:14:48] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-22 14:14:48] [INFO ] Redundant transitions in 3 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-22 14:14:48] [INFO ] Invariant cache hit.
[2024-05-22 14:14:48] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 27309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 57402ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 57406ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 6 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-22 14:15:45] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 14:15:45] [INFO ] Implicit Places using invariants in 100 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 12 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-22 14:15:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 14:15:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 14:15:45] [INFO ] Invariant cache hit.
[2024-05-22 14:15:45] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:15:46] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58757 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-22 14:15:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22561 resets) in 2335 ms. (428 steps per ms)
BEST_FIRST walk for 1000000 steps (2108 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:15:49] [INFO ] Invariant cache hit.
[2024-05-22 14:15:49] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:15:49] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:15:49] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-22 14:15:49] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:15:49] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:15:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:15:49] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:15:49] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:15:49] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-22 14:15:49] [INFO ] [Nat]Added 361 Read/Feed constraints in 33 ms returned sat
[2024-05-22 14:15:49] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 22 ms.
[2024-05-22 14:15:49] [INFO ] Added : 13 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:15:49] [INFO ] Invariant cache hit.
[2024-05-22 14:15:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 14:15:49] [INFO ] Invariant cache hit.
[2024-05-22 14:15:50] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:15:50] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-22 14:15:50] [INFO ] Redundant transitions in 5 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:15:50] [INFO ] Invariant cache hit.
[2024-05-22 14:15:50] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:15:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-22 14:15:52] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 26530 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 56656ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 56663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57244 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (908 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (79 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1215622 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :0 out of 2
Probabilistic random walk after 1215622 steps, saw 148032 distinct states, run finished after 3003 ms. (steps per millisecond=404 ) properties seen :0
[2024-05-22 14:16:50] [INFO ] Invariant cache hit.
[2024-05-22 14:16:50] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 14:16:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 269/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 228/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 477ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (903 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1683827 steps, run timeout after 3001 ms. (steps per millisecond=561 ) properties seen :0 out of 1
Probabilistic random walk after 1683827 steps, saw 204729 distinct states, run finished after 3001 ms. (steps per millisecond=561 ) properties seen :0
[2024-05-22 14:16:53] [INFO ] Invariant cache hit.
[2024-05-22 14:16:53] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 269/494 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 228/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:16:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-22 14:16:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:16:54] [INFO ] Invariant cache hit.
[2024-05-22 14:16:54] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 14:16:54] [INFO ] Invariant cache hit.
[2024-05-22 14:16:54] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:16:54] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-22 14:16:54] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:16:54] [INFO ] Invariant cache hit.
[2024-05-22 14:16:54] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:16:56] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-22 14:16:56] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 26183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 56318ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 56325ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56894 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 3 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 9 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:17:51] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 14:17:51] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:17:51] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:17:51] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:17:51] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:17:51] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:17:51] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 61 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 187540 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:17:51] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (196 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:17:51] [INFO ] Invariant cache hit.
[2024-05-22 14:17:51] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:51] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:17:51] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:17:51] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:17:51] [INFO ] [Real]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:17:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:51] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:17:51] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 14:17:51] [INFO ] [Nat]Added 361 Read/Feed constraints in 32 ms returned sat
[2024-05-22 14:17:51] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-22 14:17:51] [INFO ] Added : 6 causal constraints over 2 iterations in 90 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 14 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-22 14:17:51] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20391 resets) in 2200 ms. (454 steps per ms)
BEST_FIRST walk for 1000000 steps (1971 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:17:54] [INFO ] Invariant cache hit.
[2024-05-22 14:17:54] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:54] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:17:54] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:17:54] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:17:54] [INFO ] [Real]Added 373 Read/Feed constraints in 30 ms returned sat
[2024-05-22 14:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:17:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:17:54] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:17:54] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:17:54] [INFO ] [Nat]Added 373 Read/Feed constraints in 45 ms returned sat
[2024-05-22 14:17:54] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 23 ms.
[2024-05-22 14:17:54] [INFO ] Added : 8 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-22 14:17:55] [INFO ] Invariant cache hit.
[2024-05-22 14:17:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 14:17:55] [INFO ] Invariant cache hit.
[2024-05-22 14:17:55] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:17:55] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-22 14:17:55] [INFO ] Redundant transitions in 5 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-22 14:17:55] [INFO ] Invariant cache hit.
[2024-05-22 14:17:55] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 26935 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 57052ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 57056ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 7 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-22 14:18:52] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 14:18:52] [INFO ] Implicit Places using invariants in 93 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 22 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-22 14:18:52] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 14:18:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 14:18:53] [INFO ] Invariant cache hit.
[2024-05-22 14:18:53] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:18:53] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58509 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-22 14:18:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22515 resets) in 2208 ms. (452 steps per ms)
BEST_FIRST walk for 1000001 steps (2104 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:18:56] [INFO ] Invariant cache hit.
[2024-05-22 14:18:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:56] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:56] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:18:56] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:18:56] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-22 14:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:18:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:18:56] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:18:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 14:18:56] [INFO ] [Nat]Added 361 Read/Feed constraints in 34 ms returned sat
[2024-05-22 14:18:56] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 22 ms.
[2024-05-22 14:18:56] [INFO ] Added : 10 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:18:56] [INFO ] Invariant cache hit.
[2024-05-22 14:18:57] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 14:18:57] [INFO ] Invariant cache hit.
[2024-05-22 14:18:57] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:18:57] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
[2024-05-22 14:18:57] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:18:57] [INFO ] Invariant cache hit.
[2024-05-22 14:18:57] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:18:59] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-22 14:18:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25461 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 55563ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 55570ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56196 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (907 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (84 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (84 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1207777 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :0 out of 2
Probabilistic random walk after 1207777 steps, saw 147534 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
[2024-05-22 14:19:56] [INFO ] Invariant cache hit.
[2024-05-22 14:19:56] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (902 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (83 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1683418 steps, run timeout after 3001 ms. (steps per millisecond=560 ) properties seen :0 out of 1
Probabilistic random walk after 1683418 steps, saw 204382 distinct states, run finished after 3001 ms. (steps per millisecond=560 ) properties seen :0
[2024-05-22 14:19:59] [INFO ] Invariant cache hit.
[2024-05-22 14:19:59] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:20:00] [INFO ] Invariant cache hit.
[2024-05-22 14:20:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 14:20:00] [INFO ] Invariant cache hit.
[2024-05-22 14:20:00] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:20:00] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2024-05-22 14:20:00] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:20:00] [INFO ] Invariant cache hit.
[2024-05-22 14:20:00] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:20:03] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-22 14:20:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25607 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 55733ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 55739ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56346 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 2 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:20:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 14:20:56] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:20:56] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:20:56] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:20:56] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:20:56] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:20:56] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 53 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 185528 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:20:56] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (198 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:20:56] [INFO ] Invariant cache hit.
[2024-05-22 14:20:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:56] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:20:56] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-22 14:20:56] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:20:56] [INFO ] [Real]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:20:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:20:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:20:56] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:20:56] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-22 14:20:56] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-22 14:20:56] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 26 ms.
[2024-05-22 14:20:57] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 13 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-22 14:20:57] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20390 resets) in 2344 ms. (426 steps per ms)
BEST_FIRST walk for 1000001 steps (1977 resets) in 542 ms. (1841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:21:00] [INFO ] Invariant cache hit.
[2024-05-22 14:21:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:21:00] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:21:00] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-22 14:21:00] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:21:00] [INFO ] [Real]Added 373 Read/Feed constraints in 31 ms returned sat
[2024-05-22 14:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:21:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:21:00] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:21:00] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:21:00] [INFO ] [Nat]Added 373 Read/Feed constraints in 30 ms returned sat
[2024-05-22 14:21:00] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-22 14:21:00] [INFO ] Added : 8 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-22 14:21:00] [INFO ] Invariant cache hit.
[2024-05-22 14:21:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 14:21:00] [INFO ] Invariant cache hit.
[2024-05-22 14:21:01] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-22 14:21:01] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-22 14:21:01] [INFO ] Redundant transitions in 4 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-22 14:21:01] [INFO ] Invariant cache hit.
[2024-05-22 14:21:01] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 27888 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 58001ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 58006ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 9 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-22 14:21:59] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 14:21:59] [INFO ] Implicit Places using invariants in 104 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 13 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-22 14:21:59] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 14:21:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 14:21:59] [INFO ] Invariant cache hit.
[2024-05-22 14:21:59] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:22:00] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 59350 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-22 14:22:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22540 resets) in 2236 ms. (447 steps per ms)
BEST_FIRST walk for 1000001 steps (2118 resets) in 496 ms. (2012 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:22:02] [INFO ] Invariant cache hit.
[2024-05-22 14:22:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:22:02] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-22 14:22:03] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:22:03] [INFO ] [Real]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-22 14:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 14:22:03] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:22:03] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-22 14:22:03] [INFO ] Added : 8 causal constraints over 2 iterations in 100 ms. Result :sat
Minimization took 173 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:22:03] [INFO ] Invariant cache hit.
[2024-05-22 14:22:03] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 14:22:03] [INFO ] Invariant cache hit.
[2024-05-22 14:22:03] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:22:04] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-22 14:22:04] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:22:04] [INFO ] Invariant cache hit.
[2024-05-22 14:22:04] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:22:06] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 14:22:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25182 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 55286ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 55291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55867 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (894 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (84 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (82 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1204410 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :0 out of 2
Probabilistic random walk after 1204410 steps, saw 147162 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
[2024-05-22 14:23:02] [INFO ] Invariant cache hit.
[2024-05-22 14:23:02] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (901 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1691463 steps, run timeout after 3001 ms. (steps per millisecond=563 ) properties seen :0 out of 1
Probabilistic random walk after 1691463 steps, saw 204946 distinct states, run finished after 3001 ms. (steps per millisecond=563 ) properties seen :0
[2024-05-22 14:23:06] [INFO ] Invariant cache hit.
[2024-05-22 14:23:06] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-22 14:23:06] [INFO ] Invariant cache hit.
[2024-05-22 14:23:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 14:23:06] [INFO ] Invariant cache hit.
[2024-05-22 14:23:06] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:23:06] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-22 14:23:06] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-22 14:23:06] [INFO ] Invariant cache hit.
[2024-05-22 14:23:06] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-22 14:23:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-22 14:23:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 25864 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 55996ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 56000ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56537 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 1 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:24:02] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 14:24:02] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:24:02] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-22 14:24:02] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:24:02] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:24:02] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:24:03] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 75 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 186396 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-22 14:24:03] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (202 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (21 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:24:03] [INFO ] Invariant cache hit.
[2024-05-22 14:24:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:03] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:03] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-22 14:24:03] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-22 14:24:03] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:24:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:24:03] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:24:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-22 14:24:03] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-22 14:24:03] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-22 14:24:03] [INFO ] Added : 7 causal constraints over 2 iterations in 103 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 11 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-22 14:24:03] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20485 resets) in 2212 ms. (451 steps per ms)
BEST_FIRST walk for 1000001 steps (1977 resets) in 497 ms. (2008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:24:06] [INFO ] Invariant cache hit.
[2024-05-22 14:24:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:24:06] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:24:06] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 14:24:06] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:24:06] [INFO ] [Real]Added 374 Read/Feed constraints in 35 ms returned sat
[2024-05-22 14:24:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:24:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 14:24:06] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:24:06] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-22 14:24:06] [INFO ] [Nat]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-22 14:24:06] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-22 14:24:06] [INFO ] Added : 7 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 299 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-22 14:24:07] [INFO ] Invariant cache hit.
[2024-05-22 14:24:07] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 14:24:07] [INFO ] Invariant cache hit.
[2024-05-22 14:24:07] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-22 14:24:07] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2024-05-22 14:24:07] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-22 14:24:07] [INFO ] Invariant cache hit.
[2024-05-22 14:24:07] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 26954 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 57058ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 57066ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 11 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-22 14:25:05] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 14:25:05] [INFO ] Implicit Places using invariants in 113 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 13 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-22 14:25:05] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 14:25:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 14:25:05] [INFO ] Invariant cache hit.
[2024-05-22 14:25:05] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:25:05] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58534 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-22 14:25:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22585 resets) in 2219 ms. (450 steps per ms)
BEST_FIRST walk for 1000001 steps (2094 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-22 14:25:08] [INFO ] Invariant cache hit.
[2024-05-22 14:25:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:25:08] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 14:25:08] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 14:25:08] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:25:08] [INFO ] [Real]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:25:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 14:25:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-22 14:25:08] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 14:25:08] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-22 14:25:08] [INFO ] [Nat]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-22 14:25:08] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 21 ms.
[2024-05-22 14:25:08] [INFO ] Added : 5 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:25:09] [INFO ] Invariant cache hit.
[2024-05-22 14:25:09] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 14:25:09] [INFO ] Invariant cache hit.
[2024-05-22 14:25:09] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:25:09] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-22 14:25:09] [INFO ] Redundant transitions in 1 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:25:09] [INFO ] Invariant cache hit.
[2024-05-22 14:25:09] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:25:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:25:12] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25250 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 55377ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55966 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (902 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (83 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1074624 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :0 out of 2
Probabilistic random walk after 1074624 steps, saw 130479 distinct states, run finished after 3002 ms. (steps per millisecond=357 ) properties seen :0
[2024-05-22 14:26:08] [INFO ] Invariant cache hit.
[2024-05-22 14:26:08] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 14:26:08] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 497ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (914 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1620632 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :0 out of 1
Probabilistic random walk after 1620632 steps, saw 196810 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
[2024-05-22 14:26:11] [INFO ] Invariant cache hit.
[2024-05-22 14:26:11] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 14:26:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-22 14:26:12] [INFO ] Invariant cache hit.
[2024-05-22 14:26:12] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 14:26:12] [INFO ] Invariant cache hit.
[2024-05-22 14:26:12] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-22 14:26:12] [INFO ] Implicit Places using invariants and state equation in 524 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-22 14:26:12] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-22 14:26:12] [INFO ] Invariant cache hit.
[2024-05-22 14:26:12] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:26:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-22 14:26:16] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25792 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 55903ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 55907ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56541 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 4 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 14:27:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 14:27:08] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 14:27:08] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 14:27:08] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 14:27:08] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 50 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14 in 185701 ms.
[2024-05-22 14:27:08] [INFO ] Flatten gal took : 54 ms
[2024-05-22 14:27:08] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-22 14:27:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 408 transitions and 1599 arcs took 6 ms.
Total runtime 2004775 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-010
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 155
TRANSITIONS: 408
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.001s]
SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2431
MODEL NAME: /home/mcc/execution/409/model
155 places, 408 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="CANInsertWithFailure-PT-010"
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 CANInsertWithFailure-PT-010, 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 r069-tall-171620503800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 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 ;