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.r423-tajo-167905976300100.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 lolaxred
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 r423-tajo-167905976300100
=====================================================================

--------------------
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 1679242306650

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-020A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:11:48] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-19 16:11:48] [INFO ] Transformed 283 places.
[2023-03-19 16:11:48] [INFO ] Transformed 383 transitions.
[2023-03-19 16:11:48] [INFO ] Found NUPN structural information;
[2023-03-19 16:11:48] [INFO ] Parsed PT model containing 283 places and 383 transitions and 1840 arcs in 134 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 42 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-19 16:11:48] [INFO ] Computed 81 place invariants in 21 ms
[2023-03-19 16:11:48] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-19 16:11:48] [INFO ] Invariant cache hit.
[2023-03-19 16:11:49] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-19 16:11:49] [INFO ] Invariant cache hit.
[2023-03-19 16:11:49] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 283/283 places, 383/383 transitions.
Support contains 74 out of 283 places after structural reductions.
[2023-03-19 16:11:49] [INFO ] Flatten gal took : 81 ms
[2023-03-19 16:11:49] [INFO ] Flatten gal took : 47 ms
[2023-03-19 16:11:49] [INFO ] Input system was already deterministic with 383 transitions.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 34) seen :30
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:11:50] [INFO ] Invariant cache hit.
[2023-03-19 16:11:50] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-19 16:11:50] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-19 16:11:50] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-19 16:11:50] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-19 16:11:50] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 5 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:11:51] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2023-03-19 16:11:52] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2023-03-19 16:11:53] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 4 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:11:54] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 5 ms to minimize.
[2023-03-19 16:11:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:11:56] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:11:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2023-03-19 16:11:58] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:11:59] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:12:00] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:12:01] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:12:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-19 16:12:03] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-19 16:12:04] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-19 16:12:05] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 0 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2023-03-19 16:12:06] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:12:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-19 16:12:08] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2023-03-19 16:12:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2023-03-19 16:12:10] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2023-03-19 16:12:10] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2023-03-19 16:12:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2023-03-19 16:12:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 2 ms to minimize.
[2023-03-19 16:12:10] [INFO ] Trap strengthening (SAT) tested/added 233/232 trap constraints in 19347 ms
[2023-03-19 16:12:10] [INFO ] After 19544ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-19 16:12:10] [INFO ] After 19684ms 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 5 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 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
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 59 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 59 ms. Remains : 282/283 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Finished Best-First random walk after 856 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=285 )
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 7 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:10] [INFO ] Invariant cache hit.
[2023-03-19 16:12:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-19 16:12:11] [INFO ] Invariant cache hit.
[2023-03-19 16:12:11] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-19 16:12:11] [INFO ] Invariant cache hit.
[2023-03-19 16:12:11] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 201 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 8 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-00 finished in 972 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 10 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:11] [INFO ] Invariant cache hit.
[2023-03-19 16:12:11] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-19 16:12:11] [INFO ] Invariant cache hit.
[2023-03-19 16:12:12] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-19 16:12:12] [INFO ] Invariant cache hit.
[2023-03-19 16:12:12] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 139 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 331 steps with 1 reset in 9 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-01 finished in 842 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 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:12] [INFO ] Invariant cache hit.
[2023-03-19 16:12:12] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-19 16:12:12] [INFO ] Invariant cache hit.
[2023-03-19 16:12:13] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-19 16:12:13] [INFO ] Invariant cache hit.
[2023-03-19 16:12:13] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 678 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 165 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 369 reset in 492 ms.
Product exploration explored 100000 steps with 367 reset in 408 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 495 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 35 resets, run finished after 160 ms. (steps per millisecond=62 ) 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 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :1
Finished Best-First random walk after 4183 steps, including 1 resets, run visited all 1 properties in 11 ms. (steps per millisecond=380 )
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 477 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 177 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 142 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 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:16] [INFO ] Invariant cache hit.
[2023-03-19 16:12:16] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 16:12:16] [INFO ] Invariant cache hit.
[2023-03-19 16:12:16] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-19 16:12:16] [INFO ] Invariant cache hit.
[2023-03-19 16:12:16] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 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 275 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 115 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 185 ms. (steps per millisecond=54 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) 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 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:12:17] [INFO ] Invariant cache hit.
[2023-03-19 16:12:17] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-19 16:12:17] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:12:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-19 16:12:17] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:12:17] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:12:18] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-19 16:12:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2023-03-19 16:12:18] [INFO ] After 292ms 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-19 16:12:18] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 47 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 47 ms. Remains : 282/283 places, 382/383 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Finished Best-First random walk after 6894 steps, including 3 resets, run visited all 1 properties in 13 ms. (steps per millisecond=530 )
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 444 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 119 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 135 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 150 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 468 ms.
Product exploration explored 100000 steps with 366 reset in 448 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 176 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 1 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 26 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:20] [INFO ] Redundant transitions in 97 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-19 16:12:20] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 16:12:20] [INFO ] Dead Transitions using invariants and state equation in 212 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 0 ms
Applied a total of 0 rules in 13 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 358 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 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-19 16:12:20] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 16:12:20] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-19 16:12:20] [INFO ] Invariant cache hit.
[2023-03-19 16:12:21] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-19 16:12:21] [INFO ] Invariant cache hit.
[2023-03-19 16:12:21] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 283/283 places, 383/383 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-02 finished in 8731 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 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:21] [INFO ] Invariant cache hit.
[2023-03-19 16:12:21] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-19 16:12:21] [INFO ] Invariant cache hit.
[2023-03-19 16:12:21] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-19 16:12:21] [INFO ] Invariant cache hit.
[2023-03-19 16:12:22] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 129 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 285 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-03 finished in 788 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 20 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:22] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 16:12:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-19 16:12:22] [INFO ] Invariant cache hit.
[2023-03-19 16:12:22] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-19 16:12:22] [INFO ] Redundant transitions in 76 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-19 16:12:22] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:22] [INFO ] Dead Transitions using invariants and state equation in 196 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 739 ms. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 166 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 205 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 925 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 3 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-19 16:12:23] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:23] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-19 16:12:23] [INFO ] Invariant cache hit.
[2023-03-19 16:12:23] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2023-03-19 16:12:23] [INFO ] Invariant cache hit.
[2023-03-19 16:12:23] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 132 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 362 reset in 419 ms.
Product exploration explored 100000 steps with 363 reset in 359 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 163 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 28 ms :[(NOT p1)]
Finished random walk after 204 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Knowledge obtained : [(AND p0 p1), (X p0), true, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 153 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 48 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 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 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 14 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:25] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:25] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-19 16:12:25] [INFO ] Invariant cache hit.
[2023-03-19 16:12:25] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-19 16:12:25] [INFO ] Redundant transitions in 80 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-19 16:12:25] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:25] [INFO ] Dead Transitions using invariants and state equation in 200 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 10 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 824 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 110 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 30 ms :[(NOT p1)]
Finished random walk after 216 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 365 reset in 412 ms.
Product exploration explored 100000 steps with 364 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 10 ms. Remains 282 /282 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2023-03-19 16:12:27] [INFO ] Invariant cache hit.
[2023-03-19 16:12:27] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-19 16:12:27] [INFO ] Invariant cache hit.
[2023-03-19 16:12:27] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-19 16:12:27] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-19 16:12:27] [INFO ] Invariant cache hit.
[2023-03-19 16:12:27] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 789 ms. Remains : 282/282 places, 381/381 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-06 finished in 4932 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 7 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 283 cols
[2023-03-19 16:12:28] [INFO ] Computed 81 place invariants in 7 ms
[2023-03-19 16:12:28] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-19 16:12:28] [INFO ] Invariant cache hit.
[2023-03-19 16:12:28] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-19 16:12:28] [INFO ] Invariant cache hit.
[2023-03-19 16:12:28] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 271 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 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-07 finished in 996 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 8 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:29] [INFO ] Invariant cache hit.
[2023-03-19 16:12:29] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-19 16:12:29] [INFO ] Invariant cache hit.
[2023-03-19 16:12:29] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-19 16:12:29] [INFO ] Invariant cache hit.
[2023-03-19 16:12:29] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 94 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 33208 reset in 803 ms.
Product exploration explored 100000 steps with 33385 reset in 554 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 267 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 90 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 517 steps, including 1 resets, run visited all 3 properties in 9 ms. (steps per millisecond=57 )
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 301 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 105 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 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 5 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:31] [INFO ] Invariant cache hit.
[2023-03-19 16:12:32] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-19 16:12:32] [INFO ] Invariant cache hit.
[2023-03-19 16:12:32] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-19 16:12:32] [INFO ] Invariant cache hit.
[2023-03-19 16:12:32] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 720 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 309 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)]
Finished random walk after 570 steps, including 1 resets, run visited all 3 properties in 12 ms. (steps per millisecond=47 )
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 313 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 107 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
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 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33402 reset in 758 ms.
Product exploration explored 100000 steps with 33440 reset in 602 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 6 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:35] [INFO ] Invariant cache hit.
[2023-03-19 16:12:35] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-19 16:12:35] [INFO ] Invariant cache hit.
[2023-03-19 16:12:35] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-19 16:12:35] [INFO ] Invariant cache hit.
[2023-03-19 16:12:35] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 283/283 places, 383/383 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-08 finished in 6932 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 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:35] [INFO ] Invariant cache hit.
[2023-03-19 16:12:36] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-19 16:12:36] [INFO ] Invariant cache hit.
[2023-03-19 16:12:36] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-19 16:12:36] [INFO ] Invariant cache hit.
[2023-03-19 16:12:36] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 388 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 941 ms.
Product exploration explored 100000 steps with 50000 reset in 692 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 938 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 3624 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 4 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:39] [INFO ] Invariant cache hit.
[2023-03-19 16:12:39] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-19 16:12:39] [INFO ] Invariant cache hit.
[2023-03-19 16:12:40] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-19 16:12:40] [INFO ] Invariant cache hit.
[2023-03-19 16:12:40] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 137 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 868 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-19 16:12:40] [INFO ] Invariant cache hit.
[2023-03-19 16:12:40] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-19 16:12:40] [INFO ] Invariant cache hit.
[2023-03-19 16:12:40] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-19 16:12:40] [INFO ] Invariant cache hit.
[2023-03-19 16:12:41] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 662 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 167 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 989 ms.
Product exploration explored 100000 steps with 50000 reset in 668 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 84 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 2596 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 2 ms. Remains 283 /283 variables (removed 0) and now considering 383/383 (removed 0) transitions.
[2023-03-19 16:12:43] [INFO ] Invariant cache hit.
[2023-03-19 16:12:43] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-19 16:12:43] [INFO ] Invariant cache hit.
[2023-03-19 16:12:43] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-19 16:12:43] [INFO ] Invariant cache hit.
[2023-03-19 16:12:43] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 283/283 places, 383/383 transitions.
Stuttering acceptance computed with spot in 65 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 282 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 792 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 9 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:43] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:43] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-19 16:12:43] [INFO ] Invariant cache hit.
[2023-03-19 16:12:44] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-19 16:12:44] [INFO ] Redundant transitions in 82 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-19 16:12:44] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 16:12:44] [INFO ] Dead Transitions using invariants and state equation in 168 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 745 ms. Remains : 282/283 places, 381/383 transitions.
Stuttering acceptance computed with spot in 52 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 272 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-020A-LTLFireability-15 finished in 809 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 172 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 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 18 ms. Remains 282 /283 variables (removed 1) and now considering 382/383 (removed 1) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:44] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-19 16:12:45] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-19 16:12:45] [INFO ] Invariant cache hit.
[2023-03-19 16:12:45] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-19 16:12:45] [INFO ] Invariant cache hit.
[2023-03-19 16:12:45] [INFO ] Dead Transitions using invariants and state equation in 195 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 599 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 369 reset in 395 ms.
Product exploration explored 100000 steps with 372 reset in 423 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 401 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 199 ms. (steps per millisecond=50 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:12:47] [INFO ] Invariant cache hit.
[2023-03-19 16:12:47] [INFO ] [Real]Absence check using 81 positive place invariants in 13 ms returned sat
[2023-03-19 16:12:47] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:12:47] [INFO ] [Nat]Absence check using 81 positive place invariants in 14 ms returned sat
[2023-03-19 16:12:47] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:12:47] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2023-03-19 16:12:47] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2023-03-19 16:12:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 531 ms
[2023-03-19 16:12:48] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 16:12:48] [INFO ] After 897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 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 19 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 20 ms. Remains : 282/282 places, 382/382 transitions.
Incomplete random walk after 10000 steps, including 40 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 753526 steps, run timeout after 3001 ms. (steps per millisecond=251 ) properties seen :{}
Probabilistic random walk after 753526 steps, saw 140416 distinct states, run finished after 3002 ms. (steps per millisecond=251 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:51] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-19 16:12:51] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-19 16:12:51] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:12:51] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-19 16:12:51] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:12:51] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2023-03-19 16:12:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 453 ms
[2023-03-19 16:12:52] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 16:12:52] [INFO ] After 708ms 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.
Applied a total of 0 rules in 9 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 10 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 9 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-19 16:12:52] [INFO ] Invariant cache hit.
[2023-03-19 16:12:52] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-19 16:12:52] [INFO ] Invariant cache hit.
[2023-03-19 16:12:52] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-19 16:12:52] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-19 16:12:52] [INFO ] Invariant cache hit.
[2023-03-19 16:12:53] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 725 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-19 16:12:53] [INFO ] Invariant cache hit.
[2023-03-19 16:12:53] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-19 16:12:53] [INFO ] After 203ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:12:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-19 16:12:53] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
[2023-03-19 16:12:53] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-19 16:12:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2023-03-19 16:12:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-19 16:12:55] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2023-03-19 16:12:55] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1498 ms
[2023-03-19 16:12:55] [INFO ] After 1671ms 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-19 16:12:55] [INFO ] After 1768ms 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 284 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 135 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 139 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.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:55] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:55] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-19 16:12:55] [INFO ] Invariant cache hit.
[2023-03-19 16:12:56] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-19 16:12:56] [INFO ] Invariant cache hit.
[2023-03-19 16:12:56] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 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 289 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 105 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 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :2
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 10000 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Finished Best-First random walk after 6392 steps, including 2 resets, run visited all 1 properties in 13 ms. (steps per millisecond=491 )
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 314 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 93 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 101 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 97 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 372 reset in 375 ms.
Product exploration explored 100000 steps with 371 reset in 355 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 127 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 11 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-19 16:12:58] [INFO ] Redundant transitions in 65 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-19 16:12:58] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:58] [INFO ] Dead Transitions using invariants and state equation in 190 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 9 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 295 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 1 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 282 cols
[2023-03-19 16:12:58] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-19 16:12:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-19 16:12:59] [INFO ] Invariant cache hit.
[2023-03-19 16:12:59] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-19 16:12:59] [INFO ] Invariant cache hit.
[2023-03-19 16:12:59] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 282/282 places, 382/382 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-02 finished in 14865 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 95 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 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.
[2023-03-19 16:12:59] [INFO ] Invariant cache hit.
[2023-03-19 16:12:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-19 16:12:59] [INFO ] Invariant cache hit.
[2023-03-19 16:13:00] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-19 16:13:00] [INFO ] Invariant cache hit.
[2023-03-19 16:13:00] [INFO ] Dead Transitions using invariants and state equation in 198 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 679 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 33315 reset in 754 ms.
Product exploration explored 100000 steps with 33219 reset in 698 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 288 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 9881 steps, including 35 resets, run visited all 3 properties in 51 ms. (steps per millisecond=193 )
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 337 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 85 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 125 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 3 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-19 16:13:02] [INFO ] Invariant cache hit.
[2023-03-19 16:13:02] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-19 16:13:02] [INFO ] Invariant cache hit.
[2023-03-19 16:13:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-19 16:13:03] [INFO ] Invariant cache hit.
[2023-03-19 16:13:03] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 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 193 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 103 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5680 steps, including 20 resets, run visited all 3 properties in 46 ms. (steps per millisecond=123 )
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 293 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 96 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 33314 reset in 603 ms.
Product exploration explored 100000 steps with 33342 reset in 908 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 6 ms. Remains 282 /282 variables (removed 0) and now considering 382/382 (removed 0) transitions.
[2023-03-19 16:13:06] [INFO ] Invariant cache hit.
[2023-03-19 16:13:06] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-19 16:13:06] [INFO ] Invariant cache hit.
[2023-03-19 16:13:06] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-19 16:13:06] [INFO ] Invariant cache hit.
[2023-03-19 16:13:06] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 282/282 places, 382/382 transitions.
Treatment of property ShieldRVs-PT-020A-LTLFireability-08 finished in 7229 ms.
[2023-03-19 16:13:06] [INFO ] Flatten gal took : 62 ms
[2023-03-19 16:13:06] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:13:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 283 places, 383 transitions and 1840 arcs took 5 ms.
Total runtime 78677 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-020A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
LTLFireability

