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.r085-smll-167814406800268.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 lolaxred
Input is CloudDeployment-PT-6a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r085-smll-167814406800268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 317K 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 StableMarking

=== Now, execution of the tool begins

BK_START 1678232542489

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 23:42:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-07 23:42:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 23:42:26] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2023-03-07 23:42:26] [INFO ] Transformed 221 places.
[2023-03-07 23:42:26] [INFO ] Transformed 908 transitions.
[2023-03-07 23:42:26] [INFO ] Found NUPN structural information;
[2023-03-07 23:42:26] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 480 ms.
Graph (trivial) has 265 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 10 ms
Free SCC test removed 42 places
Structural test allowed to assert that 69 places are NOT stable. Took 31 ms.
Ensure Unique test removed 234 transitions
Reduce redundant transitions removed 234 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 790 ms. (steps per millisecond=12 ) properties (out of 152) seen :139
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:42:28] [INFO ] Flow matrix only has 258 transitions (discarded 416 similar events)
// Phase 1: matrix 258 rows 179 cols
[2023-03-07 23:42:28] [INFO ] Computed 36 place invariants in 16 ms
[2023-03-07 23:42:28] [INFO ] After 557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:42:29] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 20 ms returned sat
[2023-03-07 23:42:29] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:42:29] [INFO ] State equation strengthened by 140 read => feed constraints.
[2023-03-07 23:42:30] [INFO ] After 369ms SMT Verify possible using 140 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-07 23:42:30] [INFO ] After 925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-07 23:42:30] [INFO ] After 2071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 432 ms.
Support contains 13 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 674/674 transitions.
Drop transitions removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 179 transition count 545
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 139 place count 169 transition count 499
Iterating global reduction 1 with 10 rules applied. Total rules applied 149 place count 169 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 166 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 166 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 164 transition count 494
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 164 transition count 494
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 163 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 163 transition count 493
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 197 place count 145 transition count 559
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 1 with 108 rules applied. Total rules applied 305 place count 145 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 311 place count 145 transition count 508
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 317 place count 139 transition count 508
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 318 place count 139 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 138 transition count 507
Applied a total of 319 rules in 318 ms. Remains 138 /179 variables (removed 41) and now considering 507/674 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 138/179 places, 507/674 transitions.
Incomplete random walk after 1000000 steps, including 15263 resets, run finished after 26991 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1977 resets, run finished after 4034 ms. (steps per millisecond=247 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1968 resets, run finished after 4109 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1962 resets, run finished after 4170 ms. (steps per millisecond=239 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1974 resets, run finished after 4089 ms. (steps per millisecond=244 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1964 resets, run finished after 4139 ms. (steps per millisecond=241 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1979 resets, run finished after 4171 ms. (steps per millisecond=239 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1975 resets, run finished after 4203 ms. (steps per millisecond=237 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1964 resets, run finished after 4103 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1955 resets, run finished after 4105 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1971 resets, run finished after 4136 ms. (steps per millisecond=241 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1971 resets, run finished after 4119 ms. (steps per millisecond=242 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1982 resets, run finished after 4330 ms. (steps per millisecond=230 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1983 resets, run finished after 4235 ms. (steps per millisecond=236 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 33000788 steps, run timeout after 240001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 33000788 steps, saw 4455608 distinct states, run finished after 240006 ms. (steps per millisecond=137 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:47:52] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:47:52] [INFO ] Computed 36 place invariants in 6 ms
[2023-03-07 23:47:52] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:47:52] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 13 ms returned sat
[2023-03-07 23:47:53] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:47:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:47:53] [INFO ] After 278ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-07 23:47:53] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-07 23:47:54] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 30 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 138/138 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 28 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:47:54] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:47:54] [INFO ] Invariant cache hit.
[2023-03-07 23:47:54] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-07 23:47:54] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:47:54] [INFO ] Invariant cache hit.
[2023-03-07 23:47:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:47:55] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-07 23:47:55] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-07 23:47:55] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:47:55] [INFO ] Invariant cache hit.
[2023-03-07 23:47:55] [INFO ] Dead Transitions using invariants and state equation in 443 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1292 ms. Remains : 138/138 places, 507/507 transitions.
Incomplete random walk after 100000 steps, including 1519 resets, run finished after 2837 ms. (steps per millisecond=35 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:47:58] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:47:58] [INFO ] Invariant cache hit.
[2023-03-07 23:47:58] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 13 ms returned sat
[2023-03-07 23:47:58] [INFO ] After 196ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2023-03-07 23:47:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:47:58] [INFO ] After 127ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :13
[2023-03-07 23:47:59] [INFO ] After 558ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-07 23:47:59] [INFO ] After 944ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :13
Incomplete random walk after 1000000 steps, including 15244 resets, run finished after 26795 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1977 resets, run finished after 4041 ms. (steps per millisecond=247 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1979 resets, run finished after 4042 ms. (steps per millisecond=247 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1973 resets, run finished after 4064 ms. (steps per millisecond=246 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1973 resets, run finished after 4093 ms. (steps per millisecond=244 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1984 resets, run finished after 4111 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1981 resets, run finished after 4059 ms. (steps per millisecond=246 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1982 resets, run finished after 4038 ms. (steps per millisecond=247 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 4093 ms. (steps per millisecond=244 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1957 resets, run finished after 4069 ms. (steps per millisecond=245 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1963 resets, run finished after 4031 ms. (steps per millisecond=248 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 4055 ms. (steps per millisecond=246 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1981 resets, run finished after 4039 ms. (steps per millisecond=247 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1972 resets, run finished after 4022 ms. (steps per millisecond=248 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 34000941 steps, run timeout after 237001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 34000941 steps, saw 4578968 distinct states, run finished after 237002 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:53:15] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:15] [INFO ] Invariant cache hit.
[2023-03-07 23:53:16] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:53:16] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 19 ms returned sat
[2023-03-07 23:53:16] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:53:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:16] [INFO ] After 308ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-07 23:53:17] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 300 ms.
[2023-03-07 23:53:17] [INFO ] After 1663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 29 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 138/138 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 25 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:53:17] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:17] [INFO ] Invariant cache hit.
[2023-03-07 23:53:18] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-07 23:53:18] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:18] [INFO ] Invariant cache hit.
[2023-03-07 23:53:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:18] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2023-03-07 23:53:18] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-07 23:53:18] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:18] [INFO ] Invariant cache hit.
[2023-03-07 23:53:19] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1497 ms. Remains : 138/138 places, 507/507 transitions.
Incomplete random walk after 100000 steps, including 1513 resets, run finished after 3198 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-07 23:53:22] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:22] [INFO ] Invariant cache hit.
[2023-03-07 23:53:22] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 12 ms returned sat
[2023-03-07 23:53:22] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2023-03-07 23:53:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:22] [INFO ] After 124ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :13
[2023-03-07 23:53:23] [INFO ] After 459ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-07 23:53:23] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :13
Incomplete random walk after 10000 steps, including 148 resets, run finished after 44 ms. (steps per millisecond=227 ) 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 609525 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609525 steps, saw 111620 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:26] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:26] [INFO ] Invariant cache hit.
[2023-03-07 23:53:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:26] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 13 ms returned sat
[2023-03-07 23:53:26] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:26] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:26] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-07 23:53:26] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 17 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 146 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 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 642366 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 642366 steps, saw 116579 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:29] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:53:29] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-07 23:53:29] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:29] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-07 23:53:29] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:30] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:30] [INFO ] After 86ms 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-07 23:53:30] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 18 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:53:30] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:30] [INFO ] Invariant cache hit.
[2023-03-07 23:53:30] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-07 23:53:30] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:30] [INFO ] Invariant cache hit.
[2023-03-07 23:53:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:30] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-07 23:53:30] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-07 23:53:30] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:30] [INFO ] Invariant cache hit.
[2023-03-07 23:53:31] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1172 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 46 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:53:31] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:53:31] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:31] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-07 23:53:31] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:31] [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 6 ms.
[2023-03-07 23:53:31] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 157 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650236 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650236 steps, saw 117832 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:34] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:53:34] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-07 23:53:34] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:34] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:53:34] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:34] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:34] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-07 23:53:34] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 15 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 147 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 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652570 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652570 steps, saw 118389 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:37] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:53:37] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-07 23:53:37] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:37] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-07 23:53:38] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:38] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:38] [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 15 ms.
[2023-03-07 23:53:38] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:53:38] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:38] [INFO ] Invariant cache hit.
[2023-03-07 23:53:38] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-07 23:53:38] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:38] [INFO ] Invariant cache hit.
[2023-03-07 23:53:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:38] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-07 23:53:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 23:53:38] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:38] [INFO ] Invariant cache hit.
[2023-03-07 23:53:38] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 22 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:53:39] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:53:39] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:39] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-07 23:53:39] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:39] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-07 23:53:39] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 153 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 587419 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 587419 steps, saw 108225 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:42] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:53:42] [INFO ] Computed 36 place invariants in 9 ms
[2023-03-07 23:53:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:42] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 16 ms returned sat
[2023-03-07 23:53:42] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:42] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:42] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-07 23:53:42] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 17 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 638271 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 638271 steps, saw 115918 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:45] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:53:45] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:53:45] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:45] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-07 23:53:45] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:45] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:45] [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 18 ms.
[2023-03-07 23:53:45] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:53:45] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:45] [INFO ] Invariant cache hit.
[2023-03-07 23:53:46] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-07 23:53:46] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:46] [INFO ] Invariant cache hit.
[2023-03-07 23:53:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:46] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-07 23:53:46] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:53:46] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:46] [INFO ] Invariant cache hit.
[2023-03-07 23:53:46] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1025 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 29 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:53:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:53:46] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:47] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-07 23:53:47] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:47] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-07 23:53:47] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 588627 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 588627 steps, saw 108435 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:50] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:53:50] [INFO ] Computed 36 place invariants in 8 ms
[2023-03-07 23:53:50] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:50] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:53:50] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:50] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:50] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-07 23:53:50] [INFO ] After 241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 18 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 631994 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 631994 steps, saw 114932 distinct states, run finished after 3005 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:53] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:53:53] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-07 23:53:53] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:53] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-07 23:53:53] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:53] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:53] [INFO ] After 63ms 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-07 23:53:53] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:53:53] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:53] [INFO ] Invariant cache hit.
[2023-03-07 23:53:54] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-07 23:53:54] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:54] [INFO ] Invariant cache hit.
[2023-03-07 23:53:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:54] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-07 23:53:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-07 23:53:54] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:53:54] [INFO ] Invariant cache hit.
[2023-03-07 23:53:54] [INFO ] Dead Transitions using invariants and state equation in 307 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1014 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 17 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:53:54] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:53:54] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:54] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-07 23:53:54] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:54] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-07 23:53:54] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 153 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654443 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654443 steps, saw 118813 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:53:58] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:53:58] [INFO ] Computed 36 place invariants in 8 ms
[2023-03-07 23:53:58] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:53:58] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 19 ms returned sat
[2023-03-07 23:53:58] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:53:58] [INFO ] After 34ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:53:58] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-07 23:53:58] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 17 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625535 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625535 steps, saw 114053 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:01] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:01] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:01] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:01] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-07 23:54:01] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:01] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:01] [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 19 ms.
[2023-03-07 23:54:01] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:01] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:01] [INFO ] Invariant cache hit.
[2023-03-07 23:54:01] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-07 23:54:01] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:01] [INFO ] Invariant cache hit.
[2023-03-07 23:54:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:02] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-07 23:54:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:54:02] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:02] [INFO ] Invariant cache hit.
[2023-03-07 23:54:02] [INFO ] Dead Transitions using invariants and state equation in 571 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1160 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 24 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:02] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:54:02] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:03] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-07 23:54:03] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:03] [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 6 ms.
[2023-03-07 23:54:03] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 155 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609343 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609343 steps, saw 111594 distinct states, run finished after 3001 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:06] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:06] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-07 23:54:06] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:06] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 10 ms returned sat
[2023-03-07 23:54:06] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:06] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:06] [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 27 ms.
[2023-03-07 23:54:06] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 11 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 535470 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 535470 steps, saw 98857 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:09] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:09] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:09] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:09] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-07 23:54:09] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:09] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:09] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-07 23:54:09] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 15 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:09] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:09] [INFO ] Invariant cache hit.
[2023-03-07 23:54:10] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-07 23:54:10] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:10] [INFO ] Invariant cache hit.
[2023-03-07 23:54:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:10] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-07 23:54:10] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-07 23:54:10] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:10] [INFO ] Invariant cache hit.
[2023-03-07 23:54:11] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1298 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 23 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:11] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-07 23:54:11] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:11] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-07 23:54:11] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:11] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-07 23:54:11] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 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 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608155 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608155 steps, saw 111406 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:14] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:14] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-07 23:54:14] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:14] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:54:14] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:14] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:14] [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 24 ms.
[2023-03-07 23:54:14] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 16 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 639697 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 639697 steps, saw 116155 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:17] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:17] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:17] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:17] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-07 23:54:17] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:17] [INFO ] After 25ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:17] [INFO ] After 48ms 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-07 23:54:17] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:17] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:17] [INFO ] Invariant cache hit.
[2023-03-07 23:54:18] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-07 23:54:18] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:18] [INFO ] Invariant cache hit.
[2023-03-07 23:54:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:18] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-07 23:54:18] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:54:18] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:18] [INFO ] Invariant cache hit.
[2023-03-07 23:54:19] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1216 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 18 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:19] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:54:19] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:19] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-07 23:54:19] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:19] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-07 23:54:19] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 152 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 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 607460 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 607460 steps, saw 111303 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:22] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:22] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-07 23:54:22] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:22] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 18 ms returned sat
[2023-03-07 23:54:22] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:22] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:22] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-07 23:54:22] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 15 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 49 ms. (steps per millisecond=204 ) 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 550256 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 550256 steps, saw 101536 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:25] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:25] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:25] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:25] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-07 23:54:25] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:25] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:25] [INFO ] After 46ms 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-07 23:54:25] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:26] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:26] [INFO ] Invariant cache hit.
[2023-03-07 23:54:26] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-07 23:54:26] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:26] [INFO ] Invariant cache hit.
[2023-03-07 23:54:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:26] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-07 23:54:26] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:54:26] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:26] [INFO ] Invariant cache hit.
[2023-03-07 23:54:27] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1323 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 2 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 33 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:27] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-07 23:54:27] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:27] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-07 23:54:27] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:27] [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 6 ms.
[2023-03-07 23:54:27] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 151 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 612795 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :{}
Probabilistic random walk after 612795 steps, saw 112107 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:30] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:30] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-07 23:54:30] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:30] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:54:30] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:30] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:30] [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 22 ms.
[2023-03-07 23:54:30] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 655257 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 655257 steps, saw 118956 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:33] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:33] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:33] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-07 23:54:34] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:34] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:34] [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 26 ms.
[2023-03-07 23:54:34] [INFO ] After 208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:34] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:34] [INFO ] Invariant cache hit.
[2023-03-07 23:54:34] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-07 23:54:34] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:34] [INFO ] Invariant cache hit.
[2023-03-07 23:54:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:34] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-07 23:54:34] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-07 23:54:34] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:34] [INFO ] Invariant cache hit.
[2023-03-07 23:54:35] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 981 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 15 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:35] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-07 23:54:35] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:35] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-07 23:54:35] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:35] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-07 23:54:35] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 151 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 666481 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :{}
Probabilistic random walk after 666481 steps, saw 121010 distinct states, run finished after 3001 ms. (steps per millisecond=222 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:38] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:38] [INFO ] Computed 36 place invariants in 4 ms
[2023-03-07 23:54:38] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:38] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:54:38] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:38] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:38] [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 23 ms.
[2023-03-07 23:54:38] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 147 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 633817 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 633817 steps, saw 115215 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:41] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:41] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:41] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:41] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-07 23:54:41] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:41] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:41] [INFO ] After 46ms 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-07 23:54:41] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:41] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:41] [INFO ] Invariant cache hit.
[2023-03-07 23:54:41] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-07 23:54:41] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:41] [INFO ] Invariant cache hit.
[2023-03-07 23:54:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:42] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-07 23:54:42] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:54:42] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:42] [INFO ] Invariant cache hit.
[2023-03-07 23:54:42] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1004 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 20 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:42] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:54:42] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:42] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-07 23:54:42] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:42] [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 9 ms.
[2023-03-07 23:54:42] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 153 resets, run finished after 47 ms. (steps per millisecond=212 ) 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 597093 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :{}
Probabilistic random walk after 597093 steps, saw 109731 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:46] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:46] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-07 23:54:46] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:46] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:54:46] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:46] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:46] [INFO ] After 50ms 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-07 23:54:46] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 152 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 21 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 632764 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :{}
Probabilistic random walk after 632764 steps, saw 115036 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:49] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:49] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:49] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:49] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-07 23:54:49] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:49] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:49] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-07 23:54:49] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:49] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:49] [INFO ] Invariant cache hit.
[2023-03-07 23:54:49] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-07 23:54:49] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:49] [INFO ] Invariant cache hit.
[2023-03-07 23:54:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:50] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-07 23:54:50] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-07 23:54:50] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:50] [INFO ] Invariant cache hit.
[2023-03-07 23:54:50] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1341 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 20 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:50] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:54:51] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:51] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-07 23:54:51] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:51] [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 6 ms.
[2023-03-07 23:54:51] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 147 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 560837 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 560837 steps, saw 103451 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:54] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:54:54] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-07 23:54:54] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:54] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:54:54] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:54] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:54] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:54] [INFO ] After 50ms 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-07 23:54:54] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 153 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 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648828 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648828 steps, saw 117608 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:54:57] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:54:57] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:54:57] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:57] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-07 23:54:57] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:57] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:57] [INFO ] After 63ms 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-07 23:54:57] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:54:57] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:57] [INFO ] Invariant cache hit.
[2023-03-07 23:54:58] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-07 23:54:58] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:58] [INFO ] Invariant cache hit.
[2023-03-07 23:54:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:54:58] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-07 23:54:58] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:54:58] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:54:58] [INFO ] Invariant cache hit.
[2023-03-07 23:54:59] [INFO ] Dead Transitions using invariants and state equation in 599 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1314 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 12 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:54:59] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:54:59] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:54:59] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-07 23:54:59] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:54:59] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-07 23:54:59] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 150 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 701595 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :{}
Probabilistic random walk after 701595 steps, saw 127267 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:55:02] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-07 23:55:02] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-07 23:55:02] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:55:02] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-07 23:55:02] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:55:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:55:02] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:55:02] [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 23 ms.
[2023-03-07 23:55:02] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649884 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649884 steps, saw 117776 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-07 23:55:05] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-07 23:55:05] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-07 23:55:05] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:55:05] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-07 23:55:05] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:55:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:55:05] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-07 23:55:05] [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-07 23:55:05] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-07 23:55:05] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:55:05] [INFO ] Invariant cache hit.
[2023-03-07 23:55:06] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-07 23:55:06] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:55:06] [INFO ] Invariant cache hit.
[2023-03-07 23:55:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-07 23:55:06] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-07 23:55:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 23:55:06] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-07 23:55:06] [INFO ] Invariant cache hit.
[2023-03-07 23:55:07] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1313 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 17 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-07 23:55:07] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-07 23:55:07] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-07 23:55:07] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-07 23:55:07] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-07 23:55:07] [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 6 ms.
[2023-03-07 23:55:07] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 104 edges and 138 vertex of which 42 / 138 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 91 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 69 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 69 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 59 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 54 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 54 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 49 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 49 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 49 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 48 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 48 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 48 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 42 transition count 53
Applied a total of 133 rules in 28 ms. Remains 42 /138 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 53 rows 42 cols
[2023-03-07 23:55:07] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-07 23:55:07] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-07 23:55:07] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-07 23:55:07] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-07 23:55:07] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-07 23:55:07] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Unable to solve all queries for examination StableMarking. Remains :13 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 13 properties from file /home/mcc/execution/StableMarking.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 761587 ms.
starting LoLA
BK_INPUT CloudDeployment-PT-6a
BK_EXAMINATION: StableMarking
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: StableMarking

FORMULA StableMarking FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678233309017

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES PLACE p53
lola: LAUNCH SYMM
lola: The net does not have constant places
sara: try reading problem file stateEquationProblem-ConstantPlace-166.sara.
sara: place or transition ordering is non-deterministic

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="CloudDeployment-PT-6a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is CloudDeployment-PT-6a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r085-smll-167814406800268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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