Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789800638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r373-tall-171683789800638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K May 18 16:43 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 1717015573247

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:46:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:46:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:46:15] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-05-29 20:46:15] [INFO ] Transformed 2003 places.
[2024-05-29 20:46:15] [INFO ] Transformed 2003 transitions.
[2024-05-29 20:46:15] [INFO ] Found NUPN structural information;
[2024-05-29 20:46:15] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 1576 transition count 1576
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 1576 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 1575 transition count 1575
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Applied a total of 858 rules in 641 ms. Remains 1574 /2003 variables (removed 429) and now considering 1574/2003 (removed 429) transitions.
// Phase 1: matrix 1574 rows 1574 cols
[2024-05-29 20:46:16] [INFO ] Computed 161 invariants in 33 ms
[2024-05-29 20:46:16] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-29 20:46:16] [INFO ] Invariant cache hit.
[2024-05-29 20:46:18] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2024-05-29 20:46:18] [INFO ] Invariant cache hit.
[2024-05-29 20:46:19] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1574/2003 places, 1574/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 1574/2003 places, 1574/2003 transitions.
Support contains 28 out of 1574 places after structural reductions.
[2024-05-29 20:46:19] [INFO ] Flatten gal took : 134 ms
[2024-05-29 20:46:19] [INFO ] Flatten gal took : 72 ms
[2024-05-29 20:46:19] [INFO ] Input system was already deterministic with 1574 transitions.
Support contains 27 out of 1574 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=19 ) properties (out of 24) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-29 20:46:20] [INFO ] Invariant cache hit.
[2024-05-29 20:46:20] [INFO ] [Real]Absence check using 161 positive place invariants in 67 ms returned sat
[2024-05-29 20:46:21] [INFO ] After 962ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:14
[2024-05-29 20:46:21] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2024-05-29 20:46:23] [INFO ] After 1505ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-05-29 20:46:24] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 14 ms to minimize.
[2024-05-29 20:46:24] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 2 ms to minimize.
[2024-05-29 20:46:24] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 8 ms to minimize.
[2024-05-29 20:46:25] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2024-05-29 20:46:25] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 2 ms to minimize.
[2024-05-29 20:46:25] [INFO ] Deduced a trap composed of 28 places in 250 ms of which 3 ms to minimize.
[2024-05-29 20:46:25] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:46:26] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 0 ms to minimize.
[2024-05-29 20:46:26] [INFO ] Deduced a trap composed of 40 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:46:26] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:46:27] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:46:27] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:46:27] [INFO ] Deduced a trap composed of 56 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:46:27] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:46:27] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:46:28] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 0 ms to minimize.
[2024-05-29 20:46:28] [INFO ] Deduced a trap composed of 61 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:46:28] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:46:28] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:46:29] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:46:29] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5408 ms
[2024-05-29 20:46:29] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:46:29] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 0 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Deduced a trap composed of 39 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:46:30] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1589 ms
[2024-05-29 20:46:31] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:46:31] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:46:31] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:46:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 657 ms
[2024-05-29 20:46:31] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:46:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-29 20:46:32] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:46:32] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:46:32] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 4 ms to minimize.
[2024-05-29 20:46:33] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:46:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 960 ms
[2024-05-29 20:46:33] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-29 20:46:33] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:46:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-29 20:46:34] [INFO ] Deduced a trap composed of 33 places in 173 ms of which 0 ms to minimize.
[2024-05-29 20:46:34] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 0 ms to minimize.
[2024-05-29 20:46:34] [INFO ] Deduced a trap composed of 35 places in 163 ms of which 1 ms to minimize.
[2024-05-29 20:46:34] [INFO ] Deduced a trap composed of 34 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:46:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 912 ms
[2024-05-29 20:46:35] [INFO ] After 12925ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 1062 ms.
[2024-05-29 20:46:36] [INFO ] After 14965ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 523 ms.
Support contains 17 out of 1574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Drop transitions removed 421 transitions
Trivial Post-agglo rules discarded 421 transitions
Performed 421 trivial Post agglomeration. Transition count delta: 421
Iterating post reduction 0 with 421 rules applied. Total rules applied 421 place count 1574 transition count 1153
Reduce places removed 421 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 427 rules applied. Total rules applied 848 place count 1153 transition count 1147
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 854 place count 1147 transition count 1147
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 854 place count 1147 transition count 837
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1474 place count 837 transition count 837
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1479 place count 832 transition count 832
Iterating global reduction 3 with 5 rules applied. Total rules applied 1484 place count 832 transition count 832
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1484 place count 832 transition count 828
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1492 place count 828 transition count 828
Performed 367 Post agglomeration using F-continuation condition.Transition count delta: 367
Deduced a syphon composed of 367 places in 1 ms
Reduce places removed 367 places and 0 transitions.
Iterating global reduction 3 with 734 rules applied. Total rules applied 2226 place count 461 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2227 place count 461 transition count 460
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2229 place count 460 transition count 459
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -91
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 2431 place count 359 transition count 550
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 2449 place count 350 transition count 558
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2450 place count 350 transition count 557
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 2453 place count 350 transition count 554
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2456 place count 347 transition count 554
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 2459 place count 347 transition count 551
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2460 place count 346 transition count 550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2461 place count 345 transition count 550
Applied a total of 2461 rules in 440 ms. Remains 345 /1574 variables (removed 1229) and now considering 550/1574 (removed 1024) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 345/1574 places, 550/1574 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 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 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :1
Running SMT prover for 10 properties.
// Phase 1: matrix 550 rows 345 cols
[2024-05-29 20:46:38] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:46:38] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:46:38] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 20:46:38] [INFO ] [Nat]Absence check using 160 positive place invariants in 28 ms returned sat
[2024-05-29 20:46:38] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 20:46:39] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 164 ms.
[2024-05-29 20:46:39] [INFO ] After 936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 2 properties in 259 ms.
Support contains 10 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 550/550 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 345 transition count 548
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 343 transition count 548
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 343 transition count 545
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 340 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 339 transition count 544
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 335 transition count 550
Applied a total of 20 rules in 37 ms. Remains 335 /345 variables (removed 10) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 335/345 places, 550/550 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 227029 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :{}
Probabilistic random walk after 227029 steps, saw 161722 distinct states, run finished after 3003 ms. (steps per millisecond=75 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 550 rows 335 cols
[2024-05-29 20:46:43] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:46:43] [INFO ] [Real]Absence check using 160 positive place invariants in 28 ms returned sat
[2024-05-29 20:46:43] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:46:43] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2024-05-29 20:46:43] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:46:44] [INFO ] After 452ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 133 ms.
[2024-05-29 20:46:44] [INFO ] After 736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 102 ms.
Support contains 10 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 10 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 335/335 places, 550/550 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 550/550 transitions.
Applied a total of 0 rules in 10 ms. Remains 335 /335 variables (removed 0) and now considering 550/550 (removed 0) transitions.
[2024-05-29 20:46:44] [INFO ] Invariant cache hit.
[2024-05-29 20:46:44] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-29 20:46:44] [INFO ] Invariant cache hit.
[2024-05-29 20:46:44] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2024-05-29 20:46:45] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-29 20:46:45] [INFO ] Invariant cache hit.
[2024-05-29 20:46:45] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 899 ms. Remains : 335/335 places, 550/550 transitions.
Graph (trivial) has 143 edges and 335 vertex of which 4 / 335 are part of one of the 2 SCC in 2 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 332 transition count 543
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 332 transition count 542
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 330 transition count 542
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 328 transition count 541
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 328 transition count 537
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 328 transition count 531
Applied a total of 19 rules in 32 ms. Remains 328 /335 variables (removed 7) and now considering 531/550 (removed 19) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 531 rows 328 cols
[2024-05-29 20:46:45] [INFO ] Computed 157 invariants in 1 ms
[2024-05-29 20:46:45] [INFO ] [Real]Absence check using 157 positive place invariants in 19 ms returned sat
[2024-05-29 20:46:45] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 20:46:45] [INFO ] [Nat]Absence check using 157 positive place invariants in 22 ms returned sat
[2024-05-29 20:46:45] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 20:46:46] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-29 20:46:46] [INFO ] After 718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 479 stabilizing places and 479 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(p1))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1573 transition count 1139
Reduce places removed 434 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 436 rules applied. Total rules applied 870 place count 1139 transition count 1137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 872 place count 1137 transition count 1137
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 872 place count 1137 transition count 824
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1498 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 3 with 10 rules applied. Total rules applied 1518 place count 814 transition count 814
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1518 place count 814 transition count 805
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 1536 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2254 place count 446 transition count 446
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 446 transition count 445
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 445 transition count 444
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 344 transition count 544
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 327 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2495 place count 325 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2496 place count 324 transition count 558
Applied a total of 2496 rules in 163 ms. Remains 324 /1574 variables (removed 1250) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-29 20:46:46] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:46:47] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-29 20:46:47] [INFO ] Invariant cache hit.
[2024-05-29 20:46:47] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
[2024-05-29 20:46:47] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-29 20:46:47] [INFO ] Invariant cache hit.
[2024-05-29 20:46:47] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1214 ms. Remains : 324/1574 places, 558/1574 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 233 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s192 1), p0:(AND (EQ s192 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 30 reset in 598 ms.
Product exploration explored 100000 steps with 32 reset in 620 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 152 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[p0, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 210 ms. (steps per millisecond=47 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 281237 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{2=1}
Probabilistic random walk after 281237 steps, saw 195664 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :1
Running SMT prover for 2 properties.
[2024-05-29 20:46:52] [INFO ] Invariant cache hit.
[2024-05-29 20:46:52] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:46:53] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:46:53] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-29 20:46:53] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:46:53] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-29 20:46:53] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 558/558 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 557
Applied a total of 1 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 557/558 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 324/324 places, 557/558 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 253816 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253816 steps, saw 177772 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 324 cols
[2024-05-29 20:46:56] [INFO ] Computed 160 invariants in 7 ms
[2024-05-29 20:46:56] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-29 20:46:56] [INFO ] After 166ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 20:46:56] [INFO ] After 226ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-29 20:46:56] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 324/324 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-29 20:46:57] [INFO ] Invariant cache hit.
[2024-05-29 20:46:57] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-29 20:46:57] [INFO ] Invariant cache hit.
[2024-05-29 20:46:57] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-29 20:46:57] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:46:57] [INFO ] Invariant cache hit.
[2024-05-29 20:46:57] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 895 ms. Remains : 324/324 places, 557/557 transitions.
Graph (trivial) has 158 edges and 324 vertex of which 4 / 324 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 1105 edges and 322 vertex of which 320 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 318 vertex of which 4 / 318 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 316 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 314 vertex of which 6 / 314 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 311 transition count 539
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 152 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 528
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 148 edges and 300 vertex of which 8 / 300 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 296 transition count 514
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 144 edges and 292 vertex of which 8 / 292 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 288 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 284 vertex of which 8 / 284 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 280 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 276 vertex of which 8 / 276 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 272 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 268 vertex of which 8 / 268 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 264 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 260 vertex of which 8 / 260 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 256 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 252 vertex of which 8 / 252 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 248 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 244 vertex of which 8 / 244 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 240 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 236 vertex of which 8 / 236 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 232 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 228 vertex of which 8 / 228 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 224 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 220 vertex of which 8 / 220 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 216 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 212 vertex of which 8 / 212 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 208 transition count 360
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 100 edges and 204 vertex of which 6 / 204 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 201 transition count 346
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 97 edges and 198 vertex of which 6 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 14 rules applied. Total rules applied 296 place count 195 transition count 336
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 192 vertex of which 6 / 192 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 312 place count 189 transition count 324
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 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 327 place count 182 transition count 313
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 (trivial) has 89 edges and 178 vertex of which 10 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 20 rules applied. Total rules applied 347 place count 173 transition count 298
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 83 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 25 rules applied. Total rules applied 372 place count 164 transition count 279
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 78 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 21 rules applied. Total rules applied 393 place count 155 transition count 264
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 74 edges and 151 vertex of which 8 / 151 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 412 place count 147 transition count 250
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 70 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 139 transition count 236
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 66 edges and 135 vertex of which 8 / 135 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 450 place count 131 transition count 222
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 62 edges and 127 vertex of which 8 / 127 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 469 place count 123 transition count 208
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 58 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 115 transition count 194
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 54 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 107 transition count 180
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 50 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 99 transition count 166
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 46 edges and 95 vertex of which 8 / 95 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 91 transition count 152
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 42 edges and 87 vertex of which 8 / 87 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 83 transition count 138
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 38 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 17 rules applied. Total rules applied 581 place count 76 transition count 126
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 35 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 32 with 17 rules applied. Total rules applied 598 place count 70 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 32 edges and 66 vertex of which 6 / 66 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 33 with 17 rules applied. Total rules applied 615 place count 63 transition count 101
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 30 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 15 rules applied. Total rules applied 630 place count 56 transition count 90
Discarding 40 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Remove reverse transitions (loop back) rule discarded transition t45.t42.t43 and 40 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 35 with 11 rules applied. Total rules applied 641 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 641 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 36 with 9 rules applied. Total rules applied 650 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 651 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 651 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 655 place count 4 transition count 4
Applied a total of 655 rules in 65 ms. Remains 4 /324 variables (removed 320) and now considering 4/557 (removed 553) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-29 20:46:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 20:46:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 20:46:58] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 20:46:58] [INFO ] After 7ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 20:46:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:46:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-29 20:46:58] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:46:58] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 20:46:58] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 109 ms :[p0, (AND (NOT p1) p0), p0]
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 558/558 transitions.
Applied a total of 0 rules in 24 ms. Remains 324 /324 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-29 20:46:58] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:46:58] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-29 20:46:58] [INFO ] Invariant cache hit.
[2024-05-29 20:46:59] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-29 20:46:59] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:46:59] [INFO ] Invariant cache hit.
[2024-05-29 20:46:59] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 850 ms. Remains : 324/324 places, 558/558 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[p0, (AND (NOT p1) p0), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 20:46:59] [INFO ] Invariant cache hit.
[2024-05-29 20:46:59] [INFO ] [Real]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-29 20:47:00] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:47:00] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:47:00] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:47:00] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 20:47:00] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 558/558 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 557
Applied a total of 1 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 557/558 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 324/324 places, 557/558 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 169 ms. (steps per millisecond=59 ) 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 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 316708 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316708 steps, saw 223965 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 324 cols
[2024-05-29 20:47:03] [INFO ] Computed 160 invariants in 4 ms
[2024-05-29 20:47:03] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:47:03] [INFO ] After 188ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 20:47:04] [INFO ] After 242ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-29 20:47:04] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 324/324 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-29 20:47:04] [INFO ] Invariant cache hit.
[2024-05-29 20:47:04] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-29 20:47:04] [INFO ] Invariant cache hit.
[2024-05-29 20:47:04] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-05-29 20:47:04] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:47:04] [INFO ] Invariant cache hit.
[2024-05-29 20:47:04] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 856 ms. Remains : 324/324 places, 557/557 transitions.
Graph (trivial) has 158 edges and 324 vertex of which 4 / 324 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 1105 edges and 322 vertex of which 320 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 318 vertex of which 4 / 318 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 316 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 314 vertex of which 6 / 314 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 311 transition count 539
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 152 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 528
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 148 edges and 300 vertex of which 8 / 300 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 296 transition count 514
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 144 edges and 292 vertex of which 8 / 292 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 288 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 284 vertex of which 8 / 284 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 280 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 276 vertex of which 8 / 276 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 272 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 268 vertex of which 8 / 268 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 264 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 260 vertex of which 8 / 260 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 256 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 252 vertex of which 8 / 252 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 248 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 244 vertex of which 8 / 244 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 240 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 236 vertex of which 8 / 236 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 232 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 228 vertex of which 8 / 228 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 224 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 220 vertex of which 8 / 220 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 216 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 212 vertex of which 8 / 212 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 263 place count 208 transition count 360
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 100 edges and 204 vertex of which 6 / 204 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 201 transition count 346
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 97 edges and 198 vertex of which 6 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 14 rules applied. Total rules applied 296 place count 195 transition count 336
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 192 vertex of which 6 / 192 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 312 place count 189 transition count 324
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 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 327 place count 182 transition count 313
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 (trivial) has 89 edges and 178 vertex of which 10 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 20 rules applied. Total rules applied 347 place count 173 transition count 298
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 83 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 25 rules applied. Total rules applied 372 place count 164 transition count 279
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 78 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 21 rules applied. Total rules applied 393 place count 155 transition count 264
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 74 edges and 151 vertex of which 8 / 151 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 412 place count 147 transition count 250
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 70 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 139 transition count 236
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 66 edges and 135 vertex of which 8 / 135 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 450 place count 131 transition count 222
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 62 edges and 127 vertex of which 8 / 127 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 469 place count 123 transition count 208
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 58 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 115 transition count 194
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 54 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 107 transition count 180
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 50 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 99 transition count 166
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 46 edges and 95 vertex of which 8 / 95 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 91 transition count 152
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 42 edges and 87 vertex of which 8 / 87 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 83 transition count 138
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 38 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 17 rules applied. Total rules applied 581 place count 76 transition count 126
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 35 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 32 with 17 rules applied. Total rules applied 598 place count 70 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 32 edges and 66 vertex of which 6 / 66 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 33 with 17 rules applied. Total rules applied 615 place count 63 transition count 101
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 30 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 15 rules applied. Total rules applied 630 place count 56 transition count 90
Discarding 40 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Remove reverse transitions (loop back) rule discarded transition t45.t42.t43 and 40 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 35 with 11 rules applied. Total rules applied 641 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 641 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 36 with 9 rules applied. Total rules applied 650 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 651 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 651 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 655 place count 4 transition count 4
Applied a total of 655 rules in 48 ms. Remains 4 /324 variables (removed 320) and now considering 4/557 (removed 553) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-29 20:47:05] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 20:47:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-29 20:47:05] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-29 20:47:05] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 20:47:05] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:47:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-29 20:47:05] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:47:05] [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.
[2024-05-29 20:47:05] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 104 ms :[p0, (AND (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 114 ms :[p0, (AND (NOT p1) p0), p0]
Product exploration explored 100000 steps with 26 reset in 451 ms.
Product exploration explored 100000 steps with 33 reset in 569 ms.
Built C files in :
/tmp/ltsmin18175568854826374097
[2024-05-29 20:47:06] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-29 20:47:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:06] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-29 20:47:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:06] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-29 20:47:06] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:06] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18175568854826374097
Running compilation step : cd /tmp/ltsmin18175568854826374097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1435 ms.
Running link step : cd /tmp/ltsmin18175568854826374097;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18175568854826374097;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14799796549770244523.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 558/558 transitions.
Applied a total of 0 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-29 20:47:21] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:47:21] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-29 20:47:21] [INFO ] Invariant cache hit.
[2024-05-29 20:47:22] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-05-29 20:47:22] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:47:22] [INFO ] Invariant cache hit.
[2024-05-29 20:47:22] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 825 ms. Remains : 324/324 places, 558/558 transitions.
Built C files in :
/tmp/ltsmin5364227740449786647
[2024-05-29 20:47:22] [INFO ] Computing symmetric may disable matrix : 558 transitions.
[2024-05-29 20:47:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:22] [INFO ] Computing symmetric may enable matrix : 558 transitions.
[2024-05-29 20:47:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:22] [INFO ] Computing Do-Not-Accords matrix : 558 transitions.
[2024-05-29 20:47:22] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:47:22] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5364227740449786647
Running compilation step : cd /tmp/ltsmin5364227740449786647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1293 ms.
Running link step : cd /tmp/ltsmin5364227740449786647;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5364227740449786647;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased337158427027759468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:47:37] [INFO ] Flatten gal took : 40 ms
[2024-05-29 20:47:37] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:47:37] [INFO ] Time to serialize gal into /tmp/LTL9724885518031427213.gal : 7 ms
[2024-05-29 20:47:37] [INFO ] Time to serialize properties into /tmp/LTL3700314038274984136.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9724885518031427213.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3463226360296062679.hoa' '-atoms' '/tmp/LTL3700314038274984136.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3700314038274984136.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3463226360296062679.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 4.90389e+30 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
134 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41812,62532,1,0,114,281529,35,112,12077,276970,274
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-040B-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-040B-LTLFireability-01 finished in 52981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&X((p0 U (p1||G(p0))))))||(p2&&X(!p1))))))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 131 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:47:39] [INFO ] Computed 161 invariants in 14 ms
[2024-05-29 20:47:39] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-29 20:47:39] [INFO ] Invariant cache hit.
[2024-05-29 20:47:41] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1771 ms to find 0 implicit places.
[2024-05-29 20:47:41] [INFO ] Invariant cache hit.
[2024-05-29 20:47:42] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2793 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 238 ms :[true, p1, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(NEQ s167 1), p0:(NEQ s711 1), p2:(EQ s561 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 416 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-03 finished in 3071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(p1)&&(p0||X(p0))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 117 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:47:42] [INFO ] Computed 161 invariants in 9 ms
[2024-05-29 20:47:43] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 20:47:43] [INFO ] Invariant cache hit.
[2024-05-29 20:47:44] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1649 ms to find 0 implicit places.
[2024-05-29 20:47:44] [INFO ] Invariant cache hit.
[2024-05-29 20:47:45] [INFO ] Dead Transitions using invariants and state equation in 772 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2542 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s957 1), p0:(EQ s671 0)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33314 reset in 724 ms.
Product exploration explored 100000 steps with 33336 reset in 693 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1562 stabilizing places and 479/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 166 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:47:47] [INFO ] Invariant cache hit.
[2024-05-29 20:47:47] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:47:47] [INFO ] [Nat]Absence check using 161 positive place invariants in 53 ms returned sat
[2024-05-29 20:47:48] [INFO ] After 620ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:47:48] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:47:48] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 0 ms to minimize.
[2024-05-29 20:47:49] [INFO ] Deduced a trap composed of 27 places in 318 ms of which 7 ms to minimize.
[2024-05-29 20:47:49] [INFO ] Deduced a trap composed of 22 places in 290 ms of which 1 ms to minimize.
[2024-05-29 20:47:49] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 1 ms to minimize.
[2024-05-29 20:47:50] [INFO ] Deduced a trap composed of 60 places in 266 ms of which 1 ms to minimize.
[2024-05-29 20:47:50] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 0 ms to minimize.
[2024-05-29 20:47:50] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 1 ms to minimize.
[2024-05-29 20:47:51] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 0 ms to minimize.
[2024-05-29 20:47:51] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 0 ms to minimize.
[2024-05-29 20:47:51] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:47:51] [INFO ] Deduced a trap composed of 26 places in 226 ms of which 1 ms to minimize.
[2024-05-29 20:47:52] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:47:52] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 0 ms to minimize.
[2024-05-29 20:47:52] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 1 ms to minimize.
[2024-05-29 20:47:52] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:47:53] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:47:53] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:47:53] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:47:53] [INFO ] Deduced a trap composed of 48 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:47:54] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 1 ms to minimize.
[2024-05-29 20:47:54] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 0 ms to minimize.
[2024-05-29 20:47:54] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:47:54] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:47:54] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6652 ms
[2024-05-29 20:47:54] [INFO ] After 7323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 20:47:54] [INFO ] After 7632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 333 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=111 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (AND p0 p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-04 finished in 12660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1564 transition count 1564
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1564 transition count 1564
Applied a total of 20 rules in 122 ms. Remains 1564 /1574 variables (removed 10) and now considering 1564/1574 (removed 10) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2024-05-29 20:47:55] [INFO ] Computed 161 invariants in 11 ms
[2024-05-29 20:47:55] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-29 20:47:55] [INFO ] Invariant cache hit.
[2024-05-29 20:47:56] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-05-29 20:47:56] [INFO ] Invariant cache hit.
[2024-05-29 20:47:57] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1574 places, 1564/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2605 ms. Remains : 1564/1574 places, 1564/1574 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s874 1) (OR (EQ s1419 1) (EQ s987 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][false, false]]
Stuttering criterion allowed to conclude after 14144 steps with 0 reset in 57 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 2765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 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 1573 transition count 1138
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 1138 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1137 transition count 1137
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 872 place count 1137 transition count 823
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1500 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 3 with 10 rules applied. Total rules applied 1520 place count 813 transition count 813
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 813 transition count 804
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 804 transition count 804
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2258 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2259 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 4 with 2 rules applied. Total rules applied 2261 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 4 with 202 rules applied. Total rules applied 2463 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 4 with 34 rules applied. Total rules applied 2497 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2499 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2500 place count 322 transition count 556
Applied a total of 2500 rules in 144 ms. Remains 322 /1574 variables (removed 1252) and now considering 556/1574 (removed 1018) transitions.
// Phase 1: matrix 556 rows 322 cols
[2024-05-29 20:47:58] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:47:58] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 20:47:58] [INFO ] Invariant cache hit.
[2024-05-29 20:47:58] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-29 20:47:58] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:47:58] [INFO ] Invariant cache hit.
[2024-05-29 20:47:58] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1574 places, 556/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 967 ms. Remains : 322/1574 places, 556/1574 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24 reset in 468 ms.
Product exploration explored 100000 steps with 24 reset in 494 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 502574 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 502574 steps, saw 344046 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:48:03] [INFO ] Invariant cache hit.
[2024-05-29 20:48:03] [INFO ] [Real]Absence check using 160 positive place invariants in 23 ms returned sat
[2024-05-29 20:48:03] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:03] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:03] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:03] [INFO ] After 179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 20:48:03] [INFO ] After 274ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 556/556 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 555
Applied a total of 1 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 322/322 places, 555/556 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 494001 steps, run timeout after 3006 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494001 steps, saw 343884 distinct states, run finished after 3006 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 555 rows 322 cols
[2024-05-29 20:48:06] [INFO ] Computed 160 invariants in 1 ms
[2024-05-29 20:48:06] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:06] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:07] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:07] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:07] [INFO ] After 184ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-29 20:48:07] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 322/322 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-29 20:48:07] [INFO ] Invariant cache hit.
[2024-05-29 20:48:07] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-29 20:48:07] [INFO ] Invariant cache hit.
[2024-05-29 20:48:07] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-29 20:48:07] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:48:07] [INFO ] Invariant cache hit.
[2024-05-29 20:48:08] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 888 ms. Remains : 322/322 places, 555/555 transitions.
Graph (trivial) has 159 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
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1102 edges and 320 vertex of which 318 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 156 edges and 316 vertex of which 4 / 316 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 314 transition count 546
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 155 edges and 312 vertex of which 6 / 312 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 309 transition count 537
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 153 edges and 306 vertex of which 8 / 306 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 302 transition count 526
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 149 edges and 298 vertex of which 8 / 298 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 294 transition count 512
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 145 edges and 290 vertex of which 8 / 290 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 286 transition count 498
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 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 278 transition count 484
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 137 edges and 274 vertex of which 8 / 274 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 270 transition count 470
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 133 edges and 266 vertex of which 8 / 266 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 262 transition count 456
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 129 edges and 258 vertex of which 8 / 258 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 149 place count 254 transition count 442
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 125 edges and 250 vertex of which 8 / 250 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 168 place count 246 transition count 428
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 121 edges and 242 vertex of which 8 / 242 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 238 transition count 414
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 117 edges and 234 vertex of which 8 / 234 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 230 transition count 400
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 113 edges and 226 vertex of which 8 / 226 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 222 transition count 386
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 109 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 214 transition count 372
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 105 edges and 210 vertex of which 8 / 210 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 206 transition count 358
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 101 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 198 transition count 344
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 97 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 190 transition count 330
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 93 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 182 transition count 316
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 89 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 174 transition count 302
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 85 edges and 170 vertex of which 8 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 166 transition count 288
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 81 edges and 162 vertex of which 8 / 162 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 158 transition count 274
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 77 edges and 154 vertex of which 8 / 154 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 396 place count 150 transition count 260
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 73 edges and 146 vertex of which 8 / 146 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 415 place count 142 transition count 246
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 69 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 134 transition count 232
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 65 edges and 130 vertex of which 8 / 130 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 453 place count 126 transition count 218
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 61 edges and 122 vertex of which 8 / 122 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 472 place count 118 transition count 204
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 57 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 110 transition count 190
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 53 edges and 106 vertex of which 8 / 106 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 102 transition count 176
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 49 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 94 transition count 162
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 45 edges and 90 vertex of which 8 / 90 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 86 transition count 148
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 41 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 78 transition count 134
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 37 edges and 74 vertex of which 8 / 74 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 70 transition count 120
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 33 edges and 66 vertex of which 8 / 66 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 62 transition count 106
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 29 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 54 transition count 92
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 25 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 46 transition count 78
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 21 edges and 42 vertex of which 8 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 38 transition count 64
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 17 edges and 34 vertex of which 6 / 34 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 31 transition count 50
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 13 edges and 28 vertex of which 4 / 28 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 37 with 14 rules applied. Total rules applied 695 place count 26 transition count 40
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 10 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 38 with 9 rules applied. Total rules applied 704 place count 23 transition count 34
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 39 with 5 rules applied. Total rules applied 709 place count 22 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 40 with 1 Pre rules applied. Total rules applied 709 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 712 place count 20 transition count 29
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 40 with 3 rules applied. Total rules applied 715 place count 18 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 718 place count 18 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 719 place count 18 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 720 place count 18 transition count 24
Applied a total of 720 rules in 34 ms. Remains 18 /322 variables (removed 304) and now considering 24/555 (removed 531) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 18 cols
[2024-05-29 20:48:08] [INFO ] Computed 8 invariants in 0 ms
[2024-05-29 20:48:08] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-29 20:48:08] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-29 20:48:08] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:08] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-29 20:48:08] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 556/556 transitions.
Applied a total of 0 rules in 17 ms. Remains 322 /322 variables (removed 0) and now considering 556/556 (removed 0) transitions.
// Phase 1: matrix 556 rows 322 cols
[2024-05-29 20:48:08] [INFO ] Computed 160 invariants in 4 ms
[2024-05-29 20:48:08] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-29 20:48:08] [INFO ] Invariant cache hit.
[2024-05-29 20:48:08] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-29 20:48:08] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:48:08] [INFO ] Invariant cache hit.
[2024-05-29 20:48:09] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 812 ms. Remains : 322/322 places, 556/556 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507314 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507314 steps, saw 347409 distinct states, run finished after 3004 ms. (steps per millisecond=168 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:48:12] [INFO ] Invariant cache hit.
[2024-05-29 20:48:12] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:12] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:12] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:48:12] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:12] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 20:48:12] [INFO ] After 265ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 556/556 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 555
Applied a total of 1 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 322/322 places, 555/556 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 486169 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 486169 steps, saw 338003 distinct states, run finished after 3002 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 555 rows 322 cols
[2024-05-29 20:48:16] [INFO ] Computed 160 invariants in 4 ms
[2024-05-29 20:48:16] [INFO ] [Real]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:16] [INFO ] After 246ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:16] [INFO ] [Nat]Absence check using 160 positive place invariants in 21 ms returned sat
[2024-05-29 20:48:16] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:16] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-29 20:48:16] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 322/322 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-29 20:48:16] [INFO ] Invariant cache hit.
[2024-05-29 20:48:16] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 20:48:16] [INFO ] Invariant cache hit.
[2024-05-29 20:48:17] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-29 20:48:17] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-29 20:48:17] [INFO ] Invariant cache hit.
[2024-05-29 20:48:17] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 829 ms. Remains : 322/322 places, 555/555 transitions.
Graph (trivial) has 159 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
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1102 edges and 320 vertex of which 318 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 156 edges and 316 vertex of which 4 / 316 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 314 transition count 546
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 155 edges and 312 vertex of which 6 / 312 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 309 transition count 537
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 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 302 transition count 526
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 149 edges and 298 vertex of which 8 / 298 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 294 transition count 512
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 145 edges and 290 vertex of which 8 / 290 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 286 transition count 498
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 141 edges and 282 vertex of which 8 / 282 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 278 transition count 484
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 137 edges and 274 vertex of which 8 / 274 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 270 transition count 470
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 133 edges and 266 vertex of which 8 / 266 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 262 transition count 456
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 129 edges and 258 vertex of which 8 / 258 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 149 place count 254 transition count 442
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 125 edges and 250 vertex of which 8 / 250 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 168 place count 246 transition count 428
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 121 edges and 242 vertex of which 8 / 242 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 238 transition count 414
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 117 edges and 234 vertex of which 8 / 234 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 230 transition count 400
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 113 edges and 226 vertex of which 8 / 226 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 222 transition count 386
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 109 edges and 218 vertex of which 8 / 218 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 214 transition count 372
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 105 edges and 210 vertex of which 8 / 210 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 206 transition count 358
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 101 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 198 transition count 344
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 97 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 190 transition count 330
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 93 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 182 transition count 316
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 89 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 174 transition count 302
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 85 edges and 170 vertex of which 8 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 166 transition count 288
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 81 edges and 162 vertex of which 8 / 162 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 158 transition count 274
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 77 edges and 154 vertex of which 8 / 154 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 396 place count 150 transition count 260
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 73 edges and 146 vertex of which 8 / 146 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 415 place count 142 transition count 246
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 69 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 134 transition count 232
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 65 edges and 130 vertex of which 8 / 130 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 453 place count 126 transition count 218
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 61 edges and 122 vertex of which 8 / 122 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 472 place count 118 transition count 204
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 57 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 110 transition count 190
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 53 edges and 106 vertex of which 8 / 106 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 102 transition count 176
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 49 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 94 transition count 162
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 45 edges and 90 vertex of which 8 / 90 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 86 transition count 148
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 41 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 78 transition count 134
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 37 edges and 74 vertex of which 8 / 74 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 70 transition count 120
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 33 edges and 66 vertex of which 8 / 66 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 62 transition count 106
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 29 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 54 transition count 92
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 25 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 46 transition count 78
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 21 edges and 42 vertex of which 8 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 38 transition count 64
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 17 edges and 34 vertex of which 6 / 34 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 31 transition count 50
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 13 edges and 28 vertex of which 4 / 28 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 37 with 14 rules applied. Total rules applied 695 place count 26 transition count 40
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 10 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 38 with 9 rules applied. Total rules applied 704 place count 23 transition count 34
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 39 with 5 rules applied. Total rules applied 709 place count 22 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 40 with 1 Pre rules applied. Total rules applied 709 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 712 place count 20 transition count 29
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 40 with 3 rules applied. Total rules applied 715 place count 18 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 718 place count 18 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 719 place count 18 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 720 place count 18 transition count 24
Applied a total of 720 rules in 63 ms. Remains 18 /322 variables (removed 304) and now considering 24/555 (removed 531) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 18 cols
[2024-05-29 20:48:17] [INFO ] Computed 8 invariants in 0 ms
[2024-05-29 20:48:17] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-29 20:48:17] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:48:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-29 20:48:17] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:48:17] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 20:48:17] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21 reset in 417 ms.
Product exploration explored 100000 steps with 25 reset in 487 ms.
Built C files in :
/tmp/ltsmin17753879014466639107
[2024-05-29 20:48:18] [INFO ] Computing symmetric may disable matrix : 556 transitions.
[2024-05-29 20:48:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:48:18] [INFO ] Computing symmetric may enable matrix : 556 transitions.
[2024-05-29 20:48:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:48:18] [INFO ] Computing Do-Not-Accords matrix : 556 transitions.
[2024-05-29 20:48:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:48:18] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17753879014466639107
Running compilation step : cd /tmp/ltsmin17753879014466639107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1283 ms.
Running link step : cd /tmp/ltsmin17753879014466639107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17753879014466639107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6433000229493524827.hoa' '--buchi-type=spotba'
LTSmin run took 3131 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 25310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 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 1573 transition count 1136
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1136 transition count 1136
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 874 place count 1136 transition count 823
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1500 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 2 with 10 rules applied. Total rules applied 1520 place count 813 transition count 813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1520 place count 813 transition count 804
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1538 place count 804 transition count 804
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 2 with 720 rules applied. Total rules applied 2258 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 2259 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 2261 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 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2463 place count 342 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2499 place count 324 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2501 place count 322 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2502 place count 321 transition count 558
Applied a total of 2502 rules in 132 ms. Remains 321 /1574 variables (removed 1253) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 321 cols
[2024-05-29 20:48:23] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:48:23] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 20:48:23] [INFO ] Invariant cache hit.
[2024-05-29 20:48:23] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-29 20:48:23] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:48:23] [INFO ] Invariant cache hit.
[2024-05-29 20:48:24] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 934 ms. Remains : 321/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((G(p1) U (p0&&G(p1))))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 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 1573 transition count 1138
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 870 place count 1138 transition count 1138
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 870 place count 1138 transition count 824
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1498 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 2 with 10 rules applied. Total rules applied 1518 place count 814 transition count 814
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1518 place count 814 transition count 805
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1536 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2254 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 446 transition count 445
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 2257 place count 445 transition count 444
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 2459 place count 344 transition count 544
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 2493 place count 327 transition count 560
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2494 place count 327 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2496 place count 325 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2497 place count 324 transition count 558
Applied a total of 2497 rules in 144 ms. Remains 324 /1574 variables (removed 1250) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-29 20:48:24] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:48:24] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-29 20:48:24] [INFO ] Invariant cache hit.
[2024-05-29 20:48:24] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-29 20:48:24] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:48:24] [INFO ] Invariant cache hit.
[2024-05-29 20:48:25] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 920 ms. Remains : 324/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s225 1), p1:(EQ s76 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, 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 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 117 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:48:25] [INFO ] Computed 161 invariants in 8 ms
[2024-05-29 20:48:25] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-29 20:48:25] [INFO ] Invariant cache hit.
[2024-05-29 20:48:27] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1589 ms to find 0 implicit places.
[2024-05-29 20:48:27] [INFO ] Invariant cache hit.
[2024-05-29 20:48:27] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2539 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 190 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 1 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 553 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), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 85 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 124 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 167826 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167826 steps, saw 86734 distinct states, run finished after 3002 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 20:48:32] [INFO ] Invariant cache hit.
[2024-05-29 20:48:32] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:48:33] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2024-05-29 20:48:34] [INFO ] After 836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:48:34] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:48:34] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:48:34] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:48:35] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 0 ms to minimize.
[2024-05-29 20:48:35] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 0 ms to minimize.
[2024-05-29 20:48:35] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 0 ms to minimize.
[2024-05-29 20:48:36] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:48:36] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:48:36] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:48:36] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:48:37] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 0 ms to minimize.
[2024-05-29 20:48:37] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:48:37] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2024-05-29 20:48:37] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 0 ms to minimize.
[2024-05-29 20:48:38] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:48:38] [INFO ] Deduced a trap composed of 50 places in 198 ms of which 1 ms to minimize.
[2024-05-29 20:48:38] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:48:38] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:48:39] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 1 ms to minimize.
[2024-05-29 20:48:39] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:48:39] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:48:39] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5626 ms
[2024-05-29 20:48:39] [INFO ] After 6791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 209 ms.
[2024-05-29 20:48:40] [INFO ] After 7391ms 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 66 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 112 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 112 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 125 ms. (steps per millisecond=80 ) 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 36 ms. (steps per millisecond=277 ) properties (out of 4) 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 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
Interrupted probabilistic random walk after 288395 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 288395 steps, saw 189985 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2024-05-29 20:48:43] [INFO ] Computed 160 invariants in 1 ms
[2024-05-29 20:48:43] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:48:43] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2024-05-29 20:48:43] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:48:44] [INFO ] After 295ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2024-05-29 20:48:44] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 74 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 6 ms. Remains : 325/325 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 305981 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 305981 steps, saw 200491 distinct states, run finished after 3001 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:48:47] [INFO ] Invariant cache hit.
[2024-05-29 20:48:47] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:48:47] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:48:47] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:48:47] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 20:48:47] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 56 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 6 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.
[2024-05-29 20:48:47] [INFO ] Invariant cache hit.
[2024-05-29 20:48:48] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-29 20:48:48] [INFO ] Invariant cache hit.
[2024-05-29 20:48:48] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 530 ms to find 0 implicit places.
[2024-05-29 20:48:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:48:48] [INFO ] Invariant cache hit.
[2024-05-29 20:48:48] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 780 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 22 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
[2024-05-29 20:48:48] [INFO ] Computed 157 invariants in 2 ms
[2024-05-29 20:48:48] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:48:48] [INFO ] [Nat]Absence check using 157 positive place invariants in 20 ms returned sat
[2024-05-29 20:48:49] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:48:49] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-29 20:48:49] [INFO ] After 382ms 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), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (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 211 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 125 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 110 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 60 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:48:49] [INFO ] Computed 161 invariants in 9 ms
[2024-05-29 20:48:50] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-29 20:48:50] [INFO ] Invariant cache hit.
[2024-05-29 20:48:51] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
[2024-05-29 20:48:51] [INFO ] Invariant cache hit.
[2024-05-29 20:48:52] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2412 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 (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 90 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 126 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) 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 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 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 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 173485 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173485 steps, saw 88852 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-29 20:48:55] [INFO ] Invariant cache hit.
[2024-05-29 20:48:55] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:48:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2024-05-29 20:48:57] [INFO ] After 821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:48:57] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:48:57] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:48:57] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:48:58] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:48:58] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:48:58] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2024-05-29 20:48:59] [INFO ] Deduced a trap composed of 42 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:48:59] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:48:59] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 33 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:49:00] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:49:01] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:49:01] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 1 ms to minimize.
[2024-05-29 20:49:01] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:49:01] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 0 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:49:02] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5797 ms
[2024-05-29 20:49:03] [INFO ] After 6942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 221 ms.
[2024-05-29 20:49:03] [INFO ] After 7567ms 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 56 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 1 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 115 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 115 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 220566 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220566 steps, saw 146708 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2024-05-29 20:49:06] [INFO ] Computed 160 invariants in 1 ms
[2024-05-29 20:49:06] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 20:49:07] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-29 20:49:07] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-29 20:49:07] [INFO ] After 315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-29 20:49:07] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 97 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 6 ms. Remains : 325/325 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) 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 256509 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256509 steps, saw 169810 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:49:10] [INFO ] Invariant cache hit.
[2024-05-29 20:49:10] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:49:10] [INFO ] [Nat]Absence check using 160 positive place invariants in 20 ms returned sat
[2024-05-29 20:49:11] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:49:11] [INFO ] After 259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 20:49:11] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 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 6 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.
[2024-05-29 20:49:11] [INFO ] Invariant cache hit.
[2024-05-29 20:49:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 20:49:11] [INFO ] Invariant cache hit.
[2024-05-29 20:49:11] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2024-05-29 20:49:11] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-29 20:49:11] [INFO ] Invariant cache hit.
[2024-05-29 20:49:12] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 802 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 28 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
[2024-05-29 20:49:12] [INFO ] Computed 157 invariants in 2 ms
[2024-05-29 20:49:12] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:49:12] [INFO ] [Nat]Absence check using 157 positive place invariants in 20 ms returned sat
[2024-05-29 20:49:12] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:49:12] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-05-29 20:49:12] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 121 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 112 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 498 ms.
Built C files in :
/tmp/ltsmin16797600085396890701
[2024-05-29 20:49:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16797600085396890701
Running compilation step : cd /tmp/ltsmin16797600085396890701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2690 ms.
Running link step : cd /tmp/ltsmin16797600085396890701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16797600085396890701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16757388160734005592.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 62 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:49:29] [INFO ] Computed 161 invariants in 11 ms
[2024-05-29 20:49:29] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 20:49:29] [INFO ] Invariant cache hit.
[2024-05-29 20:49:30] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2024-05-29 20:49:30] [INFO ] Invariant cache hit.
[2024-05-29 20:49:31] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2470 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Built C files in :
/tmp/ltsmin894815898088558015
[2024-05-29 20:49:31] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin894815898088558015
Running compilation step : cd /tmp/ltsmin894815898088558015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2626 ms.
Running link step : cd /tmp/ltsmin894815898088558015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin894815898088558015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15960704717439897507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:49:46] [INFO ] Flatten gal took : 42 ms
[2024-05-29 20:49:46] [INFO ] Flatten gal took : 41 ms
[2024-05-29 20:49:46] [INFO ] Time to serialize gal into /tmp/LTL4318552028736422695.gal : 8 ms
[2024-05-29 20:49:46] [INFO ] Time to serialize properties into /tmp/LTL1586606117588447443.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4318552028736422695.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4861148726257043176.hoa' '-atoms' '/tmp/LTL1586606117588447443.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1586606117588447443.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4861148726257043176.hoa
Detected timeout of ITS tools.
[2024-05-29 20:50:02] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:50:02] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:50:02] [INFO ] Time to serialize gal into /tmp/LTL7597233669837092391.gal : 6 ms
[2024-05-29 20:50:02] [INFO ] Time to serialize properties into /tmp/LTL2800874827887867694.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7597233669837092391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2800874827887867694.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(("((p1981==1)||(p921==0))")||(G(("(p957==0)")||(X("(p957==0)")))))))
Formula 0 simplified : F(!"((p1981==1)||(p921==0))" & F(!"(p957==0)" & X!"(p957==0)"))
Detected timeout of ITS tools.
[2024-05-29 20:50:17] [INFO ] Flatten gal took : 35 ms
[2024-05-29 20:50:17] [INFO ] Applying decomposition
[2024-05-29 20:50:17] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1993270552768084960.txt' '-o' '/tmp/graph1993270552768084960.bin' '-w' '/tmp/graph1993270552768084960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1993270552768084960.bin' '-l' '-1' '-v' '-w' '/tmp/graph1993270552768084960.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:50:17] [INFO ] Decomposing Gal with order
[2024-05-29 20:50:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:50:17] [INFO ] Removed a total of 396 redundant transitions.
[2024-05-29 20:50:17] [INFO ] Flatten gal took : 133 ms
[2024-05-29 20:50:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-29 20:50:17] [INFO ] Time to serialize gal into /tmp/LTL9375044148618505558.gal : 19 ms
[2024-05-29 20:50:17] [INFO ] Time to serialize properties into /tmp/LTL1042432658635091398.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9375044148618505558.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1042432658635091398.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(("((i37.i3.u607.p1981==1)||(i16.i4.u282.p921==0))")||(G(("(i19.i3.u294.p957==0)")||(X("(i19.i3.u294.p957==0)")))))))
Formula 0 simplified : F(!"((i37.i3.u607.p1981==1)||(i16.i4.u282.p921==0))" & F(!"(i19.i3.u294.p957==0)" & X!"(i19.i3.u294.p957==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4516183817978639179
[2024-05-29 20:50:32] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4516183817978639179
Running compilation step : cd /tmp/ltsmin4516183817978639179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2588 ms.
Running link step : cd /tmp/ltsmin4516183817978639179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4516183817978639179;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp1==true)||X((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 142685 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(G(p0)))))))'
Support contains 1 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1561 transition count 1561
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1561 transition count 1561
Applied a total of 26 rules in 121 ms. Remains 1561 /1574 variables (removed 13) and now considering 1561/1574 (removed 13) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-29 20:50:48] [INFO ] Computed 161 invariants in 8 ms
[2024-05-29 20:50:48] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-29 20:50:48] [INFO ] Invariant cache hit.
[2024-05-29 20:50:49] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2024-05-29 20:50:49] [INFO ] Invariant cache hit.
[2024-05-29 20:50:50] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1574 places, 1561/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2492 ms. Remains : 1561/1574 places, 1561/1574 transitions.
Stuttering acceptance computed with spot in 199 ms :[p0, p0, p0, true, false, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s956 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 19431 steps with 0 reset in 84 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 2803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p0||X((X(p1) U (p0&&X(p1))))) U p2)))'
Support contains 4 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 121 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-29 20:50:50] [INFO ] Computed 161 invariants in 11 ms
[2024-05-29 20:50:51] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-29 20:50:51] [INFO ] Invariant cache hit.
[2024-05-29 20:50:52] [INFO ] Implicit Places using invariants and state equation in 1224 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2024-05-29 20:50:52] [INFO ] Invariant cache hit.
[2024-05-29 20:50:53] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2526 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { 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=[p0:(EQ s1109 1), p2:(OR (EQ s1036 1) (EQ s1425 1)), p1:(NEQ s1134 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]]
Product exploration explored 100000 steps with 19985 reset in 439 ms.
Product exploration explored 100000 steps with 20019 reset in 483 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 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), true, (X (X p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 138 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Finished random walk after 1193 steps, including 0 resets, run visited all 4 properties in 10 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p0))), true, (X (X p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 315 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2024-05-29 20:50:55] [INFO ] Invariant cache hit.
[2024-05-29 20:50:56] [INFO ] [Real]Absence check using 161 positive place invariants in 141 ms returned sat
[2024-05-29 20:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:50:59] [INFO ] [Real]Absence check using state equation in 3867 ms returned sat
[2024-05-29 20:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:51:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 137 ms returned sat
[2024-05-29 20:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:51:05] [INFO ] [Nat]Absence check using state equation in 4516 ms returned sat
[2024-05-29 20:51:05] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 91 ms.
[2024-05-29 20:51:15] [INFO ] Added : 545 causal constraints over 109 iterations in 9728 ms. Result :unknown
Could not prove EG (NOT p2)
[2024-05-29 20:51:15] [INFO ] Invariant cache hit.
[2024-05-29 20:51:15] [INFO ] [Real]Absence check using 161 positive place invariants in 125 ms returned sat
[2024-05-29 20:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:51:19] [INFO ] [Real]Absence check using state equation in 3995 ms returned sat
[2024-05-29 20:51:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:51:20] [INFO ] [Nat]Absence check using 161 positive place invariants in 134 ms returned sat
[2024-05-29 20:51:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:51:25] [INFO ] [Nat]Absence check using state equation in 4687 ms returned sat
[2024-05-29 20:51:25] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 77 ms.
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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:251)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 20:51:34] [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 (NOT p0)
Could not prove EG (NOT p0)
Support contains 4 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 56 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-05-29 20:51:34] [INFO ] Invariant cache hit.
[2024-05-29 20:51:35] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-29 20:51:35] [INFO ] Invariant cache hit.
[2024-05-29 20:51:36] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-29 20:51:36] [INFO ] Invariant cache hit.
[2024-05-29 20:51:37] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2480 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 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), true, (X (X p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 131 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:51:37] [INFO ] Invariant cache hit.
[2024-05-29 20:51:37] [INFO ] [Real]Absence check using 161 positive place invariants in 55 ms returned sat
[2024-05-29 20:51:38] [INFO ] After 932ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:51:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2024-05-29 20:51:39] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:51:39] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 0 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 38 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:51:40] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 40 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:51:41] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:51:42] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:51:42] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:51:42] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 2 ms to minimize.
[2024-05-29 20:51:42] [INFO ] Deduced a trap composed of 48 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:51:43] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:51:43] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:51:43] [INFO ] Deduced a trap composed of 37 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:51:43] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:51:44] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:51:44] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:51:44] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:51:44] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:51:45] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 0 ms to minimize.
[2024-05-29 20:51:45] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:51:45] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:51:45] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 0 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 0 ms to minimize.
[2024-05-29 20:51:46] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:51:47] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7810 ms
[2024-05-29 20:51:47] [INFO ] After 8526ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2024-05-29 20:51:47] [INFO ] After 8834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 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 1562 transition count 1126
Reduce places removed 436 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 437 rules applied. Total rules applied 873 place count 1126 transition count 1125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 874 place count 1125 transition count 1125
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 874 place count 1125 transition count 805
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 1514 place count 805 transition count 805
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1515 place count 804 transition count 804
Iterating global reduction 3 with 1 rules applied. Total rules applied 1516 place count 804 transition count 804
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1516 place count 804 transition count 803
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1518 place count 803 transition count 803
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2238 place count 443 transition count 443
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 443 transition count 442
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 442 transition count 441
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
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 341 transition count 541
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 2477 place count 324 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 2478 place count 324 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2479 place count 323 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2480 place count 322 transition count 555
Applied a total of 2480 rules in 122 ms. Remains 322 /1562 variables (removed 1240) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 322/1562 places, 555/1562 transitions.
Finished random walk after 1869 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p0)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p0))), true, (X (X p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 10 factoid took 295 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2024-05-29 20:51:48] [INFO ] Invariant cache hit.
[2024-05-29 20:51:48] [INFO ] [Real]Absence check using 161 positive place invariants in 127 ms returned sat
[2024-05-29 20:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:51:52] [INFO ] [Real]Absence check using state equation in 4026 ms returned sat
[2024-05-29 20:51:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:51:53] [INFO ] [Nat]Absence check using 161 positive place invariants in 137 ms returned sat
[2024-05-29 20:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:51:58] [INFO ] [Nat]Absence check using state equation in 4491 ms returned sat
[2024-05-29 20:51:58] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 94 ms.
[2024-05-29 20:52:08] [INFO ] Deduced a trap composed of 25 places in 639 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:523)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
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:802)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 20:52:08] [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 (NOT p2)
Could not prove EG (NOT p2)
[2024-05-29 20:52:08] [INFO ] Invariant cache hit.
[2024-05-29 20:52:09] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2024-05-29 20:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 20:52:13] [INFO ] [Real]Absence check using state equation in 4039 ms returned sat
[2024-05-29 20:52:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 20:52:14] [INFO ] [Nat]Absence check using 161 positive place invariants in 136 ms returned sat
[2024-05-29 20:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 20:52:19] [INFO ] [Nat]Absence check using state equation in 4850 ms returned sat
[2024-05-29 20:52:19] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 84 ms.
[2024-05-29 20:52:28] [INFO ] Added : 525 causal constraints over 105 iterations in 9389 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 19921 reset in 432 ms.
Product exploration explored 100000 steps with 20087 reset in 449 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1562 transition count 1562
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 436 place count 1562 transition count 1723
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 598 place count 1562 transition count 1723
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1074 places in 2 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1074 place count 1562 transition count 1723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1075 place count 1562 transition count 1722
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1391 place count 1246 transition count 1406
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 1707 place count 1246 transition count 1406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 759 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1708 place count 1246 transition count 1406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1710 place count 1244 transition count 1404
Deduced a syphon composed of 757 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1712 place count 1244 transition count 1404
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 858 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1813 place count 1244 transition count 2136
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1914 place count 1143 transition count 1934
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2015 place count 1143 transition count 1934
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -395
Deduced a syphon composed of 814 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2072 place count 1143 transition count 2329
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2130 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2188 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2191 place count 1085 transition count 2210
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2191 rules in 789 ms. Remains 1085 /1562 variables (removed 477) and now considering 2210/1562 (removed -648) transitions.
[2024-05-29 20:52:30] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 2210 rows 1085 cols
[2024-05-29 20:52:30] [INFO ] Computed 161 invariants in 14 ms
[2024-05-29 20:52:31] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/1562 places, 2210/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1797 ms. Remains : 1085/1562 places, 2210/1562 transitions.
Built C files in :
/tmp/ltsmin11443047563008504856
[2024-05-29 20:52:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11443047563008504856
Running compilation step : cd /tmp/ltsmin11443047563008504856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2678 ms.
Running link step : cd /tmp/ltsmin11443047563008504856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11443047563008504856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7313975303575082328.hoa' '--buchi-type=spotba'
LTSmin run took 5182 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 108737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((p1||X(G(!p1))))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1561 transition count 1561
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1561 transition count 1561
Applied a total of 26 rules in 139 ms. Remains 1561 /1574 variables (removed 13) and now considering 1561/1574 (removed 13) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-29 20:52:39] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 20:52:40] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-29 20:52:40] [INFO ] Invariant cache hit.
[2024-05-29 20:52:41] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-29 20:52:41] [INFO ] Invariant cache hit.
[2024-05-29 20:52:42] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1574 places, 1561/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2508 ms. Remains : 1561/1574 places, 1561/1574 transitions.
Stuttering acceptance computed with spot in 154 ms :[false, false, false, p1, true, false]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0, 1} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s926 1), p0:(EQ s1424 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55085 steps with 0 reset in 191 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 2879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(p1)||(!p0 U (p2||G(!p0)))))))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1564 transition count 1564
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1564 transition count 1564
Applied a total of 20 rules in 133 ms. Remains 1564 /1574 variables (removed 10) and now considering 1564/1574 (removed 10) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2024-05-29 20:52:42] [INFO ] Computed 161 invariants in 10 ms
[2024-05-29 20:52:42] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-29 20:52:42] [INFO ] Invariant cache hit.
[2024-05-29 20:52:44] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1606 ms to find 0 implicit places.
[2024-05-29 20:52:44] [INFO ] Invariant cache hit.
[2024-05-29 20:52:44] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1574 places, 1564/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2549 ms. Remains : 1564/1574 places, 1564/1574 transitions.
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (NEQ s1271 1) (NEQ s1488 1)), p0:(EQ s1271 1), p1:(EQ s369 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]]
Product exploration explored 100000 steps with 50000 reset in 886 ms.
Product exploration explored 100000 steps with 50000 reset in 899 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 4754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Found a Lengthening insensitive property : ShieldRVt-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1573 transition count 1139
Reduce places removed 434 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 435 rules applied. Total rules applied 869 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 870 place count 1138 transition count 1138
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 870 place count 1138 transition count 825
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1496 place count 825 transition count 825
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1505 place count 816 transition count 816
Iterating global reduction 3 with 9 rules applied. Total rules applied 1514 place count 816 transition count 816
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1514 place count 816 transition count 808
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1530 place count 808 transition count 808
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 2254 place count 446 transition count 446
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 446 transition count 445
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 445 transition count 444
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 2459 place count 344 transition count 542
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 2491 place count 328 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2493 place count 326 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2494 place count 325 transition count 556
Applied a total of 2494 rules in 156 ms. Remains 325 /1574 variables (removed 1249) and now considering 556/1574 (removed 1018) transitions.
// Phase 1: matrix 556 rows 325 cols
[2024-05-29 20:52:47] [INFO ] Computed 160 invariants in 2 ms
[2024-05-29 20:52:47] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-29 20:52:47] [INFO ] Invariant cache hit.
[2024-05-29 20:52:48] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2024-05-29 20:52:48] [INFO ] Invariant cache hit.
[2024-05-29 20:52:48] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 325/1574 places, 556/1574 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 959 ms. Remains : 325/1574 places, 556/1574 transitions.
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 s155 0), p0:(OR (EQ s320 1) (EQ s147 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 429 ms.
Stuttering criterion allowed to conclude after 82385 steps with 20 reset in 403 ms.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 2008 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-29 20:52:49] [INFO ] Flatten gal took : 30 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 394091 ms.

BK_STOP 1717015970147

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r373-tall-171683789800638"
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 ;