FORMULA ShieldRVs-PT-020A-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679242497310

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: rewrite Frontend/Parser/formula_rewrite.k:379
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-020A-LTLFireability-02
lola: time limit : 720 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 3/32 ShieldRVs-PT-020A-LTLFireability-02 437898 m, 87579 m/sec, 3440111 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 6/32 ShieldRVs-PT-020A-LTLFireability-02 830664 m, 78553 m/sec, 6905584 t fired, .

Time elapsed: 10 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 9/32 ShieldRVs-PT-020A-LTLFireability-02 1208141 m, 75495 m/sec, 10358874 t fired, .

Time elapsed: 15 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/720 11/32 ShieldRVs-PT-020A-LTLFireability-02 1569966 m, 72365 m/sec, 13810503 t fired, .

Time elapsed: 20 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/720 13/32 ShieldRVs-PT-020A-LTLFireability-02 1920360 m, 70078 m/sec, 17265752 t fired, .

Time elapsed: 25 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/720 16/32 ShieldRVs-PT-020A-LTLFireability-02 2281852 m, 72298 m/sec, 20700866 t fired, .

Time elapsed: 30 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/720 19/32 ShieldRVs-PT-020A-LTLFireability-02 2683934 m, 80416 m/sec, 24516758 t fired, .

Time elapsed: 35 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/720 21/32 ShieldRVs-PT-020A-LTLFireability-02 3065757 m, 76364 m/sec, 28464759 t fired, .

