Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 23:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 23:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 23:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 23:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891358682

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J60
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:42:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:42:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:42:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:42:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:42:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1558 ms
[2023-03-15 14:42:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 22 ms.
[2023-03-15 14:42:42] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 75 ms.
[2023-03-15 14:42:42] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:42:42] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 14:42:42] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 14:42:42] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 20 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 683 resets, run finished after 498 ms. (steps per millisecond=20 ) properties (out of 36) seen :32
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 14:42:43] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2023-03-15 14:42:43] [INFO ] Computed 142 place invariants in 98 ms
[2023-03-15 14:42:44] [INFO ] [Real]Absence check using 135 positive place invariants in 46 ms returned sat
[2023-03-15 14:42:44] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:42:44] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:42:44] [INFO ] [Nat]Absence check using 135 positive place invariants in 40 ms returned sat
[2023-03-15 14:42:44] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 14:42:45] [INFO ] After 1197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:42:45] [INFO ] After 307ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:42:45] [INFO ] After 403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-15 14:42:45] [INFO ] After 1859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 264 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
[2023-03-15 14:42:46] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2023-03-15 14:42:46] [INFO ] Computed 137 place invariants in 61 ms
[2023-03-15 14:42:47] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/909 places, 1086/1315 transitions.
Applied a total of 0 rules in 59 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1222 ms. Remains : 770/909 places, 1086/1315 transitions.
Incomplete random walk after 1000000 steps, including 52212 resets, run finished after 5476 ms. (steps per millisecond=182 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3400 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2281928 steps, run timeout after 18001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 2281928 steps, saw 710326 distinct states, run finished after 18002 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:12] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
// Phase 1: matrix 1082 rows 770 cols
[2023-03-15 14:43:12] [INFO ] Computed 137 place invariants in 26 ms
[2023-03-15 14:43:12] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 14:43:12] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:43:12] [INFO ] After 357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:12] [INFO ] After 130ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:12] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:12] [INFO ] [Nat]Absence check using 130 positive place invariants in 28 ms returned sat
[2023-03-15 14:43:12] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:43:13] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:13] [INFO ] After 329ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:13] [INFO ] Deduced a trap composed of 252 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:43:14] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:43:14] [INFO ] Deduced a trap composed of 254 places in 261 ms of which 1 ms to minimize.
[2023-03-15 14:43:14] [INFO ] Deduced a trap composed of 237 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:43:15] [INFO ] Deduced a trap composed of 236 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:43:15] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:43:15] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:43:15] [INFO ] Deduced a trap composed of 252 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:43:16] [INFO ] Deduced a trap composed of 269 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:43:16] [INFO ] Deduced a trap composed of 227 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:43:17] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:43:17] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:43:18] [INFO ] Deduced a trap composed of 258 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:43:22] [INFO ] Deduced a trap composed of 243 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:43:25] [INFO ] Deduced a trap composed of 249 places in 233 ms of which 0 ms to minimize.
[2023-03-15 14:43:26] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:43:27] [INFO ] Deduced a trap composed of 239 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:43:28] [INFO ] Deduced a trap composed of 254 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:43:31] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:43:40] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 27001 ms
[2023-03-15 14:43:40] [INFO ] After 27402ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:43:40] [INFO ] After 27905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 37 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 14:43:40] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:43:40] [INFO ] Invariant cache hit.
[2023-03-15 14:43:41] [INFO ] Implicit Places using invariants in 776 ms returned []
[2023-03-15 14:43:41] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:43:41] [INFO ] Invariant cache hit.
[2023-03-15 14:43:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:45] [INFO ] Implicit Places using invariants and state equation in 4207 ms returned []
Implicit Place search using SMT with State Equation took 4989 ms to find 0 implicit places.
[2023-03-15 14:43:45] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-15 14:43:45] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:43:45] [INFO ] Invariant cache hit.
[2023-03-15 14:43:46] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5797 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5215 resets, run finished after 732 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:43:47] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:43:47] [INFO ] Invariant cache hit.
[2023-03-15 14:43:47] [INFO ] [Real]Absence check using 130 positive place invariants in 33 ms returned sat
[2023-03-15 14:43:47] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:43:47] [INFO ] After 277ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:43:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:43:47] [INFO ] After 108ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:43:47] [INFO ] After 191ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:47] [INFO ] After 624ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:43:47] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:43:48] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:43:48] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:48] [INFO ] After 190ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:43:48] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 224 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 230 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 254 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:43:49] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 254 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 227 places in 227 ms of which 2 ms to minimize.
[2023-03-15 14:43:50] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:43:51] [INFO ] Deduced a trap composed of 227 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:43:51] [INFO ] Deduced a trap composed of 233 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:43:51] [INFO ] Deduced a trap composed of 242 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 242 places in 223 ms of which 2 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 2 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 236 places in 226 ms of which 2 ms to minimize.
[2023-03-15 14:43:52] [INFO ] Deduced a trap composed of 239 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:43:53] [INFO ] Deduced a trap composed of 239 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:43:53] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:43:54] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:43:54] [INFO ] Deduced a trap composed of 245 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:43:54] [INFO ] Deduced a trap composed of 239 places in 293 ms of which 0 ms to minimize.
[2023-03-15 14:43:55] [INFO ] Deduced a trap composed of 248 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:43:56] [INFO ] Deduced a trap composed of 248 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 239 places in 266 ms of which 1 ms to minimize.
[2023-03-15 14:43:58] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 1 ms to minimize.
[2023-03-15 14:44:07] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 19302 ms
[2023-03-15 14:44:07] [INFO ] After 19568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:07] [INFO ] After 20016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52211 resets, run finished after 5099 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3336 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2281183 steps, run timeout after 18001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 2281183 steps, saw 710085 distinct states, run finished after 18001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:32] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:44:32] [INFO ] Invariant cache hit.
[2023-03-15 14:44:32] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:44:32] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:44:32] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:32] [INFO ] [Nat]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-15 14:44:32] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:44:32] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:33] [INFO ] After 222ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:44:33] [INFO ] Deduced a trap composed of 236 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:44:33] [INFO ] Deduced a trap composed of 224 places in 264 ms of which 1 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 254 places in 260 ms of which 1 ms to minimize.
[2023-03-15 14:44:34] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 227 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:44:35] [INFO ] Deduced a trap composed of 227 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 242 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:44:36] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 2 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 227 places in 254 ms of which 0 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 236 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:44:37] [INFO ] Deduced a trap composed of 239 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:44:38] [INFO ] Deduced a trap composed of 230 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 242 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 245 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:44:39] [INFO ] Deduced a trap composed of 239 places in 232 ms of which 2 ms to minimize.
[2023-03-15 14:44:40] [INFO ] Deduced a trap composed of 248 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:44:41] [INFO ] Deduced a trap composed of 248 places in 237 ms of which 5 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 239 places in 250 ms of which 14 ms to minimize.
[2023-03-15 14:44:43] [INFO ] Deduced a trap composed of 236 places in 229 ms of which 2 ms to minimize.
[2023-03-15 14:44:52] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 19596 ms
[2023-03-15 14:44:52] [INFO ] After 19876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:44:52] [INFO ] After 20357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 45 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 51 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 14:44:52] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:44:52] [INFO ] Invariant cache hit.
[2023-03-15 14:44:53] [INFO ] Implicit Places using invariants in 956 ms returned []
[2023-03-15 14:44:53] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:44:53] [INFO ] Invariant cache hit.
[2023-03-15 14:44:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:57] [INFO ] Implicit Places using invariants and state equation in 3994 ms returned []
Implicit Place search using SMT with State Equation took 4957 ms to find 0 implicit places.
[2023-03-15 14:44:57] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-15 14:44:57] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:44:57] [INFO ] Invariant cache hit.
[2023-03-15 14:44:58] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5799 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 100000 steps, including 5171 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:44:59] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:44:59] [INFO ] Invariant cache hit.
[2023-03-15 14:44:59] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-15 14:44:59] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:44:59] [INFO ] After 296ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:44:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:44:59] [INFO ] After 114ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:44:59] [INFO ] After 171ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:59] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:44:59] [INFO ] [Nat]Absence check using 130 positive place invariants in 25 ms returned sat
[2023-03-15 14:44:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:45:00] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:00] [INFO ] After 197ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:00] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 224 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 254 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:45:01] [INFO ] Deduced a trap composed of 245 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 254 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 227 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:45:02] [INFO ] Deduced a trap composed of 245 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 227 places in 234 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:45:03] [INFO ] Deduced a trap composed of 242 places in 239 ms of which 0 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 242 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 227 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:45:04] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 239 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 239 places in 240 ms of which 0 ms to minimize.
[2023-03-15 14:45:05] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:45:06] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:45:07] [INFO ] Deduced a trap composed of 239 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:45:08] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:45:08] [INFO ] Deduced a trap composed of 248 places in 269 ms of which 0 ms to minimize.
[2023-03-15 14:45:10] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 1 ms to minimize.
[2023-03-15 14:45:11] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:45:20] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 19578 ms
[2023-03-15 14:45:20] [INFO ] After 19876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:20] [INFO ] After 20310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 521 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 362195 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 362195 steps, saw 110175 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:45:23] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:45:23] [INFO ] Invariant cache hit.
[2023-03-15 14:45:23] [INFO ] [Real]Absence check using 130 positive place invariants in 23 ms returned sat
[2023-03-15 14:45:23] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:45:23] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:23] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:45:23] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 14:45:23] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:24] [INFO ] After 338ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 236 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:45:24] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 1 ms to minimize.
[2023-03-15 14:45:25] [INFO ] Deduced a trap composed of 254 places in 293 ms of which 1 ms to minimize.
[2023-03-15 14:45:26] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 1 ms to minimize.
[2023-03-15 14:45:26] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:45:26] [INFO ] Deduced a trap composed of 233 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 233 places in 294 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 233 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:45:27] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 1 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 0 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:45:28] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 230 places in 259 ms of which 1 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:45:29] [INFO ] Deduced a trap composed of 245 places in 253 ms of which 0 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 233 places in 278 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:45:30] [INFO ] Deduced a trap composed of 242 places in 262 ms of which 0 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 236 places in 270 ms of which 1 ms to minimize.
[2023-03-15 14:45:31] [INFO ] Deduced a trap composed of 251 places in 291 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 215 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:45:32] [INFO ] Deduced a trap composed of 239 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:45:33] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:45:42] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 18191 ms
[2023-03-15 14:45:42] [INFO ] After 18558ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:45:42] [INFO ] After 19064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 48 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 14:45:42] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:45:42] [INFO ] Invariant cache hit.
[2023-03-15 14:45:43] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 770/770 places, 1086/1086 transitions.
Incomplete random walk after 10000 steps, including 551 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 357969 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 357969 steps, saw 108910 distinct states, run finished after 3001 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:45:46] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:45:46] [INFO ] Invariant cache hit.
[2023-03-15 14:45:46] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:45:46] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:45:46] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:45:46] [INFO ] [Nat]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:45:46] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:45:47] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:45:47] [INFO ] After 334ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:45:47] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:45:48] [INFO ] Deduced a trap composed of 254 places in 250 ms of which 0 ms to minimize.
[2023-03-15 14:45:48] [INFO ] Deduced a trap composed of 233 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:45:48] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:45:48] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 245 places in 310 ms of which 1 ms to minimize.
[2023-03-15 14:45:49] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 0 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 233 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:45:50] [INFO ] Deduced a trap composed of 233 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2023-03-15 14:45:51] [INFO ] Deduced a trap composed of 233 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-15 14:45:52] [INFO ] Deduced a trap composed of 224 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 245 places in 269 ms of which 1 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 233 places in 267 ms of which 0 ms to minimize.
[2023-03-15 14:45:53] [INFO ] Deduced a trap composed of 248 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 242 places in 285 ms of which 1 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:45:54] [INFO ] Deduced a trap composed of 251 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:45:55] [INFO ] Deduced a trap composed of 215 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 239 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:45:56] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 2 ms to minimize.
[2023-03-15 14:46:05] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 18028 ms
[2023-03-15 14:46:05] [INFO ] After 18401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:46:05] [INFO ] After 18915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 29 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 770/770 places, 1086/1086 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1086/1086 transitions.
Applied a total of 0 rules in 39 ms. Remains 770 /770 variables (removed 0) and now considering 1086/1086 (removed 0) transitions.
[2023-03-15 14:46:05] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:46:05] [INFO ] Invariant cache hit.
[2023-03-15 14:46:06] [INFO ] Implicit Places using invariants in 820 ms returned []
[2023-03-15 14:46:06] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:46:06] [INFO ] Invariant cache hit.
[2023-03-15 14:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:46:11] [INFO ] Implicit Places using invariants and state equation in 4529 ms returned []
Implicit Place search using SMT with State Equation took 5377 ms to find 0 implicit places.
[2023-03-15 14:46:11] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 14:46:11] [INFO ] Flow matrix only has 1082 transitions (discarded 4 similar events)
[2023-03-15 14:46:11] [INFO ] Invariant cache hit.
[2023-03-15 14:46:11] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6142 ms. Remains : 770/770 places, 1086/1086 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 173 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1075 rows 763 cols
[2023-03-15 14:46:11] [INFO ] Computed 137 place invariants in 17 ms
[2023-03-15 14:46:12] [INFO ] [Real]Absence check using 130 positive place invariants in 31 ms returned sat
[2023-03-15 14:46:12] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 14:46:12] [INFO ] After 298ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:46:12] [INFO ] Deduced a trap composed of 234 places in 263 ms of which 1 ms to minimize.
[2023-03-15 14:46:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2023-03-15 14:46:12] [INFO ] After 661ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:46:12] [INFO ] After 979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:46:13] [INFO ] [Nat]Absence check using 130 positive place invariants in 22 ms returned sat
[2023-03-15 14:46:13] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:46:13] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:46:13] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 249 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 231 places in 275 ms of which 0 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:46:14] [INFO ] Deduced a trap composed of 225 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:46:15] [INFO ] Deduced a trap composed of 222 places in 250 ms of which 1 ms to minimize.
[2023-03-15 14:46:15] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:46:15] [INFO ] Deduced a trap composed of 225 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:46:16] [INFO ] Deduced a trap composed of 249 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:46:16] [INFO ] Deduced a trap composed of 237 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:46:17] [INFO ] Deduced a trap composed of 243 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:46:17] [INFO ] Deduced a trap composed of 246 places in 246 ms of which 1 ms to minimize.
[2023-03-15 14:46:17] [INFO ] Deduced a trap composed of 240 places in 256 ms of which 1 ms to minimize.
[2023-03-15 14:46:18] [INFO ] Deduced a trap composed of 243 places in 275 ms of which 1 ms to minimize.
[2023-03-15 14:46:18] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:46:18] [INFO ] Deduced a trap composed of 249 places in 243 ms of which 1 ms to minimize.
[2023-03-15 14:46:19] [INFO ] Deduced a trap composed of 241 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:46:19] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 0 ms to minimize.
[2023-03-15 14:46:19] [INFO ] Deduced a trap composed of 234 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:46:19] [INFO ] Deduced a trap composed of 255 places in 257 ms of which 1 ms to minimize.
[2023-03-15 14:46:20] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:46:20] [INFO ] Deduced a trap composed of 240 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:46:20] [INFO ] Deduced a trap composed of 216 places in 255 ms of which 0 ms to minimize.
[2023-03-15 14:46:21] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:46:21] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 12 ms to minimize.
[2023-03-15 14:46:21] [INFO ] Deduced a trap composed of 225 places in 269 ms of which 1 ms to minimize.
[2023-03-15 14:46:22] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:46:22] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2023-03-15 14:46:22] [INFO ] Deduced a trap composed of 231 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:46:23] [INFO ] Deduced a trap composed of 225 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:46:23] [INFO ] Deduced a trap composed of 240 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:46:23] [INFO ] Deduced a trap composed of 240 places in 267 ms of which 0 ms to minimize.
[2023-03-15 14:46:24] [INFO ] Deduced a trap composed of 237 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:46:24] [INFO ] Deduced a trap composed of 228 places in 275 ms of which 1 ms to minimize.
[2023-03-15 14:46:24] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 0 ms to minimize.
[2023-03-15 14:46:25] [INFO ] Deduced a trap composed of 255 places in 235 ms of which 1 ms to minimize.
[2023-03-15 14:46:25] [INFO ] Deduced a trap composed of 243 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:46:25] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 1 ms to minimize.
[2023-03-15 14:46:26] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 1 ms to minimize.
[2023-03-15 14:46:26] [INFO ] Deduced a trap composed of 243 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:46:26] [INFO ] Deduced a trap composed of 255 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:46:27] [INFO ] Deduced a trap composed of 231 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:46:27] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2023-03-15 14:46:27] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 0 ms to minimize.
[2023-03-15 14:46:27] [INFO ] Deduced a trap composed of 246 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:46:28] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:46:28] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:46:29] [INFO ] Deduced a trap composed of 237 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:46:29] [INFO ] Deduced a trap composed of 231 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:46:29] [INFO ] Deduced a trap composed of 240 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:46:29] [INFO ] Deduced a trap composed of 243 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:46:30] [INFO ] Deduced a trap composed of 243 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:46:30] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:46:31] [INFO ] Deduced a trap composed of 231 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:46:32] [INFO ] Deduced a trap composed of 240 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:46:32] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:46:33] [INFO ] Deduced a trap composed of 234 places in 249 ms of which 1 ms to minimize.
[2023-03-15 14:46:33] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:46:33] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:46:34] [INFO ] Deduced a trap composed of 240 places in 235 ms of which 1 ms to minimize.
[2023-03-15 14:46:34] [INFO ] Deduced a trap composed of 225 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 243 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:46:35] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:46:36] [INFO ] Deduced a trap composed of 237 places in 248 ms of which 0 ms to minimize.
[2023-03-15 14:46:36] [INFO ] Deduced a trap composed of 240 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:46:36] [INFO ] Deduced a trap composed of 222 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:46:37] [INFO ] Deduced a trap composed of 234 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:46:38] [INFO ] Deduced a trap composed of 237 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:46:39] [INFO ] Deduced a trap composed of 228 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:46:40] [INFO ] Deduced a trap composed of 243 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:46:40] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 0 ms to minimize.
[2023-03-15 14:46:42] [INFO ] Deduced a trap composed of 219 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:46:42] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:46:42] [INFO ] Deduced a trap composed of 234 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 240 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 231 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:46:43] [INFO ] Deduced a trap composed of 225 places in 213 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 249 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:46:44] [INFO ] Deduced a trap composed of 252 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 222 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:46:45] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:46:46] [INFO ] Deduced a trap composed of 237 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 2 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 228 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:46:47] [INFO ] Deduced a trap composed of 228 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:46:48] [INFO ] Deduced a trap composed of 219 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:46:49] [INFO ] Deduced a trap composed of 249 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:46:49] [INFO ] Deduced a trap composed of 240 places in 211 ms of which 0 ms to minimize.
[2023-03-15 14:46:50] [INFO ] Deduced a trap composed of 228 places in 237 ms of which 1 ms to minimize.
[2023-03-15 14:46:50] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 0 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 234 places in 235 ms of which 0 ms to minimize.
[2023-03-15 14:46:51] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 2 ms to minimize.
[2023-03-15 14:46:52] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:46:53] [INFO ] Deduced a trap composed of 228 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:46:53] [INFO ] Deduced a trap composed of 240 places in 237 ms of which 0 ms to minimize.
[2023-03-15 14:46:53] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:46:55] [INFO ] Deduced a trap composed of 231 places in 230 ms of which 0 ms to minimize.
[2023-03-15 14:46:55] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:46:56] [INFO ] Deduced a trap composed of 225 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:46:59] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:47:00] [INFO ] Deduced a trap composed of 240 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:47:01] [INFO ] Deduced a trap composed of 237 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 243 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 2 ms to minimize.
[2023-03-15 14:47:02] [INFO ] Deduced a trap composed of 237 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 243 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 231 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:47:03] [INFO ] Deduced a trap composed of 252 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:47:05] [INFO ] Deduced a trap composed of 228 places in 234 ms of which 0 ms to minimize.
[2023-03-15 14:47:06] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 0 ms to minimize.
[2023-03-15 14:47:06] [INFO ] Deduced a trap composed of 222 places in 230 ms of which 0 ms to minimize.
[2023-03-15 14:47:07] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 228 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 228 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:47:08] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 240 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:47:09] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:47:10] [INFO ] Deduced a trap composed of 219 places in 234 ms of which 0 ms to minimize.
[2023-03-15 14:47:11] [INFO ] Deduced a trap composed of 228 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:47:20] [INFO ] Trap strengthening (SAT) tested/added 127/127 trap constraints in 67165 ms
[2023-03-15 14:47:20] [INFO ] After 67619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:47:20] [INFO ] After 67766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1081
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1081
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1080
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1080
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 768 transition count 1075
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 763 transition count 1075
Applied a total of 18 rules in 83 ms. Remains 763 /770 variables (removed 7) and now considering 1075/1086 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:47:20] [INFO ] Invariant cache hit.
[2023-03-15 14:47:20] [INFO ] [Real]Absence check using 130 positive place invariants in 24 ms returned sat
[2023-03-15 14:47:20] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 14:47:20] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:47:21] [INFO ] [Nat]Absence check using 130 positive place invariants in 26 ms returned sat
[2023-03-15 14:47:21] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:47:21] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 147 places in 263 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 1 ms to minimize.
[2023-03-15 14:47:22] [INFO ] Deduced a trap composed of 243 places in 238 ms of which 1 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 246 places in 255 ms of which 1 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 243 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:47:23] [INFO ] Deduced a trap composed of 246 places in 240 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 231 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 231 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 240 places in 245 ms of which 0 ms to minimize.
[2023-03-15 14:47:24] [INFO ] Deduced a trap composed of 255 places in 251 ms of which 0 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 237 places in 234 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:47:25] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 234 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:26] [INFO ] Deduced a trap composed of 222 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 234 places in 242 ms of which 1 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 243 places in 234 ms of which 0 ms to minimize.
[2023-03-15 14:47:27] [INFO ] Deduced a trap composed of 246 places in 241 ms of which 3 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 231 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 237 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:47:28] [INFO ] Deduced a trap composed of 240 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 1 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:47:29] [INFO ] Deduced a trap composed of 252 places in 251 ms of which 1 ms to minimize.
[2023-03-15 14:47:30] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:30] [INFO ] Deduced a trap composed of 231 places in 223 ms of which 1 ms to minimize.
[2023-03-15 14:47:30] [INFO ] Deduced a trap composed of 228 places in 218 ms of which 1 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 252 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 246 places in 225 ms of which 0 ms to minimize.
[2023-03-15 14:47:31] [INFO ] Deduced a trap composed of 225 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:47:32] [INFO ] Deduced a trap composed of 231 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:47:33] [INFO ] Deduced a trap composed of 261 places in 230 ms of which 1 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 240 places in 227 ms of which 1 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 240 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:47:34] [INFO ] Deduced a trap composed of 243 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:35] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:47:36] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:47:36] [INFO ] Deduced a trap composed of 225 places in 217 ms of which 1 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 264 places in 241 ms of which 1 ms to minimize.
[2023-03-15 14:47:37] [INFO ] Deduced a trap composed of 231 places in 222 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 225 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:47:38] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 243 places in 235 ms of which 1 ms to minimize.
[2023-03-15 14:47:39] [INFO ] Deduced a trap composed of 240 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:47:40] [INFO ] Deduced a trap composed of 240 places in 248 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 258 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 243 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:42] [INFO ] Deduced a trap composed of 228 places in 222 ms of which 1 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 240 places in 247 ms of which 1 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 243 places in 244 ms of which 1 ms to minimize.
[2023-03-15 14:47:43] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 0 ms to minimize.
[2023-03-15 14:47:44] [INFO ] Deduced a trap composed of 237 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 228 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:47:45] [INFO ] Deduced a trap composed of 228 places in 220 ms of which 0 ms to minimize.
[2023-03-15 14:47:47] [INFO ] Deduced a trap composed of 243 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 237 places in 239 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 0 ms to minimize.
[2023-03-15 14:47:48] [INFO ] Deduced a trap composed of 243 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:47:49] [INFO ] Deduced a trap composed of 240 places in 225 ms of which 1 ms to minimize.
[2023-03-15 14:47:50] [INFO ] Deduced a trap composed of 234 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:47:51] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 0 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 240 places in 219 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 237 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 231 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:47:52] [INFO ] Deduced a trap composed of 246 places in 231 ms of which 0 ms to minimize.
[2023-03-15 14:47:53] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 249 places in 235 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 225 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:47:54] [INFO ] Deduced a trap composed of 261 places in 236 ms of which 0 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 240 places in 243 ms of which 0 ms to minimize.
[2023-03-15 14:47:55] [INFO ] Deduced a trap composed of 225 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 234 places in 215 ms of which 1 ms to minimize.
[2023-03-15 14:47:56] [INFO ] Deduced a trap composed of 231 places in 233 ms of which 1 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Deduced a trap composed of 237 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:47:57] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 0 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 219 places in 242 ms of which 0 ms to minimize.
[2023-03-15 14:47:58] [INFO ] Deduced a trap composed of 225 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:47:59] [INFO ] Deduced a trap composed of 222 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:47:59] [INFO ] Deduced a trap composed of 246 places in 229 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 237 places in 228 ms of which 1 ms to minimize.
[2023-03-15 14:48:00] [INFO ] Deduced a trap composed of 246 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 231 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 240 places in 229 ms of which 0 ms to minimize.
[2023-03-15 14:48:01] [INFO ] Deduced a trap composed of 243 places in 227 ms of which 0 ms to minimize.
[2023-03-15 14:48:03] [INFO ] Deduced a trap composed of 237 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 252 places in 245 ms of which 1 ms to minimize.
[2023-03-15 14:48:04] [INFO ] Deduced a trap composed of 246 places in 240 ms of which 1 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 249 places in 241 ms of which 0 ms to minimize.
[2023-03-15 14:48:05] [INFO ] Deduced a trap composed of 252 places in 236 ms of which 1 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 240 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:48:09] [INFO ] Deduced a trap composed of 237 places in 231 ms of which 1 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 243 places in 232 ms of which 1 ms to minimize.
[2023-03-15 14:48:10] [INFO ] Deduced a trap composed of 237 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 240 places in 224 ms of which 1 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 231 places in 225 ms of which 2 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 231 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:48:11] [INFO ] Deduced a trap composed of 243 places in 223 ms of which 1 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 240 places in 221 ms of which 1 ms to minimize.
[2023-03-15 14:48:12] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 0 ms to minimize.
[2023-03-15 14:48:13] [INFO ] Deduced a trap composed of 240 places in 226 ms of which 0 ms to minimize.
[2023-03-15 14:48:14] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 1 ms to minimize.
[2023-03-15 14:48:23] [INFO ] Trap strengthening (SAT) tested/added 112/112 trap constraints in 62132 ms
[2023-03-15 14:48:24] [INFO ] After 62963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:48:24] [INFO ] After 63111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 5 ms.
Working with output stream class java.io.PrintStream
Total runtime 343077 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S05J60
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

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

BK_STOP 1678891705554

--------------------
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 QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S05J60, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;