Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r313-tall-167873966100422.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 01:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 01:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 02:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 02:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891526851

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:45:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:45:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:45:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:45:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:45:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2023-03-15 14:45:29] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 19 ms.
[2023-03-15 14:45:29] [INFO ] Unfolded HLPN to a Petri net with 494 places and 11780 transitions 111159 arcs in 179 ms.
[2023-03-15 14:45:29] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:45:29] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:45:29] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:45:29] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 20 places in 35 ms
Reduce places removed 20 places and 20 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 559 resets, run finished after 775 ms. (steps per millisecond=12 ) properties (out of 36) seen :14
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 22) seen :13
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-15 14:45:30] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2023-03-15 14:45:30] [INFO ] Computed 72 place invariants in 75 ms
[2023-03-15 14:45:31] [INFO ] [Real]Absence check using 65 positive place invariants in 20 ms returned sat
[2023-03-15 14:45:31] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:45:31] [INFO ] After 597ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-15 14:45:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:32] [INFO ] After 112ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:7
[2023-03-15 14:45:32] [INFO ] After 311ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:7
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-15 14:45:32] [INFO ] After 1450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:7
[2023-03-15 14:45:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 27 ms returned sat
[2023-03-15 14:45:32] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:45:34] [INFO ] After 1995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-15 14:45:35] [INFO ] After 945ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-15 14:45:36] [INFO ] Deduced a trap composed of 226 places in 364 ms of which 1 ms to minimize.
[2023-03-15 14:45:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2023-03-15 14:45:37] [INFO ] Deduced a trap composed of 123 places in 378 ms of which 1 ms to minimize.
[2023-03-15 14:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 498 ms
[2023-03-15 14:45:37] [INFO ] After 3069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-15 14:45:38] [INFO ] After 6140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 818 ms.
Support contains 63 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1625
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 60 place count 439 transition count 1602
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 106 place count 416 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 415 transition count 1601
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 415 transition count 1601
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 413 transition count 1599
Applied a total of 112 rules in 193 ms. Remains 413 /474 variables (removed 61) and now considering 1599/1650 (removed 51) transitions.
[2023-03-15 14:45:39] [INFO ] Flow matrix only has 1590 transitions (discarded 9 similar events)
// Phase 1: matrix 1590 rows 413 cols
[2023-03-15 14:45:39] [INFO ] Computed 62 place invariants in 40 ms
[2023-03-15 14:45:40] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 413/474 places, 984/1650 transitions.
Applied a total of 0 rules in 22 ms. Remains 413 /413 variables (removed 0) and now considering 984/984 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 807 ms. Remains : 413/474 places, 984/1650 transitions.
Incomplete random walk after 1000000 steps, including 65501 resets, run finished after 6592 ms. (steps per millisecond=151 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 9495 resets, run finished after 1421 ms. (steps per millisecond=703 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:45:48] [INFO ] Flow matrix only has 975 transitions (discarded 9 similar events)
// Phase 1: matrix 975 rows 413 cols
[2023-03-15 14:45:48] [INFO ] Computed 62 place invariants in 27 ms
[2023-03-15 14:45:48] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:45:48] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:45:48] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:48] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 14:45:48] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-15 14:45:48] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:48] [INFO ] After 78ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 164 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 172 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 172 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 166 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 160 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 172 places in 217 ms of which 0 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 164 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 162 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:45:55] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:45:55] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:45:55] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:45:55] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 159 places in 211 ms of which 1 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 3 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:45:57] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:45:57] [INFO ] Deduced a trap composed of 164 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:45:58] [INFO ] Deduced a trap composed of 168 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:45:58] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:45:58] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2023-03-15 14:45:58] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:45:59] [INFO ] Deduced a trap composed of 170 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:45:59] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:45:59] [INFO ] Deduced a trap composed of 162 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:46:00] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:46:00] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:46:00] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:46:01] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:46:01] [INFO ] Deduced a trap composed of 168 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:46:01] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:46:01] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:46:02] [INFO ] Deduced a trap composed of 156 places in 216 ms of which 1 ms to minimize.
[2023-03-15 14:46:02] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2023-03-15 14:46:02] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 162 places in 221 ms of which 0 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 158 places in 227 ms of which 4 ms to minimize.
[2023-03-15 14:46:03] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:46:04] [INFO ] Deduced a trap composed of 168 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:46:05] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:46:05] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:46:06] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:46:06] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:46:07] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:46:07] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 2 ms to minimize.
[2023-03-15 14:46:07] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 14:46:13] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 3 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:46:15] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:46:15] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:46:16] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:46:16] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2023-03-15 14:46:17] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2023-03-15 14:46:17] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:46:26] [INFO ] Trap strengthening (SAT) tested/added 73/73 trap constraints in 38022 ms
[2023-03-15 14:46:26] [INFO ] After 38138ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:46:26] [INFO ] After 38536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 984/984 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 412 transition count 983
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 412 transition count 981
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 410 transition count 981
Applied a total of 6 rules in 61 ms. Remains 410 /413 variables (removed 3) and now considering 981/984 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 410/413 places, 981/984 transitions.
Incomplete random walk after 1000000 steps, including 72734 resets, run finished after 8907 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9701 resets, run finished after 1688 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5678403 steps, run timeout after 30001 ms. (steps per millisecond=189 ) properties seen :{}
Probabilistic random walk after 5678403 steps, saw 984601 distinct states, run finished after 30004 ms. (steps per millisecond=189 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:47:07] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2023-03-15 14:47:07] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-15 14:47:07] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-15 14:47:07] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:47:07] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:47:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 10 ms returned sat
[2023-03-15 14:47:07] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:08] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 175 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 179 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 177 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 1 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:47:12] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:47:13] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:47:14] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:47:15] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:47:16] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 181 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:47:17] [INFO ] Deduced a trap composed of 175 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 169 places in 210 ms of which 1 ms to minimize.
[2023-03-15 14:47:18] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 1 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:47:19] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:21] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 154 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 3 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 173 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 154 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Deduced a trap composed of 156 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:47:36] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:36] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 0 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 164 places in 186 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 179 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:47:41] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:47:46] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Trap strengthening (SAT) tested/added 105/105 trap constraints in 49278 ms
[2023-03-15 14:47:57] [INFO ] After 49378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:47:57] [INFO ] After 49759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 36 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 24 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 14:47:57] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:47:57] [INFO ] Invariant cache hit.
[2023-03-15 14:47:57] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-15 14:47:57] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:47:57] [INFO ] Invariant cache hit.
[2023-03-15 14:47:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:47:59] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2470 ms to find 0 implicit places.
[2023-03-15 14:47:59] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-15 14:47:59] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:47:59] [INFO ] Invariant cache hit.
[2023-03-15 14:48:00] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2922 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7330 resets, run finished after 1070 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:48:01] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:48:01] [INFO ] Invariant cache hit.
[2023-03-15 14:48:01] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:48:01] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 18 ms returned sat
[2023-03-15 14:48:01] [INFO ] After 207ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:48:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:48:01] [INFO ] After 30ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:48:02] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:48:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2023-03-15 14:48:02] [INFO ] After 563ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:02] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:48:02] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 14:48:02] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 14:48:02] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:02] [INFO ] After 179ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:48:02] [INFO ] Deduced a trap composed of 174 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 168 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 0 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 172 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:06] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2023-03-15 14:48:07] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:48:08] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 169 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 154 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:48:14] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:14] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:14] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:48:14] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 160 places in 189 ms of which 0 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:48:15] [INFO ] Deduced a trap composed of 152 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:48:16] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:48:16] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2023-03-15 14:48:16] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:48:17] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:48:17] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:17] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:18] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:48:18] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:48:19] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:48:20] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 2 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:21] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:48:22] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 3 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 173 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:48:24] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:48:25] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:48:25] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:48:25] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:48:26] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:48:26] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:48:26] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:48:27] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:48:27] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:48:27] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:48:28] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:48:28] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:48:28] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 170 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:48:29] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:48:30] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:48:31] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:48:32] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:48:35] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 156 places in 189 ms of which 1 ms to minimize.
[2023-03-15 14:48:36] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:48:37] [INFO ] Deduced a trap composed of 156 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:48:39] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:48:40] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:48:42] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:48:48] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:48:57] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 54819 ms
[2023-03-15 14:48:57] [INFO ] After 55171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:48:57] [INFO ] After 55458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72641 resets, run finished after 8999 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9727 resets, run finished after 1707 ms. (steps per millisecond=585 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5596977 steps, run timeout after 30001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 5596977 steps, saw 970163 distinct states, run finished after 30001 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:49:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:49:38] [INFO ] Invariant cache hit.
[2023-03-15 14:49:38] [INFO ] [Real]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-15 14:49:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:49:38] [INFO ] After 233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:49:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:49:38] [INFO ] After 67ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:49:38] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:49:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:49:38] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 14 ms returned sat
[2023-03-15 14:49:39] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:49:39] [INFO ] After 202ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:39] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:49:40] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:49:41] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 175 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:49:42] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:43] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:49:44] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2023-03-15 14:49:45] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 168 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-15 14:49:46] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:49:47] [INFO ] Deduced a trap composed of 158 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:49:48] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:49:48] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:49:48] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:49:49] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 4 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 168 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:49:50] [INFO ] Deduced a trap composed of 171 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:49:51] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2023-03-15 14:49:52] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:49:53] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:49:53] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:49:53] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:49:54] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:49:55] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:49:56] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:49:56] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:49:57] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 1 ms to minimize.
[2023-03-15 14:49:58] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:49:58] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:49:58] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-15 14:49:59] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:50:01] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:01] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:50:01] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:50:02] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:50:02] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:50:03] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 173 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:50:04] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:50:05] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:08] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:50:08] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:50:08] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:09] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:50:09] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:50:10] [INFO ] Deduced a trap composed of 156 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:50:10] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:50:11] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:50:12] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:12] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:50:13] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2023-03-15 14:50:13] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:50:14] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:14] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:50:15] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:50:15] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:50:15] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:50:19] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:50:19] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:50:19] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:50:20] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:50:20] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:50:21] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:50:21] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:21] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:50:22] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:50:23] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:23] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:25] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:50:34] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 55408 ms
[2023-03-15 14:50:34] [INFO ] After 55710ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:50:34] [INFO ] After 56019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 29 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 14:50:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:50:34] [INFO ] Invariant cache hit.
[2023-03-15 14:50:35] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-15 14:50:35] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:50:35] [INFO ] Invariant cache hit.
[2023-03-15 14:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:37] [INFO ] Implicit Places using invariants and state equation in 1745 ms returned []
Implicit Place search using SMT with State Equation took 2108 ms to find 0 implicit places.
[2023-03-15 14:50:37] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 14:50:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:50:37] [INFO ] Invariant cache hit.
[2023-03-15 14:50:37] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2519 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7286 resets, run finished after 912 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:50:38] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:50:38] [INFO ] Invariant cache hit.
[2023-03-15 14:50:38] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:50:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-15 14:50:38] [INFO ] After 205ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:38] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:50:38] [INFO ] Deduced a trap composed of 169 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:50:39] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:50:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 489 ms
[2023-03-15 14:50:39] [INFO ] After 544ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:39] [INFO ] After 825ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:39] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:50:39] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:50:39] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:39] [INFO ] After 176ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:39] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 174 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:50:40] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:50:41] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:42] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:43] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:50:44] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:50:45] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:50:46] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:50:47] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:50:48] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:49] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 164 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:50] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:50:51] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 1 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:50:52] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:53] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:50:53] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:54] [INFO ] Deduced a trap composed of 156 places in 208 ms of which 0 ms to minimize.
[2023-03-15 14:50:55] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:50:55] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:50:56] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:50:56] [INFO ] Deduced a trap composed of 154 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:50:56] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2023-03-15 14:50:56] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:50:57] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:50:58] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:50:58] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:50:58] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:50:59] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:50:59] [INFO ] Deduced a trap composed of 166 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:50:59] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:50:59] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:51:00] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:51:00] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:51:00] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:51:01] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:51:01] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:01] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:51:02] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:02] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:51:02] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Deduced a trap composed of 166 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:51:03] [INFO ] Deduced a trap composed of 166 places in 192 ms of which 0 ms to minimize.
[2023-03-15 14:51:04] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:04] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:51:04] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:05] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 14:51:05] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:05] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:05] [INFO ] Deduced a trap composed of 170 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:51:06] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:51:06] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:06] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:07] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:08] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:51:09] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2023-03-15 14:51:09] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 3 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 158 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:51:18] [INFO ] Deduced a trap composed of 152 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:51:34] [INFO ] Trap strengthening (SAT) tested/added 111/111 trap constraints in 54729 ms
[2023-03-15 14:51:34] [INFO ] After 54968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:51:34] [INFO ] After 55231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 719 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 542791 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :{}
Probabilistic random walk after 542791 steps, saw 88284 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:37] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:51:37] [INFO ] Invariant cache hit.
[2023-03-15 14:51:37] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-15 14:51:37] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:51:37] [INFO ] After 219ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:51:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:37] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:37] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:51:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:51:38] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:38] [INFO ] After 140ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:51:41] [INFO ] Deduced a trap composed of 154 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 185 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 175 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 179 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:51:46] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:51:46] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 160 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:51:48] [INFO ] Deduced a trap composed of 173 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:48] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 156 places in 213 ms of which 0 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:51] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:51:51] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:51:51] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:51:51] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:51:52] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:52] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:51:52] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2023-03-15 14:51:53] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:51:53] [INFO ] Deduced a trap composed of 160 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:53] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:51:54] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:54] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:51:54] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:51:54] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:55] [INFO ] Deduced a trap composed of 152 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:51:55] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:51:55] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:55] [INFO ] Deduced a trap composed of 162 places in 204 ms of which 0 ms to minimize.
[2023-03-15 14:51:56] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:51:56] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:51:56] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:51:57] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:51:57] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:51:57] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 154 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:51:58] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 1 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 165 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:52:02] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24555 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:52:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:52:02] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 20 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 14:52:02] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:52:02] [INFO ] Invariant cache hit.
[2023-03-15 14:52:03] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 ms. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 10000 steps, including 744 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 557713 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 557713 steps, saw 90637 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:52:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:52:06] [INFO ] Invariant cache hit.
[2023-03-15 14:52:06] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:52:06] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:52:06] [INFO ] After 235ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:52:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:07] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:07] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 14:52:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 13 ms returned sat
[2023-03-15 14:52:07] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:07] [INFO ] After 137ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:07] [INFO ] Deduced a trap composed of 166 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:52:07] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 164 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:52:09] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 0 ms to minimize.
[2023-03-15 14:52:10] [INFO ] Deduced a trap composed of 154 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 185 places in 210 ms of which 0 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:52:11] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:52:12] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 1 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:52:13] [INFO ] Deduced a trap composed of 179 places in 195 ms of which 1 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 0 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 171 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:52:14] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:52:15] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:52:15] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:52:16] [INFO ] Deduced a trap composed of 160 places in 191 ms of which 1 ms to minimize.
[2023-03-15 14:52:16] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:52:16] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2023-03-15 14:52:17] [INFO ] Deduced a trap composed of 158 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:52:17] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:52:17] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:52:18] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:52:18] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2023-03-15 14:52:18] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:18] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:19] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:52:19] [INFO ] Deduced a trap composed of 164 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:52:19] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 1 ms to minimize.
[2023-03-15 14:52:19] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2023-03-15 14:52:20] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2023-03-15 14:52:20] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:52:20] [INFO ] Deduced a trap composed of 162 places in 202 ms of which 1 ms to minimize.
[2023-03-15 14:52:21] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-15 14:52:21] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:52:21] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 158 places in 196 ms of which 0 ms to minimize.
[2023-03-15 14:52:23] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:52:23] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-15 14:52:23] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 1 ms to minimize.
[2023-03-15 14:52:23] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-15 14:52:24] [INFO ] Deduced a trap composed of 152 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:52:24] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:52:24] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:52:25] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2023-03-15 14:52:25] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2023-03-15 14:52:25] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 166 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 1 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 154 places in 203 ms of which 1 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 158 places in 199 ms of which 1 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 166 places in 197 ms of which 1 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 166 places in 198 ms of which 1 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2023-03-15 14:52:29] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 1 ms to minimize.
[2023-03-15 14:52:32] [INFO ] Trap strengthening (SAT) tested/added 75/75 trap constraints in 24563 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:52:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:52:32] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 27 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 15 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2023-03-15 14:52:32] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:52:32] [INFO ] Invariant cache hit.
[2023-03-15 14:52:32] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-15 14:52:32] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:52:32] [INFO ] Invariant cache hit.
[2023-03-15 14:52:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:34] [INFO ] Implicit Places using invariants and state equation in 1798 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2023-03-15 14:52:34] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 14:52:34] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
[2023-03-15 14:52:34] [INFO ] Invariant cache hit.
[2023-03-15 14:52:34] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2577 ms. Remains : 410/410 places, 981/981 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 116 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2023-03-15 14:52:34] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-15 14:52:34] [INFO ] [Real]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:52:34] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:52:34] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:52:34] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:52:35] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 1 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 154 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 152 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 160 places in 179 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 154 places in 184 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 154 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 159 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 154 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 162 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:19] [INFO ] Trap strengthening (SAT) tested/added 89/89 trap constraints in 224705 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:56:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:56:19] [INFO ] After 225024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
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 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 75 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:56:19] [INFO ] Invariant cache hit.
[2023-03-15 14:56:20] [INFO ] [Real]Absence check using 55 positive place invariants in 9 ms returned sat
[2023-03-15 14:56:20] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:56:20] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:56:20] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2023-03-15 14:56:20] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 14:56:20] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:20] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:56:20] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:56:20] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 0 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:56:22] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 156 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 160 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:56:24] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 1 ms to minimize.
[2023-03-15 14:56:25] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 154 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 152 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 164 places in 164 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 164 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 166 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 152 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 0 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 164 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 162 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 156 places in 165 ms of which 1 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 0 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 1 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 154 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 166 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 1 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 4 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 160 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 158 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 1 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 150 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 0 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 154 places in 172 ms of which 1 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 1 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 152 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 0 ms to minimize.
[2023-03-15 14:56:52] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:53] [INFO ] Deduced a trap composed of 166 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:56:53] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:56:53] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 0 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 1 ms to minimize.
[2023-03-15 14:56:55] [INFO ] Deduced a trap composed of 158 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 164 places in 176 ms of which 0 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 0 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 0 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 0 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 158 places in 172 ms of which 0 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 162 places in 171 ms of which 0 ms to minimize.
[2023-03-15 15:00:05] [INFO ] Trap strengthening (SAT) tested/added 169/169 trap constraints in 224677 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:00:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:00:05] [INFO ] After 225018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 876798 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J20
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 48 places, 38 transitions, 140 arcs.
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P12)>=1)))
(potential((tk(P3)>=1) & (tk(P6)>=1) & (tk(P7)>=1)))
(potential((tk(P3)>=1) & (tk(P10)>=1) & (tk(P8)>=1)))
(potential((tk(P3)>=1) & (tk(P11)>=1) & (tk(P9)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P13)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P14)>=1)))
(potential((tk(P16)>=1) & (tk(P46)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P33)>=1) & (tk(P28)>=1)))
(potential((tk(P15)>=1) & (tk(P29)>=1)))
(potential((tk(P15)>=1) & (tk(P30)>=1)))
(potential((tk(P15)>=1) & (tk(P31)>=1)))
(potential((tk(P15)>=1) & (tk(P32)>=1)))
(potential((tk(P26)>=1) & (tk(P34)>=1) & (tk(P35)>=1) & (tk(P37)>=1)))
(potential((tk(P37)>=1) & (tk(P38)>=1) & (tk(P25)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P39)>=1) & (tk(P45)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P27)>=1) & (tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P41)>=1)))
FORMULA QuasiLiveness FALSE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678892406566

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;