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

About the Execution of LTSMin+red for DLCflexbar-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10009.907 3600000.00 12196304.00 2066.60 FFFTFFFTTTFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481400567.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DLCflexbar-PT-5b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481400567
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 15:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 25 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 15:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678333886190

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCflexbar-PT-5b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 03:51:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 03:51:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:51:28] [INFO ] Load time of PNML (sax parser for PT used): 510 ms
[2023-03-09 03:51:28] [INFO ] Transformed 17305 places.
[2023-03-09 03:51:28] [INFO ] Transformed 26483 transitions.
[2023-03-09 03:51:28] [INFO ] Found NUPN structural information;
[2023-03-09 03:51:29] [INFO ] Parsed PT model containing 17305 places and 26483 transitions and 73264 arcs in 1422 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 16) seen :3
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 26483 rows 17305 cols
[2023-03-09 03:51:31] [INFO ] Computed 979 place invariants in 166 ms
[2023-03-09 03:51:38] [INFO ] After 6517ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-09 03:51:47] [INFO ] [Nat]Absence check using 979 positive place invariants in 2789 ms returned sat
[2023-03-09 03:52:03] [INFO ] After 12802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-09 03:52:03] [INFO ] After 12889ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-09 03:52:03] [INFO ] After 25137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 384 out of 17305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17305/17305 places, 26483/26483 transitions.
Graph (trivial) has 15090 edges and 17305 vertex of which 899 / 17305 are part of one of the 78 SCC in 43 ms
Free SCC test removed 821 places
Drop transitions removed 938 transitions
Reduce isomorphic transitions removed 938 transitions.
Drop transitions removed 7649 transitions
Trivial Post-agglo rules discarded 7649 transitions
Performed 7649 trivial Post agglomeration. Transition count delta: 7649
Iterating post reduction 0 with 7649 rules applied. Total rules applied 7650 place count 16484 transition count 17896
Reduce places removed 7649 places and 0 transitions.
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 1 with 7976 rules applied. Total rules applied 15626 place count 8835 transition count 17569
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 2 with 246 rules applied. Total rules applied 15872 place count 8670 transition count 17488
Reduce places removed 38 places and 0 transitions.
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 123
Iterating post reduction 3 with 161 rules applied. Total rules applied 16033 place count 8632 transition count 17365
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 130 rules applied. Total rules applied 16163 place count 8509 transition count 17358
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 16165 place count 8507 transition count 17358
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 234 Pre rules applied. Total rules applied 16165 place count 8507 transition count 17124
Deduced a syphon composed of 234 places in 429 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 6 with 468 rules applied. Total rules applied 16633 place count 8273 transition count 17124
Discarding 2190 places :
Symmetric choice reduction at 6 with 2190 rule applications. Total rules 18823 place count 6083 transition count 14934
Iterating global reduction 6 with 2190 rules applied. Total rules applied 21013 place count 6083 transition count 14934
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 6 with 41 rules applied. Total rules applied 21054 place count 6083 transition count 14893
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 21 rules applied. Total rules applied 21075 place count 6070 transition count 14885
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 21078 place count 6068 transition count 14884
Performed 871 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 871 Pre rules applied. Total rules applied 21078 place count 6068 transition count 14013
Deduced a syphon composed of 871 places in 358 ms
Reduce places removed 871 places and 0 transitions.
Iterating global reduction 9 with 1742 rules applied. Total rules applied 22820 place count 5197 transition count 14013
Discarding 91 places :
Symmetric choice reduction at 9 with 91 rule applications. Total rules 22911 place count 5106 transition count 13107
Iterating global reduction 9 with 91 rules applied. Total rules applied 23002 place count 5106 transition count 13107
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 9 with 80 rules applied. Total rules applied 23082 place count 5106 transition count 13027
Performed 1257 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 1257 places in 8 ms
Reduce places removed 1257 places and 0 transitions.
Iterating global reduction 10 with 2514 rules applied. Total rules applied 25596 place count 3849 transition count 11767
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 25597 place count 3849 transition count 11766
Renaming transitions due to excessive name length > 1024 char.
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 25601 place count 3845 transition count 11494
Iterating global reduction 11 with 4 rules applied. Total rules applied 25605 place count 3845 transition count 11494
Performed 101 Post agglomeration using F-continuation condition with reduction of 154 identical transitions.
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 11 with 202 rules applied. Total rules applied 25807 place count 3744 transition count 12223
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 25814 place count 3744 transition count 12216
Discarding 29 places :
Symmetric choice reduction at 12 with 29 rule applications. Total rules 25843 place count 3715 transition count 11810
Iterating global reduction 12 with 29 rules applied. Total rules applied 25872 place count 3715 transition count 11810
Ensure Unique test removed 155 transitions
Reduce isomorphic transitions removed 155 transitions.
Iterating post reduction 12 with 155 rules applied. Total rules applied 26027 place count 3715 transition count 11655
Performed 101 Post agglomeration using F-continuation condition with reduction of 140 identical transitions.
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 13 with 202 rules applied. Total rules applied 26229 place count 3614 transition count 12393
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 26238 place count 3614 transition count 12384
Discarding 28 places :
Symmetric choice reduction at 14 with 28 rule applications. Total rules 26266 place count 3586 transition count 11992
Iterating global reduction 14 with 28 rules applied. Total rules applied 26294 place count 3586 transition count 11992
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Iterating post reduction 14 with 135 rules applied. Total rules applied 26429 place count 3586 transition count 11857
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -863
Deduced a syphon composed of 101 places in 4 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 15 with 202 rules applied. Total rules applied 26631 place count 3485 transition count 12720
Drop transitions removed 118 transitions
Reduce isomorphic transitions removed 118 transitions.
Iterating post reduction 15 with 118 rules applied. Total rules applied 26749 place count 3485 transition count 12602
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -257
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 16 with 54 rules applied. Total rules applied 26803 place count 3458 transition count 12859
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 16 with 27 rules applied. Total rules applied 26830 place count 3458 transition count 12832
Drop transitions removed 142 transitions
Redundant transition composition rules discarded 142 transitions
Iterating global reduction 17 with 142 rules applied. Total rules applied 26972 place count 3458 transition count 12690
Free-agglomeration rule applied 1628 times with reduction of 522 identical transitions.
Iterating global reduction 17 with 1628 rules applied. Total rules applied 28600 place count 3458 transition count 10540
Reduce places removed 1628 places and 0 transitions.
Drop transitions removed 1552 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 1581 transitions.
Graph (complete) has 9079 edges and 1830 vertex of which 1826 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 3210 rules applied. Total rules applied 31810 place count 1826 transition count 8959
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 18 with 28 rules applied. Total rules applied 31838 place count 1826 transition count 8931
Discarding 13 places :
Symmetric choice reduction at 19 with 13 rule applications. Total rules 31851 place count 1813 transition count 8856
Iterating global reduction 19 with 13 rules applied. Total rules applied 31864 place count 1813 transition count 8856
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 31865 place count 1813 transition count 8855
Drop transitions removed 270 transitions
Redundant transition composition rules discarded 270 transitions
Iterating global reduction 20 with 270 rules applied. Total rules applied 32135 place count 1813 transition count 8585
Discarding 16 places :
Symmetric choice reduction at 20 with 16 rule applications. Total rules 32151 place count 1797 transition count 8465
Iterating global reduction 20 with 16 rules applied. Total rules applied 32167 place count 1797 transition count 8465
Free-agglomeration rule applied 1 times.
Iterating global reduction 20 with 1 rules applied. Total rules applied 32168 place count 1797 transition count 8464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 32169 place count 1796 transition count 8464
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 21 with 7 rules applied. Total rules applied 32176 place count 1796 transition count 8457
Free-agglomeration rule applied 1 times.
Iterating global reduction 21 with 1 rules applied. Total rules applied 32177 place count 1796 transition count 8456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 32178 place count 1795 transition count 8456
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 22 with 4 rules applied. Total rules applied 32182 place count 1795 transition count 8727
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 22 with 114 rules applied. Total rules applied 32296 place count 1791 transition count 8617
Drop transitions removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 23 with 129 rules applied. Total rules applied 32425 place count 1791 transition count 8488
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 23 with 22 rules applied. Total rules applied 32447 place count 1791 transition count 8488
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 32448 place count 1791 transition count 8487
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 32450 place count 1791 transition count 8487
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 32452 place count 1791 transition count 8485
Applied a total of 32452 rules in 9652 ms. Remains 1791 /17305 variables (removed 15514) and now considering 8485/26483 (removed 17998) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9654 ms. Remains : 1791/17305 places, 8485/26483 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 13) seen :7
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-09 03:52:13] [INFO ] Flow matrix only has 3149 transitions (discarded 5336 similar events)
// Phase 1: matrix 3149 rows 1791 cols
[2023-03-09 03:52:13] [INFO ] Computed 950 place invariants in 33 ms
[2023-03-09 03:52:14] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-09 03:52:14] [INFO ] [Nat]Absence check using 950 positive place invariants in 227 ms returned sat
[2023-03-09 03:52:17] [INFO ] After 2449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-09 03:52:17] [INFO ] State equation strengthened by 594 read => feed constraints.
[2023-03-09 03:52:20] [INFO ] After 2615ms SMT Verify possible using 594 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-09 03:52:21] [INFO ] Deduced a trap composed of 38 places in 200 ms of which 5 ms to minimize.
[2023-03-09 03:52:22] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 1 ms to minimize.
[2023-03-09 03:52:22] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 1 ms to minimize.
[2023-03-09 03:52:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 925 ms
[2023-03-09 03:52:23] [INFO ] After 6165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2050 ms.
[2023-03-09 03:52:25] [INFO ] After 11467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 105 ms.
Support contains 247 out of 1791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1791/1791 places, 8485/8485 transitions.
Graph (trivial) has 273 edges and 1791 vertex of which 35 / 1791 are part of one of the 14 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions removed 40 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 60 transitions.
Graph (complete) has 8623 edges and 1770 vertex of which 1760 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 1760 transition count 8347
Reduce places removed 15 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 17 rules applied. Total rules applied 90 place count 1745 transition count 8345
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 93 place count 1744 transition count 8343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 95 place count 1742 transition count 8343
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 95 place count 1742 transition count 8322
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 137 place count 1721 transition count 8322
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 1721 transition count 8321
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 173 place count 1686 transition count 8025
Iterating global reduction 5 with 35 rules applied. Total rules applied 208 place count 1686 transition count 8025
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 2 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 266 place count 1657 transition count 7996
Drop transitions removed 248 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 265 transitions.
Iterating post reduction 5 with 265 rules applied. Total rules applied 531 place count 1657 transition count 7731
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 535 place count 1653 transition count 7563
Iterating global reduction 6 with 4 rules applied. Total rules applied 539 place count 1653 transition count 7563
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 548 place count 1653 transition count 7554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 550 place count 1652 transition count 7553
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 557 place count 1652 transition count 7546
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 569 place count 1646 transition count 7575
Drop transitions removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 592 place count 1646 transition count 7552
Drop transitions removed 223 transitions
Redundant transition composition rules discarded 223 transitions
Iterating global reduction 9 with 223 rules applied. Total rules applied 815 place count 1646 transition count 7329
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 815 place count 1646 transition count 7328
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 817 place count 1645 transition count 7328
Discarding 15 places :
Symmetric choice reduction at 9 with 15 rule applications. Total rules 832 place count 1630 transition count 7211
Iterating global reduction 9 with 15 rules applied. Total rules applied 847 place count 1630 transition count 7211
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 854 place count 1630 transition count 7204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 856 place count 1629 transition count 7210
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 864 place count 1629 transition count 7202
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 867 place count 1626 transition count 7182
Iterating global reduction 10 with 3 rules applied. Total rules applied 870 place count 1626 transition count 7182
Free-agglomeration rule applied 80 times with reduction of 9 identical transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 950 place count 1626 transition count 7093
Reduce places removed 80 places and 0 transitions.
Drop transitions removed 484 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 493 transitions.
Graph (complete) has 6854 edges and 1546 vertex of which 1541 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 574 rules applied. Total rules applied 1524 place count 1541 transition count 6600
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 1534 place count 1541 transition count 6590
Discarding 18 places :
Symmetric choice reduction at 12 with 18 rule applications. Total rules 1552 place count 1523 transition count 6534
Iterating global reduction 12 with 18 rules applied. Total rules applied 1570 place count 1523 transition count 6534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1572 place count 1522 transition count 6540
Drop transitions removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 12 with 113 rules applied. Total rules applied 1685 place count 1522 transition count 6427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1686 place count 1521 transition count 6427
Discarding 33 places :
Symmetric choice reduction at 13 with 33 rule applications. Total rules 1719 place count 1488 transition count 6367
Iterating global reduction 13 with 33 rules applied. Total rules applied 1752 place count 1488 transition count 6367
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1753 place count 1488 transition count 6366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1754 place count 1487 transition count 6366
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 14 with 2 rules applied. Total rules applied 1756 place count 1487 transition count 6552
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 105 transitions
Reduce isomorphic transitions removed 105 transitions.
Iterating post reduction 14 with 107 rules applied. Total rules applied 1863 place count 1485 transition count 6447
Drop transitions removed 64 transitions
Redundant transition composition rules discarded 64 transitions
Iterating global reduction 15 with 64 rules applied. Total rules applied 1927 place count 1485 transition count 6383
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 1932 place count 1485 transition count 6383
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 1936 place count 1485 transition count 6379
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 1942 place count 1482 transition count 6376
Applied a total of 1942 rules in 1415 ms. Remains 1482 /1791 variables (removed 309) and now considering 6376/8485 (removed 2109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1415 ms. Remains : 1482/1791 places, 6376/8485 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 6) seen :2
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 03:52:28] [INFO ] Flow matrix only has 2247 transitions (discarded 4129 similar events)
// Phase 1: matrix 2247 rows 1482 cols
[2023-03-09 03:52:28] [INFO ] Computed 854 place invariants in 20 ms
[2023-03-09 03:52:28] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 03:52:28] [INFO ] [Nat]Absence check using 854 positive place invariants in 190 ms returned sat
[2023-03-09 03:52:30] [INFO ] After 1461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 03:52:30] [INFO ] State equation strengthened by 533 read => feed constraints.
[2023-03-09 03:52:31] [INFO ] After 1278ms SMT Verify possible using 533 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 03:52:33] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 1 ms to minimize.
[2023-03-09 03:52:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2023-03-09 03:52:33] [INFO ] After 3203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1146 ms.
[2023-03-09 03:52:34] [INFO ] After 6398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 172 out of 1482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1482/1482 places, 6376/6376 transitions.
Graph (trivial) has 172 edges and 1482 vertex of which 17 / 1482 are part of one of the 8 SCC in 1 ms
Free SCC test removed 9 places
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 6648 edges and 1473 vertex of which 1468 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 29 rules applied. Total rules applied 31 place count 1468 transition count 6327
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 41 place count 1458 transition count 6327
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 41 place count 1458 transition count 6311
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 73 place count 1442 transition count 6311
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 1442 transition count 6307
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 90 place count 1429 transition count 6252
Iterating global reduction 3 with 13 rules applied. Total rules applied 103 place count 1429 transition count 6252
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 135 place count 1413 transition count 6236
Drop transitions removed 27 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 6451 edges and 1413 vertex of which 1407 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 31 rules applied. Total rules applied 166 place count 1407 transition count 6204
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 190 place count 1407 transition count 6180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 190 place count 1407 transition count 6179
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 192 place count 1406 transition count 6179
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 193 place count 1406 transition count 6178
Discarding 27 places :
Symmetric choice reduction at 6 with 27 rule applications. Total rules 220 place count 1379 transition count 6053
Iterating global reduction 6 with 27 rules applied. Total rules applied 247 place count 1379 transition count 6053
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 263 place count 1371 transition count 6104
Drop transitions removed 30 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 297 place count 1371 transition count 6070
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 299 place count 1369 transition count 6054
Iterating global reduction 7 with 2 rules applied. Total rules applied 301 place count 1369 transition count 6054
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 309 place count 1369 transition count 6046
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 8 with 38 rules applied. Total rules applied 347 place count 1369 transition count 6008
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 352 place count 1364 transition count 5965
Iterating global reduction 8 with 5 rules applied. Total rules applied 357 place count 1364 transition count 5965
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 361 place count 1364 transition count 5961
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 361 place count 1364 transition count 5960
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 363 place count 1363 transition count 5960
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 6209 edges and 1363 vertex of which 1360 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 6 rules applied. Total rules applied 369 place count 1360 transition count 5955
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 379 place count 1360 transition count 5945
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 381 place count 1358 transition count 5941
Iterating global reduction 11 with 2 rules applied. Total rules applied 383 place count 1358 transition count 5941
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 390 place count 1358 transition count 5934
Free-agglomeration rule applied 39 times with reduction of 4 identical transitions.
Iterating global reduction 11 with 39 rules applied. Total rules applied 429 place count 1358 transition count 5891
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 447 transitions
Reduce isomorphic transitions removed 447 transitions.
Graph (complete) has 5785 edges and 1319 vertex of which 1311 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Iterating post reduction 11 with 487 rules applied. Total rules applied 916 place count 1311 transition count 5439
Drop transitions removed 8 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 12 with 20 rules applied. Total rules applied 936 place count 1311 transition count 5419
Discarding 26 places :
Symmetric choice reduction at 13 with 26 rule applications. Total rules 962 place count 1285 transition count 5286
Iterating global reduction 13 with 26 rules applied. Total rules applied 988 place count 1285 transition count 5286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 990 place count 1284 transition count 5285
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 997 place count 1284 transition count 5278
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 999 place count 1283 transition count 5284
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 14 with 27 rules applied. Total rules applied 1026 place count 1283 transition count 5257
Free-agglomeration rule applied 1 times.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1027 place count 1283 transition count 5256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1028 place count 1282 transition count 5256
Applied a total of 1028 rules in 918 ms. Remains 1282 /1482 variables (removed 200) and now considering 5256/6376 (removed 1120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 918 ms. Remains : 1282/1482 places, 5256/6376 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 4) seen :1
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 03:52:36] [INFO ] Flow matrix only has 1826 transitions (discarded 3430 similar events)
// Phase 1: matrix 1826 rows 1282 cols
[2023-03-09 03:52:36] [INFO ] Computed 777 place invariants in 15 ms
[2023-03-09 03:52:36] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 03:52:36] [INFO ] [Nat]Absence check using 777 positive place invariants in 178 ms returned sat
[2023-03-09 03:52:38] [INFO ] After 1250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 03:52:38] [INFO ] State equation strengthened by 477 read => feed constraints.
[2023-03-09 03:52:39] [INFO ] After 937ms SMT Verify possible using 477 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 03:52:40] [INFO ] After 1831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 973 ms.
[2023-03-09 03:52:41] [INFO ] After 4580ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 152 out of 1282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1282/1282 places, 5256/5256 transitions.
Graph (trivial) has 85 edges and 1282 vertex of which 6 / 1282 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 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 4 place count 1278 transition count 5247
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 1275 transition count 5247
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 7 place count 1275 transition count 5240
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 21 place count 1268 transition count 5240
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 1268 transition count 5237
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 26 place count 1266 transition count 5229
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 1266 transition count 5229
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 1259 transition count 5222
Drop transitions removed 69 transitions
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 3 with 127 rules applied. Total rules applied 169 place count 1259 transition count 5095
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 173 place count 1257 transition count 5110
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 178 place count 1257 transition count 5105
Drop transitions removed 184 transitions
Redundant transition composition rules discarded 184 transitions
Iterating global reduction 5 with 184 rules applied. Total rules applied 362 place count 1257 transition count 4921
Free-agglomeration rule applied 18 times with reduction of 4 identical transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 380 place count 1257 transition count 4899
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 280 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 289 transitions.
Graph (complete) has 5059 edges and 1239 vertex of which 1236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 308 rules applied. Total rules applied 688 place count 1236 transition count 4609
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 700 place count 1236 transition count 4597
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 713 place count 1223 transition count 4547
Iterating global reduction 7 with 13 rules applied. Total rules applied 726 place count 1223 transition count 4547
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 7 with 52 rules applied. Total rules applied 778 place count 1223 transition count 4495
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 786 place count 1223 transition count 4487
Applied a total of 786 rules in 409 ms. Remains 1223 /1282 variables (removed 59) and now considering 4487/5256 (removed 769) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 410 ms. Remains : 1223/1282 places, 4487/5256 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 170656 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170656 steps, saw 161852 distinct states, run finished after 3003 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 03:52:45] [INFO ] Flow matrix only has 1548 transitions (discarded 2939 similar events)
// Phase 1: matrix 1548 rows 1223 cols
[2023-03-09 03:52:45] [INFO ] Computed 761 place invariants in 15 ms
[2023-03-09 03:52:45] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 03:52:45] [INFO ] [Nat]Absence check using 761 positive place invariants in 179 ms returned sat
[2023-03-09 03:52:46] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 03:52:46] [INFO ] State equation strengthened by 482 read => feed constraints.
[2023-03-09 03:52:47] [INFO ] After 912ms SMT Verify possible using 482 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 03:52:48] [INFO ] After 1696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 967 ms.
[2023-03-09 03:52:49] [INFO ] After 4234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 152 out of 1223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 4487/4487 transitions.
Applied a total of 0 rules in 61 ms. Remains 1223 /1223 variables (removed 0) and now considering 4487/4487 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1223/1223 places, 4487/4487 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1223/1223 places, 4487/4487 transitions.
Applied a total of 0 rules in 64 ms. Remains 1223 /1223 variables (removed 0) and now considering 4487/4487 (removed 0) transitions.
[2023-03-09 03:52:49] [INFO ] Flow matrix only has 1548 transitions (discarded 2939 similar events)
[2023-03-09 03:52:49] [INFO ] Invariant cache hit.
[2023-03-09 03:52:50] [INFO ] Implicit Places using invariants in 1252 ms returned [19, 25, 77, 1078, 1220, 1221, 1222]
Discarding 7 places :
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Implicit Place search using SMT only with invariants took 1257 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1216/1223 places, 4475/4487 transitions.
Performed 8 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 1208 transition count 4459
Drop transitions removed 9 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 70 place count 1208 transition count 4405
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 1200 transition count 4390
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 1200 transition count 4390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 88 place count 1199 transition count 4389
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 98 place count 1194 transition count 4415
Drop transitions removed 396 transitions
Redundant transition composition rules discarded 396 transitions
Iterating global reduction 1 with 396 rules applied. Total rules applied 494 place count 1194 transition count 4019
Reduce places removed 3 places and 0 transitions.
Graph (complete) has 4494 edges and 1191 vertex of which 1159 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 31 output transitions
Drop transitions removed 31 transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 498 place count 1159 transition count 3988
Drop transitions removed 40 transitions
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 84 transitions.
Iterating post reduction 2 with 84 rules applied. Total rules applied 582 place count 1159 transition count 3904
Discarding 124 places :
Symmetric choice reduction at 3 with 124 rule applications. Total rules 706 place count 1035 transition count 3625
Iterating global reduction 3 with 124 rules applied. Total rules applied 830 place count 1035 transition count 3625
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 838 place count 1031 transition count 3649
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 839 place count 1031 transition count 3649
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 840 place count 1031 transition count 3648
Applied a total of 840 rules in 389 ms. Remains 1031 /1216 variables (removed 185) and now considering 3648/4475 (removed 827) transitions.
[2023-03-09 03:52:51] [INFO ] Flow matrix only has 1458 transitions (discarded 2190 similar events)
// Phase 1: matrix 1458 rows 1031 cols
[2023-03-09 03:52:51] [INFO ] Computed 599 place invariants in 24 ms
[2023-03-09 03:52:52] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-09 03:52:52] [INFO ] Flow matrix only has 1458 transitions (discarded 2190 similar events)
[2023-03-09 03:52:52] [INFO ] Invariant cache hit.
[2023-03-09 03:52:52] [INFO ] State equation strengthened by 437 read => feed constraints.
[2023-03-09 03:52:59] [INFO ] Implicit Places using invariants and state equation in 7445 ms returned []
Implicit Place search using SMT with State Equation took 8225 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1031/1223 places, 3648/4487 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9938 ms. Remains : 1031/1223 places, 3648/4487 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 180474 steps, run timeout after 3005 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180474 steps, saw 170229 distinct states, run finished after 3005 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 03:53:03] [INFO ] Flow matrix only has 1458 transitions (discarded 2190 similar events)
[2023-03-09 03:53:03] [INFO ] Invariant cache hit.
[2023-03-09 03:53:03] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 03:53:03] [INFO ] [Nat]Absence check using 599 positive place invariants in 130 ms returned sat
[2023-03-09 03:53:04] [INFO ] After 915ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 03:53:04] [INFO ] State equation strengthened by 437 read => feed constraints.
[2023-03-09 03:53:05] [INFO ] After 801ms SMT Verify possible using 437 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 03:53:06] [INFO ] After 1478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 637 ms.
[2023-03-09 03:53:06] [INFO ] After 3420ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 152 out of 1031 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 3648/3648 transitions.
Applied a total of 0 rules in 60 ms. Remains 1031 /1031 variables (removed 0) and now considering 3648/3648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1031/1031 places, 3648/3648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1031/1031 places, 3648/3648 transitions.
Applied a total of 0 rules in 54 ms. Remains 1031 /1031 variables (removed 0) and now considering 3648/3648 (removed 0) transitions.
[2023-03-09 03:53:06] [INFO ] Flow matrix only has 1458 transitions (discarded 2190 similar events)
[2023-03-09 03:53:06] [INFO ] Invariant cache hit.
[2023-03-09 03:53:07] [INFO ] Implicit Places using invariants in 785 ms returned []
[2023-03-09 03:53:07] [INFO ] Flow matrix only has 1458 transitions (discarded 2190 similar events)
[2023-03-09 03:53:07] [INFO ] Invariant cache hit.
[2023-03-09 03:53:08] [INFO ] State equation strengthened by 437 read => feed constraints.
[2023-03-09 03:53:14] [INFO ] Implicit Places using invariants and state equation in 6915 ms returned [515]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7709 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1030/1031 places, 3648/3648 transitions.
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 1030 transition count 3637
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 11 place count 1030 transition count 3636
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 1029 transition count 3636
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 1027 transition count 3633
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 1027 transition count 3633
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 0 with 2 rules applied. Total rules applied 19 place count 1026 transition count 3632
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 26 place count 1026 transition count 3625
Applied a total of 26 rules in 158 ms. Remains 1026 /1030 variables (removed 4) and now considering 3625/3648 (removed 23) transitions.
[2023-03-09 03:53:14] [INFO ] Flow matrix only has 1454 transitions (discarded 2171 similar events)
// Phase 1: matrix 1454 rows 1026 cols
[2023-03-09 03:53:14] [INFO ] Computed 596 place invariants in 14 ms
[2023-03-09 03:53:15] [INFO ] Implicit Places using invariants in 787 ms returned []
[2023-03-09 03:53:15] [INFO ] Flow matrix only has 1454 transitions (discarded 2171 similar events)
[2023-03-09 03:53:15] [INFO ] Invariant cache hit.
[2023-03-09 03:53:16] [INFO ] State equation strengthened by 433 read => feed constraints.
[2023-03-09 03:53:21] [INFO ] Implicit Places using invariants and state equation in 6358 ms returned []
Implicit Place search using SMT with State Equation took 7147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1026/1031 places, 3625/3648 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15070 ms. Remains : 1026/1031 places, 3625/3648 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 238919 steps, run timeout after 3002 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238919 steps, saw 224600 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-09 03:53:25] [INFO ] Flow matrix only has 1454 transitions (discarded 2171 similar events)
[2023-03-09 03:53:25] [INFO ] Invariant cache hit.
[2023-03-09 03:53:25] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 03:53:25] [INFO ] [Nat]Absence check using 596 positive place invariants in 126 ms returned sat
[2023-03-09 03:53:26] [INFO ] After 1004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 03:53:26] [INFO ] State equation strengthened by 433 read => feed constraints.
[2023-03-09 03:53:27] [INFO ] After 799ms SMT Verify possible using 433 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-09 03:53:28] [INFO ] After 1442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 568 ms.
[2023-03-09 03:53:28] [INFO ] After 3418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 152 out of 1026 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 3625/3625 transitions.
Applied a total of 0 rules in 60 ms. Remains 1026 /1026 variables (removed 0) and now considering 3625/3625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 1026/1026 places, 3625/3625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1026/1026 places, 3625/3625 transitions.
Applied a total of 0 rules in 52 ms. Remains 1026 /1026 variables (removed 0) and now considering 3625/3625 (removed 0) transitions.
[2023-03-09 03:53:29] [INFO ] Flow matrix only has 1454 transitions (discarded 2171 similar events)
[2023-03-09 03:53:29] [INFO ] Invariant cache hit.
[2023-03-09 03:53:29] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-09 03:53:29] [INFO ] Flow matrix only has 1454 transitions (discarded 2171 similar events)
[2023-03-09 03:53:29] [INFO ] Invariant cache hit.
[2023-03-09 03:53:30] [INFO ] State equation strengthened by 433 read => feed constraints.
[2023-03-09 03:53:36] [INFO ] Implicit Places using invariants and state equation in 6297 ms returned [497]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 7095 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1025/1026 places, 3625/3625 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1025 transition count 3621
Graph (complete) has 4079 edges and 1025 vertex of which 1023 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 1023 transition count 3621
Drop transitions removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 16 place count 1023 transition count 3610
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 1021 transition count 3607
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 1021 transition count 3607
Applied a total of 20 rules in 128 ms. Remains 1021 /1025 variables (removed 4) and now considering 3607/3625 (removed 18) transitions.
[2023-03-09 03:53:36] [INFO ] Flow matrix only has 1443 transitions (discarded 2164 similar events)
// Phase 1: matrix 1443 rows 1021 cols
[2023-03-09 03:53:36] [INFO ] Computed 592 place invariants in 19 ms
[2023-03-09 03:53:37] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-09 03:53:37] [INFO ] Flow matrix only has 1443 transitions (discarded 2164 similar events)
[2023-03-09 03:53:37] [INFO ] Invariant cache hit.
[2023-03-09 03:53:37] [INFO ] State equation strengthened by 430 read => feed constraints.
[2023-03-09 03:53:43] [INFO ] Implicit Places using invariants and state equation in 5917 ms returned []
Implicit Place search using SMT with State Equation took 6710 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1021/1026 places, 3607/3625 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 13994 ms. Remains : 1021/1026 places, 3607/3625 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 3) seen :1
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:53:43] [INFO ] Flow matrix only has 1443 transitions (discarded 2164 similar events)
[2023-03-09 03:53:43] [INFO ] Invariant cache hit.
[2023-03-09 03:53:43] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:53:43] [INFO ] [Nat]Absence check using 592 positive place invariants in 127 ms returned sat
[2023-03-09 03:53:44] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:53:44] [INFO ] State equation strengthened by 430 read => feed constraints.
[2023-03-09 03:53:45] [INFO ] After 556ms SMT Verify possible using 430 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:53:45] [INFO ] After 1000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 447 ms.
[2023-03-09 03:53:46] [INFO ] After 2612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 112 out of 1021 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1021/1021 places, 3607/3607 transitions.
Graph (trivial) has 92 edges and 1021 vertex of which 7 / 1021 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 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 4 place count 1017 transition count 3594
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 1014 transition count 3594
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 7 place count 1014 transition count 3586
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 23 place count 1006 transition count 3586
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 1006 transition count 3582
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 31 place count 1002 transition count 3566
Iterating global reduction 3 with 4 rules applied. Total rules applied 35 place count 1002 transition count 3566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 36 place count 1002 transition count 3565
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 56 place count 992 transition count 3555
Drop transitions removed 19 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 3976 edges and 992 vertex of which 988 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 4 with 22 rules applied. Total rules applied 78 place count 988 transition count 3532
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 86 place count 988 transition count 3524
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 95 place count 979 transition count 3490
Iterating global reduction 6 with 9 rules applied. Total rules applied 104 place count 979 transition count 3490
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 108 place count 977 transition count 3512
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 129 place count 977 transition count 3491
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 148 place count 977 transition count 3472
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 151 place count 974 transition count 3449
Iterating global reduction 7 with 3 rules applied. Total rules applied 154 place count 974 transition count 3449
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 164 place count 974 transition count 3439
Free-agglomeration rule applied 23 times with reduction of 4 identical transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 187 place count 974 transition count 3412
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 123 transitions
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 213 transitions.
Graph (complete) has 3717 edges and 951 vertex of which 946 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 237 rules applied. Total rules applied 424 place count 946 transition count 3199
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 436 place count 946 transition count 3187
Discarding 11 places :
Symmetric choice reduction at 10 with 11 rule applications. Total rules 447 place count 935 transition count 3144
Iterating global reduction 10 with 11 rules applied. Total rules applied 458 place count 935 transition count 3144
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 10 with 45 rules applied. Total rules applied 503 place count 935 transition count 3099
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 11 with 14 rules applied. Total rules applied 517 place count 935 transition count 3085
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 518 place count 934 transition count 3084
Iterating global reduction 11 with 1 rules applied. Total rules applied 519 place count 934 transition count 3084
Applied a total of 519 rules in 360 ms. Remains 934 /1021 variables (removed 87) and now considering 3084/3607 (removed 523) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 934/1021 places, 3084/3607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 238829 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238829 steps, saw 224445 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:53:49] [INFO ] Flow matrix only has 1235 transitions (discarded 1849 similar events)
// Phase 1: matrix 1235 rows 934 cols
[2023-03-09 03:53:49] [INFO ] Computed 563 place invariants in 21 ms
[2023-03-09 03:53:50] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 03:53:50] [INFO ] [Nat]Absence check using 563 positive place invariants in 124 ms returned sat
[2023-03-09 03:53:51] [INFO ] After 758ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-09 03:53:51] [INFO ] State equation strengthened by 390 read => feed constraints.
[2023-03-09 03:53:51] [INFO ] After 547ms SMT Verify possible using 390 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-09 03:53:52] [INFO ] After 1052ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 435 ms.
[2023-03-09 03:53:52] [INFO ] After 2553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 112 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 3084/3084 transitions.
Applied a total of 0 rules in 42 ms. Remains 934 /934 variables (removed 0) and now considering 3084/3084 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 934/934 places, 3084/3084 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 3084/3084 transitions.
Applied a total of 0 rules in 42 ms. Remains 934 /934 variables (removed 0) and now considering 3084/3084 (removed 0) transitions.
[2023-03-09 03:53:52] [INFO ] Flow matrix only has 1235 transitions (discarded 1849 similar events)
[2023-03-09 03:53:52] [INFO ] Invariant cache hit.
[2023-03-09 03:53:53] [INFO ] Implicit Places using invariants in 755 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 758 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 933/934 places, 3084/3084 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 932 transition count 3083
Drop transitions removed 2 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 932 transition count 3073
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 931 transition count 3079
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 931 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 930 transition count 3064
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 930 transition count 3064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 929 transition count 3066
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 929 transition count 3062
Applied a total of 35 rules in 208 ms. Remains 929 /933 variables (removed 4) and now considering 3062/3084 (removed 22) transitions.
[2023-03-09 03:53:53] [INFO ] Flow matrix only has 1214 transitions (discarded 1848 similar events)
// Phase 1: matrix 1214 rows 929 cols
[2023-03-09 03:53:53] [INFO ] Computed 561 place invariants in 12 ms
[2023-03-09 03:53:54] [INFO ] Implicit Places using invariants in 953 ms returned [256, 381, 448, 450, 452, 455, 457, 459, 461, 465, 473, 493, 568, 574, 587, 655, 739, 792, 793, 794, 795, 796, 797, 798, 801, 802, 803, 804, 807, 808, 809, 814, 815, 816, 817, 818, 819, 820, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 837, 838, 839, 840, 841, 842, 843, 844, 847, 848, 849, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 912, 913, 916, 917, 918, 919, 922, 923, 924, 925, 926]
Discarding 126 places :
Ensure Unique test removed 202 transitions
Reduce isomorphic transitions removed 202 transitions.
Implicit Place search using SMT only with invariants took 957 ms to find 126 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 803/934 places, 2860/3084 transitions.
Graph (trivial) has 165 edges and 803 vertex of which 84 / 803 are part of one of the 38 SCC in 0 ms
Free SCC test removed 46 places
Drop transitions removed 790 transitions
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 937 transitions.
Graph (complete) has 2156 edges and 757 vertex of which 667 are kept as prefixes of interest. Removing 90 places using SCC suffix rule.1 ms
Discarding 90 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 63 transitions
Ensure Unique test removed 134 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 667 transition count 1718
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 281 place count 585 transition count 1519
Iterating global reduction 1 with 82 rules applied. Total rules applied 363 place count 585 transition count 1519
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 381 place count 576 transition count 1561
Drop transitions removed 714 transitions
Redundant transition composition rules discarded 714 transitions
Iterating global reduction 1 with 714 rules applied. Total rules applied 1095 place count 576 transition count 847
Reduce places removed 130 places and 0 transitions.
Graph (complete) has 1158 edges and 446 vertex of which 381 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 132 rules applied. Total rules applied 1227 place count 381 transition count 840
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 64 transitions
Ensure Unique test removed 123 transitions
Reduce isomorphic transitions removed 187 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 194 rules applied. Total rules applied 1421 place count 380 transition count 647
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 8 rules applied. Total rules applied 1429 place count 374 transition count 645
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1431 place count 372 transition count 645
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 1431 place count 372 transition count 637
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1447 place count 364 transition count 637
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1448 place count 363 transition count 636
Iterating global reduction 5 with 1 rules applied. Total rules applied 1449 place count 363 transition count 636
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 5 with 2 rules applied. Total rules applied 1451 place count 362 transition count 635
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1465 place count 355 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1466 place count 355 transition count 668
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1468 place count 355 transition count 666
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1468 place count 355 transition count 665
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1470 place count 354 transition count 665
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1480 place count 354 transition count 655
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1490 place count 344 transition count 655
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1492 place count 344 transition count 653
Graph (complete) has 928 edges and 344 vertex of which 340 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 1493 place count 340 transition count 653
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1505 place count 340 transition count 641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1505 place count 340 transition count 640
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1507 place count 339 transition count 640
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 1511 place count 337 transition count 656
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 1525 place count 337 transition count 656
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1527 place count 337 transition count 654
Applied a total of 1527 rules in 149 ms. Remains 337 /803 variables (removed 466) and now considering 654/2860 (removed 2206) transitions.
[2023-03-09 03:53:54] [INFO ] Flow matrix only has 631 transitions (discarded 23 similar events)
// Phase 1: matrix 631 rows 337 cols
[2023-03-09 03:53:54] [INFO ] Computed 127 place invariants in 5 ms
[2023-03-09 03:53:54] [INFO ] Implicit Places using invariants in 120 ms returned [15, 16, 17, 36, 56, 68, 69, 70, 86, 125]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 121 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 327/934 places, 654/3084 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 327 transition count 651
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 324 transition count 651
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 324 transition count 649
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 10 place count 322 transition count 649
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 322 transition count 648
Performed 13 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 37 place count 309 transition count 623
Drop transitions removed 15 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 91 place count 309 transition count 569
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 97 place count 303 transition count 555
Iterating global reduction 4 with 6 rules applied. Total rules applied 103 place count 303 transition count 555
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 105 place count 302 transition count 554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 301 transition count 562
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 301 transition count 550
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 124 place count 296 transition count 550
Applied a total of 124 rules in 74 ms. Remains 296 /327 variables (removed 31) and now considering 550/654 (removed 104) transitions.
[2023-03-09 03:53:55] [INFO ] Flow matrix only has 530 transitions (discarded 20 similar events)
// Phase 1: matrix 530 rows 296 cols
[2023-03-09 03:53:55] [INFO ] Computed 106 place invariants in 4 ms
[2023-03-09 03:53:55] [INFO ] Implicit Places using invariants in 89 ms returned [271]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 295/934 places, 550/3084 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 295 transition count 549
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 295 transition count 549
Applied a total of 2 rules in 30 ms. Remains 295 /295 variables (removed 0) and now considering 549/550 (removed 1) transitions.
[2023-03-09 03:53:55] [INFO ] Flow matrix only has 529 transitions (discarded 20 similar events)
// Phase 1: matrix 529 rows 295 cols
[2023-03-09 03:53:55] [INFO ] Computed 105 place invariants in 3 ms
[2023-03-09 03:53:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-09 03:53:55] [INFO ] Flow matrix only has 529 transitions (discarded 20 similar events)
[2023-03-09 03:53:55] [INFO ] Invariant cache hit.
[2023-03-09 03:53:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-09 03:53:55] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 295/934 places, 549/3084 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 2767 ms. Remains : 295/934 places, 549/3084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :1
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 03:53:55] [INFO ] Flow matrix only has 529 transitions (discarded 20 similar events)
[2023-03-09 03:53:55] [INFO ] Invariant cache hit.
[2023-03-09 03:53:55] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 03:53:55] [INFO ] [Nat]Absence check using 105 positive place invariants in 16 ms returned sat
[2023-03-09 03:53:55] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 03:53:55] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-09 03:53:55] [INFO ] After 33ms SMT Verify possible using 90 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 03:53:55] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-09 03:53:55] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 18 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 549/549 transitions.
Graph (trivial) has 189 edges and 295 vertex of which 107 / 295 are part of one of the 35 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions removed 141 transitions
Ensure Unique test removed 105 transitions
Reduce isomorphic transitions removed 246 transitions.
Graph (complete) has 488 edges and 223 vertex of which 85 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.0 ms
Discarding 138 places :
Also discarding 95 output transitions
Drop transitions removed 95 transitions
Drop transitions removed 36 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 97 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 100 rules applied. Total rules applied 102 place count 85 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 82 transition count 108
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 105 place count 82 transition count 101
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 119 place count 75 transition count 101
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 124 place count 75 transition count 96
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 74 transition count 95
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 74 transition count 95
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 138 place count 68 transition count 87
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 144 edges and 68 vertex of which 63 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 7 rules applied. Total rules applied 145 place count 63 transition count 81
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 150 place count 63 transition count 76
Renaming transitions due to excessive name length > 1024 char.
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 5 with 4 rules applied. Total rules applied 154 place count 61 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 158 place count 59 transition count 80
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 162 place count 59 transition count 76
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 170 place count 59 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 173 place count 56 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 55 transition count 67
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 179 place count 51 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 180 place count 50 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 180 place count 50 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 183 place count 48 transition count 65
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 184 place count 48 transition count 64
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 3 places and 0 transitions.
Iterating global reduction 10 with 5 rules applied. Total rules applied 189 place count 45 transition count 62
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 194 place count 45 transition count 57
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 196 place count 45 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 197 place count 44 transition count 55
Applied a total of 197 rules in 19 ms. Remains 44 /295 variables (removed 251) and now considering 55/549 (removed 494) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 44/295 places, 55/549 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 119 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=119 )
FORMULA DLCflexbar-PT-5b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 148379 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/608/inv_0_ --invariant=/tmp/608/inv_1_ --invariant=/tmp/608/inv_2_ --invariant=/tmp/608/inv_3_ --invariant=/tmp/608/inv_4_ --invariant=/tmp/608/inv_5_ --invariant=/tmp/608/inv_6_ --invariant=/tmp/608/inv_7_ --invariant=/tmp/608/inv_8_ --invariant=/tmp/608/inv_9_ --invariant=/tmp/608/inv_10_ --invariant=/tmp/608/inv_11_ --invariant=/tmp/608/inv_12_ --invariant=/tmp/608/inv_13_ --invariant=/tmp/608/inv_14_ --invariant=/tmp/608/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6130972 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094896 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 ReachabilityFireability -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="DLCflexbar-PT-5b"
export BK_EXAMINATION="ReachabilityFireability"
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 DLCflexbar-PT-5b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481400567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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