Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679309715216

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:55:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 10:55:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:55:17] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-20 10:55:17] [INFO ] Transformed 1503 places.
[2023-03-20 10:55:17] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:55:17] [INFO ] Found NUPN structural information;
[2023-03-20 10:55:17] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-030B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 317 places :
Symmetric choice reduction at 0 with 317 rule applications. Total rules 317 place count 1186 transition count 1186
Iterating global reduction 0 with 317 rules applied. Total rules applied 634 place count 1186 transition count 1186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 635 place count 1185 transition count 1185
Iterating global reduction 0 with 1 rules applied. Total rules applied 636 place count 1185 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 637 place count 1184 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 638 place count 1184 transition count 1184
Applied a total of 638 rules in 434 ms. Remains 1184 /1503 variables (removed 319) and now considering 1184/1503 (removed 319) transitions.
// Phase 1: matrix 1184 rows 1184 cols
[2023-03-20 10:55:17] [INFO ] Computed 121 place invariants in 45 ms
[2023-03-20 10:55:18] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-20 10:55:18] [INFO ] Invariant cache hit.
[2023-03-20 10:55:19] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2023-03-20 10:55:19] [INFO ] Invariant cache hit.
[2023-03-20 10:55:19] [INFO ] Dead Transitions using invariants and state equation in 593 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1184/1503 places, 1184/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2554 ms. Remains : 1184/1503 places, 1184/1503 transitions.
Support contains 38 out of 1184 places after structural reductions.
[2023-03-20 10:55:20] [INFO ] Flatten gal took : 94 ms
[2023-03-20 10:55:20] [INFO ] Flatten gal took : 49 ms
[2023-03-20 10:55:20] [INFO ] Input system was already deterministic with 1184 transitions.
Support contains 37 out of 1184 places (down from 38) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 35) seen :19
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-20 10:55:20] [INFO ] Invariant cache hit.
[2023-03-20 10:55:21] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-20 10:55:21] [INFO ] After 504ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-20 10:55:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-20 10:55:23] [INFO ] After 1321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-20 10:55:23] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 7 ms to minimize.
[2023-03-20 10:55:23] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 2 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 2 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1549 ms
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 0 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 1 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-03-20 10:55:27] [INFO ] After 5516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 939 ms.
[2023-03-20 10:55:28] [INFO ] After 7134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 463 ms.
Support contains 17 out of 1184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Drop transitions removed 321 transitions
Trivial Post-agglo rules discarded 321 transitions
Performed 321 trivial Post agglomeration. Transition count delta: 321
Iterating post reduction 0 with 321 rules applied. Total rules applied 321 place count 1184 transition count 863
Reduce places removed 321 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 322 rules applied. Total rules applied 643 place count 863 transition count 862
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 644 place count 862 transition count 862
Performed 230 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 230 Pre rules applied. Total rules applied 644 place count 862 transition count 632
Deduced a syphon composed of 230 places in 1 ms
Reduce places removed 230 places and 0 transitions.
Iterating global reduction 3 with 460 rules applied. Total rules applied 1104 place count 632 transition count 632
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1105 place count 631 transition count 631
Iterating global reduction 3 with 1 rules applied. Total rules applied 1106 place count 631 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1106 place count 631 transition count 630
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1108 place count 630 transition count 630
Performed 279 Post agglomeration using F-continuation condition.Transition count delta: 279
Deduced a syphon composed of 279 places in 1 ms
Reduce places removed 279 places and 0 transitions.
Iterating global reduction 3 with 558 rules applied. Total rules applied 1666 place count 351 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1667 place count 351 transition count 350
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 1669 place count 350 transition count 349
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -75
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 1839 place count 265 transition count 424
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1840 place count 265 transition count 423
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1842 place count 265 transition count 421
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1844 place count 263 transition count 421
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1845 place count 263 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1846 place count 262 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1847 place count 261 transition count 419
Applied a total of 1847 rules in 212 ms. Remains 261 /1184 variables (removed 923) and now considering 419/1184 (removed 765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 261/1184 places, 419/1184 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 419 rows 261 cols
[2023-03-20 10:55:30] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-20 10:55:30] [INFO ] [Real]Absence check using 120 positive place invariants in 15 ms returned sat
[2023-03-20 10:55:30] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 10:55:30] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-20 10:55:30] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 10:55:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 10:55:30] [INFO ] After 146ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-20 10:55:30] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2023-03-20 10:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-20 10:55:31] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-20 10:55:31] [INFO ] After 861ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 1 properties in 373 ms.
Support contains 12 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 419/419 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 261 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 260 transition count 418
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 256 transition count 418
Applied a total of 10 rules in 17 ms. Remains 256 /261 variables (removed 5) and now considering 418/419 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 256/261 places, 418/419 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) 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 10) 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 10) 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 10) 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 10) 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 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 130574 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 130574 steps, saw 85806 distinct states, run finished after 3003 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 418 rows 256 cols
[2023-03-20 10:55:35] [INFO ] Computed 120 place invariants in 6 ms
[2023-03-20 10:55:35] [INFO ] [Real]Absence check using 120 positive place invariants in 31 ms returned sat
[2023-03-20 10:55:35] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 10:55:35] [INFO ] [Nat]Absence check using 120 positive place invariants in 16 ms returned sat
[2023-03-20 10:55:35] [INFO ] After 182ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 10:55:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 10:55:35] [INFO ] After 97ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-20 10:55:36] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-20 10:55:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-20 10:55:36] [INFO ] After 459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-20 10:55:36] [INFO ] After 927ms 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 0 properties in 311 ms.
Support contains 12 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 418/418 transitions.
Applied a total of 0 rules in 16 ms. Remains 256 /256 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 256/256 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 418/418 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 10:55:36] [INFO ] Invariant cache hit.
[2023-03-20 10:55:36] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-20 10:55:36] [INFO ] Invariant cache hit.
[2023-03-20 10:55:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 10:55:37] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-20 10:55:37] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-20 10:55:37] [INFO ] Invariant cache hit.
[2023-03-20 10:55:37] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 256/256 places, 418/418 transitions.
Graph (trivial) has 106 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 853 edges and 254 vertex of which 252 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 103 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 248 transition count 409
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 102 edges and 246 vertex of which 6 / 246 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 243 transition count 400
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 100 edges and 240 vertex of which 8 / 240 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 236 transition count 389
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 96 edges and 232 vertex of which 8 / 232 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 228 transition count 375
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 92 edges and 224 vertex of which 8 / 224 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 220 transition count 361
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 88 edges and 216 vertex of which 8 / 216 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 212 transition count 347
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 84 edges and 208 vertex of which 8 / 208 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 204 transition count 333
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 80 edges and 200 vertex of which 8 / 200 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 196 transition count 319
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 76 edges and 192 vertex of which 8 / 192 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 188 transition count 305
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 72 edges and 184 vertex of which 8 / 184 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 180 transition count 291
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 68 edges and 176 vertex of which 8 / 176 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 172 transition count 277
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 64 edges and 168 vertex of which 6 / 168 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 17 rules applied. Total rules applied 204 place count 165 transition count 265
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 61 edges and 162 vertex of which 6 / 162 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 16 rules applied. Total rules applied 220 place count 159 transition count 253
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 59 edges and 156 vertex of which 6 / 156 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 235 place count 153 transition count 242
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 57 edges and 150 vertex of which 8 / 150 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 250 place count 146 transition count 231
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 448 edges and 142 vertex of which 136 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 50 edges and 136 vertex of which 8 / 136 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 21 rules applied. Total rules applied 271 place count 132 transition count 211
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 128 vertex of which 8 / 128 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 290 place count 124 transition count 197
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 120 vertex of which 8 / 120 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 309 place count 116 transition count 183
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 38 edges and 112 vertex of which 8 / 112 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 328 place count 108 transition count 169
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 34 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 347 place count 102 transition count 155
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 31 edges and 100 vertex of which 2 / 100 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 20 with 8 rules applied. Total rules applied 355 place count 99 transition count 150
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 21 with 5 rules applied. Total rules applied 360 place count 98 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 362 place count 97 transition count 145
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 23 with 7 rules applied. Total rules applied 369 place count 97 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 23 with 2 rules applied. Total rules applied 371 place count 97 transition count 138
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 23 with 1 rules applied. Total rules applied 372 place count 97 transition count 137
Applied a total of 372 rules in 62 ms. Remains 97 /256 variables (removed 159) and now considering 137/418 (removed 281) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 137 rows 97 cols
[2023-03-20 10:55:37] [INFO ] Computed 41 place invariants in 1 ms
[2023-03-20 10:55:37] [INFO ] [Real]Absence check using 41 positive place invariants in 5 ms returned sat
[2023-03-20 10:55:37] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 10:55:37] [INFO ] [Nat]Absence check using 41 positive place invariants in 5 ms returned sat
[2023-03-20 10:55:37] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 10:55:37] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-20 10:55:37] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 359 stabilizing places and 359 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))&&p0))||(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1171 transition count 1171
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1171 transition count 1171
Applied a total of 26 rules in 82 ms. Remains 1171 /1184 variables (removed 13) and now considering 1171/1184 (removed 13) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-20 10:55:38] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-20 10:55:38] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-20 10:55:38] [INFO ] Invariant cache hit.
[2023-03-20 10:55:39] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
[2023-03-20 10:55:39] [INFO ] Invariant cache hit.
[2023-03-20 10:55:40] [INFO ] Dead Transitions using invariants and state equation in 583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1184 places, 1171/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1918 ms. Remains : 1171/1184 places, 1171/1184 transitions.
Stuttering acceptance computed with spot in 346 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), false]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}]], initial=5, aps=[p0:(AND (EQ s154 1) (EQ s196 1) (EQ s222 1)), p2:(AND (NEQ s362 1) (EQ s154 1) (EQ s196 1) (EQ s222 1)), p1:(EQ s362 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]]
Product exploration explored 100000 steps with 1 reset in 526 ms.
Product exploration explored 100000 steps with 0 reset in 536 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 423 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 235645 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235645 steps, saw 104961 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:55:45] [INFO ] Invariant cache hit.
[2023-03-20 10:55:45] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-20 10:55:45] [INFO ] After 685ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:55:46] [INFO ] [Nat]Absence check using 121 positive place invariants in 39 ms returned sat
[2023-03-20 10:55:46] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:55:47] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 0 ms to minimize.
[2023-03-20 10:55:47] [INFO ] Deduced a trap composed of 27 places in 230 ms of which 1 ms to minimize.
[2023-03-20 10:55:47] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2023-03-20 10:55:47] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 0 ms to minimize.
[2023-03-20 10:55:48] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 0 ms to minimize.
[2023-03-20 10:55:48] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:55:48] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 1 ms to minimize.
[2023-03-20 10:55:48] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 1 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 0 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 0 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 0 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 1 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2023-03-20 10:55:49] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2023-03-20 10:55:50] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 0 ms to minimize.
[2023-03-20 10:55:50] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 1 ms to minimize.
[2023-03-20 10:55:50] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 0 ms to minimize.
[2023-03-20 10:55:50] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 0 ms to minimize.
[2023-03-20 10:55:50] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4084 ms
[2023-03-20 10:55:50] [INFO ] After 4799ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-20 10:55:51] [INFO ] After 5217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 844
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 844 transition count 844
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 654 place count 844 transition count 606
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1130 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1670 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1671 place count 336 transition count 335
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 1673 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1849 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1850 place count 247 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1851 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 245 transition count 418
Applied a total of 1852 rules in 92 ms. Remains 245 /1171 variables (removed 926) and now considering 418/1171 (removed 753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 245/1171 places, 418/1171 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 155 ms. (steps per millisecond=64 ) 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 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 97017 steps, run visited all 2 properties in 1015 ms. (steps per millisecond=95 )
Probabilistic random walk after 97017 steps, saw 59929 distinct states, run finished after 1017 ms. (steps per millisecond=95 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 457 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Applied a total of 0 rules in 43 ms. Remains 1171 /1171 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
[2023-03-20 10:55:53] [INFO ] Invariant cache hit.
[2023-03-20 10:55:53] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-20 10:55:53] [INFO ] Invariant cache hit.
[2023-03-20 10:55:54] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-20 10:55:54] [INFO ] Invariant cache hit.
[2023-03-20 10:55:55] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1902 ms. Remains : 1171/1171 places, 1171/1171 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 225051 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 225051 steps, saw 101120 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:55:58] [INFO ] Invariant cache hit.
[2023-03-20 10:55:58] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-20 10:55:59] [INFO ] After 713ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:55:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-20 10:55:59] [INFO ] After 443ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:56:00] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 1 ms to minimize.
[2023-03-20 10:56:00] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 2 ms to minimize.
[2023-03-20 10:56:00] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 37 places in 233 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 0 ms to minimize.
[2023-03-20 10:56:02] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 0 ms to minimize.
[2023-03-20 10:56:02] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:56:02] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 1 ms to minimize.
[2023-03-20 10:56:02] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 0 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 1 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 1 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 0 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 1 ms to minimize.
[2023-03-20 10:56:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3907 ms
[2023-03-20 10:56:03] [INFO ] After 4445ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 10:56:04] [INFO ] After 4757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 844
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 844 transition count 844
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 238 Pre rules applied. Total rules applied 654 place count 844 transition count 606
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 2 with 476 rules applied. Total rules applied 1130 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1670 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1671 place count 336 transition count 335
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 1673 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1849 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1850 place count 247 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1851 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 245 transition count 418
Applied a total of 1852 rules in 127 ms. Remains 245 /1171 variables (removed 926) and now considering 418/1171 (removed 753) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 245/1171 places, 418/1171 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 97017 steps, run visited all 2 properties in 1039 ms. (steps per millisecond=93 )
Probabilistic random walk after 97017 steps, saw 59929 distinct states, run finished after 1039 ms. (steps per millisecond=93 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 1 reset in 432 ms.
Product exploration explored 100000 steps with 3 reset in 506 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 79 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1171 transition count 1171
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 327 place count 1171 transition count 1289
Deduced a syphon composed of 446 places in 1 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 446 place count 1171 transition count 1289
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 359 rules applied. Total rules applied 805 place count 1171 transition count 1289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1171 transition count 1288
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 2 with 239 rule applications. Total rules 1045 place count 932 transition count 1049
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 239 rules applied. Total rules applied 1284 place count 932 transition count 1049
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1285 place count 932 transition count 1049
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1287 place count 930 transition count 1047
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1289 place count 930 transition count 1047
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -712
Deduced a syphon composed of 666 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1390 place count 930 transition count 1759
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1491 place count 829 transition count 1557
Deduced a syphon composed of 565 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1592 place count 829 transition count 1557
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 582 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1609 place count 829 transition count 1680
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1626 place count 812 transition count 1646
Deduced a syphon composed of 565 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1643 place count 812 transition count 1646
Deduced a syphon composed of 565 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 1646 place count 812 transition count 1643
Deduced a syphon composed of 565 places in 0 ms
Applied a total of 1646 rules in 602 ms. Remains 812 /1171 variables (removed 359) and now considering 1643/1171 (removed -472) transitions.
[2023-03-20 10:56:07] [INFO ] Redundant transitions in 78 ms returned []
// Phase 1: matrix 1643 rows 812 cols
[2023-03-20 10:56:07] [INFO ] Computed 121 place invariants in 21 ms
[2023-03-20 10:56:08] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/1171 places, 1643/1171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1568 ms. Remains : 812/1171 places, 1643/1171 transitions.
Support contains 4 out of 1171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1171/1171 places, 1171/1171 transitions.
Applied a total of 0 rules in 32 ms. Remains 1171 /1171 variables (removed 0) and now considering 1171/1171 (removed 0) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-20 10:56:08] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-20 10:56:09] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-20 10:56:09] [INFO ] Invariant cache hit.
[2023-03-20 10:56:09] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2023-03-20 10:56:09] [INFO ] Invariant cache hit.
[2023-03-20 10:56:10] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1738 ms. Remains : 1171/1171 places, 1171/1171 transitions.
Treatment of property ShieldRVt-PT-030B-LTLFireability-00 finished in 32459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 654 place count 856 transition count 621
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1124 place count 621 transition count 621
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1133 place count 612 transition count 612
Iterating global reduction 2 with 9 rules applied. Total rules applied 1142 place count 612 transition count 612
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 612 transition count 604
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 604 transition count 604
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 2 with 538 rules applied. Total rules applied 1696 place count 335 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1697 place count 335 transition count 334
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 1699 place count 334 transition count 333
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1877 place count 245 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 242 transition count 419
Applied a total of 1880 rules in 157 ms. Remains 242 /1184 variables (removed 942) and now considering 419/1184 (removed 765) transitions.
// Phase 1: matrix 419 rows 242 cols
[2023-03-20 10:56:10] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:56:12] [INFO ] Implicit Places using invariants in 1285 ms returned []
[2023-03-20 10:56:12] [INFO ] Invariant cache hit.
[2023-03-20 10:56:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 10:56:12] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-20 10:56:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:12] [INFO ] Invariant cache hit.
[2023-03-20 10:56:12] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 419/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1976 ms. Remains : 242/1184 places, 419/1184 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-01 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:(NEQ s217 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 5 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-01 finished in 2050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(X(p1)||F(p2)))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1173 transition count 1173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1173 transition count 1173
Applied a total of 22 rules in 81 ms. Remains 1173 /1184 variables (removed 11) and now considering 1173/1184 (removed 11) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:56:12] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 10:56:13] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-20 10:56:13] [INFO ] Invariant cache hit.
[2023-03-20 10:56:13] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-20 10:56:14] [INFO ] Invariant cache hit.
[2023-03-20 10:56:14] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1184 places, 1173/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1983 ms. Remains : 1173/1184 places, 1173/1184 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=5 dest: 0}, { cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(EQ s1160 0), p2:(EQ s337 0), p1:(EQ s919 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 294 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-02 finished in 2183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1183 transition count 855
Reduce places removed 328 places and 0 transitions.
Iterating post reduction 1 with 328 rules applied. Total rules applied 656 place count 855 transition count 855
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 656 place count 855 transition count 621
Deduced a syphon composed of 234 places in 0 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1124 place count 621 transition count 621
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1133 place count 612 transition count 612
Iterating global reduction 2 with 9 rules applied. Total rules applied 1142 place count 612 transition count 612
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1142 place count 612 transition count 604
Deduced a syphon composed of 8 places in 18 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1158 place count 604 transition count 604
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1698 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1699 place count 334 transition count 333
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 1701 place count 333 transition count 332
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1879 place count 244 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1880 place count 243 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1881 place count 242 transition count 419
Applied a total of 1881 rules in 161 ms. Remains 242 /1184 variables (removed 942) and now considering 419/1184 (removed 765) transitions.
// Phase 1: matrix 419 rows 242 cols
[2023-03-20 10:56:14] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:56:15] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-20 10:56:15] [INFO ] Invariant cache hit.
[2023-03-20 10:56:15] [INFO ] State equation strengthened by 290 read => feed constraints.
[2023-03-20 10:56:16] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2023-03-20 10:56:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:16] [INFO ] Invariant cache hit.
[2023-03-20 10:56:16] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 419/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1451 ms. Remains : 242/1184 places, 419/1184 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-04 finished in 1496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&F(G(p1))))||(p0&&F(p2)))))'
Support contains 2 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 654 place count 856 transition count 622
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1130 place count 614 transition count 614
Iterating global reduction 2 with 8 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1154 place count 606 transition count 606
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 0 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1694 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1695 place count 336 transition count 335
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 1697 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1875 place count 246 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1877 place count 244 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1878 place count 243 transition count 420
Applied a total of 1878 rules in 89 ms. Remains 243 /1184 variables (removed 941) and now considering 420/1184 (removed 764) transitions.
// Phase 1: matrix 420 rows 243 cols
[2023-03-20 10:56:16] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:56:16] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-20 10:56:16] [INFO ] Invariant cache hit.
[2023-03-20 10:56:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 10:56:16] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-20 10:56:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:16] [INFO ] Invariant cache hit.
[2023-03-20 10:56:17] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/1184 places, 420/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 794 ms. Remains : 243/1184 places, 420/1184 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s64 1), p1:(EQ s64 0), p2:(EQ s214 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-05 finished in 1003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1183 transition count 856
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 654 place count 856 transition count 623
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1120 place count 623 transition count 623
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1129 place count 614 transition count 614
Iterating global reduction 2 with 9 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1154 place count 606 transition count 606
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 0 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 2 with 544 rules applied. Total rules applied 1698 place count 334 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1699 place count 334 transition count 333
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 1701 place count 333 transition count 332
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1877 place count 245 transition count 418
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1879 place count 243 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1880 place count 242 transition count 416
Applied a total of 1880 rules in 83 ms. Remains 242 /1184 variables (removed 942) and now considering 416/1184 (removed 768) transitions.
// Phase 1: matrix 416 rows 242 cols
[2023-03-20 10:56:17] [INFO ] Computed 120 place invariants in 4 ms
[2023-03-20 10:56:17] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-20 10:56:17] [INFO ] Invariant cache hit.
[2023-03-20 10:56:17] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-20 10:56:17] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:17] [INFO ] Invariant cache hit.
[2023-03-20 10:56:18] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 242/1184 places, 416/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 242/1184 places, 416/1184 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s217 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-07 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((X(p0) U G(p1)) U !p0)))))'
Support contains 2 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1171 transition count 1171
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1171 transition count 1171
Applied a total of 26 rules in 70 ms. Remains 1171 /1184 variables (removed 13) and now considering 1171/1184 (removed 13) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-20 10:56:18] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:18] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-20 10:56:18] [INFO ] Invariant cache hit.
[2023-03-20 10:56:19] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
[2023-03-20 10:56:19] [INFO ] Invariant cache hit.
[2023-03-20 10:56:19] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1184 places, 1171/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1594 ms. Remains : 1171/1184 places, 1171/1184 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), p0, (OR (NOT p1) p0), p0, true, p0, p0, true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 7}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p1:(EQ s867 1), p0:(NEQ s671 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 175 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-08 finished in 1828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U (!p0&&G(p1)&&X(F(p2))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 69 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-20 10:56:20] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:20] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-20 10:56:20] [INFO ] Invariant cache hit.
[2023-03-20 10:56:21] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-20 10:56:21] [INFO ] Invariant cache hit.
[2023-03-20 10:56:21] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1587 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0), (NOT p0), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s824 1), p1:(NEQ s723 1), p2:(EQ s820 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 402 ms.
Stack based approach found an accepted trace after 23472 steps with 0 reset with depth 23473 and stack size 21263 in 115 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-09 finished in 2317 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 325 transitions
Trivial Post-agglo rules discarded 325 transitions
Performed 325 trivial Post agglomeration. Transition count delta: 325
Iterating post reduction 0 with 325 rules applied. Total rules applied 325 place count 1183 transition count 858
Reduce places removed 325 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 327 rules applied. Total rules applied 652 place count 858 transition count 856
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 654 place count 856 transition count 623
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1120 place count 623 transition count 623
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1129 place count 614 transition count 614
Iterating global reduction 3 with 9 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1138 place count 614 transition count 606
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1154 place count 606 transition count 606
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1690 place count 338 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1691 place count 338 transition count 337
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 1693 place count 337 transition count 336
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1869 place count 249 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1871 place count 247 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1872 place count 246 transition count 420
Applied a total of 1872 rules in 105 ms. Remains 246 /1184 variables (removed 938) and now considering 420/1184 (removed 764) transitions.
// Phase 1: matrix 420 rows 246 cols
[2023-03-20 10:56:22] [INFO ] Computed 120 place invariants in 0 ms
[2023-03-20 10:56:22] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-20 10:56:22] [INFO ] Invariant cache hit.
[2023-03-20 10:56:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 10:56:22] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-20 10:56:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:22] [INFO ] Invariant cache hit.
[2023-03-20 10:56:23] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 246/1184 places, 420/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 778 ms. Remains : 246/1184 places, 420/1184 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s79 1) (EQ s47 1)), p0:(EQ s185 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-10 finished in 853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(F(p1))||(F(p1)&&G(F(p2))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1173 transition count 1173
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1173 transition count 1173
Applied a total of 22 rules in 66 ms. Remains 1173 /1184 variables (removed 11) and now considering 1173/1184 (removed 11) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:56:23] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:23] [INFO ] Implicit Places using invariants in 254 ms returned []
[2023-03-20 10:56:23] [INFO ] Invariant cache hit.
[2023-03-20 10:56:24] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-20 10:56:24] [INFO ] Invariant cache hit.
[2023-03-20 10:56:24] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1184 places, 1173/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 1173/1184 places, 1173/1184 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s289 1), p0:(EQ s778 1), p2:(EQ s285 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-11 finished in 1878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(G(p1))&&(p2||G(p3)))))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1183 transition count 857
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 857 transition count 856
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 856 transition count 856
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 654 place count 856 transition count 622
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1128 place count 616 transition count 616
Iterating global reduction 3 with 6 rules applied. Total rules applied 1134 place count 616 transition count 616
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1134 place count 616 transition count 611
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1144 place count 611 transition count 611
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 0 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 3 with 548 rules applied. Total rules applied 1692 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1693 place count 337 transition count 336
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 1695 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1871 place count 248 transition count 419
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1873 place count 246 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1874 place count 245 transition count 417
Applied a total of 1874 rules in 75 ms. Remains 245 /1184 variables (removed 939) and now considering 417/1184 (removed 767) transitions.
// Phase 1: matrix 417 rows 245 cols
[2023-03-20 10:56:25] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-20 10:56:25] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-20 10:56:25] [INFO ] Invariant cache hit.
[2023-03-20 10:56:25] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-20 10:56:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:56:25] [INFO ] Invariant cache hit.
[2023-03-20 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1184 places, 417/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 739 ms. Remains : 245/1184 places, 417/1184 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 2}, { cond=(OR p2 p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p3 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s156 1), p3:(NEQ s4 1), p0:(EQ s59 1), p1:(NEQ s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18733 steps with 3 reset in 91 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-12 finished in 1032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(p0))&&F((p1 U (p2||G(p1))))) U !p0))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1183 transition count 857
Reduce places removed 326 places and 0 transitions.
Iterating post reduction 1 with 326 rules applied. Total rules applied 652 place count 857 transition count 857
Performed 235 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 235 Pre rules applied. Total rules applied 652 place count 857 transition count 622
Deduced a syphon composed of 235 places in 1 ms
Reduce places removed 235 places and 0 transitions.
Iterating global reduction 2 with 470 rules applied. Total rules applied 1122 place count 622 transition count 622
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1130 place count 614 transition count 614
Iterating global reduction 2 with 8 rules applied. Total rules applied 1138 place count 614 transition count 614
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1138 place count 614 transition count 607
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1152 place count 607 transition count 607
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 0 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 2 with 540 rules applied. Total rules applied 1692 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1693 place count 337 transition count 336
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 1695 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1871 place count 248 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1873 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1874 place count 245 transition count 418
Applied a total of 1874 rules in 68 ms. Remains 245 /1184 variables (removed 939) and now considering 418/1184 (removed 766) transitions.
// Phase 1: matrix 418 rows 245 cols
[2023-03-20 10:56:26] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-20 10:56:26] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 10:56:26] [INFO ] Invariant cache hit.
[2023-03-20 10:56:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 10:56:26] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-20 10:56:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 10:56:26] [INFO ] Invariant cache hit.
[2023-03-20 10:56:26] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1184 places, 418/1184 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 664 ms. Remains : 245/1184 places, 418/1184 transitions.
Stuttering acceptance computed with spot in 97 ms :[p0, (NOT p0), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s41 1), p2:(AND (NEQ s174 1) (NEQ s186 1)), p1:(NEQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-13 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(G(p1))) U p2))'
Support contains 4 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 77 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-20 10:56:26] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:27] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-20 10:56:27] [INFO ] Invariant cache hit.
[2023-03-20 10:56:27] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2023-03-20 10:56:27] [INFO ] Invariant cache hit.
[2023-03-20 10:56:28] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1562 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s439 1) (EQ s728 1) (EQ s1057 1)), p0:(EQ s1057 1), p1:(NEQ s631 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 8763 steps with 1 reset in 35 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-14 finished in 1699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((p1&&G(p2)))))))'
Support contains 3 out of 1184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1184/1184 places, 1184/1184 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1172 transition count 1172
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1172 transition count 1172
Applied a total of 24 rules in 69 ms. Remains 1172 /1184 variables (removed 12) and now considering 1172/1184 (removed 12) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-20 10:56:28] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:56:28] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-20 10:56:28] [INFO ] Invariant cache hit.
[2023-03-20 10:56:29] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-20 10:56:29] [INFO ] Invariant cache hit.
[2023-03-20 10:56:30] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1184 places, 1172/1184 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1568 ms. Remains : 1172/1184 places, 1172/1184 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(EQ s389 0), p2:(EQ s481 1), p1:(EQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLFireability-15 finished in 1766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(G(p1))&&p0))||(!p1 U (p2||G(!p1)))))'
[2023-03-20 10:56:30] [INFO ] Flatten gal took : 85 ms
[2023-03-20 10:56:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 10:56:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1184 places, 1184 transitions and 2908 arcs took 22 ms.
Total runtime 73686 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1379/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-030B-LTLFireability-00

BK_STOP 1679309791371

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-030B-LTLFireability-00
ltl formula formula --ltl=/tmp/1379/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1184 places, 1184 transitions and 2908 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.150 real 0.030 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1379/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1379/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1379/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1379/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "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 ;