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.r528-tall-171683761700716.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 ltsminxred
Input is ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761700716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 17:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 13K 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 ShieldRVs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717262342131

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:19:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:19:03] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-06-01 17:19:03] [INFO ] Transformed 43 places.
[2024-06-01 17:19:03] [INFO ] Transformed 48 transitions.
[2024-06-01 17:19:03] [INFO ] Found NUPN structural information;
[2024-06-01 17:19:03] [INFO ] Parsed PT model containing 43 places and 48 transitions and 144 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Support contains 24 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 41 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 46
Applied a total of 4 rules in 18 ms. Remains 41 /43 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 41 cols
[2024-06-01 17:19:03] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 17:19:03] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-01 17:19:03] [INFO ] Invariant cache hit.
[2024-06-01 17:19:03] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-06-01 17:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 7 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/87 variables, 41/66 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/87 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (OVERLAPS) 0/87 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 71 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1870 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 46/87 variables, 41/71 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 45/116 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/87 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 12 (OVERLAPS) 0/87 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 121 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 30/30 constraints]
After SMT, in 3656ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3671ms
Starting structural reductions in LTL mode, iteration 1 : 41/43 places, 46/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3953 ms. Remains : 41/43 places, 46/48 transitions.
Support contains 24 out of 41 places after structural reductions.
[2024-06-01 17:19:07] [INFO ] Flatten gal took : 19 ms
[2024-06-01 17:19:07] [INFO ] Flatten gal took : 7 ms
[2024-06-01 17:19:07] [INFO ] Input system was already deterministic with 46 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (79 resets) in 1171 ms. (34 steps per ms) remains 3/28 properties
BEST_FIRST walk for 40002 steps (62 resets) in 188 ms. (211 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2024-06-01 17:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/38 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 38/87 variables, and 8 constraints, problems are : Problem set: 3 solved, 0 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 144ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-001B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 11 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' '!(F(p0))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 30 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 25 place count 25 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 30 place count 25 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 30 place count 25 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 23 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 18 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 17 transition count 22
Applied a total of 45 rules in 20 ms. Remains 17 /41 variables (removed 24) and now considering 22/46 (removed 24) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-06-01 17:19:08] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 17:19:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 17:19:09] [INFO ] Invariant cache hit.
[2024-06-01 17:19:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 17:19:09] [INFO ] Redundant transitions in 13 ms returned [21]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-06-01 17:19:09] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 6 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 21/38 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/38 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 30 constraints, problems are : Problem set: 0 solved, 20 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:09] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 21/38 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 51 constraints, problems are : Problem set: 0 solved, 20 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 9/9 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/41 places, 21/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 796 ms. Remains : 17/41 places, 21/46 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/17 stabilizing places and 2/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 30 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001B-LTLFireability-00 finished in 1366 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((((p0 U p1) U p2)||((p4||G(p1))&&p3))))'
Support contains 5 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 41 transition count 43
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 38 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 37 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 23 place count 27 transition count 32
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 27 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 42 place count 20 transition count 25
Applied a total of 42 rules in 11 ms. Remains 20 /41 variables (removed 21) and now considering 25/46 (removed 21) transitions.
// Phase 1: matrix 25 rows 20 cols
[2024-06-01 17:19:10] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 17:19:10] [INFO ] Invariant cache hit.
[2024-06-01 17:19:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 17:19:10] [INFO ] Redundant transitions in 13 ms returned [24]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 23 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 20 cols
[2024-06-01 17:19:10] [INFO ] Computed 5 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 2 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 29 constraints, problems are : Problem set: 0 solved, 23 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 53 constraints, problems are : Problem set: 0 solved, 23 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 5/5 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/41 places, 24/46 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 650 ms. Remains : 20/41 places, 24/46 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-02
Product exploration explored 100000 steps with 14645 reset in 149 ms.
Product exploration explored 100000 steps with 14636 reset in 192 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p4) p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1))))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p4) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 306 steps (2 resets) in 13 ms. (21 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p4) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1)))), (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1)))), (X (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p4) p1))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (OR (AND (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p4) p1))))), (X (X (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p3 (NOT p4) p1))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (F (NOT (OR (NOT p1) p2 (NOT p3) p4))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p1) p2 p3) (OR (NOT p1) p2 p4)))), (F p2), (F p4), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 290 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2024-06-01 17:19:12] [INFO ] Invariant cache hit.
[2024-06-01 17:19:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 17:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:19:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-06-01 17:19:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 17:19:12] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-06-01 17:19:12] [INFO ] Added : 13 causal constraints over 3 iterations in 15 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p4))
[2024-06-01 17:19:12] [INFO ] Invariant cache hit.
[2024-06-01 17:19:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:12] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 17:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:19:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 17:19:12] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 2 ms.
[2024-06-01 17:19:12] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Support contains 5 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 24/24 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-06-01 17:19:12] [INFO ] Invariant cache hit.
[2024-06-01 17:19:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 17:19:12] [INFO ] Invariant cache hit.
[2024-06-01 17:19:12] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 17:19:12] [INFO ] Redundant transitions in 13 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 17:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 2 ms to minimize.
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/44 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 29 constraints, problems are : Problem set: 0 solved, 23 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 24/44 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 23/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-06-01 17:19:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/44 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 53 constraints, problems are : Problem set: 0 solved, 23 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 5/5 constraints]
After SMT, in 674ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 680ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 759 ms. Remains : 20/20 places, 24/24 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 142 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 239 steps (0 resets) in 4 ms. (47 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND p1 (NOT p2) p3 (NOT p4)))), (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (NOT (AND p1 (NOT p2) p3 (NOT p4))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p4)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))))), (F (NOT (OR (NOT p1) p2 (NOT p3) p4))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))))), (F (NOT (AND (OR (NOT p1) p2 p3) (OR (NOT p1) p2 p4)))), (F p2), (F p4), (F p3), (F p1)]
Knowledge based reduction with 17 factoid took 320 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
[2024-06-01 17:19:13] [INFO ] Invariant cache hit.
[2024-06-01 17:19:13] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2024-06-01 17:19:13] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 17:19:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:19:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 17:19:13] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 1 ms.
[2024-06-01 17:19:14] [INFO ] Added : 13 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2) (NOT p4))
[2024-06-01 17:19:14] [INFO ] Invariant cache hit.
[2024-06-01 17:19:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 17:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:19:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 17:19:14] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 17:19:14] [INFO ] Computed and/alt/rep : 21/64/21 causal constraints (skipped 2 transitions) in 1 ms.
[2024-06-01 17:19:14] [INFO ] Added : 15 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p2) (NOT p3))
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 14652 reset in 80 ms.
Product exploration explored 100000 steps with 14631 reset in 143 ms.
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 24/24 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 22
Applied a total of 1 rules in 3 ms. Remains 18 /20 variables (removed 2) and now considering 22/24 (removed 2) transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-06-01 17:19:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 17:19:14] [INFO ] Invariant cache hit.
[2024-06-01 17:19:14] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 17:19:14] [INFO ] Redundant transitions in 12 ms returned []
Running 19 sub problems to find dead transitions.
[2024-06-01 17:19:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/18 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 3 ms to minimize.
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 22/40 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 29 constraints, problems are : Problem set: 0 solved, 19 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/18 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 22/40 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:14] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 49 constraints, problems are : Problem set: 0 solved, 19 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 7/7 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 552ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 22/24 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 640 ms. Remains : 18/20 places, 22/24 transitions.
Treatment of property ShieldRVs-PT-001B-LTLFireability-02 finished in 4787 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(G((!p0 U p1))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 2 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-06-01 17:19:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 17:19:15] [INFO ] Invariant cache hit.
[2024-06-01 17:19:15] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:19:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/77 variables, 36/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/77 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 52 constraints, problems are : Problem set: 0 solved, 40 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/77 variables, 36/55 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 40/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 99 constraints, problems are : Problem set: 0 solved, 40 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 18/18 constraints]
After SMT, in 1767ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1767ms
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1852 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-03
Stuttering criterion allowed to conclude after 137 steps with 9 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-03 finished in 2078 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' '!(((p0 U p1)||G(p2)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 41 transition count 42
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 37 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 10 place count 36 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 20 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 25 place count 26 transition count 31
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 26 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 30 place count 26 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 25 transition count 30
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 46 place count 18 transition count 23
Applied a total of 46 rules in 11 ms. Remains 18 /41 variables (removed 23) and now considering 23/46 (removed 23) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-06-01 17:19:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 17:19:17] [INFO ] Invariant cache hit.
[2024-06-01 17:19:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-01 17:19:17] [INFO ] Redundant transitions in 18 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-06-01 17:19:17] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/40 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 28 constraints, problems are : Problem set: 0 solved, 21 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/18 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/40 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 21/50 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 51 constraints, problems are : Problem set: 0 solved, 21 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 7/7 constraints]
After SMT, in 671ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 672ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/41 places, 22/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 772 ms. Remains : 18/41 places, 22/46 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-04 finished in 922 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(X(X(G(p0)))))))'
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 3 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-06-01 17:19:18] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 17:19:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 17:19:18] [INFO ] Invariant cache hit.
[2024-06-01 17:19:18] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-01 17:19:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/75 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:18] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/75 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 39 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1391ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1393ms
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1467 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-05 finished in 1700 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(p0))'
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 30 transition count 35
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 24 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 26 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 24 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 16 transition count 21
Applied a total of 47 rules in 11 ms. Remains 16 /41 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-06-01 17:19:19] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 17:19:19] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 17:19:19] [INFO ] Invariant cache hit.
[2024-06-01 17:19:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 17:19:19] [INFO ] Redundant transitions in 14 ms returned [20]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-06-01 17:19:19] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:19] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 26 constraints, problems are : Problem set: 0 solved, 19 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 20/36 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 19/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 47 constraints, problems are : Problem set: 0 solved, 19 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 7/7 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 482ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/41 places, 20/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 578 ms. Remains : 16/41 places, 20/46 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-06
Stuttering criterion allowed to conclude after 218 steps with 6 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-06 finished in 623 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(p0))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 41
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 36 transition count 36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 26 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 28 place count 26 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 24 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 46 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 16 transition count 21
Applied a total of 47 rules in 21 ms. Remains 16 /41 variables (removed 25) and now considering 21/46 (removed 25) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-06-01 17:19:20] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 17:19:20] [INFO ] Invariant cache hit.
[2024-06-01 17:19:20] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 17:19:20] [INFO ] Redundant transitions in 12 ms returned [20]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-06-01 17:19:20] [INFO ] Computed 5 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 20/36 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-01 17:19:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 29 constraints, problems are : Problem set: 0 solved, 19 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 20/36 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 48 constraints, problems are : Problem set: 0 solved, 19 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 582ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/41 places, 20/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 685 ms. Remains : 16/41 places, 20/46 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-07 finished in 743 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(((X(p0)||G((X(p1)||G(p2)))) U X(p3))))))'
Support contains 7 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 5 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-06-01 17:19:21] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 17:19:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 17:19:21] [INFO ] Invariant cache hit.
[2024-06-01 17:19:21] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-01 17:19:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/75 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:19:21] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/75 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:22] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 39 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1411ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1412ms
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1498 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-08 finished in 1961 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 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 40 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 10 place count 35 transition count 36
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 31 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 27 transition count 32
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 27 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 26 transition count 31
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 18 transition count 23
Applied a total of 43 rules in 12 ms. Remains 18 /41 variables (removed 23) and now considering 23/46 (removed 23) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-06-01 17:19:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 17:19:23] [INFO ] Invariant cache hit.
[2024-06-01 17:19:23] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 17:19:23] [INFO ] Redundant transitions in 16 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-06-01 17:19:23] [INFO ] Computed 5 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 2 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/40 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 29 constraints, problems are : Problem set: 0 solved, 20 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/40 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-01 17:19:23] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 50 constraints, problems are : Problem set: 0 solved, 20 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 627ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/41 places, 22/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 736 ms. Remains : 18/41 places, 22/46 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-09
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-09 finished in 779 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||F(p1)||X(G(p2)))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 3 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-06-01 17:19:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:23] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:19:23] [INFO ] Invariant cache hit.
[2024-06-01 17:19:23] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:19:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:24] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 54 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 40/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 15/15 constraints]
After SMT, in 1733ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1734ms
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1836 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-10
Product exploration explored 100000 steps with 11728 reset in 97 ms.
Product exploration explored 100000 steps with 11736 reset in 112 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 79 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p1)]
Knowledge based reduction with 9 factoid took 247 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 36 /36 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2024-06-01 17:19:27] [INFO ] Invariant cache hit.
[2024-06-01 17:19:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:19:27] [INFO ] Invariant cache hit.
[2024-06-01 17:19:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:19:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 54 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 40/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 15/15 constraints]
After SMT, in 1725ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1726ms
Finished structural reductions in LTL mode , in 1 iterations and 1800 ms. Remains : 36/36 places, 41/41 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/36 stabilizing places and 8/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 79 steps (0 resets) in 6 ms. (11 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F p1)]
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 11724 reset in 72 ms.
Product exploration explored 100000 steps with 11669 reset in 84 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 36 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 36 transition count 41
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 24 place count 28 transition count 33
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 28 transition count 33
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 28 /36 variables (removed 8) and now considering 33/41 (removed 8) transitions.
[2024-06-01 17:19:30] [INFO ] Redundant transitions in 16 ms returned [32]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 31 sub problems to find dead transitions.
// Phase 1: matrix 32 rows 28 cols
[2024-06-01 17:19:30] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/10 constraints. Problems are: Problem set: 8 solved, 23 unsolved
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/12 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 32/60 variables, 28/40 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 40 constraints, problems are : Problem set: 8 solved, 23 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 8 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 7/12 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/40 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 23/63 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 8 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/63 constraints. Problems are: Problem set: 8 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 63 constraints, problems are : Problem set: 8 solved, 23 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 23/31 constraints, Known Traps: 7/7 constraints]
After SMT, in 701ms problems are : Problem set: 8 solved, 23 unsolved
Search for dead transitions found 8 dead transitions in 701ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 28/36 places, 24/41 transitions.
Graph (complete) has 69 edges and 28 vertex of which 20 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 20 /28 variables (removed 8) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/36 places, 24/41 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 739 ms. Remains : 20/36 places, 24/41 transitions.
Support contains 3 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-06-01 17:19:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
[2024-06-01 17:19:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:19:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 54 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1002 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/54 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 40/94 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 96 constraints, problems are : Problem set: 0 solved, 40 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 15/15 constraints]
After SMT, in 1687ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1688ms
Finished structural reductions in LTL mode , in 1 iterations and 1753 ms. Remains : 36/36 places, 41/41 transitions.
Treatment of property ShieldRVs-PT-001B-LTLFireability-10 finished in 9081 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)))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 1 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 35 cols
[2024-06-01 17:19:32] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:32] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 17:19:32] [INFO ] Invariant cache hit.
[2024-06-01 17:19:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-01 17:19:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/75 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 813 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/75 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 39 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1450ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1451ms
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1515 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-11 finished in 1611 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(p1)))'
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 5 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
[2024-06-01 17:19:34] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-01 17:19:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/75 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/75 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 39 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1332ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1333ms
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1405 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-12 finished in 1753 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&&X((!p0 U (G(!p0)||(!p1&&G(F(!p0))))))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 36 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 36 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 35 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 35 transition count 40
Applied a total of 12 rules in 6 ms. Remains 35 /41 variables (removed 6) and now considering 40/46 (removed 6) transitions.
[2024-06-01 17:19:36] [INFO ] Invariant cache hit.
[2024-06-01 17:19:36] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 17:19:36] [INFO ] Invariant cache hit.
[2024-06-01 17:19:36] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-06-01 17:19:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 1 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/75 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 50 constraints, problems are : Problem set: 0 solved, 39 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/75 variables, 35/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 39/89 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 17:19:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/75 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 90 constraints, problems are : Problem set: 0 solved, 39 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 11/11 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1358ms
Starting structural reductions in LTL mode, iteration 1 : 35/41 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1434 ms. Remains : 35/41 places, 40/46 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, p0, p0]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-13
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-13 finished in 1559 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||X(!p0)))||(!p0&&F(G(p1)))))))'
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 37 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 37 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 36 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 36 transition count 41
Applied a total of 10 rules in 4 ms. Remains 36 /41 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 36 cols
[2024-06-01 17:19:37] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 17:19:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 17:19:37] [INFO ] Invariant cache hit.
[2024-06-01 17:19:37] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-06-01 17:19:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/77 variables, 36/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:38] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 53 constraints, problems are : Problem set: 0 solved, 40 unsolved in 974 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/77 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 40/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:19:39] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/77 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 95 constraints, problems are : Problem set: 0 solved, 40 unsolved in 763 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 14/14 constraints]
After SMT, in 1745ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1746ms
Starting structural reductions in LTL mode, iteration 1 : 36/41 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1820 ms. Remains : 36/41 places, 41/46 transitions.
Stuttering acceptance computed with spot in 157 ms :[p0, (AND (NOT p1) p0), (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-15
Product exploration explored 100000 steps with 311 reset in 178 ms.
Stack based approach found an accepted trace after 50111 steps with 135 reset with depth 379 and stack size 146 in 108 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-15 finished in 2291 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((((p0 U p1) U p2)||((p4||G(p1))&&p3))))'
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||F(p1)||X(G(p2)))))'
[2024-06-01 17:19:40] [INFO ] Flatten gal took : 9 ms
[2024-06-01 17:19:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 17:19:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 41 places, 46 transitions and 140 arcs took 3 ms.
Total runtime 37149 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVs-PT-001B-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVs-PT-001B-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717262380718

--------------------
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
mcc2024
ltl formula name ShieldRVs-PT-001B-LTLFireability-02
ltl formula formula --ltl=/tmp/2071/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 41 places, 46 transitions and 140 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2071/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2071/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2071/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2071/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 42 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 42, there are 66 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 168
pnml2lts-mc( 0/ 4): unique states count: 168
pnml2lts-mc( 0/ 4): unique transitions count: 699
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 589
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 239
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 239 states 1021 transitions, fanout: 4.272
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.5 B/state, compr.: 7.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVs-PT-001B-LTLFireability-10
ltl formula formula --ltl=/tmp/2071/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 41 places, 46 transitions and 140 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2071/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2071/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2071/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2071/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 43 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 42, there are 69 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 69
pnml2lts-mc( 0/ 4): unique states count: 69
pnml2lts-mc( 0/ 4): unique transitions count: 166
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 201
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 158
pnml2lts-mc( 0/ 4): - cum. max stack depth: 75
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 158 states 486 transitions, fanout: 3.076
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.1 B/state, compr.: 11.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 46 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-001B, 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 r528-tall-171683761700716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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