Time elapsed: 40 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/720 24/32 ShieldRVs-PT-020A-LTLFireability-02 3415092 m, 69867 m/sec, 31906796 t fired, .

Time elapsed: 45 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/720 26/32 ShieldRVs-PT-020A-LTLFireability-02 3737375 m, 64456 m/sec, 35333760 t fired, .

Time elapsed: 50 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/720 28/32 ShieldRVs-PT-020A-LTLFireability-02 4043048 m, 61134 m/sec, 38750103 t fired, .

Time elapsed: 55 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/720 31/32 ShieldRVs-PT-020A-LTLFireability-02 4456271 m, 82644 m/sec, 42666734 t fired, .

Time elapsed: 60 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-020A-LTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 3 0 0 3 0 0 0
ShieldRVs-PT-020A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 15 (type EXCL) for 14 ShieldRVs-PT-020A-LTLFireability-08
lola: time limit : 883 sec
lola: memory limit: 32 pages
lola: FINISHED task # 15 (type EXCL) for ShieldRVs-PT-020A-LTLFireability-08
lola: result : false
lola: markings : 6406
lola: fired transitions : 8452
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 3 ShieldRVs-PT-020A-LTLFireability-06
lola: time limit : 1178 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ShieldRVs-PT-020A-LTLFireability-06
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 6 (type EXCL) for 3 ShieldRVs-PT-020A-LTLFireability-06
lola: time limit : 1767 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for ShieldRVs-PT-020A-LTLFireability-06
lola: result : true
lola: markings : 2
lola: fired transitions : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 12 (type EXCL) for 3 ShieldRVs-PT-020A-LTLFireability-06
lola: time limit : 3535 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 5/3535 5/32 ShieldRVs-PT-020A-LTLFireability-06 738088 m, 147617 m/sec, 2365788 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 10/3535 10/32 ShieldRVs-PT-020A-LTLFireability-06 1441073 m, 140597 m/sec, 4792593 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 15/3535 14/32 ShieldRVs-PT-020A-LTLFireability-06 2085471 m, 128879 m/sec, 7190763 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 20/3535 18/32 ShieldRVs-PT-020A-LTLFireability-06 2705915 m, 124088 m/sec, 9478002 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 25/3535 21/32 ShieldRVs-PT-020A-LTLFireability-06 3246856 m, 108188 m/sec, 11731290 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 30/3535 25/32 ShieldRVs-PT-020A-LTLFireability-06 3738656 m, 98360 m/sec, 13869760 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 35/3535 28/32 ShieldRVs-PT-020A-LTLFireability-06 4240689 m, 100406 m/sec, 16378331 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 1 0 5 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
12 LTL EXCL 40/3535 31/32 ShieldRVs-PT-020A-LTLFireability-06 4743947 m, 100651 m/sec, 18248858 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 12 (type EXCL) for ShieldRVs-PT-020A-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-020A-LTLFireability-02: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-020A-LTLFireability-06: CONJ 0 0 0 0 5 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-020A-LTLFireability-02: LTL unknown AGGR
ShieldRVs-PT-020A-LTLFireability-06: CONJ unknown CONJ
ShieldRVs-PT-020A-LTLFireability-08: LTL false LTL model checker


Time elapsed: 110 secs. Pages in use: 32

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="lolaxred"
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 lolaxred"
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 r423-tajo-167905976300100"
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 ;