fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r121-tall-167814499400307
Last Updated
May 14, 2023

About the Execution of Smart+red for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5550.300 1800000.00 2169838.00 3529.50 [undef] Time out reached

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.r121-tall-167814499400307.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 DES-PT-60a, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-167814499400307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 110K Mar 5 18:22 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 1678395350944

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=DES-PT-60a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 20:55:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-09 20:55:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:55:52] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-09 20:55:52] [INFO ] Transformed 354 places.
[2023-03-09 20:55:52] [INFO ] Transformed 311 transitions.
[2023-03-09 20:55:52] [INFO ] Found NUPN structural information;
[2023-03-09 20:55:52] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 131 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 354/354 places, 311/311 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 354 transition count 297
Applied a total of 14 rules in 21 ms. Remains 354 /354 variables (removed 0) and now considering 297/311 (removed 14) transitions.
// Phase 1: matrix 297 rows 354 cols
[2023-03-09 20:55:52] [INFO ] Computed 59 place invariants in 45 ms
[2023-03-09 20:55:53] [INFO ] Implicit Places using invariants in 727 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 755 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 353/354 places, 297/311 transitions.
Applied a total of 0 rules in 16 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 793 ms. Remains : 353/354 places, 297/311 transitions.
Discarding 9 transitions out of 297. Remains 288
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 224 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 287) seen :61
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 226) seen :0
Running SMT prover for 226 properties.
// Phase 1: matrix 297 rows 353 cols
[2023-03-09 20:55:54] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-09 20:55:55] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-09 20:55:55] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-09 20:55:57] [INFO ] After 3053ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:226
[2023-03-09 20:55:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-09 20:55:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 141 ms returned sat
[2023-03-09 20:56:22] [INFO ] After 12397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :225
[2023-03-09 20:56:22] [INFO ] After 12398ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :225
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-09 20:56:22] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :225
Fused 226 Parikh solutions to 59 different solutions.
Parikh walk visited 198 properties in 24269 ms.
Support contains 33 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 297/297 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 352 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 352 transition count 294
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 85 ms. Remains 352 /353 variables (removed 1) and now considering 294/297 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 352/353 places, 294/297 transitions.
Incomplete random walk after 1000000 steps, including 13477 resets, run finished after 25855 ms. (steps per millisecond=38 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 233 resets, run finished after 578 ms. (steps per millisecond=173 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 220 resets, run finished after 633 ms. (steps per millisecond=157 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 178 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 180 resets, run finished after 575 ms. (steps per millisecond=173 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 729 resets, run finished after 756 ms. (steps per millisecond=132 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 724 resets, run finished after 795 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 726 resets, run finished after 713 ms. (steps per millisecond=140 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 729 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 246 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 236 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 233 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 253 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 250 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 232 resets, run finished after 544 ms. (steps per millisecond=183 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 231 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 250 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 250 resets, run finished after 460 ms. (steps per millisecond=217 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 250 resets, run finished after 493 ms. (steps per millisecond=202 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 238 resets, run finished after 527 ms. (steps per millisecond=189 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 245 resets, run finished after 556 ms. (steps per millisecond=179 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 243 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 244 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 253 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 233 resets, run finished after 554 ms. (steps per millisecond=180 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 248 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 235 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 229 resets, run finished after 561 ms. (steps per millisecond=178 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 246 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 25222479 steps, run timeout after 126001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 25222479 steps, saw 3053110 distinct states, run finished after 126005 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 20:59:34] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 20:59:35] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 20:59:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 20:59:35] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-09 20:59:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 20:59:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 66 ms returned sat
[2023-03-09 20:59:37] [INFO ] After 1378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 20:59:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:59:38] [INFO ] After 1006ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-09 20:59:39] [INFO ] After 2382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1082 ms.
[2023-03-09 20:59:40] [INFO ] After 5399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 18502 ms.
Support contains 33 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 13 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-09 20:59:59] [INFO ] Invariant cache hit.
[2023-03-09 20:59:59] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-09 20:59:59] [INFO ] Invariant cache hit.
[2023-03-09 20:59:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:59:59] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2023-03-09 20:59:59] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 20:59:59] [INFO ] Invariant cache hit.
[2023-03-09 21:00:00] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 809 ms. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 100000 steps, including 1357 resets, run finished after 2735 ms. (steps per millisecond=36 ) properties (out of 33) seen :5
Running SMT prover for 28 properties.
[2023-03-09 21:00:02] [INFO ] Invariant cache hit.
[2023-03-09 21:00:02] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:00:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:00:03] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :28
[2023-03-09 21:00:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:00:03] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :28
[2023-03-09 21:00:03] [INFO ] After 712ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :25 real:3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-09 21:00:03] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :25 real:3
[2023-03-09 21:00:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:00:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-09 21:00:23] [INFO ] After 20009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 21:00:24] [INFO ] After 673ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-09 21:00:24] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2023-03-09 21:00:24] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2023-03-09 21:00:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-09 21:00:27] [INFO ] After 3360ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 665 ms.
[2023-03-09 21:00:27] [INFO ] After 24217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Incomplete random walk after 1000000 steps, including 13510 resets, run finished after 23407 ms. (steps per millisecond=42 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 236 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 232 resets, run finished after 539 ms. (steps per millisecond=185 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 182 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 175 resets, run finished after 553 ms. (steps per millisecond=180 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 727 resets, run finished after 734 ms. (steps per millisecond=136 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 728 resets, run finished after 751 ms. (steps per millisecond=133 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 730 resets, run finished after 833 ms. (steps per millisecond=120 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 731 resets, run finished after 570 ms. (steps per millisecond=175 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 228 resets, run finished after 425 ms. (steps per millisecond=235 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 247 resets, run finished after 444 ms. (steps per millisecond=225 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 242 resets, run finished after 457 ms. (steps per millisecond=218 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 235 resets, run finished after 446 ms. (steps per millisecond=224 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 248 resets, run finished after 630 ms. (steps per millisecond=158 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 231 resets, run finished after 417 ms. (steps per millisecond=239 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 247 resets, run finished after 486 ms. (steps per millisecond=205 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 236 resets, run finished after 471 ms. (steps per millisecond=212 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 250 resets, run finished after 567 ms. (steps per millisecond=176 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 241 resets, run finished after 568 ms. (steps per millisecond=176 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 240 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 224 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 229 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100000 steps, including 235 resets, run finished after 524 ms. (steps per millisecond=190 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 241 resets, run finished after 530 ms. (steps per millisecond=188 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 236 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 235 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 251 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 251 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 251 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 28) seen :0
Interrupted probabilistic random walk after 20847910 steps, run timeout after 114001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 20847910 steps, saw 2551404 distinct states, run finished after 114001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 28 properties.
[2023-03-09 21:03:00] [INFO ] Invariant cache hit.
[2023-03-09 21:03:01] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:03:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:03:02] [INFO ] After 1449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-09 21:03:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:03:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:03:04] [INFO ] After 1219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 21:03:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:03:05] [INFO ] After 1020ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-09 21:03:05] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2023-03-09 21:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-09 21:03:06] [INFO ] After 2605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1222 ms.
[2023-03-09 21:03:07] [INFO ] After 5611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Parikh walk visited 0 properties in 15282 ms.
Support contains 33 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 12 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 11 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2023-03-09 21:03:23] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-09 21:03:23] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:03:23] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-09 21:03:23] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 21:03:23] [INFO ] Invariant cache hit.
[2023-03-09 21:03:23] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 787 ms. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 100000 steps, including 1347 resets, run finished after 2120 ms. (steps per millisecond=47 ) properties (out of 33) seen :5
Running SMT prover for 28 properties.
[2023-03-09 21:03:26] [INFO ] Invariant cache hit.
[2023-03-09 21:03:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:03:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:03:26] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :28
[2023-03-09 21:03:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:03:26] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :28
[2023-03-09 21:03:27] [INFO ] After 688ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :25 real:3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 21:03:27] [INFO ] After 943ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :25 real:3
[2023-03-09 21:03:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:03:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 93 ms returned sat
[2023-03-09 21:03:52] [INFO ] After 25648ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 21:03:53] [INFO ] After 654ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :28
[2023-03-09 21:03:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-09 21:03:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-09 21:03:55] [INFO ] After 2890ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1107 ms.
[2023-03-09 21:03:56] [INFO ] After 29854ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Incomplete random walk after 10000 steps, including 134 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1627332 steps, run timeout after 3001 ms. (steps per millisecond=542 ) properties seen :{}
Probabilistic random walk after 1627332 steps, saw 228356 distinct states, run finished after 3001 ms. (steps per millisecond=542 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 21:04:00] [INFO ] Invariant cache hit.
[2023-03-09 21:04:00] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:00] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2023-03-09 21:04:00] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:00] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:00] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 0 ms to minimize.
[2023-03-09 21:04:00] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2023-03-09 21:04:00] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-09 21:04:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2023-03-09 21:04:00] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:04:00] [INFO ] After 817ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 50 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1499443 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1499443 steps, saw 209218 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:04] [INFO ] Computed 60 place invariants in 15 ms
[2023-03-09 21:04:04] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2023-03-09 21:04:04] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:04] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:04] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:04] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:04:04] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3002 steps, including 2 resets, run visited all 1 properties in 9 ms. (steps per millisecond=333 )
Parikh walk visited 1 properties in 8 ms.
Finished random walk after 133 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Incomplete random walk after 10000 steps, including 132 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1496563 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :{}
Probabilistic random walk after 1496563 steps, saw 208620 distinct states, run finished after 3002 ms. (steps per millisecond=498 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:07] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 21:04:07] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-09 21:04:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:07] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 67 ms returned sat
[2023-03-09 21:04:08] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:08] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:08] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-09 21:04:08] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-09 21:04:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-03-09 21:04:08] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:04:08] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 31 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1616470 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{}
Probabilistic random walk after 1616470 steps, saw 226691 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:11] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:04:11] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 19 ms returned sat
[2023-03-09 21:04:11] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 134 ms returned sat
[2023-03-09 21:04:12] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:12] [INFO ] After 25ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:12] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2023-03-09 21:04:12] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-09 21:04:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-09 21:04:12] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-09 21:04:12] [INFO ] After 1040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 10 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:04:12] [INFO ] Invariant cache hit.
[2023-03-09 21:04:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-09 21:04:12] [INFO ] Invariant cache hit.
[2023-03-09 21:04:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:13] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-09 21:04:13] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 21:04:13] [INFO ] Invariant cache hit.
[2023-03-09 21:04:13] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:13] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:13] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 134 ms returned sat
[2023-03-09 21:04:14] [INFO ] After 470ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:14] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 21:04:14] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 138 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1633939 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :{}
Probabilistic random walk after 1633939 steps, saw 229295 distinct states, run finished after 3001 ms. (steps per millisecond=544 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:17] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:17] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:17] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2023-03-09 21:04:17] [INFO ] After 290ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:17] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:17] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:04:17] [INFO ] After 552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 27 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1597402 steps, run timeout after 3004 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1597402 steps, saw 223728 distinct states, run finished after 3005 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:21] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:04:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:21] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 226 ms returned sat
[2023-03-09 21:04:21] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:21] [INFO ] After 30ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:22] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 21:04:22] [INFO ] After 856ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3159 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=287 )
Parikh walk visited 1 properties in 10 ms.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 134 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1586923 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :{}
Probabilistic random walk after 1586923 steps, saw 221954 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:25] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:25] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2023-03-09 21:04:25] [INFO ] After 206ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:25] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:25] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:04:25] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 26 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1594485 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1594485 steps, saw 223233 distinct states, run finished after 3002 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:28] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:28] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-09 21:04:29] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:29] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:29] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:04:29] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2999 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=249 )
Parikh walk visited 1 properties in 11 ms.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1519196 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 1519196 steps, saw 212441 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:32] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:32] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:32] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-09 21:04:32] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:32] [INFO ] After 27ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:32] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:04:32] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 24 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1538057 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1538057 steps, saw 215221 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:36] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:36] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:36] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-09 21:04:36] [INFO ] After 266ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:36] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:36] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:04:36] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:04:36] [INFO ] Invariant cache hit.
[2023-03-09 21:04:36] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-09 21:04:36] [INFO ] Invariant cache hit.
[2023-03-09 21:04:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:37] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-09 21:04:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:04:37] [INFO ] Invariant cache hit.
[2023-03-09 21:04:37] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 904 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:37] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:04:37] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:04:37] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 101 ms returned sat
[2023-03-09 21:04:38] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:38] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:04:38] [INFO ] After 412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1570923 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{}
Probabilistic random walk after 1570923 steps, saw 219857 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:41] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:41] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:04:41] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-09 21:04:41] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:41] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:41] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:04:41] [INFO ] After 508ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 22 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1576806 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1576806 steps, saw 220669 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:44] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-09 21:04:44] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:04:45] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:04:45] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:45] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:45] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:04:45] [INFO ] After 336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:04:45] [INFO ] Invariant cache hit.
[2023-03-09 21:04:45] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-09 21:04:45] [INFO ] Invariant cache hit.
[2023-03-09 21:04:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:46] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2023-03-09 21:04:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:04:46] [INFO ] Invariant cache hit.
[2023-03-09 21:04:46] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:46] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:04:46] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:46] [INFO ] After 146ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 21:04:46] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-09 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-09 21:04:46] [INFO ] After 260ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:46] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:04:46] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:46] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:04:46] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522301 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522301 steps, saw 212894 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:49] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:04:50] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:50] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 30 ms returned sat
[2023-03-09 21:04:50] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:50] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:50] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:04:50] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 24 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1583691 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :{}
Probabilistic random walk after 1583691 steps, saw 221536 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:53] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 21:04:53] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:54] [INFO ] After 305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 97 ms returned sat
[2023-03-09 21:04:54] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:54] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:54] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:04:54] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:04:54] [INFO ] Invariant cache hit.
[2023-03-09 21:04:54] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-09 21:04:54] [INFO ] Invariant cache hit.
[2023-03-09 21:04:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:55] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-09 21:04:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:04:55] [INFO ] Invariant cache hit.
[2023-03-09 21:04:55] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 919 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:04:55] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:04:55] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:04:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:55] [INFO ] After 147ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 21:04:55] [INFO ] After 189ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:04:56] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 128 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1590680 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1590680 steps, saw 222531 distinct states, run finished after 3002 ms. (steps per millisecond=529 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:04:59] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:04:59] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:04:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:04:59] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:04:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:04:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2023-03-09 21:04:59] [INFO ] After 590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:04:59] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:04:59] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-09 21:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-09 21:05:00] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:00] [INFO ] After 875ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 20 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1588982 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :{}
Probabilistic random walk after 1588982 steps, saw 222195 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:03] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:05:03] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:03] [INFO ] After 315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 105 ms returned sat
[2023-03-09 21:05:03] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:03] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:04] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2023-03-09 21:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-09 21:05:04] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 21:05:04] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 3059 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=382 )
Parikh walk visited 1 properties in 7 ms.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1560710 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1560710 steps, saw 218578 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:07] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:05:07] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:05:07] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:05:07] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:07] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:07] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:07] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 123 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1600430 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :{}
Probabilistic random walk after 1600430 steps, saw 224255 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:10] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:05:11] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-09 21:05:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-09 21:05:11] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:05:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2023-03-09 21:05:11] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:11] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:11] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2023-03-09 21:05:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 21:05:11] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:05:11] [INFO ] After 616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:11] [INFO ] Invariant cache hit.
[2023-03-09 21:05:11] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-09 21:05:11] [INFO ] Invariant cache hit.
[2023-03-09 21:05:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:12] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2023-03-09 21:05:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:05:12] [INFO ] Invariant cache hit.
[2023-03-09 21:05:12] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 934 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:12] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:05:12] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:12] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:05:13] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:13] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 21:05:13] [INFO ] After 429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 134 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1526374 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1526374 steps, saw 213501 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:16] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:05:16] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:16] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2023-03-09 21:05:16] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:16] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:16] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:16] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 21 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1526484 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1526484 steps, saw 213520 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:20] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:05:20] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:20] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2023-03-09 21:05:20] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:20] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:20] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 21:05:20] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:20] [INFO ] Invariant cache hit.
[2023-03-09 21:05:20] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 21:05:20] [INFO ] Invariant cache hit.
[2023-03-09 21:05:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:21] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-09 21:05:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:05:21] [INFO ] Invariant cache hit.
[2023-03-09 21:05:21] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 941 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 17 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:21] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:05:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:21] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 136 ms returned sat
[2023-03-09 21:05:22] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:22] [INFO ] After 191ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:05:22] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 125 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1531963 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :{}
Probabilistic random walk after 1531963 steps, saw 214378 distinct states, run finished after 3001 ms. (steps per millisecond=510 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:25] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:05:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:05:25] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2023-03-09 21:05:25] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:25] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:25] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:05:25] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 28 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1598295 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :{}
Probabilistic random walk after 1598295 steps, saw 223866 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:28] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:05:28] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 21:05:29] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:05:29] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:29] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-09 21:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 21:05:29] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:29] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:29] [INFO ] Invariant cache hit.
[2023-03-09 21:05:29] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-09 21:05:29] [INFO ] Invariant cache hit.
[2023-03-09 21:05:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:30] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2023-03-09 21:05:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:05:30] [INFO ] Invariant cache hit.
[2023-03-09 21:05:30] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 996 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:30] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:05:30] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:30] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:05:31] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:31] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:05:31] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 130 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1533780 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1533780 steps, saw 214621 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:34] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:05:34] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:34] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:05:34] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:34] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:34] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:05:34] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1622991 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :{}
Probabilistic random walk after 1622991 steps, saw 227743 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:37] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 21:05:38] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:38] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 145 ms returned sat
[2023-03-09 21:05:38] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:38] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:38] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-09 21:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 21:05:38] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-09 21:05:38] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:38] [INFO ] Invariant cache hit.
[2023-03-09 21:05:38] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 21:05:38] [INFO ] Invariant cache hit.
[2023-03-09 21:05:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:39] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2023-03-09 21:05:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:05:39] [INFO ] Invariant cache hit.
[2023-03-09 21:05:39] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 930 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 14 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:39] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:05:39] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:39] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:05:40] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:40] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:40] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 123 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1641647 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :{}
Probabilistic random walk after 1641647 steps, saw 230297 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:43] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:05:43] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:43] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:43] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2023-03-09 21:05:43] [INFO ] After 368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:43] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:43] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:05:43] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 18 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1573335 steps, run timeout after 3001 ms. (steps per millisecond=524 ) properties seen :{}
Probabilistic random walk after 1573335 steps, saw 220175 distinct states, run finished after 3001 ms. (steps per millisecond=524 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:46] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:05:47] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:47] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:05:47] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:47] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:47] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 10 ms to minimize.
[2023-03-09 21:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 21:05:47] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:05:47] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:47] [INFO ] Invariant cache hit.
[2023-03-09 21:05:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-09 21:05:47] [INFO ] Invariant cache hit.
[2023-03-09 21:05:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:48] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-09 21:05:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:05:48] [INFO ] Invariant cache hit.
[2023-03-09 21:05:48] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 965 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:48] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:05:48] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:48] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:05:49] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:49] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-09 21:05:49] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1561674 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1561674 steps, saw 218719 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:05:52] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:05:52] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:05:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:05:52] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 85 ms returned sat
[2023-03-09 21:05:52] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:52] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:52] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-09 21:05:52] [INFO ] After 587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 32 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1562067 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1562067 steps, saw 218773 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:56] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:05:56] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:05:56] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:05:56] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:56] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:56] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-09 21:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-09 21:05:56] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:05:56] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:05:56] [INFO ] Invariant cache hit.
[2023-03-09 21:05:56] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-09 21:05:56] [INFO ] Invariant cache hit.
[2023-03-09 21:05:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:05:57] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2023-03-09 21:05:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:05:57] [INFO ] Invariant cache hit.
[2023-03-09 21:05:57] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:05:57] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:05:57] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:05:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:05:57] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:05:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:05:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:05:58] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:05:58] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:05:58] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1589454 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :{}
Probabilistic random walk after 1589454 steps, saw 222249 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:01] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:06:01] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:01] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:06:01] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:01] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:01] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 21:06:01] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 23 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1638064 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1638064 steps, saw 229813 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:05] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:06:05] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:05] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:06:05] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:05] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:05] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-09 21:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-09 21:06:05] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:06:05] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:05] [INFO ] Invariant cache hit.
[2023-03-09 21:06:05] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 21:06:05] [INFO ] Invariant cache hit.
[2023-03-09 21:06:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:06] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2023-03-09 21:06:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:06:06] [INFO ] Invariant cache hit.
[2023-03-09 21:06:06] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 909 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:06] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:06:06] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:06] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 151 ms returned sat
[2023-03-09 21:06:07] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:07] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:06:07] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 140 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1516375 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :{}
Probabilistic random walk after 1516375 steps, saw 212046 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:10] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:06:10] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:10] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 85 ms returned sat
[2023-03-09 21:06:10] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:10] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:10] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:06:10] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1641505 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1641505 steps, saw 230280 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:14] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:06:14] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:14] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:14] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:06:14] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:14] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:14] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2023-03-09 21:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 21:06:14] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:06:14] [INFO ] After 617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:14] [INFO ] Invariant cache hit.
[2023-03-09 21:06:14] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-09 21:06:14] [INFO ] Invariant cache hit.
[2023-03-09 21:06:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:15] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
[2023-03-09 21:06:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:06:15] [INFO ] Invariant cache hit.
[2023-03-09 21:06:15] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:15] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:06:15] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:15] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:06:16] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:16] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:06:16] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 128 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1539088 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1539088 steps, saw 215369 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:19] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:06:19] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:19] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2023-03-09 21:06:19] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:19] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:19] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:06:19] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 18 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1542508 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1542508 steps, saw 215958 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:22] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:06:23] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:23] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:06:23] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:23] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:23] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-09 21:06:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 21:06:23] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:06:23] [INFO ] After 639ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:23] [INFO ] Invariant cache hit.
[2023-03-09 21:06:23] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 21:06:23] [INFO ] Invariant cache hit.
[2023-03-09 21:06:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:24] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2023-03-09 21:06:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:06:24] [INFO ] Invariant cache hit.
[2023-03-09 21:06:24] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 875 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:24] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:06:24] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:24] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:24] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:06:25] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:25] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:06:25] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 134 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1550408 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1550408 steps, saw 217112 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:28] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-09 21:06:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:06:28] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2023-03-09 21:06:28] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:28] [INFO ] After 20ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:28] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:06:28] [INFO ] After 592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1572263 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{}
Probabilistic random walk after 1572263 steps, saw 220020 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:31] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:06:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:31] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-09 21:06:32] [INFO ] After 280ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:32] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:32] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:06:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-03-09 21:06:32] [INFO ] After 123ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:06:32] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:32] [INFO ] Invariant cache hit.
[2023-03-09 21:06:32] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-09 21:06:32] [INFO ] Invariant cache hit.
[2023-03-09 21:06:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:33] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-09 21:06:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:06:33] [INFO ] Invariant cache hit.
[2023-03-09 21:06:33] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 919 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:33] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:06:33] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:33] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:06:33] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:33] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:06:34] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 129 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1560273 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1560273 steps, saw 218521 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:37] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:06:37] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-09 21:06:37] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:06:37] [INFO ] After 378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:37] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:37] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:06:37] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 17 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1642480 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :{}
Probabilistic random walk after 1642480 steps, saw 230414 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:40] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:06:40] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:40] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-09 21:06:41] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:41] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:41] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:06:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 21:06:41] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:06:41] [INFO ] After 635ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:41] [INFO ] Invariant cache hit.
[2023-03-09 21:06:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-09 21:06:41] [INFO ] Invariant cache hit.
[2023-03-09 21:06:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:42] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2023-03-09 21:06:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:06:42] [INFO ] Invariant cache hit.
[2023-03-09 21:06:42] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 930 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:42] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:06:42] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:42] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:06:42] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:42] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:06:42] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 135 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1553864 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1553864 steps, saw 217611 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:46] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:06:46] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:46] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:06:46] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:46] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:46] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 21:06:46] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 18 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1652670 steps, run timeout after 3001 ms. (steps per millisecond=550 ) properties seen :{}
Probabilistic random walk after 1652670 steps, saw 231808 distinct states, run finished after 3001 ms. (steps per millisecond=550 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:49] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-09 21:06:49] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:49] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:06:50] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:50] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:50] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2023-03-09 21:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 21:06:50] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:06:50] [INFO ] After 599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:50] [INFO ] Invariant cache hit.
[2023-03-09 21:06:50] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-09 21:06:50] [INFO ] Invariant cache hit.
[2023-03-09 21:06:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:51] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2023-03-09 21:06:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:06:51] [INFO ] Invariant cache hit.
[2023-03-09 21:06:51] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 944 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:51] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:06:51] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:06:51] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-09 21:06:51] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:51] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-09 21:06:51] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 138 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1571317 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{}
Probabilistic random walk after 1571317 steps, saw 219913 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:06:55] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:06:55] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:06:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:55] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-09 21:06:55] [INFO ] After 364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:55] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:55] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-09 21:06:55] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 18 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1568034 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :{}
Probabilistic random walk after 1568034 steps, saw 219512 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:06:58] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:06:58] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:06:58] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:06:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:06:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:06:59] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:06:59] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:06:59] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2023-03-09 21:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 21:06:59] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:06:59] [INFO ] After 640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 9 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:06:59] [INFO ] Invariant cache hit.
[2023-03-09 21:06:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-09 21:06:59] [INFO ] Invariant cache hit.
[2023-03-09 21:06:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:00] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-09 21:07:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:07:00] [INFO ] Invariant cache hit.
[2023-03-09 21:07:00] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 916 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:00] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:07:00] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:00] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:07:00] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:00] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-09 21:07:00] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 131 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1559998 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1559998 steps, saw 218487 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:03] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:07:04] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:07:04] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-09 21:07:04] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:04] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:04] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:04] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 17 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1493928 steps, run timeout after 3001 ms. (steps per millisecond=497 ) properties seen :{}
Probabilistic random walk after 1493928 steps, saw 208312 distinct states, run finished after 3001 ms. (steps per millisecond=497 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:07] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:07:07] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-09 21:07:08] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:08] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:08] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2023-03-09 21:07:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-09 21:07:08] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:07:08] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 8 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:08] [INFO ] Invariant cache hit.
[2023-03-09 21:07:08] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-09 21:07:08] [INFO ] Invariant cache hit.
[2023-03-09 21:07:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:09] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-09 21:07:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:07:09] [INFO ] Invariant cache hit.
[2023-03-09 21:07:09] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 911 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:09] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:07:09] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:09] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:07:09] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:09] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:09] [INFO ] After 420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 138 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1540564 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1540564 steps, saw 215632 distinct states, run finished after 3001 ms. (steps per millisecond=513 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:12] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-09 21:07:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:07:13] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:07:13] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:13] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:13] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:13] [INFO ] After 595ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 17 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1617980 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :{}
Probabilistic random walk after 1617980 steps, saw 226894 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:16] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:07:16] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:16] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2023-03-09 21:07:17] [INFO ] After 274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:17] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:17] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-09 21:07:17] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:07:17] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:17] [INFO ] Invariant cache hit.
[2023-03-09 21:07:17] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-09 21:07:17] [INFO ] Invariant cache hit.
[2023-03-09 21:07:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:18] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-09 21:07:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:07:18] [INFO ] Invariant cache hit.
[2023-03-09 21:07:18] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:18] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:07:18] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:07:18] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:18] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:18] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1552313 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1552313 steps, saw 217406 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:22] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:07:22] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2023-03-09 21:07:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:22] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2023-03-09 21:07:22] [INFO ] After 377ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:22] [INFO ] After 32ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:22] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-09 21:07:22] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 19 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1613972 steps, run timeout after 3001 ms. (steps per millisecond=537 ) properties seen :{}
Probabilistic random walk after 1613972 steps, saw 226311 distinct states, run finished after 3001 ms. (steps per millisecond=537 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:25] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:07:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:25] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 139 ms returned sat
[2023-03-09 21:07:26] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:26] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:26] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 0 ms to minimize.
[2023-03-09 21:07:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-03-09 21:07:26] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:26] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:26] [INFO ] Invariant cache hit.
[2023-03-09 21:07:26] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-09 21:07:26] [INFO ] Invariant cache hit.
[2023-03-09 21:07:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:27] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-09 21:07:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:07:27] [INFO ] Invariant cache hit.
[2023-03-09 21:07:27] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:27] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-09 21:07:27] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:27] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:07:28] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:28] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:07:28] [INFO ] After 424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 136 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1568109 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :{}
Probabilistic random walk after 1568109 steps, saw 219520 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:31] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:07:31] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-09 21:07:31] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 83 ms returned sat
[2023-03-09 21:07:31] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:31] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:31] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:31] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 18 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1534852 steps, run timeout after 3001 ms. (steps per millisecond=511 ) properties seen :{}
Probabilistic random walk after 1534852 steps, saw 214748 distinct states, run finished after 3001 ms. (steps per millisecond=511 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:34] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-09 21:07:34] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:07:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:35] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:07:35] [INFO ] After 288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:35] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:35] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2023-03-09 21:07:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 21:07:35] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:07:35] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:35] [INFO ] Invariant cache hit.
[2023-03-09 21:07:35] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-09 21:07:35] [INFO ] Invariant cache hit.
[2023-03-09 21:07:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:36] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-09 21:07:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:07:36] [INFO ] Invariant cache hit.
[2023-03-09 21:07:36] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 901 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 15 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:36] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:07:36] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:36] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 147 ms returned sat
[2023-03-09 21:07:37] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:37] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:37] [INFO ] After 423ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 133 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1549955 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1549955 steps, saw 217042 distinct states, run finished after 3002 ms. (steps per millisecond=516 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:40] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:07:40] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:07:40] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-09 21:07:40] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:40] [INFO ] After 15ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:40] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:40] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 27 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1591452 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1591452 steps, saw 222680 distinct states, run finished after 3001 ms. (steps per millisecond=530 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:43] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:07:43] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2023-03-09 21:07:44] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-09 21:07:44] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:07:44] [INFO ] After 268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:44] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:44] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-09 21:07:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-09 21:07:44] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-09 21:07:44] [INFO ] After 602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 26 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:44] [INFO ] Invariant cache hit.
[2023-03-09 21:07:44] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-09 21:07:44] [INFO ] Invariant cache hit.
[2023-03-09 21:07:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:45] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 791 ms to find 0 implicit places.
[2023-03-09 21:07:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 21:07:45] [INFO ] Invariant cache hit.
[2023-03-09 21:07:45] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 973 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 12 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:45] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:07:45] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:45] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:07:46] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:46] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:46] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 132 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1595020 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1595020 steps, saw 223324 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:49] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:07:49] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:07:49] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-09 21:07:49] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:49] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:49] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-09 21:07:49] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 351 transition count 293
Applied a total of 2 rules in 17 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1641386 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1641386 steps, saw 230261 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:52] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:07:53] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:53] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-09 21:07:53] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:53] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:53] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-09 21:07:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-09 21:07:53] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-09 21:07:53] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:07:53] [INFO ] Invariant cache hit.
[2023-03-09 21:07:53] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-09 21:07:53] [INFO ] Invariant cache hit.
[2023-03-09 21:07:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:54] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-09 21:07:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:07:54] [INFO ] Invariant cache hit.
[2023-03-09 21:07:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 932 ms. Remains : 351/351 places, 293/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 11 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:07:54] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-09 21:07:54] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:54] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:07:55] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:55] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:55] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 135 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1637589 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :{}
Probabilistic random walk after 1637589 steps, saw 229756 distinct states, run finished after 3001 ms. (steps per millisecond=545 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:07:58] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-09 21:07:58] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:07:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-09 21:07:58] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:07:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:07:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2023-03-09 21:07:58] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:07:58] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:07:58] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:07:58] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 294/294 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 351 transition count 293
Applied a total of 1 rules in 13 ms. Remains 351 /352 variables (removed 1) and now considering 293/294 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 351/352 places, 293/294 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1658162 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :{}
Probabilistic random walk after 1658162 steps, saw 232642 distinct states, run finished after 3001 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 293 rows 351 cols
[2023-03-09 21:08:01] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-09 21:08:02] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:08:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 21:08:02] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:08:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:08:02] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2023-03-09 21:08:02] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:08:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:08:02] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 21:08:02] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-09 21:08:02] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 351 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 351/351 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 6 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2023-03-09 21:08:02] [INFO ] Invariant cache hit.
[2023-03-09 21:08:02] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-09 21:08:02] [INFO ] Invariant cache hit.
[2023-03-09 21:08:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 21:08:03] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 702 ms to find 0 implicit places.
[2023-03-09 21:08:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 21:08:03] [INFO ] Invariant cache hit.
[2023-03-09 21:08:03] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 351/351 places, 293/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 351 /351 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-09 21:08:03] [INFO ] Invariant cache hit.
[2023-03-09 21:08:03] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-09 21:08:03] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-09 21:08:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 21:08:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-09 21:08:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 184 ms returned sat
[2023-03-09 21:08:03] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 21:08:03] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 21:08:03] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Applied a total of 0 rules in 7 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 28 properties.
// Phase 1: matrix 294 rows 352 cols
[2023-03-09 21:08:04] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-09 21:08:04] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:08:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-09 21:08:04] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2023-03-09 21:08:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-09 21:08:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 70 ms returned sat
[2023-03-09 21:08:06] [INFO ] After 1489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :28
[2023-03-09 21:08:07] [INFO ] After 2833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :28
Attempting to minimize the solution found.
Minimization took 1051 ms.
[2023-03-09 21:08:08] [INFO ] After 4444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :28
Unable to solve all queries for examination QuasiLiveness. Remains :28 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 28 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 736472 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DES (PT), instance 60a
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: 354 places, 311 transitions, 1496 arcs.
(potential((tk(P261)>=1) & (tk(P259)>=1)))
(potential((tk(P327)>=1) & (tk(P323)>=1) & (tk(P319)>=1) & (tk(P315)>=1) & (tk(P313)>=1) & (tk(P317)>=1) & (tk(P321)>=1) & (tk(P325)>=1)))
(potential((tk(P331)>=1) & (tk(P329)>=1)))
(potential((tk(P340)>=1) & (tk(P338)>=1)))
(potential((tk(P344)>=1) & (tk(P342)>=1)))
(potential((tk(P354)>=1) & (tk(P352)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P265)>=1) & (tk(P263)>=1)))
(potential((tk(P246)>=1)))
(potential((tk(P244)>=1)))
(potential((tk(P242)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P3)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P4)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P5)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P6)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P7)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P8)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P9)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P10)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P11)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P12)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P13)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P14)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P15)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P16)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P17)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P18)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P19)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P20)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P21)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P22)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P23)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P24)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P25)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P26)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P27)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P28)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P29)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P30)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P31)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P32)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P33)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P34)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P35)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P36)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P37)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P38)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P39)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P40)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P41)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P42)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P43)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P44)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P45)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P46)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P47)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P48)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P49)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P50)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P51)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P52)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P53)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P54)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P55)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P56)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P57)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P58)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P59)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P60)>=1)))
(potential((tk(P273)>=1) & (tk(P275)>=1) & (tk(P2)>=1)))
(potential((tk(P62)>=1) & (tk(P350)>=1)))
(potential((tk(P63)>=1) & (tk(P350)>=1)))
(potential((tk(P64)>=1) & (tk(P350)>=1)))
(potential((tk(P65)>=1) & (tk(P350)>=1)))
(potential((tk(P66)>=1) & (tk(P350)>=1)))
(potential((tk(P67)>=1) & (tk(P350)>=1)))
(potential((tk(P68)>=1) & (tk(P350)>=1)))
(potential((tk(P69)>=1) & (tk(P350)>=1)))
(potential((tk(P70)>=1) & (tk(P350)>=1)))
(potential((tk(P71)>=1) & (tk(P350)>=1)))
(potential((tk(P72)>=1) & (tk(P350)>=1)))
(potential((tk(P73)>=1) & (tk(P350)>=1)))
(potential((tk(P74)>=1) & (tk(P350)>=1)))
(potential((tk(P75)>=1) & (tk(P350)>=1)))
(potential((tk(P76)>=1) & (tk(P350)>=1)))
(potential((tk(P77)>=1) & (tk(P350)>=1)))
(potential((tk(P78)>=1) & (tk(P350)>=1)))
(potential((tk(P79)>=1) & (tk(P350)>=1)))
(potential((tk(P80)>=1) & (tk(P350)>=1)))
(potential((tk(P81)>=1) & (tk(P350)>=1)))
(potential((tk(P82)>=1) & (tk(P350)>=1)))
(potential((tk(P83)>=1) & (tk(P350)>=1)))
(potential((tk(P84)>=1) & (tk(P350)>=1)))
(potential((tk(P85)>=1) & (tk(P350)>=1)))
(potential((tk(P86)>=1) & (tk(P350)>=1)))
(potential((tk(P87)>=1) & (tk(P350)>=1)))
(potential((tk(P88)>=1) & (tk(P350)>=1)))
(potential((tk(P89)>=1) & (tk(P350)>=1)))
(potential((tk(P90)>=1) & (tk(P350)>=1)))
(potential((tk(P91)>=1) & (tk(P350)>=1)))
(potential((tk(P92)>=1) & (tk(P350)>=1)))
(potential((tk(P93)>=1) & (tk(P350)>=1)))
(potential((tk(P94)>=1) & (tk(P350)>=1)))
(potential((tk(P95)>=1) & (tk(P350)>=1)))
(potential((tk(P96)>=1) & (tk(P350)>=1)))
(potential((tk(P97)>=1) & (tk(P350)>=1)))
(potential((tk(P98)>=1) & (tk(P350)>=1)))
(potential((tk(P99)>=1) & (tk(P350)>=1)))
(potential((tk(P100)>=1) & (tk(P350)>=1)))
(potential((tk(P101)>=1) & (tk(P350)>=1)))
(potential((tk(P102)>=1) & (tk(P350)>=1)))
(potential((tk(P103)>=1) & (tk(P350)>=1)))
(potential((tk(P104)>=1) & (tk(P350)>=1)))
(potential((tk(P105)>=1) & (tk(P350)>=1)))
(potential((tk(P106)>=1) & (tk(P350)>=1)))
(potential((tk(P107)>=1) & (tk(P350)>=1)))
(potential((tk(P108)>=1) & (tk(P350)>=1)))
(potential((tk(P109)>=1) & (tk(P350)>=1)))
(potential((tk(P110)>=1) & (tk(P350)>=1)))
(potential((tk(P111)>=1) & (tk(P350)>=1)))
(potential((tk(P112)>=1) & (tk(P350)>=1)))
(potential((tk(P113)>=1) & (tk(P350)>=1)))
(potential((tk(P114)>=1) & (tk(P350)>=1)))
(potential((tk(P115)>=1) & (tk(P350)>=1)))
(potential((tk(P116)>=1) & (tk(P350)>=1)))
(potential((tk(P117)>=1) & (tk(P350)>=1)))
(potential((tk(P118)>=1) & (tk(P350)>=1)))
(potential((tk(P119)>=1) & (tk(P350)>=1)))
(potential((tk(P120)>=1) & (tk(P350)>=1)))
(potential((tk(P61)>=1) & (tk(P350)>=1)))
(potential((tk(P182)>=1) & (tk(P245)>=1)))
(potential((tk(P183)>=1) & (tk(P245)>=1)))
(potential((tk(P184)>=1) & (tk(P245)>=1)))
(potential((tk(P185)>=1) & (tk(P245)>=1)))
(potential((tk(P186)>=1) & (tk(P245)>=1)))
(potential((tk(P187)>=1) & (tk(P245)>=1)))
(potential((tk(P188)>=1) & (tk(P245)>=1)))
(potential((tk(P189)>=1) & (tk(P245)>=1)))
(potential((tk(P190)>=1) & (tk(P245)>=1)))
(potential((tk(P191)>=1) & (tk(P245)>=1)))
(potential((tk(P192)>=1) & (tk(P245)>=1)))
(potential((tk(P193)>=1) & (tk(P245)>=1)))
(potential((tk(P194)>=1) & (tk(P245)>=1)))
(potential((tk(P195)>=1) & (tk(P245)>=1)))
(potential((tk(P196)>=1) & (tk(P245)>=1)))
(potential((tk(P197)>=1) & (tk(P245)>=1)))
(potential((tk(P198)>=1) & (tk(P245)>=1)))
(potential((tk(P199)>=1) & (tk(P245)>=1)))
(potential((tk(P200)>=1) & (tk(P245)>=1)))
(potential((tk(P201)>=1) & (tk(P245)>=1)))
(potential((tk(P202)>=1) & (tk(P245)>=1)))
(potential((tk(P203)>=1) & (tk(P245)>=1)))
(potential((tk(P204)>=1) & (tk(P245)>=1)))
(potential((tk(P205)>=1) & (tk(P245)>=1)))
(potential((tk(P206)>=1) & (tk(P245)>=1)))
(potential((tk(P207)>=1) & (tk(P245)>=1)))
(potential((tk(P208)>=1) & (tk(P245)>=1)))
(potential((tk(P209)>=1) & (tk(P245)>=1)))
(potential((tk(P210)>=1) & (tk(P245)>=1)))
(potential((tk(P211)>=1) & (tk(P245)>=1)))
(potential((tk(P212)>=1) & (tk(P245)>=1)))
(potential((tk(P213)>=1) & (tk(P245)>=1)))
(potential((tk(P214)>=1) & (tk(P245)>=1)))
(potential((tk(P215)>=1) & (tk(P245)>=1)))
(potential((tk(P216)>=1) & (tk(P245)>=1)))
(potential((tk(P217)>=1) & (tk(P245)>=1)))
(potential((tk(P218)>=1) & (tk(P245)>=1)))
(potential((tk(P219)>=1) & (tk(P245)>=1)))
(potential((tk(P220)>=1) & (tk(P245)>=1)))
(potential((tk(P221)>=1) & (tk(P245)>=1)))
(potential((tk(P222)>=1) & (tk(P245)>=1)))
(potential((tk(P223)>=1) & (tk(P245)>=1)))
(potential((tk(P224)>=1) & (tk(P245)>=1)))
(potential((tk(P225)>=1) & (tk(P245)>=1)))
(potential((tk(P226)>=1) & (tk(P245)>=1)))
(potential((tk(P227)>=1) & (tk(P245)>=1)))
(potential((tk(P228)>=1) & (tk(P245)>=1)))
(potential((tk(P229)>=1) & (tk(P245)>=1)))
(potential((tk(P230)>=1) & (tk(P245)>=1)))
(potential((tk(P231)>=1) & (tk(P245)>=1)))
(potential((tk(P232)>=1) & (tk(P245)>=1)))
(potential((tk(P233)>=1) & (tk(P245)>=1)))
(potential((tk(P234)>=1) & (tk(P245)>=1)))
(potential((tk(P235)>=1) & (tk(P245)>=1)))
(potential((tk(P236)>=1) & (tk(P245)>=1)))
(potential((tk(P237)>=1) & (tk(P245)>=1)))
(potential((tk(P238)>=1) & (tk(P245)>=1)))
(potential((tk(P239)>=1) & (tk(P245)>=1)))
(potential((tk(P240)>=1) & (tk(P245)>=1)))
(potential((tk(P181)>=1) & (tk(P245)>=1)))
(potential((tk(P121)>=1) & (tk(P270)>=1)))
(potential((tk(P180)>=1) & (tk(P270)>=1)))
(potential((tk(P179)>=1) & (tk(P270)>=1)))
(potential((tk(P178)>=1) & (tk(P270)>=1)))
(potential((tk(P177)>=1) & (tk(P270)>=1)))
(potential((tk(P176)>=1) & (tk(P270)>=1)))
(potential((tk(P175)>=1) & (tk(P270)>=1)))
(potential((tk(P174)>=1) & (tk(P270)>=1)))
(potential((tk(P173)>=1) & (tk(P270)>=1)))
(potential((tk(P172)>=1) & (tk(P270)>=1)))
(potential((tk(P171)>=1) & (tk(P270)>=1)))
(potential((tk(P170)>=1) & (tk(P270)>=1)))
(potential((tk(P169)>=1) & (tk(P270)>=1)))
(potential((tk(P168)>=1) & (tk(P270)>=1)))
(potential((tk(P167)>=1) & (tk(P270)>=1)))
(potential((tk(P166)>=1) & (tk(P270)>=1)))
(potential((tk(P165)>=1) & (tk(P270)>=1)))
(potential((tk(P164)>=1) & (tk(P270)>=1)))
(potential((tk(P163)>=1) & (tk(P270)>=1)))
(potential((tk(P162)>=1) & (tk(P270)>=1)))
(potential((tk(P161)>=1) & (tk(P270)>=1)))
(potential((tk(P160)>=1) & (tk(P270)>=1)))
(potential((tk(P159)>=1) & (tk(P270)>=1)))
(potential((tk(P158)>=1) & (tk(P270)>=1)))
(potential((tk(P157)>=1) & (tk(P270)>=1)))
(potential((tk(P156)>=1) & (tk(P270)>=1)))
(potential((tk(P155)>=1) & (tk(P270)>=1)))
(potential((tk(P154)>=1) & (tk(P270)>=1)))
(potential((tk(P153)>=1) & (tk(P270)>=1)))
(potential((tk(P152)>=1) & (tk(P270)>=1)))
(potential((tk(P151)>=1) & (tk(P270)>=1)))
(potential((tk(P150)>=1) & (tk(P270)>=1)))
(potential((tk(P149)>=1) & (tk(P270)>=1)))
(potential((tk(P148)>=1) & (tk(P270)>=1)))
(potential((tk(P147)>=1) & (tk(P270)>=1)))
(potential((tk(P146)>=1) & (tk(P270)>=1)))
(potential((tk(P145)>=1) & (tk(P270)>=1)))
(potential((tk(P144)>=1) & (tk(P270)>=1)))
(potential((tk(P143)>=1) & (tk(P270)>=1)))
(potential((tk(P142)>=1) & (tk(P270)>=1)))
(potential((tk(P141)>=1) & (tk(P270)>=1)))
(potential((tk(P140)>=1) & (tk(P270)>=1)))
(potential((tk(P139)>=1) & (tk(P270)>=1)))
(potential((tk(P138)>=1) & (tk(P270)>=1)))
(potential((tk(P137)>=1) & (tk(P270)>=1)))
(potential((tk(P136)>=1) & (tk(P270)>=1)))
(potential((tk(P135)>=1) & (tk(P270)>=1)))
(potential((tk(P134)>=1) & (tk(P270)>=1)))
(potential((tk(P133)>=1) & (tk(P270)>=1)))
(potential((tk(P132)>=1) & (tk(P270)>=1)))
(potential((tk(P131)>=1) & (tk(P270)>=1)))
(potential((tk(P130)>=1) & (tk(P270)>=1)))
(potential((tk(P129)>=1) & (tk(P270)>=1)))
(potential((tk(P128)>=1) & (tk(P270)>=1)))
(potential((tk(P127)>=1) & (tk(P270)>=1)))
(potential((tk(P126)>=1) & (tk(P270)>=1)))
(potential((tk(P125)>=1) & (tk(P270)>=1)))
(potential((tk(P124)>=1) & (tk(P270)>=1)))
(potential((tk(P123)>=1) & (tk(P270)>=1)))
(potential((tk(P122)>=1) & (tk(P270)>=1)))
(potential((tk(P246)>=1) & (tk(P268)>=1)))
(potential((tk(P246)>=1) & (tk(P268)>=1)))
(potential((tk(P246)>=1) & (tk(P268)>=1)))
(potential((tk(P246)>=1) & (tk(P268)>=1)))
(potential((tk(P246)>=1) & (tk(P268)>=1)))
(potential((tk(P242)>=1) & (tk(P255)>=1)))
(potential((tk(P242)>=1) & (tk(P255)>=1)))
(potential((tk(P244)>=1) & (tk(P264)>=1)))
(potential((tk(P244)>=1) & (tk(P264)>=1)))
(potential((tk(P249)>=1) & (tk(P334)>=1)))
(potential((tk(P249)>=1) & (tk(P334)>=1)))
(potential((tk(P249)>=1) & (tk(P334)>=1)))
(potential((tk(P254)>=1) & (tk(P328)>=1)))
(potential((tk(P251)>=1) & (tk(P345)>=1)))
(potential((tk(P251)>=1) & (tk(P345)>=1)))
(potential((tk(P251)>=1) & (tk(P345)>=1)))
(potential((tk(P274)>=1) & (tk(P346)>=1)))
(potential((tk(P272)>=1) & (tk(P335)>=1)))
(potential((tk(P349)>=1) & (tk(P353)>=1)))
(potential((tk(P336)>=1) & (tk(P351)>=1)))
(potential((tk(P336)>=1) & (tk(P277)>=1) & (tk(P279)>=1)))
(potential((tk(P332)>=1) & (tk(P337)>=1)))
(potential((tk(P336)>=1) & (tk(P277)>=1) & (tk(P279)>=1)))
(potential((tk(P332)>=1) & (tk(P341)>=1)))
(potential((tk(P293)>=1) & (tk(P289)>=1) & (tk(P285)>=1) & (tk(P281)>=1) & (tk(P283)>=1) & (tk(P287)>=1) & (tk(P291)>=1) & (tk(P295)>=1) & (tk(P276)>=1)))
(potential((tk(P278)>=1) & (tk(P348)>=1)))
(potential((tk(P349)>=1) & (tk(P339)>=1)))
(potential((tk(P349)>=1) & (tk(P343)>=1)))
(potential((tk(P278)>=1) & (tk(P347)>=1)))
(potential((tk(P349)>=1) & (tk(P339)>=1)))
(potential((tk(P349)>=1) & (tk(P343)>=1)))
(potential((tk(P310)>=1) & (tk(P326)>=1)))
(potential((tk(P306)>=1) & (tk(P322)>=1)))
(potential((tk(P302)>=1) & (tk(P318)>=1)))
(potential((tk(P298)>=1) & (tk(P314)>=1)))
(potential((tk(P296)>=1) & (tk(P312)>=1)))
(potential((tk(P300)>=1) & (tk(P316)>=1)))
(potential((tk(P304)>=1) & (tk(P320)>=1)))
(potential((tk(P308)>=1) & (tk(P324)>=1)))
(potential((tk(P292)>=1) & (tk(P309)>=1)))
(potential((tk(P288)>=1) & (tk(P305)>=1)))
(potential((tk(P284)>=1) & (tk(P301)>=1)))
(potential((tk(P280)>=1) & (tk(P297)>=1)))
(potential((tk(P282)>=1) & (tk(P299)>=1)))
(potential((tk(P286)>=1) & (tk(P303)>=1)))
(potential((tk(P290)>=1) & (tk(P307)>=1)))
(potential((tk(P294)>=1) & (tk(P311)>=1)))
(potential((tk(P330)>=1) & (tk(P333)>=1)))
(potential((tk(P265)>=1) & (tk(P263)>=1) & (tk(P253)>=1)))
(potential((tk(P253)>=1) & (tk(P260)>=1)))
(potential((tk(P257)>=1) & (tk(P271)>=1)))
(potential((tk(P257)>=1) & (tk(P258)>=1)))
(potential((tk(P269)>=1) & (tk(P267)>=1) & (tk(P262)>=1)))
(potential((tk(P269)>=1) & (tk(P267)>=1) & (tk(P262)>=1)))
(potential((tk(P269)>=1) & (tk(P267)>=1) & (tk(P262)>=1)))
(potential((tk(P269)>=1) & (tk(P267)>=1) & (tk(P262)>=1)))
(potential((tk(P269)>=1) & (tk(P267)>=1) & (tk(P262)>=1)))
(potential((tk(P256)>=1) & (tk(P266)>=1)))
(potential((tk(P265)>=1) & (tk(P263)>=1)))
(potential((tk(P257)>=1)))
(potential((tk(P250)>=1) & (tk(P247)>=1) & (tk(P241)>=1) & (tk(P243)>=1) & (tk(P248)>=1) & (tk(P252)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 10656956 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16161256 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
Caught signal 15, terminating.

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="DES-PT-60a"
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 DES-PT-60a, 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 r121-tall-167814499400307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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