Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 489K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679309935251

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:58:57] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-20 10:58:57] [INFO ] Transformed 2003 places.
[2023-03-20 10:58:57] [INFO ] Transformed 2003 transitions.
[2023-03-20 10:58:57] [INFO ] Found NUPN structural information;
[2023-03-20 10:58:57] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 425 places :
Symmetric choice reduction at 0 with 425 rule applications. Total rules 425 place count 1578 transition count 1578
Iterating global reduction 0 with 425 rules applied. Total rules applied 850 place count 1578 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 851 place count 1577 transition count 1577
Iterating global reduction 0 with 1 rules applied. Total rules applied 852 place count 1577 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 853 place count 1576 transition count 1576
Iterating global reduction 0 with 1 rules applied. Total rules applied 854 place count 1576 transition count 1576
Applied a total of 854 rules in 624 ms. Remains 1576 /2003 variables (removed 427) and now considering 1576/2003 (removed 427) transitions.
// Phase 1: matrix 1576 rows 1576 cols
[2023-03-20 10:58:58] [INFO ] Computed 161 place invariants in 51 ms
[2023-03-20 10:58:58] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-20 10:58:58] [INFO ] Invariant cache hit.
[2023-03-20 10:58:59] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2023-03-20 10:58:59] [INFO ] Invariant cache hit.
[2023-03-20 10:59:00] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1576/2003 places, 1576/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2982 ms. Remains : 1576/2003 places, 1576/2003 transitions.
Support contains 35 out of 1576 places after structural reductions.
[2023-03-20 10:59:00] [INFO ] Flatten gal took : 111 ms
[2023-03-20 10:59:00] [INFO ] Flatten gal took : 66 ms
[2023-03-20 10:59:00] [INFO ] Input system was already deterministic with 1576 transitions.
Support contains 34 out of 1576 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=16 ) properties (out of 29) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2023-03-20 10:59:01] [INFO ] Invariant cache hit.
[2023-03-20 10:59:02] [INFO ] [Real]Absence check using 161 positive place invariants in 60 ms returned sat
[2023-03-20 10:59:02] [INFO ] After 734ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 10:59:03] [INFO ] [Nat]Absence check using 161 positive place invariants in 57 ms returned sat
[2023-03-20 10:59:04] [INFO ] After 1298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 10:59:04] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 14 ms to minimize.
[2023-03-20 10:59:05] [INFO ] Deduced a trap composed of 31 places in 270 ms of which 1 ms to minimize.
[2023-03-20 10:59:05] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-20 10:59:05] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2023-03-20 10:59:06] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 1 ms to minimize.
[2023-03-20 10:59:06] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2023-03-20 10:59:06] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2023-03-20 10:59:07] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 1 ms to minimize.
[2023-03-20 10:59:07] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 1 ms to minimize.
[2023-03-20 10:59:07] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
[2023-03-20 10:59:08] [INFO ] Deduced a trap composed of 54 places in 235 ms of which 1 ms to minimize.
[2023-03-20 10:59:08] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 1 ms to minimize.
[2023-03-20 10:59:08] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 1 ms to minimize.
[2023-03-20 10:59:08] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 1 ms to minimize.
[2023-03-20 10:59:09] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 1 ms to minimize.
[2023-03-20 10:59:09] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 1 ms to minimize.
[2023-03-20 10:59:09] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 1 ms to minimize.
[2023-03-20 10:59:09] [INFO ] Deduced a trap composed of 59 places in 232 ms of which 0 ms to minimize.
[2023-03-20 10:59:10] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 0 ms to minimize.
[2023-03-20 10:59:10] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5698 ms
[2023-03-20 10:59:10] [INFO ] Deduced a trap composed of 48 places in 207 ms of which 1 ms to minimize.
[2023-03-20 10:59:11] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 0 ms to minimize.
[2023-03-20 10:59:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2023-03-20 10:59:11] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2023-03-20 10:59:11] [INFO ] Deduced a trap composed of 30 places in 234 ms of which 2 ms to minimize.
[2023-03-20 10:59:12] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 1 ms to minimize.
[2023-03-20 10:59:12] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 0 ms to minimize.
[2023-03-20 10:59:12] [INFO ] Deduced a trap composed of 74 places in 223 ms of which 1 ms to minimize.
[2023-03-20 10:59:13] [INFO ] Deduced a trap composed of 56 places in 240 ms of which 1 ms to minimize.
[2023-03-20 10:59:13] [INFO ] Deduced a trap composed of 57 places in 243 ms of which 1 ms to minimize.
[2023-03-20 10:59:13] [INFO ] Deduced a trap composed of 65 places in 213 ms of which 1 ms to minimize.
[2023-03-20 10:59:13] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 1 ms to minimize.
[2023-03-20 10:59:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2743 ms
[2023-03-20 10:59:14] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 1 ms to minimize.
[2023-03-20 10:59:14] [INFO ] Deduced a trap composed of 49 places in 229 ms of which 1 ms to minimize.
[2023-03-20 10:59:15] [INFO ] Deduced a trap composed of 61 places in 217 ms of which 0 ms to minimize.
[2023-03-20 10:59:15] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 3 ms to minimize.
[2023-03-20 10:59:15] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 1 ms to minimize.
[2023-03-20 10:59:15] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 1 ms to minimize.
[2023-03-20 10:59:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1817 ms
[2023-03-20 10:59:16] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 1 ms to minimize.
[2023-03-20 10:59:16] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 1 ms to minimize.
[2023-03-20 10:59:17] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 0 ms to minimize.
[2023-03-20 10:59:17] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 0 ms to minimize.
[2023-03-20 10:59:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1168 ms
[2023-03-20 10:59:17] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 0 ms to minimize.
[2023-03-20 10:59:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2023-03-20 10:59:18] [INFO ] After 14757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 1046 ms.
[2023-03-20 10:59:19] [INFO ] After 16573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 928 ms.
Support contains 13 out of 1576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1576 transition count 1140
Reduce places removed 436 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 439 rules applied. Total rules applied 875 place count 1140 transition count 1137
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 878 place count 1137 transition count 1137
Performed 304 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 304 Pre rules applied. Total rules applied 878 place count 1137 transition count 833
Deduced a syphon composed of 304 places in 1 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 3 with 608 rules applied. Total rules applied 1486 place count 833 transition count 833
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1493 place count 826 transition count 826
Iterating global reduction 3 with 7 rules applied. Total rules applied 1500 place count 826 transition count 826
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1500 place count 826 transition count 820
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1512 place count 820 transition count 820
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Deduced a syphon composed of 363 places in 1 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 2238 place count 457 transition count 457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2239 place count 457 transition count 456
Renaming transitions due to excessive name length > 1024 char.
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 2241 place count 456 transition count 455
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2443 place count 355 transition count 550
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 2467 place count 343 transition count 562
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2468 place count 343 transition count 561
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2470 place count 343 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2472 place count 341 transition count 559
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2474 place count 341 transition count 557
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2475 place count 341 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2476 place count 340 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2477 place count 339 transition count 556
Applied a total of 2477 rules in 325 ms. Remains 339 /1576 variables (removed 1237) and now considering 556/1576 (removed 1020) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 339/1576 places, 556/1576 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 152022 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152022 steps, saw 102791 distinct states, run finished after 3002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 556 rows 339 cols
[2023-03-20 10:59:23] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-20 10:59:24] [INFO ] [Real]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-20 10:59:24] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 10:59:24] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2023-03-20 10:59:24] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 10:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:24] [INFO ] After 128ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 10:59:24] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-20 10:59:25] [INFO ] After 979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 92 ms.
Support contains 11 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 556/556 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 338 transition count 555
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 2 with 2 rules applied. Total rules applied 4 place count 337 transition count 554
Applied a total of 4 rules in 50 ms. Remains 337 /339 variables (removed 2) and now considering 554/556 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 337/339 places, 554/556 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 136227 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136227 steps, saw 91162 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 554 rows 337 cols
[2023-03-20 10:59:29] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-20 10:59:29] [INFO ] [Real]Absence check using 160 positive place invariants in 27 ms returned sat
[2023-03-20 10:59:29] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 10:59:29] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-20 10:59:29] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 10:59:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:29] [INFO ] After 95ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 10:59:29] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-20 10:59:29] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 71 ms.
Support contains 9 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 554/554 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 337 transition count 553
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 553
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 0 with 2 rules applied. Total rules applied 4 place count 335 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 334 transition count 554
Applied a total of 6 rules in 21 ms. Remains 334 /337 variables (removed 3) and now considering 554/554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 334/337 places, 554/554 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) 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 7) 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 7) 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 7) seen :0
Interrupted probabilistic random walk after 188308 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188308 steps, saw 126158 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 554 rows 334 cols
[2023-03-20 10:59:33] [INFO ] Computed 160 place invariants in 7 ms
[2023-03-20 10:59:33] [INFO ] [Real]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-20 10:59:33] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 10:59:33] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-20 10:59:33] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 10:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:34] [INFO ] After 87ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 10:59:34] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-20 10:59:34] [INFO ] After 747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 108 ms.
Support contains 5 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 554/554 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 334 transition count 552
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 332 transition count 552
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 0 with 4 rules applied. Total rules applied 8 place count 330 transition count 550
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 328 transition count 553
Applied a total of 12 rules in 21 ms. Remains 328 /334 variables (removed 6) and now considering 553/554 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 328/334 places, 553/554 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 5) 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 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 197345 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197345 steps, saw 133079 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 553 rows 328 cols
[2023-03-20 10:59:37] [INFO ] Computed 160 place invariants in 26 ms
[2023-03-20 10:59:38] [INFO ] [Real]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-20 10:59:38] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:59:38] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-20 10:59:38] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:59:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:38] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:59:38] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-20 10:59:38] [INFO ] After 517ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 5 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 553/553 transitions.
Applied a total of 0 rules in 7 ms. Remains 328 /328 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 328/328 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 553/553 transitions.
Applied a total of 0 rules in 8 ms. Remains 328 /328 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2023-03-20 10:59:38] [INFO ] Invariant cache hit.
[2023-03-20 10:59:39] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-20 10:59:39] [INFO ] Invariant cache hit.
[2023-03-20 10:59:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:39] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2023-03-20 10:59:39] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-20 10:59:39] [INFO ] Invariant cache hit.
[2023-03-20 10:59:40] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1118 ms. Remains : 328/328 places, 553/553 transitions.
Graph (trivial) has 152 edges and 328 vertex of which 4 / 328 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1111 edges and 326 vertex of which 324 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 149 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 320 transition count 544
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 148 edges and 318 vertex of which 6 / 318 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 315 transition count 535
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 146 edges and 312 vertex of which 8 / 312 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 308 transition count 524
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 142 edges and 304 vertex of which 8 / 304 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 300 transition count 510
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 138 edges and 296 vertex of which 8 / 296 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 292 transition count 496
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 134 edges and 288 vertex of which 8 / 288 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 284 transition count 482
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 130 edges and 280 vertex of which 8 / 280 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 276 transition count 468
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 126 edges and 272 vertex of which 8 / 272 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 268 transition count 454
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 122 edges and 264 vertex of which 8 / 264 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 260 transition count 440
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 256 vertex of which 8 / 256 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 252 transition count 426
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 248 vertex of which 8 / 248 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 244 transition count 412
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 236 transition count 398
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 106 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 228 transition count 384
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 102 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 220 transition count 370
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 98 edges and 216 vertex of which 8 / 216 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 212 transition count 356
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 94 edges and 208 vertex of which 8 / 208 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 204 transition count 342
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 90 edges and 200 vertex of which 6 / 200 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 299 place count 197 transition count 330
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 87 edges and 194 vertex of which 6 / 194 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 315 place count 191 transition count 318
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 85 edges and 188 vertex of which 6 / 188 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 330 place count 185 transition count 307
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 83 edges and 182 vertex of which 8 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 345 place count 178 transition count 296
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 566 edges and 174 vertex of which 168 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 76 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 21 rules applied. Total rules applied 366 place count 164 transition count 276
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 72 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 385 place count 156 transition count 262
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 68 edges and 152 vertex of which 8 / 152 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 404 place count 148 transition count 248
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 64 edges and 144 vertex of which 8 / 144 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 423 place count 140 transition count 234
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 60 edges and 136 vertex of which 8 / 136 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 442 place count 132 transition count 220
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 56 edges and 128 vertex of which 8 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 461 place count 124 transition count 206
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 52 edges and 120 vertex of which 6 / 120 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 480 place count 117 transition count 192
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 48 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 14 rules applied. Total rules applied 494 place count 112 transition count 182
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 45 edges and 110 vertex of which 2 / 110 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 28 with 9 rules applied. Total rules applied 503 place count 109 transition count 176
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 5 rules applied. Total rules applied 508 place count 108 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 508 place count 108 transition count 171
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 3 rules applied. Total rules applied 511 place count 106 transition count 171
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 30 with 3 rules applied. Total rules applied 514 place count 104 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 30 with 3 rules applied. Total rules applied 517 place count 104 transition count 167
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 31 with 2 rules applied. Total rules applied 519 place count 104 transition count 165
Applied a total of 519 rules in 73 ms. Remains 104 /328 variables (removed 224) and now considering 165/553 (removed 388) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 165 rows 104 cols
[2023-03-20 10:59:40] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-20 10:59:40] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-20 10:59:40] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-20 10:59:40] [INFO ] After 108ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:59:40] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:59:40] [INFO ] [Nat]Absence check using 48 positive place invariants in 6 ms returned sat
[2023-03-20 10:59:40] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:59:40] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 10:59:40] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 483 stabilizing places and 483 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))&&F(p2))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1564 transition count 1564
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1564 transition count 1564
Applied a total of 24 rules in 114 ms. Remains 1564 /1576 variables (removed 12) and now considering 1564/1576 (removed 12) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-20 10:59:41] [INFO ] Computed 161 place invariants in 13 ms
[2023-03-20 10:59:41] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-20 10:59:41] [INFO ] Invariant cache hit.
[2023-03-20 10:59:42] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2023-03-20 10:59:42] [INFO ] Invariant cache hit.
[2023-03-20 10:59:43] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1576 places, 1564/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2702 ms. Remains : 1564/1576 places, 1564/1576 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s215 1), p0:(OR (EQ s1213 1) (EQ s215 1)), p1:(EQ s1251 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-00 finished in 3183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||((p1 U p0)&&F((G(F(!p1))||(!p0&&F(!p1)))))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 167 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 10:59:44] [INFO ] Computed 161 place invariants in 13 ms
[2023-03-20 10:59:44] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-20 10:59:44] [INFO ] Invariant cache hit.
[2023-03-20 10:59:45] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2023-03-20 10:59:45] [INFO ] Invariant cache hit.
[2023-03-20 10:59:46] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2606 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s765 1), p1:(AND (EQ s1165 1) (EQ s1179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 20095 steps with 0 reset in 151 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-02 finished in 3082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(G(p2)))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1563 transition count 1563
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1563 transition count 1563
Applied a total of 26 rules in 107 ms. Remains 1563 /1576 variables (removed 13) and now considering 1563/1576 (removed 13) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-20 10:59:47] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-20 10:59:47] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-20 10:59:47] [INFO ] Invariant cache hit.
[2023-03-20 10:59:48] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2023-03-20 10:59:48] [INFO ] Invariant cache hit.
[2023-03-20 10:59:49] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1576 places, 1563/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 1563/1576 places, 1563/1576 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s1060 1), p0:(EQ s1397 1), p2:(NEQ s1186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 727 steps with 1 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-04 finished in 2731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p0))))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 111 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 10:59:50] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 10:59:50] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-20 10:59:50] [INFO ] Invariant cache hit.
[2023-03-20 10:59:51] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2023-03-20 10:59:51] [INFO ] Invariant cache hit.
[2023-03-20 10:59:52] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2396 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0, p0, true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 590 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-06 finished in 2508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X((p1&&G(p2))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 102 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 10:59:52] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-20 10:59:52] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-20 10:59:52] [INFO ] Invariant cache hit.
[2023-03-20 10:59:53] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2023-03-20 10:59:53] [INFO ] Invariant cache hit.
[2023-03-20 10:59:54] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2344 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1066 0), p1:(EQ s25 1), p2:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 2522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 125 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
[2023-03-20 10:59:55] [INFO ] Invariant cache hit.
[2023-03-20 10:59:55] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-20 10:59:55] [INFO ] Invariant cache hit.
[2023-03-20 10:59:56] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1517 ms to find 0 implicit places.
[2023-03-20 10:59:56] [INFO ] Invariant cache hit.
[2023-03-20 10:59:57] [INFO ] Dead Transitions using invariants and state equation in 1141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2788 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1541 1), p1:(EQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 3001 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1)&&p0) U X((F(p2)||(G(p1)&&p1)))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 158 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 10:59:58] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 10:59:58] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-20 10:59:58] [INFO ] Invariant cache hit.
[2023-03-20 10:59:59] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2023-03-20 10:59:59] [INFO ] Invariant cache hit.
[2023-03-20 11:00:00] [INFO ] Dead Transitions using invariants and state equation in 723 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(EQ s923 1), p1:(EQ s1501 1), p2:(EQ s313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 164 reset in 455 ms.
Product exploration explored 100000 steps with 163 reset in 451 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 653 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 11:00:02] [INFO ] Invariant cache hit.
[2023-03-20 11:00:02] [INFO ] [Real]Absence check using 161 positive place invariants in 46 ms returned sat
[2023-03-20 11:00:03] [INFO ] After 946ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:03] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2023-03-20 11:00:04] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:04] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2023-03-20 11:00:05] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 1 ms to minimize.
[2023-03-20 11:00:05] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 1 ms to minimize.
[2023-03-20 11:00:05] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 2 ms to minimize.
[2023-03-20 11:00:06] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 0 ms to minimize.
[2023-03-20 11:00:06] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 0 ms to minimize.
[2023-03-20 11:00:06] [INFO ] Deduced a trap composed of 33 places in 239 ms of which 0 ms to minimize.
[2023-03-20 11:00:06] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 1 ms to minimize.
[2023-03-20 11:00:07] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 3 ms to minimize.
[2023-03-20 11:00:07] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2023-03-20 11:00:07] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 0 ms to minimize.
[2023-03-20 11:00:07] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 2 ms to minimize.
[2023-03-20 11:00:08] [INFO ] Deduced a trap composed of 42 places in 254 ms of which 4 ms to minimize.
[2023-03-20 11:00:08] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 1 ms to minimize.
[2023-03-20 11:00:08] [INFO ] Deduced a trap composed of 52 places in 195 ms of which 0 ms to minimize.
[2023-03-20 11:00:09] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 0 ms to minimize.
[2023-03-20 11:00:09] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2023-03-20 11:00:09] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 0 ms to minimize.
[2023-03-20 11:00:09] [INFO ] Deduced a trap composed of 51 places in 185 ms of which 2 ms to minimize.
[2023-03-20 11:00:09] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 1 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 0 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 1 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 0 ms to minimize.
[2023-03-20 11:00:10] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 1 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 0 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 57 places in 178 ms of which 1 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 1 ms to minimize.
[2023-03-20 11:00:11] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 1 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 1 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 1 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 1 ms to minimize.
[2023-03-20 11:00:12] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8154 ms
[2023-03-20 11:00:12] [INFO ] After 8920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 11:00:12] [INFO ] After 9359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 74 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1562 transition count 1125
Reduce places removed 437 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1125 transition count 1123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 1123 transition count 1123
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 878 place count 1123 transition count 804
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1516 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2230 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
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 2233 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2435 place count 345 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2469 place count 328 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2470 place count 328 transition count 560
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2471 place count 328 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2472 place count 327 transition count 559
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 327 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2474 place count 326 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2475 place count 325 transition count 557
Applied a total of 2475 rules in 159 ms. Remains 325 /1562 variables (removed 1237) and now considering 557/1562 (removed 1005) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 325/1562 places, 557/1562 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294212 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294212 steps, saw 205004 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 325 cols
[2023-03-20 11:00:16] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 11:00:16] [INFO ] [Real]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-20 11:00:16] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:16] [INFO ] [Nat]Absence check using 160 positive place invariants in 28 ms returned sat
[2023-03-20 11:00:16] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 11:00:16] [INFO ] After 26ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:16] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 11:00:16] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 8 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 325/325 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 8 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-20 11:00:17] [INFO ] Invariant cache hit.
[2023-03-20 11:00:17] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-20 11:00:17] [INFO ] Invariant cache hit.
[2023-03-20 11:00:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 11:00:17] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-20 11:00:17] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-20 11:00:17] [INFO ] Invariant cache hit.
[2023-03-20 11:00:17] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 964 ms. Remains : 325/325 places, 557/557 transitions.
Graph (trivial) has 158 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1107 edges and 323 vertex of which 321 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 317 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 315 vertex of which 6 / 315 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 312 transition count 539
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 310 vertex of which 6 / 310 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 307 transition count 528
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 304 vertex of which 8 / 304 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 300 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1003 edges and 296 vertex of which 293 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 144 edges and 293 vertex of which 8 / 293 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 289 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 285 vertex of which 8 / 285 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 281 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 107 place count 273 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 269 vertex of which 8 / 269 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 126 place count 265 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 261 vertex of which 8 / 261 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 257 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 164 place count 249 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 245 vertex of which 8 / 245 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 183 place count 241 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 237 vertex of which 8 / 237 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 202 place count 233 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 221 place count 225 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 221 vertex of which 8 / 221 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 240 place count 217 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 213 vertex of which 8 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 259 place count 209 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 101 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 18 rules applied. Total rules applied 277 place count 201 transition count 347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 97 edges and 197 vertex of which 6 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 294 place count 194 transition count 335
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 191 vertex of which 6 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 310 place count 188 transition count 323
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 185 vertex of which 6 / 185 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 325 place count 182 transition count 312
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 340 place count 175 transition count 301
Discarding 160 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Remove reverse transitions (loop back) rule discarded transition t178.t175.t176 and 160 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 351 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 351 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 357 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 2 rules applied. Total rules applied 359 place count 6 transition count 8
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 361 place count 6 transition count 6
Applied a total of 361 rules in 33 ms. Remains 6 /325 variables (removed 319) and now considering 6/557 (removed 551) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-20 11:00:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 11:00:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-20 11:00:18] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-20 11:00:18] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:18] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-20 11:00:18] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:18] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 11:00:18] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 647 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:00:19] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 11:00:19] [INFO ] [Real]Absence check using 161 positive place invariants in 118 ms returned sat
[2023-03-20 11:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:00:23] [INFO ] [Real]Absence check using state equation in 3692 ms returned sat
[2023-03-20 11:00:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:00:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 110 ms returned sat
[2023-03-20 11:00:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:00:28] [INFO ] [Nat]Absence check using state equation in 4283 ms returned sat
[2023-03-20 11:00:28] [INFO ] Computed and/alt/rep : 1561/2283/1561 causal constraints (skipped 0 transitions) in 102 ms.
[2023-03-20 11:00:38] [INFO ] Added : 470 causal constraints over 94 iterations in 10061 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 67 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-20 11:00:38] [INFO ] Invariant cache hit.
[2023-03-20 11:00:39] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-20 11:00:39] [INFO ] Invariant cache hit.
[2023-03-20 11:00:40] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-03-20 11:00:40] [INFO ] Invariant cache hit.
[2023-03-20 11:00:40] [INFO ] Dead Transitions using invariants and state equation in 773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2453 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 376 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 11:00:41] [INFO ] Invariant cache hit.
[2023-03-20 11:00:41] [INFO ] [Real]Absence check using 161 positive place invariants in 44 ms returned sat
[2023-03-20 11:00:42] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 44 ms returned sat
[2023-03-20 11:00:43] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 26 places in 287 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 0 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 1 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 1 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 0 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 42 places in 189 ms of which 1 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 0 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 52 places in 206 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 1 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 1 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 0 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 0 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 0 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8651 ms
[2023-03-20 11:00:52] [INFO ] After 9369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-20 11:00:52] [INFO ] After 9739ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 82 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1562 transition count 1125
Reduce places removed 437 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1125 transition count 1123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 1123 transition count 1123
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 878 place count 1123 transition count 804
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1516 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2230 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
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 2233 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2435 place count 345 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2469 place count 328 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2470 place count 328 transition count 560
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2471 place count 328 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2472 place count 327 transition count 559
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 327 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2474 place count 326 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2475 place count 325 transition count 557
Applied a total of 2475 rules in 258 ms. Remains 325 /1562 variables (removed 1237) and now considering 557/1562 (removed 1005) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 325/1562 places, 557/1562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 2) 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 2) 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 2) seen :0
Interrupted probabilistic random walk after 269522 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269522 steps, saw 186003 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 325 cols
[2023-03-20 11:00:55] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 11:00:56] [INFO ] [Real]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-20 11:00:56] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 11:00:56] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-20 11:00:56] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 11:00:56] [INFO ] After 24ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 11:00:56] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-20 11:00:56] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 35 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-20 11:00:56] [INFO ] Invariant cache hit.
[2023-03-20 11:00:56] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-20 11:00:56] [INFO ] Invariant cache hit.
[2023-03-20 11:00:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 11:00:56] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-20 11:00:57] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 11:00:57] [INFO ] Invariant cache hit.
[2023-03-20 11:00:57] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 777 ms. Remains : 325/325 places, 557/557 transitions.
Graph (trivial) has 158 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1107 edges and 323 vertex of which 321 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 317 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 315 vertex of which 6 / 315 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 312 transition count 539
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 310 vertex of which 6 / 310 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 307 transition count 528
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 304 vertex of which 8 / 304 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 300 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1003 edges and 296 vertex of which 293 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 144 edges and 293 vertex of which 8 / 293 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 289 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 285 vertex of which 8 / 285 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 281 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 107 place count 273 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 269 vertex of which 8 / 269 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 126 place count 265 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 261 vertex of which 8 / 261 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 257 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 164 place count 249 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 245 vertex of which 8 / 245 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 183 place count 241 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 237 vertex of which 8 / 237 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 202 place count 233 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 221 place count 225 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 221 vertex of which 8 / 221 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 240 place count 217 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 213 vertex of which 8 / 213 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 259 place count 209 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 101 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 18 rules applied. Total rules applied 277 place count 201 transition count 347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 97 edges and 197 vertex of which 6 / 197 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 294 place count 194 transition count 335
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 191 vertex of which 6 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 310 place count 188 transition count 323
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 185 vertex of which 6 / 185 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 325 place count 182 transition count 312
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 340 place count 175 transition count 301
Discarding 160 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Remove reverse transitions (loop back) rule discarded transition t178.t175.t176 and 160 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 351 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 351 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 357 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 2 rules applied. Total rules applied 359 place count 6 transition count 8
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 361 place count 6 transition count 6
Applied a total of 361 rules in 38 ms. Remains 6 /325 variables (removed 319) and now considering 6/557 (removed 551) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-20 11:00:57] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 11:00:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-20 11:00:57] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:00:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-20 11:00:57] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:00:57] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 11:00:57] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F p2), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 512 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:00:58] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 11:00:58] [INFO ] [Real]Absence check using 161 positive place invariants in 107 ms returned sat
[2023-03-20 11:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:02] [INFO ] [Real]Absence check using state equation in 3768 ms returned sat
[2023-03-20 11:01:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:01:03] [INFO ] [Nat]Absence check using 161 positive place invariants in 112 ms returned sat
[2023-03-20 11:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:01:07] [INFO ] [Nat]Absence check using state equation in 4058 ms returned sat
[2023-03-20 11:01:07] [INFO ] Computed and/alt/rep : 1561/2283/1561 causal constraints (skipped 0 transitions) in 96 ms.
[2023-03-20 11:01:18] [INFO ] Deduced a trap composed of 14 places in 609 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 11:01:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 165 reset in 422 ms.
Product exploration explored 100000 steps with 163 reset in 444 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 439 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1562 transition count 1562
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 439 place count 1562 transition count 1722
Deduced a syphon composed of 599 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 599 place count 1562 transition count 1722
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1075 places in 2 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1075 place count 1562 transition count 1722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1076 place count 1562 transition count 1721
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1394 place count 1244 transition count 1403
Deduced a syphon composed of 757 places in 2 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 1712 place count 1244 transition count 1403
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1713 place count 1244 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1715 place count 1242 transition count 1401
Deduced a syphon composed of 756 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1717 place count 1242 transition count 1401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 857 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1818 place count 1242 transition count 2126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1919 place count 1141 transition count 1924
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2020 place count 1141 transition count 1924
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -413
Deduced a syphon composed of 813 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2077 place count 1141 transition count 2337
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2134 place count 1084 transition count 2223
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2191 place count 1084 transition count 2223
Deduced a syphon composed of 756 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2194 place count 1084 transition count 2220
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2194 rules in 1097 ms. Remains 1084 /1562 variables (removed 478) and now considering 2220/1562 (removed -658) transitions.
[2023-03-20 11:01:21] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 2220 rows 1084 cols
[2023-03-20 11:01:21] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-20 11:01:22] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/1562 places, 2220/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2237 ms. Remains : 1084/1562 places, 2220/1562 transitions.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 55 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:01:22] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 11:01:22] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-20 11:01:22] [INFO ] Invariant cache hit.
[2023-03-20 11:01:23] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1547 ms to find 0 implicit places.
[2023-03-20 11:01:23] [INFO ] Invariant cache hit.
[2023-03-20 11:01:24] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 86874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1575 transition count 1130
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 1130 transition count 1130
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 890 place count 1130 transition count 822
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 1506 place count 822 transition count 822
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1517 place count 811 transition count 811
Iterating global reduction 2 with 11 rules applied. Total rules applied 1528 place count 811 transition count 811
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1528 place count 811 transition count 801
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1548 place count 801 transition count 801
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2262 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 444 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2265 place count 443 transition count 442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2467 place count 342 transition count 542
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2501 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2503 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2504 place count 322 transition count 556
Applied a total of 2504 rules in 310 ms. Remains 322 /1576 variables (removed 1254) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 322 cols
[2023-03-20 11:01:25] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 11:01:25] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-20 11:01:25] [INFO ] Invariant cache hit.
[2023-03-20 11:01:25] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-20 11:01:25] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 11:01:25] [INFO ] Invariant cache hit.
[2023-03-20 11:01:26] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1576 places, 556/1576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1319 ms. Remains : 322/1576 places, 556/1576 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-10 finished in 1372 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 174 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:01:26] [INFO ] Computed 161 place invariants in 10 ms
[2023-03-20 11:01:26] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-20 11:01:26] [INFO ] Invariant cache hit.
[2023-03-20 11:01:27] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2023-03-20 11:01:27] [INFO ] Invariant cache hit.
[2023-03-20 11:01:28] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2464 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s753 0), p0:(OR (EQ s1545 1) (EQ s725 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 482 ms.
Product exploration explored 100000 steps with 1 reset in 811 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 328 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 189138 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189138 steps, saw 95179 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:01:33] [INFO ] Invariant cache hit.
[2023-03-20 11:01:33] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:01:34] [INFO ] [Nat]Absence check using 161 positive place invariants in 58 ms returned sat
[2023-03-20 11:01:35] [INFO ] After 793ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:01:35] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2023-03-20 11:01:35] [INFO ] Deduced a trap composed of 21 places in 301 ms of which 1 ms to minimize.
[2023-03-20 11:01:36] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 1 ms to minimize.
[2023-03-20 11:01:36] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 1 ms to minimize.
[2023-03-20 11:01:36] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 1 ms to minimize.
[2023-03-20 11:01:37] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 0 ms to minimize.
[2023-03-20 11:01:37] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 0 ms to minimize.
[2023-03-20 11:01:37] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 0 ms to minimize.
[2023-03-20 11:01:38] [INFO ] Deduced a trap composed of 21 places in 216 ms of which 0 ms to minimize.
[2023-03-20 11:01:38] [INFO ] Deduced a trap composed of 33 places in 210 ms of which 1 ms to minimize.
[2023-03-20 11:01:38] [INFO ] Deduced a trap composed of 48 places in 241 ms of which 1 ms to minimize.
[2023-03-20 11:01:38] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 1 ms to minimize.
[2023-03-20 11:01:39] [INFO ] Deduced a trap composed of 32 places in 221 ms of which 1 ms to minimize.
[2023-03-20 11:01:39] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2023-03-20 11:01:39] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 1 ms to minimize.
[2023-03-20 11:01:40] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 1 ms to minimize.
[2023-03-20 11:01:40] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 1 ms to minimize.
[2023-03-20 11:01:40] [INFO ] Deduced a trap composed of 38 places in 247 ms of which 1 ms to minimize.
[2023-03-20 11:01:40] [INFO ] Deduced a trap composed of 45 places in 213 ms of which 1 ms to minimize.
[2023-03-20 11:01:41] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 1 ms to minimize.
[2023-03-20 11:01:41] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 1 ms to minimize.
[2023-03-20 11:01:41] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 6365 ms
[2023-03-20 11:01:41] [INFO ] After 7471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-20 11:01:42] [INFO ] After 8046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 97 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
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 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 256 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-20 11:01:42] [INFO ] Computed 160 place invariants in 8 ms
[2023-03-20 11:01:42] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 11:01:42] [INFO ] [Nat]Absence check using 160 positive place invariants in 24 ms returned sat
[2023-03-20 11:01:42] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 11:01:42] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 11:01:43] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 287611 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287611 steps, saw 189452 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 11:01:46] [INFO ] Invariant cache hit.
[2023-03-20 11:01:46] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 11:01:46] [INFO ] [Nat]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-20 11:01:46] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 11:01:46] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-20 11:01:46] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-20 11:01:46] [INFO ] Invariant cache hit.
[2023-03-20 11:01:46] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-20 11:01:46] [INFO ] Invariant cache hit.
[2023-03-20 11:01:47] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-20 11:01:47] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 11:01:47] [INFO ] Invariant cache hit.
[2023-03-20 11:01:47] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 837 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 21 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-20 11:01:47] [INFO ] Computed 157 place invariants in 1 ms
[2023-03-20 11:01:47] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 11:01:47] [INFO ] [Nat]Absence check using 157 positive place invariants in 27 ms returned sat
[2023-03-20 11:01:48] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 11:01:48] [INFO ] After 283ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-20 11:01:48] [INFO ] After 593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 325 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 55 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:01:48] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-20 11:01:49] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-20 11:01:49] [INFO ] Invariant cache hit.
[2023-03-20 11:01:50] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2023-03-20 11:01:50] [INFO ] Invariant cache hit.
[2023-03-20 11:01:50] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2087 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 333 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 177789 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 177789 steps, saw 90577 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:01:54] [INFO ] Invariant cache hit.
[2023-03-20 11:01:54] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:01:55] [INFO ] [Nat]Absence check using 161 positive place invariants in 44 ms returned sat
[2023-03-20 11:01:55] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:01:56] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-20 11:01:56] [INFO ] Deduced a trap composed of 21 places in 252 ms of which 1 ms to minimize.
[2023-03-20 11:01:56] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-20 11:01:57] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-20 11:01:57] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 1 ms to minimize.
[2023-03-20 11:01:57] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 0 ms to minimize.
[2023-03-20 11:01:57] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2023-03-20 11:01:58] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 1 ms to minimize.
[2023-03-20 11:01:58] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 1 ms to minimize.
[2023-03-20 11:01:58] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2023-03-20 11:01:59] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 1 ms to minimize.
[2023-03-20 11:01:59] [INFO ] Deduced a trap composed of 36 places in 201 ms of which 0 ms to minimize.
[2023-03-20 11:01:59] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2023-03-20 11:01:59] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 1 ms to minimize.
[2023-03-20 11:01:59] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 0 ms to minimize.
[2023-03-20 11:02:00] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 1 ms to minimize.
[2023-03-20 11:02:00] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 0 ms to minimize.
[2023-03-20 11:02:00] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2023-03-20 11:02:00] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2023-03-20 11:02:01] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 1 ms to minimize.
[2023-03-20 11:02:01] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 1 ms to minimize.
[2023-03-20 11:02:01] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5515 ms
[2023-03-20 11:02:01] [INFO ] After 6464ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-20 11:02:01] [INFO ] After 6979ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
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 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 114 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 208947 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208947 steps, saw 139507 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-20 11:02:05] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 11:02:05] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 11:02:05] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-20 11:02:05] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 11:02:05] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-20 11:02:05] [INFO ] After 375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 83 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-20 11:02:05] [INFO ] Invariant cache hit.
[2023-03-20 11:02:06] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-20 11:02:06] [INFO ] Invariant cache hit.
[2023-03-20 11:02:06] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-20 11:02:06] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 11:02:06] [INFO ] Invariant cache hit.
[2023-03-20 11:02:06] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 23 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-20 11:02:06] [INFO ] Computed 157 place invariants in 2 ms
[2023-03-20 11:02:06] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 11:02:06] [INFO ] [Nat]Absence check using 157 positive place invariants in 18 ms returned sat
[2023-03-20 11:02:07] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 11:02:07] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-20 11:02:07] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 382 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 560 ms.
Entered a terminal (fully accepting) state of product in 64615 steps with 1 reset in 424 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 42795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(p1)))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 106 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 11:02:09] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-20 11:02:09] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-20 11:02:09] [INFO ] Invariant cache hit.
[2023-03-20 11:02:10] [INFO ] Implicit Places using invariants and state equation in 1027 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2023-03-20 11:02:10] [INFO ] Invariant cache hit.
[2023-03-20 11:02:11] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2354 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(NEQ s1028 1), p1:(EQ s344 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 26959 steps with 0 reset in 197 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 2718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&X(p2)&&p0)))'
Support contains 4 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1563 transition count 1563
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1563 transition count 1563
Applied a total of 26 rules in 130 ms. Remains 1563 /1576 variables (removed 13) and now considering 1563/1576 (removed 13) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-20 11:02:11] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-20 11:02:12] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-20 11:02:12] [INFO ] Invariant cache hit.
[2023-03-20 11:02:13] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1417 ms to find 0 implicit places.
[2023-03-20 11:02:13] [INFO ] Invariant cache hit.
[2023-03-20 11:02:14] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1576 places, 1563/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2291 ms. Remains : 1563/1576 places, 1563/1576 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(AND (EQ s962 1) (EQ s488 1)), p1:(AND (EQ s962 0) (EQ s1077 1)), p2:(EQ s137 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 2535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 128 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-20 11:02:14] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-20 11:02:14] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-20 11:02:14] [INFO ] Invariant cache hit.
[2023-03-20 11:02:15] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
[2023-03-20 11:02:15] [INFO ] Invariant cache hit.
[2023-03-20 11:02:16] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2283 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s1501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 132 reset in 375 ms.
Stack based approach found an accepted trace after 1584 steps with 2 reset with depth 867 and stack size 867 in 7 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 2814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(G((p2 U p1))))))'
Support contains 5 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 1575 transition count 1132
Reduce places removed 443 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 444 rules applied. Total rules applied 887 place count 1132 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 888 place count 1131 transition count 1131
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 306 Pre rules applied. Total rules applied 888 place count 1131 transition count 825
Deduced a syphon composed of 306 places in 1 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 612 rules applied. Total rules applied 1500 place count 825 transition count 825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1510 place count 815 transition count 815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1520 place count 815 transition count 815
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1520 place count 815 transition count 806
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1538 place count 806 transition count 806
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2254 place count 448 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 448 transition count 447
Renaming transitions due to excessive name length > 1024 char.
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 2257 place count 447 transition count 446
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 346 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2493 place count 329 transition count 562
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2495 place count 327 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2496 place count 326 transition count 560
Applied a total of 2496 rules in 165 ms. Remains 326 /1576 variables (removed 1250) and now considering 560/1576 (removed 1016) transitions.
// Phase 1: matrix 560 rows 326 cols
[2023-03-20 11:02:17] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 11:02:17] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-20 11:02:17] [INFO ] Invariant cache hit.
[2023-03-20 11:02:17] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-20 11:02:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 11:02:17] [INFO ] Invariant cache hit.
[2023-03-20 11:02:18] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1576 places, 560/1576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 969 ms. Remains : 326/1576 places, 560/1576 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s228 1), p0:(AND (EQ s255 1) (EQ s257 1) (EQ s261 1)), p2:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1)&&p0) U X((F(p2)||(G(p1)&&p1)))))'
[2023-03-20 11:02:18] [INFO ] Flatten gal took : 50 ms
[2023-03-20 11:02:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 11:02:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1576 places, 1576 transitions and 3872 arcs took 9 ms.
Total runtime 201488 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2207/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-040B-LTLFireability-09

BK_STOP 1679310139371

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-040B-LTLFireability-09
ltl formula formula --ltl=/tmp/2207/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1576 places, 1576 transitions and 3872 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.300 real 0.040 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2207/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2207/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2207/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2207/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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