Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683760000996.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldRVt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760000996
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 01:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 82K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717080118041

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:41:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 14:41:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:41:59] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-30 14:41:59] [INFO ] Transformed 243 places.
[2024-05-30 14:41:59] [INFO ] Transformed 243 transitions.
[2024-05-30 14:41:59] [INFO ] Found NUPN structural information;
[2024-05-30 14:41:59] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 32 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:41:59] [INFO ] Computed 121 invariants in 19 ms
[2024-05-30 14:41:59] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-30 14:41:59] [INFO ] Invariant cache hit.
[2024-05-30 14:42:00] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:42:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8503 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10402 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 19017ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 19034ms
Finished structural reductions in LTL mode , in 1 iterations and 19658 ms. Remains : 243/243 places, 242/242 transitions.
Support contains 58 out of 243 places after structural reductions.
[2024-05-30 14:42:19] [INFO ] Flatten gal took : 96 ms
[2024-05-30 14:42:19] [INFO ] Flatten gal took : 33 ms
[2024-05-30 14:42:19] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (8 resets) in 3036 ms. (13 steps per ms) remains 15/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
[2024-05-30 14:42:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 15 unsolved in 805 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 15/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 622 constraints, problems are : Problem set: 0 solved, 15 unsolved in 808 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1632ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Parikh walk visited 14 properties in 2254 ms.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 242 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 62 place count 242 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 241 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 64 place count 240 transition count 210
Applied a total of 64 rules in 76 ms. Remains 240 /243 variables (removed 3) and now considering 210/242 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 240/243 places, 210/242 transitions.
RANDOM walk for 40000 steps (8 resets) in 688 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1486 steps, run visited all 1 properties in 13 ms. (steps per millisecond=114 )
Probabilistic random walk after 1486 steps, saw 1422 distinct states, run finished after 16 ms. (steps per millisecond=92 ) properties seen :1
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:42:25] [INFO ] Invariant cache hit.
[2024-05-30 14:42:25] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 14:42:25] [INFO ] Invariant cache hit.
[2024-05-30 14:42:25] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:42:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8305 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10312 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18669ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18671ms
Finished structural reductions in LTL mode , in 1 iterations and 18976 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 297 steps with 0 reset in 5 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-00 finished in 19242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||((X(p3)||p2)&&p1))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:42:44] [INFO ] Invariant cache hit.
[2024-05-30 14:42:44] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 14:42:44] [INFO ] Invariant cache hit.
[2024-05-30 14:42:44] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8154 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10235 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18434ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18436ms
Finished structural reductions in LTL mode , in 1 iterations and 18777 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 746 ms.
Product exploration explored 100000 steps with 50000 reset in 663 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 p1 p2 p0 p3), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-01 finished in 20398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G((p0&&F(p1)))||(G(p0)&&p2)))&&X(p3))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:43:04] [INFO ] Invariant cache hit.
[2024-05-30 14:43:05] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-30 14:43:05] [INFO ] Invariant cache hit.
[2024-05-30 14:43:05] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:43:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8035 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9841 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17921ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17923ms
Finished structural reductions in LTL mode , in 1 iterations and 18252 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-02 finished in 18561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(G(p1)))) U G(p1)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:43:23] [INFO ] Invariant cache hit.
[2024-05-30 14:43:23] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 14:43:23] [INFO ] Invariant cache hit.
[2024-05-30 14:43:23] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:43:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8172 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10313 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18521ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18523ms
Finished structural reductions in LTL mode , in 1 iterations and 18815 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-03 finished in 18951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:43:42] [INFO ] Invariant cache hit.
[2024-05-30 14:43:42] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 14:43:42] [INFO ] Invariant cache hit.
[2024-05-30 14:43:42] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:43:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8161 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10270 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18466ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18468ms
Finished structural reductions in LTL mode , in 1 iterations and 18769 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-04
Product exploration explored 100000 steps with 17 reset in 317 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-04 finished in 19168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U X(p2))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:44:01] [INFO ] Invariant cache hit.
[2024-05-30 14:44:01] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 14:44:01] [INFO ] Invariant cache hit.
[2024-05-30 14:44:01] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8131 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10234 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18402ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18405ms
Finished structural reductions in LTL mode , in 1 iterations and 18739 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 328 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-06 finished in 19217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(p1)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:44:20] [INFO ] Invariant cache hit.
[2024-05-30 14:44:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 14:44:20] [INFO ] Invariant cache hit.
[2024-05-30 14:44:21] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:44:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8131 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10227 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18394ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18396ms
Finished structural reductions in LTL mode , in 1 iterations and 18742 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 484 ms.
Product exploration explored 100000 steps with 33333 reset in 534 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 p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-07 finished in 19969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:44:40] [INFO ] Invariant cache hit.
[2024-05-30 14:44:40] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 14:44:40] [INFO ] Invariant cache hit.
[2024-05-30 14:44:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:44:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8018 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10248 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18300ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18302ms
Finished structural reductions in LTL mode , in 1 iterations and 18598 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-08 finished in 18741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 19 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:44:59] [INFO ] Invariant cache hit.
[2024-05-30 14:44:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 14:44:59] [INFO ] Invariant cache hit.
[2024-05-30 14:44:59] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-30 14:44:59] [INFO ] Redundant transitions in 9 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-30 14:44:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8035 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9844 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17917ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17920ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18248 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-10
Product exploration explored 100000 steps with 2217 reset in 369 ms.
Stack based approach found an accepted trace after 1437 steps with 18 reset with depth 117 and stack size 76 in 18 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-10 finished in 18744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 13 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2024-05-30 14:45:18] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:45:18] [INFO ] Implicit Places using invariants in 123 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 345 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-11 finished in 592 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 17 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-05-30 14:45:18] [INFO ] Invariant cache hit.
[2024-05-30 14:45:18] [INFO ] Implicit Places using invariants in 116 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 316 ms.
Stack based approach found an accepted trace after 3409 steps with 0 reset with depth 3410 and stack size 1166 in 12 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-12 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:45:19] [INFO ] Computed 121 invariants in 5 ms
[2024-05-30 14:45:19] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-30 14:45:19] [INFO ] Invariant cache hit.
[2024-05-30 14:45:19] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:45:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7841 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9870 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17743ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17747ms
Finished structural reductions in LTL mode , in 1 iterations and 18029 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 230 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-14
Product exploration explored 100000 steps with 25081 reset in 497 ms.
Product exploration explored 100000 steps with 24998 reset in 525 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 p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 134 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 475 ms. (84 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
[2024-05-30 14:45:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 3 unsolved in 173 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 3/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 272 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 455ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 3232 steps, including 687 resets, run visited all 3 properties in 69 ms. (steps per millisecond=46 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 72 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 22 factoid took 480 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 250 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:45:41] [INFO ] Invariant cache hit.
[2024-05-30 14:45:41] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 14:45:41] [INFO ] Invariant cache hit.
[2024-05-30 14:45:41] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:45:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7934 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10156 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18140ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18143ms
Finished structural reductions in LTL mode , in 1 iterations and 18445 ms. Remains : 243/243 places, 242/242 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 p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 125 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 255 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 308 ms. (129 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1))))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0)]
Knowledge based reduction with 22 factoid took 496 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 24957 reset in 505 ms.
Product exploration explored 100000 steps with 25052 reset in 538 ms.
Applying partial POR strategy [false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 254 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:46:02] [INFO ] Redundant transitions in 12 ms returned []
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:46:02] [INFO ] Computed 121 invariants in 1 ms
[2024-05-30 14:46:02] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-30 14:46:06] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 5 ms to minimize.
Problem TDEAD120 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 610 constraints, problems are : Problem set: 1 solved, 240 unsolved in 23090 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 241/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 2/243 variables, 121/362 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 2/364 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 240/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 850 constraints, problems are : Problem set: 1 solved, 240 unsolved in 10729 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 240/241 constraints, Known Traps: 1/1 constraints]
After SMT, in 33866ms problems are : Problem set: 1 solved, 240 unsolved
Search for dead transitions found 1 dead transitions in 33869ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 241/242 transitions.
Graph (complete) has 960 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 242 /243 variables (removed 1) and now considering 241/241 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/243 places, 241/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33929 ms. Remains : 242/243 places, 241/242 transitions.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:46:36] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 14:46:36] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-30 14:46:36] [INFO ] Invariant cache hit.
[2024-05-30 14:46:36] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8239 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10316 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18591ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18596ms
Finished structural reductions in LTL mode , in 1 iterations and 18919 ms. Remains : 243/243 places, 242/242 transitions.
Treatment of property ShieldRVt-PT-030A-LTLFireability-14 finished in 96253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((X(G(p2))&&p1))) U X(X(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:46:55] [INFO ] Invariant cache hit.
[2024-05-30 14:46:55] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-30 14:46:55] [INFO ] Invariant cache hit.
[2024-05-30 14:46:56] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:46:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8055 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10250 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18341ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18346ms
Finished structural reductions in LTL mode , in 1 iterations and 18808 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 413 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-15 finished in 19247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
[2024-05-30 14:47:14] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:47:14] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-30 14:47:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 243 places, 242 transitions and 1024 arcs took 5 ms.
Total runtime 315842 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-030A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 243
TRANSITIONS: 242
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1324
MODEL NAME: /home/mcc/execution/413/model
243 places, 242 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-030A-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717080436506

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVt-PT-030A, 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 r355-tall-171683760000996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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