Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000298.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679309494485

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:51:36] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-20 10:51:36] [INFO ] Transformed 1503 places.
[2023-03-20 10:51:36] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:51:36] [INFO ] Found NUPN structural information;
[2023-03-20 10:51:36] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 119 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 292 places :
Symmetric choice reduction at 0 with 292 rule applications. Total rules 292 place count 1211 transition count 1211
Iterating global reduction 0 with 292 rules applied. Total rules applied 584 place count 1211 transition count 1211
Applied a total of 584 rules in 425 ms. Remains 1211 /1503 variables (removed 292) and now considering 1211/1503 (removed 292) transitions.
// Phase 1: matrix 1211 rows 1211 cols
[2023-03-20 10:51:37] [INFO ] Computed 121 place invariants in 42 ms
[2023-03-20 10:51:38] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-20 10:51:38] [INFO ] Invariant cache hit.
[2023-03-20 10:51:39] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 2097 ms to find 0 implicit places.
[2023-03-20 10:51:39] [INFO ] Invariant cache hit.
[2023-03-20 10:51:39] [INFO ] Dead Transitions using invariants and state equation in 675 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1503 places, 1211/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3202 ms. Remains : 1211/1503 places, 1211/1503 transitions.
Support contains 119 out of 1211 places after structural reductions.
[2023-03-20 10:51:40] [INFO ] Flatten gal took : 138 ms
[2023-03-20 10:51:40] [INFO ] Flatten gal took : 60 ms
[2023-03-20 10:51:40] [INFO ] Input system was already deterministic with 1211 transitions.
Support contains 109 out of 1211 places (down from 119) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 70) seen :38
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-20 10:51:41] [INFO ] Invariant cache hit.
[2023-03-20 10:51:42] [INFO ] After 852ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-20 10:51:43] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-20 10:51:47] [INFO ] After 3658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-20 10:51:47] [INFO ] Deduced a trap composed of 50 places in 317 ms of which 4 ms to minimize.
[2023-03-20 10:51:48] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 2 ms to minimize.
[2023-03-20 10:51:48] [INFO ] Deduced a trap composed of 25 places in 217 ms of which 2 ms to minimize.
[2023-03-20 10:51:48] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 2 ms to minimize.
[2023-03-20 10:51:48] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 1 ms to minimize.
[2023-03-20 10:51:49] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-20 10:51:49] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 3 ms to minimize.
[2023-03-20 10:51:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2131 ms
[2023-03-20 10:51:49] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 1 ms to minimize.
[2023-03-20 10:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 365 ms
[2023-03-20 10:51:50] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 0 ms to minimize.
[2023-03-20 10:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-20 10:51:50] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 1 ms to minimize.
[2023-03-20 10:51:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2023-03-20 10:51:52] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 1 ms to minimize.
[2023-03-20 10:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-03-20 10:51:52] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 0 ms to minimize.
[2023-03-20 10:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-20 10:51:53] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 1 ms to minimize.
[2023-03-20 10:51:53] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 1 ms to minimize.
[2023-03-20 10:51:53] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 1 ms to minimize.
[2023-03-20 10:51:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 686 ms
[2023-03-20 10:51:54] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:51:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-20 10:51:54] [INFO ] Deduced a trap composed of 34 places in 190 ms of which 1 ms to minimize.
[2023-03-20 10:51:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 296 ms
[2023-03-20 10:51:55] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 0 ms to minimize.
[2023-03-20 10:51:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-20 10:51:55] [INFO ] After 11914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 2085 ms.
[2023-03-20 10:51:57] [INFO ] After 15292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 1 properties in 1399 ms.
Support contains 50 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 304 rules applied. Total rules applied 304 place count 1211 transition count 907
Reduce places removed 304 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 315 rules applied. Total rules applied 619 place count 907 transition count 896
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 630 place count 896 transition count 896
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 630 place count 896 transition count 689
Deduced a syphon composed of 207 places in 1 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 3 with 414 rules applied. Total rules applied 1044 place count 689 transition count 689
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1059 place count 674 transition count 674
Iterating global reduction 3 with 15 rules applied. Total rules applied 1074 place count 674 transition count 674
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1074 place count 674 transition count 661
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1100 place count 661 transition count 661
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 1 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 3 with 532 rules applied. Total rules applied 1632 place count 395 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 1784 place count 319 transition count 458
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1790 place count 319 transition count 452
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1796 place count 313 transition count 452
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1797 place count 313 transition count 451
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1798 place count 313 transition count 451
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1799 place count 312 transition count 450
Applied a total of 1799 rules in 360 ms. Remains 312 /1211 variables (removed 899) and now considering 450/1211 (removed 761) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 312/1211 places, 450/1211 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 31) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 450 rows 312 cols
[2023-03-20 10:52:00] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 10:52:00] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2023-03-20 10:52:00] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-20 10:52:00] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-20 10:52:00] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-20 10:52:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:52:01] [INFO ] After 332ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-20 10:52:02] [INFO ] After 1452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 493 ms.
[2023-03-20 10:52:02] [INFO ] After 2613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 154 ms.
Support contains 42 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 450/450 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 312 transition count 447
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 309 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 308 transition count 446
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 308 transition count 443
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 305 transition count 443
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 3 with 4 rules applied. Total rules applied 18 place count 303 transition count 441
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 299 transition count 444
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 299 transition count 444
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 298 transition count 443
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 298 transition count 443
Applied a total of 29 rules in 77 ms. Remains 298 /312 variables (removed 14) and now considering 443/450 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 298/312 places, 443/450 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 443 rows 298 cols
[2023-03-20 10:52:03] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:52:05] [INFO ] [Real]Absence check using 121 positive place invariants in 782 ms returned sat
[2023-03-20 10:52:06] [INFO ] After 807ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:16
[2023-03-20 10:52:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:52:06] [INFO ] After 73ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-20 10:52:06] [INFO ] After 2178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-20 10:52:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2023-03-20 10:52:07] [INFO ] After 1061ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-20 10:52:08] [INFO ] After 1138ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-20 10:52:08] [INFO ] After 1505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-20 10:52:09] [INFO ] After 3081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 79 ms.
Support contains 37 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 443/443 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 441
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 296 transition count 441
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 296 transition count 439
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 8 place count 294 transition count 439
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 12 place count 292 transition count 437
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 290 transition count 440
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 290 transition count 439
Applied a total of 17 rules in 53 ms. Remains 290 /298 variables (removed 8) and now considering 439/443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 290/298 places, 439/443 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 370 ms. (steps per millisecond=27 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 90515 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{2=1, 9=1, 16=1}
Probabilistic random walk after 90515 steps, saw 56058 distinct states, run finished after 3004 ms. (steps per millisecond=30 ) properties seen :3
Running SMT prover for 15 properties.
// Phase 1: matrix 439 rows 290 cols
[2023-03-20 10:52:12] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 10:52:13] [INFO ] [Real]Absence check using 121 positive place invariants in 19 ms returned sat
[2023-03-20 10:52:13] [INFO ] After 304ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2023-03-20 10:52:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:52:13] [INFO ] After 43ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 10:52:13] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 10:52:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 10:52:14] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 10:52:14] [INFO ] After 182ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 10:52:14] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2023-03-20 10:52:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-20 10:52:14] [INFO ] After 562ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-20 10:52:14] [INFO ] After 1235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 401 ms.
Support contains 30 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 439/439 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 290 transition count 437
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 288 transition count 437
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 288 transition count 434
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 285 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 282 transition count 435
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 282 transition count 434
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 282 transition count 433
Applied a total of 18 rules in 66 ms. Remains 282 /290 variables (removed 8) and now considering 433/439 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 282/290 places, 433/439 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 117287 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{1=1, 2=1, 14=1}
Probabilistic random walk after 117287 steps, saw 73636 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :3
Running SMT prover for 12 properties.
// Phase 1: matrix 433 rows 282 cols
[2023-03-20 10:52:18] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:52:18] [INFO ] [Real]Absence check using 121 positive place invariants in 25 ms returned sat
[2023-03-20 10:52:19] [INFO ] After 370ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-20 10:52:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:52:19] [INFO ] After 28ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 10:52:19] [INFO ] After 651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 10:52:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 10:52:19] [INFO ] After 227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-20 10:52:19] [INFO ] After 231ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-20 10:52:20] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-20 10:52:20] [INFO ] After 1007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 85 ms.
Support contains 25 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 433/433 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 432
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 281 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 431
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 280 transition count 429
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 278 transition count 429
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 10 place count 277 transition count 428
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 12 place count 276 transition count 427
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 276 transition count 426
Applied a total of 13 rules in 30 ms. Remains 276 /282 variables (removed 6) and now considering 426/433 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 276/282 places, 426/433 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 135776 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{0=1, 10=1}
Probabilistic random walk after 135776 steps, saw 94418 distinct states, run finished after 3014 ms. (steps per millisecond=45 ) properties seen :2
Running SMT prover for 9 properties.
// Phase 1: matrix 426 rows 276 cols
[2023-03-20 10:52:24] [INFO ] Computed 121 place invariants in 2 ms
[2023-03-20 10:52:24] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2023-03-20 10:52:24] [INFO ] After 403ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 10:52:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-20 10:52:25] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:52:25] [INFO ] After 94ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:25] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-20 10:52:25] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 116 ms.
Support contains 21 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 426/426 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 276 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 275 transition count 425
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 275 transition count 423
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 6 place count 273 transition count 423
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 272 transition count 422
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 12 place count 270 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 269 transition count 423
Applied a total of 13 rules in 27 ms. Remains 269 /276 variables (removed 7) and now considering 423/426 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 269/276 places, 423/426 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 80981 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80981 steps, saw 56210 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 423 rows 269 cols
[2023-03-20 10:52:29] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 10:52:30] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2023-03-20 10:52:30] [INFO ] After 437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 10:52:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2023-03-20 10:52:30] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 10:52:30] [INFO ] After 94ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:31] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-20 10:52:31] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 21 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 269 /269 variables (removed 0) and now considering 423/423 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 269/269 places, 423/423 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 423/423 transitions.
Applied a total of 0 rules in 7 ms. Remains 269 /269 variables (removed 0) and now considering 423/423 (removed 0) transitions.
[2023-03-20 10:52:31] [INFO ] Invariant cache hit.
[2023-03-20 10:52:31] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-20 10:52:31] [INFO ] Invariant cache hit.
[2023-03-20 10:52:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 10:52:31] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-20 10:52:31] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-20 10:52:31] [INFO ] Invariant cache hit.
[2023-03-20 10:52:32] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 269/269 places, 423/423 transitions.
Graph (trivial) has 98 edges and 269 vertex of which 4 / 269 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 97 edges and 265 vertex of which 6 / 265 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 262 transition count 414
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 95 edges and 259 vertex of which 6 / 259 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 15 rules applied. Total rules applied 23 place count 256 transition count 403
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 91 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 35 place count 252 transition count 394
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 43 place count 251 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 43 place count 251 transition count 386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 250 transition count 386
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 4 with 2 rules applied. Total rules applied 47 place count 249 transition count 385
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 809 edges and 249 vertex of which 248 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 50 place count 248 transition count 383
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 61 place count 248 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 247 transition count 372
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 65 place count 245 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 69 place count 245 transition count 367
Applied a total of 69 rules in 37 ms. Remains 245 /269 variables (removed 24) and now considering 367/423 (removed 56) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 367 rows 245 cols
[2023-03-20 10:52:32] [INFO ] Computed 110 place invariants in 2 ms
[2023-03-20 10:52:32] [INFO ] [Real]Absence check using 110 positive place invariants in 15 ms returned sat
[2023-03-20 10:52:32] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 10:52:32] [INFO ] [Nat]Absence check using 110 positive place invariants in 12 ms returned sat
[2023-03-20 10:52:32] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 10:52:32] [INFO ] After 89ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:32] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-20 10:52:33] [INFO ] After 624ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 48 ms
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 60 ms
[2023-03-20 10:52:33] [INFO ] Input system was already deterministic with 1211 transitions.
Computed a total of 371 stabilizing places and 371 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 132 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 33 ms
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 34 ms
[2023-03-20 10:52:33] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 1210 transition count 869
Reduce places removed 341 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 343 rules applied. Total rules applied 684 place count 869 transition count 867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 685 place count 868 transition count 867
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 685 place count 868 transition count 650
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1146 place count 624 transition count 623
Iterating global reduction 3 with 27 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1173 place count 624 transition count 600
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1219 place count 601 transition count 600
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 101 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:52:33] [INFO ] Input system was already deterministic with 360 transitions.
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
FORMULA ShieldRVt-PT-030B-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1210 transition count 870
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 342 rules applied. Total rules applied 682 place count 870 transition count 868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 683 place count 869 transition count 868
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 218 Pre rules applied. Total rules applied 683 place count 869 transition count 650
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1145 place count 625 transition count 624
Iterating global reduction 3 with 26 rules applied. Total rules applied 1171 place count 625 transition count 624
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1171 place count 625 transition count 602
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1215 place count 603 transition count 602
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1693 place count 364 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1695 place count 362 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1696 place count 361 transition count 361
Applied a total of 1696 rules in 88 ms. Remains 361 /1211 variables (removed 850) and now considering 361/1211 (removed 850) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 89 ms. Remains : 361/1211 places, 361/1211 transitions.
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 14 ms
[2023-03-20 10:52:33] [INFO ] Flatten gal took : 12 ms
[2023-03-20 10:52:33] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1174 transition count 1174
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1173 transition count 1173
Applied a total of 76 rules in 109 ms. Remains 1173 /1211 variables (removed 38) and now considering 1173/1211 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 1173/1211 places, 1173/1211 transitions.
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 29 ms
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 30 ms
[2023-03-20 10:52:34] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1174 transition count 1174
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1173 transition count 1173
Applied a total of 76 rules in 98 ms. Remains 1173 /1211 variables (removed 38) and now considering 1173/1211 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 1173/1211 places, 1173/1211 transitions.
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 26 ms
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 26 ms
[2023-03-20 10:52:34] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 1210 transition count 869
Reduce places removed 341 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 343 rules applied. Total rules applied 684 place count 869 transition count 867
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 686 place count 868 transition count 866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 867 transition count 866
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 687 place count 867 transition count 650
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1146 place count 624 transition count 623
Iterating global reduction 4 with 27 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1173 place count 624 transition count 600
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1219 place count 601 transition count 600
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 4 with 476 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 84 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 85 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 10 ms
[2023-03-20 10:52:34] [INFO ] Flatten gal took : 11 ms
[2023-03-20 10:52:34] [INFO ] Input system was already deterministic with 360 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 627405 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627405 steps, saw 553955 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 360 cols
[2023-03-20 10:52:37] [INFO ] Computed 120 place invariants in 7 ms
[2023-03-20 10:52:37] [INFO ] [Real]Absence check using 120 positive place invariants in 21 ms returned sat
[2023-03-20 10:52:37] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 10:52:37] [INFO ] After 147ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 10:52:37] [INFO ] After 271ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 270 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=135 )
FORMULA ShieldRVt-PT-030B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 1210 transition count 868
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 344 rules applied. Total rules applied 686 place count 868 transition count 866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 687 place count 867 transition count 866
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 687 place count 867 transition count 649
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1121 place count 650 transition count 649
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1147 place count 624 transition count 623
Iterating global reduction 3 with 26 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1173 place count 624 transition count 601
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1217 place count 602 transition count 601
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 97 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 97 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 11 ms
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 10 ms
[2023-03-20 10:52:38] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 119 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 25 ms
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 26 ms
[2023-03-20 10:52:38] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1173 transition count 1173
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1172 transition count 1172
Applied a total of 78 rules in 86 ms. Remains 1172 /1211 variables (removed 39) and now considering 1172/1211 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 1172/1211 places, 1172/1211 transitions.
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 25 ms
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 24 ms
[2023-03-20 10:52:38] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1184 transition count 1184
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1184 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1183 transition count 1183
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1183 transition count 1183
Applied a total of 56 rules in 102 ms. Remains 1183 /1211 variables (removed 28) and now considering 1183/1211 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 1183/1211 places, 1183/1211 transitions.
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 24 ms
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 24 ms
[2023-03-20 10:52:38] [INFO ] Input system was already deterministic with 1183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1178 transition count 1178
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1177 transition count 1177
Applied a total of 68 rules in 100 ms. Remains 1177 /1211 variables (removed 34) and now considering 1177/1211 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1177/1211 places, 1177/1211 transitions.
[2023-03-20 10:52:38] [INFO ] Flatten gal took : 22 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 24 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 1177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1173 transition count 1173
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1172 transition count 1172
Applied a total of 78 rules in 100 ms. Remains 1172 /1211 variables (removed 39) and now considering 1172/1211 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1172/1211 places, 1172/1211 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 107 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 23 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1179 transition count 1179
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1179 transition count 1179
Applied a total of 64 rules in 62 ms. Remains 1179 /1211 variables (removed 32) and now considering 1179/1211 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 1179/1211 places, 1179/1211 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 19 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 21 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 1179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1210 transition count 870
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 342 rules applied. Total rules applied 682 place count 870 transition count 868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 683 place count 869 transition count 868
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 683 place count 869 transition count 652
Deduced a syphon composed of 216 places in 0 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1115 place count 653 transition count 652
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1143 place count 625 transition count 624
Iterating global reduction 3 with 28 rules applied. Total rules applied 1171 place count 625 transition count 624
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1171 place count 625 transition count 601
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1217 place count 602 transition count 601
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1691 place count 365 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 363 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1694 place count 362 transition count 362
Applied a total of 1694 rules in 73 ms. Remains 362 /1211 variables (removed 849) and now considering 362/1211 (removed 849) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 362/1211 places, 362/1211 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 8 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 1210 transition count 873
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 339 rules applied. Total rules applied 676 place count 873 transition count 871
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 678 place count 872 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 679 place count 871 transition count 870
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 679 place count 871 transition count 654
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 1111 place count 655 transition count 654
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 1139 place count 627 transition count 626
Iterating global reduction 4 with 28 rules applied. Total rules applied 1167 place count 627 transition count 626
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1167 place count 627 transition count 603
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1213 place count 604 transition count 603
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 4 with 474 rules applied. Total rules applied 1687 place count 367 transition count 366
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1689 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1690 place count 364 transition count 364
Applied a total of 1690 rules in 72 ms. Remains 364 /1211 variables (removed 847) and now considering 364/1211 (removed 847) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 364/1211 places, 364/1211 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 7 ms
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 8 ms
[2023-03-20 10:52:39] [INFO ] Input system was already deterministic with 364 transitions.
[2023-03-20 10:52:39] [INFO ] Flatten gal took : 49 ms
[2023-03-20 10:52:40] [INFO ] Flatten gal took : 43 ms
[2023-03-20 10:52:40] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 10:52:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1211 places, 1211 transitions and 2962 arcs took 6 ms.
Total runtime 63871 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/621/ctl_0_ --ctl=/tmp/621/ctl_1_ --ctl=/tmp/621/ctl_2_ --ctl=/tmp/621/ctl_3_ --ctl=/tmp/621/ctl_4_ --ctl=/tmp/621/ctl_5_ --ctl=/tmp/621/ctl_6_ --ctl=/tmp/621/ctl_7_ --ctl=/tmp/621/ctl_8_ --ctl=/tmp/621/ctl_9_ --ctl=/tmp/621/ctl_10_ --ctl=/tmp/621/ctl_11_ --ctl=/tmp/621/ctl_12_ --ctl=/tmp/621/ctl_13_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 295136 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16093824 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 CTLFireability -timeout 360 -rebuildPNML
mcc2023

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-030B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978000298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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