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-167905977700100.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 ShieldRVs-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977700100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.0K Feb 26 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 127K 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 ShieldRVs-PT-020A-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679297969676

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=ShieldRVs-PT-020A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:39:31] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-20 07:39:31] [INFO ] Transformed 283 places.
[2023-03-20 07:39:31] [INFO ] Transformed 383 transitions.
[2023-03-20 07:39:31] [INFO ] Found NUPN structural information;
[2023-03-20 07:39:31] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-020A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 28 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:39:31] [INFO ] Computed 81 place invariants in 13 ms
[2023-03-20 07:39:31] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-20 07:39:31] [INFO ] Invariant cache hit.
[2023-03-20 07:39:32] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-20 07:39:32] [INFO ] Invariant cache hit.
[2023-03-20 07:39:32] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 857 ms. Remains : 283/283 places, 383/383 transitions.
Support contains 74 out of 283 places after structural reductions.
[2023-03-20 07:39:32] [INFO ] Flatten gal took : 74 ms
[2023-03-20 07:39:32] [INFO ] Flatten gal took : 41 ms
[2023-03-20 07:39:32] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 36 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 34) seen :30
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 07:39:33] [INFO ] Invariant cache hit.
[2023-03-20 07:39:33] [INFO ] [Real]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-20 07:39:33] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-20 07:39:33] [INFO ] [Nat]Absence check using 81 positive place invariants in 23 ms returned sat
[2023-03-20 07:39:34] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 5 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2023-03-20 07:39:34] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:35] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-20 07:39:36] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 1 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 11 places in 407 ms of which 4 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2023-03-20 07:39:37] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 3 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2023-03-20 07:39:38] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 6 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2023-03-20 07:39:39] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:40] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2023-03-20 07:39:41] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:39:42] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:39:43] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:39:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2023-03-20 07:39:45] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:39:46] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2023-03-20 07:39:47] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 0 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:39:48] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2023-03-20 07:39:49] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-20 07:39:50] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-20 07:39:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2023-03-20 07:39:52] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2023-03-20 07:39:53] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2023-03-20 07:39:53] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-20 07:39:53] [INFO ] Trap strengthening (SAT) tested/added 233/232 trap constraints in 19045 ms
[2023-03-20 07:39:53] [INFO ] After 19323ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-20 07:39:53] [INFO ] After 19505ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 44 place count 282 transition count 382
Applied a total of 44 rules in 74 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 282/283 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished Best-First random walk after 964 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=321 )
FORMULA ShieldRVs-PT-020A-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA ShieldRVs-PT-020A-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 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' '!((p0 U X(G(p0))))'
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 24 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:39:53] [INFO ] Invariant cache hit.
[2023-03-20 07:39:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-20 07:39:53] [INFO ] Invariant cache hit.
[2023-03-20 07:39:54] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-20 07:39:54] [INFO ] Invariant cache hit.
[2023-03-20 07:39:54] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-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: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s32 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-00 finished in 896 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((X(!p0) U (p1||F(p2))))))'
Support contains 9 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 20 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:39:54] [INFO ] Invariant cache hit.
[2023-03-20 07:39:54] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-20 07:39:54] [INFO ] Invariant cache hit.
[2023-03-20 07:39:55] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2023-03-20 07:39:55] [INFO ] Invariant cache hit.
[2023-03-20 07:39:55] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s89 1) (EQ s91 1) (EQ s96 1)), p2:(AND (EQ s257 1) (EQ s259 1) (EQ s263 1)), p0:(AND (EQ s20 1) (EQ s21 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 299 steps with 1 reset in 5 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-01 finished in 834 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||F(p1)||G(p2)))))'
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:39:55] [INFO ] Invariant cache hit.
[2023-03-20 07:39:55] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-20 07:39:55] [INFO ] Invariant cache hit.
[2023-03-20 07:39:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-20 07:39:55] [INFO ] Invariant cache hit.
[2023-03-20 07:39:56] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s7 1) (EQ s11 1) (EQ s152 1) (EQ s154 1) (EQ s163 1)), p1:(OR (EQ s31 0) (EQ s48 0) (EQ s57 0)), p2:(AND (EQ s143 1) (EQ s158 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 368 reset in 421 ms.
Product exploration explored 100000 steps with 367 reset in 380 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:58] [INFO ] Invariant cache hit.
[2023-03-20 07:39:58] [INFO ] [Real]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:39:58] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:39:58] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:58] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:39:58] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-20 07:39:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-20 07:39:58] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 07:39:58] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 41 place count 282 transition count 382
Applied a total of 41 rules in 61 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 282/283 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 774449 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 774449 steps, saw 143920 distinct states, run finished after 3002 ms. (steps per millisecond=257 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:01] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 07:40:01] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 07:40:02] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 07:40:02] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:40:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 398 ms
[2023-03-20 07:40:02] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-20 07:40:02] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 27 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 282/282 places, 382/382 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 12 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:40:02] [INFO ] Invariant cache hit.
[2023-03-20 07:40:02] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-20 07:40:02] [INFO ] Invariant cache hit.
[2023-03-20 07:40:03] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-20 07:40:03] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 07:40:03] [INFO ] Invariant cache hit.
[2023-03-20 07:40:03] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 07:40:03] [INFO ] Invariant cache hit.
[2023-03-20 07:40:03] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 07:40:03] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:03] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 07:40:03] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:03] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 2 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:40:04] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-20 07:40:05] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1892 ms
[2023-03-20 07:40:05] [INFO ] After 2087ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-20 07:40:05] [INFO ] After 2196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 608 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 5 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:40:06] [INFO ] Computed 81 place invariants in 5 ms
[2023-03-20 07:40:06] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-20 07:40:06] [INFO ] Invariant cache hit.
[2023-03-20 07:40:07] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-20 07:40:07] [INFO ] Invariant cache hit.
[2023-03-20 07:40:07] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 283/283 places, 383/383 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 336 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Finished Best-First random walk after 1807 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=602 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 370 reset in 413 ms.
Product exploration explored 100000 steps with 369 reset in 401 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 45 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:10] [INFO ] Redundant transitions in 71 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 382 rows 283 cols
[2023-03-20 07:40:10] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:10] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/283 places, 382/383 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 12 ms. Remains 283 /283 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 283/283 places, 382/383 transitions.
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:40:10] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:10] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-20 07:40:10] [INFO ] Invariant cache hit.
[2023-03-20 07:40:10] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-20 07:40:10] [INFO ] Invariant cache hit.
[2023-03-20 07:40:11] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 283/283 places, 383/383 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-02 finished in 15708 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&&G(p1)))))'
Support contains 10 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:11] [INFO ] Invariant cache hit.
[2023-03-20 07:40:11] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-20 07:40:11] [INFO ] Invariant cache hit.
[2023-03-20 07:40:11] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-20 07:40:11] [INFO ] Invariant cache hit.
[2023-03-20 07:40:11] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s234 1), p1:(AND (EQ s131 1) (EQ s133 1) (EQ s138 1) (EQ s206 1) (EQ s210 1) (EQ s219 1) (EQ s12 1) (EQ s16 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 311 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-03 finished in 707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(G(!p0))||(F(!p2)&&p1))))'
Support contains 4 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 22 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:11] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 07:40:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-20 07:40:11] [INFO ] Invariant cache hit.
[2023-03-20 07:40:12] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2023-03-20 07:40:12] [INFO ] Redundant transitions in 86 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2023-03-20 07:40:12] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:12] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 703 ms. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, p2, (AND p2 p0), p0, (AND p2 p0), (OR (AND p0 (NOT p1)) (AND p0 p2))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 p2 p0), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=5, aps=[p2:(AND (EQ s118 1) (EQ s119 1) (EQ s124 1)), p0:(EQ s74 1), p1:(AND (EQ s118 1) (EQ s119 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 203 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-05 finished in 886 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(G(p1))&&p0)))'
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:40:12] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:12] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-20 07:40:12] [INFO ] Invariant cache hit.
[2023-03-20 07:40:13] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-20 07:40:13] [INFO ] Invariant cache hit.
[2023-03-20 07:40:13] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s33 0) (EQ s35 0) (EQ s40 0)) (OR (EQ s8 0) (EQ s13 0))), p1:(OR (AND (EQ s33 1) (EQ s35 1) (EQ s40 1)) (NEQ s8 1) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 361 reset in 386 ms.
Product exploration explored 100000 steps with 360 reset in 354 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Finished random walk after 216 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=216 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Support contains 5 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 12 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:14] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:14] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-20 07:40:14] [INFO ] Invariant cache hit.
[2023-03-20 07:40:14] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-20 07:40:15] [INFO ] Redundant transitions in 85 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2023-03-20 07:40:15] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 07:40:15] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 673 ms. Remains : 282/283 places, 381/383 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Finished random walk after 260 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=130 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Product exploration explored 100000 steps with 365 reset in 386 ms.
Product exploration explored 100000 steps with 363 reset in 428 ms.
Support contains 5 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 381/381 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2023-03-20 07:40:16] [INFO ] Invariant cache hit.
[2023-03-20 07:40:16] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-20 07:40:16] [INFO ] Invariant cache hit.
[2023-03-20 07:40:16] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-20 07:40:16] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-20 07:40:16] [INFO ] Invariant cache hit.
[2023-03-20 07:40:17] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 747 ms. Remains : 282/282 places, 381/381 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-06 finished in 4363 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(p1) U p2)&&F(p3)&&p0)))'
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-20 07:40:17] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 07:40:17] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-20 07:40:17] [INFO ] Invariant cache hit.
[2023-03-20 07:40:17] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-20 07:40:17] [INFO ] Invariant cache hit.
[2023-03-20 07:40:17] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 673 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(OR (AND p0 p2 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s20 1) (EQ s30 1)), p2:(AND (EQ s2 1) (EQ s4 1) (EQ s15 1)), p1:(AND (EQ s59 1) (EQ s74 1) (EQ s85 1)), p3:(OR (EQ s208 0) (EQ s210 ...], 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 ShieldRVs-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-07 finished in 938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:18] [INFO ] Invariant cache hit.
[2023-03-20 07:40:18] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 07:40:18] [INFO ] Invariant cache hit.
[2023-03-20 07:40:18] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-20 07:40:18] [INFO ] Invariant cache hit.
[2023-03-20 07:40:18] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s7 0) (EQ s11 0)), p1:(OR (EQ s40 0) (EQ s44 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33187 reset in 638 ms.
Product exploration explored 100000 steps with 33559 reset in 682 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :2
Finished Best-First random walk after 1924 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=384 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:21] [INFO ] Invariant cache hit.
[2023-03-20 07:40:21] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-20 07:40:21] [INFO ] Invariant cache hit.
[2023-03-20 07:40:21] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-20 07:40:21] [INFO ] Invariant cache hit.
[2023-03-20 07:40:21] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 283/283 places, 383/383 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 190 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 8523 steps, including 30 resets, run visited all 3 properties in 76 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33276 reset in 633 ms.
Product exploration explored 100000 steps with 33347 reset in 600 ms.
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 283/283 places, 383/383 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-08 finished in 6785 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(p2)&&p1)) U !X((p0 U p3))))'
Support contains 7 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:25] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-20 07:40:25] [INFO ] Invariant cache hit.
[2023-03-20 07:40:25] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 314 ms :[p3, (AND p0 p3), p3, (AND (NOT p2) p0 p3), true, p0, p3, (NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p3)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p3), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p1) p3)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2) p0) (AND p1 (NOT p2) p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0 p3), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=p3, acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p3), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (EQ s143 1) (EQ s158 1) (EQ s169 1)), p2:(EQ s99 1), p0:(AND (EQ s38 1) (EQ s42 1) (EQ s51 1)), p3:(AND (EQ s143 1) (EQ s158 1) (EQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 822 ms.
Product exploration explored 100000 steps with 50000 reset in 732 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) p0 p3))), (X (NOT (AND p0 p3))), (X (NOT (OR (AND p1 (NOT p2) p0) (AND p1 (NOT p2) p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) (NOT p0) p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (OR (AND p1 (NOT p2) p0) (AND p1 (NOT p2) p3))))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p1) p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))
Knowledge based reduction with 25 factoid took 724 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-020A-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020A-LTLFireability-09 finished in 3256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((X(p0) U X(p1))||X((F(X(p0))||p1))) U p0))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:28] [INFO ] Invariant cache hit.
[2023-03-20 07:40:28] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 07:40:28] [INFO ] Invariant cache hit.
[2023-03-20 07:40:28] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2023-03-20 07:40:28] [INFO ] Invariant cache hit.
[2023-03-20 07:40:28] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), true, (OR p1 p0), p0, true]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s208 1) (EQ s212 1) (EQ s219 1)), p1:(AND (EQ s124 1) (EQ s126 1) (EQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-11 finished in 746 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))||F(p2))))'
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:28] [INFO ] Invariant cache hit.
[2023-03-20 07:40:28] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 07:40:28] [INFO ] Invariant cache hit.
[2023-03-20 07:40:29] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-20 07:40:29] [INFO ] Invariant cache hit.
[2023-03-20 07:40:29] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (EQ s234 0) (EQ s238 0) (EQ s247 0)), p0:(AND (EQ s262 1) (EQ s266 1) (EQ s275 1)), p1:(AND (EQ s234 1) (EQ s238 1) (EQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 721 ms.
Product exploration explored 100000 steps with 50000 reset in 729 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-020A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-020A-LTLFireability-12 finished in 2369 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)))'
Support contains 3 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-20 07:40:31] [INFO ] Invariant cache hit.
[2023-03-20 07:40:31] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-20 07:40:31] [INFO ] Invariant cache hit.
[2023-03-20 07:40:31] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-20 07:40:31] [INFO ] Invariant cache hit.
[2023-03-20 07:40:31] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 702 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s14 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-13 finished in 781 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 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 17 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:31] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 07:40:32] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 07:40:32] [INFO ] Invariant cache hit.
[2023-03-20 07:40:32] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-20 07:40:32] [INFO ] Redundant transitions in 96 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2023-03-20 07:40:32] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:32] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/283 places, 381/383 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 771 ms. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s131 1) (EQ s133 1) (EQ s138 1) (EQ s229 1) (EQ s231 1) (EQ s235 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 260 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-15 finished in 822 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||F(p1)||G(p2)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-020A-LTLFireability-02
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 12 out of 283 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 17 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:33] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 07:40:33] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 07:40:33] [INFO ] Invariant cache hit.
[2023-03-20 07:40:33] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-20 07:40:33] [INFO ] Invariant cache hit.
[2023-03-20 07:40:33] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 282/283 places, 382/383 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 690 ms. Remains : 282/283 places, 382/383 transitions.
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s5 1) (EQ s7 1) (EQ s11 1) (EQ s152 1) (EQ s154 1) (EQ s163 1)), p1:(OR (EQ s31 0) (EQ s48 0) (EQ s57 0)), p2:(AND (EQ s143 1) (EQ s158 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 370 reset in 338 ms.
Product exploration explored 100000 steps with 370 reset in 365 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 279 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Finished Best-First random walk after 6027 steps, including 2 resets, run visited all 1 properties in 13 ms. (steps per millisecond=463 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 2 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:40:35] [INFO ] Invariant cache hit.
[2023-03-20 07:40:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-20 07:40:35] [INFO ] Invariant cache hit.
[2023-03-20 07:40:36] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-20 07:40:36] [INFO ] Invariant cache hit.
[2023-03-20 07:40:36] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 282/282 places, 382/382 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:40:37] [INFO ] Invariant cache hit.
[2023-03-20 07:40:37] [INFO ] [Real]Absence check using 81 positive place invariants in 15 ms returned sat
[2023-03-20 07:40:37] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:37] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 07:40:37] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-20 07:40:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2023-03-20 07:40:38] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-20 07:40:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 448 ms
[2023-03-20 07:40:38] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-20 07:40:38] [INFO ] After 762ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 382/382 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 282 transition count 382
Applied a total of 39 rules in 18 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 282/282 places, 382/382 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 6325 steps, including 3 resets, run visited all 1 properties in 11 ms. (steps per millisecond=575 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p2 (NOT p1)))]
Knowledge based reduction with 9 factoid took 497 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Product exploration explored 100000 steps with 368 reset in 309 ms.
Product exploration explored 100000 steps with 370 reset in 338 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p0 (NOT p2))]
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:40:40] [INFO ] Redundant transitions in 96 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 381 rows 282 cols
[2023-03-20 07:40:40] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 07:40:40] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/282 places, 381/382 transitions.
Applied a total of 0 rules in 6 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 282/282 places, 381/382 transitions.
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 2 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-20 07:40:40] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 07:40:40] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-20 07:40:40] [INFO ] Invariant cache hit.
[2023-03-20 07:40:40] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-20 07:40:40] [INFO ] Invariant cache hit.
[2023-03-20 07:40:41] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 282/282 places, 382/382 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-02 finished in 8506 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(G(p1))&&p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p1)))))'
Found a Shortening insensitive property : ShieldRVs-PT-020A-LTLFireability-08
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 283 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 283/283 places, 383/383 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 382
Applied a total of 2 rules in 12 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
[2023-03-20 07:40:41] [INFO ] Invariant cache hit.
[2023-03-20 07:40:41] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-20 07:40:41] [INFO ] Invariant cache hit.
[2023-03-20 07:40:41] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2023-03-20 07:40:41] [INFO ] Invariant cache hit.
[2023-03-20 07:40:42] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 282/283 places, 382/383 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 606 ms. Remains : 282/283 places, 382/383 transitions.
Running random walk in product with property : ShieldRVs-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s7 0) (EQ s11 0)), p1:(OR (EQ s40 0) (EQ s44 0) (EQ s51 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33422 reset in 660 ms.
Product exploration explored 100000 steps with 33358 reset in 598 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 36 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :2
Finished Best-First random walk after 1829 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=457 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 2 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:40:44] [INFO ] Invariant cache hit.
[2023-03-20 07:40:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 07:40:44] [INFO ] Invariant cache hit.
[2023-03-20 07:40:44] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-20 07:40:44] [INFO ] Invariant cache hit.
[2023-03-20 07:40:45] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 282/282 places, 382/382 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 194 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 7674 steps, including 27 resets, run visited all 3 properties in 35 ms. (steps per millisecond=219 )
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33153 reset in 561 ms.
Product exploration explored 100000 steps with 33358 reset in 573 ms.
Support contains 6 out of 282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 282/282 places, 382/382 transitions.
Applied a total of 0 rules in 5 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-20 07:40:47] [INFO ] Invariant cache hit.
[2023-03-20 07:40:47] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-20 07:40:47] [INFO ] Invariant cache hit.
[2023-03-20 07:40:47] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-20 07:40:47] [INFO ] Invariant cache hit.
[2023-03-20 07:40:48] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 777 ms. Remains : 282/282 places, 382/382 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-08 finished in 6765 ms.
[2023-03-20 07:40:48] [INFO ] Flatten gal took : 27 ms
[2023-03-20 07:40:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 07:40:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 283 places, 383 transitions and 1840 arcs took 4 ms.
Total runtime 76877 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3009/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3009/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3009/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-020A-LTLFireability-02
Could not compute solution for formula : ShieldRVs-PT-020A-LTLFireability-06
Could not compute solution for formula : ShieldRVs-PT-020A-LTLFireability-08

BK_STOP 1679298048910

--------------------
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 ShieldRVs-PT-020A-LTLFireability-02
ltl formula formula --ltl=/tmp/3009/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 283 places, 383 transitions and 1840 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3009/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3009/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3009/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3009/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldRVs-PT-020A-LTLFireability-06
ltl formula formula --ltl=/tmp/3009/ltl_1_
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 283 places, 383 transitions and 1840 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.040 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3009/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3009/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3009/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3009/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x557feac673f4]
1: pnml2lts-mc(+0xa2496) [0x557feac67496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f3dbd0f7140]
3: pnml2lts-mc(+0x405be5) [0x557feafcabe5]
4: pnml2lts-mc(+0x16b3f9) [0x557fead303f9]
5: pnml2lts-mc(+0x164ac4) [0x557fead29ac4]
6: pnml2lts-mc(+0x272e0a) [0x557feae37e0a]
7: pnml2lts-mc(+0xb61f0) [0x557feac7b1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f3dbcf4a4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f3dbcf4a67a]
10: pnml2lts-mc(+0xa1581) [0x557feac66581]
11: pnml2lts-mc(+0xa1910) [0x557feac66910]
12: pnml2lts-mc(+0xa32a2) [0x557feac682a2]
13: pnml2lts-mc(+0xa50f4) [0x557feac6a0f4]
14: pnml2lts-mc(+0xa516b) [0x557feac6a16b]
15: pnml2lts-mc(+0x3f34b3) [0x557feafb84b3]
16: pnml2lts-mc(+0x7c63d) [0x557feac4163d]
17: pnml2lts-mc(+0x67d86) [0x557feac2cd86]
18: pnml2lts-mc(+0x60a8a) [0x557feac25a8a]
19: pnml2lts-mc(+0x5eb15) [0x557feac23b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f3dbcf32d0a]
21: pnml2lts-mc(+0x6075e) [0x557feac2575e]
ltl formula name ShieldRVs-PT-020A-LTLFireability-08
ltl formula formula --ltl=/tmp/3009/ltl_2_
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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 283 places, 383 transitions and 1840 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.050 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3009/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3009/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3009/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3009/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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="ShieldRVs-PT-020A"
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 ShieldRVs-PT-020A, 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-167905977700100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-020A.tgz
mv ShieldRVs-PT-020A 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 ;