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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 187K Apr 11 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 17K 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 ShieldIIPs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716876392135

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 06:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:06:33] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-28 06:06:33] [INFO ] Transformed 63 places.
[2024-05-28 06:06:33] [INFO ] Transformed 62 transitions.
[2024-05-28 06:06:33] [INFO ] Found NUPN structural information;
[2024-05-28 06:06:33] [INFO ] Parsed PT model containing 63 places and 62 transitions and 184 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-001B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-001B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 61
Applied a total of 2 rules in 20 ms. Remains 62 /63 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 62 cols
[2024-05-28 06:06:33] [INFO ] Computed 10 invariants in 7 ms
[2024-05-28 06:06:33] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-28 06:06:33] [INFO ] Invariant cache hit.
[2024-05-28 06:06:33] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:06:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 8 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 06:06:34] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/123 variables, 62/97 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:06:35] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:36] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 102 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2742 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 61/123 variables, 62/102 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 60/162 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 4 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:06:37] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 170 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2100 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 38/38 constraints]
After SMT, in 4882ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4896ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 61/62 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5219 ms. Remains : 62/63 places, 61/62 transitions.
Support contains 34 out of 62 places after structural reductions.
[2024-05-28 06:06:38] [INFO ] Flatten gal took : 28 ms
[2024-05-28 06:06:38] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:06:38] [INFO ] Input system was already deterministic with 61 transitions.
Support contains 33 out of 62 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 684 ms. (58 steps per ms) remains 1/29 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-05-28 06:06:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/62 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/123 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/123 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/62 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 06:06:39] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:39] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:39] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:39] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 61/123 variables, 62/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 61/61 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 62 transition count 56
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 56 transition count 50
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 51 transition count 50
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 46 transition count 45
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 46 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 32 place count 46 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 44 transition count 43
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 66 place count 29 transition count 28
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 71 place count 29 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 28 transition count 27
Applied a total of 72 rules in 18 ms. Remains 28 /62 variables (removed 34) and now considering 27/61 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 28/62 places, 27/61 transitions.
RANDOM walk for 40000 steps (8 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4057 states, properties seen :0
Probabilistic random walk after 17545 steps, saw 4057 distinct states, run finished after 40 ms. (steps per millisecond=438 ) properties seen :0
Explored full state space saw : 4057 states, properties seen :0
Exhaustive walk after 17545 steps, saw 4057 distinct states, run finished after 16 ms. (steps per millisecond=1096 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 16 stabilizing places and 16 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)&&(!p0 U (p1||G(!p0)))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 55 transition count 48
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 43 transition count 42
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 43 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 36 place count 43 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 40 transition count 39
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 26 transition count 26
Applied a total of 68 rules in 9 ms. Remains 26 /62 variables (removed 36) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-28 06:06:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 06:06:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 06:06:40] [INFO ] Invariant cache hit.
[2024-05-28 06:06:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:06:40] [INFO ] Redundant transitions in 30 ms returned [25]
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 24 sub problems to find dead transitions.
// Phase 1: matrix 25 rows 26 cols
[2024-05-28 06:06:40] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:06:40] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:06:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/51 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 37 constraints, problems are : Problem set: 0 solved, 24 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 25/51 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 61 constraints, problems are : Problem set: 0 solved, 24 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/62 places, 25/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 664 ms. Remains : 26/62 places, 25/61 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-00
Stuttering criterion allowed to conclude after 887 steps with 23 reset in 11 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-00 finished in 956 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 (G(!p0)||(!p0&&X(p1)&&F(p2)))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 56/61 (removed 5) transitions.
// Phase 1: matrix 56 rows 57 cols
[2024-05-28 06:06:41] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:06:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-28 06:06:41] [INFO ] Invariant cache hit.
[2024-05-28 06:06:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 55 sub problems to find dead transitions.
[2024-05-28 06:06:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:41] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:42] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 85 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2077 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 56/113 variables, 57/90 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 55/145 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:06:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 4/149 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-05-28 06:06:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 150 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2059 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 28/28 constraints]
After SMT, in 4145ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 4146ms
Starting structural reductions in LTL mode, iteration 1 : 57/62 places, 56/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4230 ms. Remains : 57/62 places, 56/61 transitions.
Stuttering acceptance computed with spot in 156 ms :[p0, true, (AND p0 (NOT p1)), (AND (NOT p2) p0), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-01
Product exploration explored 100000 steps with 40024 reset in 153 ms.
Product exploration explored 100000 steps with 39952 reset in 116 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/57 stabilizing places and 13/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 19 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-001B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLFireability-01 finished in 4707 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&&G(F(p1)))))'
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 55 transition count 48
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 49 transition count 48
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 44 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 41 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 27 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 26 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 25 transition count 25
Applied a total of 70 rules in 14 ms. Remains 25 /62 variables (removed 37) and now considering 25/61 (removed 36) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-05-28 06:06:45] [INFO ] Computed 9 invariants in 2 ms
[2024-05-28 06:06:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 06:06:45] [INFO ] Invariant cache hit.
[2024-05-28 06:06:45] [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.
[2024-05-28 06:06:45] [INFO ] Redundant transitions in 13 ms returned []
Running 24 sub problems to find dead transitions.
[2024-05-28 06:06:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:06:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 25/50 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 38 constraints, problems are : Problem set: 0 solved, 24 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 62 constraints, problems are : Problem set: 0 solved, 24 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 4/4 constraints]
After SMT, in 491ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 492ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/62 places, 25/61 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 25/62 places, 25/61 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-02
Stuttering criterion allowed to conclude after 2784 steps with 39 reset in 8 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-02 finished in 765 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||F(p1))&&(F(p1)||X(p2))))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 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 62 transition count 56
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 12 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 29 place count 45 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 45 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 34 place count 45 transition count 41
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 42 transition count 41
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 66 place count 29 transition count 28
Applied a total of 66 rules in 17 ms. Remains 29 /62 variables (removed 33) and now considering 28/61 (removed 33) transitions.
// Phase 1: matrix 28 rows 29 cols
[2024-05-28 06:06:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 06:06:46] [INFO ] Implicit Places using invariants in 54 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/62 places, 28/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 28/62 places, 28/61 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-03
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-03 finished in 216 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)||G(p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 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 61 transition count 55
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 45 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 45 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 32 place count 45 transition count 43
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 34 place count 44 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 62 place count 30 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 29 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 28 transition count 28
Applied a total of 64 rules in 12 ms. Remains 28 /62 variables (removed 34) and now considering 28/61 (removed 33) transitions.
// Phase 1: matrix 28 rows 28 cols
[2024-05-28 06:06:46] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 06:06:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 06:06:46] [INFO ] Invariant cache hit.
[2024-05-28 06:06:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 06:06:46] [INFO ] Redundant transitions in 12 ms returned [27]
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 25 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-05-28 06:06:46] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-28 06:06:46] [INFO ] Deduced a trap composed of 6 places in 12 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 27/55 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 39 constraints, problems are : Problem set: 0 solved, 25 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 27/55 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/55 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 66 constraints, problems are : Problem set: 0 solved, 25 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 4/4 constraints]
After SMT, in 704ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 704ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/62 places, 27/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 794 ms. Remains : 28/62 places, 27/61 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-04
Product exploration explored 100000 steps with 185 reset in 205 ms.
Stack based approach found an accepted trace after 47 steps with 0 reset with depth 48 and stack size 48 in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-04 finished in 1048 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 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 62 transition count 56
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 12 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 24 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 30 place count 44 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 36 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 36 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 41 transition count 40
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 66 place count 29 transition count 28
Applied a total of 66 rules in 6 ms. Remains 29 /62 variables (removed 33) and now considering 28/61 (removed 33) transitions.
// Phase 1: matrix 28 rows 29 cols
[2024-05-28 06:06:47] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:06:47] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 06:06:47] [INFO ] Invariant cache hit.
[2024-05-28 06:06:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:06:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-28 06:06:47] [INFO ] Redundant transitions in 12 ms returned [27]
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 26 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 29 cols
[2024-05-28 06:06:47] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:06:47] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:06:48] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 51 constraints, problems are : Problem set: 0 solved, 26 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 26 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 9/9 constraints]
After SMT, in 807ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/62 places, 27/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 902 ms. Remains : 29/62 places, 27/61 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-05
Stuttering criterion allowed to conclude after 167 steps with 1 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-05 finished in 984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 8 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:06:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:06:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 06:06:48] [INFO ] Invariant cache hit.
[2024-05-28 06:06:48] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 06:06:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:49] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 55/111 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 77 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/77 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:06:50] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:51] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:51] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 139 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2072 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 19/19 constraints]
After SMT, in 3240ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3241ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3323 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-06 finished in 3474 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(F(p1)))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 54
Applied a total of 14 rules in 5 ms. Remains 55 /62 variables (removed 7) and now considering 54/61 (removed 7) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:06:52] [INFO ] Computed 10 invariants in 2 ms
[2024-05-28 06:06:52] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 06:06:52] [INFO ] Invariant cache hit.
[2024-05-28 06:06:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:06:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 06:06:52] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1429 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 2 ms to minimize.
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:53] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-28 06:06:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 2016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3452ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3453ms
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 54/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3529 ms. Remains : 55/62 places, 54/61 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Product exploration explored 100000 steps with 33333 reset in 87 ms.
Computed a total of 11 stabilizing places and 11 stable transitions
Computed a total of 11 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-001B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLFireability-07 finished in 3858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(p1 U (G(p1)||(p1&&(p2 U !p3)))))))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 56
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 56 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 56 transition count 55
Applied a total of 12 rules in 7 ms. Remains 56 /62 variables (removed 6) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 56 cols
[2024-05-28 06:06:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:06:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 06:06:56] [INFO ] Invariant cache hit.
[2024-05-28 06:06:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-28 06:06:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 2 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-28 06:06:56] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 55/111 variables, 56/88 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:57] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 06:06:57] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 91 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1803 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 55/111 variables, 56/91 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 54/145 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:06:58] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-05-28 06:06:58] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 148 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 28/28 constraints]
After SMT, in 3405ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3406ms
Starting structural reductions in LTL mode, iteration 1 : 56/62 places, 55/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3484 ms. Remains : 56/62 places, 55/61 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (OR (NOT p0) p3), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) p3))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-08 finished in 3789 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 4 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 55 transition count 49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 44 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 41 transition count 40
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 26 transition count 26
Applied a total of 68 rules in 8 ms. Remains 26 /62 variables (removed 36) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 26 cols
[2024-05-28 06:06:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 06:06:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 06:06:59] [INFO ] Invariant cache hit.
[2024-05-28 06:06:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 06:06:59] [INFO ] Redundant transitions in 11 ms returned [25]
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 25 rows 26 cols
[2024-05-28 06:06:59] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-28 06:06:59] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 36 constraints, problems are : Problem set: 0 solved, 23 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 59 constraints, problems are : Problem set: 0 solved, 23 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 407ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/62 places, 25/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 494 ms. Remains : 26/62 places, 25/61 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-09
Product exploration explored 100000 steps with 14758 reset in 72 ms.
Product exploration explored 100000 steps with 14815 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 24 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-28 06:07:00] [INFO ] Invariant cache hit.
[2024-05-28 06:07:00] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-28 06:07:00] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-28 06:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-28 06:07:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 06:07:00] [INFO ] Computed and/alt/rep : 23/49/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 06:07:00] [INFO ] Added : 23 causal constraints over 5 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-05-28 06:07:00] [INFO ] Invariant cache hit.
[2024-05-28 06:07:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-28 06:07:00] [INFO ] Invariant cache hit.
[2024-05-28 06:07:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 06:07:01] [INFO ] Redundant transitions in 10 ms returned []
Running 23 sub problems to find dead transitions.
[2024-05-28 06:07:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-28 06:07:01] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 36 constraints, problems are : Problem set: 0 solved, 23 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 25/51 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 59 constraints, problems are : Problem set: 0 solved, 23 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 26/26 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
[2024-05-28 06:07:01] [INFO ] Invariant cache hit.
[2024-05-28 06:07:01] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-28 06:07:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 06:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 06:07:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-28 06:07:01] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-28 06:07:01] [INFO ] Computed and/alt/rep : 23/49/23 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-28 06:07:01] [INFO ] Added : 23 causal constraints over 5 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14788 reset in 104 ms.
Product exploration explored 100000 steps with 14773 reset in 112 ms.
Built C files in :
/tmp/ltsmin10836345449496915481
[2024-05-28 06:07:02] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2024-05-28 06:07:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:07:02] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2024-05-28 06:07:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:07:02] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2024-05-28 06:07:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 06:07:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10836345449496915481
Running compilation step : cd /tmp/ltsmin10836345449496915481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 214 ms.
Running link step : cd /tmp/ltsmin10836345449496915481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10836345449496915481;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7551771674343128504.hoa' '--buchi-type=spotba'
LTSmin run took 274 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-001B-LTLFireability-09 finished in 2833 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(F(p1))||p0)))'
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 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 61 transition count 56
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 57 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 45 transition count 44
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 45 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 32 place count 45 transition count 43
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 34 place count 44 transition count 43
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 62 place count 30 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 29 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 28 transition count 28
Applied a total of 64 rules in 10 ms. Remains 28 /62 variables (removed 34) and now considering 28/61 (removed 33) transitions.
// Phase 1: matrix 28 rows 28 cols
[2024-05-28 06:07:02] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 06:07:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-28 06:07:02] [INFO ] Invariant cache hit.
[2024-05-28 06:07:02] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-28 06:07:02] [INFO ] Redundant transitions in 10 ms returned [27]
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 26 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 28 cols
[2024-05-28 06:07:02] [INFO ] Computed 9 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-28 06:07:02] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:02] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 27/55 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 39 constraints, problems are : Problem set: 0 solved, 26 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 27/55 variables, 28/39 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 0 solved, 26 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 558ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/62 places, 27/61 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 646 ms. Remains : 28/62 places, 27/61 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-001B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-001B-LTLFireability-11 finished in 873 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(F((p0&&F(p1)))))))'
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 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 61 transition count 55
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 56 transition count 55
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 56 transition count 49
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 44 transition count 43
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 34 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 41 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 27 transition count 26
Applied a total of 68 rules in 12 ms. Remains 27 /62 variables (removed 35) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 27 cols
[2024-05-28 06:07:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:07:03] [INFO ] Implicit Places using invariants in 28 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/62 places, 26/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 26/62 places, 26/61 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-12
Stuttering criterion allowed to conclude after 590 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-12 finished in 152 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 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 61 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 55 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 55 transition count 49
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 22 place count 50 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 27 place count 45 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 32 place count 45 transition count 44
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 32 place count 45 transition count 41
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 66 place count 28 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 27 transition count 26
Applied a total of 67 rules in 5 ms. Remains 27 /62 variables (removed 35) and now considering 26/61 (removed 35) transitions.
// Phase 1: matrix 26 rows 27 cols
[2024-05-28 06:07:03] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:03] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 06:07:03] [INFO ] Invariant cache hit.
[2024-05-28 06:07:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-28 06:07:03] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-28 06:07:03] [INFO ] Redundant transitions in 13 ms returned [25]
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 24 sub problems to find dead transitions.
// Phase 1: matrix 25 rows 27 cols
[2024-05-28 06:07:03] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 06:07:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2024-05-28 06:07:03] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-28 06:07:03] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 25/52 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 24 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 25/52 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 67 constraints, problems are : Problem set: 0 solved, 24 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 27/27 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 521ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/62 places, 25/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 602 ms. Remains : 27/62 places, 25/61 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-13
Stuttering criterion allowed to conclude after 481 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-13 finished in 643 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)&&X((p1&&G(p2)))))'
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 61/61 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 55
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 54
Applied a total of 14 rules in 4 ms. Remains 55 /62 variables (removed 7) and now considering 54/61 (removed 7) transitions.
// Phase 1: matrix 54 rows 55 cols
[2024-05-28 06:07:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 06:07:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 06:07:04] [INFO ] Invariant cache hit.
[2024-05-28 06:07:04] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 53 sub problems to find dead transitions.
[2024-05-28 06:07:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:04] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 06:07:05] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:05] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 54/109 variables, 55/77 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:05] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 06:07:05] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 79 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 14/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 54/109 variables, 55/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 53/135 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 06:07:06] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-28 06:07:07] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 06:07:07] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (OVERLAPS) 0/109 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 143 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1991 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 25/25 constraints]
After SMT, in 3413ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 3415ms
Starting structural reductions in LTL mode, iteration 1 : 55/62 places, 54/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3513 ms. Remains : 55/62 places, 54/61 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-001B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-001B-LTLFireability-14 finished in 3703 ms.
All properties solved by simple procedures.
Total runtime 34804 ms.

BK_STOP 1716876428083

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPs-PT-001B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldIIPs-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 r356-tall-171683760200012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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